Improving Jacobi and Gauss-Seidel iterations

DOI10.1016/S0024-3795(87)90321-1zbMath0628.65022MaRDI QIDQ1093321

Juan Pedro Milaszewicz

Publication date: 1987

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

convergence ratesGaussian eliminationGauss-Seidel iterationsJacobian iteration

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items (48)

Elimination and fixed point iterations ⋮ Modified SOR-type iterative method for \(Z\)-matrices ⋮ The upper Jacobi and upper Gauss-Seidel type iterative methods for preconditioned linear systems ⋮ Gauss type preconditioning techniques for linear systems ⋮ Modified preconditioned GAOR methods for systems of linear equations ⋮ Comparison theorems for monotone Newton-Fourier iterations and applications in functional elimination ⋮ Monotone discrete Newton iterations and elimination ⋮ Convergence analysis of the preconditioned Gauss-Seidel method for \(H\)-matrices ⋮ Some new preconditioned generalized AOR methods for solving weighted linear least squares problems ⋮ Improving AOR method for consistent linear systems ⋮ Comparison results for splitting iterations for solving multi-linear systems ⋮ Locally-synchronous, iterative solver for Fourier-based homogenization ⋮ Stationary splitting iterative methods for the matrix equation \(AXB=C\) ⋮ Three-step alternating iterations for index 1 and non-singular matrices ⋮ A new preconditioner of the tensor splitting iterative method for solving multi-linear systems with \(\mathcal{M}\)-tensors ⋮ A modified AOR-type iterative method for L-matrix linear systems ⋮ Comparison results of the preconditioned AOR methods for \(L\)-matrices ⋮ The aor method for preconditioned linear systems^† ⋮ Convergence analysis of preconditioned AOR iterative method for linear systems ⋮ The survey of preconditioners used for accelerating the rate of convergence in the Gauss-Seidel method. ⋮ Convergence analysis of modified iterative methods to solve linear systems ⋮ Block Gauss elimination followed by a classical iterative method for the solution of linear systems. ⋮ On the application of homotopy perturbation method for solving systems of linear equations ⋮ Some new preconditioned generalized AOR methods for generalized least-squares problems ⋮ The Jacobi and Gauss-Seidel-type iteration methods for the matrix equation \(A X B = C\) ⋮ Some new preconditioned generalized AOR methods for generalized least-squares problems ⋮ Comparison results on the preconditioned GAOR method for generalized least squares problems ⋮ Convergence of the preconditioned AOR method for irreducible \(L\)-matrices ⋮ Preconditioning the linear system for the sor method ⋮ Some relaxed iteration methods for solving matrix equation \(AXB=C\) ⋮ A New Preconditioned Generalised AOR Method for the Linear Complementarity Problem Based on a Generalised Hadjidimos Preconditioner ⋮ Preconditioned modified AOR method for systems of linear equations ⋮ Improving preconditioned SOR-type iterative methods for L-matrices ⋮ An iteration method for solving the linear system \(Ax=b\) ⋮ Comment on `A comparison theorem of the SOR iterative method' ⋮ A note on the modified SOR method for \(Z\)-matrices ⋮ An analytical method as a preconditioning modeling for systems of linear equations ⋮ Multi-level preconditioned block accelerated overrelaxation iteration method for Z-matrices ⋮ Preconditioned GAOR methods for solving weighted linear least squares problems ⋮ A new family of \((I+S)\)-type preconditioner with some applications ⋮ On block diagonal and Schur complement preconditioning ⋮ Two new modified Gauss-Seidel methods for linear system with M-matrices ⋮ A preconditioned multisplitting and Schwarz method for linear complementarity problem ⋮ Factor gradient iterative algorithm for solving a class of discrete periodic Sylvester matrix equations ⋮ An efficient method for computing the inverse of arrowhead matrices ⋮ Modified iterative methods for consistent linear systems ⋮ More on modifications and improvements of classical iterative schemes for \(M\)-matrices ⋮ On optimal improvements of classical iterative schemes for \(Z\)-matrices

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• A generalization of the Stein-Rosenberg theorem to Banach spaces
• LU decomposition of M-matrices by elimination without pivoting
• Autour du théorème de Stein-Rosenberg
• On modified Jacobi linear operators
• On the Increase of Convergence Rates of Relaxation Procedures for Elliptic Partial Difference Equations
• Solution of Homogeneous Systems of Linear Equations Arising from Compartmental Models
• Algorithmes tronques de découpe linéaire

This page was built for publication: Improving Jacobi and Gauss-Seidel iterations