Advanced Engineering Algebra
Advanced Engineering Algebra
BSECE
Research Work
(https://chortle.ccsu.edu/VectorLessons/vmch13/vmch13_4.html)
Definition: An upper triangular matrix is a square matrix in which all entries below the
main diagonal are zero (only nonzero entries are found above the main diagonal - in the
upper triangle). A lower triangular matrix is a square matrix in which all entries above
the main diagonal are zero (only nonzero entries are found below the main diagonal - in
the lower triangle).
(http://faculty.etsu.edu/joynerm/Diagonal%20Matrices.pdf)
A matrix is in row echelon form (ref) when it satisfies the following conditions.
The first non-zero element in each row, called the leading entry, is 1.
Each leading entry is in a column to the right of the leading entry in the previous
row.
Rows with all zero elements, if any, are below rows having a non-zero element.
Apdujan, Richard M.
BSECE
Each of the matrices shown below are examples of matrices in row echelon form.
1 2 3 4
1 2 3 4 1 2
0 0 1 3
0 0 1 3 0 1
0 0 0 1
0 0 0 1 0 0
0 0 0 0
Aref Bref Cref
Note: Some references present a slightly different description of the row echelon form.
They do not require that the first non-zero entry in each row is equal to 1.
A matrix is in reduced row echelon form (rref) when it satisfies the following conditions.
Each of the matrices shown below are examples of matrices in reduced row echelon
form.
1 2 0 0
1 2 0 0 1 0
0 0 1 0
0 0 1 0 0 1
0 0 0 1
0 0 0 1 0 0
0 0 0 0
Arref Brref Crref
(https://stattrek.com/matrix-algebra/echelon-form.aspx)
However, for non-singular square matrices, "row echelon" and "upper triangular" are
equivalent.
(https://math.stackexchange.com/questions/1720647/is-there-no-difference-between-
upper-triangular-matrix-and-echelon-matrixrow-ec/1720660#1720660)
Apdujan, Richard M.
BSECE
Echelon Form
A matrix that has undergone Gaussian elimination is said to be in row echelon form or,
more properly, "reduced echelon form" or "row-reduced echelon form." Such a matrix
has the following characteristics:
2. The leading entry of each nonzero row after the first occurs to the right of the leading
entry of the previous row.
4. All entries in the column above and below a leading 1 are zero.
A triangular matrix is invertible if and only if all diagonal entries are nonzero.
(http://faculty.etsu.edu/joynerm/Diagonal%20Matrices.pdf)
The matrix is triangular, but not echelon (because the leading entry 5 is not to the right
of the leading entry 4).
However, for non-singular square matrices, "row echelon" and "upper triangular" are
equivalent.
(https://math.stackexchange.com/questions/1720647/is-there-no-difference-between-
upper-triangular-matrix-and-echelon-matrixrow-ec/1720660#1720660)
(https://yutsumura.com/square-root-of-a-diagonal-matrix-how-many-square-roots-
exist/#more-1107).
The product of the two upper triangular matrices is upper triangular and the
product of the two lower triangular matrices is lower triangular.
(https://www.tutorvista.com/content/math/triangular-matrix/)
(https://math.stackexchange.com/questions/2095108/multiplication-of-two-upper-
triangular-matrices)
Apdujan, Richard M.
BSECE
Commuting Matrices
We say that two m×n matrices are row equivalent if one can be obtained from the
other by a sequence of elementary row operations.
Proof:
Suppose that b−cd≠0. Then we can obtain the matrix I from the matrix A by the
following sequence of elementary row operations.
First, we apply R2−cR1 and get
Apdujan, Richard M.
BSECE
Note that this is where we need the assumption d−cb≠0 since d−cb is in the
denominator.
The last step is R1−bR2, and we obtain
7. Explain why the following are NOT VALID for matrices. You may use concepts and
examples
a.) (A + B)(A – B) = A2 – B2
b.) (A + B)(A + B) = A2 + 2AB + B2 and A2 + BA + AB +B2
matrix differentiation is just a convenient way of keeping track of the various partial
derivatives involved.
(http://mathhelpforum.com/advanced-algebra/199735-foiling-difference-two-matrices-its-
transpose-then-derivative.html)
b.) Non-commutativity
AB ≠ BA
Distributivity
A(B + C) = AB + AC
(B + C)D = BD + CD
(https://en.wikipedia.org/wiki/Matrix_multiplication)
Apdujan, Richard M.
BSECE
(http://mathworld.wolfram.com/PolynomialCurve.html)
This example shows how to fit a polynomial curve to a set of data points using
the polyfit function. You can use polyfit to find the coefficients of a polynomial that fits a
set of data in a least-squares sense using the syntax
p = polyfit(x,y,n),
where:
x and y are vectors containing the x and y coordinates of the data points
n is the degree of the polynomial to fit
(https://www.mathworks.com/help/matlab/math/polynomial-curve-fitting.html)