In this paper we will show how the Jacobi-Davidson iterative method can be used to solve generalized eigenproblems. Similar ideas as for the standard eigenproblem are used, but the projections, that are required to reduce the given problem to a small manageable size, need more attention. We show that by proper choices for the projection operators quadratic convergence can be achieved. The advantage of our approach is that none of the involved operators needs to be inverted. It turns out that similar projections can be used for the iterative approximation of selected eigenvalues and eigenvectors of polynomial eigenvalue equations. This approach has already been used with great success for the solution of quadratic eigenproblems associated with acoustic problems.
%0 Journal Article
%1 citeulike:13503603
%A Sleijpen, Gerard L. G.
%A Booten, Albert G. L.
%A Fokkema, Diederik R.
%A van der Vorst, Henk A.
%B BIT Numerical Mathematics
%D 1996
%I Kluwer Academic Publishers
%K 65f15-numerical-eigenvalues-eigenvectors 65f10-iterative-methods-for-linear-systems
%N 3
%P 595--633
%R 10.1007/bf01731936
%T Jacobi-Davidson Type Methods for Generalized Eigenproblems and Polynomial Eigenproblems
%U http://dx.doi.org/10.1007/bf01731936
%V 36
%X In this paper we will show how the Jacobi-Davidson iterative method can be used to solve generalized eigenproblems. Similar ideas as for the standard eigenproblem are used, but the projections, that are required to reduce the given problem to a small manageable size, need more attention. We show that by proper choices for the projection operators quadratic convergence can be achieved. The advantage of our approach is that none of the involved operators needs to be inverted. It turns out that similar projections can be used for the iterative approximation of selected eigenvalues and eigenvectors of polynomial eigenvalue equations. This approach has already been used with great success for the solution of quadratic eigenproblems associated with acoustic problems.
@article{citeulike:13503603,
abstract = {{In this paper we will show how the Jacobi-Davidson iterative method can be used to solve generalized eigenproblems. Similar ideas as for the standard eigenproblem are used, but the projections, that are required to reduce the given problem to a small manageable size, need more attention. We show that by proper choices for the projection operators quadratic convergence can be achieved. The advantage of our approach is that none of the involved operators needs to be inverted. It turns out that similar projections can be used for the iterative approximation of selected eigenvalues and eigenvectors of polynomial eigenvalue equations. This approach has already been used with great success for the solution of quadratic eigenproblems associated with acoustic problems.}},
added-at = {2017-06-29T07:13:07.000+0200},
author = {Sleijpen, Gerard L. G. and Booten, Albert G. L. and Fokkema, Diederik R. and van der Vorst, Henk A.},
biburl = {https://www.bibsonomy.org/bibtex/2be9b6639cbc86c787f8824626168844f/gdmcbain},
booktitle = {BIT Numerical Mathematics},
citeulike-article-id = {13503603},
citeulike-linkout-0 = {http://dx.doi.org/10.1007/bf01731936},
citeulike-linkout-1 = {http://link.springer.com/article/10.1007/BF01731936},
doi = {10.1007/bf01731936},
interhash = {f086732a7730c21a0c6c29cae7fd8559},
intrahash = {be9b6639cbc86c787f8824626168844f},
keywords = {65f15-numerical-eigenvalues-eigenvectors 65f10-iterative-methods-for-linear-systems},
number = 3,
pages = {595--633},
posted-at = {2015-01-29 05:32:43},
priority = {2},
publisher = {Kluwer Academic Publishers},
timestamp = {2019-02-28T23:43:44.000+0100},
title = {Jacobi-{D}avidson Type Methods for Generalized Eigenproblems and Polynomial Eigenproblems},
url = {http://dx.doi.org/10.1007/bf01731936},
volume = 36,
year = 1996
}