arXiv subjects

Eduardo M. Garau

Publications and source records attributed to Eduardo M. Garau.

8 recordsLinked to original sources

arXiv2026

Local power of approximation in hierarchical spline spaces on weakly admissible meshes

We study local approximation properties in hierarchical spline spaces through a twofold approach. First, we design and analyze a robust adaptive refinement algorithm to construct locally graded meshes. Second, we establish rigorous stability and approximation results using computationally efficient quasi-interpolation operators. The primary contribution is the analysis of weakly admissible hierarchical meshes. Our framework relies on strictly nested cell sets that locally reproduce the full tensor-product spline space at each level. Theoretical and numerical results demonstrate that this intuitive approach is mathematically elegant and outperforms existing adaptive refinement strategies in various practical scenarios.

math.NA↗

arXiv2025

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↗

arXiv2023

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↗

arXiv2016

A posteriori error estimators for hierarchical B-spline discretizations

In this article we develop function-based a posteriori error estimators for the solution of linear second order elliptic problems considering hierarchical spline spaces for the Galerkin discretization. We prove a global upper bound for the energy error. The theory hinges on some weighted Poincaré type inequalities, where the B-spline basis functions are the weights appearing in the norms. Such inequalities are derived following the lines in [Veeser and Verfürth, 2009], where the case of standard finite elements is considered. Additionally, we present numerical experiments that show the efficiency of the error estimators independently of the degree of the splines used for discretization, together with an adaptive algorithm guided by these local estimators that yields optimal meshes and rates of convergence, exhibiting an excellent performance.

math.NA↗

arXiv2015

New refinable spaces and local approximation estimates for hierarchical splines

We study the local approximation properties in hierarchical spline spaces through multiscale quasi-interpolation operators. This construction suggests the analysis of a subspace of the classical hierarchical spline space (Vuong et al., 2011) which still satisfies the essential properties of the full space. The B-spline basis of such a subspace can be constructed using parent-children relations only, making it well adapted to local refinement algorithms.

math.NA↗

arXiv2010

Quasi-optimal convergence rate of an AFEM for quasi-linear problems

We prove the quasi-optimal convergence of a standard adaptive finite element method (AFEM) for nonlinear elliptic second-order equations of monotone type. The adaptive algorithm is based on residual-type a posteriori error estimators and Dörfler's strategy is assumed for marking. We first prove a contraction property for a suitable definition of total error, which is equivalent to the total error as defined by Cascón et al. (in SIAM J. Numer. Anal. 46 (2008), 2524--2550), and implies linear convergence of the algorithm. Secondly, we use this contraction to derive the optimal cardinality of the AFEM.

math.NA↗

arXiv2010

Convergence of an adaptive Kačanov FEM for quasi-linear problems

We design an adaptive finite element method to approximate the solutions of quasi-linear elliptic problems. The algorithm is based on a Kačanov iteration and a mesh adaptation step is performed after each linear solve. The method is thus \emph{inexact} because we do not solve the discrete nonlinear problems exactly, but rather perform one iteration of a fixed point method (Kačanov), using the approximation of the previous mesh as an initial guess. The convergence of the method is proved for any \emph{reasonable} marking strategy and starting from any initial mesh. We conclude with some numerical experiments that illustrate the theory.

math.NA↗

arXiv2008

Convergence of adaptive finite element methods for eigenvalue problems

In this article we prove convergence of adaptive finite element methods for second order elliptic eigenvalue problems. We consider Lagrange finite elements of any degree and prove convergence for simple as well as multiple eigenvalues under a minimal refinement of marked elements, for all reasonable marking strategies, and starting from any initial triangulation.

math.NA↗