commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Bruce A Johnson" <johns...@umbc.edu>
Subject Math Release 2.1 SVD
Date Fri, 26 Mar 2010 18:16:47 GMT

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?

Bruce



---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org


Mime
View raw message