Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
From MaRDI portal
Publication:4501040
DOI10.1090/S0025-5718-99-01171-0zbMath0953.65017MaRDI QIDQ4501040
Publication date: 3 September 2000
Published in: Mathematics of Computation (Search for Journal in Brave)
convergencenumerical resultserror analysisnonsymmetric linear systemsbi-conjugate gradient algorithm
Related Items (9)
The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization ⋮ Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis ⋮ Abstract perturbed Krylov methods ⋮ Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems ⋮ Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum ⋮ Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method ⋮ An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- On the convergence rate of the conjugate gradients in presence of rounding errors
- An analysis of the composite step biconjugate gradient method
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Sparse matrix test problems
- A Convergence Analysis for Nonsymmetric Lanczos Algorithms
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
- Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
This page was built for publication: Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
