Questions tagged [matrix-decomposition]

Questions about matrix decompositions, such as the LU, Cholesky, SVD (Singular value decomposition) and eigenvalue-eigenvector decomposition.

In linear algebra, a matrix decomposition or matrix factorization is a factorization of a matrix into a product of matrices. There are many different matrix decompositions; each finds use among a particular class of problems.

  • For instance, when solving a system of linear equations $Ax=b$, the matrix $A$ can be decomposed via the LU decomposition. The LU decomposition factorizes a matrix into a lower triangular matrix L and an upper triangular matrix U.

  • Similarly, the QR decomposition expresses $A$ as QR with Q an orthogonal matrix and R an upper triangular matrix.

Other decomposition techniques include: Block LU decomposition, LU reduction, rank factorisation, Cholesky decomposition, etc.

Source: Wikipedia.

2679 questions
1
vote
1 answer

Cholesky decomposition of the inverse of a matrix

A similar question was asked here, but due to the application an alternative solution was given. But I really do want a Cholesky decomposition of the inverse of a matrix. To be specific, I want to compute a lower triangular matrix $L$ such…
1
vote
1 answer

Uniqueness of orthogonal decomposition of a symmetric matrix

Let $A\in M_{n\times n}(\mathbb{R})$ be a symmetric and invertible matrix, and $\lambda_i, i = 1,..,n$ its eigenvalues. Let $D = \operatorname{diag}(\lambda_1,...,\lambda_n)$. We want to find matrices $X\in M_{n\times n}(\mathbb{R})$ such that…
1
vote
1 answer

Low rank approximation of a matrix

Consider a $n\times m$ matrix $\mathbf{A}=\mathbf{U}\Sigma\mathbf{V}^T$. Also assume that all the entries of $\mathbf{A}$ are positive i-e $a_{ij}>0 \hspace{2mm} \forall \hspace{2mm} 1\leq i \leq n,1\leq j \leq m$. My question is can we say some…
NAASI
  • 997
1
vote
0 answers

Beta to eigenvectors?

Suppose I have a matrix $X$ of $n$ assets for $t$ time-periods, where the matrix $X$ is centered. Let the covariance matrix of $X$ given by $\Sigma =\frac{X X'}{t}$ . Now suppose I have done a SVD decomposition of $\Sigma$ and $v$ is a matrix whose…
uday
  • 300
1
vote
0 answers

Decomposition of an asymmetric 'postive definite' matrix

For an arbitrary square matrix $L$ whose symmetric part $\frac{L+L^\mathrm{T}}{2}\succcurlyeq0$ is positive semidefinite, can one always find a decomposition $L=U^\mathrm{T}QU$ where $U=U^\mathrm{T}\succcurlyeq0$ and asymmetric $Q$ has…
Wilbur
  • 23
0
votes
0 answers

The order of decomposition of matrices

In QR decomposition of a matrix, Q represents the orthogonal matrix and R represent upper triangular. I was wondering if a matrix could be decomposed into orthogonal and lower triangular and found LQ decomposition. Why is it not QL ? Why is the…
Jay
  • 43
0
votes
0 answers

QR algorithm - invalid results

I am trying to implement QR algorithm. Despite its simplicity, I am stuck for long time as the results do not match with Python reference (np.linalg.eig). I have a matrix. For example, this one: mat = array([[ 1.00003037e+00, -7.17939231e-05, …
aquila
  • 105
0
votes
0 answers

Bunch-Kaufman factorization

I have seen many resources about Bunch-Kaufman factorization but am still not sure about how it works exactly. For example, I often see a similar description: The Bunch-Kaufman Decomposition of a square symmetric matrix $A$ is $A = P L D L' P'$…
aquila
  • 105
0
votes
1 answer

Decomposition of matrix

How we decompose or break matrix $A$ in the following form. $$A = \begin{pmatrix} {a_1}^2 & a_1a_2 & ... a_1a_n \\ a_2a_1 & {a_2}^2 & ... a_2a_n \\.... \\ a_na_1 & a_na_2 & ... {a_n}^2 \end{pmatrix} = \begin{pmatrix} a_1 & a_1 & ... a_1 \\ a_2 &…
0
votes
0 answers

name for a matrix decomposition $T^{-1} S T$ (S lower and T upper triangular)

A given real square matrix $M$ has a decomposition $M = T^{-1} S T$ where $S$ and $T$ are lower and resp. upper triangular with '$1$'s in the diagonal. Does this type of decomposition have a known classification/name? I could not find something…
cookie
  • 31
0
votes
0 answers

does boolean matrix factorization have to be boolean?

I am just curious that if I want to factorize a boolean matrix, do the factorized two components have to binary as well? I know that current work does in this way. I am just wondering whether it is possible to factorize a boolean matrix into two…
Nathan
  • 1
0
votes
0 answers

Matrix representation as projected unitary encoding

Let $A \in \mathbb{R}^{n \times n}$. In many places i see that $A$ can be represented as a projected unitary encoding, i.e. the matrix can be written as $A=PU\tilde{P}$, where $P,\tilde{P}$ are orthogonal projectors, and $U$ is a unitary matrix. Why…
0
votes
0 answers

Construct an orthogonal matrix $Q$ satisfying the following formula.

Suppose $A\in \mathbb R^{n\times n}$ and $D = \operatorname{diag}(d_1,...,d_n) \in \mathbb R^{n\times n}.$ Show how to construct an orthogonal matrix $Q$ such that: $$ Q^TA-DQ^T=R $$ is an upper triangular matrix. Do not worry about the…
Jonas Lionel
  • 131
  • 8
0
votes
1 answer

Rank Factorisation as product of non-singular and orthogonal matrices

The statement comes from Page 20 of Rao (1973): Let $A$ be $m\times n$ matrix of rank $r$, then there exists a nonsingular $M:m\times m$ and an orthogonal $N:n\times n$ such that $$A = M\left( \begin{matrix} I_r & 0 \\0 & 0\end{matrix} \right)…
0
votes
1 answer

How many possible factorizations are there for a square matrix, and how can we know?

Given a square matrix A, how many possible factorization CB=A is there, and how can this number be calculated? I understand that there are many ways of decomposing a matrix that yields matrix multiplications with special properties (e.g., A = LU,…