迭代法求解非线性方程组

#include<iostream>
#include<math.h>
using namespace std;


int M;//允许迭代最大次数
double E;//允许的误差


/*
针对式子：
x^2-10x+y^2+23=0
xy^2+x-10y^2+2=0
*/


//计算范数||X-Y||的值
double getNorm(double *x, double *y){
double sum = 0;
for (int i = 0; i < 2; i++)
sum += abs(x[i] - y[i]);
return sum;
}




int main() {
double *X0 = new double[2];//初始迭代向量
double *D = new double[2];//迭代向量
X0[0] = 3.8;
X0[1] = 0.9;
printf("请输入允许迭代的最大次数：");
cin >> M;
printf("请输入允许的最大误差：");
cin >> E;
int k = 0;
while (true) {
if (k > M) {
printf("达到迭代次数，当前值为：\n");
printf("X1 = %f\n", D[0]);
printf("X2 = %f\n", D[1]);
break;
}
D[0] = (pow(X0[0],2)+pow(X0[1],2)+23) / 10;
double temp = (X0[0] * pow(X0[1], 2) + X0[0] + 2) / 10;
D[1] = pow(temp,0.5);
if (getNorm(D, X0) < E) {
cout << "迭代法的结果为：" << endl;
printf("X1 = %f\n",D[0]);
printf("X2 = %f\n", D[1]);
break;
}
X0[0] = D[0];
X0[1] = D[1];
k++;
}
system("pause");
}