The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Fast Fourier Methods in Computational Complex Analysis
Abstract
In this paper we discuss the discrete Fourier transform and point out some computational problems in (mainly) complex analysis where it can be fruitfully applied. We begin by describing the elementary properties of the transform and its efficient implementation, both in the one-dimensional and in the multi-dimensional case, by the reduction formulas of Cooley, Lewis, and Welch (IBM Res, paper, 1967).The following applications are then discussed: Calculation of Fourier coefficients using attenuation factors; solution of Symm’s integral equation in numerical conformal mapping; trigonometric interpolation; determination of conjugate periodic functions and their application to Theodorsen’s integral equation for the conformal mapping of simply and of doubly connected regions; determination of Laurent coefficients with applications to numerical differentiation, generating functions, and the numerical inversion of Laplace transforms; determination of the “density” of the zeros of high degree polynomials. We then discuss convolution and its application to time series analysis, to the multiplication of polynomials and of large integers, and to fast Poisson solvers. The paper concludes with an account of some recent results of Brent and Kung (Carnegie-Mellon Univ., 1975, 1976) concerning fast algorithms for manipulating power series
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Eigenvalue and eigenvector decomposition of the discrete Fourier transform
McClellan, J., & Parks, T. (1972) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1972.1162342 · Cited by 257 · cited 1×
“…approaches to fast Fourier transforms are based on a factoring of the matrix representing the Fourier operator (Theilheimer (1969), Kahaner (1970), McClellan and Parks (1972)), or on determining remainders in the division of polynomials (Fiduccia (1972), Aho, Hopcroft and Ullmann (1974), Kahaner…”
Background
Cited by
Barycentric Lagrange Interpolation
Berrut, J.-P., & Trefethen, L. N. (2004) · SIAM Review · doi:10.1137/s0036144502417715 · Cited by 1,245
The Exponentially Convergent Trapezoidal Rule
Trefethen, L. N., & Weideman, J. A. C. (2014) · SIAM Review · doi:10.1137/130932132 · Cited by 545
Metadata
- Authors
- Henrici, P.
- Venue
- SIAM Review
- Published
- 1979-10
- Volume
- 21
- Issue
- 4
- Pages
- 481-527
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W1996087276
- Cited by
- 234
- References
- 2
- FWCI
- 11.56
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.