Compute the singular value decomposition of the expected adjacency matrix of an undirected factor model
Source:R/expected-spectra.R
svds.undirected_factor_model.Rd
Compute the singular value decomposition of the expected adjacency matrix of an undirected factor model
Arguments
- A
- k
Desired rank of decomposition.
- nu
Number of left singular vectors to be computed. This must be between 0 and
k
.- nv
Number of right singular vectors to be computed. This must be between 0 and
k
.- opts
Control parameters related to the computing algorithm. See Details below.
- ...
Unused, included only for consistency with generic signature.
Details
The opts
argument is a list that can supply any of the
following parameters:
ncv
Number of Lanzcos basis vectors to use. More vectors will result in faster convergence, but with greater memory use.
ncv
must be satisfy \(k < ncv \le p\) wherep = min(m, n)
. Default ismin(p, max(2*k+1, 20))
.tol
Precision parameter. Default is 1e-10.
maxitr
Maximum number of iterations. Default is 1000.
center
Either a logical value (
TRUE
/FALSE
), or a numeric vector of length \(n\). If a vector \(c\) is supplied, then SVD is computed on the matrix \(A - 1c'\), in an implicit way without actually forming this matrix.center = TRUE
has the same effect ascenter = colMeans(A)
. Default isFALSE
.scale
Either a logical value (
TRUE
/FALSE
), or a numeric vector of length \(n\). If a vector \(s\) is supplied, then SVD is computed on the matrix \((A - 1c')S\), where \(c\) is the centering vector and \(S = diag(1/s)\). Ifscale = TRUE
, then the vector \(s\) is computed as the column norm of \(A - 1c'\). Default isFALSE
.