A Brief Introduction to Krylov Space Methods for Solving Linear Systems
From MaRDI portal
Publication:2820524
DOI10.1007/978-3-540-46375-7_5zbMath1344.65042OpenAlexW55630753MaRDI QIDQ2820524
Publication date: 9 September 2016
Published in: Frontiers of Computational Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-46375-7_5
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items (6)
Descent Properties of an Anderson Accelerated Gradient Method with Restarting ⋮ Low dimensional simplex evolution: a new heuristic for global optimization ⋮ Minimal residual based iterative methods and its parallel implementation for sparse linear systems ⋮ An extended finite volume model for implicit cohesive zone fracture propagation in a poroelastic medium ⋮ Pseudospectral computational methods for the time-dependent Dirac equation in static curved spaces ⋮ On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- BiCGstab(\(l\)) and other hybrid Bi-CG methods
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Variants of BICGSTAB for Matrices with Complex Spectrum
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- Flexible Inner-Outer Krylov Subspace Methods
- Methods of conjugate gradients for solving linear systems
This page was built for publication: A Brief Introduction to Krylov Space Methods for Solving Linear Systems
