Improvement of a domain decomposition method for electronic structures calculation
Description
This work is about a domain decomposition method for electronic structure computations, with Hartree-Fock or DFT (Density Functional Theory) models. Usually, the numerical simulation of these models involve the solution of a generalized eigenvalue problem, which is a bottleneck due to the cubic scaling of the number of operations. The MDD (Multilevel Domain Decomposition) method, that have been introduced in a previous PhD (Maxime Barrault, 2005), replace the generalized eigenvalue problem with a constrained minimization problem, for which it is easier to take benefit of the localization properties of the solution. Results produced by the present work are : - the numerical analysis of the algorithm : a local convergence result has been proved, on a simplified instance of the problem that exhibits the same mathematical difficulties ; - improvement of speed and accuracy, with one-dimensional sub-domain arrangements, as well as demonstration of scalability up to one thousand processors; - extension of the algorithm and its numerical implementation to cases with 2D/3D subdomains arrangement. (author)
Abstract (French)
Le travail a porte sur le developpement d'une methode de decomposition de domaine pour le calcul de structures electroniques avec les modeles de Hartree-Fock ou DFT (Density Functional Theory). La simulation de ces modeles passe traditionnellement par la resolution d'un probleme aux valeurs propres generalise, dont la complexite cubique est un verrou pour pouvoir traiter un grand nombre d'atomes. La methode MDD (Multilevel Domain Decomposition), introduite au cours de la these de Maxime Barrault (2005), est une alternative a cette etape bloquante. Elle consiste a se ramener a un probleme de minimisation sous contraintes ou on peut exploiter les proprietes de localisation de la solution. Les resultats acquis au cours de la presente these sont : - l'analyse numerique de la methode : on a montre, sur un probleme simplifie presentant les memes difficultes mathematiques, un resultat de convergence locale de l'algorithme ; - l'augmentation de la vitesse de calcul et de la precision, pour les repartitions '1D' des sous-domaines, ainsi que la demonstration de la scalabilite jusqu'a 1000 processeurs ; - l'extension de l'algorithme et de l'implementation aux cas ou les sous-domaines sont repartis en '2D/3D'. (auteur)Files
54049244.pdf
Files
(1.1 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:019e94af0bc474fed5b2b5dd535aeca3
|
1.1 MB | Preview Download |
Additional details
Additional titles
- Original title (French)
- Amelioration d'une methode de decomposition de domaine pour le calcul de structures electroniques
Publishing Information
- Imprint Pagination
- 158 p.
- Report number
- FRNC-TH--14287
INIS
- Country of Publication
- France
- Country of Input or Organization
- France
- INIS RN
- 54049244
- Subject category
- S97: MATHEMATICAL METHODS AND COMPUTING; S74: ATOMIC AND MOLECULAR PHYSICS;
- Resource subtype / Literary indicator
- Thesis
- Descriptors DEI
- ALGORITHMS; COMPUTERIZED SIMULATION; CONVERGENCE; DENSITY FUNCTIONAL METHOD; DISTRIBUTED DATA PROCESSING; EIGENVALUES; ELECTRONIC STRUCTURE; HARTREE-FOCK METHOD; MINIMIZATION; ORTHOGONAL TRANSFORMATIONS; PARALLEL PROCESSING
- Descriptors DEC
- APPROXIMATIONS; CALCULATION METHODS; DATA PROCESSING; MATHEMATICAL LOGIC; OPTIMIZATION; PROCESSING; PROGRAMMING; SIMULATION; TRANSFORMATIONS; VARIATIONAL METHODS
Optional Information
- Notes
- 121 refs.; Available from the INIS Liaison Officer for France, see the INIS website for current contact and E-mail addresses