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
3 answers

Maximum value of determinant of a matrix P

If P is 3×3 matrix and all the entries in P are from set {-1,0,1}. Then the find the maximum possible value of determinant P. I got the answer which is 4 using hit and trial method. But i need some specific methodology to solve this problem.
1
vote
0 answers

Creating matrix with unique submatrix permutations around each number

I have a set of numbers from $0$ to $2^7$. I need to arrange these numbers in a matrix where each number is surrounded by a different arrangement of numbers. So basically, I need to obtain as many permutations as I can for each number with respect…
1
vote
3 answers

Meaning of notation

I came across this notation in a question. Where a and b are column vectors. What does it mean? To me, it looks like an inner product but it is separated by a pipeline instead of a comma.
Rururu
  • 59
  • 4
1
vote
1 answer

Why does this specific procedure of elementary row operations fail to calculate the determinant?

I have a 3x3 matrix as follows: \begin{bmatrix}4&3&1\\2&0&2\\2&1&0\end{bmatrix} I know that the correct determinant is 6, and can obtain this value using various elementary row operation routes or other methods. However, I am confused as to why the…
1
vote
3 answers

Is this statement true-$A^T=\left[ {\begin{array}{cc}P&Q\\R&S\\\end{array}}\right]^T=\left[ {\begin{array}{cc}P^T&Q^T\\R^T&S^T\\\end{array}}\right]$

Is this statement true :$A=\left[ {\begin{array}{cc}P&Q\\R&S\\\end{array}}\right]^T=\left[ {\begin{array}{cc}P^T&Q^T\\R^T&S^T\\\end{array}}\right]$Justify the answer I know this statement is wrong. I have tested it on $4\times 4 $ matrices and it…
Saradamani
  • 1,579
1
vote
0 answers

Move larger values close to matrix diagonal in a dense matrix

Problem I have a matrix X of multiple elements, here (C1,C2,C3,C4) C1 C2 C3 C4 C1 2 7 1 0 C2 6 2 8 9 C3 8 1 1 5 C4 0 2 8 2 I am looking for an algorithm that moves larger values to the diagonal and smaller values…
Make42
  • 1,085
1
vote
1 answer

recover matrix operator $A:[0,1]^n\rightarrow[0,1]^m$, $m\ne n$

suppose I have vectors $(x_i,y_i)_{i=1}^n$ where $x_i \in [0,1]^n$ and $y_i \in [0,1]^m$. I know that $Ax_i = y_i$ In this case, is there any way or any paper that I can recover matrix operator $A$? I have checked out some papers discussing about…
user1292919
  • 1,895
1
vote
0 answers

$\forall A,B \in M_n(\mathbb F),AB=BA,\exists C \in M_n(\mathbb F),f(x),g(x)\in \mathbb F[x],A=f(C),B=g(C)?$

Question:$\forall A,B \in M_n(\mathbb F),AB=BA,\exists C \in M_n(\mathbb F),f(x),g(x)\in \mathbb F[x],A=f(C),B=g(C)?$ Or:$\forall \sigma,\tau \in L(\mathbb F),\sigma \tau=\tau \sigma,\exists \upsilon \in L(\mathbb F),f(x),g(x) \in \mathbb…
1
vote
1 answer

Under what conditions does $\text{Rank}(A+B) = \text{Rank}(A)+\text{Rank}(B)$?

This is part of a larger problem. I have the expression $$E = A^{-1}B(C^{-1} + D)^{-1}A,$$ where all matrices are of appropriate dimensions, in my notes. I am told that E is of rank n. Given that all matrices are of full rank. The only remaining…
user557590
1
vote
0 answers

Under which conditions a symmetric matrix $S$ can be written as $A^TA$?

Let $\mathbb{F}$ by a field. Under which conditions a symmetric matrix $S\in \mathbb{F}^{n\times n}$ can be written as $A^TA$, where $A\in\mathbb{F}^{k\times n}$?
Daniel
  • 6,999
1
vote
1 answer

Can the inverse of a matrix with all entrances different from zero have zero entrances?

Assume X is an invertible $n \times n$ matrix with all entrances different from zero. I was wondering: can its inverse have a zero in some entrance?
jpugliese
  • 392
1
vote
1 answer

Matrix norms and projections

Is it true that for matrices of any sizes (for which the following makes sense), that if $P$ is a symmetric PSD projection matrix, $$\|APB\|_2 \leq \|AB\|_2?$$ where $\|\cdot\|$ is the operator norm? Are there any conditions one can put on $A$ and…
1
vote
0 answers

Fully indecomposable matrices property

Let be $A$ a $n\times n$ fully indecomposable matrix. Let be $$\Sigma=\{x\in\mathbb{R}^n: x_i>0, \ i=1,\dots,n, \ \|x\|_1=1\}.$$ I would like to show that it exist $\varepsilon>0$ such that if $y=Ax$ with $x\in\Sigma$ then $y_i>\epsilon \ \ \forall…
aleio1
  • 995
1
vote
0 answers

Matrix-vector product inequality

Let be $A$ a nonnegative matrix. Is it true that if $A^mx>K$ (i.e. all its components are strictly greater then $K$) then $Ax>h$ where $h$ doesn't depend on $x$ but eventually only on $A, m$ and $K$?
aleio1
  • 995
1
vote
5 answers

Let A be a matrix then $A^{50}$ is?

If $$A=\begin{bmatrix}1&0&0\\1&0&1\\0&1&0\\ \end{bmatrix}$$ then ${A^{50}}$ is? How to calculate easily? What is the trick behind it? Please tell me.
mSourav
  • 183