Minimal residual based iterative methods and its parallel implementation for sparse linear systems
From MaRDI portal
Publication:1980489
DOI10.1007/978-981-16-1877-2_7zbMath1490.65053OpenAlexW3156294624MaRDI QIDQ1980489
Publication date: 8 September 2021
Full work available at URL: https://doi.org/10.1007/978-981-16-1877-2_7
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Projection methods for linear systems
- Scheduled relaxation Jacobi method: improvements and applications
- A modification of minimal residual iterative method to solve linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Preconditioning techniques for large linear systems: A survey
- Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
- On inexact Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems
- A Brief Introduction to Krylov Space Methods for Solving Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- An EM-based iterative method for solving large sparse linear systems
- A survey of direct methods for sparse linear systems
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Minimal residual based iterative methods and its parallel implementation for sparse linear systems
