用梯度下降法解非线性方程

#include
#include
using namespace std;
void newton(int n,double x[],double y[],double eps);
double fn(int n,double x[],double y[]);
const double PI = 3.14159265358979323846;
int main()
{
	int i,n=3;
	double y[3],x[3]={0.5,0.5,0.5};
	double eps=1.e-08;
	newton(n,x,y,eps);	
	for(i=0;i

你可能感兴趣的:(code,机器学习)