Chebyshev Semi−iteration in Preconditioning
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterative methods. When the solution of a linear system with a symmetric and positive definite coefficient matrix is required then the Conjugate Gradient method will compute the optimal approximate solution f...
Main Author: | Wathen, T |
---|---|
Format: | Report |
Published: |
Oxford University Computing Laboratory
2008
|
Similar Items
-
Chebyshev semi-iteration in Preconditioning
by: Rees, T, et al.
Published: (2008) -
Preconditioned iterative methods for implicit equations
by: Wathen, A
Published: (2000) -
Preconditioning iterative methods for the optimal control of the stokes equations
by: Rees, T, et al.
Published: (2011) -
PRECONDITIONING ITERATIVE METHODS FOR THE OPTIMAL CONTROL OF THE STOKES EQUATIONS
by: Rees, T, et al.
Published: (2011) -
Preconditioning iterative methods for the optimal control of the Stokes equation
by: Rees, T, et al.
Published: (2010)