Computational cost of the Fekete problem I: The Forces Method on the 2-sphere

被引:12
作者
Bendito, E. [1 ]
Carmona, A. [1 ]
Encinas, A. M. [1 ]
Gesto, J. M. [1 ]
Gomez, A. [2 ]
Mourino, C. [2 ]
Sanchez, M. T. [2 ]
机构
[1] Univ Politecn Cataluna, Dept Matemat Aplicada 3, Barcelona, Spain
[2] CESGA, Fdn Ctr Tecnol Supercomputac Galicia, Santiago De Compostela, Spain
关键词
Fekete points; Computational complexity; Nonlinear optimization; GLOBAL OPTIMIZATION; SETS; POINTS; ENERGY;
D O I
10.1016/j.jcp.2009.01.021
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Here, we study the computational complexity of the Fekete point problem. Namely, we give an exhaustive description of the main properties of an algorithm for the minimization of the logarithmic potential energy on the 2-sphere, and we characterize the probability distribution of the cost of the different minima. In particular, we show that a local minimum can be found with an average cost of about O(N-2.8). (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码:3288 / 3306
页数:19
相关论文
共 31 条
[11]   Crystalline order on Riemannian manifolds with variable Gaussian curvature and boundary [J].
Giomi, Luca ;
Bowick, Mark .
PHYSICAL REVIEW B, 2007, 76 (05)
[12]  
HAIRER E, 1996, RADAUS VERSION
[13]  
Hardin D., 2004, AMS, V51, P1186
[14]   Minimal Riesz energy point configurations for rectifiable d-dimensional manifolds [J].
Hardin, DP ;
Saff, EB .
ADVANCES IN MATHEMATICS, 2005, 193 (01) :174-204
[15]   From electrostatics to almost optimal nodal sets for polynomial interpolation in a simplex [J].
Hesthaven, JS .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1998, 35 (02) :655-676
[16]   A NEW SERIES OF CONJECTURES AND OPEN QUESTIONS IN OPTIMIZATION AND MATRIX ANALYSIS [J].
Hiriart-Urruty, Jean-Baptiste .
ESAIM-CONTROL OPTIMISATION AND CALCULUS OF VARIATIONS, 2009, 15 (02) :454-470
[17]   Approximation of the equilibrium distribution by distributions of equal point charges with minimal energy [J].
Korevaar, J ;
Monterie, MA .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1998, 350 (06) :2329-2348
[18]  
MORRIS JM, 1986, COMMUN PURE APPL MAT, V39, P149
[19]   Packing up to 50 equal circles in a square [J].
Nurmela, KJ ;
Ostergard, PRJ .
DISCRETE & COMPUTATIONAL GEOMETRY, 1997, 18 (01) :111-120
[20]   Upper bounds for covering arrays by tabu search [J].
Nurmela, KJ .
DISCRETE APPLIED MATHEMATICS, 2004, 138 (1-2) :143-152