MATHEMATICS-II FOR ELECTRICAL

ENGINEERING STREAMS ATME COLLEGE OF ENGINEERING

(BMATE201) DEPARTMENT OF MATHEMATICS

<Dept. Name> <Faculty Name>

Course objectives:
• The goal of the course Mathematics-II for Electrical engineering
streams(BMATE201) is to
• · Familiarize the importance of Integral calculus and Vector calculus
essential for Mechanical engineering.
• · Analyze Mechanical engineering problems applying Partial
Differential Equations.
• · Develop the knowledge of solving Mechanical engineering problems
numerically

<Dept. Name> <Faculty Name>

Course outcome (Course Skill Set)
After successfully completing the course, the student will have a good understanding
of the following topics and their applications:
• CO1: Understand the applications of vector calculus refer to solenoidal, ir-rotational
vectors, line integral and surface integral.
• CO2: Demonstrate the idea of Linear dependence and independence of sets in the
vector space, and linear transformation
• CO3: To understand the concept of Laplace transform and to solve initial value
problems.
• CO4: Apply the knowledge numerical methods in solving physical and engineering
phenomena.
• C05: Get familiarize with modern mathematical tools namely
Mathematica/MatLab/Python/Scilab
<Dept. Name> <Faculty Name>
CONTENTS

• Module-1:Vector Calculus

• Module-2:Vector Space and Linear Transformations

• Module-3:Laplace Transforms

• Module-4: Numerical methods -1

• Module-5: Numerical methods -2

<Dept. Name> <Faculty Name>

Module-1: Vector Calculus

• Vector Differentiation: Scalar and vector fields. Gradient, directional

derivative.
• curl and divergence - physical interpretation, solenoidal and
irrotational vector fields. Problems.
• Vector Integration: Line integrals, Surface integrals.
• Applications to work done by a force and flux.
• Statement of Green’s theorem and Stoke’s theorem-Problems.
Self-study: Volume integral and Gauss divergence theorem.

<Dept. Name> <Faculty Name>

VECTOR CALCULUS

Vector calculus is a field of mathematics concerned with multivariate real analysis of

vectors in two or more dimensions. It consists of set of problems solving techniques very
useful for engineering and physics.

SCALAR AND VECTOR POINT FUNCTIONS

Let be a ‘Vector function’. Then for various values of we get a set of constant vectors.
Let be a ‘Scalar function’. Then for various values of we get a set of points or scalars.
Vector operation is defined by the equation

<Dept. Name> <Faculty Name>

 This operator has a great role in vector calculus. Laplacian operator is defined as follows

Gradient
The vector function is defined as the gradient of the scalar function

Geometrically, represents a normal at any point P to the surface

and has a magnitude equal to the rate of change of
along this normal. is a vector quantity.

<Dept. Name> <Faculty Name>

Note:
1. The unit normal vector along is given by or

2. The component of in the direction of a unit vector is and is called the

directional derivative of in the direction of . Thus, the directional derivative is
maximum in the direction and the magnitude of this maximum is equal to .
where

Problems
1. Find the unit normal vector to the surface at .
Sol: Let

<Dept. Name> <Faculty Name>

Now,

At

The unit normal vector ,

<Dept. Name> <Faculty Name>

2. Find the directional derivative of the function at along

Sol: Given Let

Now,

At

<Dept. Name> <Faculty Name>

Also,

^
𝑫 . 𝑫 =𝜵 𝒇 . 𝒏
<Dept. Name> <Faculty Name>
<Dept. Name> <Faculty Name>
3. Find the angle between the surfaces or normal surfaces and
at .

Sol: Given

Wkt,

<Dept. Name> <Faculty Name>

At

Also

At

<Dept. Name> <Faculty Name>

Angle between surface,

<Dept. Name> <Faculty Name>

 16+ 4 − 4 16
𝑐𝑜𝑠 𝜃 = =
6 √ 21 6 √ 21

𝜽=𝒄𝒐𝒔
<Dept. Name>
−𝟏
( 𝟖
𝟑 √ 𝟐𝟏
<Faculty Name>
)
Divergence of a vector function
The divergence of a vector function , where are functions of .It is denoted by and is
defined as

Clearly is a scalar quantity.

Physical interpretation of Divergence
Let us consider the motion of the fluid. Consider a small rectangular parallelepiped with
edges parallel to the axes in the mass of fluid.

<Dept. Name> <Faculty Name>

 Let be the velocity of the fluid at .

Amount of the fluid flowing in through the face ABCD per unit time

Amount of the fluid flowing out through the face PQRS per unit time

The net decrease in the amount of fluid across these two faces is

<Dept. Name> <Faculty Name>

Similarly, the decrease in amount of fluid due to flow along the

The decrease in amount of fluid due to flow along the

Total decrease in amount of fluid inside the parallelepiped per unit time

Hence the ratio of loss of fluid per unit volume

<Dept. Name> <Faculty Name>

 Hence gives the rate of outflow per unit volume at a point of the fluid. If everywhere in
some region of space, then is called Solenoidal Vector function and the fluids said to be
incompressible i.e., there is no gain or loss in the volume element

Curl of a vector function

The curl of a vector function is denoted by and is defined as

Clearly is a vector quantity.

<Dept. Name> <Faculty Name>
Physical interpretation of Curl
Consider a rigid body rotating about a fixed axis through origin. Let the uniform angular
velocity be , , , are constants. The velocity of any point on the body is given by , where
is the position vector of P.

Let and

Consider

<Dept. Name> <Faculty Name>

𝑐𝑢𝑟𝑙 ⃗ ⃗
𝑉 =𝛻 𝑋 𝑉

<Dept. Name> <Faculty Name>

 Thus the angular velocity of rotation at any point is equal to half of the curl of the
velocity.
Note:
1. If , then we say that is Solenoidal vector.
2. If , then we say that is irrotational vector.
3. Irrotational vector field is called as conservative field or potential field.
4. When is irrotational there always exist a scalar point function such that , then
is called a scalar potential of vector .

<Dept. Name> <Faculty Name>

Problems
1. If , find the and at
Sol: Given
Wkt

At

14

<Dept. Name> <Faculty Name>

Also,

At (2,-1,1)

<Dept. Name> <Faculty Name>

2. Find and where .
Sol: Let

Now,
)+(+

<Dept. Name> <Faculty Name>

𝑐𝑢𝑟𝑙 ⃗
𝐹 =𝛻 𝑋 ⃗
𝐹

<Dept. Name> <Faculty Name>

3. Show that is both solenoidal and irrotational.

Sol: Given
Wkt,
+

is Solenoidal.

<Dept. Name> <Faculty Name>

Now,

is irrotational.

<Dept. Name> <Faculty Name>

4. P.T is irrotational. Also find a scalar point function
such that
Sol: Given

<Dept. Name> <Faculty Name>

 ⃗ ⃗
𝒄𝒖𝒓𝒍 𝑭 = 𝟎
To find
Consider

Integrating we get

<Dept. Name> <Faculty Name>

 ⃗ ⃗
𝒄𝒖𝒓𝒍 𝑭 = 𝟎
To find
Consider

Integrating we get

<Dept. Name> <Faculty Name>

 ⃗ ⃗
𝒄𝒖𝒓𝒍 𝑭 = 𝟎
To find
Consider

Integrating we get

, where , ,

<Dept. Name> <Faculty Name>

Module-2 Vector Space and Linear Transformation
• What is a vector? Many are familiar with the concept of a vector as:
• Something which has magnitude and direction.
• an ordered pair or triple.
• a description for quantities such as Force, velocity and acceleration.
• Such vectors belong to the foundation vector space - - of all vector
spaces. The properties of general vector spaces are based on the
properties of Rn. It is therefore helpful to consider briefly the nature
of

<Dept. Name> <Faculty Name>

Definitions
• Two vectors u = (u1, u2, . . . , un) and v = (v1, v2, . . . , vn) in Rn are
called equal If u1 = v1, u2 = v2, . . . , un =
• The sum u + v is defined by u + v = (u1 + v1, u2 + v2, . . . , un + vn)
Let k be any scalar, then the scalar multiple ku is defined by
• ku = (ku1, ku2, . . . , kun)
• These two operations of addition and scalar multiplication are called
the standard operations on Rn.
• The zero vector in is denoted by 0 and is defined to be the vector
0 = (0, 0, . . . , 0)

<Dept. Name> <Faculty Name>

• The negative (or additive inverse) of u is denoted by -u and is defined
by
−u = (−u1,−u2, . . . ,−un)
• The difference of vectors in Rn is defined by v − u = v + (−u)
• The most important arithmetic properties of addition and scalar
multiplication of vectors in Rn are listed in the following theorem. This
theorem enables us to manipulate vectors in Rn without expressing
the vectors in terms of components.

<Dept. Name> <Faculty Name>

• Linear Combinations of Vectors and Systems of Linear
Equations
Have m linear equations in n variables:
a11x1 + a12x2 + · · · + a1nxn = b1
a21x1 + a22x2 + · · · + a2nxn = b2
...
am1x1 + am2x2 + · · · + amnxn = bm
Write in matrix form: Ax = b.
A = [aij ] is the m × n coefficient matrix.

<Dept. Name> <Faculty Name>

• Linear combinations Definitions
A vector w is called a linear combination of the vectors v1, v2, . . . , vr if it can be
expressed in the form w = k1v1 + k2v2 + · · · + krvr
where k1, k2, . . . , kr are scalars.
• Example : Consider the vectors u = (1, 2,−1) and v = (6, 4, 2) in R3. Show that w = (9, 2, 7) is a
linear combination of u and v and that = (4,−1, 8) is not a linear combination of u and v.
• Spanning
If S = {v1, v2, . . . , vr} is a set of vectors in a vector space V , then the
subspace
W of V consisting of all linear combinations of the vectors in S is called the
space spanned by v1, v2, . . . , vr, and it is said that the vectors v1, v2, . . . , vr
span W. To indicate that W is the space spanned by the vectors in the set
S = {v1, v2, . . . , vr} the below notation is used.
W = span(S) or W = span{v1, v2, . . . , vr}

<Dept. Name> <Faculty Name>

Linear transformations: A linear transformation T : V1 V2 between two vector
spaces is a function preserving all of the algebra; that is, T(v+u) = T(v)+ T(u) for all
scalars , R and vectors v; u V1. V1 is called the domain of T and V2 is called the
codomain of T.
A linear transformation T : V1 V2 is onto if for each u V2 there is at least one v V1
such that u = T(v). Formal differentiation is an onto linear transformation.
A linear transformation T : V1 V2 is an isomorphism if it is one to one and onto.
When T is an isomorphism, we say V1 and V2 are isomorphic vector spaces and we
write V1 V2.
If T : V1 V2 is an isomorphism then for any u V2 there is exactly one v V1 such that
u = T(v). Thus, we can define a function : V1 V2 by taking (u) to be the unique v V1
such that u = T(v). is linear whenever T is linear and is an isomorphism of vector
spaces whenever T is an isomorphism.

<Dept. Name> <Faculty Name>

• Null space.
(a) The Kernel or Null Space of a linear transformation T : V1 V2 is Nul(T) = {u/0= T(u)}
(b) Nul(T) is a subspace of V1.
(c) When T is a matrix transformation, row reducing the augmented matrix [T|0] to
reduced echelon form produces a vector equation describing Nul(T). We call this equation
the kernel equation of the matrix. It provides us with a basis of Nul(T) (see ”basis” below).
• Linearly Independence :A subset B of a vector space is linearly independent if any finite
linear combination + ::: + = 0 of elements ,…… B implies 1 = 0,..., n = 0.
• Basis: (a) A basis of a vector space V is a set of linearly independent vectors spanning V .
• (b) {……. } is a basis of Rn. It is called the standard basis of Rn.
• (c) The set of vectors {, ……} is a basis of . It is the standard basis of .
• THEOREM: If {……. } is a basis of a vector space and if v is any vector in the space then
there is exactly one set {……. } of scalars such that v = ++…………..
• If any vector not in a basis is added to the basis then the resulting set is not a basis .

<Dept. Name> <Faculty Name>

• If V has a basis = {v1, v2} and T : V V is a linear
transformation given By T(v1) = 2v1 + 3v2, T(v2) = −7v1 +
8v2
• To find T T(−v1 + 3v2) takes two steps as shown below.
T(−v1 + 3v2) = −T(v1) + 3T(v2)
= −2v1 − 3v2 + 3(−7v1 + 8v2)
= −23v1 + 21v2
Hence T(−v1 + 3v2) = T(−23v1 + 21v2)
= −23T(v1) + 21T(v2)
= −23(2v1 + 3v2) + 21(−7v1 + 8v2)
= −193v1 + 99v2
<Dept. Name> <Faculty Name>
 MODULE -
3
LAPLACE
TRANSFO
RMS

Mathematics
<Dept. Name> <Faculty Name>
TOPICS
1. Laplace Transform:
Definition and Laplace
transforms of
elementary functions
(statements only). 2. Inverse Laplace
Laplace transforms of Transform: Definition
Periodic functions & problems,
(statement only) and Convolution theorem
unit-step function – to find the inverse
problems . Laplace
Transforms(without
Proof) and Problems .

3. Solution of linear
differential equations
using Laplace
Transforms.
Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 Mathematics
<Dept. Name> <Faculty Name>
 To solve the problem
OTHER APPLICATIONS related to communication
and network analysis.
4
To find moment To make a equation in
generating function in 2 5 simple form from hard
statistics equation like vibration
of spring

To determine 1 6 To solve mixing

structure of problem involving two
astronomical object tanks.
from spectrum

Mathematics
<Dept. Name> <Faculty Name>
Module-4: Numerical Methods-1
• Solution of polynomial and transcendental equations: Regula-Falsi and
Newton-Raphson methods (only formulae).
• Finite differences, Interpolation using Newton’s forward and backward
difference formulae.
• Newton’s divided difference formula and Lagrange’s interpolation
formula.
• Numerical integration: Simpson's (1/3)rd and (3/8)th rules(without
proof)-Problems.
Self-study: Bisection method, Lagrange’s inverse Interpolation,
Weddle's rule.
<Dept. Name> <Faculty Name>
Numerical Methods
Numerical method provide various technique to find approximate solution to
different problem using simple operation.
Numerical Solution of Polynomial and Transcendental Equations
Given an equation it is generally not possible to find roots such that becomes
zero exactly. We discuss two numerical methods for the solution of algebraic and
transcendental equation.
Equation involving algebraic quantity like ,, ,… are called algebraic equation.
Eg: ,
Equation involving non algebraic quantity like are called transcendental
equation.
Eg: , ,
<Dept. Name> <Faculty Name>
 Numerical methods are often a repetitive nature. This consist repeated execution of the
same process where at each step to result of the previous step is used. This is known as
iterative process.

We discuss two numerical methods

1. Regula-Falsi method
2. Newton-Raphson method
Regula-Falsi method (or) Method of False position
Formula:

<Dept. Name> <Faculty Name>

Problems
1. Using the method of false position find the real root correct to 3 decimal places
of the equation
Sol: Given

The root lies between

Wkt,

<Dept. Name> <Faculty Name>

Step-1: 2

The root lies between

Step-2: 2

<Dept. Name> <Faculty Name>

The root lies between
Step-3: 2

The root lies between

<Dept. Name> <Faculty Name>
Step-4: 2

The root lies between

Step-5: 2

The real root is 1.510

<Dept. Name> <Faculty Name>
Newton-Raphson Method
Formula:
; ,
, ;
, ; and so on.
Problems
1. Use NR method to find the real root of the equation , correct to 3
decimal places.
Sol: Given

<Dept. Name> <Faculty Name>

The root lies between .
Since lies nearer to 0.
Let
We know that
Here

Step 1:

<Dept. Name> <Faculty Name>

Step 2:

Step 3:

<Dept. Name> <Faculty Name>

Step 4:

The real root is .

<Dept. Name> <Faculty Name>

FINITE DIFFERENCES
Newton’s Forward interpolation formula (NFIF)
The value of at is approximately given by

Where, is any real number , ; is step length.

Newton’s Backward interpolation formula (NBIF)
The value of at is approximately given by

Where, is any real number , ; is step length.

<Dept. Name> <Faculty Name>

1. The population of a town is given by the following data
Year 1971 1981 1991 2001 2011
Population 19.96 39.65 58.81 77.18 94.58
( in thousand )

Using appropriate interpolation formula calculate the increase in the population from the year
1975 to 2005.
Sol: a)To find
Here ,

<Dept. Name> <Faculty Name>

 1971

1981 39.65

1991 58.81

2001 77.18

2011 .58

<Dept. Name> <Faculty Name>

By NFIF,

Thus,
b) To find
Here ,

<Dept. Name> <Faculty Name>

By NBIF,

Thus,
The increase in population from the year 1975 to 2005

( in thousands )

<Dept. Name> <Faculty Name>

Interpolation formula for unequal intervals
Newton’s Divided Difference Formula or Newton’s general interpolation formula
If …, be a set of values of an unknown function corresponding to the values , , ,…, at
unequal intervals, then

Here ; ;

<Dept. Name> <Faculty Name>

Problems
1. Use NDDF to find , given that
40 42 44 45
43833 46568 49431 50912

Sol:

<Dept. Name> <Faculty Name>

By NDDF,

Thus,

<Dept. Name> <Faculty Name>

Lagrange’s formula for interpolation
If …, be a set of values of an unknown function corresponding to the values , , ,
…, not necessarily at equal intervals, then

Lagrange’s inverse interpolation formula for is

<Dept. Name> <Faculty Name>

Problems
1. Apply Lagrange’s interpolation formula to find from the following data
2 5 8 14
94.8 87.9 81.3 68.7

Sol: Given

To find ⇒
Wkt

<Dept. Name> <Faculty Name>

2. Fit an interpolating polynomial for the following data
0 1 2 5
2 3 12 147

Sol: Given

Wkt

<Dept. Name> <Faculty Name>

Wkt

, is the required polynomial.

<Dept. Name> <Faculty Name>

Numerical Integration
The process of obtaining approximate value of the definite integration without actually
integrating function but only using the value of at some point of is equally placed over .
Simpson’s rule
Formula:

Where,
Note: To apply rule must be multiple of 2.

<Dept. Name> <Faculty Name>

Problems
1. Evaluate dividing the interval in 6 equal parts (7 ordinate) by applying
Simpson’s rule.
Sol: Given , ,
Now,

0 1 2 3 4 5 6

0 3 12 27 48 75 108

<Dept. Name> <Faculty Name>

Wkt,

<Dept. Name> <Faculty Name>

Simpson’s rule
Formula:

Where,
Note: To apply rule must be multiple of 3.

<Dept. Name> <Faculty Name>

Problems
1. Evaluate by taking 7 ordinate using Simpson’s rule. Hence deduce the value of
log2.
Sol: Given , ,
Now, ,

0 1

1 0.8571 0.75 0.6667 0.6 0.5455 0.5

<Dept. Name> <Faculty Name>

Wkt,

By integration,

<Dept. Name> <Faculty Name>

Module-5: Numerical Methods-2
Numerical solution of ordinary differential equations of first order
and first degree
• Taylor’s series method.
• Modified Euler’s method.
• Runge-Kutta method of fourth-order.
• Milne’s predictor-corrector formula.
Self-studyAdam-Bashforth method.

<Dept. Name> <Faculty Name>

Numerical solution of ordinary differential equations of first order and first
degree
A numerical method can be used to get an accurate approximate solution to a
differential equation. There are many programs and packages available for solving
these differential equations. With today's computer, an accurate solution can be
obtained rapidly. In this chapter we focus on basic numerical methods for solving
initial value problems.
Analytical methods, when available, generally enable to find the value of y for all
values of x. Numerical methods, on the other hand, lead to the values of
y corresponding only to some finite set of values of x. That is the solution is obtained
as a table of values, rather than as continuous function. Moreover, analytical solution,
if it can be found, is exact, whereas a numerical solution inevitably involves an error
which should be small but may, if it is not controlled, swamp the true solution.
Therefore we must be concerned with two aspects of numerical solutions of ODEs:
both the method itself and its accuracy.
<Dept. Name> <Faculty Name>
The most general form of an ODE of first order and first degree is given by

Let x by an independent variable and y be dependent variable .

Let us consider the differential equation --(1)
If particular values are given to the constants then the resulting solution is
called a particular solution.
To obtain a particular solution from the general solution (1), we must be
given initial conditions so that the constants can be determined. If all the
initial conditions are specified at the same value of x then the problem is
termed as initial value problem. If the conditions are specified at more than
one value of x, then the problem is termed as boundary value problem.

<Dept. Name> <Faculty Name>

 Though there are many analytical methods for finding the solution of the equation
of the form (1), there exist large number of ODE’s whose solution cannot be obtained
by the known analytical methods. In such cases, we use numerical methods to get an
approximate solution of a given differential equation under the prescribed conditions
Consider the first order differential equation
Let y(x0), y(x1), y(x2), y(x3)..... y(xm) be the solution values at the points x 0, x1,
x2, x3,----- xm
We wish to find the approximate values y0 , y1, ........, ym to these solution
values.
Let the initial condition be y(x0 ) = y0 . Let the exact solution y(x) of the given
differential equation be represented by a continuous curve. Divide the interval
(Xo,Xm))on which the solution is derived into a finite number of equispaced
subintervals.
<Dept. Name> <Faculty Name>
 Approximate solution
Exact solution

For each xi, the approximate values of the dependent variable y(x) are calculated using a
suitable recursive formula. These values are y0, y1, ......, ym and these are shown by points.
Computation of these approximate values is known as Numerical solution of the Differential
equation.
<Dept. Name> <Faculty Name>
 An Initial Value Problem (IVP) consists of a differential equation and a
condition which the solution much satisfies (or several conditions referring to the
same value of x if the differential equation is of higher order).
--- (1)
The following methods are used to solve the IVP (1).
1. Taylor’s Series Method
2. Modified Euler’s Method
3. Runge - Kutta Method
4. Milne’s Method

<Dept. Name> <Faculty Name>

 Taylor’s Series Method
Let y=f(x) be a solution of the equation Expanding it by Taylor’s series about x - x 0
we get

1.Using the Taylor’s series method , find an approximate solution correct to four
decimals at x=0.1 for the IVP
Sol:

Differentiating w.r.t x we get

<Dept. Name> <Faculty Name>

Wkt,

Where =0.1 and we get

(0.1)=0.3487

<Dept. Name> <Faculty Name>

Modified Euler’s Method
Consider the IVP --- (1)
To determine the solution of this problem at bu using Euler’s method.
---(2)
The expression (2) gives an approximate value of y at . . To improve the
approximation the following formula has been suggested
---(3)
The method of computing using (3) is known as Modified Euler’s
method.

<Dept. Name> <Faculty Name>

The process of improving the approximation can be continued by obtaining
replacing until the desired degree of accuracy is obtained.
First approximation
Second approximation
Third approximation and so on.

1.Using the modified Euler’s method, solve the IVP at points x=0.5 and x=1
in steps of length h=0.5. Carry out two modifications at each step.
Sol:

<Dept. Name> <Faculty Name>

=
First modification

Second modification

<Dept. Name> <Faculty Name>

Next, to compute the solution
=
First modification

Second modification

The required solution are y(0.5)=1.3833 and y(1)=1.6118

<Dept. Name> <Faculty Name>

RUNGE- KUTTA METHOD (R-K METHOD)
Consider the IVP ---- (1)
To determine the solution of this problem at by using this method,
where h is step length
According to the Euler’s method , the solution at .
This can be rewritten as
Where

<Dept. Name> <Faculty Name>

 is an approximate solution for the equation (1) at x1 ,
known as Runge-Kutta method of order four.

1.Using RK method of fourth order , to find y(0.2), given that

Sol:
Given then

=(0.2

<Dept. Name> <Faculty Name>

<Dept. Name> <Faculty Name>
Wkt,

Milne’s Method:
The method in which the construction of yn involves the use of not only yn-1but also
predecessors are called multi step methods. In multi-step methods two formulas are
used in conjunction with each other- one for predicting the value of yn and the other
for correcting the predicted value of yn.

<Dept. Name> <Faculty Name>

Consider the IVP
Let y0=y(x0),y1=y(x1),y2=y(x2) and y3=y(x3) be these known solutions.
Suppose we wish to determine the solution of equation (1) at the point x4 = x3+h.
Let us denote the required solution by y4=y(x4).
First we predict the value of y4=y(x4) by using Milne’s predictor formula:
--- (2)

Next we correct the value of y4 by using the Milne’s corrector formula:

--- (3)

<Dept. Name> <Faculty Name>

1. Use Milne’s predictor –corrector method to find the value of y at x=0.8,
given
Where y(0)=0 , y(0.2)=0.02 , y(0.4)=0.0795 , y(0.6)=0.1762. Apply
x twice.
corrector formula Y

Sol: x0=0 y0=0

x1=0.2 y1=0.02

x2=0.4 y2=0.0795

x3=0.6 y3=0.1762

<Dept. Name> <Faculty Name>

Now , Milne’s Predictor formula yields the predicted value of y 4 as

Now , the Milne’s corrector formula gives a corrected value of y 4 as

<Dept. Name> <Faculty Name>

To apply corrector formula second time we must use corrector as predictor and
substitute in

Thus,

<Dept. Name> <Faculty Name>

 Thank You

<Dept. Name>
Faculty: <Faculty Name>