| Line 17... |
Line 17... |
| 17 |
SEXP dgeMatrix_solve(SEXP a);
|
17 |
SEXP dgeMatrix_solve(SEXP a);
|
| 18 |
SEXP dgeMatrix_matrix_solve(SEXP a, SEXP b, SEXP classed);
|
18 |
SEXP dgeMatrix_matrix_solve(SEXP a, SEXP b, SEXP classed);
|
| 19 |
SEXP dgeMatrix_matrix_mm(SEXP a, SEXP b, SEXP classed, SEXP right);
|
19 |
SEXP dgeMatrix_matrix_mm(SEXP a, SEXP b, SEXP classed, SEXP right);
|
| 20 |
SEXP dgeMatrix_svd(SEXP x, SEXP nu, SEXP nv);
|
20 |
SEXP dgeMatrix_svd(SEXP x, SEXP nu, SEXP nv);
|
| 21 |
SEXP dgeMatrix_exp(SEXP x);
|
21 |
SEXP dgeMatrix_exp(SEXP x);
|
| - |
|
22 |
SEXP dgeMatrix_colsums(SEXP x, SEXP naRmP, SEXP cols, SEXP mean);
|
| 22 |
|
23 |
|
| 23 |
/* DGESDD - compute the singular value decomposition (SVD); of a */
|
24 |
/* DGESDD - compute the singular value decomposition (SVD); of a */
|
| 24 |
/* real M-by-N matrix A, optionally computing the left and/or */
|
25 |
/* real M-by-N matrix A, optionally computing the left and/or */
|
| 25 |
/* right singular vectors. If singular vectors are desired, it uses a */
|
26 |
/* right singular vectors. If singular vectors are desired, it uses a */
|
| 26 |
/* divide-and-conquer algorithm. */
|
27 |
/* divide-and-conquer algorithm. */
|