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

42Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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. © 2006 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free