Related papers: Minimal Cubature rules and polynomial interpolatio…
We here specialize the standard matrix-valued polynomial interpolation to the case where on the imaginary axis the interpolating polynomials admit various symmetries: Positive semidefinite, Skew-Hermitian, $J$-Hermitian, Hamiltonian and…
We prove estimates on the Lebesgue constants of the hyperinterpolation operator for functions on the unit ball $B^d \subset \RR^d$, with respect to Gegenbauer weight functions, $(1-|\xb|^2)^{\mu-1/2}$. The relationship between orthogonal…
We study multivariate numerical integration of smooth functions in weighted Sobolev spaces with dominating mixed smoothness $\alpha\geq 2$ defined over the $s$-dimensional unit cube. We propose a new quasi-Monte Carlo (QMC)-based quadrature…
By $B=B(x^{(0)};R)$ we denote the Euclidean ball in ${\mathbb R}^n$ given by the inequality $\|x-x^{(0)}\|\leq R$. Here $x^{(0)}\in{\mathbb R}^n, R>0$, $\|x\|:=\left(\sum_{i=1}^n x_i^2\right)^{1/2}$. We mean by $C(B)$ the space of…
Given a nondecreasing function $f$ on $[-1,1]$, we investigate how well it can be approximated by nondecreasing algebraic polynomials that interpolate it at $\pm 1$. We establish pointwise estimates of the approximation error by such…
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study the largest minimum weight $d(n,k)$ among all binary linear complementary dual $[n,k]$ codes. We…
This paper contains a survey of results obtained by the authors mostly during the past few years and published by 2021. In particular, we present the best of known estimates of numerical characteristics related to the research theme.…
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the…
We propose new weak error bounds and expansion in dimension one for optimal quantization-based cubature formula for different classes of functions, such that piecewise affine functions, Lipschitz convex functions or differentiable function…
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 define the interpolated polynomial multiple zeta values as a generalization of all of multiple zeta values, multiple zeta-star values, interpolated multiple zeta values, symmetric multiple zeta values, and polynomial multiple zeta…
In this paper, we study how to quickly compute the <-minimal monomial interpolating basis for a multivariate polynomial interpolation problem. We address the notion of "reverse" reduced basis of linearly independent polynomials and design…
For $G$ a complex reductive group and $B \subseteq G$ a Borel subgroup, we provide a reduction rule for certain weight multiplicities in Demazure modules $V_\lambda^w$: given a weight $\mu$ on a face of the associated weight polytope…
Barycentric interpolation is arguably the method of choice for numerical polynomial interpolation. The polynomial interpolant is expressed in terms of function values using the so-called barycentric weights, which depend on the…
In this paper, norm estimates are obtained for the problem of minimal-norm tangential interpolation by vector-valued analytic functions in weighted H^p spaces, expressed in terms of the Carleson constants of related scalar measures.…
In this document I develop a weight function theory of positive order basis function interpolants and smoothers. **In Chapter 1 the basis functions and data spaces are defined directly using weight functions. The data spaces are used to…
A recursive construction is presented for the projective cubature formulas of index $p$ on the unit spheres $S(m,K)\subset K^m$ where $K$ is $R$ or $C$, or $H$. This yields a lot of new upper bounds for the minimal number of nodes…
In this paper we analyze the approximation of multivariate integrals over the Euclidean plane for functions which are analytic. We show explicit upper bounds which attain the exponential rate of convergence. We use an infinite grid with…
We solve a long-standing open problem in theory of weighted inequalities concerning iterated Copson operators. We use a constructive approximation method based on a new discretization principle that is developed here. In result, we…
This work focuses on weighted Lagrange interpolation on an unbounded domain, and analyzes the Lebesgue constant for a sequence of weighted Leja points. The standard Leja points are a nested sequence of points defined on a compact subset of…