Related papers: A Penalized Crouzeix-Raviart Element Method for Se…
In this paper we make a further discussion on the finite elements approximation for the Steklov eigenvalue problem on concave polygonal domain. We make full use of the regularity estimate and the characteristic of edge average interpolation…
In this paper, we extend the work of Brenner and Sung [Math. Comp. 59, 321--338 (1992)] and present a regularity estimate for the elastic equations in concave domains. Based on the regularity estimate we prove that the constants in the…
This paper presents a new parameter free partially penalized immersed finite element method and convergence analysis for solving second order elliptic interface problems. A lifting operator is introduced on interface edges to ensure the…
This article is devoted to computing the lower and upper bounds of the Laplace eigenvalue problem. By using the special nonconforming finite elements, i.e., enriched Crouzeix-Raviart element and extension $Q_1^{\rm rot}$, we get the lower…
For shape optimization problems, governed by elliptic equations with Dirichlet boundary condition and random coefficients, we utilize a penalization technique to get the approximate problem. We consider that uncertainties exists in the…
In this paper we study finite element discretizations of a surface vector-Laplace eigenproblem. We consider two known classes of finite element methods, namely one based on a vector analogon of the Dziuk-Elliott surface finite element…
We present a method to solve a special class of parameter identification problems for an elliptic optimal control problem to global optimality. The bilevel problem is reformulated via the optimal-value function of the lower-level problem.…
This article examines the Dirichlet boundary control problem governed by the Poisson equation, where the control variables are square integrable functions defined on the boundary of a two-dimensional bounded, convex, polygonal domain. It…
The implementation of the finite element method for linear elliptic equations requires to assemble the stiffness matrix and the load vector. In general, the entries of this matrix-vector system are not known explicitly but need to be…
We introduce the Virtual Element Method (VEM) for elliptic eigenvalue problems. The main result of the paper states that VEM provides an optimal order approximation of the eigenmodes. A wide set of numerical tests confirm the theoretical…
We studied an anisotropic modified Crouzeix--Raviart finite element method for the rotational form of a stationary incompressible Navier--Stokes equation with large irrotational body forces. We present an anisotropic $H^1$ error estimate…
We consider a class of constrained optimization problems with a possibly nonconvex non-Lipschitz objective and a convex feasible set being the intersection of a polyhedron and a possibly degenerate ellipsoid. Such problems have a wide range…
In this paper, we discuss a novel higher-order stabilization-free virtual element method for general second-order elliptic eigenvalue problems. Optimal a priori error estimates are derived for both the approximate eigenspace and…
A local and parallel algorithm based on the multilevel discretization is proposed in this paper to solve the eigenvalue problem by the finite element method. With this new scheme, solving the eigenvalue problem in the finest grid is…
We investigate the numerical approximation of an elliptic optimal control problem which involves a nonconvex local regularization of the $L^q$-quasinorm penalization (with $q\in(0,1)$) in the cost function. Our approach is based on the…
A type of adaptive finite element method for the eigenvalue problems is proposed based on the multilevel correction scheme. In this method, adaptive finite element method to solve eigenvalue problems involves solving associated boundary…
In this paper we propose a finite element method for solving elliptic equations with the observational Dirichlet boundary data which may subject to random noises. The method is based on the weak formulation of Lagrangian multiplier. We show…
In this paper, we first introduce an abstract framework to solve the eigenvalue problem by weak Galerkin (WG) method. By the application of the framework, WG method is proved to be locking-free and gives asymptotic lower bounds for the…
Modern control algorithms require tuning of square weight/penalty matrices appearing in quadratic functions/costs to improve performance and/or stability output. Due to simplicity in gain-tuning and enforcing positive-definiteness, diagonal…
Obtaining high-precision guaranteed lower eigenvalue bounds remains difficult, even though the standard high-order conforming finite element (FEM) easily yields extremely sharp upper bounds. Recently developed rigorous approaches using such…