牛顿迭代方法求解:
n的求解过程:
package Package;
import java.util.Scanner;
public class text6 {
public static void main(String[] args) {
Scanner n=new Scanner(System.in);
System.out.println("输入要求的根值");
double x=n.nextDouble();
double a0=2.0;
double fxd=2*a0;
double a1=a0-(a0*a0-x)/fxd;
while(Math.abs(a0-a1)>1e-10)
{
a0=a1;
fxd=2*a0;
a1=a0-(a0*a0-x)/fxd;
System.out.println("---");
}
System.out.println(a1 );
}
}



