๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Interpolation using the fast discrete sine transform

โœ Scribed by Zhongde Wang; Lifeng Wang

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
406 KB
Volume
26
Category
Article
ISSN
0165-1684

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms for solving Hermite interpola
Algorithms for solving Hermite interpolation problems using the Fast Fourier Transform
โœ Elรญas Berriochoa; Alicia Cachafeiro ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 297 KB

We present a method for computing the Hermite interpolation polynomial based on equally spaced nodes on the unit circle with an arbitrary number of derivatives in the case of algebraic and Laurent polynomials. It is an adaptation of the method of the Fast Fourier Transform (FFT) for this type of pro

The discrete fractional random cosine an
The discrete fractional random cosine and sine transforms
โœ Zhengjun Liu; Qing Guo; Shutian Liu ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 204 KB

Based on the discrete fractional random transform (DFRNT), we present the discrete fractional random cosine and sine transforms (DFRNCT and DFRNST). We demonstrate that the DFRNCT and DFRNST can be regarded as special kinds of DFRNT and thus their mathematical properties are inherited from the DFRNT