TheAlgorithms-C-Plus-Plus/computer_oriented_statistical_methods/successive_approximation.cpp

41 lines
939 B
C++
Raw Normal View History

2020-05-29 11:28:03 +08:00
/**
* \file
* \brief Method of successive approximations using [fixed-point
* iteration](https://en.wikipedia.org/wiki/Fixed-point_iteration) method
*/
#include <cmath>
#include <iostream>
2020-05-29 11:28:03 +08:00
/** equation 1
* \f[f(y) = 3y - \cos y -2\f]
*/
static float eq(float y) { return ((3 * y) - (cos(y)) - 2); }
2020-05-29 11:28:03 +08:00
/** equation 2
* \f[f(y) = \frac{\cos y}{2} +2\f]
*/
static float eqd(float y) { return ((0.5) * ((cos(y)) + 2)); }
2016-10-14 11:58:07 +08:00
2020-05-29 11:28:03 +08:00
/** Main function */
int main() {
float y, x1, x2, x3, sum, s, a, f1, f2, gd;
int i, n;
2016-10-14 11:58:07 +08:00
for (i = 0; i < 10; i++) {
sum = eq(y);
std::cout << "value of equation at " << i << " " << sum << "\n";
y++;
}
std::cout << "enter the x1->";
std::cin >> x1;
std::cout << "enter the no iteration to perform->\n";
std::cin >> n;
for (i = 0; i <= n; i++) {
x2 = eqd(x1);
std::cout << "\nenter the x2->" << x2;
x1 = x2;
}
return 0;
}