Table of Contents
Fetching ...

Iterative energy reduction Galerkin methods and variational adaptivity

Pascal Heid, Thomas P. Wihler

TL;DR

This work addresses the numerical approximation of critical points of an energy functional $E$ in variational PDEs by introducing an energy-guided iterative linearized Galerkin (ILG) framework. A two-tier approach is developed: (i) an inner ILG solver that guarantees energy reduction at every step, with a computable discrete residual guiding stopping, and (ii) a global variational adaptivity strategy that enriches Galerkin spaces based on local energy reductions to achieve convergence as the discretization is refined. The authors provide a rigorous convergence theory under structural assumptions (A1)–(A3) and (T) and illustrate variational adaptivity in a finite element setting, verified on nonlinear diffusion–reaction models including semilinear and quasilinear cases. Numerical experiments demonstrate robust energy decay, competitive convergence rates, and effective mesh refinement driven solely by energy considerations, highlighting the method’s practicality when standard a posteriori estimators are unavailable. Overall, the paper offers a cohesive energy-centered framework that unifies iterative solvers and energy-aware adaptivity for a broad class of nonlinear variational problems with strong potential for practical impact in physics and engineering computations.

Abstract

Critical points of energy functionals, which are of broad interest, for instance, in physics and chemistry, in solid and quantum mechanics, in material science, or in general diffusion-reaction models arise as solutions to the associated Euler-Lagrange equations. While classical computational solution methods for such models typically focus solely on the underlying partial differential equations, we propose an approach that also incorporates the energy structure itself. Specifically, we examine (linearized) iterative Galerkin discretization schemes that ensure energy reduction at each step, and utilize the computable discrete residual to determine an appropriate stopping point. Additionally, we provide necessary conditions, which are applicable to a wide class of problems, that guarantee convergence to critical points of the PDE as the discrete spaces are enriched. Moreover, in the specific context of finite element discretizations, we present a very generally applicable adaptive mesh refinement strategy - the so-called variational adaptivity approach - which, rather than using classical a posteriori estimates, is based on exploiting local energy reductions. The theoretical results are validated for several computational experiments in the context of nonlinear diffusion-reaction models, thereby demonstrating the effectiveness of the proposed scheme.

Iterative energy reduction Galerkin methods and variational adaptivity

TL;DR

This work addresses the numerical approximation of critical points of an energy functional in variational PDEs by introducing an energy-guided iterative linearized Galerkin (ILG) framework. A two-tier approach is developed: (i) an inner ILG solver that guarantees energy reduction at every step, with a computable discrete residual guiding stopping, and (ii) a global variational adaptivity strategy that enriches Galerkin spaces based on local energy reductions to achieve convergence as the discretization is refined. The authors provide a rigorous convergence theory under structural assumptions (A1)–(A3) and (T) and illustrate variational adaptivity in a finite element setting, verified on nonlinear diffusion–reaction models including semilinear and quasilinear cases. Numerical experiments demonstrate robust energy decay, competitive convergence rates, and effective mesh refinement driven solely by energy considerations, highlighting the method’s practicality when standard a posteriori estimators are unavailable. Overall, the paper offers a cohesive energy-centered framework that unifies iterative solvers and energy-aware adaptivity for a broad class of nonlinear variational problems with strong potential for practical impact in physics and engineering computations.

Abstract

Critical points of energy functionals, which are of broad interest, for instance, in physics and chemistry, in solid and quantum mechanics, in material science, or in general diffusion-reaction models arise as solutions to the associated Euler-Lagrange equations. While classical computational solution methods for such models typically focus solely on the underlying partial differential equations, we propose an approach that also incorporates the energy structure itself. Specifically, we examine (linearized) iterative Galerkin discretization schemes that ensure energy reduction at each step, and utilize the computable discrete residual to determine an appropriate stopping point. Additionally, we provide necessary conditions, which are applicable to a wide class of problems, that guarantee convergence to critical points of the PDE as the discrete spaces are enriched. Moreover, in the specific context of finite element discretizations, we present a very generally applicable adaptive mesh refinement strategy - the so-called variational adaptivity approach - which, rather than using classical a posteriori estimates, is based on exploiting local energy reductions. The theoretical results are validated for several computational experiments in the context of nonlinear diffusion-reaction models, thereby demonstrating the effectiveness of the proposed scheme.

Paper Structure

This paper contains 20 sections, 16 theorems, 115 equations, 5 figures, 2 algorithms.

Key Result

Proposition 2.2

If the update operator $\mathsf{T}$ defined in eq:T satisfies condition (T), then, for any $w \in \mathcal{M}(u^{0})$, we have that $\mathsf{E}(\mathsf{T}(w)) \leq \mathsf{E}(w)$, and, in turn $\mathsf{T}(\mathcal{M}(u^{0}))\subset\mathcal{M}(u^{0})$.

Figures (5)

  • Figure 1: Local element patches associated to a triangular element $\kappa$. Left: Mesh patch $\omega_\kappa$ consisting of the element $\kappa$ and its facewise neighbours. Right: Locally refined patch $\widetilde{\omega}_\kappa$ constructed based on red refining $\kappa$ and on green refining its facewise neighbours.
  • Figure 2: Experiment \ref{['exp:semilinear']}: The blue line displays the energy decay $\mathcal{E}_N$ from \ref{['eq:endiff']} against the number of degrees of freedom (with the black dashed line indicating a rate of $-1$), and the green markers show the number of iterative linearization steps on the sequence of discrete spaces $\{\mathbb{X}_N\}_N$.
  • Figure 3: Experiment \ref{['exp:pg']}: The blue line displays the decay of the error $\mathrm{e}^\star_N$, cf. \ref{['eq:eNn']}, against the number of degrees of freedom (with the black dashed line indicating a presumably optimal rate of $-1/2$), and the green markers show the number of iterative linearization steps on the sequence of discrete spaces $\{\mathbb{X}_N\}_N$.
  • Figure 4: Experiment \ref{['exp:scl']}: Adaptively refined mesh with $8 \, 576$ degrees of freedom.
  • Figure 5: Experiment \ref{['exp:scl']}: The blue line displays the decay of the error $\mathrm{e}^\star_N$, cf. \ref{['eq:eNn']}, against the number of degrees of freedom (with the black dashed line indicating a presumably optimal rate of $-1/2$), and the green markers show the number of iterative linearization steps on the sequence of discrete spaces $\{\mathbb{X}_N\}_N$.

Theorems & Definitions (38)

  • Remark 2.1
  • Proposition 2.2
  • proof
  • Remark 2.3
  • Proposition 2.4
  • proof
  • Lemma 2.5
  • proof
  • Theorem 2.6: Convergence of the iterative linearized Galerkin energy reduction scheme
  • proof
  • ...and 28 more