A new version of successive approximations method for solving Sylvester matrix equations
From MaRDI portal
Publication:876643
DOI10.1016/J.AMC.2006.08.007zbMATH Open1121.65044OpenAlexW2003424164MaRDI QIDQ876643FDOQ876643
A. 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
convergencefield of valuessuccessive approximations methodSylvester matrix equationsblock GMRES-Sylvester method
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Hessenberg-Schur method for the problem AX + XB= C
- Iterative Solution Methods
- Explicit Solutions of Linear Matrix Equations
- Block Krylov subspace methods for solving large Sylvester equations
- On the numerical solution of \(AX-XB=C\)
- Krylov-subspace methods for the Sylvester equation
- The Sensitivity of the Stable Lyapunov Equation
- Improving the Efficiency of Matrix Operations in the Numerical Solution of Stiff Ordinary Differential Equations
- Fields of values and iterative methods
- A convergence analysis of GMRES and FOM methods for Sylvester equations
- Approximate inverse preconditioner by computing approximate solution of Sylvester equation
- Fields of values and the ADI method for non-normal matrices
Cited In (10)
- The relaxed gradient based iterative algorithm for the symmetric (skew symmetric) solution of the Sylvester equation \(A X + X B = C\)
- Gradient-descent iterative algorithm for solving a class of linear matrix equations with applications to heat and Poisson equations
- LSQR iterative common symmetric solutions to matrix equations \(AXB = E\) and \(CXD = F\)
- On two classes of mixed-type Lyapunov equations
- Solutions to a family of matrix equations by using the Kronecker matrix polynomials
- Iterative procedure for the solution of Sylvester generalized matrix equation
- 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 RGI algorithms for solving Sylvester tensor equations
- A generalization of Jameson's method for Sylvester's matrix equation
Uses Software
Recommendations
- Title not available (Why is that?) π π
- Block linear method for large scale Sylvester equations π π
- Minimal residual methods augmented with eigenvectors for solving Sylvester equations and generalized Sylvester equations π π
- A Hessenberg method for the numerical solutions to types of block Sylvester matrix equations π π
- Observer-based Adaptive fuzzy control of time-delay uncertain nonlinear systems π π
This page was built for publication: A new version of successive approximations method for solving Sylvester matrix equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876643)