Algorithm
S3L_gen_iter_solve attempts to solve Ax = b using one of the following iterative solution algorithms. The choice of algorithm is determined by the value supplied for the parameter iparm[S3L_iter_solver]. The various options available for this parameter are listed and described in Table 8-12
Table 8-12 iparm[S3L_iter_solver] Options|
Option |
Description |
|---|---|
|
S3L_bcgs |
BiConjugate Gradient Stabilized (Bi-CGSTAB) |
|
S3L_cgs |
Conjugate Gradient Squared (CGS) |
|
S3L_cg |
Conjugate Gradient (CG) |
|
S3L_cr |
Conjugate Residuals (CR) |
|
S3L_gmres |
Generalized Minimum Residual (GMRES) - default |
|
S3L_qmr |
Quasi-Minimal Residual (QMR) |
|
S3L_richardson |
Richardson method |
- © 2010, Oracle Corporation and/or its affiliates