Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods

DOI10.1134/S096554251605016XzbMath1351.65021MaRDI QIDQ327049

Olga Yu. Milyukova

Publication date: 13 October 2016

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

algorithmconvergencenumerical examplesconjugate gradient methodsparse matricesincomplete triangular factorizationiterative solution of systems of linear algebraic equationsparallel preconditioning

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Preconditioners for iterative methods (65F08) Numerical computation of matrix exponential and similar matrix functions (65F60)

Related Items

An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method

Uses Software

• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On parallelism and convergence of incomplete LU factorizations
• A new preconditioning technique for solving large sparse linear systems
• On the problem of unstable pivots in the incomplete LU-conjugate gradient method
• The effect of ordering on preconditioned conjugate gradients
• Parallel solution of symmetric positive definite systems based on decomposition into overlapping blocks
• Kaporin-kon'shin's method of parallel implementation of block preconditioners for asymmetric matrices in problems of filtration of a multicomponent mixture in a porous medium
• Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method
• The university of Florida sparse matrix collection
• A High-Quality Preconditioning Technique for Multi-Length-Scale Symmetric Positive Definite Linear Systems
• The Sinkhorn–Knopp Algorithm: Convergence and Applications
• An Incomplete Factorization Technique for Positive Definite Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Partial Elimination
• A class of first order factorization methods
• A robust incomplete factorization based on value and space constraints
• A generalized SSOR method
• Parallel approximate factorization method for solving discrete elliptic equations
• Parallel iterative methods using factorized preconditioning matrices for solving elliptic equations on triangular grids