Iterative methods for unsymmetric linear systems
From MaRDI portal
Publication:6560187
DOI10.1007/BFB0037406zbMATH Open1541.65021MaRDI QIDQ6560187FDOQ6560187
Authors: Henk A. van der Vorst 
Publication date: 21 June 2024
Recommendations
Cites Work
- BiCGstab(\(l\)) and other hybrid Bi-CG methods
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Title not available (Why is that?)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Title not available (Why is that?)
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
- Title not available (Why is that?)
- How Fast are Nonsymmetric Matrix Iterations?
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Title not available (Why is that?)
- GMRESR: a family of nested GMRES methods
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- s-step iterative methods for symmetric linear systems
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- A Black Box Generalized Conjugate Gradient Solver with Inner Iterations and Variable-Step Preconditioning
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- An analysis of the composite step biconjugate gradient method
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- A Newton basis GMRES implementation
- Maintaining convergence properties of BiCGStab methods in finite precision arithmetic
- Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
- Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
- Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
- Parallel block preconditioning based on SSOR and MILU
This page was built for publication: Iterative methods for unsymmetric linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560187)
