Iterative methods for a class of large, sparse, nonsymmetric linear systems
Iterative methods are considered for the numerical solution of large, sparse, nonsingular, and nonsymmetric systems of linear equations Ax=b, where it is also required that A is p-cyclic (p≥2). Firstly, it is shown that the SOR method applied to the system with A as p-cyclic, if p>2, has a slower...
Saved in:
| Main Author: | |
|---|---|
| Format: | Default Thesis |
| Published: |
1989
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/32961 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|