23 #include "grass/N_pde.h"
53 double tmpval = 0.0,
s = 0.0;
56 G_debug(2,
"N_les_pivot_create: swap rows if needed");
57 for (i = 0; i < les->
rows; i++) {
58 max = fabs(les->
A[i][i]);
60 for (j = i; j < les->
rows; j++) {
62 for (k = i; k < les->
rows; k++) {
63 s += fabs(les->
A[j][i]);
66 if (max < fabs(les->
A[j][i]) /
s) {
67 max = fabs(les->
A[j][i]);
78 G_debug(4,
"swap row %i with row %i", i, number);
80 tmpval = les->
b[number];
81 les->
b[number] = les->
b[i];
84 link = les->
A[number];
85 les->
A[number] = les->
A[i];
int N_les_pivot_create(N_les *les)
Optimize the structure of the linear equation system with a common pivoting strategy.
int G_warning(const char *msg,...)
Print a warning message to stderr.
int G_debug(int level, const char *msg,...)
Print debugging message.
The linear equation system (les) structure.