Title of article
Computational cost of the Fekete problem I: The Forces Method on the 2-sphere
Author/Authors
Bendito، نويسنده , , E. and Carmona، نويسنده , , A. M. Encinas، نويسنده , , A.M. and Gesto، نويسنده , , J.M. and Gَmez Ribelles، نويسنده , , A. and Mouriٌo، نويسنده , , C. and Sلnchez، نويسنده , , M.T.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
19
From page
3288
To page
3306
Abstract
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 ) .
Keywords
Fekete points , nonlinear optimization , computational complexity
Journal title
Journal of Computational Physics
Serial Year
2009
Journal title
Journal of Computational Physics
Record number
1481418
Link To Document