Algorithms for polynomials in Bernstein form (Q1105314)

From MaRDI portal
Revision as of 00:05, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Algorithms for polynomials in Bernstein form
scientific article

    Statements

    Algorithms for polynomials in Bernstein form (English)
    0 references
    0 references
    0 references
    1988
    0 references
    The aim of this paper is to investigate the aspects of the formulation of geometric modeling algorithms in the Bernstein polynomial basis. Bernstein forms for various basic polynomial procedures required in such algorithms are developed and are found to be of similar complexity to their customary power forms. The condition of computation in floating point arithmetic of the power and Bernstein formulations is also examined.
    0 references
    polynomial algorithms
    0 references
    condition numbers
    0 references
    geometric modeling algorithms
    0 references
    Bernstein polynomial basis
    0 references
    floating point arithmetic
    0 references

    Identifiers