## Abstract The fast Fourier transform‐based integral equation algorithm (IE‐FFT) is a recently developed fast algorithm to solve electrically large problems. The key of the IE‐FFT algorithm is to choose a proper interpolation method, since it not only determines the algorithm's accuracy but also i
An FFT-based algorithm for 2D power series expansions
✍ Scribed by Chyi Hwang; Jia-Chyu Guo; Tong-Yi Guo
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 498 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
✦ Synopsis
An effective numerical algorithm based on inverting a specialized Laplace transform is derived for computing the two-dimensional power-series expansion coefficients of a two-variable function. Due to the special structure of the constructed 2D Laplace transform, the accuracy of the inverted function values can be assured effectively by the generalized Riemann zeta function evaluation and the multiple sets of 2D FFT computation. Therefore, the algorithm is particularly amenable to modern computers having multiproceesors and/or vector processors. (~) 1999 Elsevier Science Ltd. All rights reserved.
📜 SIMILAR VOLUMES
## Abstract In this Letter, the inexact preconditioned conjugate‐gradient (CG) algorithm with inner–outer iteration and the block‐Toeplitz‐matrix–based fast–Fourier‐ transform (FFT) technique are applied to dense matrix equations from the mixed potential integral equation (MPIE) to enhance the comp
In this work, by using a special property in the integral representation of the remainder value of the Taylor series expansion, we introduce a new expansion for analytic functions. We also give several interesting consequences of this expansion formula as well as some practical examples in order to