Optimal conditioning of Bernstein collocation matrices
From MaRDI portal
Recommendations
Cited in
(14)- Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression
- Optimal interval length for the collocation of the Newton interpolation basis
- Linearizations of matrix polynomials in Bernstein bases
- Accurate polynomial interpolation by using the Bernstein basis
- Polynomial least squares fitting in the Bernstein basis
- Positivity, accuracy, optimality and applications
- Recent advances on accuracy, stability and optimality of B-bases
- Tests for the recognition of total positivity
- Structured inversion of the Bernstein-Vandermonde matrix
- On the accuracy of de Casteljau-type algorithms and Bernstein representations
- Banded operational matrices for Bernstein polynomials and application to the fractional advection-dispersion equation
- The Bernstein polynomial basis: a centennial retrospective
- Accurate computations and applications of some classes of matrices
- Extremal and optimal properties of B-bases collocation matrices
This page was built for publication: Optimal conditioning of Bernstein collocation matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584141)