Optimal Conditioning of Bernstein Collocation Matrices

DOI10.1137/080737976zbMath1213.65072OpenAlexW1983778336MaRDI QIDQ3584141

Jorge Delgado, Juan Manuel 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

zbMATH Keywords

Bernstein polynomialsconditioningtotally positive matrices

Mathematics Subject Classification ID

Numerical interpolation (65D05) Numerical computation of matrix norms, conditioning, scaling (65F35) Computer-aided design (modeling of curves and surfaces) (65D17) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (11)

Linearizations of matrix polynomials in Bernstein bases ⋮ Tests for the recognition of total positivity ⋮ Accurate polynomial interpolation by using the Bernstein basis ⋮ Banded operational matrices for Bernstein polynomials and application to the fractional advection-dispersion equation ⋮ On the accuracy of de Casteljau-type algorithms and Bernstein representations ⋮ Extremal and optimal properties of B-bases collocation matrices ⋮ The Bernstein polynomial basis: a centennial retrospective ⋮ Accurate Computations and Applications of Some Classes of Matrices ⋮ Polynomial least squares fitting in the Bernstein basis ⋮ Structured Inversion of the Bernstein--Vandermonde Matrix ⋮ Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression

This page was built for publication: Optimal Conditioning of Bernstein Collocation Matrices