Abstract
An algorithm for the computation of the bidiagonal decomposition of strictly totally positive h-Bernstein-Vandermonde matrices is presented. These matrices are collocation matrices of h-Bernstein bases (a generalization of the Bernstein basis) of the space of polynomials of degree less than or equal to n. The algorithm is fast (its computational complexity is O(n2)) and has high relative accuracy. The computation of this bidiagonal decomposition is used as the initial stage for the accurate and efficient solution of several linear algebra problems with these matrices: linear system solving, eigenvalue computation and inverse computation. Numerical experiments are also included.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
