Please use this identifier to cite or link to this item:
|Title:||Low rank update of singular values|
|Authors:||Chu, D. |
Low rank update
|Source:||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|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 28, 2018
WEB OF SCIENCETM
checked on Feb 20, 2018
checked on Feb 27, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.