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
✦ LIBER ✦
Solving singular convolution equations using the inverse Fast Fourier Transform
✍ Scribed by Eduard Krajník, Vincente Montesinos, Peter Zizler, Václav Zizler
- Book ID
- 118795157
- Publisher
- Springer-Verlag
- Year
- 2012
- Tongue
- English
- Weight
- 122 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0862-7940
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Algorithms for solving Hermite interpola
✍
Elías Berriochoa; Alicia Cachafeiro
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 297 KB
Comparison of the discrete singular conv
✍
S.Y. Yang; Y.C. Zhou; G.W. Wei
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 915 KB
Solving phase-noise Fokker-Planck equati
✍
Yunfeng Wang; Yu Zhou; Maslen, D.K.; Chirikjian, G.S.
📂
Article
📅
2006
🏛
IEEE
🌐
English
⚖ 654 KB
Flexibility in the length of convolution
✍
B. Arambepola; P.J.W. Rayner
📂
Article
📅
1980
🏛
Elsevier Science
🌐
English
⚖ 511 KB
A fast solution of the time-domain integ
✍
Jin-Lin Hu; Chi Hou Chan; Yuan Xu
📂
Article
📅
2000
🏛
John Wiley and Sons
🌐
English
⚖ 212 KB
👁 2 views
In this paper, a fast algorithm that can be used to sol¨e the time-domain integral equation of transient wa¨e fields is presented. The technique discretizes the time-domain electric-field integral equation ( ) ( ) TDEFIE by means of the marching-on-in-time MOT method. The ( ) fast Fourier transforma
An improvement in the evaluation of conv
✍
G.J Daniell
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 161 KB