uncondensed.global_entry(j) *
next_constraint->entries[q].second *
c->entries[p].second);
+
+ if (use_vectors == true)
+ for (unsigned int q=0; q!=next_constraint->entries.size(); ++q)
+ condensed_vector (new_line[next_constraint->entries[q].first])
+ -= uncondensed.global_entry(j) *
+ next_constraint->entries[q].second *
+ c->inhomogeneity;
};
// condense the vector
// row of the inhomogeneous constraint in
// the matrix with Gauss elimination
if (use_vectors == true)
- vec(column) -= entry->value() *
- lines[distribute[column]].inhomogeneity;
+ vec(row) -=
+ entry->value() * lines[distribute[column]].inhomogeneity;
// set old value to zero
entry->value() = 0.;
if (use_vectors == true)
vec(lines[distribute[row]].entries[p].first) -=
entry->value() * lines[distribute[row]].entries[p].second *
- lines[distribute[row]].inhomogeneity;
+ lines[distribute[column]].inhomogeneity;
}
// set old entry to correct
// row of the inhomogeneous constraint in
// the matrix with Gauss elimination
if (use_vectors == true)
- vec(global_col) -= entry->value() *
- lines[distribute[global_col]].inhomogeneity;
+ vec(row) -= entry->value() *
+ lines[distribute[global_col]].inhomogeneity;
entry->value() = 0.;
}