An MP-DWR method for $h$-adaptive finite element methods

Chengyu Liu, Guanghui Hu

TL;DR

This paper introduces a novel "Multiple-Precision Dual Weighted Residual" (MP-DWR) method for adaptive finite element simulations. By solving the primal and dual problems with different numerical precisions (e.g., double and single), the authors effectively break the Galerkin orthogonality, leading to significant improvements in computational efficiency and memory usage compared to traditional adaptive methods, without sacrificing accuracy.

What Problem Does This Paper Address?

Finite element methods (FEM) are powerful tools for solving complex partial differential equations (PDEs). Adaptive FEM refines the computational mesh (h-adaptivity) or increases polynomial order (p-adaptivity) in regions where higher accuracy is needed. A key component of many advanced adaptive methods, particularly those based on residual-based a posteriori error estimation, is the Dual Weighted Residual (DWR) method. The DWR method relies on solving a "dual problem" to estimate errors and guide mesh refinement.

A fundamental challenge in DWR is that the dual solution cannot be computed in the exact same finite element space as the primal solution. If they are computed in the same space, a phenomenon called "Galerkin orthogonality" causes the error estimate to vanish, rendering it useless. Traditionally, this problem is overcome by using a finer mesh (h-approach) or higher-order polynomials (p-approach) for the dual problem. However, these approaches require computationally expensive operations like re-meshing, re-assembling systems, and solving larger linear systems, which significantly increase simulation time and memory requirements. This paper addresses the need for a more efficient way to break Galerkin orthogonality in DWR methods.

Methods

The core innovation of this paper is the "Multiple-Precision Dual Weighted Residual" (MP-DWR) method. Instead of changing the mesh or polynomial order for the dual problem, MP-DWR leverages the fact that numerical computations with different floating-point precisions (e.g., float vs. double) can lead to different results, even for mathematically orthogonal vectors.

The proposed method works as follows:

  1. Primal Problem: Solved using a higher precision (e.g., double-precision).
  2. Dual Problem: Solved using a lower precision (e.g., single-precision or float-precision).

By solving these two problems in different precision formats, the Galerkin orthogonality is numerically broken. This allows the DWR error indicator to be reliably computed without the need for re-meshing or increasing polynomial degrees. The authors implement this using C++ templates, allowing the precision to be a parameter, leading to concise and manageable code. They also explore variations like MP-DWR(DF) (Double for primal, Float for dual) and MP-DWR(FD) (Float for primal, Double for dual).

Datasets

Not discussed in the paper. The paper focuses on numerical experiments using standard PDE test cases (Poisson equation, coefficient elliptic equation, convection-diffusion equation) with defined exact solutions and target functionals.

Key Insights and Ideas

  • Precision as a Tool for Adaptivity: The most striking insight is that numerical precision itself can be used as a mechanism to break Galerkin orthogonality, a long-standing challenge in DWR methods. This offers a novel way to achieve adaptivity.
  • Efficiency Without Sacrifice (Mostly): By avoiding expensive re-meshing and re-assembly steps, MP-DWR offers substantial speedups and memory savings. This is achieved by leveraging the inherent differences in floating-point arithmetic.
  • Concise Implementation: The use of C++ templates makes the MP-DWR implementation remarkably clean and easy to manage, allowing for straightforward switching of precision levels.
  • Goal-Orientation Preserved: The method successfully maintains the goal-orientation property of DWR, meaning the adaptivity is driven by the accuracy requirements of specific quantities of interest, not just the overall solution.

Key Results

  • Significant Speedup: Numerical experiments show that MP-DWR can be orders of magnitude faster than traditional h-adaptive and p-adaptive DWR methods, particularly in generating error indicators. For example, in a 3D Poisson case, MP-DWR took about 15% of the time of the h-approach and 30% of the p-approach to generate the indicator.
  • Competitive with i-approach: While the i-approach (higher-order interpolation) also avoids re-meshing, MP-DWR is often faster, though potentially with slightly less accuracy for certain problems.
  • Comparable Accuracy: The MP-DWR method achieves comparable accuracy to traditional methods, especially when the number of degrees of freedom increases.
  • Memory Savings: Using lower precision for the dual problem reduces memory footprint by approximately 50% compared to using double-precision throughout.
  • Effectiveness Demonstrated: The method was tested on various PDEs and target functionals, consistently showing effective error estimation and mesh adaptation.

Limitations and Future Work

  • Potential Accuracy Trade-off: The paper notes that while MP-DWR gains efficiency, it might "lose some accuracy" compared to methods like the i-approach, especially for specific target functionals.
  • Limit of MP-DWR(FD): The authors observed that in some cases, particularly with very fine meshes, the lower-precision primal solution (e.g., float) can become inaccurate, leading to unreliable error indicators. This suggests a limit to how much precision can be reduced for the primal problem.
  • Future Work:
    • Combining MP-DWR and i-approach: The authors suggest that combining these methods could further improve both accuracy and efficiency.
  • Exploring Higher Precisions: Investigating even higher precision types (e.g., __float128 or long double) could potentially overcome the observed limits.
  • Dynamic Precision Switching: A proposed algorithm involves dynamically switching precision levels (e.g., starting with half-precision for primal, then switching to single/double as needed) to maximize acceleration while maintaining reliability.
  • Applications: Extending MP-DWR to other fields like computational fluid dynamics, micromagnetics, density functional theory, and time-dependent problems is a promising avenue.

Summary updated

Abstract

In a dual weighted residual method based on the finite element framework, the Galerkin orthogonality is an issue that prevents solving the dual equation in the same space as the one for the primal equation. In the literature, there have been two popular approaches to constructing a new space for the dual problem, i.e., refining mesh grids ($h$-approach) and raising the order of approximate polynomials ($p$-approach). In this paper, a novel approach is proposed for the purpose based on the multiple-precision technique, i.e., the construction of the new finite element space is based on the same configuration as the one for the primal equation, except for the precision in calculations. The feasibility of such a new approach is discussed in detail in the paper. In numerical experiments, the proposed approach can be realized conveniently with C++ \textit{template}. Moreover, the new approach shows remarkable improvements in both efficiency and storage compared with the $h$-approach and the $p$-approach. It is worth mentioning that the performance of our approach is comparable with the one through a higher order interpolation ($i$-approach) in the literature. The combination of these two approaches is believed to further enhance the efficiency of the dual weighted residual method.
BibTeX
@inproceedings{liu2022mp,
  author = {Chengyu Liu and Guanghui Hu},
  title = {{An MP-DWR method for $h$-adaptive finite element methods}},
  booktitle = {Numerical},
  year = {2022},
}
Figure