Please use this identifier to cite or link to this item: https://doi.org/10.1090/S0025-5718-06-01825-4
Title: Low rank update of singular values
Authors: Chu, D. 
Chu, M.
Keywords: Interlacing properties
Low rank update
Pole assignment
Singular values
Issue Date: Jul-2006
Citation: Chu, D., Chu, M. (2006-07). Low rank update of singular values. Mathematics of Computation 75 (255) : 1351-1366. ScholarBank@NUS Repository. https://doi.org/10.1090/S0025-5718-06-01825-4
Abstract: The notion of a low rank update arises in many important applications. This paper deals with the inverse problem of updating a rectangular matrix by additive low rank matrices so as to reposition the associated singular values. The setting is analogous to the classical pole assignment problem where eigenvalues of a square matrix are relocated. Precise and easy-to-check necessary and sufficient conditions under which the problem is solvable are completely characterized, generalizing some traditional Weyl inequalities for singular values. The constructive proof makes it possible to compute such a solution numerically. A pseudo algorithm is outlined. © 2006 American Mathematical Society.
Source Title: Mathematics of Computation
URI: http://scholarbank.nus.edu.sg/handle/10635/103517
ISSN: 00255718
DOI: 10.1090/S0025-5718-06-01825-4
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

9
checked on Dec 12, 2018

WEB OF SCIENCETM
Citations

8
checked on Dec 12, 2018

Page view(s)

32
checked on Nov 16, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.