A bound for the optimum relaxation factor for the successive overrelaxation method
β Scribed by David M. Young
- Publisher
- Springer-Verlag
- Year
- 1971
- Tongue
- English
- Weight
- 281 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0029-599X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Simple and well vectorizable algorithms are presented for a solution of a large and sparse system of linear equations by means of the successive overrelaxation method (SOR) and by its multicolour variant (MCSOR). The system of equations results from the general two-dimensional second-order partial d
Let Ax = b be a system of linear equations where A is symmetric and positive definite. Suppose that the associated block Jacobi matrix B is consistently ordered, weekly cyclic of index 2, and convergent [i.e., I\_L~ := p(B) < 11. Consider using the overrelaxation methods (SOR, AOR, MSOR, SSOR, or US