Computing with barycentric polynomials (Q1181866): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4095322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On condition numbers and the distance to the nearest ill-posed problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4041056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of transformations between power and Bernstein polynomial forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Numerical Condition of Bernstein-Bezier Subdivision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numerical condition of polynomials in Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for polynomials in Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Interpolation and Approximation by Bezier Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the condition of algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bernstein-Bézier Methods for the Computer-Aided Design of Free-Form Curves and Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Root Neighborhoods of a Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4160117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the conditioning of polynomial and rational forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The evaluation of the zeros of ill-conditioned polynomials. I, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3736811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039860 / rank
 
Normal rank

Latest revision as of 13:32, 15 May 2024

scientific article
Language Label Description Also known as
English
Computing with barycentric polynomials
scientific article

    Statements

    Computing with barycentric polynomials (English)
    0 references
    0 references
    27 June 1992
    0 references
    In this informal survey the author sketches some of the remarkable stability properties of the representation of polynomials under the barycentric form and tries to convince the reader that, under certain simple conditions, it is always preferable to the familiar form using the power basis. The barycentric form, using the well-known Bernstein basis functions, was introduced and used in the field of computer-aided geometric design, which deals with the computer representation and manipulation of shape information for engineering purposes. The present paper consists of the following sections: (1) Introduction; (2) Condition numbers; (3) Historical background; (4) Barycentric versus power forms; (5) Subdivision; (6) Computing with barycentric forms.
    0 references
    Bézier curves
    0 references
    computer algebra
    0 references
    stability
    0 references
    polynomials under the barycentric form
    0 references
    Bernstein basis functions
    0 references
    computer-aided geometric design
    0 references
    Condition numbers
    0 references
    Subdivision
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references