Multi-preconditioned Domain Decomposition Methods in the Krylov Subspaces
DOI10.1007/978-3-319-57099-0_9zbMath1368.65221OpenAlexW2606208223MaRDI QIDQ5274931
Publication date: 7 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57099-0_9
domain decompositionfinite elementfinite volumeKrylov subspaceshierarchical memoryhybrid programmingmulti-dimensional boundary value problemssemi-conjugate direction methodscoarse grid corectionmulti-preconditioningscalable parallelismSchwarz parallel additive algorithm
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Preconditioners for iterative methods (65F08) Finite volume methods for boundary value problems involving PDEs (65N08)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Parallel approaches and technologies of domain decomposition methods
- Semi-conjugate direction methods for real positive definite systems
- The Optimized Schwarz Method with a Coarse Grid Correction
- On the semi-conjugate direction methods with dynamic preconditioning
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Additive Schwarz with Variable Weights
- An Introduction to Domain Decomposition Methods
- Deflated and Augmented Krylov Subspace Techniques
- A Multipreconditioned Conjugate Gradient Algorithm
This page was built for publication: Multi-preconditioned Domain Decomposition Methods in the Krylov Subspaces