数值分析

The gradient bounds of generalized barycentric coordinates play an essential role in the $H^1$ norm approximation error estimate of generalized barycentric interpolations. Similarly, the $H^k$ norm, $k>1$, estimate needs upper bounds of…

For the iterative decoupling of elliptic-parabolic problems such as poroelasticity, we introduce time discretization schemes up to order $5$ based on the backward differentiation formulae. Its analysis combines techniques known from…

We develop and analyze a new hybridizable discontinuous Galerkin (HDG) method for solving third-order Korteweg-de Vries type equations. The approximate solutions are defined by a discrete version of a characterization of the exact solution…

In this paper, we devise a $\operatorname{prox}$-based semi-smooth Newton method for the non-differentiable TV-minimization problem. To this end, the primal-dual optimality conditions are reformulated as a nonlinear operator equation with…

Arguably the most widely used approaches for obtaining highly accurate molecular ground-state energies are coupled cluster methods. Despite introducing two layers of approximation, a linear and a nonlinear one, coupled cluster methods…

We study the construction and convergence of semi-explicit and iterative decoupling schemes for an elliptic-parabolic problem using higher-order Runge-Kutta methods. For the semi-explicit schemes, which are constructed using a nearby delay…

Pricing American options is more complicated than pricing European options, because they can be exercised at any time, and one thus needs to solve a linear complementarity problem instead of simply doing time stepping for computing European…

This paper focuses on the application of time domain decomposition to solve partial differential equations constrained optimization problems and controllability problems. After clarifying the link between these two types of problems, we…

LSQR and LSMR are iterative methods, based on the Golub-Kahan bidiagonalization algorithm, widely used for large-scale linear least squares problems. FLSQR and FLSMR are flexible variants of LSQR and LSMR, respectively, based on a flexible…

A novel boundary element method (BEM) removes the classical dependence on explicit fundamental solutions and extends quasi-optimal BEM discretisations to strongly elliptic operators with variable coefficients. The approach constructs a…

The Monge-Amp\`ere equation is a fundamental fully nonlinear elliptic partial differential equation that finds extensive applications across multiple disciplines. This study proposes a novel physics-informed neural network integrated with…

We prove first-order convergence of semi-discrete monotone finite difference schemes for Hamilton--Jacobi equations on the Wasserstein space over a finite graph. A central challenge is the boundary degeneracy of the Wasserstein simplex,…

In this work, we fully explore three refined convergence structures of the lowest-order rectangular Raviart-Thomas element in solving the Laplace eigenvalue problem. Firstly, the scheme possesses a property of supercloseness between the…

The eigenfunctions of the Laplacian are a natural basis of functions for many tasks in computational mathematics. On the circle and sphere, the eigenfunctions are given by complex periodic exponentials and spherical harmonics, respectively,…

We revisit the Scovel-Weinstein framework (Scovel & Weinstein, CPAM 1994) for reducing the Vlasov-Poisson system while preserving its Hamiltonian structure. Standard particle-in-cell (PIC) algorithms approximate the distribution function by…

This paper establishes quasi-optimal and lower-order error estimates for weak Galerkin, discontinuous Galerkin, and hybrid-high order finite element methods for the biharmonic equation under minimal regularity assumptions on general…

In this work, we develop a structure-preserving numerical scheme for a Cahn-Hilliard-Darcy model that describes tumor growth in a fluid-saturated porous medium. First, we derive a physically consistent model from the general framework…

In this article, we design an original solver based on Quantized Tensor Trains (QTT) for linear elliptic equations with heterogeneous coefficient field, that allows for extremely fine meshes. It can achieve full-field simulations in…

Component-wise accurate algorithms for computing the principal square root of an M-matrix are designed in terms of triplet representations. A triplet representation of an M-matrix $A$ is the triple $(P, {\bf u},{\bf v})$, where the matrix…

Textile drying is a key operation in the textile production cycle as it represents one of the most energy-intensive stages and plays a critical role in determining both product quality and overall process efficiency. In this work we propose…