A Brief Introduction to Krylov Space Methods for Solving Linear Systems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- BiCGstab(l) and other hybrid Bi-CG methods
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Flexible Inner-Outer Krylov Subspace Methods
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- Methods of conjugate gradients for solving linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Variants of BICGSTAB for Matrices with Complex Spectrum
Cited in
(6)- 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
- On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems
- Descent Properties of an Anderson Accelerated Gradient Method with Restarting
- Pseudospectral computational methods for the time-dependent Dirac equation in static curved spaces
- Low dimensional simplex evolution: a new heuristic for global optimization
This page was built for publication: A Brief Introduction to Krylov Space Methods for Solving Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820524)
