Block Gauss elimination followed by a classical iterative method for the solution of linear systems.
Gaussian eliminationconvergencealgorithmfinite difference methodnumerical examplePoisson equationcomparison of methodsM-matricessuccessive overrelaxationirreducible matrices\(p\)-cyclic matricesblock-Gauss-Seidel-type methodsblock-Jacobi methodblockwise iterative methodsM-splittingspreconditiningSOR iterative methods
Direct numerical methods for linear systems and matrix inversion (65F05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Finite difference methods for boundary value problems involving PDEs (65N06)
- Gauss type preconditioning techniques for linear systems
- Preconditioned Gauss-Seidel type iterative method for solving linear systems
- Preconditioned Gauss-Seidel iterative method for \(Z\)-matrices linear systems
- scientific article; zbMATH DE number 2163960
- Modified iterative methods for consistent linear systems
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3325215 (Why is no real title available?)
- A generalization of the Stein-Rosenberg theorem to Banach spaces
- Algorithmes tronques de découpe linéaire
- Autour du théorème de Stein-Rosenberg
- Best Cyclic Repartitioning for Optimal Successive Overrelaxation Convergence
- Block Gauss elimination followed by a classical iterative method for the solution of linear systems.
- Comparison of Convergence of General Stationary Iterative Methods for Singular Matrices
- Comparison theorems for the convergence factor of iterative methods for singular matrices
- Comparison theorems for weak splittings of bounded operators
- Convergence of a direct-iterative method for large-scale least-squares problems
- Convergent nonnegative matrices and iterative methods for consistent linear systems
- Improving Jacobi and Gauss-Seidel iterations
- Improving the modified Gauss-Seidel method for \(Z\)-matrices
- LU decomposition of M-matrices by elimination without pivoting
- Modified Gauss-Seidel type methods and Jacobi type methods for Z-matrices
- Modified iterative methods for consistent linear systems
- More on modifications and improvements of classical iterative schemes for \(M\)-matrices
- NOTE ON M-MATRICES
- Nonnegative splitting theory
- On modified Jacobi linear operators
- On the Increase of Convergence Rates of Relaxation Procedures for Elliptic Partial Difference Equations
- On the Optimization of the Classical Iterative Schemes for the Solution of Complex Singular Linear Systems
- Optimal \(p\)-cyclic SOR
- Optimal successive overrelaxation iterative methods for \(p\)-cyclic matrices
- Optimality relationships for p-cyclic SOR
- Theorems on M-splittings of a singular M-Matrix which depend on graph structure
- Block Gauss elimination followed by a classical iterative method for the solution of linear systems.
- On optimal improvements of classical iterative schemes for \(Z\)-matrices
- Block preconditioned SSOR methods for \(H\)-matrices linear systems
- A note on the preconditioned Gauss--Seidel (GS) method for linear systems
This page was built for publication: Block Gauss elimination followed by a classical iterative method for the solution of linear systems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428086)
