Adaptive improved block SOR method with orderings
From MaRDI portal
Publication:2258364
DOI10.1007/BF03167368zbMath1306.65196MaRDI QIDQ2258364
Emiko Ishiwata, Kotaro Isogai, Yoshiaki Muroya
Publication date: 3 March 2015
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
block tridiagonal matricesadaptive improved block SOR method with orderingsmultiple relaxation parameter
Related Items
Main convergence theorems for the improved sor method with orderings ⋮ On the optimal relaxation parameters to the improved 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On two theorems of Phragmén-Lindelöf for linear elliptic and parabolic differential equations of the second order
- An ad hoc SOR method
- On recurring theorems on diagonal dominance
- Improved SOR method with orderings and direct methods
- On nonlinear SOR-like methods. II: Convergence of the SOR-Newton method for mildly nonlinear equations
- Direct solution of partial difference equations by tensor product methods
- A Local Relaxation Method for Solving Elliptic PDE<scp>s</scp> on Mesh-Connected Arrays
- Marching Algorithms for Elliptic Boundary Value Problems. I: The Constant Coefficient Case
- Marching Algorithms for Elliptic Boundary Value Problems. II: The Variable Coefficient Case
- Main convergence theorems for the improved sor method with orderings
- 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
