Questions tagged [conjugate-gradient]

A popular krylov subspace method for solving linear systems of equations, particularly those that exhibit symmetric positive definiteness.

Assume a system of equations of the form:

$Ax=b$

where $A$ is a given positive definite matrix, $b$ is the given right-hand side, and $x$ is unknown.

The Conjugate Gradient method exploits the idea that we can write the solution x as a linear combination of mutually $A$-conjugate basis vectors. This allows us to exploit a scheme similar to gradient descent, but with $A$-conjugate vectors instead of residual vectors.

103 questions
9
votes
2 answers

What is the worst case complexity of Conjugate Gradient?

Let $A\in \mathbb{R}^{n\times n}$, symmetric and positive definite. Suppose it takes $m$ units of work to multiply a vector by $A$. It is well known that performing the CG algorithm on $A$ with condition number $\kappa$ requires $\mathcal{O}…
fred
  • 1,000
  • 6
  • 12
3
votes
2 answers

How can you explain the following bound on the inner product?

I am reading a paper on stability of CG, and I came across the following statement: \begin{equation} \frac{\|A\|\,\|p\|^2}{\langle p,Ap\rangle} \leq \kappa(A) \end{equation} where $\kappa(\cdot)$ is the condition number and $\langle \cdot, \cdot…
Eli
  • 33
  • 2
2
votes
1 answer

Preconditioned congugate gradaient vs Untransfomed preconditioned conjugate gradient

Page 460 of Numerical Optimization by Nocedal and Wright contains the following algorithm under the name projected conjugate gradient However, Jonathan Richard Shewchuk list what seems to me to be the same algorithm on page 46 of his classic "An…
Olumide
  • 265
  • 1
  • 9
1
vote
1 answer

Inner iterations in the preconditioned conjugate gradient method

As shown in Algorithm 2 of this document a linear system $M{\bf z}_k = {\bf r}_k$ is required for every iteration of the preconditioned conjugate gradient (PCG) method. I assume this system is typically solved using the (un-preconditioned) conjugate…
Olumide
  • 265
  • 1
  • 9
1
vote
1 answer

Why the iteration steps become twice if the step size reduces half for CG methods?

For CG method for SPD matrices, (Ax = b arising from Poisson equation with homogeneous boundary condition) we know that the convergence theorem: After m steps of iteration, the error $e^{(m)}=x-x_m$ satisfies the bound that $$\|e^{(m)}\|_A\leq…
Happy
  • 961
  • 4
  • 11
0
votes
2 answers

How to solve this system with conjugate gradient algorithm in matlab

CG Algorithm https://skydrive.live.com/redir?resid=E0ED7271C68BE47C!386&v=3 System of equations, the question and the example https://skydrive.live.com/redir?resid=E0ED7271C68BE47C!387&v=3 % below result is only accurate at decimal 0.1, but not the…
Ho Yeung Lee
  • 105
  • 1
  • 7