Preconditioned Galerkin and minimal residual methods for solving Sylvester equations

DOI10.1016/J.AMC.2006.02.021MaRDI QIDQ856113zbMATH OpenOpenAlexFDO

Authors Amer Kaabi, Faezeh Toutounian, A. Kerayechian

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

algorithmspreconditioningnumerical experimentsGalerkin methodKrylov subspace methodArnoldi processsylvester matrix equations

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(11)

• An implicit preconditioning strategy for large-scale generalized Sylvester equations
• The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)
• On RGI algorithms for solving Sylvester tensor equations
• A modified gradient based algorithm for solving Sylvester equations
• A parallel preconditioned modified conjugate gradient method for large Sylvester matrix equation
• Sylvester-based preconditioning for the waveguide eigenvalue problem
• Global FOM and GMRES algorithms for a class of complex matrix equations
• On global Hessenberg based methods for solving Sylvester matrix equations
• Approximate inverse preconditioner by computing approximate solution of Sylvester equation
• Minimal residual methods augmented with eigenvectors for solving Sylvester equations and generalized Sylvester equations
• Numerical solution of singular Sylvester equations

Describes a project that uses

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)