Optimal conditioning of Bernstein collocation matrices
DOI10.1137/080737976zbMATH Open1213.65072OpenAlexW1983778336MaRDI QIDQ3584141FDOQ3584141
Authors: J. Delgado, J. M. Peña 
Publication date: 19 August 2010
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080737976
Recommendations
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical interpolation (65D05) Numerical computation of matrix norms, conditioning, scaling (65F35) Computer-aided design (modeling of curves and surfaces) (65D17)
Cited In (12)
- Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression
- Optimal interval length for the collocation of the Newton interpolation basis
- Accurate polynomial interpolation by using the Bernstein basis
- Linearizations of matrix polynomials in Bernstein bases
- Polynomial least squares fitting in the Bernstein basis
- 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)
