Related papers: Minimal Cubature rules and polynomial interpolatio…
In this paper we study an extension of the Polynomial Calculus proof system where we can introduce new variables and take a square root. We prove that an instance of the subset-sum principle, the binary value principle, requires refutations…
In this paper we investigate polynomial interpolation using orthogonal polynomials. We use weight functions associated with orthogonal polynomials to define a weighted form of Lagrange interpolation. We introduce an upper bound of error…
We employ a multivariate extension of the Gauss quadrature formula, originally due to Berens, Schmid and Xu [BSX95], so as to derive cubature rules for the integration of symmetric functions over hypercubes (or infinite limiting…
The paper deals with two fundamental types of trigonometric polynomials and splines on uniform grids, which allow us to construct interpolation approximations that depend linearly on the values of the interpolated function. Fundamental on…
We investigate numerical differentiation formulas on irregular centers in two or more variables that are exact for polynomials of a given order and minimize an absolute seminorm of the weight vector. Error bounds are given in terms of a…
We study kernel quadrature rules with convex weights. Our approach combines the spectral properties of the kernel with recombination results about point measures. This results in effective algorithms that construct convex quadrature rules…
We study monotone Hermite interpolation on an interval, where both function values and first derivatives are prescribed at the nodes. Among all $C^{1,1}$ interpolants, we seek one with optimal curvature, measured by $\|F''\|_{L^\infty}$. In…
Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…
This short note develops fundamental functions associated with the scattered shifts of the inverse \emph{multiquadric} function $(\alpha^2 + x^2)^{-k}$, for $k\in\mathbb{N}$.
We analyze the accuracy of the discrete least-squares approximation of a function $u$ in multivariate polynomial spaces $\mathbb{P}_\Lambda:={\rm span} \{y\mapsto y^\nu \,: \, \nu\in \Lambda\}$ with $\Lambda\subset \mathbb{N}_0^d$ over the…
We study Lissajous curves in the 3-cube, that generate algebraic cubature formulas on a special family of rank-1 Chebyshev lattices. These formulas are used to construct trivariate hyperinterpolation polynomials via a single 1-d Fast…
In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such…
Polynomial convergence bounds are considered for left, right, and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system Ax = b. In particular, the case of positive definite A is considered.…
In this note we study multivariate integration for permutation-invariant functions from a certain Banach space E_{d,\alpha} of Korobov type in the worst case setting. We present a lower error bound which particularly implies that in…
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…
A quadrature rule of a measure $\mu$ on the real line represents a convex combination of finitely many evaluations at points, called nodes, that agrees with integration against $\mu$ for all polynomials up to some fixed degree. In this…
We study the generalization error of functions that interpolate prescribed data points and are selected by minimizing a weighted norm. Under natural and general conditions, we prove that both the interpolants and their generalization errors…
We investigate some conditions under which the Lebesgue constants or Lebesgue functions are bounded for the classical Lagrange polynomial interpolation on a compact subset of $\mathbb R$. In particular, relationships of such boundedness…
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…
A product quadrature rule, based on the filtered de la Vall\'ee Poussin polynomial approximation, is proposed for evaluating the finite Hilbert transform in [-1; 1]. Convergence results are stated in weighted uniform norm for functions…