A Note on the Efficiency of Domain Decomposed Incomplete Factorizations

DOI10.1137/0911046zbMath0707.65083OpenAlexW2086704158WikidataQ114074365 ScholiaQ114074365MaRDI QIDQ3489398

Tony F. Chan, Danny Goovaerts

Publication date: 1990

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0911046

zbMATH Keywords

convergencedomain decompositionparallelizationincomplete factorizationpreconditioned conjugate gradient iteration

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)

Related Items

Unnamed Item, Parallelizable approximate solvers for recursions arising in preconditioning, Explicit approximate inverse preconditioning techniques, The eigenvalue spectrum of domain decomposed preconditioners, The effect of block red-black ordering on block ILU preconditioner for sparse matrices, Shallow water theory and its application to the Venice lagoon, Iterative solution of linear systems in the 20th century, Domain decomposition and parallel processing of a finite element model of the shallow water equations