Kumpulan Source Code Program Metode Numerik
Kumpulan Source Code Program Metode Numerik
Oleh :
(07650026)
Juni 2010
1. Source Code Program dengan Metode Biseksi
for(int i=1;i<=iterasi;i++)
if(y1*yt<0)
{ x1=x1; x2=xt; }
else if(y2*yt<0)
{ x1=xt; x2=x2; }
Output Program:
for(int i=1;i<=iterasi;i++)
{y1=Math.pow(x1,2)-3;y2=Math.pow(x2,2)-3;xt=x2-y2*(x2-x1)/(y2-y1);yt=Math.pow(xt,2)-3;
if(y1*yt<0)
{ x1=x1;x2=xt;}
else if(y2*yt<0)
{ x1=xt;x2=x2;}
Output Program:
Iterasi ke=1 x: 0.5
Iterasi ke=2 x: 0.9230769230769234
Iterasi ke=3 x: 1.2333333333333334
Iterasi ke=4 x: 1.4377880184331797
Iterasi ke=5 x: 1.563197026022305
Iterasi ke=6 x: 1.636765790120423
Iterasi ke=7 x: 1.6787989959451632
Iterasi ke=8 x: 1.7024529464274485
Iterasi ke=9 x: 1.7156505558004014
Iterasi ke=10 x: 1.7229789294706253
Iterasi ke=11 x: 1.7270374163429194
Iterasi ke=12 x: 1.72928171278115
Iterasi ke=13 x: 1.7305217708094203
Iterasi ke=14 x: 1.7312066405907354
Iterasi ke=15 x: 1.7315847921148704
Iterasi ke=16 x: 1.7317935601436636
Iterasi ke=17 x: 1.7319088070185318
Iterasi ke=18 x: 1.7319724244490944
Iterasi ke=19 x: 1.732007541096312
Iterasi ke=20 x: 1.732026925141751
Iterasi ke=21 x: 1.7320376248696245
Iterasi ke=22 x: 1.7320435309500404
Iterasi ke=23 x: 1.7320467910059385
Iterasi ke=24 x: 1.7320485904991916
Iterasi ke=25 x: 1.7320495837870213
Iterasi ke=26 x: 1.7320501320637964
Iterasi ke=27 x: 1.7320504347025203
Iterasi ke=28 x: 1.732050601753527
Iterasi ke=29 x: 1.732050693962603
3. Source Code Program dengan Metode Secant
for(int i=1;i<=iterasi;i++)
{ y1=Math.pow(x1,2)-3; y2=Math.pow(x2,2)-3;
if(y1==y2)
{ break;}
x3=x2-y2*(x2-x1)/(y2-y1);y3=Math.pow(x3,2)-3;x1=x2;x2=x3;
} } }
Output Program:
{if(x[i]>a)
{x1=x[i-1]; x2=x[i];y1=y[i-1];y2=y[i];
break;}}
b=y1+(y2-y1)/(x2-x1)*(a-x1);
System.out.println("Nilai akhir="+b);}}
Output Program:
Nilai akhir=-0.5
{ if(x[i]>a)
break;}}
// b=y1+(y2-y1)/(x2-x1)*(a-x1);
b=((a-x2/x1-x2)*(a-x3/x1-x3)*y1) + ((a-x1/x2-x1)*(a-x3/x2-x3)*y2)+((a-x1/x3-x1)*(a-
x2/x3-x2)*y3);
System.out.println("Nilai akhir="+b);}}
Output Program:
for(int i=1;i<=iterasi;i++)
{ y=Math.pow(x,2)-3; //f(x)=x^2-3
x-=y/t; //x=x-y/t
Output Program:
4.792616678009936
7. Source Code Program dengan Metode Lagrange
{ aa=1;
for(int j=0;j<x.length;j++)
{ if(i !=j)
{ aa=aa*(xx-x[j])/(x[i]-x[j]);
bb=aa*y[i];
cc=cc+bb;
System.out.println(cc);
Output Program: