Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices (Q1206584)

From MaRDI portal
Revision as of 14:35, 17 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
scientific article

    Statements

    Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices (English)
    0 references
    0 references
    0 references
    0 references
    1 April 1993
    0 references
    The configuration interaction method is used to calculate electronic wavefunctions for the ground state and excited states of atoms and molecules. It leads to the formation of a large, real, symmetric matrix for which the lowest eigenvalues and associated eigenvectors must be found. The Davidson algorithm is the most widely used approach for matrices of this type. A number of improvements to the usual implementation of that algorithm are discussed and some results are presented. The quasi degenerate variational perturbation theory, which is an alternative method for calculating electronic wavefunctions, is also considered. The similarities and differences between this approach and the Davidson algorithm are discussed. Some results that compare the performance of the two algorithms for similar matrices are given.
    0 references
    0 references
    configuration interaction method
    0 references
    electronic wavefunctions
    0 references
    large, real, symmetric matrix
    0 references
    lowest eigenvalues
    0 references
    eigenvectors
    0 references
    Davidson algorithm
    0 references
    quasi degenerate variational perturbation theory
    0 references
    performance
    0 references

    Identifiers