File: vendor/Execl/PHPExcel/Shared/JAMA/SingularValueDecomposition.php
Package: JAMA For an m-by-n matrix A with m >= n, the singular value decomposition is an m-by-n orthogonal matrix U, an n-by-n diagonal matrix S, and an n-by-n orthogonal matrix V so that A = U*S*V'. The singular values, sigma[$k] = S[$k][$k], are ordered so that sigma[0] >= sigma[1] >= ... >= sigma[n-1]. The singular value decompostion always exists, so the constructor will never fail. The matrix condition number and the effective numerical rank can be computed from this decomposition. @author Paul Meagher @license PHP v3.0 @version 1.1
Class hierarchy: \SingularValueDecomposition

Properties

$U

$U :

Internal storage of U.

@var array

Type

$V

$V :

Internal storage of V.

@var array

Type

$s

$s :

Internal storage of singular values.

@var array

Type

$m

$m :

Row dimension.

@var int

Type

$n

$n :

Column dimension.

@var int

Type

Methods

__construct()

__construct(  $Arg)

Construct the singular value decomposition

Derived from LINPACK code.

Parameters

$Arg

getU()

getU() : \U

Return the left singular vectors

@access public

Returns

getV()

getV() : \V

Return the right singular vectors

@access public

Returns

getSingularValues()

getSingularValues() : \diagonal

Return the one-dimensional array of singular values

@access public

Returns

\diagonal —

of S.

getS()

getS() : \S

Return the diagonal matrix of singular values

@access public

Returns

norm2()

norm2() : \max(S)

Two norm

@access public

Returns

\max(S)

cond()

cond() : \max(S)/min(S)

Two norm condition number

@access public

Returns

\max(S)/min(S)

rank()

rank() : \Number

Effective numerical matrix rank

@access public

Returns

\Number —

of nonnegligible singular values.