A new version of successive approximations method for solving Sylvester matrix equations

DOI10.1016/J.AMC.2006.08.007zbMath1121.65044OpenAlexW2003424164MaRDI QIDQ876643

Asghar Kerayechian, Amer Kaabi, Faezeh Toutounian

Publication date: 26 April 2007

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

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

zbMATH Keywords

convergencefield of valuessuccessive approximations methodSylvester matrix equationsblock GMRES-Sylvester method

Mathematics Subject Classification ID

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

Related Items (8)

On RGI algorithms for solving Sylvester tensor equations ⋮ Convergence analysis of gradient-based iterative algorithms for a class of rectangular Sylvester matrix equations based on Banach contraction principle ⋮ A modified gradient based algorithm for solving Sylvester equations ⋮ On two classes of mixed-type Lyapunov equations ⋮ The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\) ⋮ LSQR iterative common symmetric solutions to matrix equations \(AXB = E\) and \(CXD = F\) ⋮ Solutions to a family of matrix equations by using the Kronecker matrix polynomials ⋮ Gradient-descent iterative algorithm for solving a class of linear matrix equations with applications to heat and Poisson equations

Uses Software

• Algorithm 432

Cites Work

• Unnamed Item
• Unnamed Item
• Krylov-subspace methods for the Sylvester equation
• Fields of values and iterative methods
• Fields of values and the ADI method for non-normal matrices
• A convergence analysis of GMRES and FOM methods for Sylvester equations
• On the numerical solution of \(AX-XB=C\)
• Approximate inverse preconditioner by computing approximate solution of Sylvester equation
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• The Sensitivity of the Stable Lyapunov Equation
• A Hessenberg-Schur method for the problem AX + XB= C
• Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
• Iterative Solution Methods
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• Explicit Solutions of Linear Matrix Equations
• Block Krylov subspace methods for solving large Sylvester equations

This page was built for publication: A new version of successive approximations method for solving Sylvester matrix equations