A Note on the Efficiency of Domain Decomposed Incomplete Factorizations
From MaRDI portal
Publication:3489398
convergencedomain decompositionincomplete factorizationparallelizationpreconditioned conjugate gradient iteration
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05)
Recommendations
Cited in
(13)- Domain decomposition preconditioners for the conjugate gradient method
- The eigenvalue spectrum of domain decomposed preconditioners
- Shallow water theory and its application to the Venice lagoon
- Domain decomposition and parallel processing of a finite element model of the shallow water equations
- Parallelizable approximate solvers for recursions arising in preconditioning
- Explicit approximate inverse preconditioning techniques
- Iterative solution of linear systems in the 20th century
- The effect of block red-black ordering on block ILU preconditioner for sparse matrices
- Incremental incomplete LU factorizations with applications
- Efficient Factoring Based on Partial Information
- scientific article; zbMATH DE number 4124945 (Why is no real title available?)
- scientific article; zbMATH DE number 1172014 (Why is no real title available?)
- scientific article; zbMATH DE number 749532 (Why is no real title available?)
This page was built for publication: A Note on the Efficiency of Domain Decomposed Incomplete Factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3489398)
