Ana Marco, Jose-Javier Martinez
Published 2008-12-16Version 1
A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0,1), then those matrices are strictly totally positive. An algorithm for computing the bidiagonal decomposition of those Said-Ball-Vandermonde matrices is presented, which allows to use known algorithms for totally positive matrices represented by their bidiagonal decomposition. The algorithm is shown to be fast and to guarantee high relative accuracy. Some numerical experiments which illustrate the good behaviour of the algorithm are included.
On the accurate computation of the Newton form of the Lagrange interpolant
Accurate Computations of Eigenvalues of Extremely Ill-conditioned Matrices and Differential Operators
A fast and accurate algorithm for solving Bernstein-Vandermonde linear sytem
![QR code for arXiv:0812.3116 [math.NA]](http://oss.arxitics.com/images/favicon.svg)