mirror of
https://bitbucket.org/cosmicvoids/vide_public.git
synced 2025-07-04 15:21:11 +00:00
76 lines
1.3 KiB
C
76 lines
1.3 KiB
C
#include <math.h>
|
|
#include "header.h"
|
|
#define ITMAX 100
|
|
#define EPS 3.0e-8
|
|
|
|
double zbrent(double (*func)(double), double x1,double x2, double tol)
|
|
{
|
|
int iter;
|
|
double a=x1,b=x2,c,d,e,min1,min2;
|
|
double fa=(*func)(a),fb=(*func)(b),fc,p,q,r,s,tol1,xm;
|
|
void nrerror();
|
|
|
|
if (fb*fa > 0.0)
|
|
{
|
|
printf("ERROR: Root must be bracketed in ZBRENT\n");
|
|
ERROR_FLAG=1;
|
|
return (x1+x2)/2;
|
|
}
|
|
fc=fb;
|
|
for (iter=1;iter<=ITMAX;iter++) {
|
|
if (fb*fc > 0.0) {
|
|
c=a;
|
|
fc=fa;
|
|
e=d=b-a;
|
|
}
|
|
if (fabs(fc) < fabs(fb)) {
|
|
a=b;
|
|
b=c;
|
|
c=a;
|
|
fa=fb;
|
|
fb=fc;
|
|
fc=fa;
|
|
}
|
|
tol1=2.0*EPS*fabs(b)+0.5*tol;
|
|
xm=0.5*(c-b);
|
|
if (fabs(xm) <= tol1 || fb == 0.0) return b;
|
|
if (fabs(e) >= tol1 && fabs(fa) > fabs(fb)) {
|
|
s=fb/fa;
|
|
if (a == c) {
|
|
p=2.0*xm*s;
|
|
q=1.0-s;
|
|
} else {
|
|
q=fa/fc;
|
|
r=fb/fc;
|
|
p=s*(2.0*xm*q*(q-r)-(b-a)*(r-1.0));
|
|
q=(q-1.0)*(r-1.0)*(s-1.0);
|
|
}
|
|
if (p > 0.0) q = -q;
|
|
p=fabs(p);
|
|
min1=3.0*xm*q-fabs(tol1*q);
|
|
min2=fabs(e*q);
|
|
if (2.0*p < (min1 < min2 ? min1 : min2)) {
|
|
e=d;
|
|
d=p/q;
|
|
} else {
|
|
d=xm;
|
|
e=d;
|
|
}
|
|
} else {
|
|
d=xm;
|
|
e=d;
|
|
}
|
|
a=b;
|
|
fa=fb;
|
|
if (fabs(d) > tol1)
|
|
b += d;
|
|
else
|
|
b += (xm > 0.0 ? fabs(tol1) : -fabs(tol1));
|
|
fb=(*func)(b);
|
|
}
|
|
nrerror("Maximum number of iterations exceeded in ZBRENT");
|
|
return(0);
|
|
}
|
|
|
|
#undef ITMAX
|
|
#undef EPS
|