Abstract
The formulation of eigenproblems as generalized algebraic Riccati equations removes the non-uniqueness problem of eigenvectors. This basic idea gave birth to the Jacobi-Davidson (JD) method of Sleijpen and Van der Vorst (1996). JD converges quadratically when the current iterate is close enough to the solution that one targets for. Unfortunately, it may take quite some effort to get close enough to this solution. In this paper we present a remedy for this. Instead of linearizing the Riccati equation (which is done in JD) and replacing the linearization by a low-dimensional linear system, we propose to replace the Riccati equation by a low-dimensional Riccati equation and to solve it exactly. The performance of the resulting Riccati algorithm compares extremely favorable to JD while the extra costs per iteration compared to JD are in fact negligible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnoldi, W.E.: The Principle of Minimized Iteration in the Solution of the Matrix Eigenvalue Problem. Quart. Appl. Math., 9 (1951) 17–29.
Brandts, J.H.: The Riccati Method for Eigenvalues and Invariant Subspaces of Matrices with Inexpensive Action. Linear Algebra Appl., (2002) accepted.
Demmel, J.: Three Methods for Refining Estimates of Invariant Subspaces. Computing, 38 (1987) 43–57.
Sleijpen, G.L.G. and van der Vorst, H.A.: Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems. SIAM J. Matrix Anal. Applic., 17 (1996) 401–425.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandts, J.H. (2003). Solving Eigenproblems: From Arnoldi via Jacobi-Davidson to the Riccati Method. In: Dimov, I., Lirkov, I., Margenov, S., Zlatev, Z. (eds) Numerical Methods and Applications. NMA 2002. Lecture Notes in Computer Science, vol 2542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36487-0_18
Download citation
DOI: https://doi.org/10.1007/3-540-36487-0_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00608-4
Online ISBN: 978-3-540-36487-0
eBook Packages: Springer Book Archive