Numerical analysis Iterative methods for linear systems Theorem
Biconjugate gradient method
Builds on Invertible matrixTransposeKrylov subspaceConjugate gradient methodPositive definite matrixIterative method
Statement
Let be a real invertible matrix, let , and let with . Choose a shadow residual with , and set and . The biconjugate gradient method (BiCG) computes, for , where is the transpose. Suppose that the denominators and are nonzero up to step . Then in exact arithmetic, for :
- , and , where is the Krylov subspace;
- (biorthogonality) for ;
- (biconjugacy) for .
Remarks
Clauses 2 and 3 say that is orthogonal to , a Petrov–Galerkin condition. Suppose no breakdown occurs up to step . Then are linearly independent, since is zero for and nonzero for . So is orthogonal to all of , and . Example: if is symmetric and , then and for all . Then BiCG is the conjugate gradient method, which never breaks down when is positive definite. For a general the method can break down when with , and its residual norms can oscillate wildly.
Going deeper
For a student
BiCG is the linear-system counterpart of the nonsymmetric Lanczos process. Unlike GMRES it has no minimization property, but its memory and work per step do not grow with . Its weaknesses, breakdowns and erratic residuals, and the need for , motivated the transpose-free variants CGS and BiCGSTAB and the smoother QMR method. It is one of the Krylov iterative methods for nonsymmetric systems.
Reading path
To understand this page from the ground up, read these 16 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Chebyshev polynomials object
- Condition number concept
- Eigenvalue concept
- Incomplete Cholesky factorization concept
- Invertible matrix concept
- Iterative method concept
- Krylov subspace concept
- Positive definite matrix concept
- Preconditioner concept
- Spectral radius concept
- System of linear equations concept
- Transpose concept
- Modified Richardson iteration statement
- Chebyshev iteration statement
- Conjugate gradient method statement
- Biconjugate gradient method statement
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | HGF11AHX5R |
|---|---|
| URI | m2://HGF11AHX5R |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 65F10 |
| Status | This copy of the site has no build data. Run m2 status HGF11AHX5R. |
| About | Iterative method |
| Uses | Invertible matrix, Transpose, Krylov subspace, Conjugate gradient method, Positive definite matrix, Iterative method |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.