Imperial College London
Alternate

ProfessorPierreDegond

Faculty of Natural Sciences, Department of Mathematics

Visiting Professor
 
 
 
//

Contact

 

p.degond Website

 
 
//

Location

 

Huxley BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@article{Degond:2016:10.1016/j.jcp.2016.11.047,
author = {Degond, PAA and Ferreira, MA and Motsch, S},
doi = {10.1016/j.jcp.2016.11.047},
journal = {Journal of Computational Physics},
pages = {47--65},
title = {Damped Arrow-Hurwicz algorithm for sphere packing},
url = {http://dx.doi.org/10.1016/j.jcp.2016.11.047},
volume = {332},
year = {2016}
}
Download

RIS format (EndNote, RefMan)

TY  - JOUR
AB  - We consider algorithms that, from an arbitrarily sampling ofNspheres(possibly overlapping),  nd a close packed con guration without overlapping.These problems can be formulated as minimization problems with non-convexconstraints. For such packing problems, we observe that the classical iterativeArrow-Hurwicz algorithm does not converge.  We derive a novel algorithmfrom a multi-step variant of the Arrow-Hurwicz scheme with damping.  Wecompare  this  algorithm  with  classical  algorithms  belonging  to  the  class  oflinearly constrained Lagrangian methods and show that it performs better.We provide an analysis of the convergence of these algorithms in the simplecase  of  two  spheres  in  one  spatial  dimension.   Finally,  we  investigate  thebehaviour of our algorithm when the number of spheres is large in two andthree spatial dimensions.
AU  - Degond,PAA
AU  - Ferreira,MA
AU  - Motsch,S
DO  - 10.1016/j.jcp.2016.11.047
EP  - 65
PY  - 2016///
SN  - 1090-2716
SP  - 47
TI  - Damped Arrow-Hurwicz algorithm for sphere packing
T2  - Journal of Computational Physics
UR  - http://dx.doi.org/10.1016/j.jcp.2016.11.047
UR  - http://hdl.handle.net/10044/1/42851
VL  - 332
ER  -
Download