A new projection method for solving large Sylvester equations (Q881475): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Krylov subspace methods for the generalized Sylvester equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of large Sylvester‐observer equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4433611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controllability, observability and the solution of AX-XB=C / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hessenberg-Schur method for the problem AX + XB= C / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Krylov subspace methods for solving large Sylvester equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of EPr generalized inverses by inversion of nonsingular matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accuracy and Stability of Numerical Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Krylov-subspace methods for the Sylvester equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal projection equations for fixed-order dynamic compensation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Krylov Subspace Methods for Solving Large Lyapunov Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global FOM and GMRES algorithms for matrix equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection methods for large Lyapunov matrix equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of system balancing transformations and other applications of simultaneous diagonalization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Rank Solution of Lyapunov Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergence analysis of GMRES and FOM methods for Sylvester equations / rank
 
Normal rank

Latest revision as of 19:18, 25 June 2024

scientific article
Language Label Description Also known as
English
A new projection method for solving large Sylvester equations
scientific article

    Statements

    A new projection method for solving large Sylvester equations (English)
    0 references
    0 references
    0 references
    0 references
    30 May 2007
    0 references
    The Sylvester equation \(AX+XB+CD^T=0\) and equivalent ones are reformulated as linear equations by arranging the entries of the matrix \(X\) in a vector of appropriate length. The Arnoldi iteration is applied to the linear system and the iterates are used as basis vectors for the approximate solution by low-dimensional Sylvester equations.
    0 references
    Sylvester matrix equation
    0 references
    Arnoldi iteration
    0 references
    matrix Krylov subspace method
    0 references

    Identifiers