Related papers: Refined convergence structures of the rectangular …
This paper addresses a multi-scale finite element method for second order linear elliptic equations with arbitrarily rough coefficient. We propose a local oversampling method to construct basis functions that have optimal local…
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…
For a singularly perturbed elliptic model problem with two small parameters, we analyze finite element methods of any order on a Bakhvalov-type mesh. For convergence analysis, we construct a new interpolation by using the characteristics of…
The goal of this paper is to survey the properties of the eigenvalue relaxation for least squares binary problems. This relaxation is a convex program which is obtained as the Lagrangian dual of the original problem with an implicit compact…
We introduce discretizations of infinite-dimensional optimization problems with total variation regularization and integrality constraints on the optimization variables. We advance the discretization of the dual formulation of the total…
We present a family of high order trapezoidal rule-based quadratures for a class of singular integrals, where the integrand has a point singularity. The singular part of the integrand is expanded in a Taylor series involving terms of…
This work establishes the well-posedness and a priori error analysis for the mixed FEEC-type finite element approximation of the three-dimensional vector Laplace boundary value problem subject to the Dirichlet boundary condition. The…
This paper derives a discrete dual problem for a prototypical hybrid high-order method for convex minimization problems. The discrete primal and dual problem satisfy a weak convex duality that leads to a priori error estimates with…
We propose an inexact proximal augmented Lagrangian framework with explicit inner problem termination rule for composite convex optimization problems. We consider arbitrary linearly convergent inner solver including in particular stochastic…
Optimization on Riemannian manifolds widely arises in eigenvalue computation, density functional theory, Bose-Einstein condensates, low rank nearest correlation, image registration, and signal processing, etc. We propose an adaptive…
In this paper we consider a reduced order method for the approximation of the eigensolutions of the Laplace problem with Dirichlet boundary condition. We use a time continuation technique that consists in the introduction of a fictitious…
The regularity of refinable functions has been investigated deeply in the past 25 years using Fourier analysis, wavelet analysis, restricted and joint spectral radii techniques. However the shift-invariance of the underlying regular setting…
We propose a numerical method to solve the Monge-Ampere equation which admits a classical convex solution. The Monge-Ampere equation is reformulated into an equivalent first-order system. We adopt a novel reconstructed discontinuous…
We propose a general algorithm for non-conforming adaptive mesh refinement (AMR) of unstructured meshes in high-order finite element codes. Our focus is on h-refinement with a fixed polynomial order. The algorithm handles triangular,…
In this paper, we propose a numerical method for the solution of time-dependent flow problems in mixed form. Such problems can be efficiently approximated on hierarchical grids, obtained from an unstructured coarse triangulation by using a…
We consider a class of linear eigenvalue problems depending on a small parameter epsilon in which the series expansion for the eigenvalue in powers of epsilon is divergent. We develop a new technique to determine the precise nature of this…
The inverse conductivity problem aims at determining the unknown conductivity inside a bounded domain from boundary measurements. In practical applications, algorithms based on minimizing a regularized residual functional subject to PDE…
An algebraic multilevel iteration method for solving system of linear algebraic equations arising in $H(\mathrm{curl})$ and $H(\mathrm{div})$ spaces are presented. The algorithm is developed for the discrete problem obtained by using the…
This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…
Only a few numerical methods can treat boundary value problems on polygonal and polyhedral meshes. The BEM-based Finite Element Method is one of the new discretization strategies, which make use of and benefits from the flexibility of these…