A Grassmann--Rayleigh quotient iteration for computing invariant subspaces (Q2780627)

From MaRDI portal





scientific article; zbMATH DE number 1729237
Language Label Description Also known as
English
A Grassmann--Rayleigh quotient iteration for computing invariant subspaces
scientific article; zbMATH DE number 1729237

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    15 April 2002
    0 references
    Rayleigh quotient iteration
    0 references
    invariant subspace
    0 references
    Grassmann manifold
    0 references
    comparison of methods
    0 references
    iterative algorithm
    0 references
    Sylvester equation
    0 references
    convergence
    0 references
    computational complexity
    0 references
    numerical stability
    0 references
    Grassmannian methods
    0 references
    0 references
    0 references
    A Grassmann--Rayleigh quotient iteration for computing invariant subspaces (English)
    0 references
    This is a paper with the typical SIAM Review quality. The classical Rayleigh quotient iteration (RQI) computes a 1-dimensional invariant subspace using a Rayleigh quotient to estimate the associated eigenvalue. In this paper, this is generalized to an iterative algorithm to find a \(p\)-dimensional invariant subspace. Thereto the iteration is in the Grassmannian manifold of matrices with \(p\) columns. Whereas the core of the iteration for \(p = 1\) is to solve \((A - \rho I) z = x\) for \(z\) where \(\rho = x^T A x\), in the Grassmannian version this is replaced by the solution of a Sylvester equation \(AZ- ZX^T AX = X\) for \(Z\). The algorithm is gradually introduced and built up from the case \(p = 1\). Cubic and global convergence properties are proved, computational complexity, numerical stability and comparison with other Grassmannian methods are carefully explained.
    0 references

    Identifiers