Related papers: On the filtered polynomial interpolation at Chebys…
Interior eigenvalue problems for large-scale sparse Hermitian matrices are fundamental in computational science. We propose an adaptive polynomial filtering strategy based on Chebyshev expansion of a step function, integrated into a…
We prove matching direct and inverse theorems for (algebraic) polynomial approximation with doubling weights $w$ having finitely many zeros and singularities (i.e., points where $w$ becomes infinite) on an interval and not too ``rapidly…
Sparse interpolation} refers to the exact recovery of a function as a short linear combination of basis functions from a limited number of evaluations. For multivariate functions, the case of the monomial basis is well studied, as is now…
In this paper, we study functional approximations where we choose the so-called radial basis function method and more specifically, quasi-interpolation. From the various available approaches to the latter, we form new quasi-Lagrange…
We give necessary and sufficient conditions for interpolation inequalities of the type considered by Marcinkiewicz and Zygmund to be true in the case of Banach space-valued polynomials and Jacobi weights and nodes. We also study the…
This paper considers the extension of classical Lagrange interpolation in one real or complex variable to "polynomials of one quaternionic variable". To do this we develop some aspects of the theory of such polynomials. We then give a…
For the multivariate trigonometric polynomials we study convolution with the corresponding the de la Vallee Poussin kernel from the point of view of discretization. In other words, we replace the normalized Lebesgue measure by a discrete…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…
A \Riesz-basis sequence for $L_2[-\pi,\pi]$ is a strictly increasing sequence $X:=(x_j)_{j\in\mathbb{Z}}$ in $\mathbb{R}$ such that the set of functions $\left(e^{-ix_j(\cdot)}\right)_{j\in\mathbb{Z}}$ is a Riesz basis for $L_2[-\pi,\pi]$.…
We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…
For $m,n \in \mathbb{N}$, $m\geq 1$ and a given function $f : \mathbb{R}^m\longrightarrow \mathbb{R}$, the polynomial interpolation problem (PIP) is to determine a unisolvent node set $P_{m,n} \subseteq \mathbb{R}^m$ of…
For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…
We discuss a thinning and an embedding procedure to construct finite Gibbs processes with a given Papangelou intensity. Extending the approach in Hofer-Temmel (2019) and Hofer-Temmel and Houdebert (2019) we will use this to couple two…
Many high dimensional integrals can be reduced to the problem of finding the relative measures of two sets. Often one set will be exponentially larger than the other, making it difficult to compare the sizes. A standard method of dealing…
We study fully-discrete approximations and quadratures of infinite-variate functions in abstract Bochner spaces associated with a Hilbert space $X$ and an infinite-tensor-product Jacobi measure. For target infinite-variate functions taking…
We study the application of the Augmented Lagrangian Method to the solution of linear ill-posed problems. Previously, linear convergence rates with respect to the Bregman distance have been derived under the classical assumption of a…
As we all known, there is still a long way for us to solve arbitrary multivariate Lagrange interpolation in theory. Nevertheless, it is well accepted that theories about Lagrange interpolation on special point sets should cast important…
The paper deals with polynomial interpolation, least-square approximation and cubature of functions defined on the rectangular cylinder, $K=D\times [-1,1]$, with $D$ the unit disk. The nodes used for these processes are the {\it Approximate…
We characterize the generalized Chebyshev polynomials of the second kind (Chebyshev-II), and then we provide a closed form of the generalized Chebyshev-II polynomials using the Bernstein basis. These polynomials can be used to describe the…
For the quadratic Lagrange interpolation function, an algorithm is proposed to provide explicit and verified bound for the interpolation error constant that appears in the interpolation error estimation. The upper bound for the…