Main convergence theorems for the improved sor method with orderings
From MaRDI portal
Publication:4375416
DOI10.1080/00207169808804630zbMATH Open0888.65029OpenAlexW2002696860WikidataQ126245764 ScholiaQ126245764MaRDI QIDQ4375416FDOQ4375416
Authors: 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
Recommendations
- On the optimal relaxation parameters to the improved SOR method with orderings
- A practical choice of parameters in improved SOR-Newton method with orderings
- The convergence and divergence properties of the SOR iterative method for a (1,2) consistently ordered matrix
- On convergence of SOR methods for nonsmooth equations
- A comparison theorem for the SOR iterative method
- On domains of superior convergence of the SSOR method to that of the SOR method
- Publication:4206289
- Improved SOR method with orderings and direct methods
- Convergence domains of the SSOR method for a class of generalized consistently ordered matrices
- A sufficient and necessary condition of the convergence of the SAOR iterative method for consistently ordered matrices
convergenceiterative methodsuccessive overrelaxationblock tridiagonal matricesSOR method with ordering
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the convergence of the extrapolated aor method
- Convergence Criteria for Successive Overrelaxation
- Convergence of Matrix Iterations Subject to Diagonal Dominance
- Direct solution of partial difference equations by tensor product methods
- Marching Algorithms for Elliptic Boundary Value Problems. I: The Constant Coefficient Case
- A Method of Block Iteration
- Tensor product analysis of partial difference equations
- Adaptive improved block SOR method with orderings
- An ad hoc SOR method
- Marching Algorithms for Elliptic Boundary Value Problems. II: The Variable Coefficient Case
- A Local Relaxation Method for Solving Elliptic PDE<scp>s</scp> on Mesh-Connected Arrays
- Ordering Properties of Linear Successive Iteration Schemes Applied to Multi-Diagonal Type Linear Systems
- Title not available (Why is that?)
Cited In (6)
- On the optimal relaxation parameters to the improved SOR method with orderings
- An improved symmetric SOR iterative method for augmented systems
- Improved SOR method with orderings and direct methods
- Adaptive improved block SOR method with orderings
- A practical choice of parameters in improved SOR-Newton method with orderings
- Basic Lul Factorization And Improved Iterative Method With Orderings
This page was built for publication: Main convergence theorems for the improved sor method with orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375416)
