arXiv:math/0605577 Abstract

arXiv:math/0605577 [math.NA]Abstract References Reviews Resources

A fast and accurate algorithm for solving Bernstein-Vandermonde linear sytem

Published 2006-05-22, updated 2006-09-27Version 2

A fast and accurate algorithm for solving a Bernstein-Vandermonde linear system is presented. The algorithm is derived by using results related to the bidiagonal decomposition of the inverse of a totally positive matrix by means of Neville elimination. The use of explicit expressions for the determinants involved in the process serves to make the algorithm both fast and accurate.

Comments: 13 pages. We have extended the numerical experiments

Categories: math.NA

Subjects: 65F05, 15A23, 65D05, 65D17

Keywords: solving bernstein-vandermonde linear sytem, accurate algorithm, bernstein-vandermonde linear system, bidiagonal decomposition, neville elimination

Related articles: Most relevant | Search more

arXiv:0812.3116 [math.NA] (Published 2008-12-16)

Accurate computations with Said-Ball-Vandermonde matrices

Ana Marco, Jose-Javier Martinez

arXiv:2309.12695 [math.NA] (Published 2023-09-22)

Total positivity and least squares problems in the Lagrange basis

Ana Marco, José-Javier Martínez, Raquel Viaña

arXiv:0712.4027 [math.NA] (Published 2007-12-24)