Changeset 97 for branches/f4grobner
- Timestamp:
- 2015-06-05T11:58:31-07:00 (10 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/grobner.lisp
r96 r97 30 30 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 31 31 32 (def mvar $poly_monomial_order '$lex32 (defvar $poly_monomial_order '$lex 33 33 "This switch controls which monomial order is used in polynomial 34 34 and Grobner basis calculations. If not set, LEX will be used") 35 35 36 (def mvar $poly_coefficient_ring '$expression_ring36 (defvar $poly_coefficient_ring '$expression_ring 37 37 "This switch indicates the coefficient ring of the polynomials 38 38 that will be used in grobner calculations. If not set, Maxima's … … 40 40 to RING_OF_INTEGERS if desired.") 41 41 42 (def mvar $poly_primary_elimination_order nil42 (defvar $poly_primary_elimination_order nil 43 43 "Name of the default order for eliminated variables in elimination-based functions. 44 44 If not set, LEX will be used.") 45 45 46 (def mvar $poly_secondary_elimination_order nil46 (defvar $poly_secondary_elimination_order nil 47 47 "Name of the default order for kept variables in elimination-based functions. 48 48 If not set, LEX will be used.") 49 49 50 (def mvar $poly_elimination_order nil50 (defvar $poly_elimination_order nil 51 51 "Name of the default elimination order used in elimination calculations. 52 52 If set, it overrides the settings in variables POLY_PRIMARY_ELIMINATION_ORDER … … 54 54 elimination order valid for the number of eliminated variables.") 55 55 56 (def mvar $poly_return_term_list nil56 (defvar $poly_return_term_list nil 57 57 "If set to T, all functions in this package will return each polynomial as a 58 58 list of terms in the current monomial order rather than a Maxima general expression.") 59 59 60 (def mvar $poly_grobner_debug nil60 (defvar $poly_grobner_debug nil 61 61 "If set to TRUE, produce debugging and tracing output.") 62 62 63 (def mvar $poly_grobner_algorithm '$buchberger63 (defvar $poly_grobner_algorithm '$buchberger 64 64 "The name of the algorithm used to find grobner bases.") 65 65 66 (def mvar $poly_top_reduction_only nil66 (defvar $poly_top_reduction_only nil 67 67 "If not FALSE, use top reduction only whenever possible. 68 68 Top reduction means that division algorithm stops after the first reduction.")
Note:
See TracChangeset
for help on using the changeset viewer.