Machine learning discovery of optimal quadrature rules for isogeometric analysis
From MaRDI portal
Publication:6084445
DOI10.1016/J.CMA.2023.116310arXiv2304.01802MaRDI QIDQ6084445FDOQ6084445
Authors: Tomas Teijeiro, Jamie M. Taylor, Ali Hashemian, David Pardo 
Publication date: 6 November 2023
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Abstract: We propose the use of machine learning techniques to find optimal quadrature rules for the construction of stiffness and mass matrices in isogeometric analysis (IGA). We initially consider 1D spline spaces of arbitrary degree spanned over uniform and non-uniform knot sequences, and then the generated optimal rules are used for integration over higher-dimensional spaces using tensor product sense. The quadrature rule search is posed as an optimization problem and solved by a machine learning strategy based on gradient-descent. However, since the optimization space is highly non-convex, the success of the search strongly depends on the number of quadrature points and the parameter initialization. Thus, we use a dynamic programming strategy that initializes the parameters from the optimal solution over the spline space with a lower number of knots. With this method, we found optimal quadrature rules for spline spaces when using IGA discretizations with up to 50 uniform elements and polynomial degrees up to 8, showing the generality of the approach in this scenario. For non-uniform partitions, the method also finds an optimal rule in a reasonable number of test cases. We also assess the generated optimal rules in two practical case studies, namely, the eigenvalue problem of the Laplace operator and the eigenfrequency analysis of freeform curved beams, where the latter problem shows the applicability of the method to curved geometries. In particular, the proposed method results in savings with respect to traditional Gaussian integration of up to 44% in 1D, 68% in 2D, and 82% in 3D spaces.
Full work available at URL: https://arxiv.org/abs/2304.01802
machine learningdynamic programmingnumerical integrationisogeometric analysisoptimal quadrature rules
Cites Work
- Bayes-Hermite quadrature
- Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
- Efficient quadrature for NURBS-based isogeometric analysis
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Isogeometric vibration analysis of free-form Timoshenko curved beams
- Reduced Bézier element quadrature rules for quadratic and cubic splines in isogeometric analysis
- A simple algorithm for obtaining nearly optimal quadrature rules for NURBS-based isogeometric analysis
- Nonlinear Optimization, Quadrature, and Interpolation
- The cost of continuity: a study of the performance of isogeometric finite elements using direct solvers
- On quadrature rules for solving partial differential equations using neural networks
- Pythagorean-hodograph curves. Algebra and geometry inseparable
- The value of continuity: refined isogeometric analysis and fast direct solvers
- Weighted quadrature for hierarchical B-splines
- Optimal quadrature for univariate and tensor product splines
- Optimal quadrature rules for odd-degree spline spaces and their application to tensor-product-based isogeometric analysis
- Gaussian quadrature for splines via homotopy continuation: rules for \(C^2\) cubic splines
- Convergence analysis of deterministic kernel-based quadrature rules in misspecified settings
- Isogeometric analysis of free-form Timoshenko curved beams including the nonlinear effects of large deformations
- Integration by interpolation and look-up for Galerkin-based isogeometric analysis
- Efficient quadrature rules for subdivision surfaces in isogeometric analysis
- Fast formation of isogeometric Galerkin matrices by weighted quadrature
- Optimal and reduced quadrature rules for tensor product and hierarchically refined splines in isogeometric analysis
- Computational cost of isogeometric multi-frontal solvers on parallel distributed memory machines
- Efficient matrix computation for tensor-product isogeometric analysis: the use of sum factorization
- Sum factorization techniques in isogeometric analysis
- Efficient and robust quadratures for isogeometric analysis: reduced Gauss and Gauss-Greville rules
- Dispersion-optimized quadrature rules for isogeometric analysis: modified inner products, their dispersion properties, and optimally blended schemes
- Spectral approximation properties of isogeometric analysis with variable continuity
- Fast formation of isogeometric Galerkin matrices via integration by interpolation and look-up
- Galerkin formulations of isogeometric shell analysis: alleviating locking with Greville quadratures and higher-order elements
- Studies on knot placement techniques for the geometry construction and the accurate simulation of isogeometric spatial curved beams
- Efficient mass and stiffness matrix assembly via weighted Gaussian quadrature rules for B-splines
- Refined isogeometric analysis for fluid mechanics and electromagnetics
- Refined isogeometric analysis for generalized Hermitian eigenproblems
- Refined isogeometric analysis of quadratic eigenvalue problems
Cited In (2)
This page was built for publication: Machine learning discovery of optimal quadrature rules for isogeometric analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6084445)
