GAUSS-SEIDEL ITERATAIVE TECHNIQUE ALGORITHM
2016-08-23
1 0 0
no vote
Other
Earn points
To solve Ax = b given an initial approximation x(0).
*
* INPUT: the number of equations and unknowns n; the entries
* A(I,J), 1<=I, J<=n, of the matrix A; the entries
* B(I), 1<=I<=n, of the inhomogeneous term b; the
* entries XO(I), 1<=I<=n, of x(0); tolerance TOL;
* maximum number of iterations N.
*
* OUTPUT: the approximate solution X(1),...,X(n) or a message
*
* INPUT: the number of equations and unknowns n; the entries
* A(I,J), 1<=I, J<=n, of the matrix A; the entries
* B(I), 1<=I<=n, of the inhomogeneous term b; the
* entries XO(I), 1<=I<=n, of x(0); tolerance TOL;
* maximum number of iterations N.
*
* OUTPUT: the approximate solution X(1),...,X(n) or a message
c++
赛德尔
技术
算法
Related Source Codes
Local Path Planning Algorithm - DWA Algorithm
0
0
no vote
Classic Interview Questions for Digital City Front
0
0
no vote
enDAQ-Shock-Data-Share-SRS-Blog
0
0
no vote
HDU-2553 N Queen Question
0
0
no vote
Calling chatGPT in a Windows application
0
0
no vote
No comment