Recursive, Parameter-Free, Explicitly Defined Interpolation Nodes for Simplices

DOI10.1137/20M1321802MaRDI QIDQ5856680zbMATH OpenFDO

Authors Tobin Isaac

Publication date 29 March 2021

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2002.09421

zbMATH Keywords

finite elements methodsinterpolationsimplices

Mathematics Subject Classification ID

Interpolation in approximation theory (41A05) Numerical interpolation (65D05) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60)

Abstract: A rule for constructing interpolation nodes for $n$th degree polynomials on the simplex is presented. These nodes are simple to define recursively from families of 1D node sets, such as the Lobatto-Gauss-Legendre (LGL) nodes. The resulting nodes have attractive properties: they are fully symmetric, they match the 1D family used in construction on the edges of the simplex, and the nodes constructed for the $(d-1)$-simplex are the boundary traces of the nodes constructed for the $d$-simplex. When compared using the Lebesgue constant to other explicit rules for defining interpolation nodes, the nodes recursively constructed from LGL nodes are nearly as good as the "warp & blend" nodes of Warburton in 2D (which, though defined differently, are very similar), and in 3D are better than other known explicit rules by increasing margins for $n>6$. By that same measure, these recursively defined nodes are not as good as implicitly defined nodes found by optimizing the Lebesgue constant or related functions, but such optimal node sets have yet to be computed for the tetrahedron. A reference python implementation has been distributed as the `recursivenodes` package, but the simplicity of the recursive construction makes them easy to implement.

Recommendations

• An explicit construction of interpolation nodes on the simplex
• Interpolation and cubature for rectangular sets of nodes
• scientific article; zbMATH DE number 817514
• Recursive interpolation by cubic splines with additional nodes
• scientific article; zbMATH DE number 4169943
• scientific article; zbMATH DE number 878834
• Mixed interpolation methods with arbitrary nodes
• scientific article; zbMATH DE number 4161349
• scientific article; zbMATH DE number 563685
• scientific article; zbMATH DE number 4105502

Cites work

• A comparison of high order interpolation nodes for the pyramid
• A Lobatto interpolation grid in the tetrahedron
• A Lobatto interpolation grid over the triangle
• A new triangular and tetrahedral basis for high‐order (hp) finite element methods
• A pseudo-spectral scheme for the incompressible Navier-Stokes equations using unstructured nodal elements
• An explicit construction of interpolation nodes on the simplex
• Approximate optimal points for polynomial interpolation of real functions in an interval and in a triangle
• Bernstein–Bézier Finite Elements of Arbitrary Order and Optimal Assembly Procedures
• Fast inversion of the simplicial Bernstein mass matrix
• Fast simplicial finite element algorithms using Bernstein polynomials
• From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex
• scientific article; zbMATH DE number 3131224 (Why is no real title available?)
• scientific article; zbMATH DE number 3510699 (Why is no real title available?)
• Improved Lebesgue constants on the triangle
• On multivariate Chebyshev polynomials and spectral approximations on triangles
• On the generation of symmetric Lebesgue-like points in the triangle
• Polynomial interpolation and approximation in C^d
• Polynomial interpolation of holomorphic functions in \(\mathbb{C}\) and \(\mathbb{C}^ n\)
• Realistic Eigenvalue Bounds for the Galerkin Mass Matrix
• Singularity-free evaluation of collapsed-coordinate orthogonal polynomials
• Spectral methods on triangles and other domains
• Stable Spectral Methods on Tetrahedral Elements
• Structured inversion of the Bernstein mass matrix
• The optimal symmetrical points for polynomial interpolation of real functions in the tetrahedron

Cited in

(7)

• scientific article; zbMATH DE number 6255426 (Why is no real title available?)
• FIAT: improving performance and accuracy for high-order finite elements
• Computing nodal distributions with quasi-optimal Lebesgue constant
• An explicit construction of optimized interpolation points on the 4-simplex
• Symmetric, optimization-based, cross-element compatible nodal distributions for high-order finite elements
• Approximating optimal points of a Lebesgue constant proxy for interpolation in the simplex
• An explicit construction of interpolation nodes on the simplex

This page was built for publication: Recursive, Parameter-Free, Explicitly Defined Interpolation Nodes for Simplices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5856680)