Abstract
In this paper the solution of an inverse singular value problem is considered. First the decomposition of a real square matrix A = UΣV is introduced, where U and V are real square matrices orthogonal with respect to a particular inner product defined through a real diagonal matrix G of order n having all the elements equal to ±1, and Σ is a real diagonal matrix with nonnegative elements, called G-singular values. When G is the identity matrix this decomposition is the usual SVD and Σ is the diagonal matrix of singular values. Given a set σ1, ..., σn of n real positive numbers we consider the problem to find a real matrix A having them as G-singular values. Neglecting theoretical aspects of the problem, we discuss only an algorithmic issue, trying to apply a Newton type algorithm already considered for the usual inverse singular value problem.
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.
