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

It was shown by James Tung in 2005 that if a sequence $Z=\{z_n\}$ of points in the complex plane satisfies $$\inf_{n\not=m}|z_n-z_m|>2/\sqrt\alpha,$$ then $Z$ is a sequence of interpolation for the Fock space $F^p_\alpha$. Using results…

Given a function f: [a,b] -> R, if f(a) < 0 and f(b)> 0 and f is continuous, the Intermediate Value Theorem implies that f has a root in [a,b]. Moreover, given a value-oracle for f, an approximate root of f can be computed using the…

In this paper we extend the dichotomy given by Samuelsson and Wold that can be thought of as an analogue of the Wermer maximality theorem in $\mathbb{C}^2$ for certain polynomial polyhedra. We consider complex non-degenerate simply…

We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…

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…

The paper contains a survey of the results obtained by the author in recent years. These results concern the application in multivariate polynomial interpolation of some geometric constructions and methods. In particular, we give estimates…

A new computational framework for evaluation of the gamma function $\Gamma(z)$ over the complex plane is developed. The algorithm is based on interpolation by rational functions, and generalizes the classical methods of Lanczos…

Let $f(Z)=Z^n-a_{1}Z^{n-1}+\cdots+(-1)^{n-1}a_{n-1}Z+(-1)^na_n$ be a monic polynomial with coefficients in a ring~$R$ with identity, not necessarily commutative. We study the ideal $I_f$ of $R[X_1,\dots,X_n]$ generated by…

The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…

We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…

We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called impossibility theorem) has shown that the best…

We obtain order-exact estimates for uniform approximations by using Zygmund sums $Z^{s}_{n}$ of classes $C^{\psi}_{\beta,p}$ of $2\pi$-periodic continuous functions $f$ representable by convolutions of functions from unit balls of the space…

The valence of a function f at a point $z_0$ is the number of distinct, finite solutions to $f(z) = z_0.$ In this paper, we bound the valence of complex-valued harmonic polynomials in the plane for some special harmonic polynomials of the…

We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some methods of this approximation for functions in a class induced by the convolution with a given function,…

Motivated by classical results of approximation theory, we define an Hermite-type interpolation in terms of $n$-dimensional subspaces of the space of $n$ times continuously differentiable functions. In the main result of this paper, we…

We propose and investigate two new methods to approximate $f({\bf A}){\bf b}$ for large, sparse, Hermitian matrices ${\bf A}$. The main idea behind both methods is to first estimate the spectral density of ${\bf A}$, and then find…

A $\textit{polygonal curve}$ is a collection of $m$ connected line segments specified as the linear interpolation of a list of points $\{p_0, p_1, \ldots, p_m\}$. These curves may be obtained by sampling points from an oriented curve in…

We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…

We give a representation of the classical theory of multiplicative arithmetic functions (MF)in the ring of symmetric polynomials. The basis of the ring of symmetric polynomials that we use is the isobaric basis, a basis especially sensitive…

While direct statements for kernel based interpolation on regions $\Omega \subset \mathbb{R}^d$ are well researched, far less is known about corresponding inverse statements. The available inverse statements for kernel based interpolation…