Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices
- 17 Downloads
In this paper, we consider the product eigenvalue problem for the class of Cauchy-polynomial-Vandermonde (CPV) matrices arising in a rational interpolation problem. We present the explicit expressions of minors of CPV matrices. An algorithm is designed to accurately compute the bidiagonal decomposition for strictly totally positive CPV matrices and their additive inverses. We then illustrate the sign regularity of the bidiagonal decomposition to show that all the eigenvalues of a product involving such matrices are computed to high relative accuracy. Numerical experiments are given to confirm the claimed high relative accuracy.
KeywordsProduct eigenvalue problems Cauchy-polynomial-Vandermonde matrices Bidiagonal decompositions High relative accuracy
The authors would like to thank the Editor and the anonymous referees for their valuable comments and suggestions which have helped to improve the overall presentation of the paper.
This research was supported by the National Natural Science Foundations of China (Grants No. 11871020 and 11471279), the Natural Science Foundation for Distinguished Young Scholars of Hunan Province (Grant No. 2017JJ1025), and the Research Foundation of Education Bureau of Hunan Province (Grant No. 18A198).
- 1.Boros, T., Kailath, T., Olshevsky, V.: Fast Algorithms for Solving Vandemonde and Chebyshev-Vandermonde Systems, Reprint, Information Systems Laboratory, Department of Electrical Engineering, Stanford University, Stanford CA (1994)Google Scholar
- 35.Pan, V. Y.: Structured matrices and polynomials: unified superfast algorithms springer science and business media (2012)Google Scholar
- 36.Phillips, G. M.: Interpolation and approximation by polynomials, Springer Science and Business Media (2003)Google Scholar