Changeset 1057 for branches/f4grobner

Timestamp:

2015-06-10T08:56:56-07:00 (10 years ago)

Author:

Marek Rychlik

Message:

* empty log message *

File:

• branches/f4grobner/.junk/poly-eval.lisp (modified) (1 diff)

branches/f4grobner/.junk/poly-eval.lisp

@@ +1 @@
+(defun convert-number (number-or-poly n)
+  "Returns NUMBER-OR-POLY, if it is a polynomial. If it is a number,
+it converts it to the constant monomial in N variables. If the result
+is a number then convert it to a polynomial in N variables."
+  (if (numberp number-or-poly)
+      (make-poly-from-termlist (list (make-term (make-monom :dimension n) number-or-poly)))
+      number-or-poly))
+
+(defun $poly+ (ring-and-order p q n)
+  "Add two polynomials P and Q, where each polynomial is either a
+numeric constant or a polynomial in internal representation. If the
+result is a number then convert it to a polynomial in N variables."
+  (poly-add ring-and-order (convert-number p n) (convert-number q n)))
+
+(defun $poly- (ring-and-order p q n)
+  "Subtract two polynomials P and Q, where each polynomial is either a
+numeric constant or a polynomial in internal representation. If the
+result is a number then convert it to a polynomial in N variables."
+  (poly-sub ring-and-order (convert-number p n) (convert-number q n)))
+
+(defun $minus-poly (ring p n)
+  "Negation of P is a polynomial is either a numeric constant or a
+polynomial in internal representation. If the result is a number then
+convert it to a polynomial in N variables."
+  (poly-uminus ring (convert-number p n)))
+
+(defun $poly* (ring-and-order p q n)
+  "Multiply two polynomials P and Q, where each polynomial is either a
+numeric constant or a polynomial in internal representation. If the
+result is a number then convert it to a polynomial in N variables."
+  (poly-mul ring-and-order (convert-number p n) (convert-number q n)))
+
+(defun $poly/ (ring p q)
+  "Divide a polynomials P which is either a numeric constant or a
+polynomial in internal representation, by a number Q."
+  (if (numberp p)
+      (common-lisp:/ p q)
+      (scalar-times-poly ring (common-lisp:/ q) p)))
+    
+(defun $poly-expt (ring-and-order p l n)
+  "Raise polynomial P, which is a polynomial in internal
+representation or a numeric constant, to power L. If P is a number,
+convert the result to a polynomial in N variables."
+  (poly-expt ring-and-order (convert-number p n) l))
+
+
 (defun variable-basis (ring n &aux (basis (make-list n)))
   "Generate a list of polynomials X[i], i=0,1,...,N-1."