Knot Insertion Algorithms for Weighted Splines

Tina Bosner ()
Additional contact information
Tina Bosner: University of Zagreb, Dept. of Mathematics

A chapter in Proceedings of the Conference on Applied Mathematics and Scientific Computing, 2005, pp 151-160 from Springer

Abstract: Abstract We develop a technique to calculate with weighted splines of arbitrary order, i.e. with splines from the kernel of the operator D κωD2, with ω piecewisely constant, based on knot insertion type algorithm. The algorithm is a generalization of de Boor algorithm for polynomial splines, and it inserts the evaluation point in the knot sequence with maximal multiplicity. To achieve this, we use a general form of knot insertion matrices, and an Oslo type algorithm for calculating integrals of B-splines in reduced Chebyshev systems. We use the fact that the space of weighted splines is a subspace of the polynomial spline space. The complexity of proposed algorithm can be reduced to the computationally reasonable size. Now we can calculate weighted splines, and the splines associated with their reduced system, in a stable and efficient manner.

Keywords: Chebyshev system; weighted spline; knot insertion; de Boor algorithm; Oslo algorithm (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4020-3197-7_9

Ordering information: This item can be ordered from
http://www.springer.com/9781402031977

DOI: 10.1007/1-4020-3197-1_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().