- Timestamp:
- 2015-06-20T20:46:24-07:00 (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/polynomial.lisp
r2785 r2786 192 192 193 193 194 ;; Multiplication of polynomials 195 ;; Non-destructive version 196 (defun termlist-mul (ring-and-order p q 197 &aux (ring (ro-ring ring-and-order))) 198 (declare (ring-and-order ring-and-order)) 194 (defmethod multiply-by ((self poly) (other poly)) 199 195 (cond ((or (endp p) (endp q)) nil) ;p or q is 0 (represented by NIL) 200 ;; If p=p0+p1 and q=q0+q1 then p q=p0q0+p0q1+p1q196 ;; If p=p0+p1 and q=q0+q1 then p*q=p0*q0+p0*q1+p1*q 201 197 ((endp (cdr p)) 202 198 (term-times-termlist ring (car p) q))
Note:
See TracChangeset
for help on using the changeset viewer.