Related papers: On the quadrature exactness in hyperinterpolation
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
We design a quasi-interpolation operator from the Sobolev space $H^1_0(\Omega)$ to its finite-dimensional finite element subspace formed by piecewise polynomials on a simplicial mesh with a computable approximation constant. The operator 1)…
The manuscript describes a quadrature rule that is designed for the high order discretization of boundary integral equations (BIEs) using the Nystr\"{o}m method. The technique is designed for surfaces that can naturally be parameterized…
In this work, we introduce new families of nonconforming approximation methods for reconstructing functions on general polygonal meshes. These methods are defined using degrees of freedom based on weighted moments of orthogonal polynomials…
Interpolation error estimates in terms of geometric quality measures are established for harmonic coordinates on polytopes in two and three dimensions. First we derive interpolation error estimates over convex polygons that depend on the…
We study a new simple quadrature rule based on integrating a $C^1$ quadratic spline quasi-interpolant on a bounded interval. We give nodes and weights for uniform and non-uniform partitions. We also give error estimates for smooth functions…
Methods for the computation of classical Gaussian quadrature rules are described which are effective both for small and large degree. These methods are reliable because the iterative computation of the nodes has guaranteed convergence, and…
The interpolation-regression approximation is a powerful tool in numerical analysis for reconstructing functions defined on square or triangular domains from their evaluations at a regular set of nodes. The importance of this technique lies…
This work presents spectral, mesh-free, Green's theorem-based numerical quadrature schemes for integrating functions over planar regions bounded by rational parametric curves. Our algorithm proceeds in two steps: (1) We first find…
We prove the convergence of an incremental projection numerical scheme for the time-dependent incompressible Navier--Stokes equations, without any regularity assumption on the weak solution. The velocity and the pressure are discretised in…
Quasi-Newton methods form an important class of methods for solving nonlinear optimization problems. In such methods, first order information is used to approximate the second derivative. The aim is to mimic the fast convergence that can be…
We develop a new approximation theory for linear and quadratic interpolation models, suitable for use in convex-constrained derivative-free optimization (DFO). Most existing model-based DFO methods for constrained problems assume the…
In this paper we establish the optimal multilinear restriction estimate for n-1 hypersurfaces with some curvature, where $n$ is the dimension of the underlying space. The result is sharp up to the endpoint and the role of curvature is made…
We establish a geometric condition guaranteeing exact copositive relaxation for the nonconvex quadratic optimization problem under two quadratic and several linear constraints, and present sufficient conditions for global optimality in…
We extend an implicit regularization scheme to be applicable in the $n$-dimensional space-time. Within this scheme divergences involving parity violating objects can be consistently treated without recoursing to dimensional continuation.…
The MultiExp Gaussian quadrature rule proposed by Gill and Chien has many compelling properties for the integration of radial integrands encountered in electronic structure, but thus far has only been computed up to N = 50, with some…
An upper bound for the Lebesgue constant (the supremum norm) of the operator of interpolation of a function in equally spaced points of a triangle by a polynomial of total degree less than or equal to n is obtained. Earlier, the rate of…
The paper aims at proposing an efficient and stable quasi-interpolation based method for numerically computing the Helmholtz-Hodge decomposition of a vector field. To this end, we first explicitly construct a matrix kernel in a general form…
Accurate evaluation of nearly singular integrals plays an important role in many boundary integral equation based numerical methods. In this paper, we propose a variant of singularity swapping method to accurately evaluate the layer…
Gau{\ss} cubature (multidimensional numerical integration) rules are the natural generalisation of the 1D Gau{\ss} rules. They are optimal in the sense that they exactly integrate polynomials of as high a degree as possible for a particular…