zgesdd
to R 3.1.0 (aka
"R-devel") so this issue goes away with the next release. Also of note, I
wrote up a short Rcpp Gallery post
illustrating the performance gains available from divide-and-conquer SVD.
The complete list of changes is below.
Courtesy of CRANberries, there is also a diffstat report for the most recent release As always, more detailed information is on the RcppArmadillo page. Questions, comments etc should go to the rcpp-devel mailing list off the R-Forge page.Changes in RcppArmadillo version 0.3.930.1 (2013-12-09)
Upgraded to Armadillo release Version 3.930.1
Armadillo falls back to standard complex svd if the more performant divide-and-conquer variant is unavailable
Added detection for Lapack library and distinguish between R's own version (withhout
zgesdd
) and system Lapack; a preprocessor define is set accordinglyChanges in RcppArmadillo version 0.3.930.0 (2013-12-06)
Upgraded to Armadillo release Version 3.930 ("Dragon's Back")
added divide-and-conquer variant of
svd_econ()
, for faster SVDadded divide-and-conquer variant of
pinv()
, for faster pseudo-inverseadded element-wise variants of
min()
andmax()
added
size()
based specifications of submatrix view sizesadded
randi()
for generating matrices with random integer valuesadded more intuitive specification of sort direction in
sort()
andsort_index()
added more intuitive specification of method in
det()
,.i()
,inv()
andsolve()
added more precise timer for the
wall_clock
class when using C++11New unit tests for complex matrices and vectors
This post by Dirk Eddelbuettel originated on his Thinking inside the box blog. Please report excessive re-aggregation in third-party for-profit settings.