Stair Matrices and Their Generalizations with Applications to Iterative Methods I: A Generalization of the Successive Overrelaxation Method

DOI10.1137/S0036142998343294zbMath0942.65032OpenAlexW2063943959MaRDI QIDQ4271023

Lu, Hao

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

zbMATH Keywords

numerical testsparallel computationiterative methodJacobi matricesconvergence rateoptimal parameternumerical radiusHermitian positive definite matricesmatrix splittingsgeneralization of the SOR methodstair matrices and their generalizations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Related Items (6)

Comparison theorems for splittings of M-matrices in (block) Hessenberg form ⋮ On finding robust approximate inverses for large sparse matrices ⋮ Reuben Louis Rosenberg (1909--1986) and the Stein-Rosenberg theorem ⋮ Applications of stair matrices and their generalizations to iterative methods ⋮ Chebyshev-type methods and preconditioning techniques ⋮ On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors

This page was built for publication: Stair Matrices and Their Generalizations with Applications to Iterative Methods I: A Generalization of the Successive Overrelaxation Method