Fast formation of isogeometric Galerkin matrices by weighted quadrature

Abstract

In this paper we propose an algorithm for the formation of matrices of isogeometric Galerkin methods. The algorithm is based on three ideas. The first is that we perform the external loop over the rows of the matrix. The second is that we calculate the row entries by weighted quadrature. The third is that we exploit the (local) tensor product structure of the basis functions. While all ingredients have a fundamental role for computational efficiency, the major conceptual change of paradigm with respect to the standard implementation is the idea of using weighted quadrature: the test function is incorporated in the integration weight while the trial function, the geometry parametrization and the PDEs coefficients form the integrand function. This approach is very effective in reducing the computational cost, while maintaining the optimal order of approximation of the method. Analysis of the cost is confirmed by numerical testing, where we show that, for $p$ large enough, the time required by the floating point operations is less than the time spent in unavoidable memory operations (the sparse matrix allocation and memory write). The proposed algorithm allows significant time saving when assembling isogeometric Galerkin matrices for all the degrees of the test spline space and paves the way for a use of high-degree $k$-refinement in isogeometric analysis.

References in corpus (2)

• Nonlinear static isogeometric analysis of arbitrarily curved Kirchhoff-Love shells
• Isogeometric preconditioners based on fast solvers for the Sylvester equation

Cited by in corpus (25)

• Optimal-order isogeometric collocation at Galerkin superconvergent points
• Matrix-free weighted quadrature for a computationally efficient isogeometric $k$-method
• Dispersion-optimized quadrature rules for isogeometric analysis: modified inner products, their dispersion properties, and optimally blended schemes
• A mathematical theory for mass lumping and its generalization with applications to isogeometric analysis
• Dispersion-minimizing quadrature rules for $C^1$ quadratic isogeometric analysis
• Multi-patch discontinuous Galerkin isogeometric analysis for wave propagation: explicit time-stepping and efficient mass matrix inversion
• Efficient assembly based on B-spline tailored quadrature rules for the IgA-SGBEM
• Sum-factorization techniques in Isogeometric Analysis
• A p-multigrid method enhanced with an ILUT smoother and its comparison to h-multigrid methods within Isogeometric Analysis
• Skeleton-stabilized IsoGeometric Analysis: High-regularity Interior-Penalty methods for incompressible viscous flow problems
• Robust isogeometric preconditioners for the Stokes system based on the Fast Diagonalization method
• Patch-wise Quadrature of Trimmed Surfaces in Isogeometric Analysis
• The surrogate matrix methodology: Low-cost assembly for isogeometric analysis
• A study on spline quasi-interpolation based quadrature rules for the isogeometric Galerkin BEM
• The surrogate matrix methodology: Accelerating isogeometric analysis of waves
• Weighted quadrature for hierarchical B-splines
• Fast immersed boundary method based on weighted quadrature
• A sparse-grid isogeometric solver
• NURBS-SEM: a hybrid spectral element method on NURBS maps for the solution of elliptic PDEs on surfaces
• On the fast assemblage of finite element matrices with application to nonlinear heat transfer problems
• Graph-accelerated non-intrusive polynomial chaos expansion using partially tensor-structured quadrature rules for uncertainty quantification
• Fast formation and assembly for spline-based 3D fictitious domain methods
• Fast formation and assembly of isogeometric Galerkin matrices for trimmed patches
• Quadrature rules for splines of high smoothness on uniformly refined triangles
• Compressive Isogeometric Analysis