CoChat
Sign Up
Cited by 55Mathematical functions and polynomialsMatrix Theory and AlgorithmsPolynomial and algebraic computation

The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.

Chebyshev-Vandermonde systems

Open access
Reichel, Lothar, Opfer, Gerhard·1991·Mathematics of Computation
DOI 10.1090/s0025-5718-1991-1094957-9
Open this paper in CoChat — free accountOpen PDF

Abstract

A Chebyshev-Vandermonde matrix \[ V = [ p j ( z k ) ] j , k = 0 n ∈ C ( n + 1 ) × ( n + 1 ) V = [{p_j}({z_k})]_{j,k = 0}^n \in {\mathbb {C}^{(n + 1) \times (n + 1)}} \] is obtained by replacing the monomial entries of a Vandermonde matrix by Chebyshev polynomials p j {p_j} for an ellipse. The ellipse is also allowed to be a disk or an interval. We present a progressive scheme for allocating distinct nodes z k {z_k} on the boundary of the ellipse such that the Chebyshev-Vandermonde matrices obtained are reasonably well-conditioned. Fast progressive algorithms for the solution of the Chebyshev-Vandermonde systems are described. These algorithms are closely related to methods recently presented by Higham. We show that the node allocation is such that the solution computed by the progressive algorithms is fairly insensitive to perturbations in the right-hand side vector. Computed examples illustrate the numerical behavior of the schemes. Our analysis can also be used to bound the condition number of the polynomial interpolation operator defined by Newton’s interpolation formula. This extends earlier results of Fischer and the first author.

Overview

Integrity signals

Registry

Crossref · 10.1090/s0025-5718-1991-1094957-9

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

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.

Citations

Cites

Show all 21 references

Cited by

Sorted by citations

Related

See all

Metadata

Authors
Reichel, L., & Opfer, G.
Venue
Mathematics of Computation
Publisher
American Mathematical Society (AMS)
Published
1991
Volume
57
Issue
196
Pages
703-721
ISSN
  • 0025-5718 (ISSN-L)
  • 1088-6842
DOI
10.1090/s0025-5718-1991-1094957-9
OpenAlex
W1989782579
Cited by
55
References
21
Citations by year
2025: 1 · 2024: 2 · 2023: 4 · 2022: 4 · 2021: 1 · 2020: 1 · 2019: 2 · 2018: 2 · 2016: 2 · 2013: 2 · 2012: 1
FWCI
4.53
Type
journal article
Language
en
Open access
Locations
Mathematics of Computation (publishedVersion)
Funders
National Science Foundation (8704196)
Topics
  • Physical Sciences › Mathematics › Applied Mathematics › Mathematical functions and polynomials
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Polynomial and algebraic computation
Keywords
Vandermonde systems, node allocation, matrix conditioning, progressive algorithms, Newton interpolation, condition number bounds, right-hand side perturbation, polynomial interpolation

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