Matrix Scheme
Matrix Scheme
2 1 0
It has the same number of rows as A 2
1 3 order 3
Square matrix
columns
1
3 1
1 0
Matrix It is obtained by swapping rows for 1 21
A At 2 2
transpose of A columns 0 2 3
1
3
1 0 0
Diagonal matrix with ones in the 0 1 0
Identity matrix 3
main diagonal
0 0 1
1 32
Zeros below the diagonal
Main triangular matrix (lower) or above A 05 1
superior 0 0 6
OPERATIONS WITH MATRICES
21 1 1
A A B
3 2 4 5
SUM AND SUBTRACTThey must have the same order. It 1
2 33
add or subtract element by element B A B
1 3 21
62
2A
All the elements are multiplied 31 0 4
Product for a A
by that number. It also
number 0 2 9
3
you can factor out 3
A
0 6
1 3
The product of matrices is performed 1 2 11
A 1
0
when the number of columns of the A B 1
12
Product of 1 2
the first matrix matches the
matrices 1 1 8
number of rows of the second 11 2
matrix. IT IS NOT COMMUTATIVE B B It cannot be done
0 1 3
1 1 0 1 10
F2 2F 1
Number of rows or columns linearly A 2 1 1 01
F3F 1
1
independents. We make zeros for 1
12 0 22
Range below the “diagonal”. The range
it will be the number of rows or columns 1 1 0
no nulls
F32F2
01
1 Rank A 2
0 0 0
1 2 1
A 0 1 0
Given a square matrix of
order n if there exists another matrix B of 2 0 3
order n such that A B B A n, himself
1 2 1 1 00 1 2 1 1 0 0
it says that B is the inverse matrix of A 0 1 0 0 1 0 3 F 2F 1 0 1 0 0 1 0
and is represented by BA 1 . 20 3 0 0 1 0412 0 1
Inverse matrix The inverse of a regular matrix A 1 211 0 0 120 341
it is calculated by transforming the matrix
F3 4F 02 1 0 0 1 0 F F 0 1 1 3 0 0 1 0
(A/I) through operations
0 0 12 4 1 0 0 12 4 1
elementary of the rows in the matrix
(I/A-1). 1 0 0 361
3 6
1
F1 2F 02 1 0 0 1 0 A 1
0 1 0
0 0 12 4 1 2
4 1
7 1 2 2
1 0 3 1
2
2X Y B Y B 2X 6
6 7 21 3 2 4
03
1052 5 2
0 0 1
2
Equations
To solve matrix equations, one must be very careful when isolating the unknown matrix.
matrix
A X B A1 A X A1 B X A1 B X A1 B