The Cholesky decomposition is a method to decompose an hermitean, positiv definite matrix into an upper triangular matrix and its transpose. It can be used to solve linear equations systems and and is around twice as fast as LU-decomposition.
A = [4 12 -16 12 37 -43 -16 -43 98]; R = chol(A);
This returns the upper triangular matrix. The lower one is obtained by transposition.
L = R';
We finally can check whether the decomposition was correct.
b = (A == L*R);
This method will decompose a matrix into an upper triangular and an orthogonal matrix.
A = [4 12 -16 12 37 -43 -16 -43 98]; R = qr(A);
This will return the upper triangular matrix while the following will return both matrices.
[Q,R] = qr(A);
Hereby a matrix will be decomposed into an upper trangular and an lower triangular matrix. Often it will be used to increase the performance and stability (if it's done with permutation) of Gauß elimination.
However, quite often does this method not or badly work as it is not stable. For example
A = [8 1 6 3 5 7 4 9 2]; [L,U] = lu(A);
It is sufficient to add an permutation matrix such that PA=LU:
If A is a complex and quadratic matrix there exists a unitary Q such that Q*AQ = T = D + N with D being the diagonal matrix consisting of the eigenvalues and N being strictly upper tridiagonal.
A = [3 6 1 23 13 1 0 3 4]; T = schur(A);
Given an m times n matrix A with n larger than m. The singular value decomposition
[U,S,V] = svd(A);
computes the matrices U,S,V.
The matrix U consists of the left singular eigenvectors which are the eigenvectors of
A*A.' while V consists of the right singular eigenvalues which are the eigenvectors of
A.'*A. The matrix
S has the square roots of the eigenvalues of
A.'*A on its diagonal.
If m is larger than n one can use
[U,S,V] = svd(A,'econ');
to perform economy sized singular value decomposition.