A new class of modified line-SOR algorithms
The paper presents modified versions of the line-successive overrelaxation (SOR) method, firstly proposed in \textit{R. S. Varga} [Matrix iterative analysis, Prentice-Hall (Englewood Cliffs, NJ) (1963; Zbl 0133.08602)] and developed and extended by \textit{Z. I. Woźnicki} [Math. Comput. 62, No. 206, 619-644 (1994; Zbl 0802.65036)]. For these new algorithms, convergence results are proved and an algorithm for determining the optimal value of the modified line-SOR relaxation parameter is described. The authors also present numerical experiments with the modified algorithms on some classes of elliptic boundary value problems, discretized by finite-differences methods on rectangular, hexagonal and triangular mesh structures.
- Estimation of the Optimum Relaxation Factors in Partial Factorization Iterative Methods
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- Line Iterative Methods for Cyclically Reduced Discrete Convection-Diffusion Problems
- Nonnegative splitting theory
- On numerical analysis of conjugate gradient method
- The Sigma-Sor Algorithm and the Optimal Strategy for the Utilization of the Sor Iterative Method
This page was built for publication: A new class of modified line-SOR algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5939864)