Related papers: Note on discontinuous trace approximation in the p…
The approximate string matching is a fundamental and recurrent problem that arises in most computer science fields. This problem can be defined as follows: Let $D=\{x_1,x_2,\ldots x_d\}$ be a set of $d$ words defined on an alphabet…
A numerical method is proposed to solve the full-Eulerian time-dependent Vlasov-Poisson system in high dimension. The algorithm relies on the construction of a tensor decomposition of the solution whose rank is adapted at each time step.…
As an application of Stein's method for Poisson approximation, we prove rates of convergence for the tail probabilities of two scan statistics that have been suggested for detecting local signals in sequences of independent random variables…
The aim of this paper is to obtain quantitative bounds for solutions to the optimal matching problem in dimension two. These bounds show that up to a logarithmically divergent shift, the optimal transport maps are close to be the identity…
This paper proposes and analyzes a class of new weak Galerkin (WG) finite element methods for 2- and 3-dimensional linear elasticity problems. The methods use discontinuous piecewise-polynomial approximations of degrees $k(\geq 0)$ for the…
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…
In this paper we provide key estimates used in the stability and error analysis of discontinuous Galerkin finite element methods (DGFEMs) on domains with curved boundaries. In particular, we review trace estimates, inverse estimates,…
A simple and very accurate method to approximate a function with a finite number of discontinuities is presented. This method relies on hyperbolic tangent functions of rational arguments as connecting functions at the discontinuities, each…
In this paper we study probabilistic and neural network approximations for solutions to Poisson equation subject to Holder data in general bounded domains of $\mathbb{R}^d$. We aim at two fundamental goals. The first, and the most…
In this work we present an a posteriori analysis for classes of inconsistent, nonconforming schemes approximating elliptic problems. We show the estimates coincide with existing ones for interior penalty type discontinuous Galerkin…
Tensor completion recovers a multi-dimensional array from a limited number of measurements. Using the recently proposed tensor ring (TR) decomposition, in this paper we show that a d-order tensor of dimensional size n and TR rank r can be…
For a wide class of polynomially nonlinear systems of partial differential equations we suggest an algorithmic approach to the s(trong)-consistency analysis of their finite difference approximations on Cartesian grids. First we apply the…
We propose a new discontinuous Galerkin method based on the least-squares patch reconstruction for the biharmonic problem. We prove the optimal error estimate of the proposed method. The two-dimensional and three-dimensional numerical…
In this work, we propose a novel sampling method for Design of Experiments. This method allows to sample such input values of the parameters of a computational model for which the constructed surrogate model will have the least possible…
This paper explores large sample properties of the two-parameter $(\alpha,\theta)$ Poisson--Dirichlet Process in two contexts. In a Bayesian context of estimating an unknown probability measure, viewing this process as a natural extension…
We analyze the Ericksen--Leslie system equipped with the Oseen--Frank energy in three space dimensions. Recently, the author introduced the concept of dissipative solutions. These solutions show several advantages in comparison to the…
Minimum residual methods such as the least-squares finite element method (FEM) or the discontinuous Petrov--Galerkin method with optimal test functions (DPG) usually exclude singular data, e.g., non square-integrable loads. We consider a…
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…
The aim of this paper is to justify in dimensions two and three the ansatz of Caracciolo et al. stating that the displacement in the optimal matching problem is essentially given by the solution to the linearized equation i.e. the Poisson…
We begin an investigation of hybridizable discontinuous Galerkin (HDG) methods for approximating the solution of Dirichlet boundary control problems governed by elliptic PDEs. These problems can involve atypical variational formulations,…