The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Superfast Solution of Real Positive Definite Toeplitz Systems
Abstract
We describe an implementation of the generalized Schur algorithm for the superfast solution of real positive definite Toeplitz systems of order $n + 1$, where $n = 2^\nu$. Our implementation uses the split-radix Fast Fourier Transform algorithms for real data of Duhamel. We are able to obtain the nth Szegö polynomial using less than $8n\log _2^2 n$ real arithmetic operations without explicit use of the bit-reversal permutation. Since Levinson’s algorithm requires slightly more than $2n^2 $ operations to obtain this polynomial, we achieve crossover with Levinson’s algorithm at $n = 256$.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
(1971) · Elsevier eBooks · doi:10.1016/c2013-0-02379-1 · Cited by 8,505
Introduction to Numerical Analysis.
Froberg, C.-E., Stoer, J., & Bulirsch, R. (1981) · Mathematics of Computation · doi:10.2307/2007454 · Cited by 5,463
Introduction to Numerical Analysis
Stoer, J., & Bulirsch, R. (1980) · Springer eBooks · doi:10.1007/978-1-4757-5592-3 · Cited by 2,154
Szegő, G. (1939) · Colloquium Publications · doi:10.1090/coll/023 · Cited by 2,110
Über Potenzreihen, die im Innern des Einheitskreises beschränkt sind.
Schur, J. (1917) · crll · doi:10.1515/crll.1917.147.205 · Cited by 1,035
An exact recursion for the composite nearest-neighbor degeneracy for a 2×N lattice space
McQuistan, R. B., & Hock, J. L. (1984) · Journal of Mathematical Physics · doi:10.1063/1.526133 · Cited by 924
Convolution equations and projection methods for their solution
Gohberg, I., & Fel′dman, I. (2005) · Translations of Mathematical Monographs · doi:10.1090/mmono/041 · Cited by 692
Fast Algorithms for Digital Signal Processing
Blahut, R. E. (1985) · Medical Entomology and Zoology · Cited by 661
An Algorithm for the Inversion of Finite Toeplitz Matrices
Trench, W. F. (1964) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0112045 · Cited by 557
Cited by
Conjugate Gradient Methods for Toeplitz Systems
Chan, R. H., & Ng, M. K. (1996) · SIAM Review · doi:10.1137/s0036144594276474 · Cited by 801
Fast error analysis of continuous GNSS observations with missing data
Bos, M. S., Fernandes, R. M. S., Williams, S. D. P., & Bastos, L. (2013) · Journal of Geodesy · doi:10.1007/s00190-012-0605-0 · Cited by 447
Displacement Structure: Theory and Applications
Kailath, T., & Sayed, A. H. (1995) · SIAM Review · doi:10.1137/1037082 · Cited by 436
Efficient numerical methods in non-uniform sampling theory
Feichtinger, H. G., Gr\"ochenig, K., & Strohmer, T. (1995) · Numerische Mathematik · doi:10.1007/s002110050101 · Cited by 260
Metadata
- Authors
- Ammar, G. S., & Gragg, W. B.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 1988-01
- Volume
- 9
- Issue
- 1
- Pages
- 61-76
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2055507002
- Cited by
- 258
- References
- 18
- FWCI
- 9.36
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Superfast Solution of Real Positive Definite Toeplitz Systems. https://app.cochat.ai/papers/10.1137/0609005
- The paper
- Ammar, G. S., & Gragg, W. B. (1988). Superfast Solution of Real Positive Definite Toeplitz Systems. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/0609005
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.