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/mx-grobner.lisp@ 1722

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

* empty log message *
File size: 20.0 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;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
23;;
24;; Load this file into Maxima to bootstrap the Grobner package.
25;; NOTE: This file does use symbols defined by Maxima, so it
26;; will not work when loaded in Common Lisp.
27;;
28;; DETAILS: This file implements an interface between the Grobner
29;; basis package NGROBNER, which is a pure Common Lisp package, and
30;; Maxima. NGROBNER for efficiency uses its own representation of
31;; polynomials. Thus, it is necessary to convert Maxima representation
32;; to the internal representation and back. The facilities to do so
33;; are implemented in this file.
34;;
35;; Also, since the NGROBNER package consists of many Lisp files, it is
36;; necessary to load the files. It is possible and preferrable to use
37;; ASDF for this purpose. The default is ASDF. It is also possible to
38;; simply used LOAD and COMPILE-FILE to accomplish this task.
39;;
40;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
41
42(in-package :maxima)
43
44(macsyma-module cgb-maxima)
45
46
47(eval-when
48 #+gcl (load eval)
49 #-gcl (:load-toplevel :execute)
50 (format t "~&Loading maxima-grobner ~a ~a~%"
51 "$Revision: 2.0 $" "$Date: 2015/06/02 0:34:17 $"))
52
53;;FUNCTS is loaded because it contains the definition of LCM
54($load "functs")
55#+sbcl(progn (require 'asdf) (load "ngrobner.asd")(asdf:load-system :ngrobner))
56
57(use-package :ngrobner)
58
59
60;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
61;;
62;; Maxima expression ring
63;;
64;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
65;;
66;; This is how we perform operations on coefficients
67;; using Maxima functions.
68;;
69;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
70
71(defparameter +maxima-ring+
72 (make-ring
73 ;;(defun coeff-zerop (expr) (meval1 `(($is) (($equal) ,expr 0))))
74 :parse #'(lambda (expr)
75 (when modulus (setf expr ($rat expr)))
76 expr)
77 :unit #'(lambda () (if modulus ($rat 1) 1))
78 :zerop #'(lambda (expr)
79 ;;When is exactly a maxima expression equal to 0?
80 (cond ((numberp expr)
81 (= expr 0))
82 ((atom expr) nil)
83 (t
84 (case (caar expr)
85 (mrat (eql ($ratdisrep expr) 0))
86 (otherwise (eql ($totaldisrep expr) 0))))))
87 :add #'(lambda (x y) (m+ x y))
88 :sub #'(lambda (x y) (m- x y))
89 :uminus #'(lambda (x) (m- x))
90 :mul #'(lambda (x y) (m* x y))
91 ;;(defun coeff-div (x y) (cadr ($divide x y)))
92 :div #'(lambda (x y) (m// x y))
93 :lcm #'(lambda (x y) (meval1 `((|$LCM|) ,x ,y)))
94 :ezgcd #'(lambda (x y) (apply #'values (cdr ($ezgcd ($totaldisrep x) ($totaldisrep y)))))
95 ;; :gcd #'(lambda (x y) (second ($ezgcd x y)))))
96 :gcd #'(lambda (x y) ($gcd x y))))
97
98;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
99;;
100;; Maxima expression parsing
101;;
102;;
103;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
104;;
105;; Functions and macros dealing with internal representation
106;; structure.
107;;
108;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
109
110(defun equal-test-p (expr1 expr2)
111 (alike1 expr1 expr2))
112
113(defun coerce-maxima-list (expr)
114 "Convert a Maxima list to Lisp list."
115 (cond
116 ((and (consp (car expr)) (eql (caar expr) 'mlist)) (cdr expr))
117 (t expr)))
118
119(defun free-of-vars (expr vars) (apply #'$freeof `(,@vars ,expr)))
120
121;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
122;;
123;; Order utilities
124;;
125;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
126
127(defun find-ring-by-name (ring)
128 "This function returns the ring structure bases on input symbol."
129 (cond
130 ((null ring) nil)
131 ((symbolp ring)
132 (case ring
133 ((maxima-ring :maxima-ring #:maxima-ring $expression_ring #:expression_ring)
134 +maxima-ring+)
135 ((ring-of-integers :ring-of-integers #:ring-of-integers $ring_of_integers) +ring-of-integers+)
136 (otherwise
137 (mtell "~%Warning: Ring ~M not found. Using default.~%" ring))))
138 (t
139 (mtell "~%Ring specification ~M is not recognized. Using default.~%" ring)
140 nil)))
141
142(defun find-order-by-name (order)
143 "This function returns the order function bases on its name."
144 (cond
145 ((null order) nil)
146 ((symbolp order)
147 (case order
148 ((lex :lex $lex #:lex)
149 #'lex>)
150 ((grlex :grlex $grlex #:grlex)
151 #'grlex>)
152 ((grevlex :grevlex $grevlex #:grevlex)
153 #'grevlex>)
154 ((invlex :invlex $invlex #:invlex)
155 #'invlex>)
156 (otherwise
157 (mtell "~%Warning: Order ~M not found. Using default.~%" order))))
158 (t
159 (mtell "~%Order specification ~M is not recognized. Using default.~%" order)
160 nil)))
161
162(defun find-ring-and-order-by-name (&optional
163 (ring (find-ring-by-name $poly_coefficient_ring))
164 (order (find-order-by-name $poly_monomial_order))
165 (primary-elimination-order (find-order-by-name $poly_primary_elimination_order))
166 (secondary-elimination-order (find-order-by-name $poly_secondary_elimination_order))
167 &aux
168 (ring-and-order (make-ring-and-order
169 :ring ring
170 :order order
171 :primary-elimination-order primary-elimination-order
172 :secondary-elimination-order secondary-elimination-order)))
173 "Build RING-AND-ORDER structure. The defaults are determined by various Maxima-level switches,
174which are names of ring and orders."
175 ring-and-order)
176
177(defun maxima->poly (expr vars
178 &optional
179 (ring-and-order (find-ring-and-order-by-name))
180 &aux
181 (vars (coerce-maxima-list vars))
182 (ring (ro-ring ring-and-order)))
183 "Convert a maxima polynomial expression EXPR in variables VARS to
184internal form. This works by first converting the expression to Lisp,
185and then evaluating the expression using polynomial arithmetic
186implemented by the POLYNOMIAL package."
187 (labels ((parse (arg) (maxima->poly arg vars ring-and-order))
188 (parse-list (args) (mapcar #'parse args)))
189 (cond
190 ((eql expr 0) (make-poly-zero))
191 ((member expr vars :test #'equal-test-p)
192 (let ((pos (position expr vars :test #'equal-test-p)))
193 (make-poly-variable ring (length vars) pos)))
194 ((free-of-vars expr vars)
195 ;;This means that variable-free CRE and Poisson forms will be converted
196 ;;to coefficients intact
197 (coerce-coeff ring expr vars))
198 (t
199 (case (caar expr)
200 (mplus (reduce #'(lambda (x y) (poly-add ring-and-order x y)) (parse-list (cdr expr))))
201 (mminus (poly-uminus ring (parse (cadr expr))))
202 (mtimes
203 (if (endp (cddr expr)) ;unary
204 (parse (cdr expr))
205 (reduce #'(lambda (p q) (poly-mul ring-and-order p q)) (parse-list (cdr expr)))))
206 (mexpt
207 (cond
208 ((member (cadr expr) vars :test #'equal-test-p)
209 ;;Special handling of (expt var pow)
210 (let ((pos (position (cadr expr) vars :test #'equal-test-p)))
211 (make-poly-variable ring (length vars) pos (caddr expr))))
212 ((not (and (integerp (caddr expr)) (plusp (caddr expr))))
213 ;; Negative power means division in coefficient ring
214 ;; Non-integer power means non-polynomial coefficient
215 (mtell "~%Warning: Expression ~%~M~%contains power which is not a positive integer. Parsing as coefficient.~%"
216 expr)
217 (coerce-coeff ring expr vars))
218 (t (poly-expt ring (parse (cadr expr)) (caddr expr)))))
219 (mrat (parse ($ratdisrep expr)))
220 (mpois (parse ($outofpois expr)))
221 (otherwise
222 (coerce-coeff ring expr vars)))))))
223
224(defun maxima->poly-list (expr vars
225 &optional
226 (ring-and-order (find-ring-and-order-by-name)))
227 "Convert a Maxima representation of a list of polynomials to the internal form."
228 (case (caar expr)
229 (mlist (mapcar #'(lambda (p)
230 (maxima->poly p vars ring-and-order))
231 (cdr expr)))
232 (otherwise (merror "Expression ~M is not a list of polynomials in variables ~M."
233 expr vars))))
234
235(defun maxima->poly-list-of-lists (poly-list-of-lists vars
236 &optional
237 (ring-and-order (find-ring-and-order-by-name)))
238 "Parse a Maxima representation of a list of lists of polynomials."
239 (mapcar #'(lambda (g) (maxima->poly-list g vars ring-and-order))
240 (coerce-maxima-list poly-list-of-lists)))
241
242
243
244;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
245;;
246;; Conversion from internal form to Maxima general form
247;;
248;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
249
250(defun maxima-head ()
251 (if $poly_return_term_list
252 '(mlist)
253 '(mplus)))
254
255(defun poly->maxima (poly-type object vars)
256 (case poly-type
257 (:poly
258 `(,(maxima-head) ,@(mapcar #'(lambda (term) (poly->maxima :term term vars)) (poly-termlist object))))
259 (:poly-list
260 `((mlist) ,@(mapcar #'(lambda (p) ($ratdisrep (poly->maxima :polynomial p vars))) object)))
261 (:term
262 `((mtimes) ,($ratdisrep (term-coeff object))
263 ,@(mapcar #'(lambda (var power) `((mexpt) ,var ,power))
264 vars (monom->list (term-monom object)))))
265 ;; Assumes that Lisp and Maxima logicals coincide
266 (:logical object)
267 (otherwise
268 object)))
269
270
271#|
272
273
274;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
275;;
276;; Unary and binary operation definition facility
277;;
278;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
279
280(defmacro define-unop (maxima-name fun-name
281 &optional (documentation nil documentation-supplied-p))
282 "Define a MAXIMA-level unary operator MAXIMA-NAME corresponding to unary function FUN-NAME."
283 `(defun ,maxima-name (p vars
284 &aux
285 (vars (coerce-maxima-list vars))
286 (p (parse-poly p vars)))
287 ,@(when documentation-supplied-p (list documentation))
288 (coerce-to-maxima :polynomial (,fun-name +maxima-ring+ p) vars)))
289
290(defmacro define-binop (maxima-name fun-name
291 &optional (documentation nil documentation-supplied-p))
292 "Define a MAXIMA-level binary operator MAXIMA-NAME corresponding to binary function FUN-NAME."
293 `(defmfun ,maxima-name (p q vars
294 &aux
295 (vars (coerce-maxima-list vars))
296 (p (parse-poly p vars))
297 (q (parse-poly q vars)))
298 ,@(when documentation-supplied-p (list documentation))
299 (coerce-to-maxima :polynomial (,fun-name +maxima-ring+ p q) vars)))
300
301
302;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
303;;
304;; Facilities for evaluating Grobner package expressions
305;; within a prepared environment
306;;
307;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
308
309(defmacro with-monomial-order ((order) &body body)
310 "Evaluate BODY with monomial order set to ORDER."
311 `(let ((*monomial-order* (or (find-order ,order) *monomial-order*)))
312 . ,body))
313
314(defmacro with-coefficient-ring ((ring) &body body)
315 "Evaluate BODY with coefficient ring set to RING."
316 `(let ((+maxima-ring+ (or (find-ring ,ring) +maxima-ring+)))
317 . ,body))
318
319(defmacro with-ring-and-order ((ring order) &body body)
320 "Evaluate BODY with monomial order set to ORDER and coefficient ring set to RING."
321 `(let ((*monomial-order* (or (find-order ,order) *monomial-order*))
322 (+maxima-ring+ (or (find-ring ,ring) +maxima-ring+)))
323 . ,body))
324
325(defmacro with-elimination-orders ((primary secondary elimination-order)
326 &body body)
327 "Evaluate BODY with primary and secondary elimination orders set to PRIMARY and SECONDARY."
328 `(let ((*primary-elimination-order* (or (find-order ,primary) *primary-elimination-order*))
329 (*secondary-elimination-order* (or (find-order ,secondary) *secondary-elimination-order*))
330 (*elimination-order* (or (find-order ,elimination-order) *elimination-order*)))
331 . ,body))
332
333
334;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
335;;
336;; Maxima-level interface functions
337;;
338;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
339
340;; Auxillary function for removing zero polynomial
341(defun remzero (plist) (remove #'poly-zerop plist))
342
343;;Simple operators
344
345(define-binop $poly_add poly-add
346 "Adds two polynomials P and Q")
347
348(define-binop $poly_subtract poly-sub
349 "Subtracts a polynomial Q from P.")
350
351(define-binop $poly_multiply poly-mul
352 "Returns the product of polynomials P and Q.")
353
354(define-binop $poly_s_polynomial spoly
355 "Returns the syzygy polynomial (S-polynomial) of two polynomials P and Q.")
356
357(define-unop $poly_primitive_part poly-primitive-part
358 "Returns the polynomial P divided by GCD of its coefficients.")
359
360(define-unop $poly_normalize poly-normalize
361 "Returns the polynomial P divided by the leading coefficient.")
362
363;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
364;;
365;; Macro facility for writing Maxima-level wrappers for
366;; functions operating on internal representation
367;;
368;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
369
370(defmacro with-parsed-polynomials (((maxima-vars &optional (maxima-new-vars nil new-vars-supplied-p))
371 &key (polynomials nil)
372 (poly-lists nil)
373 (poly-list-lists nil)
374 (value-type nil))
375 &body body
376 &aux (vars (gensym))
377 (new-vars (gensym)))
378 `(let ((,vars (coerce-maxima-list ,maxima-vars))
379 ,@(when new-vars-supplied-p
380 (list `(,new-vars (coerce-maxima-list ,maxima-new-vars)))))
381 (coerce-to-maxima
382 ,value-type
383 (with-coefficient-ring ($poly_coefficient_ring)
384 (with-monomial-order ($poly_monomial_order)
385 (with-elimination-orders ($poly_primary_elimination_order
386 $poly_secondary_elimination_order
387 $poly_elimination_order)
388 (let ,(let ((args nil))
389 (dolist (p polynomials args)
390 (setf args (cons `(,p (parse-poly ,p ,vars)) args)))
391 (dolist (p poly-lists args)
392 (setf args (cons `(,p (parse-poly-list ,p ,vars)) args)))
393 (dolist (p poly-list-lists args)
394 (setf args (cons `(,p (parse-poly-list-list ,p ,vars)) args))))
395 . ,body))))
396 ,(if new-vars-supplied-p
397 `(append ,vars ,new-vars)
398 vars))))
399
400
401;;Functions
402
403(defmfun $poly_expand (p vars)
404 "This function is equivalent to EXPAND(P) if P parses correctly to a polynomial.
405If the representation is not compatible with a polynomial in variables VARS,
406the result is an error."
407 (with-parsed-polynomials ((vars) :polynomials (p)
408 :value-type :polynomial)
409 p))
410
411(defmfun $poly_expt (p n vars)
412 (with-parsed-polynomials ((vars) :polynomials (p) :value-type :polynomial)
413 (poly-expt +maxima-ring+ p n)))
414
415(defmfun $poly_content (p vars)
416 (with-parsed-polynomials ((vars) :polynomials (p))
417 (poly-content +maxima-ring+ p)))
418
419(defmfun $poly_pseudo_divide (f fl vars
420 &aux (vars (coerce-maxima-list vars))
421 (f (parse-poly f vars))
422 (fl (parse-poly-list fl vars)))
423 (multiple-value-bind (quot rem c division-count)
424 (poly-pseudo-divide +maxima-ring+ f fl)
425 `((mlist)
426 ,(coerce-to-maxima :poly-list quot vars)
427 ,(coerce-to-maxima :polynomial rem vars)
428 ,c
429 ,division-count)))
430
431(defmfun $poly_exact_divide (f g vars)
432 (with-parsed-polynomials ((vars) :polynomials (f g) :value-type :polynomial)
433 (poly-exact-divide +maxima-ring+ f g)))
434
435(defmfun $poly_normal_form (f fl vars)
436 (with-parsed-polynomials ((vars) :polynomials (f)
437 :poly-lists (fl)
438 :value-type :polynomial)
439 (normal-form +maxima-ring+ f (remzero fl) nil)))
440
441(defmfun $poly_buchberger_criterion (g vars)
442 (with-parsed-polynomials ((vars) :poly-lists (g) :value-type :logical)
443 (buchberger-criterion +maxima-ring+ g)))
444
445(defmfun $poly_buchberger (fl vars)
446 (with-parsed-polynomials ((vars) :poly-lists (fl) :value-type :poly-list)
447 (buchberger +maxima-ring+ (remzero fl) 0 nil)))
448
449(defmfun $poly_reduction (plist vars)
450 (with-parsed-polynomials ((vars) :poly-lists (plist)
451 :value-type :poly-list)
452 (reduction +maxima-ring+ plist)))
453
454(defmfun $poly_minimization (plist vars)
455 (with-parsed-polynomials ((vars) :poly-lists (plist)
456 :value-type :poly-list)
457 (minimization plist)))
458
459(defmfun $poly_normalize_list (plist vars)
460 (with-parsed-polynomials ((vars) :poly-lists (plist)
461 :value-type :poly-list)
462 (poly-normalize-list +maxima-ring+ plist)))
463
464(defmfun $poly_grobner (f vars)
465 (with-parsed-polynomials ((vars) :poly-lists (f)
466 :value-type :poly-list)
467 (grobner +maxima-ring+ (remzero f))))
468
469(defmfun $poly_reduced_grobner (f vars)
470 (with-parsed-polynomials ((vars) :poly-lists (f)
471 :value-type :poly-list)
472 (reduced-grobner +maxima-ring+ (remzero f))))
473
474(defmfun $poly_depends_p (p var mvars
475 &aux (vars (coerce-maxima-list mvars))
476 (pos (position var vars)))
477 (if (null pos)
478 (merror "~%Variable ~M not in the list of variables ~M." var mvars)
479 (poly-depends-p (parse-poly p vars) pos)))
480
481(defmfun $poly_elimination_ideal (flist k vars)
482 (with-parsed-polynomials ((vars) :poly-lists (flist)
483 :value-type :poly-list)
484 (elimination-ideal +maxima-ring+ flist k nil 0)))
485
486(defmfun $poly_colon_ideal (f g vars)
487 (with-parsed-polynomials ((vars) :poly-lists (f g) :value-type :poly-list)
488 (colon-ideal +maxima-ring+ f g nil)))
489
490(defmfun $poly_ideal_intersection (f g vars)
491 (with-parsed-polynomials ((vars) :poly-lists (f g) :value-type :poly-list)
492 (ideal-intersection +maxima-ring+ f g nil)))
493
494(defmfun $poly_lcm (f g vars)
495 (with-parsed-polynomials ((vars) :polynomials (f g) :value-type :polynomial)
496 (poly-lcm +maxima-ring+ f g)))
497
498(defmfun $poly_gcd (f g vars)
499 ($first ($divide (m* f g) ($poly_lcm f g vars))))
500
501(defmfun $poly_grobner_equal (g1 g2 vars)
502 (with-parsed-polynomials ((vars) :poly-lists (g1 g2))
503 (grobner-equal +maxima-ring+ g1 g2)))
504
505(defmfun $poly_grobner_subsetp (g1 g2 vars)
506 (with-parsed-polynomials ((vars) :poly-lists (g1 g2))
507 (grobner-subsetp +maxima-ring+ g1 g2)))
508
509(defmfun $poly_grobner_member (p g vars)
510 (with-parsed-polynomials ((vars) :polynomials (p) :poly-lists (g))
511 (grobner-member +maxima-ring+ p g)))
512
513(defmfun $poly_ideal_saturation1 (f p vars)
514 (with-parsed-polynomials ((vars) :poly-lists (f) :polynomials (p)
515 :value-type :poly-list)
516 (ideal-saturation-1 +maxima-ring+ f p 0)))
517
518(defmfun $poly_saturation_extension (f plist vars new-vars)
519 (with-parsed-polynomials ((vars new-vars)
520 :poly-lists (f plist)
521 :value-type :poly-list)
522 (saturation-extension +maxima-ring+ f plist)))
523
524(defmfun $poly_polysaturation_extension (f plist vars new-vars)
525 (with-parsed-polynomials ((vars new-vars)
526 :poly-lists (f plist)
527 :value-type :poly-list)
528 (polysaturation-extension +maxima-ring+ f plist)))
529
530(defmfun $poly_ideal_polysaturation1 (f plist vars)
531 (with-parsed-polynomials ((vars) :poly-lists (f plist)
532 :value-type :poly-list)
533 (ideal-polysaturation-1 +maxima-ring+ f plist 0 nil)))
534
535(defmfun $poly_ideal_saturation (f g vars)
536 (with-parsed-polynomials ((vars) :poly-lists (f g)
537 :value-type :poly-list)
538 (ideal-saturation +maxima-ring+ f g 0 nil)))
539
540(defmfun $poly_ideal_polysaturation (f ideal-list vars)
541 (with-parsed-polynomials ((vars) :poly-lists (f)
542 :poly-list-lists (ideal-list)
543 :value-type :poly-list)
544 (ideal-polysaturation +maxima-ring+ f ideal-list 0 nil)))
545
546(defmfun $poly_lt (f vars)
547 (with-parsed-polynomials ((vars) :polynomials (f) :value-type :polynomial)
548 (make-poly-from-termlist (list (poly-lt f)))))
549
550(defmfun $poly_lm (f vars)
551 (with-parsed-polynomials ((vars) :polynomials (f) :value-type :polynomial)
552 (make-poly-from-termlist (list (make-term (poly-lm f) (funcall (ring-unit +maxima-ring+)))))))
553
554|#
Note: See TracBrowser for help on using the repository browser.