Pseudoaffinity, de Boor algorithm, and blossoms (Q878093)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Pseudoaffinity, de Boor algorithm, and blossoms
scientific article

    Statements

    Pseudoaffinity, de Boor algorithm, and blossoms (English)
    0 references
    26 April 2007
    0 references
    Several theorems dealing with the question if symmetry, \(n\)-pseudoaffinity and diagonal property imply the existence of blossoms are given. The main result states, under assumption of ability to associate with any spline a function of \(n\)-variables, defined on the set of admissible \(n\)-tuples, that is symmetric, \(n\)-pseudoaffine, and that has diagonal and differentiability property, that blossoms exist in the spline space defined on the set of admissible \(n\)-tuples.
    0 references
    B-spline bases
    0 references
    blossoming
    0 references
    Chebyshev spaces
    0 references
    Chebyshev splines
    0 references
    geometric design
    0 references
    pseudoaffinity
    0 references

    Identifiers