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
3
votes
1 answer

Upper bound for the determinant of matrix sum

I wonder is there any way to express the "upper bound" (not lower bound) of $\det(A+B)$ in terms of $\det(A)$ and $\det(B)$ ? Thank you!
3
votes
2 answers

LQ decomposition

so I'm studying for Dirty Paper Coding on MU-MIMO, the system needs LQ decomposition in it. and I want to ask, where do we get the value of L (as in lower matrix triangular) from this case? can anyone help? thank you so much
3
votes
0 answers

Analytical Matrix Inversion

I have a matrix of the form $A = bI - J$ where 1. $b$ is a large positive constant so that $A$ is positive definite 2. $J_{ij} = 0$ for $i=j$ and follows a power law off-diagnol. In index notation: $$ A_{ij} = (b\delta_{ij} -…
yakzo
  • 151
3
votes
0 answers

Gerschgorin's Disks of a 3x3 complex matrix (2)

Take the following matrix as an example, $$\left( \begin{array}{ccc} -1 & -i & 0 \\ \frac{i}{2} & 0 & 0 \\ 0 & i & 1 \\ \end{array} \right)$$ The eigenvalues are ${-1.37, 1, 0.37}$, and the plot of the Gerschgorin's disks is: We see that each…
Putterboy
  • 153
3
votes
3 answers

Solving $\mathrm{A}=\mathrm{B}^{-1}\mathrm{C}$ for $\mathrm{B}$ when $\mathrm{C}$ is not invertible

I need to solve the following equation for $\boldsymbol{\mathrm{B}}$ $$\boldsymbol{\mathrm{A}}_{m\times p}=\boldsymbol{\mathrm{B}}^{-1}_{m\times m}\boldsymbol{\mathrm{C}}_{m\times p}$$ The problem is that the matrix $\boldsymbol{\mathrm{C}}$ is not…
3
votes
1 answer

Mathematical Maze Generation

I have performed some research into maze generation through Java code and learned about different "perfect" maze generation algorithms here. I found good Java-based maze generation code here. I have also seen the output of the mazes and learned that…
3
votes
2 answers

Square root of a $3\times3$ matrix

Here is $3\times3$ matrix$$\begin{pmatrix} 0& 0& 1\\ 0 & -1 & 0\\ 1& 0 & 0\end{pmatrix}$$ How can I solve this by using Cayley-Hamilton? I know how to use Cayley-Hamilton for a $2$-dimensional matrix. How can it help in…
user123
  • 251
3
votes
2 answers

Newly Developed With Details - Describing orthographic projection using simple 2D transformations

Thanks to Pedro for helping me further develop my question into something tangible. His (most recent) answer below clearly and formally outlines what I am asking. This is similar to this question, except in 3D and involving surfaces. I am doing…
3
votes
1 answer

How do I find the initial state Matrix?

The question gives a $2\times2$ transition matrix: $$ \begin{bmatrix} 0.8 & 0.2\\ 0.3 & 0.7 \end{bmatrix}. $$ And then it gives me the initial state matrix but I'm wondering how do I find the initial state matrix by myself? The initial state matrix…
3
votes
1 answer

Inverse of partitioned matrix, checking result

$A$ is an $n\times n$ matrix, partitioned as $$A=\begin{bmatrix} A_{11} & A_{12}\\ A_{21} & A_{22} \end{bmatrix},$$ where $A_{11}$ has dimensions $k\times k$ and $A_{11}$ and $A_{22}$ are nonsingular. I've managed to prove that the inverse…
David
  • 2,262
3
votes
2 answers

How to find matrix $A$ given $Ax=b$. Also $det(A)$ & $sum(A)$ are known.

Here is an example: $A = \begin{bmatrix} 2 & 3 \\ 5 & 1 \end{bmatrix}$ $x = \begin{bmatrix} 3 \\ 8 \end{bmatrix}$ $b = Ax$ so $b = \begin{bmatrix} 30 \\ 23 \end{bmatrix}$ Now i want to find $A$ using $x$ and $b$ matrices. How can i do that ? Some…
Kitiara
  • 195
3
votes
1 answer

Using a matrix method to find the square root of a number. How does it work?

This is the matrix that is used to find the square root of a number (M). p and q is an estimate of the root of M in a fraction form (5=10/2 or 5/1) and a and b is a new fraction of a closer approximate of M. Repeating this improve accuracy where…
Brayden
  • 31
3
votes
3 answers

How do you solve a least square problem with a noninvertible matrix?

How do you find a solution to a matrix $A$ that minimizes $\|x\|$ when $A^TA$ is not invertible? The matrix is $$A = \pmatrix{1 &1&2&2\\1&2&3&4}$$ I don't know if this helps but also in the question above this one, we are asked to find all…
3
votes
1 answer

Simple SVD and Polar Decomposition Question

Given an $n \times n$ matrix $A$. (1) Show $AA^{*}$ is similar to $A^{*}A$ by singular value decomposition. (2) Consider polar forms that $A=UP=QV^{*}$ in which $U$ is $m \times n$; $P$ is $n \times n$; $Q$ is $m \times m$ and $V$ is $n \times m$;…
nam
  • 733
3
votes
1 answer

How does $norm(A) \leq p(A) + e$ imply $norm(A) < 1$ if $p(A) < 1$?

I am given a lemma and it states: Lemma: Let $A$ be a real $n\times n$ matrix. Then given any $e > 0$, there is a $norm$ such that $norm(A) \leq p(A) + e$, where $p(A)$ is the spectral radius of $A$. They then go on to state that based on this…
AaronLS
  • 401