Gauss–Lobatto to Bernstein polynomials transformation

The aim of this paper is to transform a polynomial expressed as a weighted sum of discrete orthogonal polynomials on Gauss–Lobatto nodes into Bernstein form and vice versa. Explicit formulas and recursion expressions are derived. Moreover, an efficient algorithm for the transformation from Gauss–Lobatto to Bernstein is proposed. Finally, in order to show the robustness of the proposed algorithm, experimental results are reported.     

Jackson inequality for Banach spaces on the sphere

The best rate of approximation of functions on the sphere by spherical polynomials is majorized by recently introduced moduli of smoothness. The treatment applies to a wide class of Banach spaces of functions.      

Asymptotic relations between the Hahn-type polynomials and Meixner–Pollaczek, Jacobi, Meixner and Krawtchouk polynomials

It has been shown in Ferreira et al. [Asymptotic relations in the Askey scheme for hypergeometric orthogonal polynomials, Adv. in Appl. Math. 31(1) (2003) 61–85], López and Temme [Approximations of orthogonal polynomials in terms of Hermite polynomials, Methods Appl. Anal. 6 (1999) 131–146; The Askey scheme for hypergeometric orthogonal polynomials viewed from asymptotic analysis, J. Comput. Appl. Math. 133 (2001) 623–633] that the three lower levels of the Askey table of hypergeometric orthogonal polynomials are connected by means of asymptotic relations. In Ferreira et al. [Limit relations between the Hahn polynomials and the Hermite, Laguerre and Charlier polynomials, submitted for publication] we have established new asymptotic connections between the fourth level and the two lower levels. In this paper, we continue with that program and obtain asymptotic expansions between the fourth level and the third level: we derive 16 asymptotic expansions of the Hahn, dual Hahn, continuous Hahn and continuous dual Hahn polynomials in terms of Meixner–Pollaczek, Jacobi, Meixner and Krawtchouk polynomials. From these expansions, we also derive three new limits between those polynomials. Some numerical experiments show the accuracy of the approximations and, in particular, the accuracy in the approximation of the zeros of those polynomials.     

Parameter redundancy in neural networks: an application of Chebyshev polynomials

This paper deals with feedforward neural networks containing a single hidden layer and with sigmoid/logistic activation function. Training such a network is equivalent to implementing nonlinear regression using a flexible functional form, but the functional form in question is not easy to deal with. The Chebyshev polynomials are suggested as a way forward, providing an approximation to the network which is superior to Taylor series expansions. Application of these approximations suggests that the network is liable to a ‘naturally occurring’ parameter redundancy, which has implications for the training process as well as certain statistical implications. On the other hand, parameter redundancy does not appear to damage the fundamental property of universal approximation.      

McCoy环的扩张(英文)

A ring R is said to be right McCoy if the equation f(x)g(x)=0,where f(x)and g(x)are nonzero polynomials of R[x],implies that there exists nonzero s∈R such that f(x)s=0.It is proven that no proper(triangular)matrix ring is one-sided McCoy.It is shown that for many polynomial extensions,a ring R is right McCoy if and only if the polynomial extension over R is right McCoy.     

Blossoms and Optimal Bases

It is now classical to define blossoms by means of intersections of osculating flats. We consider here the most general context of spline spaces with sections in arbitrary extended Chebyshev spaces and with connections defined by arbitrary lower triangular matrices with positive diagonal elements. We show how the existence of blossoms in such spaces automatically leads to optimal bases in the sense of Carnicer and Peña.     

Multipliers of Laplace transform type for ultraspherical expansions

We define and investigate the multipliers of Laplace transform type associated to the differential operator L_λf (θ) = –f ″(θ) – 2λ cot θf ′(θ) + λ²f (θ), λ > 0. We prove that these operators are bounded in L^p ((0, π), dm_λ) and of weak type (1, 1) with respect to the same measure space, dm_λ (θ) = (sin θ)^2λ dθ. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Integrability of a SIS model

We prove that the classical model of an infectious disseise, which never kills and which does not induce autoimmunity, is integrable. This model can be written as x^′=−bxy−mx+cy+mk, y^′=bxy−(m+c)y with parameters b,c,k,m∈R. We provide the explicit expression of its first integrals and of the set of all its invariant algebraic curves.     

ON A THEOREM OF BERNSTEIN AND ITS APPLICATIONS TO WEIGHTED MINIMAX SERIES

1.IntroductionLetfbeacontinuousfunctionon[a,b].L[.willdesignatethesetofallpolynomialsofdegreelessorequalthannand11thesetofallpolyflomials.Asiswellknown,foreachntheminimaxoffisgivenby:wherepnisthebestuniformapproximationoffin11..LetusalsoconsidertileminimaxseriesgivenbytheexpressionThesetoffunctionsforwhichS*(f)=ZEd(f)相似文献   

Laguerre polynomials and the inverse Laplace transform using discrete data

We consider the problem of finding a function defined on (0,∞) from a countable set of values of its Laplace transform. The problem is severely ill-posed. We shall use the expansion of the function in a series of Laguerre polynomials to convert the problem in an analytic interpolation problem. Then, using the coefficients of Lagrange polynomials we shall construct a stable approximation solution. Error estimate is given. Numerical results are produced.