Generalized sampling consists in the recovery of a function $f$, from the samples of the responses of a collection of linear shift-invariant systems to the input $f$. The reconstructed function is typically a member of a finitely generated integer-shift-invariant space that can reproduce polynomials up to a given degree $M$. While this property allows for an approximation power of order $(M+1)$, it comes with a tradeoff on the length of the support of the basis functions. Specifically, we prove that the sum of the length of the support of the generators is at least $(M+1)$. Following this result, we introduce the notion of shortest basis of degree $M$, which is motivated by our desire to minimize the computational costs. We then demonstrate that any basis of shortest support generates a Riesz basis. Finally, we introduce a recursive algorithm to construct the shortest-support basis for any multi-spline space. It provides a generalization of both polynomial and Hermite B-splines. This framework paves the way for novel applications such as fast derivative sampling with arbitrarily high approximation power.
Periodic splines are a special kind of splines that are defined over a set of knots over a circle and are adequate for solving interpolation problems related to closed curves. This paper presents a method of implementing the objects representing such splines and describes how an efficient orthogonal basis can be obtained. The proposed orthonormalized basis is called a periodic splinet in the reference to earlier work where analogous concepts and tools have been introduced for splines on an interval. Based on this methodology, the periodic splines and splinets are added to the earlier version o…
In this paper we present a new class of cubature rules with the aim of accurately integrating weakly singular double integrals. In particular we focus on those integrals coming from the discretization of Boundary Integral Equations for 3D Laplace boundary value problems, using a collocation method within the Isogeometric Analysis paradigm. In such setting the regular part of the integrand can be defined as the product of a tensor product B-spline and a general function. The rules are derived by using first the spline quasi-interpolation approach to approximate such function and then the extens…
Kernel-based schemes are state-of-the-art techniques for learning by data. In this work we extend some ideas about kernel-based greedy algorithms to exponential-polynomial splines, whose main drawback consists in possible overfitting and consequent oscillations of the approximant. To partially overcome this issue, we introduce two algorithms which perform an adaptive selection of the spline interpolation points based on the minimization either of the sample residuals ($f$-greedy), or of an upper bound for the approximation error based on the spline Lebesgue function ($λ$-greedy). Both methods …
Spline functions have long been used in numerical solution of differential equations. Recently it revives as isogeometric analysis, which offers integration of finite element analysis and NURBS based CAD into a single unified process. Usually many NURBS pieces are needed to build geometrically continuous CAD models. In this paper, we introduce some multiply periodic splines defined on hyperbolic disc. A single piece of such splines is enough to build complex CAD models. Multiresolution analysis on surfaces of high genus built from such splines can be carried out naturally. CAD and FEA are inte…
This paper presents a study of large linear systems resulting from the regular $B$-splines finite element discretization of the $\bm{curl}-\bm{curl}$ and $\bm{grad}-div$ elliptic problems on unit square/cube domains. We consider systems subject to both homogeneous essential and natural boundary conditions. Our objective is to develop a preconditioning strategy that is optimal and robust, based on the Auxiliary Space Preconditioning method proposed by Hiptmair et al. \cite{hiptmair2007nodal}. Our approach is demonstrated to be robust with respect to mesh size, and we also show how it can be com…
We develop a discrete extension operator for trimmed spline spaces consisting of piecewise polynomial functions of degree $p$ with $k$ continuous derivatives. The construction is based on polynomial extension from neighboring elements together with projection back into the spline space. We prove stability and approximation results for the extension operator. Finally, we illustrate how we can use the extension operator to construct a stable cut isogeometric method for an elliptic model problem.
In this paper we construct Ritz-type projectors with boundary interpolation properties in finite dimensional subspaces of the usual Sobolev space and we provide a priori error estimates for them. The abstract analysis is exemplified by considering spline spaces and we equip the corresponding error estimates with explicit constants. This complements our results recently obtained for explicit spline error estimates based on the classical Ritz projectors in [Numer. Math. 144(4):889--929, 2020].
This paper presents an immersed, isogeometric finite element framework to predict the response of multi-material, multi-physics problems with complex geometries using locally refined discretizations. To circumvent the need to generate conformal meshes, this work uses an eXtended Finite Element Method (XFEM) to discretize the governing equations on non-conforming, embedding meshes. A flexible approach to create truncated hierarchical B-splines discretizations is presented. This approach enables the refinement of each state variable field individually to meet field-specific accuracy requirements…
Brigham Young University（杨百翰大学）；Coreform LLC（Coreform有限责任公司）；Technische Universität Kaiserslautern（凯泽斯劳滕工业大学）；Istituto di Matematica Applicata e Tecnologie Informatiche del CNR（意大利国家研究委员会应用数学与信息技术研究所）
We study the space of $C^1$ isogeometric spline functions defined on trilinearly parameterized multi-patch volumes. Amongst others, we present a general framework for the design of the $C^1$ isogeometric spline space and of an associated basis, which is based on the two-patch construction [7], and which works uniformly for any possible multi-patch configuration. The presented method is demonstrated in more detail on the basis of a particular subclass of trilinear multi-patch volumes, namely for the class of trilinearly parameterized multi-patch volumes with exactly one inner edge. For this spe…
In this paper, we demonstrate the construction of generalized Rough Polyhamronic Splines (GRPS) within the Bayesian framework, in particular, for multiscale PDEs with rough coefficients. The optimal coarse basis can be derived automatically by the randomization of the original PDEs with a proper prior distribution and the conditional expectation given partial information on edge or derivative measurements. We prove the (quasi)-optimal localization and approximation properties of the obtained bases, and justify the theoretical results with numerical experiments.
For spaces of constant, linear, and quadratic splines of maximal smoothness on the Powell-Sabin 12-split of a triangle, the so-called S-bases were recently introduced. These are simplex spline bases with B-spline-like properties on the 12-split of a single triangle, which are tied together across triangles in a Bézier-like manner. In this paper we give a formal definition of an S-basis in terms of certain basic properties. We proceed to investigate the existence of S-bases for the aforementioned spaces and additionally the cubic case, resulting in an exhaustive list. From their nature as simpl…
We present a completeness characterization of box splines on three-directional triangulations, also called Type-I box spline spaces, based on edge-contact smoothness properties. For any given Type-I box spline, of specific maximum degree and order of global smoothness, our results allow to identify the local linear subspace of polynomials spanned by the box spline translates. We use the global super-smoothness properties of box splines as well as the additional super-smoothness conditions at edges to characterize the spline space spanned by the box spline translates. Subsequently, we prove the…
A new efficient orthogonalization of the B-spline basis is proposed and contrasted with some previous orthogonalized methods. The resulting orthogonal basis of splines is best visualized as a net of functions rather than a sequence of them. For this reason, the basis is referred to as a splinet. The splinets feature clear advantages over other spline bases. They efficiently exploit 'near-orthogonalization' featured by the B-splines and gains are achieved at two levels: locality that is exhibited through small size of the total support of a splinet and computational efficiency that follows from…
Bases of T-meshes and the refinement of hierarchical B-splines
The University of Auckland（奥克兰大学）；Seoul National University（首尔大学）；Dongguk University（东国大学）；University of Turin（都灵大学）；Asian Institute of Technology（亚洲理工学院）
We exhibit the necessary range for which functions in the Sobolev spaces $L^s_p$ can be represented as an unconditional sum of orthonormal spline wavelet systems, such as the Battle-Lemarié wavelets. We also consider the natural extensions to Triebel-Lizorkin spaces. This builds upon, and is a generalization of, previous work of Seeger and Ullrich, where analogous results were established for the Haar wavelet system.
The spatial impulse response (SIR) method is a well-known approach to calculate transient acoustic fields of arbitrary-shape transducers. It involves the evaluation of a time-dependent surface integral. Although analytic expressions of the SIR exist for some geometries, numerical methods based on the discretization of transducer surfaces have become the standard. The proposed method consists of representing the transducer as a non-uniform rational B-spline (NURBS) surface, and decomposing it into smooth Bézier patches onto which quadrature rules can be deployed. The evaluation of the SIR can t…
