Weighted quadrature for hierarchical B-splines

Abstract

We present weighted quadrature for hierarchical B-splines to address the fast formation of system matrices arising from adaptive isogeometric Galerkin methods with suitably graded hierarchical meshes. By exploiting a local tensor-product structure, we extend the construction of weighted rules from the tensor-product to the hierarchical spline setting. The proposed algorithm has a computational cost proportional to the number of degrees of freedom and advantageous properties with increasing spline degree. To illustrate the performance of the method and confirm the theoretical estimates, a selection of 2D and 3D numerical tests is provided.

References in corpus (8)

• Fast formation of isogeometric Galerkin matrices by weighted quadrature
• Nonlinear static isogeometric analysis of arbitrarily curved Kirchhoff-Love shells
• Suitably graded THB-spline refinement and coarsening: Towards an adaptive isogeometric analysis of additive manufacturing processes
• Matrix-free weighted quadrature for a computationally efficient isogeometric $k$-method
• Mathematical foundations of adaptive isogeometric analysis
• Adaptive IGAFEM with optimal convergence rates: Hierarchical B-splines
• Sum-factorization techniques in Isogeometric Analysis
• The surrogate matrix methodology: Accelerating isogeometric analysis of waves

Cited by in corpus (4)

• Patch-wise Quadrature of Trimmed Surfaces in Isogeometric Analysis
• Fast immersed boundary method based on weighted quadrature
• Goal-Adaptive Meshing of Isogeometric Kirchhoff-Love Shells
• Fast formation and assembly for spline-based 3D fictitious domain methods