Improvement of preconditioned bi-Lanczos-type algorithms with residual norm minimization for the stable solution of systems of linear equations
From MaRDI portal
Publication:2070140
Recommendations
- Changing over stopping criterion for stable solving nonsymmetric linear equations by preconditioned conjugate gradient squared method
- scientific article; zbMATH DE number 663841
- A new Lanczos-type algorithm for systems of linear equations
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- scientific article; zbMATH DE number 2058670
Cites work
- scientific article; zbMATH DE number 3472227 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 1323248 (Why is no real title available?)
- scientific article; zbMATH DE number 1069613 (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\)) for linear equations involving unsymmetric matrices with complex spectrum
- Changing over stopping criterion for stable solving nonsymmetric linear equations by preconditioned conjugate gradient squared method
- GBi-CGSTAB(\(s,L\)): IDR(\(s\)) with higher-order stabilization polynomials
- GPBi-CG: Generalized Product-type Methods Based on Bi-CG for Solving Nonsymmetric Linear Systems
- Interpreting IDR as a Petrov-Galerkin method
- Structure of the preconditioned system in various preconditioned conjugate gradient squared algorithms
- The University of Florida sparse matrix collection
- Variants of BICGSTAB for Matrices with Complex Spectrum
This page was built for publication: Improvement of preconditioned bi-Lanczos-type algorithms with residual norm minimization for the stable solution of systems of linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070140)