2020-21

MALLA REDDY ENGINEERING COLLEGE B.Tech.

Onwards
(Autonomous) I Semester
(MR-20)
Code:A0B01 Linear Algebra and Numerical Methods L T P
Credits: 4 (Common for CSE & IT) 3 1 -

Prerequisites: Matrices, Differentiation and Integration.

Course Objectives:
1. To learn types of matrices, Concept of rank of a matrix and applying the concept of rank
to know the consistency of linear equations and to find all possible solutions, if exist.
2. To learn concept of Eigen values and Eigen vectors of a matrix, diagonalization of a
matrix, Cayley Hamilton theorem and reduce a quadratic form into a canonical form
through a linear transformation.
3. To learn various methods to find roots of an equation.
4. To learn Concept of finite differences and to estimate the value for the given data using
interpolation.
5. To learn Solving ordinary differential equations and evaluation of integrals using
numerical techniques.

MODULE I: Matrix algebra [12 Periods]

Vector Space, basis, linear dependence and independence (Only Definitions)
Matrices: Types of Matrices, Symmetric; Hermitian; Skew-symmetric; Skew- Hermitian;
orthogonal matrices; Unitary Matrices; Rank of a matrix by Echelon form and Normal form,
Inverse of Non-singular matrices by Gauss-Jordan method; solving system of Homogeneous and
Non-Homogeneous linear equations, LU – Decomposition Method.

MODULE II: Eigen Values and Eigen Vectors [12 Periods]

Eigen values , Eigen vectors and their properties; Diagonalization of a matrix; Cayley-Hamilton
Theorem (without proof); Finding inverse and power of a matrix by Cayley-Hamilton Theorem;
Singular Value Decomposition.
Quadratic forms: Nature, rank, index and signature of the Quadratic Form, Linear
Transformation and Orthogonal Transformation, Reduction of Quadratic form to canonical forms
by Orthogonal Transformation Method.

MODULE III: Algebraic &Transcendental equations [12 Periods]

(A) Solution of Algebraic and Transcendental Equations: Introduction-Errors, types of
errors. Bisection Method, Method of False Position, Newton-Raphson Method.
 (B) The Iteration Method ,Ramanujan’s method to find smallest root of Equation. Jacobi’s
Iteration method. Gauss seidel Iteration method.

MODULE IV: Interpolation [12 Periods]

Introduction- Errors in Polynomial Interpolation – Finite differences- Forward Differences-
Backward differences-Central differences - Symbolic relations and separation of symbols.
Differences of a polynomial-Newton’s formulae for interpolation; Central difference
interpolation Formulae – Gauss Central Difference Formulae ; Interpolation with unevenly
spaced points-Lagrange’s Interpolation formula.

MODULE V: Numerical solution of Ordinary Differential Equations and Numerical

Integration [12 Periods]
Numerical solution of Ordinary Differential Equations :Introduction-Solution of Ordinary
Differential Equation by Taylor’s series method - Picard’s Method of successive Approximations
- Euler’s Method-Modified Euler’s Method – Runge-Kutta Methods.

Numerical Integration: Trapezoidal Rule, Simpson’s 1/3rd Rule, Simpson’s 3/8 Rule.

TEXT BOOKS
1. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition, 2010.
2. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,
2006.
3. D. Poole, Linear Algebra: A Modern Introduction, 2nd Edition, Brooks/Cole, 2005.
4. M . K Jain, S R K Iyengar, R.K Jain, Numerical Methods for Scientific and Engineering
Computation, New age International publishers.
5. S.S.Sastry, Introductory Methods of Numerical Analysis,5 th Edition,PHI Learning Private
Limited.

REFERENCES
1. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9th Edition, Pearson,
Reprint,2002.
2. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi
Publications,
Reprint, 2008.
3. V. Krishnamurthy, V.P. Mainra and J.L. Arora, An introduction to Linear Algebra,
AffiliatedEast–West press, Reprint 2005.
 4. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11th
Reprint,2010.

E – RESOURCES
1. https://www.youtube.com/watch?v=sSjB7ccnM_I (Matrices – System of linear
Equations)
2. https://www.youtube.com/watch?v=h5urBuE4Xhg (Eigen values and Eigen vectors)
3. https://www.youtube.com/watch?v=9y_HcckJ96o (Quadratic forms)
4. https://www.youtube.com/watch?v=3j0c_FhOt5U (Bisection Method)
5. https://www.youtube.com/watch?v=6vs-pymcsqk (Regula Falsi Method and Newton
Raphson Method )
6. https://www.youtube.com/watch?v=1pJYZX-tgi0 (Interpolation)
7. https://www.youtube.com/watch?v=Atv3IsQsak8&pbjreload=101 (Numerical Solution
of ODE)
8. https://www.youtube.com/watch?v=iviiGB5vxLA (Numerical Integration)

NPTEL
1. https://www.youtube.com/watch?v=NEpvTe3pFIk&list=PLLy_2iUCG87BLKl8eISe4fH
KdE2_j2B_T&index=5 (Matrices – System of linear Equations)
2. https://www.youtube.com/watch?v=wrSJ5re0TAw (Eigen values and Eigen vectors)
3. https://www.youtube.com/watch?v=yuE86XeGhEA (Quadratic forms)
4. https://www.youtube.com/watch?v=WbmLBRbp0zA (Bisection Method)
5. https://www.youtube.com/watch?v=0K6olBTdcSs (Regula Falsi and Newton Raphson
Method)
6. https://www.youtube.com/watch?v=KSFnfUYcxoI (Interpolation)
7. https://www.youtube.com/watch?v=QugqSa3Gl-w&t=2254s (Numerical Solution of
ODE)
8. https://www.youtube.com/watch?v=NihKCpjx2_0&list=PLbMVogVj5nJRILpJJO7KrZa
8Ttj4_ZAgl
(Numerical Solution of ODE)
9. https://www.youtube.com/watch?v=hizXlwJO1Ck (Numerical Integration)
Course Outcomes:
1. The student will be able to find rank of a matrix and analyze solutions of system of linear
equations.
2. The student will be able to find Eigen values and Eigen vectors of a matrix,
diagonalization a matrix, verification of Cayley Hamilton theorem and reduce a quadratic
form into a canonical form through a linear transformation.
3. The student will be able to find the root of a given equation by various methods.
4. The student will be able to estimate the value for the given data using interpolation.
5. The student will be able to find the numerical solutions for a given ODE’s and
evaluations of integrals using numerical techniques.

CO- PO Mapping

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs)
COS PO PO PO PO PO PO PO PO PO PO PO PO
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 2 2 3 3 2 1
CO2 2 2 2 3 2 2 1
CO3 2 2 2 3 2 2 1
CO4 3 2 2 3 3 2 2
CO5 2 2 2 3 3 2 2
MODULE -I

MATRIX
ALGEBRA
Diteaentes od a lonomial (13
Keult 1 f) is a polynomial o deqsee n and the valuey ot 7 ale.

Hen &fa) tonstant

equally spaced is a

Let t()= ao +a, +a, +On t On

Wese ag, a, g, a n ate. Con stants and a, ¢0.
h i s the step lengtk , le now Had At1)= t(1+h) - f(1)

f()- a, (14)" + a, (1+) +n7+h) +Cn

3-
+OnH

a. nh . - }-*|
21

+ [ 4 n-) -m- - . } - 4
= onh"+ h +by . . + bh-s t bn-2

thee b, bg. bn- ale Constants Heae H4 polynomialis ot

desee (n-)
e bizst dibberente ob pelynomial o nh despee Is a polyno
Thus, a

mial o despee (n-).

=
aSa, nh +be + by * .bn +
bn-
lo, nh (x+h)"+4h + ) a + h . + bn1h) 4 bn-t

a, nh 4b a b + bn- t bn-t
tenlzt4)-
 Cn- le (onstans. This polynonial is ob depee(n-9)
W (3, (4 Cn-3

Thus, He setend dibtetence ob a

polynomial ob degsee n is a
polynomie
(1
ob depec (n-e)Centinuing lite i s we et. dtea).
lonshant
AF= a, n(n-)(n-) . 1 . 1 a, Kni) Which is a

Hence te seult

Notc(i) As Af(1) is a Constrant, it tollows hat Af(a) =0 "

,
The (onvesse o akve vesult is also töua That 1s, ib A t(a) is
(i
Constont, Hen te.
egually spaced Intevals and is a
taulate at

tuncion t() is a polynomial ob desoee n.

evaluae
1 ae specibied with step length h,
te values ob
t 0-1) (t-11) (1+3) &(-)t-ext)Ct- 3)(1-4).
so) e t #) U-7(t-21)(r+31) =

ob *
with b H Co ebbi cien
lhich 1s a polynomial desgee 3 as

I t 1 ) is a polynomial ob dessee n, a, is co ekbicient ob " Then

Af)= a, k'n! Whee h is he step length

t i ) - 0-)0-1s)(431]= &KBI) =34

(in) Let f(1) = (-1) (1-27) (1-37) (1-41
with )-2)(-3)(-4) =24 as he
Ihich is a polynomial ob desoee jo

coticient o b .
(1-4)= 24 '(o1)
t: AT6-1)(t-14)(1-31)
 i d Ile second diselence ob He polynomial f(a) = -12x'+n2*-r
wh int etvalot di4iewncingh:2 (15
Sol Iet 47): 1 9 4tr-%d 49
e Hos Af(x) = f(1+h) -f(7)
nu
f(42) f(7) h 2
A f1)
127 4417*-3414S
At)\(z+2)- I2 (a+) + (1+1 3of1 +2)-+|-
49

= S- 4 8x +56+28
second dibhesence t1) = AAfa)]

A[8- 48z5ta + 2s

8 (+t 48(14 4 56(14 2) 49 8487 45ba4+ 18

48-q1 -16
4He intesval ot dibtcaencinq is unity, pavve ha f)-f4)

le now has Ata)= f(14h)

-
t(a)

A f1)= fl1+)-fi) h=

fl1+1) Pra)
t'a)-t/1+1)

f/1t) t1)

fa41)-t)

fla+)t/1)

At()

I1+1) 1a)
 oh diteencing is unity, pavve ttat a 2-3)
1 intetval 7+)!
so Let t)=
le kave AtI1)=f(1th) f )
Af1) f(1+1) -f(1)

2+

ta+) 1

a(1-2
(+)

Pove Had alogf)= l9t fa)

now t h a AP()= #(1+h)t11)
Sd We

logf) lg+1+4) - 469t/1)

4/1+h)- b a ) + A
#)
log (1)
P(1)

Af/

Evaluade Al1+cos1)
3+ losx
Here t ) =
He have Ata)=f(7t) n )
At/1)=A(1+6)= a+h+asa+h) -a+los
h+ Cos(1th)-Cos
 vve od E 7 A = VE

Sol le knou thas At(1)= 4(1+)-41) f ) = f(1) - t(1-h)

(E)H) F v41») = Ef) 4(a-) E f1) fl1th)

Efa)- E fi1-h) fa)= t/1-)

4 (7+h) - t/1)
Afl1)

E A
E)t1)
=#11th) tn)
Af1)
VE A.

EV= A= VE

Pouve hSE A.

+h

SE Aul
S SE A
Ove +had hD =
log(I+a) =
-log(-A = Sin hug)
le now Hot

Taring lo qaaithm oth sldes, we get

log loq(1tA)
hploge log(1tA)
hD loj(1+0)
 We have 1-E E-1-V.

Taplng lonsit hn hothsldes, ne ge

loqe loq(1-

hD log loge
hD -log(1-)

SinhD

SnhD S
hD sius)
Proove t h

So

I+F

=4+E

4
-E
-6

Frovn ond
 'opve ad 1
s )

'oove hat -8

le Know +od
2

Poove ad S = AE+ A.
EE A = E-1.
hle kave =

Poove thad A =S

s le have = E -I, S= ELE

48 + +

E-
 Paove ha VA = =

1-E) (t-) V: 1-E

A F-/
=E+E2
S= E

S
A- = (E-1)-(1-É)

= E+E-i

Povve t h + A 1 - ) = 1.

So e have

(tA)1-) = Ell-9
FlI-1-E)
EE

=.
Poove thot S A+)
S= E A=E-l, V=1-E'
So We have u- E),
(+= (E-1+1-E
le-E)
So By debinition
1)
(9%)
9ha)
(%-h)-(h Ya-t)

We have

n2 +n

1his he step length, pove thod A1-). A9(1-4) t).AYo

At1-4). AJ1-4)= A|P(7-4) (9(7)-9h+]]
att-)sc))- altin-) g1-4)}
f(a-4) Aga) + 901+h) Af(1-)
-t(1-h) Ag4) - 9l1) Af(1-A1
 = f'h-) 9(ath)- 901)+ 9(1th) Pta) - fn-4)}
(22
f - 4 ) ) - 901-4)] - 91) tr1)-t/1-4)

f/1) 9/1+)-10)) 4 #i7-4) |9/1-4)-1()

4(2) Aga) + #(1-4) Ag(1-h) .

ta). agt)
Sine fn) ogm)= vfn).(3/1+h)-91)

n)9(1+1)) - vt()t )

#ta9)-H1-1)-
) g1+h) -+/1-1)3(
401) g/1+h) - 9/1)# (1-4) ]g(-A) -910
ti1-) ag/1-)
Fl1). Ag/1) 4(1) Agn) +

at
te valus o a ale equally spaced, pavve

(A )f(1) =
A H1)
v£l1) = #11)-fl1-A).
le ave tM)=+/1+h) ) ,

A9t2)= est)
= A 0 -Pl-4)|
Af) Afl1-*)
= f1)-t0- +/1-4)
t ) #1)
) t/1)
A= A- V.
 bove a E-2F+1 . 23

We lenow Hat afa) = f (1+6)- f(a). E'tla)fl14nh)

fl1+h) - af(1)
P(1+24)-4i14 t(7th)-fIH)
=4(1t 2A) 2f(1t h)+ fla)
-

Eia)-2E 4) + a)
tr)=E1E +1)t1)
E-LEH
frove tHa E = EA

Em)= f(1+nk)
S We kno had At(1) #ia+h) -t1),

t 2 h ) f(a+hA)

EAt1) E[et)
EFta4s))
= Ef(1th)-Ef(a)
f(1+2A) -f(1+h)

AEtIT)= EA1)
AE = EA

atn)= #(1+h)-f1), et()= fla+nh), v#/1) =t/0f(1-k)

le have

AFfra) aEr]= Af(1-) = f(1) -f(1-h) =<ta)

 E4I1t4)- étr1)
f(1)-f(1-4)

t)

Deduce +had
Findtu i ) 1) et) .

So le now thad atn) #(1+A)-f(1), Etn)= 4(1+nh)

A= E-

EFa) ee-40)= E-2E#r)

E +E-2) #1«)
E41) + Ett) - 2441)

fH1+k) + t/1-4)-2t/7)
Find At/)
Etta)
Stl We know tho Afa) =
P(1th) -tn), EP(1) #(14nh)
=

) E - a ) E E+)4h)fa+ek) -2tm+A)+t/7)
Efl) ft1+h)
dou +ae f)= e In e above esulEs, we qe

Ee th
(+h
( t h 2d+24)lA+h) ACa+2h, atha)
)1 th athea
-=
 Povve +Lad

le kave AE1, V-1-E

= (E-4 =lE-se +3E-)4

E 3E t 1E,
34+ 3%

foove thad (EE)l1+a)= 2+A

Sol We kave A E-

E + E ) a = ((EV)E
E

Et+l

2+E-

2+A
Constont and
whick 14th dibteenCe. is
15 is a polyno nial os
Y += lo88 tind y
bind
t+% = 686,
+9, =-784,
o , We note thad g,
S Stasing it y inst ead .

We have A E-

, =s (E-y, =o =» (E-6E+ISE-20 E+1SE4E+1)y, =o

EyE, +15 Ey -20E1 +15E -6E +9, =

-% +15-20+15h- +%
+9-) 6(% +) +15( +) -20y D
y (,+,) -t(9, +1) +15(%+"%)
-78y -6 l6s6) +15 (t088)= 571
 1nd
3 =2, = S1, 9 = 2a0, y =loD ond 8
iveno
s le naw Ihat E 14 A

(ESsE+ 10 E-1OE+6E-)%

S4+1010, t 59,-Jo
Sod + 2oTd -810 +60-3
8
= 153

tind ygivenHat e encal

4 S, Y =l, Y 22, - o, = 40

tin is sepsesented hy a toust despea polynorn ial .

so le Know +Hhos E =

Since is sepsesented by a 4 despee polynomial, e hove h - o

ESSE 10E-10E+ sE-1)Yn =o

Ey-E +10E10E+SEh
Take n =o

e-SEy +10E10Ey, +SE-

=o

- 5 t+ 10 -10y, +5, -% .
HO S9 +4o-220+ SS-S =D

Syy310
9474
 ove Ha

=(al-E) ot-)4ra)

AE-v) fa)
E-
E-)E-(E))
E
E- )
E-

A E-1, =- E
t/1) A+ 9 =
E- t

A+

h =1
Evaluadt E'A)? +aring
So ChivenHta +(1)=, hs
know tha Ata) r f(1th) -Ha)
We
Ata) P(a+1) t a )

A 1+3x+17- -1
A 3 +31+1
D)E(3+34+1)
We PnadHas Etra) = tl1-k
3(1-+3/2-1)+1
31+3141
T1h: is the shep lonatk, pavve +kod
nn-1) u-4 4

tlng u 11), we
qet

f-) + +-) fh-n).

f11)- nfna) 4 21
le now thas E 4/1)= 4/1-nh)
E4ra).
) - nE()+ on- n ) + +

nf in) . . Ce"}t) +

(1-)r1)

trn) Eern)

ra)= ft1-nk), h:)

U-n.