Preconditioned conjugate gradient method: Difference between revisions

Content deleted Content added
m Typo fixing & Cleanup , Typos fixed: of of → of, using AWB
No edit summary
Line 10:
 
instead.
 
To save computional time it is important to take a symetric preconditioner. This can be Jacobi, symmetric Gauss-Seidel or Symmetric Successive Over Relaxation (SSOR).
 
The simplest preconditioner is a diagonal matrix that has just the diagonal elements of <math>A</math>. This is known as Jacobi preconditioning or diagonal scaling. Since diagonal matrices are trivial to invert and store in memory, a diagonal preconditioner is a good starting point. More sophisticated choices must trade-off the reduction in <math>\kappa(A)</math>, and hence faster convergence, with the time spent computing <math>P^{-1}</math>.