Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Adv Comput Math (2010) 32:6372 DOI 10.1007/s10444-008-9087-2
 

Summary: Adv Comput Math (2010) 32:6372
DOI 10.1007/s10444-008-9087-2
Computation of interpolatory splines
via triadic subdivision
Valery A. Zheludev Amir Z. Averbuch
Received: 20 December 2007 / Accepted: 15 April 2008 /
Published online: 24 June 2008
Springer Science + Business Media, LLC 2008
Abstract 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.
Keywords Triadic subdivision Splines
Mathematics Subject Classifications (2000) 65D17 65D07 93E11
1 Introduction
Denote by Sp
the space of polynomial splines S(x) of order p defined on
the uniform grid g0
= {k} , k Z, such that the arrays {S(k)} , k Z, belong

  

Source: Averbuch, Amir - School of Computer Science, Tel Aviv University

 

Collections: Computer Technologies and Information Sciences