By Topic

Gradient-Type Algorithms for Partial Singular Value Decomposition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Raziel Haimi-Cohen ; Department of Electrical and Computer Engineering, Ben-Gurion University, Beer-Sheva, Israel; Tadiran, Inc., Telecommunication Divison, P. O. B. 500, Petah Tikva 49104, Israel. ; Arnon Cohen

It is often desirable to calculate only a few terms of the SVD expansion of a matrix, corresponding to the largest or smallest singular values. Two algorithms, based on gradient and conjugate gradient search, are proposed for this purpose. SVD is computed term by term in a decreasing or increasing order of singular values. The algorithms are simple to implement and are especially advantageous with large matrices.

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:PAMI-9 ,  Issue: 1 )