Related papers: Convergence and Optimality of hp-AFEM
We consider the approximation of eigenvalue problems for elasticity equations with interface. This kind of problems can be efficiently discretized by using immersed finite element method (IFEM) based on Crouzeix-Raviart P1-nonconforming…
In this paper, a generalized finite element method (GFEM) with optimal local approximation spaces for solving high-frequency heterogeneous Helmholtz problems is systematically studied. The local spaces are built from selected eigenvectors…
We study the problem of minimizing a $m$-weakly convex and possibly nonsmooth function. Weak convexity provides a broad framework that subsumes convex, smooth, and many composite nonconvex functions. In this work, we propose a…
In a 1988 article, Dziuk introduced a nodal finite element method for the Laplace-Beltrami equation on 2-surfaces approximated by a piecewise-linear triangulation, initiating a line of research into surface finite element methods (SFEM).…
We consider the approximation of elliptic eigenvalue problem with an immersed interface. The main aim of this paper is to prove the stability and convergence of an immersed finite element method (IFEM) for eigenvalues using Crouzeix-Raviart…
An $hp$ version of interface penalty finite element method ($hp$-IPFEM) is proposed for elliptic interface problems in two and three dimensions on unfitted meshes. Error estimates in broken $H^1$ norm, which are optimal with respect to $h$…
The use of neural networks to approximate partial differential equations (PDEs) has gained significant attention in recent years. However, the approximation of PDEs with localised phenomena, e.g., sharp gradients and singularities, remains…
Adaptive mesh refinement is central to the efficient solution of partial differential equations (PDEs) via the finite element method (FEM). Classical $r$-adaptivity optimizes vertex positions but requires solving expensive auxiliary PDEs…
In \cite{liu2022practical}, a general algorithm is developed to efficiently obtain the best accuracy using the regular refinement. The adaptive refinement allows for obtaining an accuracy with a smaller number of DoFs compared with the…
For solving pseudo-convex global optimization problems, we present a novel fully adaptive steepest descent method (or ASDM) without any hard-to-estimate parameters. For the step-size regulation in an $\varepsilon$-normalized direction, we…
This paper considers a networked system with a finite number of users and supposes that each user tries to minimize its own private objective function over its own private constraint set. It is assumed that each user's constraint set can be…
This paper focuses on the study of the Filament Based Lamellipodium Model (FBLM) and the corresponding Finite Element Method (FEM) from a numerical point of view. We study fundamental numerical properties of the FEM and justify the further…
This paper is devoted to first-order algorithms for smooth convex optimization with inexact gradients. Unlike the majority of the literature on this topic, we consider the setting of relative rather than absolute inexactness. More…
Stability and optimal convergence analysis of a non-uniform implicit-explicit L1 finite element method (IMEX-L1-FEM) is studied for a class of time-fractional linear partial differential/integro-differential equations with non-self-adjoint…
In this paper the hp-version of the boundary element method is applied to the electric field integral equation on a piecewise plane (open or closed) Lipschitz surface. The underlying meshes are supposed to be quasi-uniform. We use…
The statistical finite element method (StatFEM) is an emerging probabilistic method that allows observations of a physical system to be synthesised with the numerical solution of a PDE intended to describe it in a coherent statistical…
This paper uses the HCT finite element method and mesh adaptation technology to solve the nonlinear plate bending problem and conducts error analysis on the iterative method, including a priori and a posteriori error estimates. Our…
The proximal point method (PPM) is a fundamental method in optimization that is often used as a building block for designing optimization algorithms. In this work, we use the PPM method to provide conceptually simple derivations along with…
We study the $h$- and $p$-versions of non-conforming harmonic virtual element methods (VEM) for the approximation of the Dirichlet-Laplace problem on a 2D polygonal domain, providing quasi-optimal error bounds. Harmonic VEM do not make use…
It is well known that the quasi-optimality of the Galerkin finite element method for the Helmholtz equation is dependent on the mesh size and the wave-number. In the literature, different criteria have been proposed to ensure uniform…