New approaches for solving large Sylvester equations

DOI10.1016/J.AMC.2005.02.063zbMATH Open1089.65038OpenAlexW2054743364MaRDI QIDQ2489155FDOQ2489155

Authors: Davod Khojasteh Salkuyeh, Faezeh Toutounian 

Publication date: 16 May 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.02.063

Recommendations

• A new projection method for solving large Sylvester equations
• On the numerical solution of large scale Sylvester matrix equations
• Low rank approximate solutions to large Sylvester matrix equations
• Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
• A preconditioned block Arnoldi method for large Sylvester matrix equations

zbMATH Keywords

numerical examplesGMRESfull orthogonal methodgeneralized minimal residual algorithmslarge Sylvester matrix equationsmodified global Arnoldi algorithm

Mathematics Subject Classification ID

Matrix equations and identities (15A24)

Cites Work

• Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Parallel iterative methods for sparse linear systems
• A Hessenberg-Schur method for the problem AX + XB= C
• Title not available (Why is that?)
• Block Krylov subspace methods for solving large Sylvester equations
• Global FOM and GMRES algorithms for matrix equations

Cited In (24)

• The coupled Sylvester-transpose matrix equations over generalized centro-symmetric matrices
• Fast enclosure for solutions of generalized Sylvester equations
• On the numerical solution of generalized Sylvester matrix equations
• Solving SDGE models: a new algorithm for the Sylvester equation
• Nested splitting conjugate gradient method for matrix equation \(AXB=C\) and preconditioning
• The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)
• Solving linearly constrained matrix least squares problem by LSQR
• The general coupled linear matrix equations with conjugate and transpose unknowns over the mixed groups of generalized reflexive and anti-reflexive matrices
• A finite iterative algorithm for Hermitian reflexive and skew-Hermitian solution groups of the general coupled linear matrix equations
• A new projection method for solving large Sylvester equations
• New convergence results on the global GMRES method for diagonalizable matrices
• On the numerical solution of large scale Sylvester matrix equations
• A global variant of the COCR method for the complex symmetric Sylvester matrix equation \(AX+XB=C\)
• Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning
• A modified gradient based algorithm for solving Sylvester equations
• The right-left preconditioning technique for the solution of the large matrix equation \(AXB = C\)
• Use of near-breakdowns in the block Arnoldi method for solving large Sylvester equations
• Weighted versions of Gl-FOM and Gl-GMRES for solving general coupled linear matrix equations
• A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C
• An iterative method for solving the continuous Sylvester equation by emphasizing on the skew-Hermitian parts of the coefficient matrices
• The incomplete global GMERR algorithm for solving Sylvester equation
• On the global Krylov subspace methods for solving general coupled matrix equations
• Global symplectic Lanczos method with application to matrix exponential approximation
• Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations

Uses Software

• Algorithm 432

This page was built for publication: New approaches for solving large Sylvester equations

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