Left Inverses for B-spline Subdivision Matrices in Tensor-Product Spaces
By: Marcelo Actis, Silvano Figueroa, Eduardo M. Garau
Potential Business Impact:
Makes computer pictures smoother and faster to create.
In this article, we study dyadic coarsening operators in univariate spline spaces and in tensor-product spline spaces over uniform grids. Our construction is strongly motivated by the work of Bartels, Golub, and Samavati (2006), Some observations on local least squares, BIT, 46(3):455--477. The proposed operators are local in nature and yield approximations to a given spline that are comparable to the global L2-best approximation, while being significantly faster to compute and computationally inexpensive.
Similar Papers
Error Estimates for Sparse Tensor Products of B-spline Approximation Spaces
Numerical Analysis
Makes computer models of shapes use less data.
A Low-Rank tensor framework for THB-Splines
Numerical Analysis
Makes computer simulations faster and use less memory.
Matrix representation and GPU-optimized parallel B-spline computing
Distributed, Parallel, and Cluster Computing
Makes computer design programs much faster.