🚀 go-pugleaf

Hi, everyone:

I am trying to use the singular value decomposition (SVD) to
solve a  least-squares problem.  I found there is one such
routine in the Book:  Numerical Recipes in C by Press et. al.
on pp.68-70 but I used it in my simulation, I found it does 
not give me the correct results if my square matrix is bigger
than 3x3.  Does anyone know of any errors in that routine?
I am suspecting it might be something to do with the indices
but then I am not sure exactly how the routine operates.  

I would much appreciate if someone could lend me a hand 
with this problem.  Thanks in advance!

Tze-Wo Leung
leung@sce.carleton.ca
--
--------------------------------------------------------------------
Chinese Name (in .HZ encoded format): ~{A:WS:M~}
Office: Carleton Univesity, Ottawa, On., Canada K1S 5B6.
Voice:  613-788-2600 Ext. 1948   Fax: 613-788-5727