Quantcast

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

Research paper by A. Marco, J. J. Martinez

Indexed on: 27 Sep '06Published on: 27 Sep '06Published in: Mathematics - Numerical Analysis



Abstract

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.