AbstractWe investigate the following problem: For which open simply connected domains do there exist interpolation schemes (a set of interpolation points) such that for any analytic function defined in the domain the corresponding interpolating polynomials converge to the function when the degree of the polynomials tends to infinity? We also study similar problems for rational interpolants. These problems are connected to the balayage (sweeping out) problems of measures
Under the assumption that the function f is bounded on [-1, 1] and analytic at x = 0 we prove the lo...
AbstractUnder the assumption that the function ƒ is bounded on [−1, 1] and analytic at x = 0 we prov...
Firstly, we present new sets of nodes for polynomial interpolation on the square that are asymptotic...
Let E be a compact set in C with connected regular complement and let pn, n 2 N, be a sequence of p...
Abstract. Polynomial interpolation to analytic functions can be very accurate, depending on the dist...
Polynomial interpolation to analytic functions can be very accurate, depending on the distribution o...
We consider sequences of rational interpolants rn(z) of degree n to the exponential function ez asso...
AbstractIn this paper we extend to general interpolation schemes which satisfy only a mild regularit...
AbstractA general framework, leading to a parametrization of all rational functions which interpolat...
.- In [Ber-Mit] we have used rational functions with a fixed denominator (i.e., independent of the i...
The object of investigation: the interpolation polynomials. The purpose of the work: the detection o...
We discuss the Newton-Gregory interpolation process based on the ge-ometric mesh 1; q; q2; : ::, wit...
Firstly, we present new sets of nodes for {\em polynomial interpolation on the square} that are asym...
.- Polynomial interpolation between large numbers of arbitrary nodes does notouriously not in genera...
AbstractThis paper is concerned with interpolation in the sense of Hermite by certain rational funct...
Under the assumption that the function f is bounded on [-1, 1] and analytic at x = 0 we prove the lo...
AbstractUnder the assumption that the function ƒ is bounded on [−1, 1] and analytic at x = 0 we prov...
Firstly, we present new sets of nodes for polynomial interpolation on the square that are asymptotic...
Let E be a compact set in C with connected regular complement and let pn, n 2 N, be a sequence of p...
Abstract. Polynomial interpolation to analytic functions can be very accurate, depending on the dist...
Polynomial interpolation to analytic functions can be very accurate, depending on the distribution o...
We consider sequences of rational interpolants rn(z) of degree n to the exponential function ez asso...
AbstractIn this paper we extend to general interpolation schemes which satisfy only a mild regularit...
AbstractA general framework, leading to a parametrization of all rational functions which interpolat...
.- In [Ber-Mit] we have used rational functions with a fixed denominator (i.e., independent of the i...
The object of investigation: the interpolation polynomials. The purpose of the work: the detection o...
We discuss the Newton-Gregory interpolation process based on the ge-ometric mesh 1; q; q2; : ::, wit...
Firstly, we present new sets of nodes for {\em polynomial interpolation on the square} that are asym...
.- Polynomial interpolation between large numbers of arbitrary nodes does notouriously not in genera...
AbstractThis paper is concerned with interpolation in the sense of Hermite by certain rational funct...
Under the assumption that the function f is bounded on [-1, 1] and analytic at x = 0 we prove the lo...
AbstractUnder the assumption that the function ƒ is bounded on [−1, 1] and analytic at x = 0 we prov...
Firstly, we present new sets of nodes for polynomial interpolation on the square that are asymptotic...
DOI
Add to ORKG