On performance of SOR method for solving nonsymmetric linear systems

DOI10.1016/S0377-0427(00)00705-6zbMath1002.65039OpenAlexW2157805581MaRDI QIDQ5953958

Zbigniew I. Woźnicki

Publication date: 2001

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00705-6

zbMATH Keywords

performanceconvergencecomparison of methodsnumerical experimentssparse matricessuccessive overrelaxationGMRES methoddifference approximationerror obundsnonself-adjoint two-dimensional elliptic partial differential equationspoint and the line SOR algorithmssymmetric and nonsymmetric matricessystems of linear equations

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Boundary value problems for second-order elliptic equations (35J25) Error bounds for boundary value problems involving PDEs (65N15) Iterative numerical methods for linear systems (65F10) Finite difference methods for boundary value problems involving PDEs (65N06) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

Relaxation parameters and composite refinement techniques ⋮ On the SOR method with overlapping subsystems ⋮ Comparison of linear solvers for equilibrium geochemistry computations ⋮ The survey of preconditioners used for accelerating the rate of convergence in the Gauss-Seidel method.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On numerical analysis of conjugate gradient method
• Nonnegative splitting theory
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Estimation of the Optimum Relaxation Factors in Partial Factorization Iterative Methods
• The Sigma-Sor Algorithm and the Optimal Strategy for the Utilization of the Sor Iterative Method
• A new class of modified line-SOR algorithms

This page was built for publication: On performance of SOR method for solving nonsymmetric linear systems