Volume 46, Number 5, September-October 2012
|Page(s)||1055 - 1080|
|Published online||13 February 2012|
s∗-compressibility of the discrete Hartree-Fock equation
Institut für Mathematik, Technische Universität Berlin,
Straße des 17. Juni
Received: 17 December 2010
Revised: 4 October 2011
The Hartree-Fock equation is widely accepted as the basic model of electronic structure calculation which serves as a canonical starting point for more sophisticated many-particle models. We have studied the s∗-compressibility for Galerkin discretizations of the Hartree-Fock equation in wavelet bases. Our focus is on the compression of Galerkin matrices from nuclear Coulomb potentials and nonlinear terms in the Fock operator which hitherto has not been discussed in the literature. It can be shown that the s∗-compressibility is in accordance with convergence rates obtained from best N-term approximation for solutions of the Hartree-Fock equation. This is a necessary requirement in order to achieve numerical solutions for these equations with optimal complexity using the recently developed adaptive wavelet algorithms of Cohen, Dahmen and DeVore.
Mathematics Subject Classification: 65Z05 / 35Q40 / 35C20 / 35J10
Key words: Hartree-Fock equation / matrix compression / bestN-term approximation
© EDP Sciences, SMAI, 2012
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.