Numerical experiments show that the projection-based low-rank approach for assembling the mass and stiffness tensors of orientation-preserving tensor-product B-spline geometries is competitive with full assembly and with the interpolation-based low-rank method, and that it applies in two situations in which interpolation is problematic: a singular interpolation system and nearly singular geometries.
Abstract
Isogeometric Analysis (IgA) uses the same spline functions to represent the computational domain and to approximate the solution. This allows exact geometry descriptions, but the resulting mass and stiffness matrices are expensive to assemble and to store, especially in three dimensions. We present a projection-based low-rank approach for assembling the mass and stiffness tensors of orientation-preserving tensor-product B-spline geometries. For the mass tensor, we exploit the polynomial structure of the determinant of the Jacobian of the geometry map and represent it in reduced spline product spaces by univariate coefficient transfer operators; with exact quadrature and without truncation, the resulting low-rank tensor is an exact reformulation of the standard Galerkin mass tensor. For the stiffness tensor, we split the rational weight function into a polynomial numerator, again represented in reduced spline product spaces, and the reciprocal determinant, which is in general not a spline function and is therefore approximated by an $L^2$-projection onto a tensor-product spline space. Both constructions are carried out entirely in the tensor-train (TT) format, with the projection system solved by the alternating minimal energy (AMEn) method, so that full high-order coefficient tensors are never formed and the multidimensional integrals reduce to univariate integrals and contracted products. The method is implemented in MATLAB using GeoPDEs and the TT-Toolbox. Numerical experiments show that it is competitive with full assembly and with the interpolation-based low-rank method, and that it applies in two situations in which interpolation is problematic: a singular interpolation system and nearly singular geometries. The construction is restricted to orientation-preserving tensor-product B-spline geometries and does not cover NURBS.
This paper combines the polar spline construction with hierarchical splines to obtain adaptively-refinable polar splines, and shows how to construct hierarchical polar spline $k$-form spaces, proves that the corresponding basis functions are linearly independent, and proves that they form a cohomologically-correct disc...
Diogo C. Cabanas, D. Toshniwal, Rafael Vázquez· 0 citations
We introduce a simple and performant approach for rapidly and accurately performing polyharmonic spline (PHS) interpolation using a combination of the fast multipole method (FMM) from computational electrostatics and the Vecchia approximation from the Gaussian process and sparse approximate inverse literatures. Using b...
This work develops tensor-train (TT) formulations for solving large-scale three-dimensional linear elasticity problems discretized by isogeometric analysis. By exploiting the tensor-product structure of the basis functions and the low-rank structure of geometry-dependent coefficient fields, the stiffness operator, mass...
Q. Tran, Duc P. Truong, William Dai et al.· 0 citations
We study the dimension and dimensional stability of polynomial spline spaces of bi-degree $(m,m')$ with prescribed smoothness orders over planar T-meshes. The homological dimension formula writes the spline dimension as the sum of an Euler characteristic term and a correction term. For a fixed ordered bi-degree, the Eu...
This work is concerned with the numerical computation of Gross-Pitaevskii ground states using the tensor train (TT) format. We regard the problem as the minimization of the Gross-Pitaevskii energy functional under a unit mass constraint, and propose a first-order Riemannian optimization scheme that preserves both the m...
Ivan Bioli, Carlo Marcati, M. Rakhuba· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.