Accurate polynomial interpolation by using the Bernstein basis
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1094058
- Bounds-constrained polynomial approximation using the Bernstein basis
- Polynomial least squares fitting in the Bernstein basis
- Sparse polynomial interpolation with Bernstein polynomials
- Better error estimates in polynomial interpolation
- Reliable determination of interpolating polynomials
- Chebyshev interpolation polynomial-based tools for rigorous computing
- Interpolation polynomials of Bernstein types: a review
- Interpolatory pointwise estimates for polynomial approximation
- Obtaining exact interpolation multivariate polynomial by approximation
Cites work
- \texttt{Padua2DM}: Fast interpolation and cubature at the Padua points in \texttt{MATLAB/Octave}
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- A generalized Kronecker product and linear systems
- A graduate introduction to numerical methods. From the viewpoint of backward error analysis
- Accurate Computations with Totally Nonnegative Matrices
- Accurate computations with totally positive Bernstein-Vandermonde matrices
- Algorithm 960
- Algorithms for polynomials in Bernstein form
- Approximation theory and approximation practice
- Barycentric Lagrange Interpolation
- Bernstein-Bezoutian matrices and curve implicitization
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- Linear algebra. Translated from the German
- On the numerical condition of polynomials in Bernstein form
- On the optimal stability of the Bernstein basis
- On the solvability of bivariate Hermite-Birkhoff interpolation problems
- On the stability of transformations between power and Bernstein polynomial forms
- Optimal conditioning of Bernstein collocation matrices
- Polynomial interpolation in several variables
- Polynomial least squares fitting in the Bernstein basis
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- The Bernstein polynomial basis: a centennial retrospective
- The numerical stability of barycentric Lagrange interpolation
- Unique solvability in bivariate Hermite interpolation
Cited in
(12)- On the formulation of a BEM in the Bézier-Bernstein space for the solution of Helmholtz equation
- Matrix methods for the tensorial Bernstein form
- Accurate solutions of structured generalized Kronecker product linear systems
- Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression
- Computing the Bézier control points of the Lagrangian interpolant in arbitrary dimension
- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
- USING BERNSTEIN POLYNOMIALS TO RECOVER ENGINEERING LOADS FROM STRAIN GAUGE DATA
- Structured inversion of the Bernstein-Vandermonde matrix
- Polynomial least squares fitting in the Bernstein basis
- Perturbation theory and error analysis for the Cauchy formula
- Approximation of the Koopman operator via Bernstein polynomials
- On the accurate computation of the Newton form of the Lagrange interpolant
This page was built for publication: Accurate polynomial interpolation by using the Bernstein basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407866)
