Changeset 1005
- Timestamp:
- 2015-06-10T06:24:33-07:00 (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/parse.lisp
r1004 r1005 75 75 is a number then convert it to a polynomial in N variables." 76 76 (if (numberp number-or-poly) 77 (make-poly-from-termlist (list (make-term (make-monom ial:dimension n) number-or-poly)))77 (make-poly-from-termlist (list (make-term (make-monom :dimension n) number-or-poly))) 78 78 number-or-poly)) 79 79 80 (defun $poly+ ( p q n order ring)80 (defun $poly+ (ring-and-order p q n) 81 81 "Add two polynomials P and Q, where each polynomial is either a 82 82 numeric constant or a polynomial in internal representation. If the 83 83 result is a number then convert it to a polynomial in N variables." 84 (poly + (convert-number p n) (convert-number q n) order ring))85 86 (defun $poly- ( p q n order ring)84 (poly-add ring-and-order (convert-number p n) (convert-number q n))) 85 86 (defun $poly- (ring-and-order p q n) 87 87 "Subtract two polynomials P and Q, where each polynomial is either a 88 88 numeric constant or a polynomial in internal representation. If the 89 89 result is a number then convert it to a polynomial in N variables." 90 (poly- (convert-number p n) (convert-number q n) order ring))91 92 (defun $minus-poly ( p n ring)90 (poly-sub ring-and-order (convert-number p n) (convert-number q n))) 91 92 (defun $minus-poly (ring p n) 93 93 "Negation of P is a polynomial is either a numeric constant or a 94 94 polynomial in internal representation. If the result is a number then 95 95 convert it to a polynomial in N variables." 96 ( minus-poly (convert-number p n) ring))96 (poly-uminus ring (convert-number p n))) 97 97 98 98 (defun $poly* (p q n order ring)
Note:
See TracChangeset
for help on using the changeset viewer.