相关论文: An estimate of approximation of a matrix-valued fu…

Multipoint polynomial evaluation and interpolation are fundamental for modern symbolic and numerical computing. The known algorithms solve both problems over any field of constants in nearly linear arithmetic time, but the cost grows to…

We present a formula for the interpolation of matrix weighted spaces of vector valued functions via interpolation functors. We apply our formula to the particular case of interpolation of matrix weighted $L^p$ spaces by the real and complex…

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

A new alternative numerical procedure to the Szeg\H{o} quadrature formulas for the estimation of integrals with respect to a positive Borel measure $\mu$ supported on the unit circle is presented. As in many practical situations, we assume…

Matrices resulting from the discretization of a kernel function, e.g., in the context of integral equations or sampling probability distributions, can frequently be approximated by interpolation. In order to improve the efficiency, a…

We prove a.s. (almost sure) unisolvency of interpolation by continuous random sampling with respect to any given density, in spaces of multivariate a.e. (almost everywhere) analytic functions. Examples are given concerning polynomial and…

We construct polynomial approximations of Dzjadyk type (in terms of the k-th modulus of continuity, $k \ge 1$) for analytic functions defined on a continuum E in the complex plane, which simultaneously interpolate at given points of E.…

In 2002 A.\ Hartmann and X.\ Massaneda obtained necessary and sufficient conditions for interpolation sequences for classes of analytic functions in the unit disc such that $\log M(r,f)=O((1-r)^{-\rho})$, $0<r<1$, $\rho \in (0 , +\infty)$,…

For p prime, we give an explicit formula for Igusa's local zeta function associated to a polynomial mapping f=(f_1,...,f_t): Q_p^n -> Q_p^t, with f_1,...,f_t in Z_p[x_1,...,x_n], and an integration measure on Z_p^n of the form |g(x)||dx|,…

Unitary best approximation to the exponential function on an interval on the imaginary axis has been introduced recently. In the present work two algorithms are considered to compute this best approximant: an algorithm based on rational…

Let $B$ be a Euclidean ball in ${\mathbb R}^n$ and let $C(B)$ be a space of~continuous functions $f:B\to{\mathbb R}$ with the uniform norm $\|f\|_{C(B)}:=\max_{x\in B}|f(x)|.$ By $\Pi_1\left({\mathbb R}^n\right)$ we mean a set of…

The authors of ``A note on the complexity of a phaseless polynomial interpolation'' have shown that phaseless polynomial interpolation over $\mathbf{Q}$ is possible with $n+2$ points, where $n$ is the upper-bound on the degree of a…

A function $f\colon\mathbb R\to\mathbb R$ is called \emph{$k$-monotone} if it is $(k-2)$-times differentiable and its $(k-2)$nd derivative is convex. A point set $P\subset\mathbb R^2$ is \emph{$k$-monotone interpolable} if it lies on a…

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

In this dissertation, it is first shown that, when the radial basis function is a $p$-norm and $1 < p < 2$, interpolation is always possible when the points are all different and there are at least two of them. We then show that…

Let $\mathbf{f} = \left(f_1, \dots, f_p\right) $ be a polynomial tuple in $\mathbb{Q}[z_1, \dots, z_n]$ and let $d = \max_{1 \leq i \leq p} \deg f_i$. We consider the problem of computing the set of asymptotic critical values of the…

Given $k\in N$, a nonnegative function $f\in C^r[a,b]$, $r\ge 0$, an arbitrary finite collection of points $\big\{\alpha_i\big\}_{i\in J} \subset [a,b]$, and a corresponding collection of nonnegative integers $\big\{m_i\big\}_{i\in J}$ with…

In this note we show that the degree of the interpolation polynomial for equidistant base points is characterized by the regularity of matrices of combinatorical type.

In this paper, we present some extensions of interpolation between the arithmetic-geometric means inequality. Among other inequalities, it is shown that if $A, B, X$ are $n\times n$ matrices, then \begin{align*}…

We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…