Skip to main content

Questions tagged [matrix-decomposition]

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

2 votes
0 answers
56 views

Consider any matrix $A \in \text{GL}_d(\mathbb{C})$, i.e, a square invertible matrix. We define a logarithm of $A$ as any matrix $X$ such that $$e^X = A.$$ Our objective is to find of possible ...
lambda's user avatar
  • 21
4 votes
0 answers
176 views

Out of curiosity, I came across the study of matrices of the form $U = B^\top B^{-1}$ for $B \in GL(n,\mathbb{F}_2)$. In essence, U represents how matrice $B$ is asymetric. This raised the question: ...
pvrnothere's user avatar
0 votes
0 answers
61 views

I am studying a generalized eigenvalue problem which can be partitioned as $$ \left[ {\begin{array}{*{20}{c}} {{A_{11}}}&{{A_{12}}}\\ {{A_{21}}}&{{A_{22}}} \end{array}} \right]\left[ {\begin{...
Morgan's user avatar
  • 1
3 votes
1 answer
84 views

Let $A$ be $n\times n$ matrix. Can $A$ be written as $A=B_1\cdots B_k$ where $B_i$ are band matrices with constant bandwidth, and $k=O(n)$? Is it always possible? Is there an efficient algorithm for ...
Yarden Sheffer's user avatar
0 votes
0 answers
28 views

I have a question about an equation that is so simple that I feel like it should have a name and be analyzed, but I can't find a reference for it, so I am hoping someone here has seen this before. I ...
Nils R's user avatar
  • 61
1 vote
0 answers
12 views

Say we have a matrix $A = L + \beta^{2} M$, where $\beta$ is a real scalar. The matrices $L$ and $M$ are symmetric positive semi-definite and symmetric positive definite respectively. I am interested ...
prananna's user avatar
3 votes
1 answer
282 views

I'm working on a matrix factorization problem and would appreciate insights on the following conjecture: $\forall y,z \in \mathbb{N}$ such that $y > z$, there does not exist column-stochastic $\...
bvbarsenal's user avatar
0 votes
0 answers
72 views

When eigenvectors form a basis, they're a very good basis because they transform a given matrix into a diagonal matrix. The problem is that eigenvectors don't generally form a basis. However, if we ...
user1274233's user avatar
5 votes
2 answers
264 views

In Golub & Van Loan's Matrix Computations, I came across the following problem and I am stumped (been at it for a few days now). A matrix $M\in \mathbb{R}^{n\times n}$ (not necessarily symmetric) ...
gb628782's user avatar
  • 123
2 votes
1 answer
89 views

Given that $A = LU$, where $L =$ \begin{bmatrix}1&0&0\\2&1&0\\3&0&1\end{bmatrix} and $U =$ \begin{bmatrix}1&1&0&1\\0&0&1&1\\0&0&0&0\end{...
Ruben g.'s user avatar
0 votes
3 answers
99 views

I understand the LU factorization algorithm as the result of the recurrence relationships $$ u_{ij} = a_{ij} - \sum_{k = 1}^{i - 1} l_{ik} u_{kj} $$ for $i \le j$, and $$ l_{ij} = \left[ a_{ij} - \...
Olumide's user avatar
  • 1,277
1 vote
0 answers
55 views

I would like to know if anyone knows any reference about rank one update of Schur decomposition. Assume that we know the Schur decomposition of $A,$ which is $A=QUQ^{-1},$ where $Q$ is unitary and $U$ ...
Raidasam's user avatar
0 votes
0 answers
22 views

If you have a collection of n (nonzero and unique) eigenvectors, is there a way to find a general form of an n-by-n matrix that corresponds to them in such a way that 'rules out' alternative forms? ...
Sciencemaster's user avatar
0 votes
0 answers
44 views

I am new to lie theory and representation theory. I heard about this interesting factorization known as the Bipolar decomposition which uses the Mostow decomposition. The article is https://www....
J0BYJ0's user avatar
  • 11
1 vote
1 answer
81 views

As the question states: Given $M \in \mathbb{C}^{n \times n}$ where $\det(M) = 0$. Does there exist a real matrix $R \in \mathbb{R}^{n \times n}$ and invertible matrix $E \in \mathbb{C}^{n \times n}$ ...
J0BYJ0's user avatar
  • 11

15 30 50 per page
1
2 3 4 5
186