Generalized tridiagonal preconditioners for solving linear systems

DOI10.1080/00207160903026618MaRDI QIDQ3066974zbMATH OpenOpenAlexFDO

Authors Yao-Lin Jiang, Jicheng Li

Publication date 20 January 2011

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160903026618

zbMATH Keywords

convergenceGauss-Seidel methodJacobi methodlinear systemM-matrixnumerical examplestridiagonal preconditioner

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08)

Recommendations

• The upper Jacobi and upper Gauss-Seidel type iterative methods for preconditioned linear systems
• Convergence analysis of the two preconditioned iterative methods for \(M\)-matrix linear systems
• Preconditioned AOR iterative methods for \(M\)-matrices
• scientific article; zbMATH DE number 2058118
• Complexity bounds for solving some tridiagonal systems with preconditioning

Cited in

(6)

• Some iterative methods related to Frobenius norm minimization
• Complexity bounds for solving some tridiagonal systems with preconditioning
• Generalized augmented matrix preconditioning approach and its application to iterative solution of ill-conditioned algebraic systems
• A convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations
• A fast numerical algorithm for solving nearly penta-diagonal linear systems
• On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming

This page was built for publication: Generalized tridiagonal preconditioners for solving linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066974)