* linear systems. In contrast to division-free elimination it only
* has a linear expression swell. For two-dimensional systems, the
* two algorithms are equivalent, however. */
- bareiss
+ bareiss,
+ /** Markowitz-ordered Gaussian elimination. Same as the usual
+ * Gaussian elimination, but with additional effort spent on
+ * selecting pivots that minimize fill-in. Faster than the
+ * methods above for large sparse matrices (particularly with
+ * symbolic coefficients), otherwise slightly slower than
+ * Gaussian elimination.
+ */
+ markowitz
};
};