JAMA Cholesky decomposition class For a symmetric, positive definite matrix A, the Cholesky decomposition is an lower triangular matrix L so that A = L*L'
JAMA Class to obtain eigenvalues and eigenvectors of a real matrix
JAMA Error handling
JAMA For an m-by-n matrix A with m >= n, the LU decomposition is an m-by-n unit lower triangular matrix L, an n-by-n upper triangular matrix U, and a permutation vector piv of length m so that A(piv,:) = L*U
JAMA For an m-by-n matrix A with m >= n, the QR decomposition is an m-by-n orthogonal matrix Q and an n-by-n upper triangular matrix R so that A = Q*R
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'
JAMA Pythagorean Theorem: a = 3 b = 4 r = sqrt(square(a) + square(b)) r = 5 r = sqrt(a^2 + b^2) without under/overflow
Class hierarchy diagram
Back to top
Classes and interfaces
« More »
« More »