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
1
vote
1 answer

Are the entries of this matrix expression positive?

Suppose $M$ is a square matrix with full rank. If $v$ and $w$ are column vectors, then the expression $$M^Tvw^TM =: A$$ is a matrix. Under what assumptions on $v$ and $w$ can we say that $A$ has positive entries? I don't know if we can say anything…
Lemon
  • 1
1
vote
1 answer

what is the easiest way to find the inverse of a 3x3 matrix by elementary column transformation?

While using the elementary transformation method to find the inverse of a matrix, our goal is to convert the given matrix into an identity matrix. We can use three transformations:- 1) Multiplying a column by a constant 2) Adding a multiple of…
1
vote
1 answer

Hadamard Matrix proof for the Sylvester construction

How does one show that the Sylvester construction of Hadamard matrices. i.e. if $A$ is a Hadamard matrix of size $n$ then you can make a matrix of size $2n$ with effectively "$3$ $A$'s and $1$ negative $A$" that is also Hadamard? I'm sure there is a…
dahaka5
  • 275
1
vote
1 answer

What is the 'formal' inverse of a matrix?

I know what 'formal' usually means in a mathematical context, as in a formal proof or definition but I've never heard it being used to describe matrices. I couldn't find any explanation of this online. Any help would be much appreciated.
Flose
  • 303
1
vote
1 answer

In what cases can the spectral radius of a matrix and the spectral radius of its absolute value be equated?

Let a matrix $A\in \mathbb{R}^{n\times n}$ is SDD(strictly diagonally dominant). How we can show $\rho(A)=\rho(|A|)$ ($\rho(A)$ represent the spectral radius of the matrix $A$ and $|A|$ represent the absolute value of the matrix $A$). By using…
M. Raha
  • 69
1
vote
1 answer

Identify stochastic matrices from their product

Let $K, T$ positive integers. For $t\in\{1,\dots,T\}$, let $Q(t)$ a $K\times K$ stochastic matrix. We assume that for all $t$, $Q(t)$ is invertible and irreducible. Let $$M(1) = Q(1)Q(2)\cdots Q(T),$$ $$M(2) = Q(2)Q(3)\cdots…
Augustin
  • 8,446
1
vote
0 answers

Strictly proper matrices and full row rank.

If $P_1(s)$, $P_2(s)$, $Q_1(s)$, $Q_1(s)$ in R[s] to the power n x n, m x m, n x m, m x n respectively. How do we prove: $((P_i)^{-1}(s))Q_i(s)$ is strictly proper for i = 1, 2 implies matrix($P_1 -Q_1; -Q_2 P_2$) has full row rank. (I am not sure…
Deeya
  • 55
1
vote
1 answer

eigenvalue and eigenvector of $A^TP-PA$ if knowing eigenvalue of $A$

I am thinking about the question of the title.. Suppose we know $Av = \lambda v$ and all eigenvalues of $A$ are different (so diagonalizable). What do the eigenvectors and eigenvalues look like of $A^TP-PA$? I know that $A^TP - PA$ is a linear…
Denny
  • 683
1
vote
2 answers

Complexity of 3 matrix multiplications

If I have 2 matrices $X = [N \times D]$ $S = [N \times N]$ I read from https://en.wikipedia.org/wiki/Computational_complexity_of_mathematical_operations that the complexity of $X^TS$ would be $O(DN^2)$ What is the complexity of $X^TSX$ ? Since…
Kong
  • 884
1
vote
1 answer

why this limit is equal to $\sqrt{2}\;?$

Consider the matrices $ F_1 = \begin{pmatrix} 1 & 0 \\ 0 & 0 \end{pmatrix}, \quad F_2 = \begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix}, $ on $(\mathbb{C}^2,\|\cdot\|_2)$. Why $$\displaystyle\lim_{n\longrightarrow…
Schüler
  • 3,334
  • 1
  • 9
  • 26
1
vote
1 answer

Commuting matrices - unclear on steps

I would like to find all matrices that commute with matrix $$ A =\begin{pmatrix}1 & -1 \\ 0 & 1 \end{pmatrix}$$ Proposed solution $\begin{pmatrix}a&b \\c &d\end{pmatrix}\begin{pmatrix}1&-1 \\0 &1\end{pmatrix} = \begin{pmatrix}1& -1\\…
bosra
  • 561
1
vote
1 answer

Number of possible matrices with the following property?

I have a $8\times 8$ matrix, where every element of the matrix is either $0$, $1$ or $2$, so I define $A$ as a $8\times 8$ ternary matrix. The matrix needs to have these properties: In the rows $1,2$ and $3$ the number $1$ must appear exactly once…
Garmekain
  • 3,124
  • 13
  • 26
1
vote
1 answer

Find a matrix $B$ so that $A = BB^{T}$

$A$ is $$A= \begin{pmatrix} 2 & 0 & 1 \\ 0 & 2 & 0 \\ 1 & 0 & 2 \\ \end{pmatrix} $$ Find a matrix $B$ so that $A=BB^{T}$. Hint: $A=PDP^{T}$.
1
vote
1 answer

What does this result of calculating $\lim_{n\to\infty}A^n$ mean?

Suppose a matrix $A=\begin{pmatrix} a & b \\ a & 0 \end{pmatrix}$. I need to calculate $\lim_{n\to\infty}A^n$, so I started doing literally power by power to see a pattern, and this pattern emerges: $$A^{n+1}=\begin{pmatrix} (A^n_{1,1}+A^n_{1,2})a &…
Garmekain
  • 3,124
  • 13
  • 26
1
vote
1 answer

Can affine transformation of a matrix changes its rank?

I am exploring several ways to lower the rank of a matrix by preserving set of constraints. I am sure that performing positive affine transformation (f(x) = ax + b, where a is a non-zero value) preserves my set of constraints, but I want to…