The influence of partitioning on domain decomposition convergence rates
From MaRDI portal
Publication:2359623
Recommendations
- Convergence rate of some domain decomposition methods for overlapping and nonoverlapping subdomains
- Solution domain decomposition with finite difference methods for partial differential equations
- Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms
- Iterative algorithms of domain decomposition for the solution of a quasilinear elliptic problem
- scientific article; zbMATH DE number 554627
Cites work
- scientific article; zbMATH DE number 949303 (Why is no real title available?)
- scientific article; zbMATH DE number 2113718 (Why is no real title available?)
- A New Paradigm for Parallel Adaptive Meshing Algorithms
- A new paradigm for parallel adaptive meshing algorithms
- A new parallel domain decomposition method for the adaptive finite element solution of elliptic partial differential equations
- A weakly overlapping domain decomposition preconditioner for the finite element solution of elliptic partial differential equations
- Asymptotically Exact A Posteriori Error Estimators, Part I: Grids with Superconvergence
- Asymptotically Exact A Posteriori Error Estimators, Part II: General Unstructured Grids
- Convergence analysis of a domain decomposition paradigm
- Domain decomposition methods for the numerical solution of partial differential equations
- Downwind numbering: Robust multigrid for convection-diffusion problems
- Dual Functions for a Parallel Adaptive Method
- Graph partitioning
- Superconvergent Derivative Recovery for Lagrange Triangular Elements of Degreepon Unstructured Grids
This page was built for publication: The influence of partitioning on domain decomposition convergence rates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359623)