On the Zero-Divergence of Equidistant Lagrange Interpolation

 In 1942, P. Szász published the surprising result that if a function f is of bounded variation on [−1, 1] and continuous at 0 then the sequence of the equidistant Lagrange interpolation polynomials converges at 0 to . In the present note we give a construction of a function continuous on [−1, 1] whose Lagrange polynomials diverge at 0. Moreover, we show that the rate of divergence attains almost the maximal possible rate.     

On the Zero-Divergence of Equidistant Lagrange Interpolation

 In 1942, P. Szász published the surprising result that if a function f is of bounded variation on [−1, 1] and continuous at 0 then the sequence of the equidistant Lagrange interpolation polynomials converges at 0 to . In the present note we give a construction of a function continuous on [−1, 1] whose Lagrange polynomials diverge at 0. Moreover, we show that the rate of divergence attains almost the maximal possible rate. (Received 2 February 2000)     

Optimal-order quadratic interpolation in vertices of unstructured triangulations

We study the problem of Lagrange interpolation of functions of two variables by quadratic polynomials under the condition that nodes of interpolation are vertices of a triangulation. For an extensive class of triangulations we prove that every inner vertex belongs to a local six-tuple of vertices which, used as nodes of interpolation, have the following property: For every smooth function there exists a unique quadratic Lagrange interpolation polynomial and the related local interpolation error is of optimal order. The existence of such six-tuples of vertices is a precondition for a successful application of certain post-processing procedures to the finite-element approximations of the solutions of differential problems. This work was supported by the grant GA ČR 103/05/0292.     

Approximation of multidimensional functions with a given majorant of mixed moduli of continuity

In the paper order-exact upper bounds for the best approximations of classesH _q ^Emphasis>/ω by trigonometric polynomials are obtained. The spectrum of the approximating polynomials lies in sets generated by the level surfaces of the function ω(t). These sets are a generalization of hyperbolic crosses to the case of an arbitrary function ω(t). Translated fromMatematicheskie Zametki, Vol. 65, No. 1, pp. 107–117, January, 1999.     

New families of generating functions for certain class of three-variable polynomials

Recently, Srivastava, Özarslan and Kaanoglu have introduced certain families of three and two variable polynomials, which include Lagrange and Lagrange-Hermite polynomials, and obtained families of two-sided linear generating functions between these families [H.M. Srivastava, M.A. Özarslan, C. Kaanoglu, Some families of generating functions for a certain class of three-variable polynomials, Integr. Transform. Spec. Funct. iFirst (2010) 1-12]. The main object of this investigation is to obtain new two-sided linear generating functions between these families by applying certain hypergeometric transformations. Furthermore, more general families of bilinear, bilateral, multilateral finite series relationships and generating functions are presented for them.     

The Lagrange inversion theorem in the smooth case

The classical Lagrange inversion theorem is a concrete, explicit form of the implicit function theorem for real analytic functions. An explicit construction shows that the formula is not true for all merely smooth functions. The authors modify the Lagrange formula by replacing the smooth function by its Maclaurin polynomials. The resulting modified Lagrange series is, in analogy to the Maclaurin polynomials, an approximation to the solution function accurate to o(x^N) as x→0.     

Bivariate Lagrange interpolation at the Padua points: the ideal theory approach

The Padua points are a family of points on the square [−1, 1]² given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials. Interpolation polynomials and cubature formulas based on the Padua points are studied from an ideal theoretic point of view, which leads to the discovery of a compact formula for the interpolation polynomials. The L ^p convergence of the interpolation polynomials is also studied. S. De Marchi and M. Vianello were supported by the “ex-60%” funds of the University of Padua and by the INdAM GNCS (Italian National Group for Scientific Computing). Y. Xu was partially supported by NSF Grant DMS-0604056.     

On mean approximation by polynomials with gaps on Caratheodory sets

The paper presents some new results on the possibility of approximation by polynomials with gaps. The approximations are done in the norm of the space L _p , 1 ≤ p < + ∞, on the Caratheodory sets in the complex plane. The lacunary versions of some results by Farell—Markushevich, S. Sinanian, A. L. Shahinian are obtained (Theorems 1, 3, 5). Similar approximations by the real parts of lacunary polynomials are given (Theorems 2, 4, 6). Dedicated to the memory of academician S. N. Mergelyan     

A generating function for nonstandard orthogonal polynomials involving differences: the Meixner case

In this paper we deal with a family of nonstandard polynomials orthogonal with respect to an inner product involving differences. This type of inner product is the so-called Δ-Sobolev inner product. Concretely, we consider the case in which both measures appearing in the inner product correspond to the Pascal distribution (the orthogonal polynomials associated to this distribution are known as Meixner polynomials). The aim of this work is to obtain a generating function for the Δ-Meixner–Sobolev orthogonal polynomials and, by using a limit process, recover a generating function for Laguerre–Sobolev orthogonal polynomials.     

Approximation ofMH q r -class functions by Haar polynomials

The paper deals with approximations of functions with bounded mixed difference by Haar polynomials. Approximations of the following two different types are studied: the classical best approximation by Haar polynomials with indices lying in hyperbolic crosses and the bestm-term approximation by Haar polynomials. Translated fromMatematicheskie Zametki, Vol. 66, No. 3, pp. 323–335, September, 1999.     

Elliptic difference singular perturbations

Summary Difference approximations for differential singular perturbations with small parameter ɛ are considered. We point out ellipticity and coerciveness conditions which arenecessary andsufficient for a two-sided a priori estimate to hold for the solution of difference singular perturbation uniformly with respect to the ratio of both small parameters: the original one ɛ and the meshsize h. Entrata in Redazione il 27 maggio 1978.     

Spline approximations inL p on an interval

We consider approximations in the spaceL _p[0,a] to differentiable functions whoselth derivative belongs toL _p[0,a]. The function to be approximated is extended to the entire axis by Lagrange interpolation polynomials, and spline approximation with equally spaced nodes on the entire axis is then applied. This procedure results in a good approximation to the original function.Translated fromMatematicheskie Zametki, Vol. 58, No. 2, pp. 281–294, August, 1995.The author is grateful to Yu. N. Subbotin for posing the problem and for his attention to the work, as well as to N. I. Chernykh for useful remarks.     

Lagrange Inversion Theorem for Dirichlet series

We prove an analogue of the Lagrange Inversion Theorem for Dirichlet series. The proof is based on studying properties of Dirichlet convolution polynomials, which are analogues of convolution polynomials introduced by Knuth in [5].     

Uniformn-analytic polynomial approximations of functions on rectifiable contours in ℂ

We study approximations of functions byn-analytic polynomials in the uniform norm on closed rectifiable Jordan curves in the complex plane. It is shown that, in contrast to the case of uniform approximations by complex polynomials, there are no topological criteria for the existence of such approximations. We obtain a criterion for the existence ofn-analytic polynomial approximations in terms of analytic properties of these curves. Translated fromMatematicheskie Zametki, Vol. 59, No. 4, pp. 603–609, April, 1996. The author is extremely grateful to A. G. Vitushkin and P. V. Paramonov for the statement of the problem and their attention to the work. The work was partially supported by the Russian Foundation for Basic Research under grant No. 93-01-00225.     

Lagrange基函数的复矩阵有理插值及连分式插值

1引言 矩阵有理插值问题与系统线性理论中的模型简化问题和部分实现问题有着紧密的联系~[1][2]，在矩阵外推方法中也常常涉及线性或有理矩阵插值问题~[3]。按照文~[1]的阐述。目前已经研究的矩阵有理插值问题包括矩阵幂级数和Newton-Pade逼近。Hade逼近，联立Pade逼近，M-Pade逼近，多点Pade逼近等。显然，上述各种形式的矩阵Pade逼上梁山近是矩     

Asymptotic analysis of the Askey-scheme I: from Krawtchouk to Charlier

We analyze the Charlier polynomials C _n (χ) and their zeros asymptotically as n → ∞. We obtain asymptotic approximations, using the limit relation between the Krawtchouk and Charlier polynomials, involving some special functions. We give numerical examples showing the accuracy of our formulas.      

Functional approach to a posteriori error estimation for elliptic optimal control problems with distributed control

A new approach to the a posteriori analysis of distributed optimal control problems is presented. The approach is based on functional type a posteriori estimates that provide computable and guaranteed bounds of errors for any conforming approximations of a boundary value problem. Computable two-sided a posteriori estimates for the cost functional and estimates for approximations of the state and control functions are derived. Numerical results illustrate the efficiency of the approach. Bibliography: 35 titles. __________ Translated from Problemy Matematicheskogo Analiza, No. 35, 2007, pp. 3–14     

On Divergence of Hermite—Fejér Interpolation to f(z)=z in the Complex Plane

We show that for a broad class of interpolatory matrices on [-1,1] the sequence of polynomials induced by Hermite—Fejér interpolation to f(z)=z diverges everywhere in the complex plane outside the interval of interpolation [-1,1] . This result is in striking contrast to the behavior of the Lagrange interpolating polynomials. June 15, 1998. Date accepted: January 26, 1999.     

Discrete Fourier Analysis on Fundamental Domain and Simplex of A d Lattice in d-Variables

A discrete Fourier analysis on the fundamental domain Ω _d of the d-dimensional lattice of type A _d is studied, where Ω₂ is the regular hexagon and Ω₃ is the rhombic dodecahedron, and analogous results on d-dimensional simplex are derived by considering invariant and anti-invariant elements. Our main results include Fourier analysis in trigonometric functions, interpolation and cubature formulas on these domains. In particular, a trigonometric Lagrange interpolation on the simplex is shown to satisfy an explicit compact formula and the Lebesgue constant of the interpolation is shown to be in the order of (log n) ^d . The basic trigonometric functions on the simplex can be identified with Chebyshev polynomials in several variables already appeared in literature. We study common zeros of these polynomials and show that they are nodes for a family of Gaussian cubature formulas, which provides only the second known example of such formulas.