Preconditioned Galerkin and minimal residual methods for solving Sylvester equations

DOI10.1016/j.amc.2006.02.021zbMath1105.65040OpenAlexW1970036503MaRDI QIDQ856113

Faezeh Toutounian, Asghar Kerayechian, Amer Kaabi

Publication date: 7 December 2006

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

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

zbMATH Keywords

algorithmsGalerkin methodnumerical experimentspreconditioningKrylov subspace methodArnoldi processsylvester matrix equations

Mathematics Subject Classification ID

Related Items (5)

On RGI algorithms for solving Sylvester tensor equations ⋮ Numerical solution of singular Sylvester equations ⋮ A modified gradient based algorithm for solving Sylvester equations ⋮ Global FOM and GMRES algorithms for a class of complex matrix equations ⋮ The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)

Uses Software

• Algorithm 432

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the operator equation \(BX - XA = Q\)
• Perturbation of spectral subspaces and solution of linear operator equations
• Iterative solution of the Lyapunov matrix equation
• A parallel block cyclic reduction algorithm for the fast solution of elliptic equations
• Krylov-subspace methods for the Sylvester equation
• A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
• A parallel additive preconditioner for conjugate gradient method for \(AX+XB=C\)
• Approximate inverse preconditioner by computing approximate solution of Sylvester equation
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Alternating Direction Implicit Methods
• A Hessenberg-Schur method for the problem AX + XB= C
• Alternating Direction Implicit Iteration for Systems with Complex Spectra
• On Krylov Subspace Approximations to the Matrix Exponential Operator
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Approximate Inverse Preconditioners via Sparse-Sparse Iterations
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]

This page was built for publication: Preconditioned Galerkin and minimal residual methods for solving Sylvester equations