Approximate inverse preconditioner by computing approximate solution of Sylvester equation

DOI10.1016/J.AMC.2005.01.006zbMath1103.65052OpenAlexW2072096500MaRDI QIDQ2573571

Faezeh Toutounian, Asghar Kerayechian, Amer Kaabi

Publication date: 22 November 2005

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

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

zbMATH Keywords

GMRES methodSylvester equationPreconditioningKrylov subspaceApproximate inverse

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (3)

Preconditioned Galerkin and minimal residual methods for solving Sylvester equations ⋮ A new version of successive approximations method for solving Sylvester matrix equations ⋮ Numerical solution of singular Sylvester equations

Uses Software

• Algorithm 432

Cites Work

• Unnamed Item
• Unnamed Item
• On the operator equation \(BX - XA = Q\)
• Perturbation of spectral subspaces and solution of linear operator equations
• A parallel block cyclic reduction algorithm for the fast solution of elliptic equations
• Krylov-subspace methods for the Sylvester equation
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• On Krylov Subspace Approximations to the Matrix Exponential Operator
• 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: Approximate inverse preconditioner by computing approximate solution of Sylvester equation