Abstract
Similar to the well known Schur-Horn theorem that characterizes the relationship between the diagonal entries and the eigenvalues of a Hermitian matrix, the Sing-Thompson theorem characterizes the relationship between the diagonal entries and the singular values of an arbitrary matrix. It is noted in this paper that, based on the induction principle, such a matrix can be constructed numerically by a fast recursive algorithm, provided that the given singular values and diagonal elements satisfy the Sing-Thompson conditions.
Sign-in/Register to access full text options 
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.
