LAUSR

Abstract Cauchy–Vandermonde matrices play a fundamental role in rational interpolation theory and in other fields. When all their corresponding nodes are different and positive and all poles are different and negative and follow adequate orderings, these matrices are totally positive. In this paper we provide fast algorithms for computing bidiagonal factorizations of these matrices and their inverses with high relative accuracy. These algorithms can be used to solve with high relative accuracy other algebraic problems, such as the computation of all singular values, all eigenvalues or the solution of certain linear systems. The error analysis of the algorithm for computing the bidiagonal factorization and the corresponding perturbation theory are also performed.