A fast and accurate algorithm for solving Bernstein-Vandermonde linear sytem
classification
🧮 math.NA
cs.NA
keywords
algorithmaccuratefastbernstein-vandermondelinearsolvingbidiagonaldecomposition
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.