- Timestamp:
- 2015-06-02T00:12:20-07:00 (10 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/f4-matrix.lisp
r39 r40 30 30 ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 31 31 32 (defun normal-form-step (ring fl p r c division-count32 (defun f4-normal-form-step (ring fl p r c division-count 33 33 &aux (g (find (poly-lm p) fl 34 34 :test #'monom-divisible-by-p … … 55 55 56 56 ;; Merge it sometime with poly-pseudo-divide 57 (defun normal-form (ring f fl &optional (top-reduction-only $poly_top_reduction_only))57 (defun f4-normal-form (ring f fl &optional (top-reduction-only $poly_top_reduction_only)) 58 58 ;; Loop invariant: c*f0=sum ai*fi+r+f, where f0 is the initial value of f 59 59 #+grobner-check(when (null fl) (warn "normal-form: empty divisor list.")) … … 73 73 (type poly r)) 74 74 (multiple-value-setq (f r c division-count) 75 ( normal-form-step ring fl f r c division-count))))75 (f4-normal-form-step ring fl f r c division-count))))
Note:
See TracChangeset
for help on using the changeset viewer.