Laboratoare Metode Numerice

MET BISEC POL

#include <stdio.h>

#include <conio.h>

#include <math.h>

double valpol(int n,double A[10],double x)

{

int i;

double b;

b=A[n];

for(i=n-1;i>=0;i--)

b=A[i]+x*b;

return b;

}

main()

{

int n;

double A[10];

double i,ls,ld,er,xm,*r;

printf("neroarea:");

scanf("%lf",&er);

printf("ngrad:");

scanf("%d",&n);

printf("nlim st:");

scanf("%lf",&ls);

printf("nlim dr:");

scanf("%lf",&ld);

for(i=0;i<=n;i++)

{

printf("ndati coef[%d]:",i);

scanf("%lf",&A[i]);

printf("nA[i]");

}

if(valpol(n,A,ls)*valpol(n,A,ld)>0)

{

printf("err");

getche();

return 0;

}

if(valpol(n,A,ls)==0)

{

*r=ls;

return 1;

}

if(valpol(n,A,ld)==0)

{

*r=ld;

return 1;

}

xm=(ls+ld)/2;

while((fabs(ld-ls)>er)&&(valpol(n,A,xm)!=0))

{

xm=(ls+ld)/2;

if(valpol(n,A,xm)*valpol(n,A,ls)<0)

ld=xm;

else ls=xm;

}

*r=xm;

printf("nradacina:%lf",*r);

getche();

return 1;

}

MET BISEC ECT

#include<conio.h>

#include<stdio.h>

#include<math.h>

double f(double x)

{

return exp(x)-1/x;

}

double der(double x)

{

return 2*x+1.5857;

}

int bisectie(/*double(*f)(double),*/double ls,double ld,double err,double *sol)

{

double xm;

if(f(ls)*f(ld)>0)

return 0;

if(f(ls)==0)

{

*sol=ls;

return 1;

}

if(f(ld)==0)

{

*sol=ld;

return 1;

}

xm=(ls+ld)/2;

while((fabs(ld-ls)>err)&&(f(xm)!=0))

{

xm=(ls+ld)/2;

if(f(ls)*f(xm)<0)

ld=xm;

else ls=xm;

}

*sol=xm;

return 1;

}

main()

{

int e;

double ls,ld,err,*sol;

clrscr();

printf("limst:");

scanf("%lf",&ls);

printf("limdr:");

scanf("%lf",&ld);

printf("eroarea:");

scanf("%lf",&err);

e=bisectie(ls,ld,err,sol);

printf("sol:%lf",*sol);

getche();

return e;

}

usor de inteles..