Jacobi-Davidson packages
The Jacobi-Davidson method for eigenproblems
The Jacobi-Davidson method is an iterative subspace method
for computing one or more eigenvalues and eigenvectors
of an eigenproblem. The Jacobi-Davidson (JD) method has been
developed by Gerard
Sleijpen
and Henk van der Vorst.
The JDQR and JDQZ methods, by Diederik Fokkema, Gerard Sleijpen and
Henk van der Vorst, are based on the JD method. In these methods
an effective restart strategy is incorporated.
JDQR computes solutions of the standard eigenproblem and JDQZ
computes solutions of the generalized eigenproblem.
Currently two Jacobi-Davidson packages are available.
Jacobi-Davidson packages
- Matlab® 5.1 implementation of JDQR
This code can be found on the
JDQR page of Gerard Sleijpen.
- Matlab® 5.1 implementation of JDQZ
This code can be found on the
JDQZ page of Gerard Sleijpen.
- Fortran 77 implementation of JDQZ
In Fortran 77 only the JDQZ algorithm for the
generalized eigenproblem is available.
More information about the package
can be found in the manual by
Diederik Fokkema and Martin van Gijzen.
Obtaining the code
To obtain the Fortran 77 code you can send an e-mail to
Henk van der Vorst,
<vorst@math.uu.nl>.
The files will be sent as
jdqz.tar.gz.uue . With the commands
uudecode, gunzip and
tar xvf
the .f (Fortran) files can be extracted.
Note that the Fortran code is provided
on an "as is" basis. The authors provide no
warranty whatsoever, either expressed or implied, regarding the work,
including warranties with respect to its merchantability or fitness
for any particular purpose. Moreover, note that permission to copy
all or part of this code is granted, provided
that the copies are not made or distributed for resale.
Page design: Henk van der Vorst
Henk van der Vorst <vorst@math.uu.nl>
Last update: Wed Oct 17 13:02:42 2001