Related papers: Exponential meshes and $\mathcal{H}$-matrices
Discretization methods for ordinary differential equations based on the use of matrix exponentials have been known for decades. This set of ideas has come off age and acquired greater urgency recently, within the context of geometric…
In this paper, we revisit approximation properties of piecewise polynomial spaces, which contain more than ${\cal P}_{r-1}$ but not ${\cal P}_r$. We develop more accurate upper and lower error bounds that are sharper than those used in…
In the first part of this study, a convex-constrained penalized formulation was studied for a class of constant modulus (CM) problems. In particular, the error bound techniques were shown to play a vital role in providing exact penalization…
This note constructs a local generalized finite element basis for elliptic problems with heterogeneous and highly varying coefficients. The basis functions are solutions of local problems on vertex patches. The error of the corresponding…
We consider a randomised implementation of the finite element method (FEM) for elliptic partial differential equations on high-dimensional models. This is motivated by applications where model predictions are essential for real-time process…
We introduce generalised finite difference methods for solving fully nonlinear elliptic partial differential equations. Methods are based on piecewise Cartesian meshes augmented by additional points along the boundary. This allows for…
In this paper, we replace the asymptotic enrichments around the crack tip in the extended finite element method (XFEM) with the semi-analytical solution obtained by the scaled boundary finite element method (SBFEM). The proposed method does…
This paper aims to study the convergence of adaptive finite element method for control constrained elliptic optimal control problems under $L^2$-norm. We prove the contraction property and quasi-optimal complexity for the $L^2$-norm errors…
This paper is contributed to a fast algorithm for Hankel tensor-vector products. For this purpose, we first discuss a special class of Hankel tensors that can be diagonalized by the Fourier matrix, which is called \emph{anti-circulant}…
In the present work we introduce a novel refinement algorithm for two-dimensional elliptic partial differential equations discretized with Virtual Element Method (VEM). The algorithm improves the numerical solution accuracy and the mesh…
We study the gradient superconvergence of bilinear finite volume element (FVE) solving the elliptic problems. First, a superclose weak estimate is established for the bilinear form of the FVE method. Then, we prove that the gradient…
The so-called matrix-element method (MEM) has long been used successfully as a classification tool in particle physics searches. In the presence of invisible final state particles, the traditional MEM typically assigns probabilities to an…
We consider a variant of the conventional MsFEM approach with enrichments based on Legendre polynomials, both in the bulk of mesh elements and on their interfaces. A convergence analysis of the approach is presented. Residue-type a…
We propose inertial versions of block coordinate descent methods for solving non-convex non-smooth composite optimization problems. Our methods possess three main advantages compared to current state-of-the-art accelerated first-order…
We derive exact form of the piecewise-linear finite element stiffness matrix on general non-uniform meshes for the integral fractional Laplacian operator in one dimension, where the derivation is accomplished in the Fourier transformed…
A new fast algebraic method for obtaining an $\mathcal{H}^2$-approximation of a matrix from its entries is presented. The main idea behind the method is based on the nested representation and the maximum-volume principle to select…
In this paper, we proposed two new types of edge multiscale methods motivated by \cite{GL18} to solve Partial Differential Equations (PDEs) with high-contrast heterogeneous coefficients: Edge spectral multiscale Finte Element method…
In this article we prove convergence of adaptive finite element methods for second order elliptic eigenvalue problems. We consider Lagrange finite elements of any degree and prove convergence for simple as well as multiple eigenvalues under…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
We show that badly approximable matrices are exactly those that, for any inhomogeneous parameter, can not be inhomogeneous approximated at every monotone divergent rate, which generalizes Ram\'irez's result (2018). We also establish some…