【C++ 程序】牛顿迭代法求一元二次方程的解（包括复数解）

最新推荐文章于 2023-03-14 22:24:23 发布

Teddy van Jerry

最新推荐文章于 2023-03-14 22:24:23 发布

阅读量2.6k

点赞数 4

分类专栏：【C++】自编程序文章标签： c++ 牛顿迭代法小程序一元二次方程

本文链接：https://blog.csdn.net/weixin_50012998/article/details/109561477

版权

【C++】自编程序专栏收录该内容

52 篇文章 15 订阅

订阅专栏

程序

#include <iostream>
#include <cmath>
using namespace std;

double epsilon = 1E-15;
double a, b, c;

double f(double x)
{
	return a * x * x + b * x + c;
}

double derivative(double x)
{
	return (2 * a * x + b);
}

double calculation_once(double& x)
{
	x -= f(x) / derivative(x);
	return f(x);
}

int main()
{

	cout << "This is a programme using Newton's method to solve formulas." << endl;
	cout << "Input a,b,c for a*x^2 + b*x + c = 0." << endl;
	cout << "a = ";
	cin >> a;
	cout << "b = ";
	cin >> b;
	cout << "c = ";
	cin >> c;
	cout << "------------------------------" << endl;
	if (a == 0)
	{
		if (b == 0)
		{
			if (c == 0)
				cout << "Infinite solutions!" << endl;
			else cout << "No solution!" << endl;
		}
		else cout << "x = " << -c / b << endl;
	}
	else // a != 0
	{
		double difference;
		double x = 1 - b / (2 * a); // the right side
		do
		{
			difference = calculation_once(x);
			if (x < -b / (2 * a)) // no real solution
			{
				// x = m + ni
				double m = -b / (2 * a);
				double n = sqrt(f(m) / a);
				cout << "x1 = " << m << "-" << n << "i , x2 = " << m << "+" << n << "i" << endl;
				return 0;
			}
			else if (x == -b / (2 * a))
			{
				if (fabs(difference) < epsilon) cout << "x = " << -b / (2 * a) << endl;
				else cout << "x = " << x << endl;
				return 0;
			}
		} while (fabs(difference) > epsilon);
		if (x + b / (2 * a) <= sqrt(epsilon)) cout << "x = " << ((-b / (2 * a) == -0) ? 0 : -b / (2 * a)) << endl;
		else cout << "x1 = " << -b / a - x << " , x2 = " << x << endl;
	}
	return 0;
}