CENTRAL UNIVERSITY OF ECUADOR

Faculty of Engineering, Physical Sciences and Mathematics

School of Civil Engineering

Programming II

Topic: Matrices

Members:

Casamín Socasi Wilson Jacobo

Conrado Zapata Hernán Israel

Villa Bryan Alexis Parra

Sánchez Moreno Cristian Sebastián

Yépez Lobato Alex Patricio

Semester: Second
Parallel: First
Teacher: Eng. Ramiro Pilaluisa
 Date: January 20, 2015

CONTENT
Matrices..................................................................................................................
1. THEORETICAL FOUNDATION.............................................................................
1.1 CONCEPT OF MATRIX..................................................................................
1.2 NOTATION.....................................................................................................
1.3 EQUALITY OF MATRICES...............................................................................
1.4 TYPES OF MATRICES......................................................................................
1.4.1 Rectangular matrix.......................................................................................
1.4.2 Row matrix..................................................................................................
1.4.3 Column matrix...........................................................................................
1.4.4 Zero matrix................................................................................................
1.4.5 Square matrix..........................................................................................
[Link] Diagonal of a square matrix................................................................
[Link] Trace of a square matrix.....................................................................
1.4.6 Diagonal matrix...........................................................................................
1.4.7 Scalar matrix.............................................................................................
1.4.8 Identity matrix.............................................................................................

1.4.9 Opposite matrix............................................................................................

1.4.10 Upper triangular matrix...........................................................................
1.4.11 Lower triangular matrix............................................................................
1.5 OPERATIONS WITH MATRICES......................................................................
1.5.1 LA SUM OR ADDITION OF MATRICES.........................................................
[Link] Properties of algebraic addition................................................................
1.5.2 MULTIPLICATION BY A SCALAR........................................................
1.6 EQUIVALENT MATRICES............................................................................
1.7 WAYS TO OBTAIN ZEROS IN A ROW OR COLUMN
FROM A MATRIX..................................................................................................
1.8 MATRIX MULTIPLICATION....................................................................
1.8.1 PROPERTIES OF MATRIX MULTIPLICATION
.......................................................................................................................
1.9 TRANSPOSED MATRIX................................................................................
1.10 LINEAR EQUATIONS................................................................................
1.11 MATRICES AND SYSTEM OF LINEAR EQUATIONS.......................................
1.11.1 THEOREM THE GAUSS-JORDAN................................................................
CONCLUSIONES.....................................................................................................
 BIBLIOGRAPHY.......................................................................................................

MATRICES
[Link]
1.1CONCEPTOFMATRIX
A matrix is by definition an arrangement of numerical coefficients (factors
multiplicative) or literals that have been arranged in rows (m) and columns (n)
respectively. Kleiman Ariel-Elena K of Kleiman, (2002), defines "the matrices is
basically, information that has been provided to us, and is used in the
resolution of linear equations. For other applications, it is advisable to develop a
matrix arithmetic in which it is possible to add, multiply the matrices in one
useful form.

1.2NOTATION
A matrix is typically represented by the following notation 'aijwhere the
Subscripts indicate the row and column of the corresponding element.

a11a12a13.………………………….…a1n
a21a22a23…….……………………..a2n
: : : :
: :: :
am1am2am3………………………...amn m×n

According to Kleiman Ariel-Elena K of Kleiman, (2002) 'when observing the matrices

They are commonly referred to as scalars (numbers) for numerical quantities.

1.3EQUALITYOFMATRICES

Two matrices A and B are considered equal if the elements are equivalent.
Equal matrices are defined to have the same order.
Example:

a0 2331 1 8 3
=
B = 100º 5032 1 1 9
2×3 2×3

1.4TYPESOFMATRICES

1.4.1RECTANGULARMATRIX
It is the one that has a different number of columns than rows.

a11a12a13.…………………………a1n
a21a22a23…….……………………..a2n
A= : : : :
: : : :
am1am2am3………………………...amn m×n

1.4.2ROWMATRIX
It is the rectangular matrix that only has one row.

A = a11a12a13...... a1n 1×n

1.4.3COLUMNMATRIX
It is the rectangular matrix that has only one column.

a11
a21
A= a31
:
am1 m×1

1.4.4NULLMATRIX
It is the one that has all its terms null, that is, they are equal to zero.

0 0 . . . 0
A= 0 0 . . . 0
 0 0 . . .0

This matrix can have any order.

1.4.5SQUAREMATRIX
A matrix A with n rows and n columns is called a square matrix of order n and how
we can see in the figure the elements11a22.....ann they are on the diagonal.

a11a12.....a1n
a21 a22. . . . a2n
A= : : :
: : :
an1an2 ………… ann n×n

[Link] DIAGONAL OF A SQUARE MATRIX

José Manuel Casteleiro Villalba, (2010) defines "every square matrix has two
diagonals, one of which is called the main diagonal and the other the secondary diagonal.

Main diagonal Secondary diagonal

a11a12. . . .. a1n
a21a22. . . . . a2n
A= a31a32. . . . . a3n
: : :
an1an2 ………… ann n×n

Knowing that rectangular matrices do not have diagonals, José

Manuel Villalba (2010) defines 'the diagonal of the largest square hue'
that contains and we will call it pseudodiagonal.” This has a large
importance in the calculation.

Pseudodiagonal
a11a12a13a14a15a16
 B = a21a22a23a24a25a26
a31a32a33a34a35a36

1.4.5.2TRACEOFASQUAREMATRIX
It is the sum of the main diagonal of a square matrix.

Tr(A)=a11+ a22+ a33+ . . . ann

1.4.6DIAGONALMATRIX
It is the square matrix that only has the elements of the main diagonal different from zero.
zero.
a 0 0
A= 0 b 0
0 0 c

1.4.7SCALARMATRIX
It is the diagonal matrix whose elements are equal to each other and different from zero.

a 0 0
A = 0 to 0
0 0 a

1.4.8UNITMATRIX
It is the scalar matrix (number) whose value is one.

1 0 0 . 0
0 1 0 . 0
In= 0 0 1 . 0
: : : :
0 0 0 . 1

(InWith n equal to the order of the unit.

1.4.9OPPOSITEMATRIX
It is an opposite matrix when all the terms of matrix A have the same value.
but with the opposite sign and it is denoted by (-A)

a -b c -a b -c
 A = -d f -g (-A) = d - f g

1.4.10UPPERTRIANGULARMATRIX
It is any square matrix whose elements are located below the diagonal
principal are null.

a1a2a3a4
0 b2b3b4
A= 0 0 c3c4
0 0 0 d4

1.4.11LOWERTRIANGULARMATRIX
It is any square matrix whose terms located above the main diagonal are
nulls.

a10 0 0
b1b20 0
A = c1c2 c30
d1d2d3d4

1.5OPERATIONSWITHMATRICES

1.5.1 THE SUM OR ADDITION OF MATRICES

The sum of matrices is possible as long as the addends have the same order.
that is to say have the same number of rows as columns. The operation itself
It will consist of adding or subtracting the corresponding elements.

a1a2a3 b1b2b3 a1± b1a2±b2a3±b3

A ± B = a4a5a6± b4b5b6= a4± b4a5±b5a6±b6
a7a8a9b7b8b9a7± b7a8±b8a9±b9
1.5.1.1PROPERTIESOFALGEBRAICSUMMATION

Associative property

(A + B) + C = A + (B + C)

Commutative property

A+ B = B +A

Neutral element 0

A+ 0 =A
1 + A = A

Symmetric element

A + (-A) = 0
(-A) + A = 0

1.5.2MULTIPLICATIONBYASCALAR

If a matrix A is multiplied by a scalar, the result is a new matrix in the

all its elements are multiplied by the value of k.

a11a12. . . a1n ka11ka12. . . ka1n

kA = k b21b22b2n = kb21kb22. . . .kb2n
: : : : : :
cn1cn2. . . . cnn kcn1kcn2. . . . kcnn

1.6 EQUIVALENTMATRICES

A matrix is equivalent to another when it is obtained from the former by operations.

elementary rows and columns.
1.7WAYSTOOBTAINZEROSINAROWOR
COLUMNOFAMATRIX.

According to José Casteleiro (2010), he states that 'in order to transform a term of the
matrix in a zero follows the following case:
The pivot is a 1, which we are going to use to achieve transforming a term into
zero.

1.8MATRIXMULTIPLICATION

Matrix multiplication is applied whenever the number of columns of

the first matrix is equal to the number of rows of the second matrix. The operation
it will consist of multiplying, term by term. Each of the rows of the first matrix
through the corresponding column in the second matrix, and sum the results
obtained.

a1a2a3 b1b2b3
A. B = a4a5a6. b4b5b6=
a7a8a9b7b8b9

a1b1± a2b4±a3b7a1b2± a2b5±a3b8a1b3± a2b6+a3b9

a4b1± a5b4±a6b7a4b2± a5b5±a6b8a4b3± a5b6±a6b9
a7b1± a8b4±a9b7a7b2± a8b5±a9b8a7b3± a8b6±a9b9

1.8.1PROPERTIESOFMATRIXMULTIPLICATION

Associative

A . (B . C) = (A . B) . C

Neutral elemental

A. I =A

Where I is the unit, that is to say the identity of the matrix.

It is not commutative

A. B ≠ B .A

Distributive property of multiplication over addition

A . (B + C) = A . B + A . C

1.9TRANSPOSEDMATRICES

Ariel Kleiman. (2002) defines 'in matrix theory the transpose of a matrix is defined
always in relation to another matrix. The transposed matrix is a new matrix in which
rows have been exchanged for columns, in relation to the given matrix.

Example:

A = a1a2 AT= a1b1

b1b2 a2b2

1.10LINEAREQUATIONS

A system of linear equations or simply a linear system is an expression of

type:

a1x1+ a2x2+……+anxnb=

Where:

a1 = coefficient

x1=variable

b = constant

As long as the equation has a solution, there are homogeneous systems of equations and
heterogeneous.
Homogeneous systems - are those where their constant is equal to zero. If the
the number of equations is equal to the number of variables, then the system can have
a single trivial solution (Obvious solution to an equation or set of equations that
does not provide useful information about a given context). For example, x5+ y5= z5has
a trivial solution x = 0; y = 0; z = 0. That is, each variable will be zero; if it does not occur
thus it will have infinite solutions.

Heterogeneous systems.- these are those in which the constant is different from zero, these
systems can have a unique solution different from the trivial, or it can have infinite solutions
solutions, and just like the homogeneous ones, the number of equations is taken into account.
just like its number of variables, and depending on that we will know if it will have a solution
not trivial or if not it will have infinite solutions.

1.11 MATRICES AND SYSTEM OF LINEAR EQUATIONS

1.11.1 GAUSS-JORDAN THEOREM

This theorem will allow us to determine the characteristics of a system of equations.

linear.
Here we apply defined operations for the rows of a matrix which are:

1.- Two rows can be swapped with each other.

2.- Any of the rows, whichever it may be, can be multiplied by a different scalar.
from scratch.

3.- You can add or subtract two rows of a matrix that have previously been
multiplied by suitable numerical coefficients.

Practical rule
According to Kleiman Ariel-Elena K of Kleiman, (2002) it states that 'this procedure consists of

applying the operations defined for the rows of a matrix in such a way that in the
diagonal of elements a11a12a13.......annthe unit is obtained. These operations give us
they will allow obtaining zeros in the elements that are below the diagonal.
Example:

Find the solution of the following linear system.

x+y+z=2
2x + 5y + 3z = 1
3x – y – 2z = -1

1.-We set up the augmented matrix of the linear system.

1 1 1 2
2 5 3 1F2- 2F1
3 -1 -2 -1F3– 3F1
2.- We apply the operations defined for the rows of a matrix.

1 1 1 2
1
0 3 1 -3F2
3
0 -4 -5 -7

1 1 1 2
1
0 1 -1
3

0 -4 -5 -7 F3+ 4F2

1 1 1 2
1
0 1 -1
3

−11 −3
0 0 -11 F3
3 11

1 1 1 2
1
0 1 -1
3

0 0 1 3
Then we rewrite the proposed linear system

x+y+z=2
z
y+ -1
3

z=3
And from the value of this variable, we can find the value of the other variables.
 3
y+ =1 x-2+3=2
3
x=2-1
y = -1 -1x = 1

y = -2

Verification

1-2+3=2 (v)
2(1)+5(-2) + 3(3) = 1 (v)
3(1) - (-2) - (2)(3) = -1 (v)

CONCLUSIONS

After having completed this work, we can draw some conclusions.

important such as:

Matrix theory was introduced in 1858, it has applications today in

various fields such as inventory control in factories; theory
quantum, in physics; cost analysis in transportation and other industries;
problems of strategies in military operations and data analysis, in
psychology and sociology.

Using matrices, solutions are obtained. systems of equations

linear, it also highlights the importance they have in problem-solving
everyday life problems for which an exact solution is reached
and better results in a certain process.

BIBLIOGRAPHY
CASTELEIRO VILLALBA,JOSÉ MANUEL,Las matrices son fáciles,ESIC
Editorial SPAIN, 2010.
KLEIMAN, ARIEL. KLEIMAN, ELENA, Matrices, mathematical applications
in economics and management. Limusa Publishing, SPAIN, 2002.
HERNÁNDEZ RUÍPIDEZ, DANIEL,Álgebra lineal, ESPAÑA. Editorial
University of Salamanca, SPAIN, 1985.
Schwartz T, Jacob,Introducción a matrices y vectores, Editorial Courier Dover
Publication, NEW YORK, 2011.
KOLMAN, BERNARD. ROSS HILL, DAVID, Linear Algebra, Pearson Editorial
Education, GERMANY, 2006.