A polynomial approximation for arbitrary functions
نویسندگان
چکیده
منابع مشابه
A polynomial approximation for arbitrary functions
Abstract We describe an expansion of Legendre polynomials, analogous to the Taylor expansion, to approximate arbitrary functions. We show that the polynomial coefficients in Legendre expansion, thus, the whole series, converge to zero much more rapidly compared to the Taylor expansion of the same order. Furthermore, using numerical analysis with sixth-order polynomial expansion, we demonstrate ...
متن کاملPolynomial Approximation of Functions
Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hubert are presented. Using an averaged Taylor series, we represent a function as a polynomial plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer o...
متن کاملPolynomial Approximation of Functions in Sobolev Spaces
Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hubert are presented. Using an averaged Taylor series, we represent a function as a polynomial plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer o...
متن کاملPolynomial Threshold Functions: Structure, Approximation and Pseudorandomness
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows that low-degree polynomial threshold functions cannot approximate any function with many influential variables. We provide a couple of examples where this tech...
متن کاملSAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos
A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2012
ISSN: 0893-9659
DOI: 10.1016/j.aml.2012.03.007