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. © 2006 Elsevier Inc. All rights reserved.
Marco, A., & Martínez, J. J. (2007). A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems. Linear Algebra and Its Applications, 422(2–3), 616–628. https://doi.org/10.1016/j.laa.2006.11.020