RESEARCH WORK

Linear Algebra
10/10/2017

Submitted by: Aberilla, Angelo Jose A.

Submitted to: Prof. Teresa Mandi
1. WHAT IS A ROW MATRIX? GIVE AN EXAMPLE.

A row matrix is an ordered list of numbers written in a row.

Example: [12 -9 34]

(Reference: chortle.ccsu.edu/vectorlessons/vch01/vch01_6.html)

2. HOW MANY LEADING NONZERO ENTRIES CAN AN m x n MATRIX HAVE?

(http://stattrek.com/matrix-algebra/echelon-form.aspx)

Therefore, the number of the leading nonzero entries in an m x n matrix depends

on the first element placed in each row of the matrix.

3. IF A AND B ARE ECHELON MATRICES WITH THE SAME SIZE, SHOW THAT

THE SUM A+B NEED NOT BE THE SAME SIZE BY GIVING YOUR OWN

EXAMPLE.

4. WHEN IS A MATRIX A SAID TO BE IN ROW CANONICAL FORM?

A matrix A is said to be in row canonical form (or reduced row echelon form

(RREF)) if it has the shape resulting from a Gaussian elimination; if the following

conditions hold (where a leading nonzero element of a row of A is the first

nonzero element in the row): All zero rows, if any, are at the bottom of the matrix.

Example:
 (https://en.wikipedia.org/wiki/Row_echelon_form)

(https://www.quora.com/What-is-the-difference-between-Echelon-and-reduced-

echelon-form)

5. ONE SPEAKS OF “AN” ECHELON FORM OF A MATRIX A, “THE” ROW

CANONICAL FORM OF A, WHY?

6. WHEN IS A MATRIX A CALLED A BLOCK MATRIX?

In mathematics, a block matrix or a partitioned matrix is a matrix that is

interpreted as having been broken into sections called blocks or submatrices.[1]

Intuitively, a matrix interpreted as a block matrix can be visualized as the original

matrix with a collection of horizontal and vertical lines, which break it up, or

partition it, into a collection of smaller matrices.[2] Any matrix may be

interpreted as a block matrix in one or more ways, with each interpretation

defined by how its rows and columns are partitioned.

Example:
 (https://en.wikipedia.org/wiki/Block_matrix)

7. DEFINE THE TRACE OF AN n-SQUARE MATRIX.

In linear algebra, the trace of an n-by-n square matrix A is defined to be the sum

of the elements on the main diagonal (the diagonal from the upper left to the

lower right) of A.

Example:

(https://en.wikipedia.org/wiki/Trace_(linear_algebra))

8. DEFINE A SYMMETRIC MATRIX.

In linear algebra, a symmetric matrix is a square matrix that is equal to its

transpose.

Example:
 (https://en.wikipedia.org/wiki/Symmetric_matrix)

(http://www.statisticshowto.com/wp-content/uploads/2015/06/symmetric-

matrix.jpg)

9. DEFINE A SKEW-SYMMETRIC MATRIX

As opposed to the symmetric problem, the eigenvalues a of non-symmetric matrix

do not form an orthogonal system.

(www.alglib.net/eigen/nonsymmetric/nonsymmetricevd.php)

Example:

(http://www.statisticshowto.com/wp-content/uploads/2015/06/symmetric-

matrix.jpg)

10. DEFINE ORTHOGONAL MATRIX.

A square matrix is defined as an

orthogonal matrix if its transpose matrix

is same as its inverse matrix. It is

important that the elementary condition

for a matrix to be orthogonal is that it

should be square matrix with real

elements.

The orthogonal matrix possesses the following properties:

http://slideplayer.com/2489439/9/images/2
2/Example+1+A+3%C3%973+Orthogonal+M
1) Every identity matrix is an orthogonal atrix.jpg
matrix.

2) The diagonal matrix is an orthogonal one.

4) When a collection of n × n orthogonal matrices is gathered in the form of a

group, it is called an orthogonal group and is denoted by Onn.

5) If A be an orthogonal matrix, then its transpose i.e. ATT will also be an

orthogonal matrix.

6) Similarly, inverse of an orthogonal matrix i.e. A−1−1 is also an orthogonal

matrix.

7) The product of an orthogonal matrix and its transpose matrix is equal to the

identity matrix of same order.

8) The value of determinant of orthogonal matrix is "±±1".

11) An orthogonal matrix is always a symmetric matrix.

12) The product of two orthogonal matrices is also orthogonal.

(http://math.tutorvista.com/algebra/orthogonal-matrix.html)
11. SHOW THAT THE GIVEN MATRIX IS ORTHOGONAL (Please refer to

questionnaire).

12. DEFINE NORMAL MATRIX.

The normal matrices are the matrices which are unitarily diagonalizable, i.e., are a

normal matrix if there exists a unitary matrix such that is a diagonal matrix. All

Hermitian matrices are normal but have real eigenvalues, whereas a general

normal matrix has no such restriction on its eigenvalues.

(Reference: mathworld.wolfram.com/NormalMatrix.html)

Example:

13. DEFINE A SQUARE BLOCK MATRIX.

A square block matrix is a matrix with the same number of rows and columns.

(https://en.wikipedia.org/wiki/Square_matrix)

Example:
14. DEFINE AN IDEMPOTENT MATRIX.

It is a matrix which, when multiplied by itself, yields itself. That is, the matrix M

is idempotent if and only if MM = M. For this product MM to be defined, M must

necessarily be a square matrix. Viewed this way, idempotent matrices are

idempotent elements of matrix rings.

(https://en.wikipedia.org/wiki/Idempotent_matrix)

(https://farm9.staticflickr.com/8054/8121845846_7954dcddea_o.png)

15. DEFINE AN INVOLUTORY MATRIX.

An involutory matrix is a matrix that is its own inverse. That is, multiplication by

matrix A is an involution if and only if A2 = I. Involutory matrices are all square

roots of the identity matrix. (https://en.wikipedia.org/wiki/Involutory_matrix)

Example: