Computation of interpolatory splines via triadic subdivision

We present an algorithm for the computation of interpolatory splines of arbitrary order at triadic rational points. The algorithm is based on triadic subdivision of splines. Explicit expressions for the subdivision symbols are established. These are rational functions. The computations are implement...

Full description

Saved in:
Bibliographic Details
Published in:Advances in computational mathematics 2010, Vol.32 (1), p.63-72
Main Authors: Zheludev, Valery A., Averbuch, Amir Z.
Format: Article
Language:English
Subjects:
Algorithms
Computation
Computational Mathematics and Numerical Analysis
Computational Science and Engineering
Filtering
Filtration
Mathematical and Computational Biology
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Recursive
Splines
Subdivisions
Symbols
Visualization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present an algorithm for the computation of interpolatory splines of arbitrary order at triadic rational points. The algorithm is based on triadic subdivision of splines. Explicit expressions for the subdivision symbols are established. These are rational functions. The computations are implemented by recursive filtering.
ISSN:1019-7168
1572-9044
DOI:10.1007/s10444-008-9087-2