Related papers: Bravais Lattices for Euclidean Degree Efficient Po…
We develop a constructive piecewise polynomial approximation theory in weighted Sobolev spaces with Muckenhoupt weights for any polynomial degree. The main ingredients to derive optimal error estimates for an averaged Taylor polynomial are…
We consider Lagrange interpolation on the set of finitely many intervals. This problem is closely related to the least deviating polynomial from zero on such sets. We will obtain lower and upper estimates for the corresponding Lebesgue…
The development of high-degree interpolation polynomials which use the values of the function and its subsequent derivatives is reformulated. Also, we present a variant of new formula in barycentric form.
We present a simple and efficient acceleration technique for an arbitrary method for computing the Euclidean projection of a point onto a convex polytope, defined as the convex hull of a finite number of points, in the case when the number…
The purpose of this paper is twofold. Firstly, we provide explicit and compact formulas for computing both Caputo and (modified) Riemann-Liouville (RL) fractional pseudospectral differentiation matrices (F-PSDMs) of any order at general…
Interpolation-based techniques have become popularized in recent years because of their inherently modular and local reasoning, which can scale up existing formal verification techniques like theorem proving, model-checking, abstraction…
In this paper we investigate multivariate integration in weighted unanchored Sobolev spaces of smoothness of arbitrarily high order. As quadrature points we employ higher order polynomial lattice point sets over $\mathbb{F}_{2}$ which are…
We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…
We present a local interpolation method in four dimensions utilising cubic splines. An extension of the three-dimensional tricubic method, the interpolated function has C$^1$ continuity and its partial derivatives are analytically…
A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…
A "blendstring" is a piecewise polynomial interpolant with high-degree two-point Hermite interpolational polynomials on each piece, analogous to a cubic spline. Blendstrings are smoother and can be more accurate than cubic splines, and can…
The problem of computing Craig interpolants in SAT and SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for interpolant generation have been presented for some theories of…
We introduce explicit families of good interpolation points for interpolation on a triangle in $\mathbb{R}^2$ that may be used for either polynomial interpolation or a certain rational interpolation for which we give explicit formulas.
The complexity of Philip Wolfe's method for the minimum Euclidean-norm point problem over a convex polytope has remained unknown since he proposed the method in 1974. The method is important because it is used as a subroutine for one of the…
This is an expanded version of my plenary lecture at the 8th European Congress of Mathematics in Portoro\v{z} on 23 June 2021. The main part of the paper is a survey of recent applications of complex-analytic techniques to the theory of…
Several cubature formulas on the cubic domains are derived using the discrete Fourier analysis associated with lattice tiling, as developed in \cite{LSX}. The main results consist of a new derivation of the Gaussian type cubature for the…
This paper deals with the kernel-based approximation of a multivariate periodic function by interpolation at the points of an integration lattice -- a setting that, as pointed out by Zeng, Leung, Hickernell (MCQMC2004, 2006) and Zeng,…
We describe the birational correspondences, induced by the Fourier-Mukai functor, between moduli spaces of semistable sheaves on elliptic surfaces with sections, using the notion of $P$-stability in the derived category. We give explicit…
Complexity bounds for many problems on matrices with univariate polynomial entries have been improved in the last few years. Still, for most related algorithms, efficient implementations are not available, which leaves open the question of…
The Partition of Unity (PU) method, performed with local Radial Basis Function (RBF) approximants, has been proved to be an effective tool for solving large scattered data interpolation problems. However, in order to achieve a good…