The S.S.O.R. Iteration Scheme for Equations with 1 Ordering

DOI10.1093/comjnl/6.4.366zbMath0134.32704OpenAlexW2323456940MaRDI QIDQ5345227

G. A. Miles, E. D'Sylva

Publication date: 1964

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/6.4.366

zbMATH Keywords

numerical analysis

Related Items (9)

Stepsize restrictions for stability in the numerical solution of ordinary and partial differential equations ⋮ A survey of the iterative methods for the solution of linear systems by extrapolation, relaxation and other techniques ⋮ Computational methods of linear algebra ⋮ A uniform error bound for the overrelaxation methods ⋮ Is modified PSD equivalent to modified SOR for two-cyclic matrices? ⋮ The impact of eigenvalue locality on the convergence behavior of the PSD method for two-cyclic matrices ⋮ Convergence domains of the SSOR method for a class of generalized consistently ordered matrices ⋮ The modified preconditioned simultaneous displacement (MPSD) method ⋮ p-cyclic matrices and the symmetric successive overrelaxation method

This page was built for publication: The S.S.O.R. Iteration Scheme for Equations with  1 Ordering