close Warning: Can't synchronize with repository "(default)" (The repository directory has changed, you should resynchronize the repository with: trac-admin $ENV repository resync '(default)'). Look in the Trac log for more information.

source: branches/f4grobner/polynomial.lisp@ 3368

Last change on this file since 3368 was 3350, checked in by Marek Rychlik, 9 years ago

* empty log message *

File size: 15.3 KB
Line 
1;;; -*- Mode: Lisp -*-
2;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
3;;;
4;;; Copyright (C) 1999, 2002, 2009, 2015 Marek Rychlik <rychlik@u.arizona.edu>
5;;;
6;;; This program is free software; you can redistribute it and/or modify
7;;; it under the terms of the GNU General Public License as published by
8;;; the Free Software Foundation; either version 2 of the License, or
9;;; (at your option) any later version.
10;;;
11;;; This program is distributed in the hope that it will be useful,
12;;; but WITHOUT ANY WARRANTY; without even the implied warranty of
13;;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14;;; GNU General Public License for more details.
15;;;
16;;; You should have received a copy of the GNU General Public License
17;;; along with this program; if not, write to the Free Software
18;;; Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
19;;;
20;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
21
22(defpackage "POLYNOMIAL"
23 (:use :cl :utils :ring :monom :order :term)
24 (:export "POLY"
25 "POLY-DIMENSION"
26 "POLY-TERMLIST"
27 "POLY-TERM-ORDER"
28 "CHANGE-TERM-ORDER"
29 "STANDARD-EXTENSION"
30 "STANDARD-EXTENSION-1"
31 "STANDARD-SUM"
32 "SATURATION-EXTENSION"
33 "ALIST->POLY")
34 (:documentation "Implements polynomials."))
35
36(in-package :polynomial)
37
38(proclaim '(optimize (speed 3) (space 0) (safety 0) (debug 0)))
39
40(defclass poly ()
41 ((dimension :initform nil
42 :initarg :dimension
43 :accessor poly-dimension
44 :documentation "Shared dimension of all terms, the number of variables")
45 (termlist :initform nil :initarg :termlist :accessor poly-termlist
46 :documentation "List of terms.")
47 (order :initform #'lex> :initarg :order :accessor poly-term-order
48 :documentation "Monomial/term order."))
49 (:default-initargs :dimension nil :termlist nil :order #'lex>)
50 (:documentation "A polynomial with a list of terms TERMLIST, ordered
51according to term order ORDER, which defaults to LEX>."))
52
53(defmethod print-object ((self poly) stream)
54 (print-unreadable-object (self stream :type t :identity t)
55 (with-accessors ((dimension poly-dimension)
56 (termlist poly-termlist)
57 (order poly-term-order))
58 self
59 (format stream "DIMENSION=~A TERMLIST=~A ORDER=~A"
60 dimension termlist order))))
61
62(defgeneric change-term-order (self other)
63 (:documentation "Change term order of SELF to the term order of OTHER.")
64 (:method ((self poly) (other poly))
65 (unless (eq (poly-term-order self) (poly-term-order other))
66 (setf (poly-termlist self) (sort (poly-termlist self) (poly-term-order other))
67 (poly-term-order self) (poly-term-order other)))
68 self))
69
70(defun alist->poly (alist &aux (poly (make-instance 'poly)))
71 "It reads polynomial from an alist formatted as ( ... (exponents . coeff) ...).
72It can be used to enter simple polynomials by hand, e.g the polynomial
73in two variables, X and Y, given in standard notation as:
74
75 3*X^2*Y^3+2*Y+7
76
77can be entered as
78(ALIST->POLY '(((2 3) . 3) ((0 1) . 2) ((0 0) . 7))).
79
80NOTE: The primary use is for low-level debugging of the package."
81 (dolist (x alist poly)
82 (insert-item poly (make-instance 'term :exponents (car x) :coeff (cdr x)))))
83
84
85(defmethod update-instance-for-different-class :after ((old term) (new poly) &key)
86 "Converts OLD of class TERM to a NEW of class POLY, by making it into a 1-element TERMLIST."
87 (reinitialize-instance new
88 :dimension (monom-dimension old)
89 :termlist (list old)))
90
91(defmethod r-equalp ((self poly) (other poly))
92 "POLY instances are R-EQUALP if they have the same
93order and if all terms are R-EQUALP."
94 (and (every #'r-equalp (poly-termlist self) (poly-termlist other))
95 (eq (poly-term-order self) (poly-term-order other))))
96
97(defmethod insert-item ((self poly) (item term))
98 (cond ((null (poly-dimension self))
99 (setf (poly-dimension self) (monom-dimension item)))
100 (t (assert (= (poly-dimension self) (monom-dimension item)))))
101 (push item (poly-termlist self))
102 self)
103
104(defmethod append-item ((self poly) (item term))
105 (cond ((null (poly-dimension self))
106 (setf (poly-dimension self) (monom-dimension item)))
107 (t (assert (= (poly-dimension self) (monom-dimension item)))))
108 (setf (cdr (last (poly-termlist self))) (list item))
109 self)
110
111;; Leading term
112(defgeneric leading-term (object)
113 (:method ((self poly))
114 (car (poly-termlist self)))
115 (:documentation "The leading term of a polynomial, or NIL for zero polynomial."))
116
117;; Second term
118(defgeneric second-leading-term (object)
119 (:method ((self poly))
120 (cadar (poly-termlist self)))
121 (:documentation "The second leading term of a polynomial, or NIL for a polynomial with at most one term."))
122
123;; Leading coefficient
124(defgeneric leading-coefficient (object)
125 (:method ((self poly))
126 (scalar-coeff (leading-term self)))
127 (:documentation "The leading coefficient of a polynomial. It signals error for a zero polynomial."))
128
129;; Second coefficient
130(defgeneric second-leading-coefficient (object)
131 (:method ((self poly))
132 (scalar-coeff (second-leading-term self)))
133 (:documentation "The second leading coefficient of a polynomial. It
134 signals error for a polynomial with at most one term."))
135
136;; Testing for a zero polynomial
137(defmethod r-zerop ((self poly))
138 (null (poly-termlist self)))
139
140;; The number of terms
141(defmethod r-length ((self poly))
142 (length (poly-termlist self)))
143
144(defmethod multiply-by ((self poly) (other monom))
145 (mapc #'(lambda (term) (multiply-by term other))
146 (poly-termlist self))
147 self)
148
149(defmethod multiply-by ((self poly) (other term))
150 (mapc #'(lambda (term) (multiply-by term other))
151 (poly-termlist self))
152 self)
153
154(defmethod multiply-by ((self poly) (other scalar))
155 (mapc #'(lambda (term) (multiply-by term other))
156 (poly-termlist self))
157 self)
158
159
160(defmacro fast-add/subtract (p q order-fn add/subtract-fn uminus-fn)
161 "Return an expression which will efficiently adds/subtracts two
162polynomials, P and Q. The addition/subtraction of coefficients is
163performed by calling ADD/SUBTRACT-METHOD-NAME. If UMINUS-METHOD-NAME
164is supplied, it is used to negate the coefficients of Q which do not
165have a corresponding coefficient in P. The code implements an
166efficient algorithm to add two polynomials represented as sorted lists
167of terms. The code destroys both arguments, reusing the terms to build
168the result."
169 `(macrolet ((lc (x) `(scalar-coeff (car ,x))))
170 (do ((p ,p)
171 (q ,q)
172 r)
173 ((or (endp p) (endp q))
174 ;; NOTE: R contains the result in reverse order. Can it
175 ;; be more efficient to produce the terms in correct order?
176 (unless (endp q)
177 ;; Upon subtraction, we must change the sign of
178 ;; all coefficients in q
179 ,@(when uminus-fn
180 `((mapc #'(lambda (x) (setf x (funcall ,uminus-fn x))) q)))
181 (setf r (nreconc r q)))
182 r)
183 (multiple-value-bind
184 (greater-p equal-p)
185 (funcall ,order-fn (car p) (car q))
186 (cond
187 (greater-p
188 (rotatef (cdr p) r p)
189 )
190 (equal-p
191 (let ((s (funcall ,add/subtract-fn (lc p) (lc q))))
192 (cond
193 ((r-zerop s)
194 (setf p (cdr p))
195 )
196 (t
197 (setf (lc p) s)
198 (rotatef (cdr p) r p))))
199 (setf q (cdr q))
200 )
201 (t
202 ;;Negate the term of Q if UMINUS provided, signallig
203 ;;that we are doing subtraction
204 ,(when uminus-fn
205 `(setf (lc q) (funcall ,uminus-fn (lc q))))
206 (rotatef (cdr q) r q)))))))
207
208
209(defmacro def-add/subtract-method (add/subtract-method-name
210 uminus-method-name
211 &optional
212 (doc-string nil doc-string-supplied-p))
213 "This macro avoids code duplication for two similar operations: ADD-TO and SUBTRACT-FROM."
214 `(defmethod ,add/subtract-method-name ((self poly) (other poly))
215 ,@(when doc-string-supplied-p `(,doc-string))
216 ;; Ensure orders are compatible
217 (change-term-order other self)
218 (setf (poly-termlist self) (fast-add/subtract
219 (poly-termlist self) (poly-termlist other)
220 (poly-term-order self)
221 #',add/subtract-method-name
222 ,(when uminus-method-name `(function ,uminus-method-name))))
223 self))
224
225(eval-when (:compile-toplevel :load-toplevel :execute)
226
227 (def-add/subtract-method add-to nil
228 "Adds to polynomial SELF another polynomial OTHER.
229This operation destructively modifies both polynomials.
230The result is stored in SELF. This implementation does
231no consing, entirely reusing the sells of SELF and OTHER.")
232
233 (def-add/subtract-method subtract-from unary-minus
234 "Subtracts from polynomial SELF another polynomial OTHER.
235This operation destructively modifies both polynomials.
236The result is stored in SELF. This implementation does
237no consing, entirely reusing the sells of SELF and OTHER.")
238 )
239
240(defmethod unary-minus ((self poly))
241 "Destructively modifies the coefficients of the polynomial SELF,
242by changing their sign."
243 (mapc #'unary-minus (poly-termlist self))
244 self)
245
246(defun add-termlists (p q order-fn)
247 "Destructively adds two termlists P and Q ordered according to ORDER-FN."
248 (fast-add/subtract p q order-fn #'add-to nil))
249
250(defmacro multiply-term-by-termlist-dropping-zeros (term termlist
251 &optional (reverse-arg-order-P nil))
252 "Multiplies term TERM by a list of term, TERMLIST.
253Takes into accound divisors of zero in the ring, by
254deleting zero terms. Optionally, if REVERSE-ARG-ORDER-P
255is T, change the order of arguments; this may be important
256if we extend the package to non-commutative rings."
257 `(mapcan #'(lambda (other-term)
258 (let ((prod (r*
259 ,@(cond
260 (reverse-arg-order-p
261 `(other-term ,term))
262 (t
263 `(,term other-term))))))
264 (cond
265 ((r-zerop prod) nil)
266 (t (list prod)))))
267 ,termlist))
268
269(defun multiply-termlists (p q order-fn)
270 "A version of polynomial multiplication, operating
271directly on termlists."
272 (cond
273 ((or (endp p) (endp q))
274 ;;p or q is 0 (represented by NIL)
275 nil)
276 ;; If p= p0+p1 and q=q0+q1 then p*q=p0*q0+p0*q1+p1*q
277 ((endp (cdr p))
278 (multiply-term-by-termlist-dropping-zeros (car p) q))
279 ((endp (cdr q))
280 (multiply-term-by-termlist-dropping-zeros (car q) p t))
281 (t
282 (cons (r* (car p) (car q))
283 (add-termlists
284 (multiply-term-by-termlist-dropping-zeros (car p) (cdr q))
285 (multiply-termlists (cdr p) q order-fn)
286 order-fn)))))
287
288(defmethod multiply-by ((self poly) (other poly))
289 (change-term-order other self)
290 (setf (poly-termlist self) (multiply-termlists (poly-termlist self)
291 (poly-termlist other)
292 (poly-term-order self)))
293 self)
294
295(defmethod r* ((poly1 poly) (poly2 poly))
296 "Non-destructively multiply POLY1 by POLY2."
297 (multiply-by (copy-instance POLY1) (copy-instance POLY2)))
298
299(defmethod left-tensor-product-by ((self poly) (other term))
300 (setf (poly-termlist self)
301 (mapcan #'(lambda (term)
302 (let ((prod (left-tensor-product-by term other)))
303 (cond
304 ((r-zerop prod) nil)
305 (t (list prod)))))
306 (poly-termlist self)))
307 self)
308
309(defmethod right-tensor-product-by ((self poly) (other term))
310 (setf (poly-termlist self)
311 (mapcan #'(lambda (term)
312 (let ((prod (right-tensor-product-by term other)))
313 (cond
314 ((r-zerop prod) nil)
315 (t (list prod)))))
316 (poly-termlist self)))
317 self)
318
319(defmethod left-tensor-product-by ((self poly) (other monom))
320 (setf (poly-termlist self)
321 (mapcan #'(lambda (term)
322 (let ((prod (left-tensor-product-by term other)))
323 (cond
324 ((r-zerop prod) nil)
325 (t (list prod)))))
326 (poly-termlist self)))
327 (incf (poly-dimension self) (monom-dimension other))
328 self)
329
330(defmethod right-tensor-product-by ((self poly) (other monom))
331 (setf (poly-termlist self)
332 (mapcan #'(lambda (term)
333 (let ((prod (right-tensor-product-by term other)))
334 (cond
335 ((r-zerop prod) nil)
336 (t (list prod)))))
337 (poly-termlist self)))
338 (incf (poly-dimension self) (monom-dimension other))
339 self)
340
341
342(defun standard-extension (plist &aux (k (length plist)) (i 0))
343 "Calculate [U1*P1,U2*P2,...,UK*PK], where PLIST=[P1,P2,...,PK]
344is a list of polynomials. Destructively modifies PLIST elements."
345 (mapc #'(lambda (poly)
346 (left-tensor-product-by
347 poly
348 (prog1
349 (make-monom-variable k i)
350 (incf i))))
351 plist))
352
353(defun standard-extension-1 (plist
354 &aux
355 (plist (standard-extension plist))
356 (nvars (poly-dimension (car plist))))
357 "Calculate [U1*P1-1,U2*P2-1,...,UK*PK-1], where PLIST=[P1,P2,...,PK].
358Firstly, new K variables U1, U2, ..., UK, are inserted into each
359polynomial. Subsequently, P1, P2, ..., PK are destructively modified
360tantamount to replacing PI with UI*PI-1. It assumes that all
361polynomials have the same dimension, and only the first polynomial
362is examined to determine this dimension."
363 ;; Implementation note: we use STANDARD-EXTENSION and then subtract
364 ;; 1 from each polynomial; since UI*PI has no constant term,
365 ;; we just need to append the constant term at the end
366 ;; of each termlist.
367 (flet ((subtract-1 (p)
368 (append-item p (make-instance 'term :coeff -1 :dimension nvars))))
369 (setf plist (mapc #'subtract-1 plist)))
370 plist)
371
372
373(defun standard-sum (plist
374 &aux
375 (plist (standard-extension plist))
376 (nvars (poly-dimension (car plist))))
377 "Calculate the polynomial U1*P1+U2*P2+...+UK*PK-1, where PLIST=[P1,P2,...,PK].
378Firstly, new K variables, U1, U2, ..., UK, are inserted into each
379polynomial. Subsequently, P1, P2, ..., PK are destructively modified
380tantamount to replacing PI with UI*PI, and the resulting polynomials
381are added. Finally, 1 is subtracted. It should be noted that the term
382order is not modified, which is equivalent to using a lexicographic
383order on the first K variables."
384 (flet ((subtract-1 (p)
385 (append-item p (make-instance 'term :coeff -1 :dimension nvars))))
386 (subtract-1
387 (make-instance
388 'poly
389 :termlist (apply #'nconc (mapcar #'poly-termlist plist))))))
390
391#|
392
393(defun saturation-extension-1 (ring f p)
394 "Calculate [F, U*P-1]. It destructively modifies F."
395 (declare (type ring ring))
396 (polysaturation-extension ring f (list p)))
397
398
399
400
401(defun spoly (ring-and-order f g
402 &aux
403 (ring (ro-ring ring-and-order)))
404 "It yields the S-polynomial of polynomials F and G."
405 (declare (type ring-and-order ring-and-order) (type poly f g))
406 (let* ((lcm (monom-lcm (poly-lm f) (poly-lm g)))
407 (mf (monom-div lcm (poly-lm f)))
408 (mg (monom-div lcm (poly-lm g))))
409 (declare (type monom mf mg))
410 (multiple-value-bind (c cf cg)
411 (funcall (ring-ezgcd ring) (poly-lc f) (poly-lc g))
412 (declare (ignore c))
413 (poly-sub
414 ring-and-order
415 (scalar-times-poly ring cg (monom-times-poly mf f))
416 (scalar-times-poly ring cf (monom-times-poly mg g))))))
417
418
419(defun poly-primitive-part (ring p)
420 "Divide polynomial P with integer coefficients by gcd of its
421coefficients and return the result."
422 (declare (type ring ring) (type poly p))
423 (if (poly-zerop p)
424 (values p 1)
425 (let ((c (poly-content ring p)))
426 (values (make-poly-from-termlist
427 (mapcar
428 #'(lambda (x)
429 (make-term :monom (term-monom x)
430 :coeff (funcall (ring-div ring) (term-coeff x) c)))
431 (poly-termlist p))
432 (poly-sugar p))
433 c))))
434
435(defun poly-content (ring p)
436 "Greatest common divisor of the coefficients of the polynomial P. Use the RING structure
437to compute the greatest common divisor."
438 (declare (type ring ring) (type poly p))
439 (reduce (ring-gcd ring) (mapcar #'term-coeff (rest (poly-termlist p))) :initial-value (poly-lc p)))
440
441|#
Note: See TracBrowser for help on using the repository browser.