Asymptotics of Polynomial Interpolation and the Bernstein Constants

It is well known that the interpolation error for $$\left| x\right| ^{\alpha },\alpha >0$$ x α , α > 0 in $$L_{\infty }\left[ -1,1\right] $$ L ∞ - 1 , 1 by Lagrange interpolation polynomials based on the zeros of the Chebyshev polynomials of first kind can be represented in its limiting form by entire functions of exponential type. In this paper, we establish new asymptotic bounds for these quantities when $$\alpha $$ α tends to infinity. Moreover, we present some explicit constructions for near best approximation polynomials to $$\left| x\right| ^{\alpha },\alpha >0$$ x α , α > 0 in the $$L_{\infty }$$ L ∞ norm which are based on the Chebyshev interpolation process. The resulting formulas possibly indicate a general approach towards the structure of the associated Bernstein constants.

Grouped Secret Sharing Schemes Based on Lagrange Interpolation Polynomials and Chinese Remainder Theorem

In a t , n threshold secret sharing (SS) scheme, whether or not a shareholder set is an authorized set totally depends on the number of shareholders in the set. When the access structure is not threshold, (t,n) threshold SS is not suitable. This paper proposes a new kind of SS named grouped secret sharing (GSS), which is specific multipartite SS. Moreover, in order to implement GSS, we utilize both Lagrange interpolation polynomials and Chinese remainder theorem to design two GSS schemes, respectively. Detailed analysis shows that both GSS schemes are correct and perfect, which means any authorized set can recover the secret while an unauthorized set cannot get any information about the secret.

A Coupled Pseudospectral-Differential Quadrature Method for a Class of Hyperbolic Telegraph Equations

Pseudospectral methods and differential quadrature methods are two kinds of important meshless methods, both of which have been widely used in scientific and engineering calculation. The Lagrange interpolation polynomials are used as the trial function of the two methods, and the same distribution of grid points is used. This paper points out that the differential quadrature method is a special form of the pseudospectral method. On the basis of the above, a coupled pseudospectral-differential quadrature method (PSDQM) is proposed to solve a class of hyperbolic telegraph equations. Theoretical analysis and numerical tests show that the new method has spectral precision convergence in spatial domain and has A-stability in time domain. And it is suitable for solving multidimensional telegraph equations.

Bivariate uniform approximation via bivariate Lagrange interpolation polynomials

In the present note, we extend some univariate uniform approximation results by means of Lagrange interpolating polynomials [Ivan, M., Elements of Interpolation Theory, Mediamira Science Publisher, Cluj-Napoca (2004)] to the bivariate case. It is well known that generally, in the univariate case, the sequence of Lagrange interpolation polynomials does’t converges to the approximated function. This fact was first observed by G. Faber (see [9]), which constructed an example when the sequence of Lagrange interpolation polynomials diverges. The result of G. Faber was more generalized by I. Muntean (see [12]). M. Ivan established first sufficient conditions for the uniform convergence of the sequence of Lagrange interpolation polynomials associated to a univariate real valued function. First, we represent the remainder term of bivariate Lagrange interpolation formula in terms of bivariate divided difference. Using this representation we establish sufficient conditions for the uniform convergence of the sequence of bivariate Lagrange interpolation polynomials to the approximated function.