Efficient symmetrical cubature rules for complete polynomials of high degree over the unit cube

DOI10.1002/NME.1620230306zbMath0594.65011OpenAlexW2107069636MaRDI QIDQ3725426

David A. Dunavant

Publication date: 1986

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.1620230306

zbMATH Keywords

comparisonGaussian quadraturefully symmetrical cubature rules

Mathematics Subject Classification ID

Multidimensional problems (41A63) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32)

Related Items (7)

New computationally efficient quadrature formulas for triangular prism elements ⋮ Voxel‐based finite elements with hourglass control in fast Fourier transform‐based computational homogenization ⋮ The construction of three-dimensional invariant cubature formulae ⋮ High-order discontinuous Galerkin method for time-domain electromagnetics on non-conforming hybrid meshes ⋮ On the identification of symmetric quadrature rules for finite element methods ⋮ Rotation invariant cubature formulas over the \(n\)-dimensional unit cube ⋮ Monomial cubature rules since ``Stroud: A compilation

Uses Software

• MACSYMA
• IMSL Numerical Libraries

Cites Work

• Unnamed Item

This page was built for publication: Efficient symmetrical cubature rules for complete polynomials of high degree over the unit cube