A fast and accurate algorithm for solving Bernstein-Vandermonde linear sytem
Numerical Analysis
2007-05-23 v2
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.
Cite
@article{arxiv.math/0605577,
title = {A fast and accurate algorithm for solving Bernstein-Vandermonde linear sytem},
author = {A. Marco and J. J. Martinez},
journal= {arXiv preprint arXiv:math/0605577},
year = {2007}
}
Comments
13 pages. We have extended the numerical experiments