Questions tagged [matrix-decomposition]
Questions about matrix decompositions, such as the LU, Cholesky, SVD (Singular value decomposition) and eigenvalue-eigenvector decomposition.
2,713
questions
8
votes
3
answers
23k
views
How to calculate the cost of Cholesky decomposition?
The cost of Cholesky decomposition is $n^3/3$ flops (A is a $n \times n$ matrix). Could anyone show me some steps to get this number? Thank you very much.
10
votes
1
answer
523
views
Matrix factorization
I'd like to factorize matrices as follows:
$$ \left(\begin{array}{cc}X_1&X_2\\X_3&X_4\end{array}\right) = \left(\begin{array}{cc}D_1&D_2\\D_3&D_4\end{array}\right)\left(\begin{array}{...
10
votes
2
answers
14k
views
Proof of uniqueness of LU factorization
The first question: what is the proof that LU factorization of matrix is unique? Or am I mistaken?
The second question is, how can theentries of L below the main diagonal be obtained from the matrix $...
6
votes
1
answer
2k
views
Triangularizing a Matrix
In Hoffman & Kunze, it is mentioned several times that any matrix with a minimal polynomial that splits over your field into linear factors is similar to an upper triangular matrix. A proof is ...
5
votes
2
answers
5k
views
Block-diagonalizing an antisymmetric matrix
I was wondering how to block-diagonalize a $10 \times 10$ antisymmetric matrix into block matrices along the diagonal. Can I just diagonalize each non-diagonal block?
Thanks!
2
votes
1
answer
681
views
Cholesky decomposition for sparse matrix
I have a symmetric positive definite matrix that is composed of small block diagonal matrices. For example:
$$
M = \left[
\begin{array}{ccc}
\Sigma & \Psi & \Psi \\
\Psi & \Sigma & \...
34
votes
1
answer
29k
views
Computing the Smith Normal Form
Let $A_R$ be the finitely generated abelian group, determined by the relation-matrix
$$R := \begin{bmatrix}
-6 & 111 & -36 & 6\\
5 & -672 & 210 & 74\\
0 & -255 &...
5
votes
1
answer
2k
views
Singular Value Decomposition for zero-diagonal symmetric matrix
Let's say a zero-diagonal $4\times4$ symmetric matrix,
$$
\begin{bmatrix}
0 & 1 & 3 & 3 \\ 1 & 0 & 3 & 3 \\ 3 & 3 & 0 & 1 \\ 3 & 3 & 1 & 0
\end{...
6
votes
1
answer
20k
views
Can QR decomposition be used for matrix inversion?
Is there any simple algorithm for matrix inversion (that can be implemented using C/C++)?
Can QR decomposition be used for matrix inversion? How?
27
votes
4
answers
11k
views
Is it true that any matrix can be decomposed into product of rotation, reflection, shear, scaling and projection matrices?
It seems to me that any linear transformation in ${\Bbb R}^{n \times m}$ is just a series of applications of rotation — actually i think any rotation can be achieved by applying two reflections, but ...
2
votes
2
answers
8k
views
Triangularization of real matrices
Let $A = [a_{ij}] \in \mathbb{K}^{n \times n}$, where $\mathbb{K} = \mathbb{R}$ or $\mathbb{K} = \mathbb{C}$.
In the case $\mathbb{K} = \mathbb{C}$, for example, via the Jordan decomposition ...
4
votes
3
answers
4k
views
Modified Cholesky factorization and retrieving the usual LT matrix
I have been looking at the modified Cholesky decomposition suggested by the following paper: Schnabel and Eskow, A Revised Modified Cholesky Factorization Algorithm, SIAM J. Optim. 9, pp. 1135-1148 (...
26
votes
8
answers
26k
views
Relation between Cholesky and SVD
When we have a symmetric matrix $A = LL^*$, we can obtain L using Cholesky decomposition of $A$ ($L^*$ is $L$ transposed).
Can anyone tell me how we can get this same $L$ using SVD or Eigen ...