You are on page 1of 25

BISECTION METHOD

/*Bisection method */
#include<iostream.h>
#include<conio.h>
#include<math.h>
float f(float a)
{ float x=((a*a*a)-(4*a)-9);
return (x);
}
void main()
{ clrscr();
float a,b,m,ite,e,fa,fb,fm,k=0;
cout<<"\nEnter the vlue of a and b\n";
cin>>a>>b;
cout<<"Enter the maximum number of iteration\n";
cin>>ite;
cout<<"Enter Maximum error\n";
cin>>e;
fa=f(a);
fb=f(b);
if((fa*fb)>0)
cout<<"Entered set does not include root";

else
{
for(int i=1;i<ite;i++)
{ fa=f(a);
m=(a+b)/2;
fm=f(m);
if(fabs(fm)<e)
{ k++;
break;
}
else
{ if((fa*fm)<0)
b=m;
else
a=m;
}
cout<<"\n Value after "<<i<<" iteration "<<m;
}
}
if(k==0)
cout<<"Numer of iteration are not enough";
getch();
} 
NEWTON RAPHSON METHOD
/*Bisection method*/
#include<iostream.h>
#include<conio.h>
#include<math.h>
float f(float a)
{ float x=((a*a*a)-(4*a)-9);
return(x);
}
float fd(float a)
{ float x=((3*a*a)-4);
return(x);
}
void main()
{
clrscr();
float a,b,fx,fdx,e,itea,k=0;
cout<<"enter first value";
cin>>a;
cout<<"Enter the maximum number of iteration";
cin>>itea;
cout<<"Maximum acceptable error";
cin>>e;
for(int i=1;i<itea;i++)
{
fx=f(a);
fdx=fd(a);
b=(a)-(fx/fdx);
fx=f(b);
if(fabs(fx)<e)
{ k++;
break;
}
else
{ a=b;
}
cout<<"\n Value after "<<i<<" iteration "<<b;
}
if(k==0)
{
cout<<"Number of iteration is less than required";
}
getch();
} 
>> % PROGRAM TO PERFORM ALGEBRAIC ACTION OF MATRIX USING MATLAB.

By Vishal Kumar
09615603413
S-12

>> A). PROGRAM TO ADD TWO MATRICES.


>> % LET 1ST MATRIX BE:
>> X=[4 6 9 1;3 6 2 8;5 8 1 6;0 4 9 1]

X=

4 6 9 1
3 6 2 8
5 8 1 6
0 4 9 1

>> % LET 2ND MATRIX BE:


>> Y=[6 3 9 1;5 9 3 0;3 8 1 6;3 8 2 0]

Y=

6 3 9 1
5 9 3 0
3 8 1 6
3 8 2 0

>> % LET THEIR SUM BE:


>> Z=X+Y

Z=

10 9 18 2
8 15 5 8
8 16 2 12
3 12 11 1

>> % B). PROGRAM TO SUBSTRACT TWO MATRICES.

>> % LET 1ST MATRIX BE:


>> X=[4 6 9 1;3 6 2 8;5 8 1 6;0 4 9 1]

X=

4 6 9 1
3 6 2 8
5 8 1 6
0 4 9 1

>> % LET 2ND MATRIX BE:


>> Y=[6 3 9 1;5 9 3 0;3 8 1 6;3 8 2 0]

Y=

6 3 9 1
5 9 3 0
3 8 1 6
3 8 2 0

>> % LET THEIR DIFFERENCE BE:


>> P=X-Y

P=

-2 3 0 0
-2 -3 -1 8
2 0 0 0
-3 -4 7 1

>> % C). PROGRAM TO MULTIPLY TWO MATRICES.

>> % LET 1ST MATRIX BE:


>> X=[4 6 9 1;3 6 2 8;5 8 1 6;0 4 9 1]

X=

4 6 9 1
3 6 2 8
5 8 1 6
0 4 9 1

>> % LET 2ND MATRIX BE:


>> Y=[6 3 9 1;5 9 3 0;3 8 1 6;3 8 2 0]

Y=

6 3 9 1
5 9 3 0
3 8 1 6
3 8 2 0

>> % LET THEIR MULTIPLICATION BE:


>> V=X*Y
V=

84 146 65 58
78 143 63 15
91 143 82 11
50 116 23 54

>> % D). PROGRAM TO TRANSPOSE A MATRIX.


>> % LET A MATRIX BE:
>> X=[4 6 9 1;3 6 2 8;5 8 1 6;0 4 9 1]

X=

4 6 9 1
3 6 2 8
5 8 1 6
0 4 9 1

>> % LET TRANSPOSE OF MATRIX BE:


>> T=X'

T=

4 3 5 0
6 6 8 4
9 2 1 9
1 8 6 1
>> % PROGRAM TO FIND INVERSE OF A MATRIX USING MATLAB.

By Vishal Kumar
09615603413
S-12

>> % A). INVERSE OF MATRIX BY USING SIMPLE COMMAND.

>> % LET A MATRIX BE:


>> X=[2 3 6 9;5 9 1 7;2 6 1 8;7 2 8 5]

X=

2 3 6 9
5 9 1 7
2 6 1 8
7 2 8 5

>> % LET THE INVERSE BE:


>> I=X^-1

I=

-0.5297 -0.3634 0.6912 0.3563


0.4418 0.5677 -0.8052 -0.3017
0.5178 0.4181 -0.8147 -0.2138
-0.2637 -0.3872 0.6580 0.1639

>> % B). INVERSE OF MATRIX BY GAUSS-JORDAN METHOD.

>> % LET A MATRIX BE:


>> X=[2 3 6 9;5 9 1 7;2 6 1 8;7 2 8 5]

X=

2 3 6 9
5 9 1 7
2 6 1 8
7 2 8 5

>> % LET A AUGMENTATIVE BE:


>> Y=[X eye(4)]

Y=

2 3 6 9 1 0 0 0
5 9 1 7 0 1 0 0
2 6 1 8 0 0 1 0
7 2 8 5 0 0 0 1

>> % LET THE INVERSE BE:


>> Z=rref(Y)

Z=

Columns 1 through 7

1.0000 0 0 0 -0.5297 -0.3634 0.6912


0 1.0000 0 0 0.4418 0.5677 -0.8052
0 0 1.0000 0 0.5178 0.4181 -0.8147
0 0 0 1.0000 -0.2637 -0.3872 0.6580

Column 8

0.3563
-0.3017
-0.2138
0.1639
>> % PROGRAM TO FIND RANK, EIGEN VALUES AND EIGEN VECTORS OF A MATRIX.

By Vishal Kumar
09615603413
S-12

>> % A). CALCULATION OF RANK OF A MATRIX.

>> % LET A MATRIX BE:


>> X=[2 7 3 9;1 6 3 8;5 7 2 3;6 1 8 3]

X=

2 7 3 9
1 6 3 8
5 7 2 3
6 1 8 3

>> % LET RANK OF A MATRIX BE:


>> R=rank(X)

R=

>> % B). CALCULATION OF EIGEN VALUES OF A MATRIX.

>> % LET A MATRIX BE:


>> X=[2 7 3 9;1 6 3 8;5 7 2 3;6 1 8 3]

X=

2 7 3 9
1 6 3 8
5 7 2 3
6 1 8 3

>> % LET EIGEN VALUES OF A MATRIX BE:


>> E=eig(X)

E=

18.3611
-2.9315 + 4.6674i
-2.9315 - 4.6674i
0.5020
>> % C). CALCULATION OF EIGEN VECTORS OF A MATRIX.

>> % LET A MATRIX BE:


>> X=[2 7 3 9;1 6 3 8;5 7 2 3;6 1 8 3]

X=

2 7 3 9
1 6 3 8
5 7 2 3
6 1 8 3

>> % EIGEN VECTORS OF A MATRIX ARE:


>> [V,D]=eig(X)

V=

Columns 1 through 3

0.5601 -0.3523 - 0.2415i -0.3523 + 0.2415i


0.4768 -0.2739 - 0.3020i -0.2739 + 0.3020i
0.4654 -0.1268 + 0.5535i -0.1268 - 0.5535i
0.4922 0.5735 0.5735

Column 4

0.5586
-0.4854
-0.4990
0.4509

D=

Columns 1 through 3

18.3611 0 0
0 -2.9315 + 4.6674i 0
0 0 -2.9315 - 4.6674i
0 0 0

Column 4
0
0
0
0.5020
% PROGRAM TO FIND THE SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS AND
VERIFICATION OF THE SOLUTION

By Vishal Kumar
09615603413
S-12

% x-2y+3z=4 ; 2x-5y+12z=15 ; 2y-10z=-10

% FIND ITS INVERSE,ALSO VERIFY YOUR ANSWER.

% ANS-:
>> % LET MATRICES ARE:
>> A=[1 -2 3;2 -5 12;0 2 -10]

A=

1 -2 3
2 -5 12
0 2 -10

>> B=[4;15;-10]

B=

4
15
-10
% VALUE OF X BE:
>> X=A\B

X=

8
5
2

>> % SOULTION OF EQUATION ARE:


>> % x=8 ; y=5 ; z=2]
>> % NOW INVERSE OF MATRIX 'A' IS:
>> I=A^-1

I=
-13.0000 7.0000 4.5000
-10.0000 5.0000 3.0000
-2.0000 1.0000 0.5000

>> % VERIFICATION:
>> % WE HAVE TO PROVE-: A*X-B=0.
>> A*X

ans =

4
15
-10

>> % NOW,
>> A*X-B

ans =

0
0
0
>> % PROGRAM TO PLOT THE UNIT STEP FUNCTION USING MATLAB.
By Vishal Kumar
09615603413
S-12

>> % DEFINING TIME TO WHICH FUNCTION IS TO BE ACCESS.


>> t=-20:20;
>> % NOW TO PLOT STEP FUNCTION WE USE:
>> y=heaviside(t);
>> plot(t,y)
>> axis([-10 10 -2 2])
PLOTTING
% PROGRAM FOR NUMERICAL INTEGRATION BY TRAPEZOIDAL RULE USING MATLAB

By Vishal Kumar
09615603413
S-12

% EDITOR

clc;
clear all;
close all;

% CHANGE HERE FOR DIFFERENT FUNCTION


f=@(x)x^4;
% GIVEN LIMITS
a=-3;
b=3;
% NUMBER OF INTERVALS
n=b-a;
h=(b-a)/n;
p=0;

for i=a:b
p=p+1;
x(p)=i;
% CHANGE HERE FOR DIFFERENT FUNCTION
y(p)=i^4;
end

l=length(x);
x
y
answer=(h/2)*((y(1)+y(1))+2*(sum(y)-y(1)-y(1)))
% COMMOND WINDOW

x=

-3 -2 -1 0 1 2 3

y=

81 16 1 0 1 16 81

answer =

115
% PROGRAM FOR NUMERICAL INTEGRATION BY SIMPSON’S THREE EIGHTH RULE USING
MATLAB

By Vishal Kumar
09615603413
S-12

% EDITOR

clc;
clear all;
close all;

% CHANGE HERE FOR DIFFERENT FUNCTION


f=@(x)x^4;
% GIVEN LIMITS
a=-3;
b=3;
% NUMBER OF INTERVALS
n=b-a;
h=(b-a)/n;
p=0;

for i=a:b
p=p+1;
x(p)=i;
% CHANGE HERE FOR DIFFERENT FUNCTION
y(p)=i^4;
end

l=length(x);
x
y
answer=(3*h/8)*((y(1)+y(1))+3*(y(2)+y(3)+y(5)+y(6))+2*(y(4)))
% COMMOND WINDOW

x=

-3 -2 -1 0 1 2 3

y=

81 16 1 0 1 16 81

answer =

115
% PROGRAM TO PLOT THE SOLUTION OF FIRST ORDER DIFFERENTIAL EQUATION
% BY EULER'S METHOD USING MATLAB

By Vishal Kumar
09615603413
S-12

% Euler's method for dy/dt = K*(y-s)


K = 1;
s = 20;
y0 = 100;
npoints = 50;
dt = 0.1;
y = zeros(npoints,1); % this initializes the vector y to being all zeros
t = zeros(npoints,1);
y(1) = y0; % the initial condition
t(1) = 0.0;
for step=1:npoints-1 % loop over the timesteps
y(step+1) = y(step) + dt*K*(y(step)-s);
t(step+1) = t(step) + dt;
end
plot(t,y,'r');
hold on;
PLOTTING
% PROGRAM TO SOLVE FIRST ORDER DIFFERENTIAL EQUATION BY RUNG-KUTTA METHOD
% USING MATLAB

By Vishal Kumar
09615603413
S-12

% EDITOR

%Define f(t,y)

f = @(t,y) (2 - exp(-4*t) - 2*y);

% Define Step Size and final time point (t_final)

h = 0.001;

t_final = 5;

t = 0:h:t_final;

y = zeros(1,numel(t));

y(1) = 1; % y0

% You know the value a t = 0, thats why you'll start: t = h i.e. i = 2

for i = 2:numel(t)

k1 = h*f(t(i-1),y(i-1));
k2 = h*f(t(i-1)+h/2, y(i-1)+k1/2);
k3 = h*f(t(i-1)+h/2, y(i-1)+k2/2);
k4 = h*f(t(i-1)+h, y(i-1)+k3);
y(i) = y(i-1) + (k1+2*k2+2*k3+k4)/6;
disp([t(i) y(i)]);
end
plot(t,y);
% COMMAND WINDOW.

2.3500 0.9955

2.3510 0.9955

2.3520 0.9955

2.3530 0.9955

2.3540 0.9955

2.3550 0.9955

2.3560 0.9955

2.3570 0.9956

2.3580 0.9956

2.3590 0.9956

2.3600 0.9956

2.3610 0.9956

2.3620 0.9956

2.3630 0.9956

2.3640 0.9956

2.3650 0.9956

2.3660 0.9956

2.3670 0.9956

2.3680 0.9957
PLOTTING

You might also like