Abstract
This paper provides a linear time complexity method to obtain the bidiagonal decomposition of Green matrices with high relative accuracy. In addition, when the Green matrix is nonsingular and totally positive, this bidiagonal decomposition can be used to compute the eigenvalues, the inverse and the solution of some linear system of equations with high relative accuracy. A numerical example illustrates the advantages of this method.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
