Cited by 50Matrix Theory and AlgorithmsMathematical functions and polynomialsAdvanced Combinatorial Mathematics

Displacement structure approach to polynomial Vandermonde and related matrices

Open access
Kailath, Thomas, Olshevsky, Vadim·1997·Linear Algebra and its Applications

Abstract

We introduce a new class of what we call polynomial Vandermonde-like matrices. This class generalizes the polynomial Vandermonde matrices studied earlier by various authors, who derived explicit inversion formulas and fast algorithms for inversion and for solving the associated linear systems. A displacement-structure approach allows us to carry over all these results to the wider class of polynomial Vandermonde-like matrices.

Integrity signals

Registry

Crossref · 10.1016/s0024-3795(96)00315-1

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Kailath, T., & Olshevsky, V.
Affiliations
Stanford University (US)
Corresponding author
  • Kailath, Thomas
  • Olshevsky, Vadim
Venue
Linear Algebra and its Applications
Publisher
Elsevier BV
Published
1997-08
Volume
261
Issue
1-3
Pages
49-90
ISSN
0024-3795 (ISSN-L)
OpenAlex
W2021962862
Cited by
50
References
43
Citations by year
2025: 2 · 2024: 1 · 2023: 1 · 2022: 1 · 2021: 2 · 2020: 1 · 2017: 2 · 2016: 1 · 2014: 2 · 2013: 5 · 2012: 1
FWCI
5.06
Type
journal article
Language
en
Open access
Locations
  • Linear Algebra and its Applications (publishedVersion, cc-by-nc-nd)
  • Linear Algebra and its Applications (publishedVersion)
Funders
  • National Science Foundation
  • Army Research Office
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
  • Physical Sciences › Mathematics › Applied Mathematics › Mathematical functions and polynomials
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
Keywords
displacement structure, matrix inversion, fast algorithms, linear systems

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