Searcharxiv⌕ Search

arXiv subjects

Cesare Bracco

Publications and source records attributed to Cesare Bracco.

14 recordsLinked to original sources

A Smoothly Varying Quadrature Approach for 3D IgA-BEM Discretizations: Application to Stokes Flow Simulations

We introduce a novel quadrature strategy for Isogeometric Analysis (IgA) boundary element discretizations, specifically tailored to collocation methods. Thanks to the dimensionality reduction and the natural handling of unbounded domains, boundary integral formulations are particularly appealing in the IgA framework. However, they require the evaluation of boundary integrals whose kernels exhibit singular or nearly singular behavior. Even when the kernel is not singular, its numerical evaluation becomes challenging whenever the integration region lies close to a collocation point. These integrals of polar and nearly singular functions represent the main computational difficulty of IgA-BEM and motivate the development of efficient and accurate quadrature rules. Unlike traditional methods that classify integrals as singular, nearly singular, or regular, our approach employs a desingularizing change of variables that smoothly adapts to the physical distance from singularities in the boundary integral kernels. The transformation intensifies near the polar point and progressively weakens when integrating over portions of the domain that are farther from it, ultimately leaving the integrand unchanged in the limit of a diametrically opposed region. This automatic calibration enhances accuracy and robustness by eliminating the traditional classification step, to which the approximation quality is often highly sensitive. Moreover, integration is performed directly over B-spline supports rather than over individual elements, reducing computational cost, particularly for higher-degree splines. The proposed method is validated through boundary element benchmarks for the three dimensional Stokes problem, where we achieve excellent convergence rates.

math.NA↗

A positive meshless finite difference scheme for scalar conservation laws with adaptive artificial viscosity driven by fault detection

We present a meshless finite difference method for multivariate scalar conservation laws that generates positive schemes satisfying a local maximum principle on irregular nodes and relies on artificial viscosity for shock capturing. Coupling two different numerical differentiation formulas and the adaptive selection of the sets of influence allows to meet a local CFL condition without any {\it a priori}\ time step restriction. The artificial viscosity term is chosen in an adaptive way by applying it only in the vicinity of the sharp features of the solution identified by an algorithm for fault detection on scattered data. Numerical tests demonstrate a robust performance of the method on irregular nodes and advantages of adaptive artificial viscosity. The accuracy of the obtained solutions is comparable to that for standard monotone methods available only on Cartesian grids.

math.NA↗

Local spline refinement driven by fault jump estimates for scattered data approximation

We present new fault jump estimates to guide local refinement in surface approximation schemes with adaptive spline constructions. The proposed approach is based on the idea that, since discontinuities in the data should naturally correspond to sharp variations in the reconstructed surface, the location and size of jumps detected in the input point cloud should drive the mesh refinement algorithm. To exploit the possibility of inserting local meshlines in one or the other coordinate direction, as suggested by the jump estimates, we propose a quasi-interpolation (QI) scheme based on locally refined B-splines (LR B-splines). Particular attention is devoted to the construction of the local operator of the LR B-spline QI scheme, which properly adapts the spline approximation according to the nature and density of the scattered data configuration. A selection of numerical examples outlines the performance of the method on synthetic and real datasets characterized by different geographical features.

math.NA↗

Adaptive isogeometric phase-field modeling of the Cahn-Hilliard equation: Suitably graded hierarchical refinement and coarsening on multi-patch geometries

We present an adaptive scheme for isogeometric phase-field modeling, to perform suitably graded hierarchical refinement and coarsening on both single- and multi-patch geometries by considering truncated hierarchical spline constructions which ensures $C^1$ continuity between patches. We apply the proposed algorithms to the Cahn-Hilliard equation, describing the time-evolving phase separation processes of immiscible fluids. We first verify the accuracy of the hierarchical spline scheme by comparing two classical indicators usually considered in phase-field modeling, for then demonstrating the effectiveness of the grading strategy in terms of accuracy per degree of freedom. A selection of numerical examples confirms the performance of the proposed scheme to simulate standard modes of phase separation using adaptive isogeometric analysis with smooth THB-spline constructions.

math.NA↗

Adaptive isogeometric methods with $C^1$ (truncated) hierarchical splines on planar multi-patch domains

Isogeometric analysis is a powerful paradigm which exploits the high smoothness of splines for the numerical solution of high order partial differential equations. However, the tensor-product structure of standard multivariate B-spline models is not well suited for the representation of complex geometries, and to maintain high continuity on general domains special constructions on multi-patch geometries must be used. In this paper we focus on adaptive isogeometric methods with hierarchical splines, and extend the construction of $C^1$ isogeometric spline spaces on multi-patch planar domains to the hierarchical setting. We introduce a new abstract framework for the definition of hierarchical splines, which replaces the hypothesis of local linear independence for the basis of each level by a weaker assumption. We also develop a refinement algorithm that guarantees that the assumption is fulfilled by $C^1$ splines on certain suitably graded hierarchical multi-patch mesh configurations, and prove that it has linear complexity. The performance of the adaptive method is tested by solving the Poisson and the biharmonic problems.

math.NA↗

THB-spline approximations for turbine blade design with local B-spline approximations

We consider two-stage scattered data fitting with truncated hierarchical B-splines (THB-splines) for the adaptive reconstruction of industrial models. The first stage of the scheme is devoted to the computation of local least squares variational spline approximations, exploiting a simple fairness functional to handle data distributions with a locally varying density of points. Hierarchical spline quasi-interpolation based on THB-splines is considered in the second stage of the method to construct the adaptive spline surface approximating the whole scattered data set and a suitable strategy to guide the adaptive refinement is introduced. A selection of examples on geometric models representing components of aircraft turbine blades highlights the performances of the scheme. The tests include a scattered data set with voids and the adaptive reconstruction of a cylinder-like surface.

math.NA↗

BPX Preconditioners for Isogeometric Analysis Using (Truncated) Hierarchical B-splines

We present the construction of additive multilevel preconditioners, also known as BPX preconditioners, for the solution of the linear system arising in isogeometric adaptive schemes with (truncated) hierarchical B-splines. We show that the locality of hierarchical spline functions, naturally defined on a multilevel structure, can be suitably exploited to design and analyze efficient multilevel decompositions. By obtaining smaller subspaces with respect to standard tensor-product B-splines, the computational effort on each level is reduced. We prove that, for suitably graded hierarchical meshes, the condition number of the preconditioned system is bounded independently of the number of levels. A selection of numerical examples validates the theoretical results and the performance of the preconditioner.

math.NA↗

Isogeometric analysis with $C^1$ hierarchical functions on planar two-patch geometries

Adaptive isogeometric methods for the solution of partial differential equations rely on the construction of locally refinable spline spaces. A simple and efficient way to obtain these spaces is to apply the multi-level construction of hierarchical splines, that can be used on single-patch domains or in multi-patch domains with $C^0$ continuity across the patch interfaces. Due to the benefits of higher continuity in isogeometric methods, recent works investigated the construction of spline spaces with global $C^1$ continuity on two or more patches. In this paper, we show how these approaches can be combined with the hierarchical construction to obtain global $C^1$ continuous hierarchical splines on two-patch domains. A selection of numerical examples is presented to highlight the features and effectivity of the construction.

math.NA↗

An application of numerical differentiation formulas to discontinuity curve detection from irregularly sampled data

We present a method to detect discontinuity curves, usually called faults, from a set of scattered data. The scheme first extracts from the data set a subset of points close to the faults. This selection is based on an indicator obtained by using numerical differentiation formulas with irregular centers for gradient approximation, since they can be directly applied to the scattered point cloud without intermediate approximations on a grid. The shape of the faults is reconstructed through local computations of regression lines and quadratic least squares approximations. In the final reconstruction stage, a suitable curve interpolation algorithm is applied to the selected set of ordered points previously associated with each fault.

math.NA↗

Adaptive scattered data fitting by extension of local approximations to hierarchical splines

We introduce an adaptive scattered data fitting scheme as extension of local least squares approximations to hierarchical spline spaces. To efficiently deal with non-trivial data configurations, the local solutions are described in terms of (variable degree) polynomial approximations according not only to the number of data points locally available, but also to the smallest singular value of the local collocation matrices. These local approximations are subsequently combined without the need of additional computations with the construction of hierarchical quasi-interpolants described in terms of truncated hierarchical B-splines. A selection of numerical experiments shows the effectivity of our approach for the approximation of real scattered data sets describing different terrain configurations.

math.NA↗

Bivariate hierarchical Hermite spline quasi--interpolation

Spline quasi-interpolation (QI) is a general and powerful approach for the construction of low cost and accurate approximations of a given function. In order to provide an efficient adaptive approximation scheme in the bivariate setting, we consider quasi-interpolation in hierarchical spline spaces. In particular, we study and experiment the features of the hierarchical extension of the tensor-product formulation of the Hermite BS quasi-interpolation scheme. The convergence properties of this hierarchical operator, suitably defined in terms of truncated hierarchical B-spline bases, are analyzed. A selection of numerical examples is presented to compare the performances of the hierarchical and tensor-product versions of the scheme.

math.NA↗

Spaces of generalized splines over T-meshes

We consider a class of non-polynomial spline spaces over T-meshes, that is, of spaces locally spanned both by polynomial and by suitably-chosen non-polynomial functions, which we will refer to as generalized splines over T-meshes. For such spaces, we provide, under certain conditions, a dimension formula and a basis based on the notion of minimal determining set. We explicitly examine some relevant cases, which enjoy a noteworthy behaviour with respect to differentiation and integration; finally, we also study the approximation power of the just constructed spline spaces.

math.NA↗

Generalized T-splines and VMCR T-meshes

The paper considers the extension of the T-spline approach to the Generalized B-splines (GB-splines), a relevant class of non-polynomial splines. The Generalized T-splines (GT-splines) are based both on the framework of classical polynomial T-splines and on the Trigonometric GT-splines (TGT-splines), a particular case of GT-splines. Our study of GT-splines introduces a class of T-meshes (named VMCR T-meshes) for which both the corresponding GT-splines and the corresponding polynomial T-splines are linearly independent. A practical characterization can be given for a sub-class of VMCR T-meshes, which we refer to as weakly dual-compatible T-meshes, which properly includes the class of dual-compatible (equivalently, analysis-suitable) T-meshes for an arbitrary (polynomial) order.

math.NA↗

Bases of T-meshes and the refinement of hierarchical B-splines

In this paper we consider spaces of bivariate splines of bi-degree (m, n) with maximal order of smoothness over domains associated to a two-dimensional grid. We define admissible classes of domains for which suitable combinatorial technique allows us to obtain the dimension of such spline spaces and the number of tensor-product B-splines acting effectively on these domains. Following the strategy introduced recently by Giannelli and Juettler, these results enable us to prove that under certain assumptions about the configuration of a hierarchical T-mesh the hierarchical B-splines form a basis of bivariate splines of bi-degree (m, n) with maximal order of smoothness over this hierarchical T-mesh. In addition, we derive a sufficient condition about the configuration of a hierarchical T-mesh that ensures a weighted partition of unity property for hierarchical B-splines with only positive weights.

cs.CG↗