Incomplete block LU preconditioners on slightly overlapping subdomains for a massively parallel computer

DOI10.1016/0168-9274(95)00077-8zbMath0854.65027OpenAlexW2121326121MaRDI QIDQ1917408

Eric De Sturler

Publication date: 6 January 1997

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(95)00077-8

zbMATH Keywords

numerical examplesdomain decompositionparallel computationpreconditioneriterative solversmatrix splittingsincomplete block LU factorizationSchwarz enhanced matrices

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)

Related Items (2)

Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers ⋮ Multilevel sparse approximate inverse preconditioners for adaptive mesh refinement

Cites Work

• Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
• Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
• Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Generalized Schwarz Splittings
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• A class of first order factorization methods
• Unnamed Item

This page was built for publication: Incomplete block LU preconditioners on slightly overlapping subdomains for a massively parallel computer