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