Programul n pascal:

x*3-3*x*exp(x)+34=0

Program M5;
var a,b,e,c,x: real;
n,i: integer;
function f(x:real):real;
begin sqr(x)*x-3*x*exp(x)+34;end;
begin a:=0.5; b:=1.5; n:=10;
c:=a-(f(a))/(f(b)-f(a))*(b-a);
if f(c)*f(a)>0 then begin e:=b; x:=a; end
else begin e:=a; x:=b; end;
for i:=1 to n do
begin x:= x-(f(x))/(f(e)-f(x))*(e-x);
writeln('i=', i:3,' x=',x:10:8,' f(x)=',f(x):12:8);
end;
end.

Rezultate:
i= 1
i= 2
i= 3
i= 4
i= 5
i= 6
i= 7
i= 8
i= 9
i= 10

x=2.69127534
x=1.21317967
x=3.28329166
x=0.89173312
x=4.07469179
x=0.67429300
x=4.69352571
x=0.59266573
x=4.94542196
x=0.57172871

f(x)=-65.59996781
f(x)= 23.54155556
f(x)=-193.23721256
f(x)= 28.18333808
f(x)=-617.51844880
f(x)= 30.33638835
f(x)=-1400.73451000
f(x)= 30.99212739
f(x)=-1929.99129153
f(x)= 31.14872844

Programul n pascal:

sqr(x)*x -22*x-41=0

Program M6;
var a,b,e,c,x: real;
n,i: integer;
function f(x:real):real;
begin f:= sqr(x)*x -22*x-41; end;
begin a:=0.5; b:=1.5; n:=10;
c:=a-(f(a))/(f(b)-f(a))*(b-a);
if f(c)*f(a)>0 then begin e:=b; x:=a; end
else begin e:=a; x:=b; end;
for i:=1 to n do
begin x:= x-(f(x))/(f(e)-f(x))*(e-x);
writeln('i=', i:3,' x=',x:10:8,' f(x)=',f(x):12:8);
end;
end.

Rezultate:
i=
i=
i=
i=

1
2
3
4

x=2.69127534
x=1.21317967
x=3.28329166
x=0.89173312

f(x)=-65.59996781
f(x)= 23.54155556
f(x)=-193.23721256
f(x)= 28.18333808

i= 5
i= 6
i= 7
i= 8
i= 9
i= 10

x=4.07469179
x=0.67429300
x=4.69352571
x=0.59266573
x=4.94542196
x=0.57172871

f(x)=-617.51844880
f(x)= 30.33638835
f(x)=-1400.73451000
f(x)= 30.99212739
f(x)=-1929.99129153
f(x)= 31.14872844

Programul n pascal: sqr(x)*x-3*x*exp(x)+34=0

Program M7;
var Msup,minf,a,b,e,x,xnou,xvechi,eps: real;
function f(x:real):real;
begin f:= sqr(x)*x-3*x*exp(x)+34;end;
begin a:=-0.5; b:=0.5; eps:=0.0001;
Msup:=10; minf:=5;
x:=a-(f(a))/(f(b)-f(a))*(b-a);
if f(x)*f(a)>0 then begin e:=b; xnou:=a; end
else begin e:=a; xnou:=b; end;
repeat
xvechi:=xnou;
xnou:= xvechi-(f(xvechi))/(f(e)-f(xvechi))*(e-xvechi);
writeln(' x=',xnou:10:8,' f(x)=',f(xnou):12:8);
until abs ((Msup-minf)/minf*(xnou-xvechi))<eps;
end.

Rezultate:
x=-0.14021378
x=-0.12654513
x=-0.12597595
x=-0.12595217

f(x)=
f(x)=
f(x)=
f(x)=

Programul n pascal:

-0.11232408
-0.00468150
-0.00019564
-0.00000818

sqr(x)*x -22*x-41=0

Program M8
var Msup,minf,a,b,e,x,xnou,xvechi,eps: real;
function f(x:real):real;
begin f:=sqr(x)*x -22*x-41; end;
begin a:=-0.5; b:=0.5; eps:=0.0001;
Msup:=10; minf:=5;
x:=a-(f(a))/(f(b)-f(a))*(b-a);
if f(x)*f(a)>0 then begin e:=b; xnou:=a; end
else begin e:=a; xnou:=b; end;
repeat
xvechi:=xnou;
xnou:= xvechi-(f(xvechi))/(f(e)-f(xvechi))*(e-xvechi);
writeln(' x=',xnou:10:8,' f(x)=',f(xnou):12:8);
until abs ((Msup-minf)/minf*(xnou-xvechi))<eps;
end.

Rezultate:
x=1.87654321
x=1.60768182
x=1.68444179
x=1.66339552
x=1.66924023
x=1.66762262
x=1.66807075
x=1.66794663
x=1.66798101

f(x)=
f(x)=
f(x)=
f(x)=
f(x)=
f(x)=
f(x)=
f(x)=
f(x)=

6.13895051
-1.69108352
0.46817682
-0.12966602
0.03591381
-0.00994710
0.00275507
-0.00076307
0.00021135

Aplicaie practic
Nr.2
Tema:
Rezolvarea ecuaiilor algebrice utiliznd Metoda
Coardei

A efectuat: Iamandii Vadim

A verificat: Panu Alla

Chiinu 2015
All rights are reserved.
FapSRL

Scopul lucrrii
S se separe toate rdcinile reale ale ecuaiei (x)=0 unde (x)
este continu pe intervalulul [a ;b] i (a)*(b)<0;
S se determine punctul c de intersecie a dreptei determinate de
punctele
(a, (a)) i ( (b)) cu axa Ox;
S se alctuiasc program n pascal;
S se afieze rezultatele;
Ecuaia iniial:

x^3-3xe^x+34=0

x^3-22x-41=0

Cuprins
Scopul aplicaiei practice
Consideraii teoretice: Metoda Coardei
Algoritmul de calcul pentru un numar prestabilit n de aproximri
succesive
Algoritmul de calcul pentru o exactitae dat
Programul n pascal
Prezentarea rezultatelor
Programul n pascal
Prezentarea rezultatelor
Concluzie

Concluzie
n urma efecturii aplicaiei practice am nvat s divizm
segmentul n pri proporionale, proporia fiind dat de punctul de
intersecie al coardei care unete extremitile segmentului cu axa Ox.
Prin comparare am dedus c metoda biseciei, cu toat simplitatea
ei nu este efectiv n cazurile cnd rezultatul trebuie obinut prin un
numr mic de iteraii, cu o exactitate nalt, segmentul iniial care
conine soluia fiind destul de mare. n acest caz este mai potrivit
Metoda coardei

Consideraii teoretice