On the equivalence of the k-step iterative euler methods and successive overrelaxation (SOR) methods for k-cyclic matrices
- 30 June 1988
- journal article
- Published by Elsevier in Mathematics and Computers in Simulation
- Vol. 30 (3), 213-230
- https://doi.org/10.1016/0378-4754(88)90001-8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On different classes of monoparametric stationary iterative methods for the solution of linear systemsMathematics and Computers in Simulation, 1986
- Convergence of a direct-iterative method for large-scale least-squares problemsLinear Algebra and its Applications, 1985
- Convergence of block iterative methods applied to sparse least-squares problemsLinear Algebra and its Applications, 1984
- The analysis ofk-step iterative methods for linear systems from summability theoryNumerische Mathematik, 1983
- On the optimization of a class of second order iterative schemesBIT Numerical Mathematics, 1983
- How to embrace your spectrum for faster iterative resultsLinear Algebra and its Applications, 1980
- Iterationsverfahren und allgemeine Euler-VerfahrenMathematische Zeitschrift, 1967
- On complex successive overrelaxationBIT Numerical Mathematics, 1962
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methodsNumerische Mathematik, 1961
- p-cyclic matrices: A generalization of the Young-Frankel successive overrelaxation schemePacific Journal of Mathematics, 1959