An Arnoldi based algorithm for solving coupled Sylvester matrix equations

MaRDI QIDQ2939088zbMATH OpenFDO

Authors Amer Kaabi

Publication date 16 January 2015

zbMATH Keywords

coupled Sylvester matrix equationsGauss-Seidel iterationglobal generalized minimal residual algorithmJacobi iterationKrylov subspace methodnumerical example

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Iterative numerical methods for linear systems (65F10)

Recommendations

• Finite iterative solutions to coupled Sylvester-conjugate matrix equations
• An efficient algorithm for solving general coupled matrix equations and its application
• On Iterative Solutions of General Coupled Matrix Equations
• scientific article; zbMATH DE number 6492793
• Generalized conjugate direction algorithm for solving general coupled Sylvester matrix equations

Cited in

(3)

• A new method for solving coupled complex matrix equations
• Extended Arnoldi methods for large low-rank Sylvester matrix equations
• An efficient algorithm for the solution of a coupled Sylvester equation appearing in descriptor systems

This page was built for publication: An Arnoldi based algorithm for solving coupled Sylvester matrix equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2939088)