Global SCD algorithm for real positive definite linear systems with multiple right-hand sides
From MaRDI portal
Publication:2381292
DOI10.1016/j.amc.2006.11.083zbMath1132.65021MaRDI QIDQ2381292
Publication date: 17 September 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.11.083
numerical example; conjugate gradient method; nonsymmetric linear systems; matrix Lyapunov equation; left (right) conjugate direction matrix; semi-conjugate direction method
65F10: Iterative numerical methods for linear systems
Related Items
A new family of global methods for linear systems with multiple right-hand sides, A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems, Generalized global conjugate gradient squared algorithm, Skew-symmetric methods for nonsymmetric linear systems with multiple right-hand sides
Cites Work
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
- The block conjugate gradient algorithm and related methods
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- Global FOM and GMRES algorithms for matrix equations
- Semi-conjugate direction methods for real positive definite systems
- CG-type algorithms to solve symmetric matrix equations
- Convergence properties of block GMRES and matrix polynomials
- Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
- On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand Sides
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides