2.13 End of Chapter 2: key points to consider
Concepts from linear algebra and MATLAB programming
(1) A one-dimensional array is called a vector and a two-dimensional array is called a
matrix.A1× 1 array is a scalar.
(2) The dot product of two vectors is defined as u v ¼
P
i¼n
i¼1
u
i
v
i
, where both vectors have
the same number of elements n. To obtain the dot product of two vectors, a column
vector on the right must be pre-multiplied by a row vector on the left. The dot
product is an example of matrix–matrix multiplication in which a 1 × n matrix is
multiplied with an n × 1 matrix.
(3) Matrix–matrix multiplication of A with B is defined if A is an m × n matrix and B is an
n × p matrix, i.e. their inner dimensions must agree. The resulting matrix C = AB has
the dimensions m × p. Every element c
ij
of C is equal to the dot product of the ith row
of A and the jth column of B.
(4) The norm of a vector is a real number that specifies the length of the vector. A p-norm
is a general metho d used to calculate the vector length and is defined, for vector v,
as kvk
p
¼
P
n
i¼1
jv
i
j
p
1=p
. The p = 2 norm (Euclid ean norm) is defined as
kvk¼
ffiffiffiffiffiffiffiffi
v v
p
¼
P
i¼n
i¼1
v
2
i
1=2
.
(5) The norm of a matrix A is a measure of the maximum degree to which A can stretch a
unit vector x. Mathematically, we write kAk¼max
kxk¼1
kAxk.
(6) A linear combination of vectors is the sum of one or more vectors of equal dimension,
each multiplied by a scalar, and results in another vector of the same dimension.
If V ¼ðv
1
; v
2
; ...; v
n
Þ is a set of vectors, and if u ¼ k
1
v
1
þ k
2
v
2
þþk
n
v
n
, where k
i
for 1 ≤ i ≤ n are scalars, then u is said to be a linear combination of the given set of
vectors V.
(7) If V ¼ðv
1
; v
2
; ...; v
n
Þ is a set of vectors, and the vector equation k
1
v
1
þ k
2
v
2
þþ
k
n
v
n
¼ 0 holds true only when all k
i
= 0 for 1 ≤ i ≤ n, then the vectors are said to be
linearly indepen dent . If it holds true for non-zero values of the scalars, i.e. there exists
multiple solutions to the vector equation, then the vectors in set V are linearly
dependent.
(8) A vector space S that contains a set of vectors V must also contain all vectors that
result from vector addition and scalar multiplication operations on the set V, i.e. all
possible linear combinations of the vector s in V. The physical three-dimensional
space that we live in is a vector space. If the vectors in the set V are linearly
independent, and all possible linear combinations of these vectors fully describe
the vector space S, then these vectors are called basis vectors for the space S.
The number of basis vectors that are required to describe the vector space S fully
is called the dimension of the vector space.
(9) The vector space spanned by the columns of a matrix is called the column space.
(10) The determinant of a matrix is defined only for square matrices and is a scalar
quantity. The determinant of an n × n matrix is the sum of all possible products of
n elements of matrix A, such that no two elements of the same row or column are
multiplied together. A matrix that has a non-zero determinant is called non-singular,
whereas a matrix whose determinant is equal to zero is singular.
(11) The rank of a matrix A is the dimension of the largest submatrix within A that has
a non-zero determinant. Equivalently, the rank of a matrix is equal to the dimension of
the column space of the matrix A, i.e. the number of linearly independent columns in A.
125
2.13 Key points