Math 2.0

Numerical analysis Iterative methods for linear systems Theorem

Biconjugate gradient method

Builds on Invertible matrixTransposeKrylov subspaceConjugate gradient methodPositive definite matrixIterative method

Statement

Let AA be a real invertible n×nn \times n matrix, let b∈ℝnb \in \R^n, and let x0∈ℝnx_0 \in \R^n with r0=b−Ax0r_0 = b - A x_0. Choose a shadow residual r~0∈ℝn\tilde{r}_0 \in \R^n with r~0Tr0≠0\tilde{r}_0^T r_0 \ne 0, and set p0=r0p_0 = r_0 and p~0=r~0\tilde{p}_0 = \tilde{r}_0. The biconjugate gradient method (BiCG) computes, for k=0,1,…k = 0, 1, \dots, αk=r~kTrkp~kTApk,xk+1=xk+αkpk,rk+1=rk−αkApk,r~k+1=r~k−αkATp~k,\alpha_k = \frac{\tilde{r}_k^T r_k}{\tilde{p}_k^T A p_k}, \quad x_{k+1} = x_k + \alpha_k p_k, \quad r_{k+1} = r_k - \alpha_k A p_k, \quad \tilde{r}_{k+1} = \tilde{r}_k - \alpha_k A^T \tilde{p}_k, βk=r~k+1Trk+1r~kTrk,pk+1=rk+1+βkpk,p~k+1=r~k+1+βkp~k,\beta_k = \frac{\tilde{r}_{k+1}^T r_{k+1}}{\tilde{r}_k^T r_k}, \quad p_{k+1} = r_{k+1} + \beta_k p_k, \quad \tilde{p}_{k+1} = \tilde{r}_{k+1} + \beta_k \tilde{p}_k, where ATA^T is the transpose. Suppose that the denominators p~kTApk\tilde{p}_k^T A p_k and r~kTrk\tilde{r}_k^T r_k are nonzero up to step mm. Then in exact arithmetic, for i,j≤mi, j \le m:

  1. rk=b−Axkr_k = b - A x_k, and xk∈x0+𝒦k(A,r0)x_k \in x_0 + \mathcal{K}_k(A, r_0), where 𝒦k\mathcal{K}_k is the Krylov subspace;
  2. (biorthogonality) r~iTrj=0\tilde{r}_i^T r_j = 0 for i≠ji \ne j;
  3. (biconjugacy) p~iTApj=0\tilde{p}_i^T A p_j = 0 for i≠ji \ne j.

Remarks

Clauses 2 and 3 say that rkr_k is orthogonal to 𝒦k(AT,r~0)\mathcal{K}_k(A^T, \tilde{r}_0), a Petrov–Galerkin condition. Suppose no breakdown occurs up to step nn. Then r~0,…,r~n−1\tilde{r}_0, \dots, \tilde{r}_{n-1} are linearly independent, since r~iTrj\tilde{r}_i^T r_j is zero for i≠ji \ne j and nonzero for i=ji = j. So rnr_n is orthogonal to all of ℝn\R^n, and rn=0r_n = 0. Example: if AA is symmetric and r~0=r0\tilde{r}_0 = r_0, then r~k=rk\tilde{r}_k = r_k and p~k=pk\tilde{p}_k = p_k for all kk. Then BiCG is the conjugate gradient method, which never breaks down when AA is positive definite. For a general AA the method can break down when r~kTrk=0\tilde{r}_k^T r_k = 0 with rk≠0r_k \ne 0, 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 kk. Its weaknesses, breakdowns and erratic residuals, and the need for ATA^T, 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Chebyshev polynomials object
  2. Condition number concept
  3. Eigenvalue concept
  4. Incomplete Cholesky factorization concept
  5. Invertible matrix concept
  6. Iterative method concept
  7. Krylov subspace concept
  8. Positive definite matrix concept
  9. Preconditioner concept
  10. Spectral radius concept
  11. System of linear equations concept
  12. Transpose concept
  13. Modified Richardson iteration statement
  14. Chebyshev iteration statement
  15. Conjugate gradient method statement
  16. Biconjugate gradient method statement

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Biconjugate_gradient_method
About this page
TagHGF11AHX5R
URIm2://HGF11AHX5R
Kindstatement, theorem
WritingW0 stub
MSC65F10
StatusThis copy of the site has no build data. Run m2 status HGF11AHX5R.
AboutIterative method
UsesInvertible 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.

What links here

Results about this

Used by