•decompose — Matrix decompositions
kind •decompose m factors the matrix m and returns the factors as a record. kind is the decomposition’s name, given as text or as the kind field of an options record:
kind |
Fields | Factors |
|---|---|---|
"svd" |
u, s, v |
m is u×¹s +.× +⍉v, with the singular values s in descending order |
"qr" |
q, r |
m is q+.×r, with orthonormal columns in q, and r upper triangular |
"eigen" |
values, vectors |
each column of vectors is an eigenvector of m, for the eigenvalue at the same position in values |
"cholesky" |
l |
m is l+.×+⍉l, with l lower triangular |
"lu" |
l, u, p |
[p]⌷m is l+.×u, with l lower triangular with 1 on its diagonal, u upper triangular, and p the rows’ positions |
The SVD and the QR decomposition are thin, unless option complete asks for the complete QR. For an r-by-c matrix, u and q have r⌊c columns. The factors are floats, apart from "lu"’s positions p. A real matrix gives real factors, apart from complex eigenvalues and their eigenvectors. A Hermitian matrix, one equal to its conjugate transpose, has real eigenvalues in ascending order and orthonormal eigenvectors. Each eigenvector of a real matrix has unit length. ⌹ solves linear systems.
("svd" •decompose [1 2◇3 4◇5 6]).s ⍝ 9.525518091565104 0.5143005806586441
("eigen" •decompose [2 1◇1 2]).values ⍝ [1 3]When option vectors is false, "svd" gives only s and "eigen" gives only values, in less time. vectors is true by default. When option complete is true, "qr" gives a square q, and an r with as many rows as m. complete is false by default.
(["kind":"svd" "vectors":$f]•decompose [1 2◇3 4◇5 6]).s ⍝ 9.525518091565104 0.5143005806586441
ρ(["kind":"qr" "complete":$t]•decompose [1 2◇3 4◇5 6]).q ⍝ [3 3]ₓOption rank, a positive whole number, makes "svd" give only the first rank singular values, with their vectors unless vectors is false. A randomized method computes them, in far less time than the full SVD of a large matrix takes. The result is an approximation. The faster the singular values beyond the rankth decay, the smaller its error. When rank is at least the matrix’s smaller side minus 10, the result is exact: the full SVD’s first rank columns.
(["kind":"svd" "rank":1]•decompose [1 2◇3 4◇5 6]).s ⍝ [9.525518091565104]
ρ(["kind":"svd" "rank":1]•decompose [1 2◇3 4◇5 6]).v ⍝ [2 1]ₓThe determinant is -.×m. The "lu" factors give its sign, and the logarithm of its magnitude, which can’t overflow:
f←"lu" •decompose [1 2◇3 4]
f.p ⍝ [1 0]ₓ
d←0 0⍉f.u
-.×f.p=⊗ι≢f.p × ×/×d ⍝ ¯1ₓ
+/⊛|d ⍝ 0.6931471805599453kind •decompose⁻ factors multiplies a record of factors back into the matrix, as the table shows. For "eigen", the matrix is vectors×¹values +.× ⌹vectors, and for "lu" it’s [⍋p]⌷l+.×u. Eigenvectors that aren’t independent, such as those of the defective matrix [1 1◇0 1], can’t determine the matrix.
f←"cholesky" •decompose [4 2◇2 3]
"cholesky" •decompose⁻ f ⍝ [4 2◇2 3]Errors: RANK for an argument that isn’t a matrix, or a factor of the wrong rank; LENGTH for "eigen", "cholesky" or "lu" of a matrix that isn’t square, or factors whose sizes don’t agree; DOMAIN for an unknown decomposition or option, a vectors of false for a kind other than "svd" and "eigen", a complete of true for a kind other than "qr", a rank that isn’t a positive whole number or that’s given for a kind other than "svd", an empty or nonnumeric matrix, "cholesky" of a matrix that isn’t Hermitian positive definite, a missing factor, eigenvectors that aren’t independent, or a p that doesn’t hold each position once.