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

What would these system of equations be equal to (matrices)?

So there's a word problem I found in my text that I've been trying to solve for about 2 hours now, and I just can't seem to get it. A school has three clubs and each student is required to belong to exactly one club. One year the students switch…
user462562
1
vote
1 answer

Show that $T^3-2T^2-8T=0$

Let $T : \mathbb{R}^3\rightarrow \mathbb{R}^3$ be $T(x, y, z) = (x + y - 2z, x + 2y - 3z, 3x + 4y - z)$. Show that $T^3 - 2T^2 - 8T = 0$. I was able to write $T(x, y, z) = (x + y - 2z, x + 2y - 3z, 3x + 4y - z)$ as $T(x,y,z)=A[x,y,z]$, where…
Shobhit
  • 6,902
1
vote
1 answer

QR Factorization for 2x2 does not give correct Eigenvalue

To find the Eigenvalue as per QR Factorization, the diagonal values of R are the EigenValues while every column in Q is an EigenVector. However, this does not seem to be the case in a 2x2 matrix. Consider M =…
cbelwal
  • 113
1
vote
2 answers

Linear Algebra_Spectral radius of matrix

We assume the spectral radius of the matrix T is less(not equal) than one. Also, the matrix T is nonsingular,i.e. the spectral radius of the matrix T is bigger(not equal) than zero. How we can show that the spectral radius of the matrix T1 is…
M. Raha
  • 69
1
vote
1 answer

Replacing rows in an augumented matrix

I have a question with something written by David C Lay in his textbook "Linear Algebra and its Applications". Here's a picture of the excerpt in the textbook: My question has to do with when he labels $x_3 = 3$ as "new equation 3". Why is it the…
sangstar
  • 1,947
1
vote
1 answer

Square Matrix (Real/Imaginary) entities

For this particle Multiple Choice Question(more than one correct) Let B= $A^2$ The four 'B' matrix are represented in pics.'A' is the diagonal Matrix. I am trying to undersrand this problem. My issue is with Matrix D, even if used diagonal matrix…
1
vote
4 answers

Let $A^3=0$; check if $A^2-A+I$ is invertible and, if it is, find its inverse

Let $A^3=0$; check if $A^2-A+I$ is invertible and, if it is, find its inverse. Is it possible to solve it this way? $A^2-A+I=A(A-I)+I=B$ Multiply both sides by $A^2$: $A^3(A-I)+ A^2= A^2B$ $A^2= A^2B$ $I=B$ $I$ is an invertible matrix!
1
vote
1 answer

How to multiply two $n×n$ matrices by efficient method?

We need to carry out $2(n^3)-(n^2)$ number of basic operations (like addition and multiplication) to multiply two $n×n$ matrices. Is there any other efficient way so that we could use less no. of operations to multiply them?
1
vote
2 answers

Why when transforming matrices is the transformation matrix first?

Is there a reason that the transformation matrix is on the left? For example: $$ \begin{bmatrix}2&1\\-1&1\end{bmatrix}\begin{bmatrix}x&z\\y&v\end{bmatrix} $$ I understand that when multiplying matrices order is important, but is there any other…
Kyzen
  • 205
1
vote
2 answers

Rank of a Matrix - Demonstration or Postulate? -

I realized that the teacher - I do not know why, but this one - obviously - is not the question - takes demonstrations he shows during lessons and I usually do not succeed in understanding from an old Linear Algebra's book. I hope that somebodby…
1
vote
3 answers

Matrix that averages blocks of length $6$ of a given vector

I have a matrix $A$ of $288$ rows by $1$ column (vector). I am creating another matrix $B$ such that the elements in the first six row of matrix $A$ is average to form the first element in the first row of matrix $B$. The elements in the $7$th to…
Onovo
  • 11
1
vote
1 answer

What do the column of 1's signify when calculating the area of an image using the determinant?

When calculating the area of an image such as that given by the three coordinates (4,3), (4,10), and (-4,-3), why when writing it out as a matrix is there an extra column of 1's? $$ \begin{matrix} 4 & 3 & 1 \\ 4 & 10 & 1 \\ …
Kyzen
  • 205
1
vote
1 answer

Longest possible diagonal in a boolean matrix

Given a (not necessarily square) boolean matrix in which all rows and columns have at least two $1$'s. I need to find the largest diagonal of $1$'s that can be made using row and column swaps.
Kevin
  • 11
1
vote
3 answers

Showing that $|||A-B|||\geq \frac{1}{|||A^{-1}|||}$?

$A,B\in M_n$, $A$ is non-singular and $B$ is singular. $|||\cdot|||$ is any matrix norm on $M_n$, how to show that $|||A-B||| \geq \frac{1}{|||A^{-1}|||}$? The hint is let $B=A[I-A^{-1}(A-B)]$, but I don't know how to use it. Appreciate any…
user39843
  • 937
1
vote
1 answer

Inequality involving the pseudo inverse $A^+$

Say I have a matrix of the form $$ A = \begin{bmatrix} A_1 \\ A_2 \end{bmatrix} $$ where $A_1$ is a $n \times n$ matrix of full rank, and $A_2$ is a $(m-n) \times n$ matrix (arbitrary). I would like to show that…
user197848
1 2 3
99
100