A new paradigm for parallel adaptive meshing algorithms
domain decompositionelliptic problemfinite elementinterior error estimatesmesh refinementmortar methodmultigrid algorithmsparallel computation
Boundary value problems for second-order elliptic equations (35J25) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05)
In finite element computations on parallel computers, the distributions of subdomains to the processors is usually based on a split of the coarsest mesh. When the meshes are adaptively refined, a redistribution may be necessary in order to improve the load balancing. This requires a large amount of communication that is severe on workstation clusters. NEWLINENEWLINENEWLINEA new concept by the authors avoids this problem. Each processor does not only have the information about the subdomain associated to it. It gets the elliptic problem for the coarsest grid on the whole domain. The processor performs the adaptive refinement with the well-known procedure, it only sets the error indicators to zero for the elements outside its subdomain. NEWLINENEWLINENEWLINEThis concept is elaborated. The analysis uses old and new interior error estimates. Moreover, arguments from additive multigrid algorithms and the mortar method enter. The implementation with PLTMG is discussed.
- A New Paradigm for Parallel Adaptive Meshing Algorithms
- Parallel Algorithms for Adaptive Mesh Refinement
- Parallel adaptive mesh refinement and redistribution on distributed memory computers
- Parallel structures and dynamic load balancing for adaptive finite element computation
- Load balancing for the parallel adaptive solution of partial differential equations
- Load balancing for the parallel adaptive solution of partial differential equations
- Parallel tetrahedral mesh adaptation with dynamic load balancing
- A parallel partition of unity scheme based on two-grid discretizations for the Navier-Stokes problem
- Local and parallel finite element algorithms for eigenvalue problems
- Parallel adaptive mesh refinement and redistribution on distributed memory computers
- How to best choose the outer coarse mesh in the domain decomposition method of Bank and Jimack
- An adaptive parareal algorithm
- A parallel stabilized finite element method based on the lowest equal-order elements for incompressible flows
- Fast and scalable algorithms for constructing solvent-excluded surfaces of large biomolecules
- An optimal Schwarz preconditioner for a class of parallel adaptive finite elements
- The influence of partitioning on domain decomposition convergence rates
- On the convergence of an optimal additive Schwarz method for parallel adaptive finite elements
- Hierarchical matrix techniques for a domain decomposition algorithm
- Adaptive full domain covering meshes for parallel finite element computations
- An analysis of discontinuous Galerkin methods for elliptic problems
- Stability and convergence of some parallel iterative subgrid stabilized algorithms for the steady Navier-Stokes equations
- A comparison of additive Schwarz preconditioners for parallel adaptive finite elements
- Progress in developing Poisson-Boltzmann equation solvers
- Domain decomposition and hp-adaptive finite elements
- Quasi-optimality of adaptive finite element methods for controlling local energy errors
- Local energy estimates for the finite element method on sharply varying grids
- PARALLEL MESH ADAPTATION
- Parallel Memory-Efficient Adaptive Mesh Refinement on Structured Triangular Meshes with Billions of Grid Cells
- Algebraic multigrid domain and range decomposition (AMG-DD/AMG-RD)
- Parallel adaptive tetrahedral mesh generation by the advancing front technique
- scientific article; zbMATH DE number 701240 (Why is no real title available?)
- A New Paradigm for Parallel Adaptive Meshing Algorithms
- scientific article; zbMATH DE number 1830932 (Why is no real title available?)
- A new parallel domain decomposition method for the adaptive finite element solution of elliptic partial differential equations
- Preparing sparse solvers for exascale computing
- New parallel method for adjacent disconnected unstructured 3D meshes
- A parallel finite element variational multiscale method based on fully overlapping domain decomposition for incompressible flows
- scientific article; zbMATH DE number 5239228 (Why is no real title available?)
- scientific article; zbMATH DE number 2226861 (Why is no real title available?)
- Parallelization of structured, hierarchical adaptive mesh refinement algorithms
- Gradient recovery type a posteriori error estimates for finite element approximations on irregular meshes
- Some variants of the Bank–Holst parallel adaptive meshing paradigm
- An element agglomeration nonlinear additive Schwarz preconditioned Newton method for unstructured finite element problems.
- New local and parallel finite element algorithm based on the partition of unity
- The partition of unity parallel finite element algorithm
- Local and parallel finite element algorithm based on the partition of unity for incompressible flows
- Local and parallel finite element algorithms for the Stokes problem
- Two-grid partition of unity method for second order elliptic problems
- Local and parallel finite element algorithms based on two-grid discretizations for the transient Stokes equations
This page was built for publication: A new paradigm for parallel adaptive meshing algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706443)
