0

Do any standard (LAPACK / ARPACK / etc) implementations of the symmetric eigenvalue problem allow "warm starting"? That is, can they be accelerated if I already have a pretty good guess for the eigenvalues and eigenvectors of my matrix.

With Rayleigh quotient iteration or power iteration, this should be pretty obvious, but I don't see how to do this with standard eigensolver software. I'd prefer not to write my own eigensolver.

Robert T. McGibbon
  • 5,075
  • 3
  • 37
  • 45

1 Answers1

2

What you need is an iterative eigenvalue solve algorithm.

  • LAPACK uses a direct eigensolver and having an estimation of eigenvectors is of no use. There is a QR iterative refinement in its routines. However It requires Hessenberg matrices. I do not think you could use these routines.
  • You could use ARPACK library, specify the starting vector a set info argument equal to one.
  • Also I suggest to reconsider writing your own QR solver. It is very simple.

A basic QR implementation using lapack could be:

Initialize Q, A
repeat
  QR = A (dgeqrf)
  A = RQ (dormqr)
until convergence (dnrm2)
ztik
  • 3,482
  • 16
  • 34