Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cmath>
- #include <iostream>
- void method_vr() {
- double w = 1.2; // 0<w<2
- int N_max = 10000;
- int S = 0;
- double eps = 0.0001;
- double eps_max = 0;
- double eps_cur = 0;
- int n;
- std::cout << "input n" << '\n';
- std::cin >> n;
- double a[n][n];
- double x[n];
- double b[n];
- std::cout << "input a[n][n]" << '\n';
- for (int i = 0; i < n; ++i) {
- for (int j = 0; j < n; ++j) {
- std::cin >> a[i][j];
- }
- }
- std::cout << "input b[n]" << '\n';
- for (int j = 0; j < n; ++j) {
- std::cin >> b[j];
- }
- std::cout << "input x[n]" << '\n';
- for (int j = 0; j < n; ++j) {
- std::cin >> x[j];
- }
- for (int i = 0; i < n; ++i) {
- for (int j = 0; j < n; ++j) {
- std::cout << a[i][j] << ' ';
- }
- std::cout << b[i] << '\n';
- }
- double x_old;
- double x_new;
- bool f = false;
- while (!f) {
- for (int i = 0; i < n; ++i) {
- x_old = x[i];
- x_new = (1 - w) * a[i][i] * x[i] + w * b[i];
- for (int j = 0; j < n; ++j) {
- if (j != i) {
- x_new -= w * a[i][j] * x[j];
- }
- }
- x_new /= a[i][i];
- eps_cur = fabs(x_old - x_new);
- if (i == 1) {
- eps_max = eps_cur;
- } else if (eps_cur > eps_max) {
- eps_max = eps_cur;
- }
- x[i] = x_new;
- }
- S += 1;
- if ((eps_max <= eps) || (S >= N_max)) {
- f = true;
- std::cout << "eps_max: " << eps_max << '\n';
- }
- }
- for (int i = 0; i < n; ++i) {
- std::cout << S << ':' << x[i] << ' ';
- }
- std::cout << '\n';
- std::cout << "count of steps: " << S << '\n';
- }
- int main() {
- method_vr();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement