An object-oriented C++ implementation of Davidson method for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix

Abstract
A C++ class named Davidson is presented for determining a few eigenpairs with lowest or alternatively highest values of a large, real, symmetric matrix. The algorithm described by Stathopoulos and Fischer is used. The exception mechanism is involved to report the errors. The class is written in ANSI C++, so it is fully portable. In addition a console program as well as a program with graphical user interface for Microsoft Windows is attached, which allow one to calculate the lowest eigenstate...

Title of program: Davidson
Catalogue Id: ADZM_v1_0

Nature of problem
Finding a few extreme eigenpairs of a real, symmetric, sparse matrix. Examples in quantum optics (interaction of matter with a laser field).

Versions of this program held in the CPC repository in Mendeley Data
ADZM_v1_0; Davidson; 10.1016/j.cpc.2007.06.003

This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)