Preconditioned conjugate gradient method for the sparse generalized eigenvalue problem in electronic structure calculations (Q5934196): Difference between revisions
From MaRDI portal
Revision as of 17:31, 3 June 2024
scientific article; zbMATH DE number 1606130
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Preconditioned conjugate gradient method for the sparse generalized eigenvalue problem in electronic structure calculations |
scientific article; zbMATH DE number 1606130 |
Statements
Preconditioned conjugate gradient method for the sparse generalized eigenvalue problem in electronic structure calculations (English)
0 references
19 December 2001
0 references
The paper is inspired by the needs of solid state physics (the lowest few energies and wave functions of the chlorine molecule and of a 64-atomic silicon crystal are calculated for illustration). Its physical background is the density-functional theory represented in localized (non-orthogonal) basis. The algorithm offered is an iterative one, making an ample use of the sparsity of the matrices in question (first of all, via a one-parametric family of the kinetic-energy preconditionings). Empirically, the convergence appears to be linear.
0 references
conjugate gradient method
0 references
generalized eigenvalue problem
0 references
preconditioning
0 references
the first few lowest eigensolutions
0 references
application to electronic structure
0 references
chlorine molecule
0 references
silicon crystal
0 references
density functional approach
0 references
localised basis set
0 references
algorithm
0 references
convergence
0 references
0 references
