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@ 1707

Last change on this file since 1707 was 1707, checked in by Marek Rychlik, 10 years ago

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