Cubically Convergent Iterations for Invariant Subspace Computation
Authors:
- P. A. AbsilPAP. A. Absil
- R. SepulchreRSR. Sepulchre
- P. Van DoorenPDP. Van Dooren
- R. MahonyRMR. Mahony
- 1 January 2004
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 26 (1) , 70-96
Abstract
We propose a Newton-like iteration that evolves on the set of fixed dimensional subspaces of $\rr^n$ and converges locally cubically to the invariant subspaces of a symmetric matrix. This iteration is compared in terms of numerical cost and global behavior with three other methods that display the same property of cubic convergence. Moreover, we consider heuristics that greatly improve the global behavior of the iterations.
Keywords
This publication has 37 references indexed in Scilit:
- Riemannian Geometry of Grassmann Manifolds with a View on Algorithmic ComputationActa Applicandae Mathematicae, 2004
- The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive actionLinear Algebra and its Applications, 2002
- Newton's method on Riemannian manifolds and a geometric model for the human spineIMA Journal of Numerical Analysis, 2002
- A Grassmann--Rayleigh Quotient Iteration for Computing Invariant SubspacesSIAM Review, 2002
- The Multishift QR Algorithm. Part II: Aggressive Early DeflationSIAM Journal on Matrix Analysis and Applications, 2002
- The Multishift QR Algorithm. Part I: Maintaining Well-Focused Shifts and Level 3 PerformanceSIAM Journal on Matrix Analysis and Applications, 2002
- Nonequivalence transformation of?-matrix eigenproblems and model embedding approach to model tuningNumerical Linear Algebra with Applications, 2000
- The Dynamics of Rayleigh Quotient IterationSIAM Journal on Numerical Analysis, 1989
- ON A BLOCK IMPLEMENTATION OF HESSENBERG MULTISHIFT QR ITERATIONInternational Journal of High Speed Computing, 1989
- Three methods for refining estimates of invariant subspacesComputing, 1987