Algorithm-Cluster
view release on metacpan or search on metacpan
src/cluster.c view on Meta::CPAN
static int
svd(int m, int n, double** u, double w[], double** vt)
/*
* This subroutine is a translation of the Algol procedure svd, described in
* G.H. Golub and C. Reinsch:
* "Singular Value Decomposition and Least Squares Solutions",
* published in
* Numerische Mathematik 14(5): page 403-420 (1970)
* and
* Handbook for Automatic Computation, Volume II: Linear Algebra,
* (John H. Wilkinson and C. Reinsch; edited by Friedrich L. Bauer and
* Alston S. Householder): page 134-151 (1971).
* t
* This subroutine determines the singular value decomposition A=usv of a
* real m by n rectangular matrix, where m is greater * than or equal to n.
* Householder bidiagonalization and a variant of the QR algorithm are used.
*
* On input:
*
* m is the number of rows of A (and u).
*
( run in 0.346 second using v1.01-cache-2.11-cpan-de7293f3b23 )