Newton tangent method

最新推荐文章于 2025-05-07 19:46:16 发布

C0conut88

最新推荐文章于 2025-05-07 19:46:16 发布

阅读量120

点赞数 5

文章标签： java

本文链接：https://blog.youkuaiyun.com/panwen0806/article/details/120885941

版权

本文分享了作者使用Java实现牛顿迭代公式的过程，详细展示了如何输入多项式系数并求解方程的迭代解。通过实例演示了如何构造函数并进行数值逼近，适合初学者理解算法应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

今天高数课讲的牛顿迭代公式，觉得可以用java实现，就写了一段程序，望大佬指点

import java.util.Scanner;

public class Newtons {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        System.out.println("the highest power of the function");
        int power = in.nextInt();
        double[] storage = new double[power + 1];
        for (int i = 0; i < storage.length; i++) {
            System.out.printf("please input the coefficient of the power %d", i);
            storage[i] = in.nextDouble();
        }//initialize the function form lowest to highest
        System.out.println("the function is");
        for (int i = 0; i < storage.length; i++) {
            if (i != storage.length - 1) System.out.printf("%.2f x^%d +" + "\t", storage[i], i);
            else System.out.printf("%.2f x^%d = 0" + "\t", storage[i], i);
        }
        System.out.println("please input the x0");
        double x0 = in.nextDouble();
        while (true) {
            double k = 0;
            double y0 = 0;
            double xi;
            for (int i = 1; i < storage.length; i++) {
                k += storage[i] * i * Math.pow(x0, i - 1);
            }
            for (int i = 0; i < storage.length; i++) {
                y0 += storage[i] * Math.pow(x0, i);
            }
            xi = x0 - y0 / k;
            if (Math.abs(xi - x0) < 0.000001) {
                System.out.println(xi);
                break;
            } else {
                x0 = xi;
            }
        }

    }
}