牛顿迭代

最新推荐文章于 2024-07-26 17:03:47 发布

yitahutu79

最新推荐文章于 2024-07-26 17:03:47 发布

阅读量83

点赞数

分类专栏： # C语言

本文链接：https://blog.csdn.net/qq_40713201/article/details/114288085

版权

C语言专栏收录该内容

132 篇文章 17 订阅

订阅专栏

#include <stdio.h>
#include <math.h>
#define EPSL 1e-6
double func(double x, double n) {
   return x * x - n;
}

double f(double x) {
   return 2 * x;
}

double NewTon(double (*F)(double, double), double(*f)(double),  double n) {
   double x = 1.0;
   while (fabs(F(x, n)) > EPSL) {
     x -= F(x, n) / f(x);
   }
   #undef EPSL
   return x;
}

double my_sqrt(double n) {
   return NewTon(func, f, n);
}

int main() {
   double n;
   while (~scanf("%lf", &n)) {
      printf("sqtr(%g) = %g\n", n, sqrt(n));
      printf("my_sqrt(%g) =  %g\n", n, my_sqrt(n));
   }
   return 0;
}