Bruce A Johnson a écrit : > The 2.1 API docs for the Singular Value Decomposition say: > > The size p depends on the chosen algorithm: > > for full SVD, p is n, > for compact SVD, p is the rank r of the matrix (i. e. the number of > positive singular values), > for truncated SVD p is min(r, t) where t is user-specified. > > > but I don't see any method or constructor to specify whether to do the > full, compact or truncated SVD. Am I missing something, or is the code > missing something?
The implementation has been completely rewritten recently, but it seems some comments from an intermediate version remains. The current version only computes full SVD. Luc > > Bruce > > > > --------------------------------------------------------------------- > To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org > For additional commands, e-mail: dev-h...@commons.apache.org > > --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org For additional commands, e-mail: dev-h...@commons.apache.org
