A low-rank Krylov squared Smith method for large-scale discrete-time Lyapunov equations (Q413528)

From MaRDI portal
Revision as of 00:12, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A low-rank Krylov squared Smith method for large-scale discrete-time Lyapunov equations
scientific article

    Statements

    A low-rank Krylov squared Smith method for large-scale discrete-time Lyapunov equations (English)
    0 references
    0 references
    7 May 2012
    0 references
    The paper deals with the large-scale discrete-time Lyapunov matrix equation \(X-AXA^T=BB^T\) with low-rank symmetric right-hand side. The author uses the squared Smith method and the block Arnoldi algorithm for the low-rank approximation of the solution matrix. A restarting mechanism is employed to cope with the increase of memory storage of the Krylov basis. The numerical behavior of the proposed method is illustrated on several experiments.
    0 references
    squared Smith method
    0 references
    low-rank approximation
    0 references
    block-Arnoldi method
    0 references
    full orthogonalization method
    0 references
    numerical examples
    0 references
    alternating direction implicit (ADI) iteration
    0 references
    large-scale discrete-time Lyapunov matrix equation
    0 references
    algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references