CG-type algorithms to solve symmetric matrix equations
From MaRDI portal
Publication:2489397
DOI10.1016/J.AMC.2005.03.003zbMATH Open1104.65029OpenAlexW2055000341MaRDI QIDQ2489397FDOQ2489397
Authors: Davod Khojasteh Salkuyeh 
Publication date: 28 April 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.03.003
Recommendations
- Numerical algorithms for solving the least squares symmetric problem of matrix equation \(AXB + CXD = E\)
- scientific article
- Matrix form of the CGS method for solving general coupled matrix equations
- A new algorithm for the symmetric solution of the matrix equations \(AXB=E\) and \(CXD=F\)
- An iterative algorithm for \(M\) symmetric solutions of the matrix equation \(AXB+CYD=E\)
- Generalized conjugate direction algorithm for solving the general coupled matrix equations over symmetric matrices
- scientific article; zbMATH DE number 1349188
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
- Symmetric solutions of a matrix equation and numerical solution of its inverse matrix
- On a conjugate gradient-type method for solving complex symmetric linear systems
numerical examplesKrylov subspace methodmatrix equationsmultiple right-hand sidessymmetric linear systemsconjugate gradient type algorithmsGlobal FOM GMRES algorithms
Cites Work
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Methods of conjugate gradients for solving linear systems
- Parallel iterative methods for sparse linear systems
- A Hessenberg-Schur method for the problem AX + XB= C
- The block conjugate gradient algorithm and related methods
- Global FOM and GMRES algorithms for matrix equations
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
Cited In (17)
- Title not available (Why is that?)
- Nested splitting conjugate gradient method for matrix equation \(AXB=C\) and preconditioning
- Title not available (Why is that?)
- A block preconditioner for the Gl-LSMR algorithm
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
- Global SCD algorithm for real positive definite linear systems with multiple right-hand sides
- A new family of global methods for linear systems with multiple right-hand sides
- Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides
- The right–left preconditioning technique for the solution of the large matrix equationAXB = C
- A breakdown-free block conjugate gradient method
- Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
- Generalized global conjugate gradient squared algorithm
- The symmetric solutions of the matrix inequalityAX≥Bin least-squares sense
- Deflated and augmented global Krylov subspace methods for the matrix equations
- A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C
- A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems
- A novel class of block methods based on the blockAAT-Lanczos bi-orthogonalization process for matrix equations
Uses Software
This page was built for publication: CG-type algorithms to solve symmetric matrix equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489397)
