Hello, I was hoping you could provide me with (or forward me to someone who can) the runtime complexity of the DGESVD algorithm. Assume an (n x p) matrix, with rank r. Thanks, Mike -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.cs.utk.edu/private/lapack/attachments/20090418/0416fcf5/attachment.htm |
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | [Lapack] Install Lapack-3.0 on SGI, Leslie(Pete) Boyd |
|---|---|
| Next by Date: | [Lapack] Run-time complexity of DGESVD algorithm, Mike Liscombe |
| Previous by Thread: | [Lapack] Install Lapack-3.0 on SGI, Leslie(Pete) Boyd |
| Next by Thread: | [Lapack] Run-time complexity of DGESVD algorithm, Mike Liscombe |
| Indexes: | [Date] [Thread] |