GAUSS-SEIDEL ALGORITHM
2016-08-23
0 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
THAT THE NUMBER OF ITERATIONS WAS EXCEEDED.
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
THAT THE NUMBER OF ITERATIONS WAS EXCEEDED.
fortran
Related Source Codes
Deform secondary development
0
0
no vote
unifiber-VUMAT
0
0
no vote
3D Hashin failure criterion subroutine, Umat, for
0
0
no vote
Godunov scheme for solving one-dimensional shallow
0
0
no vote
Riemann-Solver
0
0
no vote
No comment