Compute the iteratively reweighted SVD using the high-performance C++
implementation. The interface mirrors svd_robust_R() while delegating the
heavy lifting to compiled code.
svd_robust(
x,
ncomp,
max_iter = 25L,
tol = sqrt(.Machine$double.eps),
huber_k = 1.345
)A list containing the left and right singular vectors (u and v),
the singular values (d), the final row weights (weights), and the number
of iterations required for convergence (iterations).
Numeric matrix for which the decomposition should be computed.
Number of leading components to retain.
Maximum number of reweighting iterations.
Convergence tolerance applied to successive changes in the row weights and singular values.
Tuning constant controlling the aggressiveness of the Huber weight function. Larger values down-weight fewer observations.