Fast formation of isogeometric Galerkin matrices via integration by interpolation and look-up
From MaRDI portal
Publication:2184428
DOI10.1016/J.CMA.2020.113005zbMath1442.65392OpenAlexW3017356731MaRDI QIDQ2184428
Alessandro Giust, Maodong Pan, Bert Jüttler
Publication date: 28 May 2020
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cma.2020.113005
computational complexityisogeometric analysismatrix assemblysum factorizationinterpolation and look-up
Numerical computation using splines (65D07) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Related Items (13)
Constructing planar domain parameterization with HB-splines via quasi-conformal mapping ⋮ Weighted isogeometric collocation based on spline projectors ⋮ Local (T)HB-spline projectors via restricted hierarchical spline fitting ⋮ Machine learning discovery of optimal quadrature rules for isogeometric analysis ⋮ High‐fidelity tensor‐decomposition based matrix formation for isogeometric buckling analysis of laminated shells with solid‐shell formulation ⋮ \(G^1\)-smooth planar parameterization of complex domains for isogeometric analysis ⋮ Vibration and buckling analysis of agglomerated CNT composite plates via isogeometric analysis using non-polynomial shear deformation theory ⋮ Efficient matrix assembly in isogeometric analysis with hierarchical B-splines ⋮ The surrogate matrix methodology: accelerating isogeometric analysis of waves ⋮ A matrix-free isogeometric Galerkin method for Karhunen-Loève approximation of random fields using tensor product splines, tensor contraction and interpolation based quadrature ⋮ Efficient matrix computation for isogeometric discretizations with hierarchical B-splines in any dimension ⋮ Weighted quadrature for hierarchical B-splines ⋮ Fast and multiscale formation of isogeometric matrices of microstructured geometric models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A simple algorithm for obtaining nearly optimal quadrature rules for NURBS-based isogeometric analysis
- GPU accelerated computation of the isogeometric analysis stiffness matrix
- Some estimates for \(h\)-\(p\)-\(k\)-refinement in isogeometric analysis
- Efficient quadrature for NURBS-based isogeometric analysis
- Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
- Gaussian quadrature for splines via homotopy continuation: rules for \(C^2\) cubic splines
- Local spline approximation methods
- A preconditioning strategy for linear systems arising from nonsymmetric schemes in isogeometric analysis
- Reduced Bézier element quadrature rules for quadratic and cubic splines in isogeometric analysis
- Integration by interpolation and look-up for Galerkin-based isogeometric analysis
- Selective and reduced numerical integrations for NURBS-based isogeometric analysis
- Efficient matrix computation for tensor-product isogeometric analysis: the use of sum factorization
- Partial tensor decomposition for decoupling isogeometric Galerkin discretizations
- Matrix-free weighted quadrature for a computationally efficient isogeometric \(k\)-method
- Sum factorization techniques in isogeometric analysis
- Fast formation and assembly of finite element matrices with application to isogeometric linear elasticity
- The variational collocation method
- Optimal quadrature for univariate and tensor product splines
- Fast formation of isogeometric Galerkin matrices by weighted quadrature
- Optimal-order isogeometric collocation at Galerkin superconvergent points
- Optimal and reduced quadrature rules for tensor product and hierarchically refined splines in isogeometric analysis
- Low rank tensor methods in Galerkin-based isogeometric analysis
- Reduced integration at superconvergent points in isogeometric analysis
- A black-box low-rank approximation algorithm for fast matrix assembly in isogeometric analysis
- Optimal quadrature rules for odd-degree spline spaces and their application to tensor-product-based isogeometric analysis
- Isogeometric collocation: cost comparison with Galerkin methods and extension to adaptive hierarchical NURBS discretizations
- Computation of quadrature rules for integration with respect to refinable functions on assigned nodes
- Gaussian quadrature rules for \(C^1\) quintic splines with uniform knot vectors
- ISOGEOMETRIC COLLOCATION METHODS
- Bernstein–Bézier Finite Elements of Arbitrary Order and Optimal Assembly Procedures
- Efficient Computer Manipulation of Tensor Products
- Isogeometric Analysis
- Mathematical analysis of variational isogeometric methods
- ISOGEOMETRIC ANALYSIS: APPROXIMATION, STABILITY AND ERROR ESTIMATES FOR h-REFINED MESHES
- Fully discrete \(hp\)-finite elements: Fast quadrature
This page was built for publication: Fast formation of isogeometric Galerkin matrices via integration by interpolation and look-up
