Name
Abstract | ||
|---|---|---|
An iterative method for the solution of nonsymmetric linear systems of equations is described and tested. The method, block symmetric successive over-relaxation with conjugate gradient acceleration (BSSOR), is remarkably robust and when applied to block tridiagonal systems allows parallelism in the computations. BSSOR compares favorably to unpreconditioned conjugate gradient-like algorithms in efficiency, and although generally slower than preconditioned methods it is far more reliable. The concept behind BSSOR can, in general, be applied to sparse linear systems (even if they are singular), sparse nonlinear systems of equations and least squares problems. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1145/55364.55369 | I4CS |
Keywords | Field | DocType |
tridiagonal system,preconditioned method,robust parallel solver,sparse nonlinear system,linear system,conjugate gradient acceleration,squares problem,nonsymmetric linear system,block tridiagonal system,symmetric successive over-relaxation,iterative method,unpreconditioned conjugate gradient-like algorithm,conjugate gradient,successive over relaxation,iteration method,nonlinear system | Conjugate gradient method,Tridiagonal matrix,Applied mathematics,Mathematical analysis,Computer science,Iterative method,Parallel computing,Relaxation (iterative method),Nonlinear conjugate gradient method,Derivation of the conjugate gradient method,Biconjugate gradient method,Conjugate residual method | Conference |
ISBN | Citations | PageRank |
0-89791-272-1 | 3 | 1.38 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Bramley | 1 | 3 | 1.38 |
| Ahmed H. Sameh | 2 | 297 | 139.93 |