Add Markowitz-ordered Gaussian elimination algorithm.

[ginac.git] / ginac / flags.h

diff --git a/ginac/flags.h b/ginac/flags.h
index c97229af5386952fb4c8ae77aa629971cc1b6a1f..cebc3fd449966d647c6e745081f71bd286ca956b 100644 (file)
--- a/ginac/flags.h
+++ b/ginac/flags.h
@@ -182,7 +182,13 @@ public:
                 *  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
+                *  selection pivots that minimize fill-in. Much faster than the
+                *  methods above for large sparse matrices, marginally slower
+                *  than Gaussian elimination otherwise. */
+               markowitz
        };
 };