The Davidson algorithm needs an initial search space,
the base class will provide a second interface computeWithGuess which adds another input parameter consisting of a matrix containing the initial search space as columns. If compute is called a default search space is set up using unitvectors from sorting the diagonal entries.
The Davidson algorithm needs an initial search space,
the base class will provide a second interface
computeWithGuess
which adds another input parameter consisting of a matrix containing the initial search space as columns. Ifcompute
is called a default search space is set up using unitvectors from sorting the diagonal entries.