Gauss-Seidel method convergence algorithm












3












$begingroup$


From Wikipedia:




The convergence properties of the Gauss–Seidel method
are dependent on the matrix A. Namely, the procedure
is known to converge if either:



1. A is symmetric positive-definite, or

2. A is strictly or irreducibly diagonally dominant.



Is there algorithm for transforming matrix to meet the convergence criteria or must I do it manually?



I am implementing Gauss-Seidel method in C++:



#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;



int n;

double eps = 0.001;



//yygnanma sherti

bool converge(double *xk, double *xkp)

{

    double norm = 0;

    for (int i = 0; i < n; i++) 

    {

      norm += (xk[i] - xkp[i])*(xk[i] - xkp[i]);

    }

    if(sqrt(norm) >= eps)

      return false;

    return true;

}





int main()

{

    //olcheg

    printf("Olchegi giriz: ");

    scanf("%d", &n);



    //koeffisientler uchin

    double a[n][n];

    for(int i=0; i<n; i++)

    {

        for(int j=0; j<n; j++)

        {

            double tmp;

            printf("a[%d][%d] = ", i+1, j+1);

            scanf("%lf", &tmp);

            a[i][j] = tmp;

        }

    }



    //azat agzalar uchin

    double b[n];

    for(int i=0; i<n; i++)

    {

        double tmp;

        printf("b[%d] = ", i+1);

        scanf("%lf", &tmp);

        b[i] = tmp;

    }



    double x[n];

    double p[n];



    for(int i=0; i<n; i++)

    {

        x[i] = 0;

        p[i] = 0;

    }



    do

    {

        for (int i = 0; i < n; i++)

            p[i] = x[i];



        for (int i = 0; i < n; i++)

        {

            double var = 0;

            for (int j = 0; j < i; j++)

                var += (a[i][j] * x[j]);

            for (int j = i; j < n; j++)

                var += (a[i][j] * p[j]);

            x[i] = (b[i] - var) / a[i][i];

        }

    }while (!converge(x, p));



    return 0;

}


Now I want to implement matrix transformation algorithm (if there is one) to meet convergence criteria.






linear-algebra numerical-methods numerical-linear-algebra







share|cite|improve this question









$endgroup$












  • $begingroup$
    Where does your matrix A come from? Is it symmetric? Clearly arbitrarily "transforming" the matrix to meet some criteria may change the problem you are solving -- so if you tell me more about the problem I can make some suggestions.
    $endgroup$
    – RRL
    May 16 '14 at 19:21












  • $begingroup$
    A is not symmetric matrix. I am going to implement for abitrary matrix
    $endgroup$
    – torayeff
    May 16 '14 at 19:38








  • 1




    $begingroup$
    @torayeff you left out the fact that it will often converge without those conditions. Usually, if the system was small I would manually work it till there was as much diagonal dominance as possible.
    $endgroup$
    – bobbym
    May 16 '14 at 19:51










  • $begingroup$
    Why are you implementing this algorithm for a dense matrix?
    $endgroup$
    – Pawel Kowal
    Jul 14 '16 at 10:01
















3












$begingroup$


From Wikipedia:




The convergence properties of the Gauss–Seidel method
are dependent on the matrix A. Namely, the procedure
is known to converge if either:



1. A is symmetric positive-definite, or

2. A is strictly or irreducibly diagonally dominant.



Is there algorithm for transforming matrix to meet the convergence criteria or must I do it manually?



I am implementing Gauss-Seidel method in C++:



#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;



int n;

double eps = 0.001;



//yygnanma sherti

bool converge(double *xk, double *xkp)

{

    double norm = 0;

    for (int i = 0; i < n; i++) 

    {

      norm += (xk[i] - xkp[i])*(xk[i] - xkp[i]);

    }

    if(sqrt(norm) >= eps)

      return false;

    return true;

}





int main()

{

    //olcheg

    printf("Olchegi giriz: ");

    scanf("%d", &n);



    //koeffisientler uchin

    double a[n][n];

    for(int i=0; i<n; i++)

    {

        for(int j=0; j<n; j++)

        {

            double tmp;

            printf("a[%d][%d] = ", i+1, j+1);

            scanf("%lf", &tmp);

            a[i][j] = tmp;

        }

    }



    //azat agzalar uchin

    double b[n];

    for(int i=0; i<n; i++)

    {

        double tmp;

        printf("b[%d] = ", i+1);

        scanf("%lf", &tmp);

        b[i] = tmp;

    }



    double x[n];

    double p[n];



    for(int i=0; i<n; i++)

    {

        x[i] = 0;

        p[i] = 0;

    }



    do

    {

        for (int i = 0; i < n; i++)

            p[i] = x[i];



        for (int i = 0; i < n; i++)

        {

            double var = 0;

            for (int j = 0; j < i; j++)

                var += (a[i][j] * x[j]);

            for (int j = i; j < n; j++)

                var += (a[i][j] * p[j]);

            x[i] = (b[i] - var) / a[i][i];

        }

    }while (!converge(x, p));



    return 0;

}


Now I want to implement matrix transformation algorithm (if there is one) to meet convergence criteria.






linear-algebra numerical-methods numerical-linear-algebra







share|cite|improve this question









$endgroup$












  • $begingroup$
    Where does your matrix A come from? Is it symmetric? Clearly arbitrarily "transforming" the matrix to meet some criteria may change the problem you are solving -- so if you tell me more about the problem I can make some suggestions.
    $endgroup$
    – RRL
    May 16 '14 at 19:21












  • $begingroup$
    A is not symmetric matrix. I am going to implement for abitrary matrix
    $endgroup$
    – torayeff
    May 16 '14 at 19:38








  • 1




    $begingroup$
    @torayeff you left out the fact that it will often converge without those conditions. Usually, if the system was small I would manually work it till there was as much diagonal dominance as possible.
    $endgroup$
    – bobbym
    May 16 '14 at 19:51










  • $begingroup$
    Why are you implementing this algorithm for a dense matrix?
    $endgroup$
    – Pawel Kowal
    Jul 14 '16 at 10:01














3












3








3





$begingroup$


From Wikipedia:




The convergence properties of the Gauss–Seidel method
are dependent on the matrix A. Namely, the procedure
is known to converge if either:



1. A is symmetric positive-definite, or

2. A is strictly or irreducibly diagonally dominant.



Is there algorithm for transforming matrix to meet the convergence criteria or must I do it manually?



I am implementing Gauss-Seidel method in C++:



#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;



int n;

double eps = 0.001;



//yygnanma sherti

bool converge(double *xk, double *xkp)

{

    double norm = 0;

    for (int i = 0; i < n; i++) 

    {

      norm += (xk[i] - xkp[i])*(xk[i] - xkp[i]);

    }

    if(sqrt(norm) >= eps)

      return false;

    return true;

}





int main()

{

    //olcheg

    printf("Olchegi giriz: ");

    scanf("%d", &n);



    //koeffisientler uchin

    double a[n][n];

    for(int i=0; i<n; i++)

    {

        for(int j=0; j<n; j++)

        {

            double tmp;

            printf("a[%d][%d] = ", i+1, j+1);

            scanf("%lf", &tmp);

            a[i][j] = tmp;

        }

    }



    //azat agzalar uchin

    double b[n];

    for(int i=0; i<n; i++)

    {

        double tmp;

        printf("b[%d] = ", i+1);

        scanf("%lf", &tmp);

        b[i] = tmp;

    }



    double x[n];

    double p[n];



    for(int i=0; i<n; i++)

    {

        x[i] = 0;

        p[i] = 0;

    }



    do

    {

        for (int i = 0; i < n; i++)

            p[i] = x[i];



        for (int i = 0; i < n; i++)

        {

            double var = 0;

            for (int j = 0; j < i; j++)

                var += (a[i][j] * x[j]);

            for (int j = i; j < n; j++)

                var += (a[i][j] * p[j]);

            x[i] = (b[i] - var) / a[i][i];

        }

    }while (!converge(x, p));



    return 0;

}


Now I want to implement matrix transformation algorithm (if there is one) to meet convergence criteria.






linear-algebra numerical-methods numerical-linear-algebra







share|cite|improve this question









$endgroup$




From Wikipedia:




The convergence properties of the Gauss–Seidel method
are dependent on the matrix A. Namely, the procedure
is known to converge if either:



1. A is symmetric positive-definite, or

2. A is strictly or irreducibly diagonally dominant.



Is there algorithm for transforming matrix to meet the convergence criteria or must I do it manually?



I am implementing Gauss-Seidel method in C++:



#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;



int n;

double eps = 0.001;



//yygnanma sherti

bool converge(double *xk, double *xkp)

{

    double norm = 0;

    for (int i = 0; i < n; i++) 

    {

      norm += (xk[i] - xkp[i])*(xk[i] - xkp[i]);

    }

    if(sqrt(norm) >= eps)

      return false;

    return true;

}





int main()

{

    //olcheg

    printf("Olchegi giriz: ");

    scanf("%d", &n);



    //koeffisientler uchin

    double a[n][n];

    for(int i=0; i<n; i++)

    {

        for(int j=0; j<n; j++)

        {

            double tmp;

            printf("a[%d][%d] = ", i+1, j+1);

            scanf("%lf", &tmp);

            a[i][j] = tmp;

        }

    }



    //azat agzalar uchin

    double b[n];

    for(int i=0; i<n; i++)

    {

        double tmp;

        printf("b[%d] = ", i+1);

        scanf("%lf", &tmp);

        b[i] = tmp;

    }



    double x[n];

    double p[n];



    for(int i=0; i<n; i++)

    {

        x[i] = 0;

        p[i] = 0;

    }



    do

    {

        for (int i = 0; i < n; i++)

            p[i] = x[i];



        for (int i = 0; i < n; i++)

        {

            double var = 0;

            for (int j = 0; j < i; j++)

                var += (a[i][j] * x[j]);

            for (int j = i; j < n; j++)

                var += (a[i][j] * p[j]);

            x[i] = (b[i] - var) / a[i][i];

        }

    }while (!converge(x, p));



    return 0;

}


Now I want to implement matrix transformation algorithm (if there is one) to meet convergence criteria.






linear-algebra numerical-methods numerical-linear-algebra




linear-algebra numerical-methods numerical-linear-algebra






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked May 16 '14 at 18:56









torayefftorayeff

1164




1164












  • $begingroup$
    Where does your matrix A come from? Is it symmetric? Clearly arbitrarily "transforming" the matrix to meet some criteria may change the problem you are solving -- so if you tell me more about the problem I can make some suggestions.
    $endgroup$
    – RRL
    May 16 '14 at 19:21












  • $begingroup$
    A is not symmetric matrix. I am going to implement for abitrary matrix
    $endgroup$
    – torayeff
    May 16 '14 at 19:38








  • 1




    $begingroup$
    @torayeff you left out the fact that it will often converge without those conditions. Usually, if the system was small I would manually work it till there was as much diagonal dominance as possible.
    $endgroup$
    – bobbym
    May 16 '14 at 19:51










  • $begingroup$
    Why are you implementing this algorithm for a dense matrix?
    $endgroup$
    – Pawel Kowal
    Jul 14 '16 at 10:01


















  • $begingroup$
    Where does your matrix A come from? Is it symmetric? Clearly arbitrarily "transforming" the matrix to meet some criteria may change the problem you are solving -- so if you tell me more about the problem I can make some suggestions.
    $endgroup$
    – RRL
    May 16 '14 at 19:21












  • $begingroup$
    A is not symmetric matrix. I am going to implement for abitrary matrix
    $endgroup$
    – torayeff
    May 16 '14 at 19:38








  • 1




    $begingroup$
    @torayeff you left out the fact that it will often converge without those conditions. Usually, if the system was small I would manually work it till there was as much diagonal dominance as possible.
    $endgroup$
    – bobbym
    May 16 '14 at 19:51










  • $begingroup$
    Why are you implementing this algorithm for a dense matrix?
    $endgroup$
    – Pawel Kowal
    Jul 14 '16 at 10:01
















$begingroup$
Where does your matrix A come from? Is it symmetric? Clearly arbitrarily "transforming" the matrix to meet some criteria may change the problem you are solving -- so if you tell me more about the problem I can make some suggestions.
$endgroup$
– RRL
May 16 '14 at 19:21






$begingroup$
Where does your matrix A come from? Is it symmetric? Clearly arbitrarily "transforming" the matrix to meet some criteria may change the problem you are solving -- so if you tell me more about the problem I can make some suggestions.
$endgroup$
– RRL
May 16 '14 at 19:21














$begingroup$
A is not symmetric matrix. I am going to implement for abitrary matrix
$endgroup$
– torayeff
May 16 '14 at 19:38






$begingroup$
A is not symmetric matrix. I am going to implement for abitrary matrix
$endgroup$
– torayeff
May 16 '14 at 19:38






1




1




$begingroup$
@torayeff you left out the fact that it will often converge without those conditions. Usually, if the system was small I would manually work it till there was as much diagonal dominance as possible.
$endgroup$
– bobbym
May 16 '14 at 19:51




$begingroup$
@torayeff you left out the fact that it will often converge without those conditions. Usually, if the system was small I would manually work it till there was as much diagonal dominance as possible.
$endgroup$
– bobbym
May 16 '14 at 19:51












$begingroup$
Why are you implementing this algorithm for a dense matrix?
$endgroup$
– Pawel Kowal
Jul 14 '16 at 10:01




$begingroup$
Why are you implementing this algorithm for a dense matrix?
$endgroup$
– Pawel Kowal
Jul 14 '16 at 10:01










1 Answer
1






active

oldest

votes


















0












$begingroup$

I have found solution for my question and implemented it in C++:



/*

 * www.twitter.com/torayeff

 * 

 * Gauss-Seidel method:

 * http://math.semestr.ru/optim/methodzeidel.php

 * http://en.wikipedia.org/wiki/Gauss–Seidel_method

 * http://ru.wikipedia.org/wiki/Метод_Гаусса_—_Зейделя

 * 

 * To solve A*x = b transform to 

 * A(t)*A*x = A(t)*b <---> C*x = d 

 * (A(t) transpose of matrix A)

 * (in this state, Gauss-Seidel method always congerges)

*/

#include <iostream>

#include <cstdio>

#include <cmath>

using namespace std;



#define MAXN 100



int N; //matrix dimension

double eps = 0.001;

double err = eps;

double A[MAXN][MAXN];

double b[MAXN][MAXN];

double At[MAXN][MAXN];

double C[MAXN][MAXN];

double d[MAXN][MAXN];



//convergence check

bool converge(double *xk, double *xkp)

{

    double norm = 0;

    for(int i=0; i<N; i++) 

    {

      norm += (xk[i] - xkp[i])*(xk[i] - xkp[i]);

    }

    if(sqrt(norm)>=eps)

      return false;

    err = eps;

    return true;

}





int main()

{

    printf("Input dimension N: ");

    scanf("%d", &N);



    for(int i=0; i<N; i++)

    {

        for(int j=0; j<N; j++)

        {

            double tmp;

            printf("A[%d][%d] = ", i+1, j+1);

            scanf("%lf", &tmp);

            A[i][j] = tmp;

        }

    }



    for(int i=0; i<N; i++)

    {

        double tmp;

        printf("b[%d] = ", i+1);

        scanf("%lf", &tmp);

        b[i][0] = tmp;

    }





    //transpose A

    for(int i=0; i<N; i++)

    {

        for(int j=0; j<N; j++)

        {

            At[i][j] = A[j][i];

        }

    }



    //multiply At*A = C

    for(int i=0; i<N; i++)

    {

        for(int j=0; j<N; j++)

        {

            C[i][j] = 0;

            for(int k=0; k<N; k++)

            {

                C[i][j] = C[i][j] + At[i][k]*A[k][j];

            }

        }

    }



    //multiply At*b = d

    for(int i=0; i<N; i++)

    {

        for(int j=0; j<1; j++)

        {

            d[i][j] = 0;

            for(int k=0; k<N; k++)

            {

                d[i][j] = d[i][j] + At[i][k]*b[k][j];

            }

        }

    }



    //Solve Gauss-Seidel method for C*x = d

    double x[N]; //current values

    double p[N]; //previous values



    for(int i=0; i<N; i++)

    {

        x[i] = 0;

        p[i] = 0;

    }



    do

    {

        for(int i = 0; i<N; i++)

            p[i] = x[i];



        for(int i=0; i<N; i++)

        {

            double v = 0.0;

            for(int j=0; j<i; j++)

            {

                double cij;

                if(i==j) cij = 0;

                else cij = -1.0*C[i][j]/C[i][i];

                v += cij*x[j];

            }



            for(int j=i; j<N; j++)

            {

                double cij;

                if(i==j) cij = 0;

                else cij = -1.0*C[i][j]/C[i][i];

                v += cij*p[j];

            }

            v +=  1.0*d[i][0]/C[i][i];

            x[i] = v;

        }



    }while (!converge(x, p));



    //print solution

    printf("Err. val.: %lfn", err);

    for(int i=0; i<N; i++)

    {

        printf("%lf ", x[i]);

    }



    return 0;

}





share|cite|improve this answer









$endgroup$













    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f798300%2fgauss-seidel-method-convergence-algorithm%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    0












    $begingroup$

    I have found solution for my question and implemented it in C++:



    /*
    
 * www.twitter.com/torayeff
    
 * 
    
 * Gauss-Seidel method:
    
 * http://math.semestr.ru/optim/methodzeidel.php
    
 * http://en.wikipedia.org/wiki/Gauss–Seidel_method
    
 * http://ru.wikipedia.org/wiki/Метод_Гаусса_—_Зейделя
    
 * 
    
 * To solve A*x = b transform to 
    
 * A(t)*A*x = A(t)*b <---> C*x = d 
    
 * (A(t) transpose of matrix A)
    
 * (in this state, Gauss-Seidel method always congerges)
    
*/
    
#include <iostream>
    
#include <cstdio>
    
#include <cmath>
    
using namespace std;
    

    
#define MAXN 100
    

    
int N; //matrix dimension
    
double eps = 0.001;
    
double err = eps;
    
double A[MAXN][MAXN];
    
double b[MAXN][MAXN];
    
double At[MAXN][MAXN];
    
double C[MAXN][MAXN];
    
double d[MAXN][MAXN];
    

    
//convergence check
    
bool converge(double *xk, double *xkp)
    
{
    
    double norm = 0;
    
    for(int i=0; i<N; i++) 
    
    {
    
      norm += (xk[i] - xkp[i])*(xk[i] - xkp[i]);
    
    }
    
    if(sqrt(norm)>=eps)
    
      return false;
    
    err = eps;
    
    return true;
    
}
    

    

    
int main()
    
{
    
    printf("Input dimension N: ");
    
    scanf("%d", &N);
    

    
    for(int i=0; i<N; i++)
    
    {
    
        for(int j=0; j<N; j++)
    
        {
    
            double tmp;
    
            printf("A[%d][%d] = ", i+1, j+1);
    
            scanf("%lf", &tmp);
    
            A[i][j] = tmp;
    
        }
    
    }
    

    
    for(int i=0; i<N; i++)
    
    {
    
        double tmp;
    
        printf("b[%d] = ", i+1);
    
        scanf("%lf", &tmp);
    
        b[i][0] = tmp;
    
    }
    

    

    
    //transpose A
    
    for(int i=0; i<N; i++)
    
    {
    
        for(int j=0; j<N; j++)
    
        {
    
            At[i][j] = A[j][i];
    
        }
    
    }
    

    
    //multiply At*A = C
    
    for(int i=0; i<N; i++)
    
    {
    
        for(int j=0; j<N; j++)
    
        {
    
            C[i][j] = 0;
    
            for(int k=0; k<N; k++)
    
            {
    
                C[i][j] = C[i][j] + At[i][k]*A[k][j];
    
            }
    
        }
    
    }
    

    
    //multiply At*b = d
    
    for(int i=0; i<N; i++)
    
    {
    
        for(int j=0; j<1; j++)
    
        {
    
            d[i][j] = 0;
    
            for(int k=0; k<N; k++)
    
            {
    
                d[i][j] = d[i][j] + At[i][k]*b[k][j];
    
            }
    
        }
    
    }
    

    
    //Solve Gauss-Seidel method for C*x = d
    
    double x[N]; //current values
    
    double p[N]; //previous values
    

    
    for(int i=0; i<N; i++)
    
    {
    
        x[i] = 0;
    
        p[i] = 0;
    
    }
    

    
    do
    
    {
    
        for(int i = 0; i<N; i++)
    
            p[i] = x[i];
    

    
        for(int i=0; i<N; i++)
    
        {
    
            double v = 0.0;
    
            for(int j=0; j<i; j++)
    
            {
    
                double cij;
    
                if(i==j) cij = 0;
    
                else cij = -1.0*C[i][j]/C[i][i];
    
                v += cij*x[j];
    
            }
    

    
            for(int j=i; j<N; j++)
    
            {
    
                double cij;
    
                if(i==j) cij = 0;
    
                else cij = -1.0*C[i][j]/C[i][i];
    
                v += cij*p[j];
    
            }
    
            v +=  1.0*d[i][0]/C[i][i];
    
            x[i] = v;
    
        }
    

    
    }while (!converge(x, p));
    

    
    //print solution
    
    printf("Err. val.: %lfn", err);
    
    for(int i=0; i<N; i++)
    
    {
    
        printf("%lf ", x[i]);
    
    }
    

    
    return 0;
    
}





    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      I have found solution for my question and implemented it in C++:



      /*
      
 * www.twitter.com/torayeff
      
 * 
      
 * Gauss-Seidel method:
      
 * http://math.semestr.ru/optim/methodzeidel.php
      
 * http://en.wikipedia.org/wiki/Gauss–Seidel_method
      
 * http://ru.wikipedia.org/wiki/Метод_Гаусса_—_Зейделя
      
 * 
      
 * To solve A*x = b transform to 
      
 * A(t)*A*x = A(t)*b <---> C*x = d 
      
 * (A(t) transpose of matrix A)
      
 * (in this state, Gauss-Seidel method always congerges)
      
*/
      
#include <iostream>
      
#include <cstdio>
      
#include <cmath>
      
using namespace std;
      

      
#define MAXN 100
      

      
int N; //matrix dimension
      
double eps = 0.001;
      
double err = eps;
      
double A[MAXN][MAXN];
      
double b[MAXN][MAXN];
      
double At[MAXN][MAXN];
      
double C[MAXN][MAXN];
      
double d[MAXN][MAXN];
      

      
//convergence check
      
bool converge(double *xk, double *xkp)
      
{
      
    double norm = 0;
      
    for(int i=0; i<N; i++) 
      
    {
      
      norm += (xk[i] - xkp[i])*(xk[i] - xkp[i]);
      
    }
      
    if(sqrt(norm)>=eps)
      
      return false;
      
    err = eps;
      
    return true;
      
}
      

      

      
int main()
      
{
      
    printf("Input dimension N: ");
      
    scanf("%d", &N);
      

      
    for(int i=0; i<N; i++)
      
    {
      
        for(int j=0; j<N; j++)
      
        {
      
            double tmp;
      
            printf("A[%d][%d] = ", i+1, j+1);
      
            scanf("%lf", &tmp);
      
            A[i][j] = tmp;
      
        }
      
    }
      

      
    for(int i=0; i<N; i++)
      
    {
      
        double tmp;
      
        printf("b[%d] = ", i+1);
      
        scanf("%lf", &tmp);
      
        b[i][0] = tmp;
      
    }
      

      

      
    //transpose A
      
    for(int i=0; i<N; i++)
      
    {
      
        for(int j=0; j<N; j++)
      
        {
      
            At[i][j] = A[j][i];
      
        }
      
    }
      

      
    //multiply At*A = C
      
    for(int i=0; i<N; i++)
      
    {
      
        for(int j=0; j<N; j++)
      
        {
      
            C[i][j] = 0;
      
            for(int k=0; k<N; k++)
      
            {
      
                C[i][j] = C[i][j] + At[i][k]*A[k][j];
      
            }
      
        }
      
    }
      

      
    //multiply At*b = d
      
    for(int i=0; i<N; i++)
      
    {
      
        for(int j=0; j<1; j++)
      
        {
      
            d[i][j] = 0;
      
            for(int k=0; k<N; k++)
      
            {
      
                d[i][j] = d[i][j] + At[i][k]*b[k][j];
      
            }
      
        }
      
    }
      

      
    //Solve Gauss-Seidel method for C*x = d
      
    double x[N]; //current values
      
    double p[N]; //previous values
      

      
    for(int i=0; i<N; i++)
      
    {
      
        x[i] = 0;
      
        p[i] = 0;
      
    }
      

      
    do
      
    {
      
        for(int i = 0; i<N; i++)
      
            p[i] = x[i];
      

      
        for(int i=0; i<N; i++)
      
        {
      
            double v = 0.0;
      
            for(int j=0; j<i; j++)
      
            {
      
                double cij;
      
                if(i==j) cij = 0;
      
                else cij = -1.0*C[i][j]/C[i][i];
      
                v += cij*x[j];
      
            }
      

      
            for(int j=i; j<N; j++)
      
            {
      
                double cij;
      
                if(i==j) cij = 0;
      
                else cij = -1.0*C[i][j]/C[i][i];
      
                v += cij*p[j];
      
            }
      
            v +=  1.0*d[i][0]/C[i][i];
      
            x[i] = v;
      
        }
      

      
    }while (!converge(x, p));
      

      
    //print solution
      
    printf("Err. val.: %lfn", err);
      
    for(int i=0; i<N; i++)
      
    {
      
        printf("%lf ", x[i]);
      
    }
      

      
    return 0;
      
}





      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        I have found solution for my question and implemented it in C++:



        /*
        
 * www.twitter.com/torayeff
        
 * 
        
 * Gauss-Seidel method:
        
 * http://math.semestr.ru/optim/methodzeidel.php
        
 * http://en.wikipedia.org/wiki/Gauss–Seidel_method
        
 * http://ru.wikipedia.org/wiki/Метод_Гаусса_—_Зейделя
        
 * 
        
 * To solve A*x = b transform to 
        
 * A(t)*A*x = A(t)*b <---> C*x = d 
        
 * (A(t) transpose of matrix A)
        
 * (in this state, Gauss-Seidel method always congerges)
        
*/
        
#include <iostream>
        
#include <cstdio>
        
#include <cmath>
        
using namespace std;
        

        
#define MAXN 100
        

        
int N; //matrix dimension
        
double eps = 0.001;
        
double err = eps;
        
double A[MAXN][MAXN];
        
double b[MAXN][MAXN];
        
double At[MAXN][MAXN];
        
double C[MAXN][MAXN];
        
double d[MAXN][MAXN];
        

        
//convergence check
        
bool converge(double *xk, double *xkp)
        
{
        
    double norm = 0;
        
    for(int i=0; i<N; i++) 
        
    {
        
      norm += (xk[i] - xkp[i])*(xk[i] - xkp[i]);
        
    }
        
    if(sqrt(norm)>=eps)
        
      return false;
        
    err = eps;
        
    return true;
        
}
        

        

        
int main()
        
{
        
    printf("Input dimension N: ");
        
    scanf("%d", &N);
        

        
    for(int i=0; i<N; i++)
        
    {
        
        for(int j=0; j<N; j++)
        
        {
        
            double tmp;
        
            printf("A[%d][%d] = ", i+1, j+1);
        
            scanf("%lf", &tmp);
        
            A[i][j] = tmp;
        
        }
        
    }
        

        
    for(int i=0; i<N; i++)
        
    {
        
        double tmp;
        
        printf("b[%d] = ", i+1);
        
        scanf("%lf", &tmp);
        
        b[i][0] = tmp;
        
    }
        

        

        
    //transpose A
        
    for(int i=0; i<N; i++)
        
    {
        
        for(int j=0; j<N; j++)
        
        {
        
            At[i][j] = A[j][i];
        
        }
        
    }
        

        
    //multiply At*A = C
        
    for(int i=0; i<N; i++)
        
    {
        
        for(int j=0; j<N; j++)
        
        {
        
            C[i][j] = 0;
        
            for(int k=0; k<N; k++)
        
            {
        
                C[i][j] = C[i][j] + At[i][k]*A[k][j];
        
            }
        
        }
        
    }
        

        
    //multiply At*b = d
        
    for(int i=0; i<N; i++)
        
    {
        
        for(int j=0; j<1; j++)
        
        {
        
            d[i][j] = 0;
        
            for(int k=0; k<N; k++)
        
            {
        
                d[i][j] = d[i][j] + At[i][k]*b[k][j];
        
            }
        
        }
        
    }
        

        
    //Solve Gauss-Seidel method for C*x = d
        
    double x[N]; //current values
        
    double p[N]; //previous values
        

        
    for(int i=0; i<N; i++)
        
    {
        
        x[i] = 0;
        
        p[i] = 0;
        
    }
        

        
    do
        
    {
        
        for(int i = 0; i<N; i++)
        
            p[i] = x[i];
        

        
        for(int i=0; i<N; i++)
        
        {
        
            double v = 0.0;
        
            for(int j=0; j<i; j++)
        
            {
        
                double cij;
        
                if(i==j) cij = 0;
        
                else cij = -1.0*C[i][j]/C[i][i];
        
                v += cij*x[j];
        
            }
        

        
            for(int j=i; j<N; j++)
        
            {
        
                double cij;
        
                if(i==j) cij = 0;
        
                else cij = -1.0*C[i][j]/C[i][i];
        
                v += cij*p[j];
        
            }
        
            v +=  1.0*d[i][0]/C[i][i];
        
            x[i] = v;
        
        }
        

        
    }while (!converge(x, p));
        

        
    //print solution
        
    printf("Err. val.: %lfn", err);
        
    for(int i=0; i<N; i++)
        
    {
        
        printf("%lf ", x[i]);
        
    }
        

        
    return 0;
        
}





        share|cite|improve this answer









        $endgroup$



        I have found solution for my question and implemented it in C++:



        /*
        
 * www.twitter.com/torayeff
        
 * 
        
 * Gauss-Seidel method:
        
 * http://math.semestr.ru/optim/methodzeidel.php
        
 * http://en.wikipedia.org/wiki/Gauss–Seidel_method
        
 * http://ru.wikipedia.org/wiki/Метод_Гаусса_—_Зейделя
        
 * 
        
 * To solve A*x = b transform to 
        
 * A(t)*A*x = A(t)*b <---> C*x = d 
        
 * (A(t) transpose of matrix A)
        
 * (in this state, Gauss-Seidel method always congerges)
        
*/
        
#include <iostream>
        
#include <cstdio>
        
#include <cmath>
        
using namespace std;
        

        
#define MAXN 100
        

        
int N; //matrix dimension
        
double eps = 0.001;
        
double err = eps;
        
double A[MAXN][MAXN];
        
double b[MAXN][MAXN];
        
double At[MAXN][MAXN];
        
double C[MAXN][MAXN];
        
double d[MAXN][MAXN];
        

        
//convergence check
        
bool converge(double *xk, double *xkp)
        
{
        
    double norm = 0;
        
    for(int i=0; i<N; i++) 
        
    {
        
      norm += (xk[i] - xkp[i])*(xk[i] - xkp[i]);
        
    }
        
    if(sqrt(norm)>=eps)
        
      return false;
        
    err = eps;
        
    return true;
        
}
        

        

        
int main()
        
{
        
    printf("Input dimension N: ");
        
    scanf("%d", &N);
        

        
    for(int i=0; i<N; i++)
        
    {
        
        for(int j=0; j<N; j++)
        
        {
        
            double tmp;
        
            printf("A[%d][%d] = ", i+1, j+1);
        
            scanf("%lf", &tmp);
        
            A[i][j] = tmp;
        
        }
        
    }
        

        
    for(int i=0; i<N; i++)
        
    {
        
        double tmp;
        
        printf("b[%d] = ", i+1);
        
        scanf("%lf", &tmp);
        
        b[i][0] = tmp;
        
    }
        

        

        
    //transpose A
        
    for(int i=0; i<N; i++)
        
    {
        
        for(int j=0; j<N; j++)
        
        {
        
            At[i][j] = A[j][i];
        
        }
        
    }
        

        
    //multiply At*A = C
        
    for(int i=0; i<N; i++)
        
    {
        
        for(int j=0; j<N; j++)
        
        {
        
            C[i][j] = 0;
        
            for(int k=0; k<N; k++)
        
            {
        
                C[i][j] = C[i][j] + At[i][k]*A[k][j];
        
            }
        
        }
        
    }
        

        
    //multiply At*b = d
        
    for(int i=0; i<N; i++)
        
    {
        
        for(int j=0; j<1; j++)
        
        {
        
            d[i][j] = 0;
        
            for(int k=0; k<N; k++)
        
            {
        
                d[i][j] = d[i][j] + At[i][k]*b[k][j];
        
            }
        
        }
        
    }
        

        
    //Solve Gauss-Seidel method for C*x = d
        
    double x[N]; //current values
        
    double p[N]; //previous values
        

        
    for(int i=0; i<N; i++)
        
    {
        
        x[i] = 0;
        
        p[i] = 0;
        
    }
        

        
    do
        
    {
        
        for(int i = 0; i<N; i++)
        
            p[i] = x[i];
        

        
        for(int i=0; i<N; i++)
        
        {
        
            double v = 0.0;
        
            for(int j=0; j<i; j++)
        
            {
        
                double cij;
        
                if(i==j) cij = 0;
        
                else cij = -1.0*C[i][j]/C[i][i];
        
                v += cij*x[j];
        
            }
        

        
            for(int j=i; j<N; j++)
        
            {
        
                double cij;
        
                if(i==j) cij = 0;
        
                else cij = -1.0*C[i][j]/C[i][i];
        
                v += cij*p[j];
        
            }
        
            v +=  1.0*d[i][0]/C[i][i];
        
            x[i] = v;
        
        }
        

        
    }while (!converge(x, p));
        

        
    //print solution
        
    printf("Err. val.: %lfn", err);
        
    for(int i=0; i<N; i++)
        
    {
        
        printf("%lf ", x[i]);
        
    }
        

        
    return 0;
        
}






        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered May 17 '14 at 6:35









        torayefftorayeff

        1164




        1164






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid …



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f798300%2fgauss-seidel-method-convergence-algorithm%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            -

            Popular posts from this blog

            Bundesstraße 106

            Image
            Dieser Artikel beschreibt die Bundesstraße 106 in Deutschland. Zur gleichnamigen Straße in Österreich siehe Mölltal Straße. Vorlage:Infobox hochrangige Straße/Wartung/DE-B Bundesstraße 106 in Deutschland Karte Basisdaten Betreiber: Deutschland  Bundesrepublik Deutschland Straßenbeginn: Wismar ( 53° 54′  N , 11° 24′  O 53.900536 11.396875 ) Straßenende: Schwerin ( 53° 36′  N , 11° 24′  O 53.592785 11.404892 ) Gesamtlänge: 40,7 km Bundesland: Mecklenburg-Vorpommern Ausbauzustand: zweistreifig [1] Bundesstraße 106 in Schwerin (Umgehungsstraße) Straßenverlauf Land Mecklenburg-Vorpommern Landkreis Nordwestmecklenburg Ortsumgehung Wismar Wallensteingraben über   Dorf Mecklenburg Wallensteingraben Groß Stieten Bad Kleinen OT Niendorf Bahnstrecke Lübeck–Bad Kleinen Zickhusen Lübstorf Klein Trebbow OT Kirch Stück ...
            Read more

            Verónica Boquete

            Image
            Verónica Boquete im Trikot der Nationalmannschaft (2013) Personalia Name Verónica Boquete Giadans Geburtstag 9. April 1987 Geburtsort Santiago de Compostela, Spanien Größe 159 cm Position Mittelfeld / Sturm Juniorinnen Jahre Station 2001–2005 Xuventú Aguiño Frauen Jahre Station Spiele (Tore) 1 2005–2008 Prainsa Zaragoza 83 (40) 2008–2010 Espanyol Barcelona 53 (30) 2010 Buffalo Flash 9 0 (9) 2010 Chicago Red Stars 3 0 (1) 2010–2011 Espanyol Barcelona 26 (41) 2011 Philadelphia Independence 13 0 (5) 2011 Energija Woronesch 5 0 (1) 2012–2014 Tyresö FF 39 (14) 2014 Portland Thorns FC 15 0 (4) 2014–2015 1. FFC Frankfurt 23 0 (7) 2015–2016 FC Bayern München 9 0 (0) 2016–2018 Paris Saint-Germain 31 0 (8) 2018 Peking BG Phoenix 2019– Utah Royals FC 0 0 (0) Nationalmannschaft Jahre Auswahl ...
            Read more

            Ida-Boy-Ed-Garten

            Image
            Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich ...
            Read more