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/symbolic-polynomial.lisp@ 3354

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

* empty log message *

File size: 8.1 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 "SYMBOLIC-POLYNOMIAL"
23 (:use :cl :utils :ring :monom :order :term :polynomial :infix)
24 (:export "SYMBOLIC-POLY")
25 (:documentation "Implements symbolic polynomials. A symbolic
26polynomial is and object which uses symbolic variables for reading and
27printing in standard human-readable (infix) form."))
28
29(in-package :symbolic-polynomial)
30
31(defclass symbolic-poly (poly)
32 ((vars :initform nil
33 :initarg :vars
34 :accessor symbolic-poly-vars)
35 )
36 (:default-initargs :termlist nil :vars nil))
37
38(defmethod print-object ((self symbolic-poly) stream)
39 (print-unreadable-object (self stream :type t :identity t)
40 (with-accessors ((dimension poly-dimension)
41 (termlist poly-termlist)
42 (order poly-term-order)
43 (vars symbolic-poly-vars))
44 self
45 (format stream "DIMENSION=~A TERMLIST=~A ORDER=~A VARS=~A"
46 dimension termlist order vars))))
47
48
49(defmethod r-equalp ((self symbolic-poly) (other symbolic-poly))
50 (when (r-equalp (symbolic-poly-vars self) (symbolic-poly-vars other))
51 (call-next-method)))
52
53(defmethod update-instance-for-different-class :after ((old poly) (new symbolic-poly) &key)
54 "After adding variables to NEW, we need to make sure that the number
55of variables given by POLY-DIMENSION is consistent with VARS."
56 (assert (= (length (symbolic-poly-vars new)) (poly-dimension new))))
57
58(defgeneric poly-eval (expr)
59 (:documentation "Evaluate Lisp form EXPR to a polynomial or a list of polynomials in
60variables VARS. Return the resulting polynomial or list of
61polynomials. Standard arithmetical operators in form EXPR are
62replaced with their analogues in the ring of polynomials, and the
63resulting expression is evaluated, resulting in a polynomial or a list
64of polynomials in internal form. A similar operation in another computer
65algebra system could be called 'expand' or so.")
66 (:method ((expr symbolic-poly)) expr)
67 (:method (expr)
68 (cond
69 ((eq expr 0)
70 (make-instance 'symbolic-poly :dimension (length vars) :vars vars))
71 ((member expr vars :test #'equalp)
72 (let ((pos (position expr vars :test #'equalp)))
73 (make-poly-variable ring (length vars) pos)))
74 ((atom expr)
75 (coerce-coeff ring expr vars))
76 ((eq (car expr) list-marker)
77 (cons list-marker (p-eval-list (cdr expr))))
78 (t
79 (case (car expr)
80 (+ (reduce #'p-add (p-eval-list (cdr expr))))
81 (- (case (length expr)
82 (1 (make-poly-zero))
83 (2 (poly-uminus ring (p-eval (cadr expr))))
84 (3 (poly-sub ring-and-order (p-eval (cadr expr)) (p-eval (caddr expr))))
85 (otherwise (poly-sub ring-and-order (p-eval (cadr expr))
86 (reduce #'p-add (p-eval-list (cddr expr)))))))
87 (*
88 (if (endp (cddr expr)) ;unary
89 (p-eval (cdr expr))
90 (reduce #'(lambda (p q) (poly-mul ring-and-order p q)) (p-eval-list (cdr expr)))))
91 (/
92 ;; A polynomial can be divided by a scalar
93 (cond
94 ((endp (cddr expr))
95 ;; A special case (/ ?), the inverse
96 (coerce-coeff ring (apply (ring-div ring) (cdr expr)) vars))
97 (t
98 (let ((num (p-eval (cadr expr)))
99 (denom-inverse (apply (ring-div ring)
100 (cons (funcall (ring-unit ring))
101 (mapcar #'p-eval-scalar (cddr expr))))))
102 (scalar-times-poly ring denom-inverse num)))))
103 (expt
104 (cond
105 ((member (cadr expr) vars :test #'equalp)
106 ;;Special handling of (expt var pow)
107 (let ((pos (position (cadr expr) vars :test #'equalp)))
108 (make-poly-variable ring (length vars) pos (caddr expr))))
109 ((not (and (integerp (caddr expr)) (plusp (caddr expr))))
110 ;; Negative power means division in coefficient ring
111 ;; Non-integer power means non-polynomial coefficient
112 (coerce-coeff ring expr vars))
113 (t (poly-expt ring-and-order (p-eval (cadr expr)) (caddr expr)))))
114 (otherwise
115 (coerce-coeff ring expr vars)))))))
116
117(defun poly-eval-scalar (expr
118 &optional
119 (ring +ring-of-integers+)
120 &aux
121 (order #'lex>))
122 "Evaluate a scalar expression EXPR in ring RING."
123 (declare (type ring ring))
124 (poly-lc (poly-eval expr nil ring order)))
125
126
127(defun read-infix-form (&key (stream t))
128 "Parser of infix expressions with integer/rational coefficients
129The parser will recognize two kinds of polynomial expressions:
130
131- polynomials in fully expanded forms with coefficients
132 written in front of symbolic expressions; constants can be optionally
133 enclosed in (); for example, the infix form
134 X^2-Y^2+(-4/3)*U^2*W^3-5
135 parses to
136 (+ (- (EXPT X 2) (EXPT Y 2)) (* (- (/ 4 3)) (EXPT U 2) (EXPT W 3)) (- 5))
137
138- lists of polynomials; for example
139 [X-Y, X^2+3*Z]
140 parses to
141 (:[ (- X Y) (+ (EXPT X 2) (* 3 Z)))
142 where the first symbol [ marks a list of polynomials.
143
144-other infix expressions, for example
145 [(X-Y)*(X+Y)/Z,(X+1)^2]
146parses to:
147 (:[ (/ (* (- X Y) (+ X Y)) Z) (EXPT (+ X 1) 2))
148Currently this function is implemented using M. Kantrowitz's INFIX package."
149 (read-from-string
150 (concatenate 'string
151 "#I("
152 (with-output-to-string (s)
153 (loop
154 (multiple-value-bind (line eof)
155 (read-line stream t)
156 (format s "~A" line)
157 (when eof (return)))))
158 ")")))
159
160(defun read-poly (vars &key
161 (stream t)
162 (ring +ring-of-integers+)
163 (order #'lex>))
164 "Reads an expression in prefix form from a stream STREAM.
165The expression read from the strem should represent a polynomial or a
166list of polynomials in variables VARS, over the ring RING. The
167polynomial or list of polynomials is returned, with terms in each
168polynomial ordered according to monomial order ORDER."
169 (poly-eval (read-infix-form :stream stream) vars ring order))
170
171(defun string->poly (str vars
172 &optional
173 (ring +ring-of-integers+)
174 (order #'lex>))
175 "Converts a string STR to a polynomial in variables VARS."
176 (with-input-from-string (s str)
177 (read-poly vars :stream s :ring ring :order order)))
178
179(defun poly->alist (p)
180 "Convert a polynomial P to an association list. Thus, the format of the
181returned value is ((MONOM[0] . COEFF[0]) (MONOM[1] . COEFF[1]) ...), where
182MONOM[I] is a list of exponents in the monomial and COEFF[I] is the
183corresponding coefficient in the ring."
184 (cond
185 ((poly-p p)
186 (mapcar #'term->cons (poly-termlist p)))
187 ((and (consp p) (eq (car p) :[))
188 (cons :[ (mapcar #'poly->alist (cdr p))))))
189
190(defun string->alist (str vars
191 &optional
192 (ring +ring-of-integers+)
193 (order #'lex>))
194 "Convert a string STR representing a polynomial or polynomial list to
195an association list (... (MONOM . COEFF) ...)."
196 (poly->alist (string->poly str vars ring order)))
197
198(defun poly-equal-no-sugar-p (p q)
199 "Compare polynomials for equality, ignoring sugar."
200 (declare (type poly p q))
201 (equalp (poly-termlist p) (poly-termlist q)))
202
203(defun poly-set-equal-no-sugar-p (p q)
204 "Compare polynomial sets P and Q for equality, ignoring sugar."
205 (null (set-exclusive-or p q :test #'poly-equal-no-sugar-p )))
206
207(defun poly-list-equal-no-sugar-p (p q)
208 "Compare polynomial lists P and Q for equality, ignoring sugar."
209 (every #'poly-equal-no-sugar-p p q))
210
211|#
Note: See TracBrowser for help on using the repository browser.