{"title":"Efficient simulations of Hartree-Fock equations by an accelerated gradient descent method.","authors":"Y Ohno, A Del Maestro, T I Lakoba","doi":"10.1103/PhysRevE.110.055304","DOIUrl":null,"url":null,"abstract":"<p><p>We develop convergence acceleration procedures that enable a gradient descent-type iteration method to efficiently simulate Hartree-Fock equations for many particles interacting both with each other and with an external potential. Our development focuses on three aspects: (i) optimization of a parameter in the preconditioning operator; (ii) adoption of a technique that eliminates the slowest-decaying mode to the case of many equations (describing many particles); and (iii) a novel extension of the above technique that allows one to eliminate multiple modes simultaneously. We illustrate performance of the numerical method for the two-dimensional model of the first layer of helium atoms above a graphene sheet. We demonstrate that incorporation of aspects (i) and (ii) above into the \"plain\" gradient descent method accelerates it by at least two orders of magnitude, and often by much more. Aspect (iii)-the multiple-mode elimination-may bring further improvement to the convergence rate compared to aspect (ii), the single-mode elimination. Both single- and multiple-mode elimination techniques are shown to significantly outperform the well-known Anderson Acceleration. We believe that our acceleration techniques can also be employed by other iterative methods, especially those handling hard-core-type interaction of many particles.</p>","PeriodicalId":20085,"journal":{"name":"Physical review. E","volume":"110 5-2","pages":"055304"},"PeriodicalIF":2.4000,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Physical review. E","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1103/PhysRevE.110.055304","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0
Abstract
We develop convergence acceleration procedures that enable a gradient descent-type iteration method to efficiently simulate Hartree-Fock equations for many particles interacting both with each other and with an external potential. Our development focuses on three aspects: (i) optimization of a parameter in the preconditioning operator; (ii) adoption of a technique that eliminates the slowest-decaying mode to the case of many equations (describing many particles); and (iii) a novel extension of the above technique that allows one to eliminate multiple modes simultaneously. We illustrate performance of the numerical method for the two-dimensional model of the first layer of helium atoms above a graphene sheet. We demonstrate that incorporation of aspects (i) and (ii) above into the "plain" gradient descent method accelerates it by at least two orders of magnitude, and often by much more. Aspect (iii)-the multiple-mode elimination-may bring further improvement to the convergence rate compared to aspect (ii), the single-mode elimination. Both single- and multiple-mode elimination techniques are shown to significantly outperform the well-known Anderson Acceleration. We believe that our acceleration techniques can also be employed by other iterative methods, especially those handling hard-core-type interaction of many particles.
期刊介绍:
Physical Review E (PRE), broad and interdisciplinary in scope, focuses on collective phenomena of many-body systems, with statistical physics and nonlinear dynamics as the central themes of the journal. Physical Review E publishes recent developments in biological and soft matter physics including granular materials, colloids, complex fluids, liquid crystals, and polymers. The journal covers fluid dynamics and plasma physics and includes sections on computational and interdisciplinary physics, for example, complex networks.