A fast and accurate algorithm for solving Bernstein-Vandermonde linear sytem
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.
- Publication:
-
arXiv Mathematics e-prints
- Pub Date:
- May 2006
- DOI:
- 10.48550/arXiv.math/0605577
- arXiv:
- arXiv:math/0605577
- Bibcode:
- 2006math......5577M
- Keywords:
-
- Mathematics - Numerical Analysis;
- 65F05;
- 15A23;
- 65D05;
- 65D17
- E-Print:
- 13 pages. We have extended the numerical experiments