Performance of ILU factorization preconditioners based on multisplittings

DOI10.1007/s00211-003-0453-1zbMath1040.65032OpenAlexW2023477850MaRDI QIDQ1412188

Jae Heon Yun

Publication date: 9 November 2003

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-003-0453-1

zbMATH Keywords

convergencesparse matrixparallel algorithmpreconditionerlinear equationKrylov subspace methodincomplete LU factorizationblock triangular matrixH-matrixmultisplittingBiCGSTAB algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)

Related Items (11)

Convergence of parallel multisplitting methods using ILU factorizations. ⋮ Convergence improvement of relaxed multisplitting USAOR methods for \(H\)-matrices linear systems ⋮ Multisplitting preconditioners for a symmetric positive definite matrix ⋮ A note on the inner-outer iterative method for solving the linear equation \(Ax = b\) ⋮ Convergence of SSOR multisplitting method for an \(H\)-matrix ⋮ Convergence of SSOR multisplitting method for an \(M\)-matrix ⋮ A note on parallel multisplitting TOR method forH-matrices ⋮ Convergence of nonstationary multisplitting methods using ILU factorizations ⋮ Parallel relaxed multisplitting methods for a symmetric positive definite matrix ⋮ Convergent improvement of SSOR multisplitting method for an \(H\)-matrix ⋮ Convergence of two-stage multisplitting method using AOR or SSOR multisplittings

This page was built for publication: Performance of ILU factorization preconditioners based on multisplittings