
- •1.Matrices. Classification of matrices. Operations over matrices: addition of matrices, multiplication of a matrix on number.
- •2. Matrices. Multiplication of matrices.
- •3. Determinants. Calculating determinants of the second and third order.
- •5. Properties of determinants. Decomposing a determinant of the fourth order on a row (or column). Notion of determinant of the n-th order.
- •Notion of a determinant of the n-th order
- •7.Inverse matrix. Finding the inverse matrix.
- •Compute the determinant of the matrix а (if it equals zero then there is no inverse matrix).
- •6.Systems of linear equations.(Cramer rule)
- •8.Matrix representation of a system of linear equations. Finding solutions of a system of linear equations by method of inverse matrix.
- •9.Rank of a matrix. Finding the rank of a matrix by two methods.
- •10.Criterion for compatibility of a system of linear equations (Theorem of Kronecker-Capelli). Example of determining the compatibility of a system by this theorem.
- •13Vectors (in the geometric space). Changing the coordinates of a vector at replacement of a basis and the origin of coordinates.
- •14Transition between orthonormal systems of coordinates on plane. Right (left) oriented pair of vectors on plane.
- •15 Linear dependence of vectors in the geometric space (plane and line). Theorems on properties of linearly dependent vectors.
- •16. Basis in the geometric space (plane and line). The coordinates of a vector in a basis.
- •17. Cartesian system of coordinates. Radius-vector of a point. Finding the coordinates of a point dividing a segment in some ratio.
- •18. Complex numbers. Actions over complex numbers. Algebraic and trigonometric forms of a complex number.
- •20. Dimension and a basis of a linear space. Isomorphism of linear spaces.
- •19. Linear space. Theorems on properties of a linear space. Linearly independent vectors in a linear space.
- •Linearly independent vectors. Let X, y, z, …, u be vectors of a linear space .
- •21. Transformation of coordinates at transition to a new basis in a linear space. Theorems on transition matrix and formulas of transformation of coordinates.
- •22. Subspaces of a linear space. Linear hull of vectors. Intersection, union, sum and direct sum of subspaces.
- •23. Fundamental system of solutions of a homogeneous system of equations. Subspaces formed by solutions of a homogeneous linear system of equations.
- •24. Linear transformations. Examples of linear transformations. Actions over linear transformations.
- •Actions over linear transformations
- •28.The image and kernel of a linear operator.
- •29Linear mapping. Injective and surjective linear mappings. Matrix of a linear mapping.
- •30Linear functionals. The components of a linear functional. Dual space of linear functional
- •28.The image and kernel of a linear operator.
8.Matrix representation of a system of linear equations. Finding solutions of a system of linear equations by method of inverse matrix.
A(n; n) X(n; 1) = B(n; 1)
Find a decision of the matrix equation (9), i.e. find a matrix-column of variables X(n; 1). Multiply both parts of the matrix equation (9) on the left (since the order of multiplying matrices is important) on matrix A-1(n; n). As a result we obtain:
A-1 (A X) =A-1 B or (A-1 A) X = A-1 B; E X = A-1 B, but E X = X, consequently X = A-1 B. (10)
Thus, we find a decision (matrix X(n; 1)) of the matrix equation by formula (10), i.e. to find matrix X(n; 1) (and variables x1, x2, …, xn) it is necessary to find an inverse matrix A-1(n; n) and multiply it on matrix B(n; 1). Consequently all is reduced to a determination of an inverse matrix A-1(n; n).
Show
a finding the inverse matrix А-1
on example of a system of three linear equations with three
unknowns:
.
Let
then the system has a unique decision which is computed by the
Cramer formulas:
.
Transform the auxiliary determinants of the system:
where
А11,
А21,
А31
– the cofactors of the elements а11,
а21,
а31
of matrix
Transforming analogously the second and the third formulas, we finally obtain:
This
implies:
(11)
We obtain the rule of finding the inverse
9.Rank of a matrix. Finding the rank of a matrix by two methods.
Consider
a matrix of the dimension
:
Take a natural number k such that k m and k n. Choose in A arbitrary k rows and k columns. As a result we obtain a square matrix of the k-th order. The determinant of this matrix is called minor of the k-th order of the matrix A. The number of all minors of different orders can be great even for a matrix of non-large dimension
We say a minor is non-zero if it isn’t equal to zero.
The rank of a matrix A is the greatest order of its non-zero minors. The rank of a matrix is denoted by Rank A or r(A).
Example
1.
Calculate the rank of matrix
Solution:
Consider, for example, the minor
This implies Rank
A
2. Further take three minors of the third order M1,
M2
and M3
which are bordering the minor M:
Calculate
Consequently, Rank A 3. Since M1 0 it isn’t necessary to calculate the rest two bordering minors. Now we will consider bordering minors of the fourth order for the minor M1:
and
.
Since N1=31 0 then Rank A 4 and it isn’t necessary to calculate the minor N2. And since there is no minor of the fifth order in the matrix A then Rank A = 4.
Theorem. The rank of a matrix doesn’t change if:
All the rows are replaced by the corresponding columns and vice versa;
Replace two arbitrary rows (columns);
Multiply (divide) each element of a row (column) on the same non-zero number;
Add to (subtract from) elements of a row (column) the corresponding elements of any other row (column) multiplied on the same non-zero number.