Computing ECT-B-splines recursively (Q2490415)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computing ECT-B-splines recursively
scientific article

    Statements

    Computing ECT-B-splines recursively (English)
    0 references
    0 references
    0 references
    2 May 2006
    0 references
    ECT-splines, the EC meaning ``extended Chebyshev'', are a very general approach to splines, among other conditions defined via prescribed sequences of knots, knot intervals, multiplicities and totally positive connection matrices. One can then study spline curves of this kind and, as far as this detailed paper is concerned, more specifically ECT-B-splines (in analogy to the standard B-splines) and their computation. Such B-splines provide a partition of unity, have minimal compact support and form a basis of the ECT-spline space. Recursive algorithms for their creation are given and several examples for illustration. Also, generating functions of B-splines are studied as well as the definition of the B-splines as generalised divided differences.
    0 references
    ECT-systems
    0 references
    ECT-B-splines
    0 references
    ECT-spline curves
    0 references
    de Boor algorithm
    0 references
    numerical examples
    0 references
    extended Chebyshev B-splines
    0 references
    totally positive connection matrices
    0 references
    partition of unity
    0 references
    minimal compact support
    0 references
    recursive algorithms
    0 references
    generating functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers