Preconditioned Galerkin and minimal residual methods for solving Sylvester equations

DOI10.1016/J.AMC.2006.02.021zbMATH Open1105.65040OpenAlexW1970036503MaRDI QIDQ856113FDOQ856113

Faezeh Toutounian, A. 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

Recommendations

• Minimal residual methods augmented with eigenvectors for solving Sylvester equations and generalized Sylvester equations
• Krylov subspace methods for the generalized Sylvester equation
• Preconditioned Krylov Subspace Methods for Lyapunov Matrix Equations
• A convergence analysis of GMRES and FOM methods for Sylvester equations
• A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications

zbMATH Keywords

algorithmspreconditioningnumerical experimentsGalerkin methodKrylov subspace methodArnoldi processsylvester matrix equations

Mathematics Subject Classification ID

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

Cites Work

• Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
• Title not available (Why is that?)
• 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
• Iterative solution of the Lyapunov matrix equation
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Approximate Inverse Preconditioners via Sparse-Sparse Iterations
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Krylov Subspace Approximations to the Matrix Exponential Operator
• Perturbation of spectral subspaces and solution of linear operator equations
• On the operator equation \(BX - XA = Q\)
• Krylov-subspace methods for the Sylvester equation
• A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
• Alternating Direction Implicit Methods
• Alternating Direction Implicit Iteration for Systems with Complex Spectra
• A parallel block cyclic reduction algorithm for the fast solution of elliptic equations
• A parallel additive preconditioner for conjugate gradient method for \(AX+XB=C\)
• Approximate inverse preconditioner by computing approximate solution of Sylvester equation

Cited In (6)

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

Uses Software

• Algorithm 432

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

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