> In article <firstname.lastname@example.org>, > email@example.com (Norm Lehtomaki) writes: > > What is the state of the art in computing only the left or right singular > > vectors of the k largest singular values of a nxm complex matrix where > > n > m > k. Is there efficient code for this available? I am aware of > > the psvd.f in netlib. It uses the smallest singular values and has > > k = m. I'm looking for k < m. > > > Actually, I'm in error here. psvd.f does use k < m but I'm still interested > in getting a selectable subspace associated with the largest singular > values and not the smallest. > Seymour Shlien & I published a short paper in the Computer Journal in 1987 with two compact algorithms. One of these was put in the 1990 (and 1996 Japanese) editions of my Compact Numerical Methods for Computers.
I don't have the exact ref. of Nash & Shlien to hand. Sorry.
John C. Nash, Professor of Management, Faculty of Administration, University of Ottawa, 136 Jean-Jacques Lussier Private, P.O. Box 450, Stn A, Ottawa, Ontario, K1N 6N5 Canada email: firstname.lastname@example.org, voice mail: 613 562 5800 X 4796 fax 613 562 5164, Web URL = http://macnash.admin.uottawa.ca