Sparse polynomial interpolation with Bernstein polynomials
From MaRDI portal
Recommendations
- Sparse Polynomial Interpolation in Nonstandard Bases
- Sparse polynomial interpolation with finitely many values for the coefficients
- A new algorithm for sparse interpolation of multivariate polynomials
- An algorithm for symbolic-numeric sparse interpolation of multivariate polynomials whose degree bounds are unknown
- Sparse polynomial interpolation with arbitrary orthogonal polynomial bases
Cites work
- Early termination in sparse interpolation algorithms
- Error-correcting sparse interpolation in the Chebyshev basis
- scientific article; zbMATH DE number 48955 (Why is no real title available?)
- Representation of sparse Legendre expansions
- Sparse polynomial interpolation in Chebyshev bases
- Sparse Polynomial Interpolation in Nonstandard Bases
- Sparse polynomial interpolation with arbitrary orthogonal polynomial bases
- The Bernstein polynomial basis: a centennial retrospective
Cited in
(5)- Sparse polynomial interpolation with finitely many values for the coefficients
- Accurate polynomial interpolation by using the Bernstein basis
- Sparse polynomial interpolation in Chebyshev bases
- Error-correcting sparse interpolation in the Chebyshev basis
- Sparse Polynomial Interpolation in Nonstandard Bases
This page was built for publication: Sparse polynomial interpolation with Bernstein polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5099144)
