Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
521622 | Journal of Computational Physics | 2009 | 19 Pages |
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(N2.8)O(N2.8).
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
E. Bendito, A. Carmona, A.M. Encinas, J.M. Gesto, A. Gómez, C. Mouriño, M.T. Sánchez,