Approximation in VLSI simulation

Spline approximation (41A15) Numerical computation using splines (65D07) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Review text

Given an array \(\Xi = (\xi_ 1,\dots,\xi_ n)\) of vectors in the \(s\)- dimensional integer lattice \(\mathbb{Z}^ s\). The box-spline \(M_ \Xi\) is a piecewise polynomial of degree \(n-s\) defined by \(\int_{\mathbb{R}^ s} M_ \Xi\varphi = \int_{[0,1]} \varphi(\Xi t)dt\) for all continuous test functions \(\varphi\) [cf. \textit{C. de Boor} and \textit{K. Höllig}, J. Anal. Math. 42, 99-115 (1983; Zbl 0534.41007)]. Quadratic box-splines in the plane on a four-dimension mesh are easily computed but the author shows that in 3 and higher dimensions there cannot be any compactly supported \(C'\) piecewise quadratic on the tetrahedral mesh. The author exhibits a 3-dimensional polyhedron not deviating too much from a parallelepiped on which the box-spline construction is possible and containing a reasonably sized cube on which the box-spline construction is possible and containing a reasonably sized cube on which the spline is \(\neq 0\). This spline has only 84 pieces per cube, better than the 144 pieces of the Worsey-Piper quadratic spline.

Recommendations

Cites work

Cited in

(2)

Describes a project that uses

Uses Software

This page was built for publication: Approximation in VLSI simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315247)