Abstract
Algorithms are derived to obtain upper and lower bounds for the largest and smallest singular values of a square complex matrix in terms of its eigenvalues and Frobenius norm. These bounds are best possible in the sense that they are attainable by some matrices with the prescribed eigenvalues and Frobenius norm. Numerical examples are given to compare them with those in the literature. Mathematics subject classification (1991): 15A42.
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
