Searcharxiv⌕ Search

arXiv · 2611.17700

A Unified Framework for First- and Second-Order Energy-Stable Parametric Finite Element Methods for Planar Willmore Flow

Abstract

The construction of structure-preserving schemes for planar Willmore flow that are second-order accurate in time and avoid large coupled nonlinear solves remains challenging. In this work, we develop a unified framework for first- and second-order fully discrete energy-stable parametric finite element schemes for planar Willmore flow with a length-penalization term. The framework is based on a new equivalent reformulation involving a global auxiliary variable. The main novelty lies in the second-order construction, which combines midpoint curvature quantities weighted by elementwise arc-length Jacobian ratios with a compatible discrete tangent to obtain exact discrete chain rules for the bending energy and curve length. A further contribution is to show that both schemes satisfy discrete modified energy dissipation laws that yield the same type of a priori bounds on the discrete solution as the original energy law. They also retain Barrett--Garcke--N{ü}rnberg tangential motion to promote favorable mesh distribution. Each stage reduces to two linear solves with exactly the same coefficient matrix and one scalar nonlinear solve. We rigorously prove unique solvability of the linear subproblems under suitable assumptions and derive computable sufficient conditions for local existence and uniqueness of the scalar solution near unity. Numerical experiments demonstrate the expected temporal accuracy, energy dissipation, good mesh quality and computational efficiency.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaoli Li, Yujing Yan. 2026-11-13. A Unified Framework for First- and Second-Order Energy-Stable Parametric Finite Element Methods for Planar Willmore Flow. https://searcharxiv.com/abs/2611.17700

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Adaptive mesh refinement for the Landau-Lifshitz-Gilbert equation

We propose a new adaptive algorithm for the approximation of the Landau--Lifshitz--Gilbert equation via a higher-order tangent plane scheme. We show that the adaptive approximation satisfies an energy inequality and demonstrate numerically that the adaptive algorithm outperforms uniform approaches.

math.NA↗

A one-dimensional model of catheter aspiration in blood vessels

Aspiration thrombectomy is a primary endovascular treatment option for acute ischemic stroke caused by large vessel occlusions, in which a catheter is navigated to the occlusion site and suction is applied to remove the thrombus. This work introduces a reduced one-dimensional model for aspiration in blood vessels that accounts for the elasticity of both the vessel wall and the catheter. The inclusion of vessel wall visco-elasticity transforms the governing equation for the flow rate into a parabolic form, enabling an accurate resolution of the diffuse pressure gradients near the catheter tip observed in CFD simulations. The numerical treatment is based on a relaxation of the hyperbolic subsystem that facilitates nodal solvers, enabling efficient coupling between catheterized and uncatheterized vessel segments, including bifurcations and the catheter tip. A splitting strategy ensures that the visco-elastic terms incur only negligible additional computational cost relative to the purely hyperbolic model. The model is benchmarked against three-dimensional CFD simulations and reference data from the literature. Numerical experiments investigating the role of catheter elasticity and suction force on the hemodynamics are presented, and an uncertainty quantification study demonstrates the suitability of the framework for efficient parameter studies. The results indicate that the proposed model resolves blood flow comparably accurate to three-dimensional simulations at a fraction of the computational cost. While further in vitro and in vivo validation is required, the framework represents a promising step toward computationally efficient preoperative planning and uncertainty-aware decision support in aspiration thrombectomy.

math.NA↗

Exploiting the nonzero diagonal pattern in matrix function computations

We consider the task of approximating a matrix function $f(A)$, where $A$ is a matrix in which only a relatively small number of (not necessarily consecutive) sub- and superdiagonals contain nonzero entries. Approximating $f$ by a low-degree polynomial $p$ allows us to obtain sparse approximations to $f(A)$, which one can efficiently work with (while, in general, $f(A)$ is a dense matrix, even when $A$ is sparse). Our approach is based on carefully inspecting the locations where nonzeros can occur in $p(A)$, and identifying the entries in $A$ that influence them. In particular, we illustrate how this approach can be used for efficiently approximating the trace of $f(A)$ and identify how this approach is related to established (stochastic) probing methods for trace estimation. Another application area in which our approach works particularly well is the computation of functions of Toeplitz matrices. Here, studying the sparsity pattern of $p(A)$ allows us to reduce the computation of the whole matrix polynomial to that of a single small-scale submatrix, yielding an algorithm that scales exceptionally well to large problem sizes.

math.NA↗