CHAPTER

MATH 321: Advance Math

Matrices 1
➠Terminologies and Variables

𝑨 = [𝒂𝒊𝒋] Capital letter is used to denote a matrix.

Diagonal Matrix All entries are zero expect the main
diagonal.
Elementary Row Operations Elementary operations performed on an
𝑚 × 𝑛 matrix.
Identity Matrix The main diagonal is equal to one and
all entries is zero.
Lower Triangular Matrix The upper part of the main diagonal is
all zero.
𝒎×𝒏 Size of the matrix
Matrices An 𝑚 × 𝑛 matrix is a rectangular list or
array of numbers with 𝑚 row and
𝑛 columns.
Matrix Inverse The inverse of an 𝑚 × 𝑛 matrix is the
𝑚 × 𝑛 matrix which when multiplied to
it gives an identity matrix denoted by
𝐴−1 .
Row Echelon Form A process of performing operations on a
matrix in order to achieve an upper
triangular system.
Scalar Matrix A diagonal matrix where all terms on the
main diagonal are equal.
Skew Anti-Symmetric Matrix The matrix is equal to its negative
transpose.
Symmetric Matrix The matrix is equal to its transpose.
Transpose of a Matrix An 𝑚 × 𝑛 matrix A is the 𝑚 × 𝑛 matrix
denoted by AT, whose 𝑖𝑗𝑡ℎ entry is the
𝑗𝑖 𝑡ℎ entry of A.
Upper Triangular Matrix The lower part of the main diagonal is all
zero.

Booklet for Aspiring Engineering Students 1

 MATH 321 Advance Math Chapter 1

Matrices
➠Formulas
Subtopic: Matrix Addition
𝑨 + 𝑩 = [𝒂𝒊𝒋] + [𝒃𝒊𝒋] = [𝒂𝒊𝒋 + 𝒃𝒊𝒋]
Remarks:
(𝑨 + 𝑩)𝑻 = 𝑨𝑻 + 𝑩𝑻

Subtopic: Scalar Multiplication

𝒂[𝑩] = [𝒂(𝒃𝒊𝒋)]

Subtopic: Matrix Multiplication

∑𝒑𝒌=𝟏 𝒂𝒊𝒌 𝒃𝒌𝒋
𝑫
[𝑨 𝑩 𝑪] [ 𝑬 ] = 𝑨𝑫 + 𝑩𝑬 + 𝑪𝑭
𝑭
Remarks:
(𝑨𝑩)𝑻 = 𝑩𝑻 𝑨𝑻
(𝑨𝑩)𝑪 = 𝑨(𝑩𝑪)
𝑨(𝑩 + 𝑪) = 𝑨𝑩 + 𝑨𝑪
(𝑩 + 𝑪)𝑨 = 𝑩𝑨 + 𝑪𝑨

Subtopic: Matrix Inverse

𝑨[𝑨−𝟏 ] = 𝑰
Remarks:
1. If 𝑨−𝟏 𝑨 = 𝑰, then If 𝑨𝑨−𝟏 = 𝑰
2. Matrix inverse is unique if 𝑨𝑩 = 𝑰 and 𝑨𝑪 = 𝑰
3. If 𝑨 and 𝑩 are invertible then 𝑨𝑩 is also invertible:
(𝑨𝑩)−𝟏 = 𝑩−𝟏 𝑨−𝟏
(𝑩−𝟏 𝑨−𝟏 )𝑨𝑩 = 𝑰
4. (𝑨 ) = 𝑨
−𝟏 −𝟏

𝒂 𝒃 𝑨𝒂
5. If 𝑨 = [ ] with 𝒂𝒅 − 𝒃𝒄 ≠ 𝟎, then 𝑨−𝟏 = |𝑨|
𝒄 𝒅

Subtopic: Elementary Row Operations(ERO)

1. Interchanging any two rows
𝒂 𝒃 𝒄 𝒅
[ ] 𝑹 ↔ 𝑹𝟐 [ ]
𝒄 𝒅 𝟏 𝒂 𝒃
2. Multiplying a row by a non-zero scalar or number
𝒂 𝒃 → 𝟎. 𝟓𝑹𝟏 𝟎. 𝟓𝒂 𝟎. 𝟓𝒃
[ ] [ ]
𝒄 𝒅 → 𝟑𝑹𝟐 𝟑𝒄 𝟑𝒅

2 Booklet for Aspiring Engineering Students

 Chapter 1 Advance Math MATH 321
Matrices

3. Adding a multiple of a row to another row

𝒂 𝒃 → 𝒂 𝒃
[ ] [ ]
𝒄 𝒅 → (𝑹𝟏 − 𝑹𝟐 ) 𝒂 − 𝒄 𝒃 − 𝒅

Subtopic: Row Echelon Form(REF)

1. Find the 1st column with a non-zero entry
2. The 1st entry of this column is not zero
3. Use the leading non-zero in step 2 to zero out all entries below it
4. Repeat steps 1,2,3 with the submatrix obtained by deleting the 1 st
row
5. Continue the process until a submatrix has only zero row

Notes:
Notes / Additional
information
Matrix Addition Entry-wise addition,
should be the same
dimension
Matrix Multiplication The two matrices
should be an 𝑚 × 𝑛
and 𝑛 × 𝑝, which the
answer will be 𝑚 × 𝑝
Matrix Inverse If the matrix has an
inverse, then it is
invertible or non-
singular
Matrix Inverse (𝑎𝑑 − 𝑏𝑐) is called
the determinant

Row Echelon Form Use Elementary Row

Operations if
necessary

Booklet for Aspiring Engineering Students 3

CHAPTER

2 MATH 321: Advance Math

Systems of Linear Equations

➠Terminologies and Variables

Gaussian Elimination Process of solving linear

systems by transforming it to an
upper triangular system,
followed by performing backward
substitution.
Gauss-Jordan Process of transforming a matrix
Elimination to Reduced Row Echelon Form.
Gauss-Seidel Method Method of successive
replacements
Jacobi Method Method of simultaneous
replacements
Reduced Row Echelon A process of performing
Form operations on a matrix in order to
achieve an Identity Matrix
➠Formulas
Subtopic: Gaussian Elimination
𝑨𝒙 + 𝑩𝒚 + 𝑪𝒛 = 𝟏
{𝑫𝒙 + 𝑬𝒚 + 𝑭𝒛 = 𝟐
𝑮𝒙 + 𝑯𝒚 + 𝑰𝒛 = 𝟑
𝑨 𝑩 𝑪 𝟏 𝟏 . . .
[𝑫 𝑬 𝑭 𝟐] → (𝑬𝑹𝑶) [𝟎 𝟏 . .]
𝑮 𝑯 𝑰 𝟑 𝟎 𝟎 𝟏 .

Subtopic: Gauss-Jordan Elimination

𝑨𝒙 + 𝑩𝒚 + 𝑪𝒛 = 𝟏
{ 𝑫𝒙 + 𝑬𝒚 + 𝑭𝒛 = 𝟐
𝑮𝒙 + 𝑯𝒚 + 𝑰𝒛 = 𝟑
𝑨 𝑩 𝑪 𝟏 𝟏 𝟎 𝟎 .
[𝑫 𝑬 𝑭 𝟐] → (𝑬𝑹𝑶) [𝟎 𝟏 𝟎 .]
𝑮 𝑯 𝑰 𝟑 𝟎 𝟎 𝟏 .

Subtopic: Inverse of a Matrix using Gauss-Jordan Elimination

𝑨 𝑩 𝑪
𝑨 = [𝑫 𝑬 𝑭]
𝑮 𝑯 𝑰
𝑨 𝑩 𝑪 . 𝟏 𝟎 𝟎
𝑨 ⋮ 𝑰 = [𝑫 𝑬 𝑭 . 𝟎 𝟏 𝟎] → (𝑬𝑹𝑶)
𝑮 𝑯 𝑰 . 𝟎 𝟎 𝟏

4 Booklet for Aspiring Engineering Students

Chapter 2 Advance Math MATH 321
Systems of Linear Equations
𝟏 𝟎 𝟎 . 𝑨𝒙 𝑩𝒙 𝑪𝒙
𝑨 ⋮ 𝑰 = [𝟎 𝟏 𝟎 . 𝑫𝒙 𝑬𝒙 𝑭𝒙 ]
𝟎 𝟎 𝟏 . 𝑮𝒙 𝑯𝒙 𝑰𝒙
𝑨𝒙 𝑩𝒙 𝑪𝒙
𝑨−𝟏 = [𝑫𝒙 𝑬𝒙 𝑭𝒙 ]
𝑮𝒙 𝑯𝒙 𝑰𝒙

Notes:

Notes / Additional
information
𝑨 𝑩 𝑪 Also known as the
[𝑫 𝑬 𝑭] coefficient matrix
𝑮 𝑯 𝑰
𝑨 𝑩 𝑪 𝟏 Also known as the
[ 𝑫 𝑬 𝑭 𝟐] augmented matrix
𝑮 𝑯 𝑰 𝟑
Gauss-Jordan Elimination The corresponding
column indicates the
variable being solved
and the corresponding
row indicates the
value of that specific
variable
Inverse of a Matrix using The inverse of the
Gauss-Jordan Elimination matrix is multiplied to
the constant of the
equation to determine
the value of each
variable
Jacobi Method Use previous values
to solve for the next
set
Gauss-Seidel Method Use solved values to
solve for the next set

Booklet for Aspiring Engineering Students 5

CHAPTER

3 MATH 321: Advance Math

Root Finding

➠Terminologies and Variables

Bisection Method A method that proceeds by

bisecting the interval, by
computing the midpoint, the
lower endpoint, and the upper
endpoint.
Fixed-Point Iteration Method of successive
Method substitution
Iterate A value of the unknown or
approximated value obtained in
a particular step of the iteration
process.
Iteration A technique in which roots of an
equation is formed by
successive approximations.
Newton-Rapson Method Method that makes use of the
root of a tangent line to the curve
of the given function 𝑓 to
approximate the actual ∝ of 𝑓.
Root Finding The process of finding 𝑥 such
that for a given 𝑓(𝑥).
Secant Method Method that uses the root of an
equation of a secant line to
approximate the root ∝ of a
continuous function 𝑓.

➠Formulas
Subtopic: Bisection Method
1. Given an ∈ - error tolerance, initial values of a, b where:
𝒂 − 𝒍𝒆𝒇𝒕 𝒆𝒏𝒅𝒑𝒐𝒊𝒏𝒕
𝒃 − 𝒓𝒊𝒈𝒉𝒕 𝒆𝒏𝒅𝒑𝒐𝒊𝒏𝒕
𝑰 = [𝒂, 𝒃]
𝟏
𝒄 = (𝒂 + 𝒃)
𝟐
2. If 𝒃 − 𝒄 ≤ ∈, then accept 𝒄 as the root
3. If 𝒇(𝒃) ∗ 𝒇(𝒄) < 𝟎, then 𝒂 = 𝒄 otherwise 𝒃 = 𝒄
∴ 𝒇(𝒂) ∗ 𝒇(𝒄) < 𝟎, then new 𝑰 = [𝒂, 𝒄]
∴ 𝒇(𝒂) ∗ 𝒇(𝒄) > 𝟎, then new 𝑰 = [𝒄, 𝒃]
𝒃−𝒂
𝐥𝐨𝐠( ∈ )
4. The number of iterations is 𝒏 ≥
𝐥𝐨𝐠 𝟐

6 Booklet for Aspiring Engineering Students

 Chapter 3 Advance Math MATH 321
Root Finding
Subtopic: Newton-Rapson Method
𝒇(𝑿𝒏 )
𝑿𝒏+𝟏 = 𝑿𝒏 −
𝒇′ (𝑿𝒏 )
𝑿𝒏+𝟏 −𝑿𝒏
𝑨𝒃𝒔𝒐𝒍𝒖𝒕𝒆 𝑹𝒆𝒍𝒂𝒕𝒊𝒗𝒆 𝑬𝒓𝒓𝒐𝒓 = | |
𝑿𝒏+𝟏

Subtopic: Secant Method

[𝒇(𝑿𝒏 )](𝑿𝒏 −𝑿𝒏−𝟏 )
𝑿𝒏+𝟏 = 𝑿𝒏 −
𝒇(𝑿𝒏 )−𝒇(𝑿𝒏−𝟏 )

Subtopic: Fixed-Point Iteration Method

1. From the given 𝒇(𝒙), set the iteration formula to 𝒙 = 𝒈(𝒙), so that
𝒇(𝒙) = 𝒙 − 𝒈(𝒙) = 𝟎
2. Obtain the next 𝑿𝒏 value respectively by 𝑿𝒏+𝟏 = 𝒈(𝒙)
3. Test of Convergence
∴If 𝟎 < |𝒈′ (𝒙)| < 𝟏, then 𝒈(𝒙) converges
∴If |𝒈′ (𝒙)| ≥ 𝟏, then 𝒈(𝒙) diverges

Topic Notes / Additional

information
Root Finding Use radians function
in trigonometric
equations

Booklet for Aspiring Engineering Students 7

CHAPTER

4 MATH 321: Advance Math

Laplace Transform
➠Formulas
Topic: Laplace Transform
∞

𝓛{𝒇(𝒕)} = ∫ 𝒆−𝒔𝒕 𝒇(𝒕)𝒅𝒕

𝟎
𝓛{𝒇(𝒕)} = 𝒇(𝒔)

Subtopic: Additional Formulas

𝒌
1. 𝓛{𝒌} =
𝒔
𝟏
2. 𝓛{𝒆𝒂𝒕 } =
𝒔−𝒂
𝒏!
3. 𝓛{𝒕𝒏 } =
𝒔𝒏+𝟏
𝟏−𝒆−𝒕 𝟏
4. 𝓛{ } = 𝐥𝐧 (𝟏 + )
𝒕 𝒔
5. 𝒂𝒕
𝓛{𝒆 𝒇(𝒕)} = 𝒇(𝒔 − 𝒂)
6. 𝓛{𝒕𝒏 𝒇(𝒕)} = (−𝟏)𝒏 𝒇𝒏 (𝒔)
𝒌
7. 𝓛{𝐬𝐢𝐧 𝒌𝒕} = 𝟐 𝟐
𝒔 +𝒌
𝒔
8. 𝓛{𝐜𝐨𝐬 𝒌𝒕} =
𝒔𝟐 +𝒌𝟐
𝟐𝒌𝒔
9. 𝓛{𝐭𝐬𝐢𝐧 𝒌𝒕} = 𝟐
(𝒔𝟐 +𝒌𝟐 )
𝒌
10. 𝓛{𝐬𝐢𝐧𝐡 𝒌𝒕} =
𝒔𝟐 −𝒌𝟐
𝒔
11. 𝓛{𝐜𝐨𝐬𝐡 𝒌𝒕} =
𝒔𝟐 −𝒌𝟐
𝐬𝐢𝐧 𝒌𝒕 𝒌
12. 𝓛 { } = 𝐭𝐚𝐧−𝟏
𝒕 𝒔
𝟐 𝐬𝐢𝐧𝐡 𝒌𝒕 𝒔+𝒌
13. 𝓛 { } = 𝐥𝐧 ( )
𝒕 𝒔−𝒌
𝟐 𝒌𝟐
14. 𝓛 { (𝟏 − 𝐜𝐨𝐬 𝒌𝒕)} = 𝐥𝐧 (𝟏 + )
𝒕 𝒔𝟐
𝟐 𝒌𝟐
15. 𝓛 { (𝟏 − 𝐜𝐨𝐬𝐡 𝒌𝒕)} = 𝐥𝐧 (𝟏 − )
𝒕 𝒔𝟐
𝟐𝒌𝟑
16. 𝓛{𝐬𝐢𝐧𝐡 𝒌𝒕 − 𝒌𝒕 𝐜𝐨𝐬 𝒌𝒕} = 𝟐
(𝒔𝟐 +𝒌𝟐 )

8 Booklet for Aspiring Engineering Students

 CHAPTER
MATH 321: Advance Math
Inverse Laplace Transform 5
➠Formulas
Topic: Inverse Laplace Transform
𝓛{𝒇(𝒕)} = 𝒇(𝒔)
𝓛−𝟏 𝓛{𝒇(𝒕)} = 𝓛−𝟏 {𝒇(𝒔)}
𝒇(𝒕) = 𝓛−𝟏 {𝒇(𝒔)}

Subtopic: Additional Formulas

1. 𝓛−𝟏 {𝒇(𝒔)} = 𝒇(𝒕)
2. 𝓛−𝟏 {𝒇(𝒔 − 𝒂)} = 𝒆𝒂𝒕 𝒇(𝒕)
3. 𝓛−𝟏 {𝒇𝒏 (𝒔)} = (−𝟏)𝒏 𝒕𝒏 𝒇(𝒕)

Notes / Additional
Topic
information
Method of solving the Use a laplace
Inverse Laplace transform table and
Transform method of partial
fractions.

Booklet for Aspiring Engineering Students 9

CHAPTER

6 MATH 321: Advance Math

Transforms of Derivatives

➠Formulas
Topic: Transforms of Derivatives
Derivation:
∞
𝓛−𝟏 {𝒇′ (𝒕)} = ∫𝟎 𝒆−𝒔𝒕 𝒇′ (𝒕)𝒅𝒕
∞ ∞
𝓛−𝟏 {𝒇′ (𝒕)} = 𝒆−𝒔𝒕 𝒇(𝒕)] + 𝒔 ∫𝟎 𝒆−𝒔𝒕 𝒇(𝒕)𝒅𝒕
𝟎
𝓛−𝟏 {𝒇′ (𝒕)} = −𝒇(𝟎) + 𝒔𝓛{𝒇(𝒕)}

∞
𝓛−𝟏 {𝒇′′ (𝒕)} = ∫𝟎 𝒆−𝒔𝒕 𝒇′′ (𝒕)𝒅𝒕
∞ ∞
𝓛−𝟏 {𝒇′′ (𝒕)} = 𝒆−𝒔𝒕 𝒇′ (𝒕)] + 𝒔 ∫𝟎 𝒆−𝒔𝒕 𝒇′ (𝒕)𝒅𝒕
𝟎
𝓛−𝟏 {𝒇′′ (𝒕)} = −𝒇′ (𝟎) + 𝒔[−𝒇(𝟎) + 𝒔𝓛{𝒇(𝒕)}]
𝓛−𝟏 {𝒇′′ (𝒕)} = −𝒇′ (𝟎) − 𝒔𝒇(𝟎) + 𝒔𝟐 𝓛{𝒇(𝒕)}

∞
𝓛−𝟏 {𝒇′′′ (𝒕)} = ∫𝟎 𝒆−𝒔𝒕 𝒇′′′ (𝒕)𝒅𝒕
∞ ∞
𝓛−𝟏 {𝒇′′′ (𝒕)} = 𝒆−𝒔𝒕 𝒇′′ (𝒕)] + 𝒔 ∫𝟎 𝒆−𝒔𝒕 𝒇′′ (𝒕)𝒅𝒕
𝟎
𝓛−𝟏 {𝒇′′′ (𝒕)} = −𝒇′′ (𝟎) + 𝒔[−𝒇′ (𝟎) − 𝒔𝒇(𝟎) + 𝒔𝟐 𝓛{𝒇(𝒕)}]
𝓛−𝟏 {𝒇′′′ (𝒕)} = −𝒇′′ (𝟎) − 𝒔𝒇′ (𝟎) − 𝒔𝟐 + 𝒔𝟑 𝓛{𝒇(𝒕)}

General Formula:
𝓛{𝒇𝒏 (𝒕)} = 𝒔𝒏 𝓛{𝒇(𝒕)} − ∑𝒏−𝟏
𝒌=𝟎 𝒔
𝒏−𝟏−𝒌 𝒌 (𝟎)
𝒇

Notes / Additional
Topic
information
Transforms of Derivatives It is used when the
equation contains a
derivative.

10 Booklet for Aspiring Engineering Students

 CHAPTER
MATH 321: Advance Math
Harmonic Motion 7
➠Terminologies and Variables

Harmonic Motion The spring is stretched or compressed,

its change in length will be proportional
to the forces exerted upon it and when
that force is removed. The spring will
return to its original position with its
length and other physical properties
unchanged.

➠Illustrations/ Figures

➠Formulas
Topic: Harmonic Motion
𝒅𝟐 𝒙
𝒎 = −𝒌𝒙 − 𝒃𝒗
𝒅𝒕𝟐
𝒘 𝒅𝟐 𝒙
( ) + 𝒌𝒙 + 𝒃𝒗 = 𝟎
𝒈 𝒅𝒕𝟐

∴If an additional vertical force due to the motion of the support or to

the pressure of a magnetic force is impressed upon the system, the impressed
𝒘
force is 𝒇(𝒕)
𝒈
𝒘 𝒅𝟐 𝒙 𝒘
( ) + 𝒌𝒙 + 𝒃𝒗 = 𝒇(𝒕)
𝒈 𝒅𝒕𝟐 𝒈

Booklet for Aspiring Engineering Students 11

 MATH 321 Advance Math Chapter 7

Harmonic Motion
Topic: Harmonic Motion

𝑨𝒎𝒑𝒍𝒊𝒕𝒖𝒅𝒆 = √𝑪𝟏 𝟐 + 𝑪𝟐 𝟐
𝟐𝝅
𝑷𝒆𝒓𝒊𝒐𝒅 =
𝒃
𝟏 𝒃
𝑭𝒓𝒆𝒒𝒖𝒆𝒏𝒄𝒚 = =
𝑷 𝟐𝝅

Notes / Additional
Topic
information
𝒌 It is the spring
constant
𝑸 𝑄 is the magnitude of
𝒌=
𝑪 force and 𝐶 is the
length of stretch
Amplitude 𝐶1 𝑎𝑛𝑑 𝐶2 are the
constants of the
solved equation
Period and Frequency 𝑏 is the constant of
the trigonometric
function

12 Booklet for Aspiring Engineering Students

 CHAPTER
MATH 321: Advance Math
Power Series 8
➠Terminologies and Variables

Fourier Series An infinite series in which the terms are

constants multiplied by sine and cosine
functions of integer multiplies of the
variable.
Interval of Convergence(IOC) Interval around 𝑋𝑜 for which 𝑓(𝑥)
converges.
Maclaurin Series The expansion of a function about a
point when 𝑎 = 0.
Power Series An infinite sum of the product of certain
numbers and powers of the variable x
Radius of Convergence(ROC) The number so that a power series
converges absolutely for all
|𝑋 − 𝑋𝑜 | < 𝑅
Ratio Test Absolute convergence of a power series
Taylor Series Is a series expansion of a function about
a point.

➠Formulas
Topic: Power Series
1. Power Series in x
∞

∑ 𝑪𝒏 𝒙𝒏 = 𝑪𝟎 + 𝑪𝟏 𝒙 + 𝑪𝟐 𝒙𝟐 + ⋯ 𝑪𝒏 𝒙𝒏 + ⋯
𝒏=𝟎
2. Power Series centered at xo
∞

∑ 𝑪𝒏 (𝒙 − 𝒙𝒐 )𝒏 = 𝑪𝟎 + 𝑪𝟏 (𝒙 − 𝒙𝒐 ) + 𝑪𝟐 (𝒙 − 𝒙𝒐 )𝟐
𝒏=𝟎
+ ⋯ 𝑪𝒏 (𝒙 − 𝒙𝒐 )𝒏 + ⋯
Ratio Test:
𝒂𝒏+𝟏 (𝒙 − 𝒙𝒐 )𝒏+𝟏 𝒂𝒏+𝟏
𝐥𝐢𝐦 [ 𝒏
] = |𝒙 − 𝒙𝒐 | 𝐥𝐢𝐦 [ ] = |𝒙 − 𝒙𝒐 |𝑳
𝒏→∞ 𝒂𝒏 (𝒙 − 𝒙𝒐 ) 𝒏→∞ 𝒂𝒏

If:
|𝒙 − 𝒙𝒐 |𝑳 < 𝟏 it converges
|𝒙 − 𝒙𝒐 |𝑳 > 𝟏 it diverges
|𝒙 − 𝒙𝒐 |𝑳 = 𝟏 inconclusive

Radius of Convergence:

Booklet for Aspiring Engineering Students 13

 MATH 321 Advance Math Chapter 8

Power Series
|𝒙 − 𝒙𝒐 |𝑳 < 𝟏
𝟏
|𝒙 − 𝒙𝒐 | <
𝑳
𝟏
𝑹𝑶𝑪 =
𝑳

Topic: Power Series

Interval of Convergence:
𝟏 𝟏
− < 𝒙 − 𝒙𝒐 <
𝑳 𝑳
𝟏 𝟏
(− + 𝒙𝒐 ) < 𝒙 < ( + 𝒙𝒐 )
𝑳 𝑳

Subtopic: Power Series of Functions

1. Taylor Series
∞
𝒇𝒏 (𝒂)(𝒙 − 𝒂)𝒏 (𝒙 − 𝒂)𝟐 ′′
∑ = 𝒇(𝒂) + (𝒙 − 𝒂)𝒇′ (𝒂) + 𝒇 (𝒂) ⋯
𝒏! 𝟐!
𝒏=𝟎
2. Maclaurin Series
∞
𝒇𝒏 (𝟎)(𝒙)𝒏 𝒙𝟐
∑ = 𝒇(𝟎) + 𝒙𝒇′ (𝟎) + 𝒇′′ (𝟎) ⋯ ⋯
𝒏! 𝟐!
𝒏=𝟎

3. Fourier Series
∞
𝟏 𝒏𝝅𝒙 𝒏𝝅𝒙
𝒇(𝒙) = 𝒂𝒐 + ∑ (𝒂𝒏 𝐜𝐨𝐬 + 𝒃𝒏 𝐬𝐢𝐧 )
𝟐 𝒄 𝒄
𝒏=𝟏
𝟏 𝒄
𝒂𝒐 = ∫ 𝒇(𝒙) 𝒅𝒙
𝒄 −𝒄
𝟏 𝒄 𝒏𝝅𝒙
𝒂𝒏 = ∫ 𝒇(𝒙) 𝐜𝐨𝐬 𝒅𝒙
𝒄 −𝒄 𝒄
𝟏 𝒄 𝒏𝝅𝒙
𝒃𝒏 = ∫ 𝒇(𝒙) 𝐬𝐢𝐧 𝒅𝒙
𝒄 −𝒄 𝒄

* For inquiries, comments and suggestions, please contact UST ACES Academics
Committee at [email protected].

14 Booklet for Aspiring Engineering Students