逐次代入法求解非线性方程

本文主要是介绍逐次代入法求解非线性方程，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

//用逐次代入法求解非线性方程
#include <iostream>
#include <math.h>
#include <process.h>

using namespace std;

class successive
{
private:
 int iteration;
 double eps, error, f, x_new, x_old;

public:
 successive()
 {
  iteration = 0;
 }
 void solution();
 double function(double x)
 {
  f = 0.3 * exp(x);
  return f;
 }
};

void main()
{
 successive substitution;
 substitution.solution();
}

void successive::solution()
{
 cout << "\n输入初始估值：";
 cin >> x_old;
 cout << "\n输入公差：";
 cin >> eps;
 if (fabs(x_old - function(x_old)) < eps)
 {
  cout << "\n解是：" << x_old << endl;
  exit(0);
 }
 do
 {
  iteration++;
  x_new = function(x_old);
  error = fabs(x_new - function(x_new));
  x_old = x_new;
 }while (error >= eps);
 cout << "\n解是：" << x_new << endl;
 cout << "\n收敛于" << iteration << "次迭代" << endl;
}

这篇关于逐次代入法求解非线性方程的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---