An iterative procedure for finding locally and globally optimal arrangements of particles on the unit sphere

DOI10.1016/j.cpc.2018.03.029OpenAlexW2805671489WikidataQ129743635 ScholiaQ129743635MaRDI QIDQ6155420

Alexei F. Cheviakov, Wesley J. M. Ridgway

Publication date: 12 June 2023

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cpc.2018.03.029

zbMATH Keywords

steepest descentpacking problemoptimal configurationCoulomb energynarrow escapenarrow capturelocal/global optimizationpairwise energy

Mathematics Subject Classification ID

Biology and other natural sciences (92-XX) Calculus of variations and optimal control; optimization (49-XX)

Related Items

A Lagrangian formulation for interacting particles on a deformable medium ⋮ Use of projective coordinate descent in the Fekete problem

Cites Work

• Genetic algorithms and very fast simulated reannealing: A comparison
• Escape through a small opening: receptor trafficking in a synaptic membrane
• An Asymptotic Analysis of the Mean First Passage Time for Narrow Escape Problems: Part I: Two-Dimensional Domains
• An Asymptotic Analysis of the Mean First Passage Time for Narrow Escape Problems: Part II: The Sphere
• Modern Trends in Constructive Function Theory
• The Tammes Problem for N = 14
• Universally optimal distribution of points on spheres
• Updating Quasi-Newton Matrices with Limited Storage
• Equilibrium configurations of particles on a sphere: the case of logarithmic interactions
• First Passage Statistics for the Capture of a Brownian Particle by a Structured Spherical Target with Multiple Surface Traps

This page was built for publication: An iterative procedure for finding locally and globally optimal arrangements of particles on the unit sphere