Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 251

The DOI matches its Crossref record.

Fast Reliable Algorithms for Matrices with Structure

Open access
· 1999 · Society for Industrial and Applied Mathematics eBooks

Abstract

Contributors Preface Notation 1. Displacement structure and array algorithms Thomas Kailath 2. Stabilized Schur Algorithms Shivkumar Chandrasekaran and Ali H. Sayed 3. Fast Stable Solvers for Structured Linear Systems Ali H. Sayed and Shivkumar Chandrasekaran 4. Stability of Fast Algorithms for Structured Linear Systems Richard P. Brent 5. Iterative Methods for Linear Systems with Matrix Structure Raymond H. Chan and Michael K. Ng 6. Asymptotic Spectral Distribution of Toeplitz-Related Matrices Paolo Tilli 7. Newton's Iteration for Structured Matrices Victor Y. Pan, Sheryl Branham, Rhys E. Rosholt and Ai-Long Zheng 8. Fast Algorithms with Applications to Markov Chains and Queueing Models Dario A. Bini and Beatrice Meini 9. Tensor Displacement Structures and Polyspectral Matching Victor S. Grigorascu and Phillip A. Regalia 10. Minimal Complexity Realization of Structured Matrices Patrick Dewilde Appendix A. Useful Matrix Results Thomas Kailath and Ali H. Sayed Appendix B. Elementary Transformations Thomas Kailath and Ali H. Sayed Bibliography Index.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/1.9781611971354

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 251

Metadata

Venue
Society for Industrial and Applied Mathematics eBooks
Published
1999-01
OpenAlex
W1984869715
Cited by
251
References
0
FWCI
3.04
Type
book
Language
en
Open access
green

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: Fast Reliable Algorithms for Matrices with Structure. https://app.cochat.ai/papers/10.1137/1.9781611971354
The paper
Fast Reliable Algorithms for Matrices with Structure. (1999). Society for Industrial and Applied Mathematics eBooks. https://doi.org/10.1137/1.9781611971354

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.