Questions tagged [matrices]

For any topic related to matrices. This includes: systems of linear equations, eigenvalues and eigenvectors (diagonalization, triangularization), determinant, trace, characteristic polynomial, adjugate and adjoint, transpose, Jordan normal form, matrix algorithms (e.g. LU, Gauss elimination, SVD, QR), invariant factors, quadratic forms, etc. For questions specifically concerning matrix equations, use the (matrix-equations) tag.

A matrix is a rectangular array of elements, usually numbers or variables, arranged in rows and columns. A matrix with $m$ rows and $n$ columns has $m \times n$ elements and is called an $m$ by $n$ matrix. Matrices are a part of .

Matrices can be added and subtracted. Furthermore, if they have compatible shapes, they can be multiplied. More precisely, given two matrices $A$ and $B$, the matrix $AB$ is defined when the number of columns of $A$ is equal to the number of rows of $B$. In particular, given a natural number $n$, any two matrices $A$ and $B$ with $n$ columns and $n$ rows can be multiplied in both ways (that is, both $AB$ and $BA$ exist).


For questions specifically concerning matrix equations, use the tag.

55954 questions
2
votes
1 answer

unknown matrices multiplication

I am having a algebric problem in my thesis work. It is some how like this ... I have to find $X$, $Y$, $X'$ and $Y'$, where these are unknown $2\times 2$-matrices and $A$, $B$, $C$, $I$, $J$, $K$ and $L$ are known $2\times…
Salman
  • 166
2
votes
0 answers

Is there a simplification for this $n$ by $n$ combinatoric matrix?

This question was asked on Quora, and I thought I'd try to post a question on MSE to get it answered (because you know, you guys tend to be smarter than them :P) What is$$\begin{vmatrix}\binom 00 & \binom 10 & \cdots & \binom n0\\\binom 10 & \binom…
Crescendo
  • 4,089
2
votes
1 answer

Dimension of generalized eigenvector space

From Wikipedia For a matrix A, there may not always exist a full set of linearly independent eigenvectors that form a complete basis – a matrix may not be diagonalizable. This happens when the algebraic multiplicity of at least one eigenvalue $λ$…
Tim
  • 47,382
2
votes
0 answers

An identity involves Hilbert matrix

While thinking this problem,I found an identity: $b_n^TH_n^{-1}b_n+\frac{1}{n^2}=2$,where $b_n=(\frac{1}{1^2} \frac{1}{2^2} ... \frac{1}{n^2})^T$,and $H_n$ is the n-th Hilbert matrix.However,I cannot prove it directly.Does anybody give me some hints…
Ben
  • 3,608
  • 1
  • 20
  • 33
2
votes
3 answers

Is a hermitian matrix invertible?

A Hermitian matrix is defined as $H=H^\dagger$. Taking the determinant on both sides, and using $\det(A)=\det(A^T)$ we get, $\det(H)=\det(H^*)$. What can we say about the determinant of $H$ from this?
SRS
  • 1,452
2
votes
1 answer

The increase in magnitude of any element of a Hermitian matrix does not decrease the maximal eigenvalue.

Let $A$ be a Hermitian matrix and $\lambda_\max(A)$ be its maximal eigenvalue. Suppose $B$ is the matrix produced from $A$ by increasing the magnitude of any element of $A$ along with its diagonally opposite element so that $B$ remains Hermitian.…
2
votes
1 answer

$QR$ decomposition of matrix

Let $Q_1$, $Q_2$ be unitary matrix and $R_1$, $R_2$ be upper triangular with positive diagonal elements. How do I prove that if $Q_1 R_1=Q_2 R_2$, then $Q_1=Q_2$ and $R_1=R_2$?
JAY
  • 21
2
votes
3 answers

Is there a term for a matrix of 1's but with 0's along the diagonal?

Is there a term for a matrix that is like the identity matrix but with the values swapped? That is, 1's everywhere except the diagonal which has 0's. [[0, 1, 1, 1], [1, 0, 1, 1], [1, 1, 0, 1], [1, 1, 1, 0]] Of course, that's easily created with…
2
votes
2 answers

A way to correctly map a set of Natural numbers into indexes of the triangular matrix entries.

I am working on a computer program (in CUDA C++) that solves issues related to triangular matrices. I can not find a way to correctly index the triangular matrix entries. Let's assume I have a $N$x$N$ lower triangular matrix. The maximum number of…
PatrykB
  • 239
2
votes
2 answers

Why is the product of two matrices the product of their partitions?

I'm working through Introduction to Algorithms (CLRS), and it presents a recursive divide-and-conquer algorithm for multiplying any two $n \times n$ matrices (where $n$ is an integer power of $2$) as follows: To compute the product $C = A \cdot B$,…
2
votes
1 answer

Idempotency of difference of two idempotent matrices

Define $$ \mathbf{H}=\mathbf{X}\left(\mathbf{X}^{\prime}\mathbf{X}\right)^{-1}\mathbf{X}^{\prime} $$ where $\mathbf{X}$ is a design matrix of order $n \times…
2
votes
1 answer

Decompose a Matrix into a Sum of Tensor Products

Given the matrix $$\phantom{-} \pmatrix{ 0 & a+b& -b+a&0\\ \phantom{-}a+c& a+d&\phantom{-} b+c&b+d\\ -c+a&c+b&-d+a&d+b\\ 0&c+d&\phantom{-}d-c&0\\ }. $$ How could one decompose it into the (smallest) sum of tensor product, like $M\otimes E_{k}$ and…
draks ...
  • 18,449
2
votes
1 answer

How to use Schur's decomposition on more than two commuting matrices?

If we have more than two square matrices $A$, $B$, $C$,... commute, how can we prove that there exits a unitary matrix $U$ such that $U$ * $A$ $U$, $U$ * $B$ $U$, $U$ * $C$ $U$,.... are upper triangular matrices? Following from Schur's…
emelie
  • 409
2
votes
0 answers

$\lambda$ matrices and elementary operations

When performing elementary operations on $\lambda$ matrices, why can't we multiply a row or a column by a polynomial of $\lambda$ unlike in regular matrices? We can only multiply by a nonzero constant.
emelie
  • 409
2
votes
1 answer

Find a basis for the following subspace of $M_{2\times 2}(\mathbb R) $

$$W=\left\{\begin{bmatrix} a & b \\ c & d \\\end{bmatrix} \in M_{2\times 2}(\mathbb R) \mid a + 2b = c - 3d = 0\right\}$$ This is supposed to be a not so difficult question but it's getting difficult for me to wrap my head around it.