Main convergence theorems for the improved sor method with orderings

DOI10.1080/00207169808804630zbMath0888.65029OpenAlexW2002696860WikidataQ126245764 ScholiaQ126245764MaRDI QIDQ4375416

Emiko Ishiwata, Yoshiaki Muroya

Publication date: 5 February 1998

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169808804630

zbMATH Keywords

convergenceiterative methodsuccessive overrelaxationblock tridiagonal matricesSOR method with ordering

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (5)

On the optimal relaxation parameters to the improved SOR method with orderings ⋮ Adaptive improved block SOR method with orderings ⋮ Basic Lul Factorization And Improved Iterative Method With Orderings ⋮ A practical choice of parameters in improved SOR-Newton method with orderings ⋮ Improved SOR method with orderings and direct methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An ad hoc SOR method
• Adaptive improved block SOR method with orderings
• Direct solution of partial difference equations by tensor product methods
• A Method of Block Iteration
• A Local Relaxation Method for Solving Elliptic PDE<scp>s</scp> on Mesh-Connected Arrays
• On the convergence of the extrapolated aor method
• Marching Algorithms for Elliptic Boundary Value Problems. I: The Constant Coefficient Case
• Marching Algorithms for Elliptic Boundary Value Problems. II: The Variable Coefficient Case
• Convergence Criteria for Successive Overrelaxation
• Tensor product analysis of partial difference equations
• Convergence of Matrix Iterations Subject to Diagonal Dominance
• Ordering Properties of Linear Successive Iteration Schemes Applied to Multi-Diagonal Type Linear Systems

This page was built for publication: Main convergence theorems for the improved sor method with orderings