Related papers: The Hessian discretisation method for fourth order…

In this paper, we consider a nonlinear PDE system governed by a parabolic heat equation coupled in a nonlinear way with a hyperbolic momentum equation describing the behavior of a displacement field coupled with a nonlinear elliptic…

The present work develops hybrid multigrid methods for high-order discontinuous Galerkin discretizations of elliptic problems. Fast matrix-free operator evaluation on tensor product elements is used to devise a computationally efficient PDE…

Solving high-dimensional parabolic partial differential equations (PDEs) with deep learning methods is often computationally and memory intensive, primarily due to the need for automatic differentiation (AD) to compute large Hessian…

We present a new method to solve nonlinear Hammerstein equations with weakly singular kernels. The process to approximate the solution, followed usually, consists in adapting the discretization scheme from the linear case in order to obtain…

We introduce the Equilibrated Averaging Residual Method (EARM), a unified equilibrated flux-recovery framework for elliptic interface problems that applies to a broad class of finite element discretizations. The method is applicable in both…

This paper proposes a deep-learning-based domain decomposition method (DeepDDM), which leverages deep neural networks (DNN) to discretize the subproblems divided by domain decomposition methods (DDM) for solving partial differential…

We consider the reliable implementation of an adaptive high-order unfitted finite element method on Cartesian meshes for solving elliptic interface problems with geometrically curved singularities. We extend our previous work on the…

In this paper, an error analysis of a three steps two level Galekin finite element method for the two dimensional transient Navier-Stokes equations is discussed. First of all, the problem is discretized in spatial direction by employing…

This paper introduces the Fej\'er-monotone hybrid steepest descent method (FM-HSDM), a new member to the HSDM family of algorithms, for solving affinely constrained minimization tasks in real Hilbert spaces, where convex smooth and…

In this paper we develop an $hp$-adaptive procedure for the numerical solution of general second-order semilinear elliptic boundary value problems, with possible singular perturbation. Our approach combines both adaptive Newton schemes and…

We investigate higher order symplectic integration strategies within Bayesian cosmic density field reconstruction methods. In particular, we study the fourth-order discretisation of Hamiltonian equations of motion (EoM). This is achieved by…

Using the gradient discretisation method (GDM), we provide a complete and unified numerical analysis for non-linear variational inequalities (VIs) based on Leray--Lions operators and subject to non-homogeneous Dirichlet and Signorini…

We design and analyze an iterative two-grid algorithm for the finite element discretizations of strongly nonlinear elliptic boundary value problems in this paper. We propose an iterative two-grid algorithm, in which a nonlinear problem is…

Nonlinear least-squares problems are a special class of unconstrained optimization problems in which their gradient and Hessian have special structures. In this paper, we exploit these structures and proposed a matrix-free algorithm with a…

We develop a hybrid spatial discretization for the wave equation in second order form, based on high-order accurate finite difference methods and discontinuous Galerkin methods. The hybridization combines computational efficiency of finite…

A homogenization approach is one of effective strategies to solve multiscale elliptic problems approximately. The finite element heterogeneous multiscale method (FEHMM) which is based on the finite element makes possible to simulate such…

This article proposes a new numerical algorithm for second order elliptic equations in non-divergence form. The new method is based on a discrete weak Hessian operator locally constructed by following the weak Galerkin strategy. The…

We leverage the proximal Galerkin algorithm (Keith and Surowiec, Foundations of Computational Mathematics, 2024, DOI: 10.1007/s10208-024-09681-8), a recently introduced mesh-independent algorithm, to obtain a high-order finite element…

A proof of optimal-order error estimates is given for the full discretization of the bulk--surface Cahn--Hilliard system with dynamic boundary conditions in a smooth domain. The numerical method combines a linear bulk--surface finite…

Strong approximation errors of both finite element semi-discretization and spatio-temporal full discretization are analyzed for the stochastic Allen-Cahn equation driven by additive noise in space dimension $d \leq 3$. The full…