Abstract
An algorithm for computing the bidiagonal decomposition of Said–Ball–Vandermonde matrices in the rectangular case is presented, which allows one to use known algorithms for totally positive matrices represented by their bidiagonal decomposition. The algorithm is fast and possesses high relative accuracy. The error analysis of the algorithm is also addressed, along with the perturbation theory for the bidiagonal factorization of totally positive Said–Ball–Vandermonde matrices. Some numerical experiments showing the good behavior of the algorithm are included.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
