niudun23.java.bak

来自「数值分析之计算方法与实验2：方程求根 by java」· BAK 代码 · 共 24 行

class Niudun23{
  static double f(double x){
    return Math.log(x)/Math.log(10)+x-2;
  }  
  static void gexianfa(double x0,double x1,double epsion){
    int n;
    double x[]=new double[100];
    x[0]=x0;x[1]=x1;
    double eps=epsion;
    n=2;
    System.out.println("x[0]="+x[0]);
    System.out.println("x[1]="+x[1]);
    while(n<100){
      x[n]=x[n-1]-f(x[n-1])*(x[n-1]-x[n-2])/(f(x[n-1])-f(x[n-2]));
      System.out.println("x["+n+"]="+x[n]);
      if(Math.abs(x[n]-x[n-1])<eps)break;
      n++;
    }
  }
  public static void main(String[]args){
    gexianfa(1.5,2.0,5*Math.pow(10,-6));
  }  
}