Searcharxiv⌕ Search

arXiv subjects

Silvano Figueroa

Publications and source records attributed to Silvano Figueroa.

3 recordsLinked to original sources

Algebraic coarsening of hierarchical splines with guaranteed error control

We present a purely algebraic coarsening operator for hierarchical spline spaces, obtained by inverting locally the refinement matrix that relates the coarsened basis to the current one. Only the B-splines that interact with the coarsened region are involved, so that a coarsening step reduces to one small least-squares problem followed by explicit corrections of the surviving coefficients, without mass matrices or numerical quadrature. The operator is a left inverse of the refinement matrix, hence exact whenever the fine spline belongs to the coarse space, and leaves the spline unchanged away from the coarsened region. The residual of the least-squares problem bounds the $L^\infty$-error with no unknown constants and is available before the mesh is modified, which yields an adaptive multi-level algorithm that guarantees a prescribed tolerance. The construction carries over to truncated hierarchical B-splines, where the corrections disappear. In numerical experiments, the bound is sharp within an order of magnitude, the local transfer is nearly as accurate as a global $L^2$-projection, and much of the refinement left behind a moving front is removed without degrading the solution.

math.NA↗

Left Inverses for B-spline Subdivision Matrices in Tensor-Product Spaces

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.

math.NA↗

Error analysis for local coarsening in univariate spline spaces

In this article we analyze the error produced by the removal of an arbitrary knot from a spline function. When a knot has multiplicity greater than one, this implies a reduction of its multiplicity by one unit. In particular, we deduce a very simple formula to compute the error in terms of some neighboring knots and a few control points of the considered spline. Furthermore, we show precisely how this error is related to the jump of a derivative of the spline at the knot. We then use the developed theory to propose efficient and very low-cost local error indicators and adaptive coarsening algorithms. Finally, we present some numerical experiments to illustrate their performance and show some applications.

math.NA↗