Stair Matrices and Their Generalizations with Applications to Iterative Methods I: A Generalization of the Successive Overrelaxation Method
From MaRDI portal
Publication:4271023
DOI10.1137/S0036142998343294zbMath0942.65032MaRDI QIDQ4271023
Publication date: 22 November 1999
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0036142998343294
numerical tests; parallel computation; iterative method; Jacobi matrices; convergence rate; optimal parameter; numerical radius; Hermitian positive definite matrices; matrix splittings; generalization of the SOR method; stair matrices and their generalizations
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
Related Items
Reuben Louis Rosenberg (1909--1986) and the Stein-Rosenberg theorem, Chebyshev-type methods and preconditioning techniques, Applications of stair matrices and their generalizations to iterative methods, On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors, Comparison theorems for splittings of M-matrices in (block) Hessenberg form, On finding robust approximate inverses for large sparse matrices