Computing the Bézier Control Points of the Lagrangian Interpolant in Arbitrary Dimension
From MaRDI portal
Publication:2811994
DOI10.1137/15M1046113zbMath1339.65023arXiv1510.09197MaRDI QIDQ2811994
Manuel A. Sánchez, Mark Ainsworth
Publication date: 10 June 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.09197
algorithm; finite element method; Bernstein polynomials; total positivity; Neville elimination; computer aided geometric design; Bernstein-Vandermonde matrix; multivariate polynomial interpolation; spline approximation theory
65D07: Numerical computation using splines
65D05: Numerical interpolation
65D17: Computer-aided design (modeling of curves and surfaces)
Related Items
Structured Inversion of the Bernstein--Vandermonde Matrix, GPU-Accelerated Bernstein--Bézier Discontinuous Galerkin Methods for Wave Problems, On the formulation of a BEM in the Bézier-Bernstein space for the solution of Helmholtz equation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fast simplicial quadrature-based finite element operators using Bernstein polynomials
- The Bernstein polynomial basis: a centennial retrospective
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- Newton interpolation at Leja points
- Total positivity and Neville elimination
- A Bernstein-Bézier basis for arbitrary order Raviart-Thomas finite elements
- Fast simplicial finite element algorithms using Bernstein polynomials
- Pyramid Algorithms for Bernstein--Bézier Finite Elements of High, Nonuniform Order in Any Dimension
- Low-Complexity Finite Element Algorithms for the de Rham Complex on Simplices
- Bernstein–Bézier Finite Elements of Arbitrary Order and Optimal Assembly Procedures
- On Multivariate Interpolation
- Spline Functions on Triangulations
- Effectively Well-Conditioned Linear Systems
- Barycentric Lagrange Interpolation
- Accuracy and Stability of Numerical Algorithms
