Non-adaptive and adaptive SAOR-CG algorithms
The paper is concerned with an improvement of the SAOR method for the iterative solution of large linear systems. Two versions of CG (conjugate gradient) acceleration of the SAOR method are proposed. In the non- adaptive version of the SAOR-CG algorithm the SAOR parameters \(\gamma\),\(\omega\) are fixed while in the adaptive version they are determined automatically and adaptively. Some numerical results of the adaptive SAOR-CG algorithm are presented and a comparison with the non- adaptive SAOR-CG algorithm, the optimum SOR algorithm and the adaptive SSOR-CG algorithm is given.
- Accelerated Overrelaxation Method
- scientific article; zbMATH DE number 3720254 (Why is no real title available?)
- scientific article; zbMATH DE number 3325215 (Why is no real title available?)
- scientific article; zbMATH DE number 3421825 (Why is no real title available?)
- Optimum Accelerated Overrelaxation Method in a Special Case
- Symmetric accelerated overrelaxation (saor) method
- Stepsize restrictions for stability in the numerical solution of ordinary and partial differential equations
- A survey of the iterative methods for the solution of linear systems by extrapolation, relaxation and other techniques
- On the convergence of the SAOR method and the error bounds for its acceleration
- The convergence of the two-block SAOR method for least-squares problems
- The accelerated SAOR method for large linear systems
- A modified SSOR-like preconditioner for non-Hermitian positive definite matrices
- Adaptive SOR methods based on the Wolfe conditions
- An improved SSOR-like preconditioner for the non-Hermitian-positive definite linear system with a dominant skew-Hermitian part
- Composite adaptive procedure for solving large sparse linear systems
This page was built for publication: Non-adaptive and adaptive SAOR-CG algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075019)
