Comparison of multigrid algorithms for high-order continuous finite element discretizations.
From MaRDI portal
algebraic multigridboundary value problemconjugate gradient methodcontinuous finite elementsgeometric multigridhigher-order finite elementspreconditioningspectral elementssymmetric successive overrelaxation (SSOR) smoothers
Boundary value problems for second-order elliptic equations (35J25) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) 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)
Abstract: We present a comparison of different multigrid approaches for the solution of systems arising from high-order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev-accelerated Jacobi and the symmetric successive over-relaxation (SSOR) smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: 1) high-order -multigrid, which uses high-order interpolation and restriction between geometrically coarsened meshes; 2) -multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different-order basis functions; and 3), a first-order approximation multigrid preconditioner constructed using the nodes of the high-order discretization. This latter approach is often combined with algebraic multigrid for the low-order operator and is attractive for high-order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both - and -multigrid work well; the first-order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and SSOR smoothing outperforms Jacobi smoothing. While all of the tested methods converge in a mesh-independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared to using multigrid as a solver.
Recommendations
- Multigrid algorithms for high order discontinuous Galerkin methods
- Algebraic multigrid for higher-order finite elements
- Preconditioning higher order finite element systems by algebraic multigrid method of linear elements.
- Multi-p Preconditioners
- The hp-multigrid method applied to hp-adaptive refinement of triangular grids
Cites work
- \(p\)-multigrid solution of high-order discontinuous Galerkin discretizations of the compressible Navier-Stokes equations
- A Parallel Geometric Multigrid Method for Finite Elements on Octree Meshes
- Algebraic multigrid for higher-order finite elements
- Algebraic Multigrid Preconditioning of High-Order Spectral Elements for Elliptic Problems on a Simplicial Mesh
- Efficient nonlinear solvers for nodal high-order finite elements in 3D
- Finite-Element Preconditioning for Pseudospectral Solutions of Elliptic Problems
- Finite-element preconditioning of G-NI spectral methods
- High-Order Methods for Incompressible Fluid Flow
- scientific article; zbMATH DE number 613872 (Why is no real title available?)
- Hybrid multigrid/Schwarz algorithms for the spectral element method
- Hybrid Schwarz-Multigrid Methods for the Spectral Element Method: Extensions to Navier-Stokes
- Multigrid smoothers for ultraparallel computing
- Parallel multigrid smoothing: Polynomial versus Gauss--Seidel
- Piecewise bilinear preconditioning of high-order finite element method
- Spectral element multigrid. I: Formulation and numerical results
- Spectral element multigrid. II: Theoretical justification
- Spectral methods for problems in complex geometries
Cited in
(19)- A high-order semi-explicit discontinuous Galerkin solver for 3D incompressible flow with application to DNS and LES of turbulent channel flow
- A new multigrid formulation for high order finite difference methods on summation-by-parts form
- Sharp algebraic and total a posteriori error bounds for \(h\) and \(p\) finite elements via a multilevel approach. Recovering mass balance in any situation
- Agglomeration-based geometric multigrid solvers for compact discontinuous Galerkin discretizations on unstructured meshes
- Hybrid multigrid methods for high-order discontinuous Galerkin discretizations
- An efficient and accurate MPI-based parallel simulator for streamer discharges in three dimensions
- A robust multigrid method for isogeometric analysis in two dimensions using boundary correction
- A matrix-free high-order solver for the numerical solution of cardiac electrophysiology
- FFT, FMM, or multigrid? A comparative study of state-of-the-art Poisson solvers for uniform and nonuniform grids in the unit cube
- Symbol-based multigrid methods for Galerkin B-spline isogeometric analysis
- A performance comparison of continuous and discontinuous Galerkin methods with fast multigrid solvers
- A-posteriori-steered \(p\)-robust multigrid with optimal step-sizes and adaptive number of smoothing steps
- Conservative and Accurate Solution Transfer Between High-Order and Low-Order Refined Finite Element Spaces
- A Multilevel Algebraic Error Estimator and the Corresponding Iterative Solver with p-Robust Behavior
- Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge--Kutta Schemes for Parabolic PDEs
- Optimal polynomial smoothers for parallel AMG
- Subspace and auxiliary space preconditioners for high-order interior penalty discretizations in \(H(\mathrm{div})\)
- An efficient topology optimization algorithm for large-scale three-dimensional structures
- Combining physics-based and data-driven models: advancing the frontiers of research with scientific machine learning
This page was built for publication: Comparison of multigrid algorithms for high-order continuous finite element discretizations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3466260)
