Fourier transform of Bernstein–Bézier polynomials
نویسندگان
چکیده
منابع مشابه
Fourier Transform of Bernstein-Bézier Polynomials
Explicit formulae, in terms of Bernstein-Bézier coefficients, of the Fourier transform of bivariate polynomials on a triangle and univariate polynomials on an interval are derived in this paper. Examples are given and discussed to illustrate the general theory. Finally, this consideration is related to the study of refinement masks of spline function vectors. AMS Subject Classification: 42C40, ...
متن کاملThe Finite Fourier Transform of Classical Polynomials
The finite Fourier transform of a family of orthogonal polynomials is the usual transform of these polynomials extended by 0 outside their natural domain of orthogonality. Explicit expressions are given for the Legendre, Jacobi, Gegenbauer and Chebyshev families. 2010 Mathematics subject classification: primary 33C45; secondary 44A38, 33C47, 33C10, 42C10.
متن کاملFourier Transform Infrared and Fourier Transform Raman Spectroscopy of Polymers
This chapter covers the fundamental principles and current applications of Fourier transform (FT) infrared and Fourier transform Raman spectroscopies as utilized in the analysis of polymeric materials. The primary emphasis of the first part is on the principles and advantages of these interferometric methods, whereas the remaining sections illustrate numerous applications focusing on the struct...
متن کاملFourier Transform
Very broadly speaking, the Fourier transform is a systematic way to decompose “generic” functions into a superposition of “symmetric” functions. These symmetric functions are usually quite explicit (such as a trigonometric function sin(nx) or cos(nx)), and are often associated with physical concepts such as frequency or energy. What “symmetric” means here will be left vague, but it will usually...
متن کاملFinite Fourier Transform, Circulant Matrices, and the Fast Fourier Transform
Suppose we have a function s(t) that measures the sound level at time t of an analog audio signal. We assume that s(t) is piecewise-continuous and of finite duration: s(t) = 0 when t is outside some interval a ≤ t ≤ b. Make a change of variable x = (t− a)/(b− a) and set f(x) = s(t). Then 0 ≤ x ≤ 1 when a ≤ t ≤ b, and f(x) is a piecewise continuous function of x. We convert f(x) into a digital s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2007
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2006.01.072