Skip to content

Latest commit

 

History

History
199 lines (130 loc) · 4.14 KB

README.md

File metadata and controls

199 lines (130 loc) · 4.14 KB
Raw

Multivariate Polynomials

Translated and adapted from MV-201701 PDF written by Marco Antoniotti and Gabriella Pasi.

One of the first and most important computer applications was the symbolic manipulation of mathematical operations. In particular, known systems like Computer Algebra Systems preoccupy to offer multivariate polynomials manipulation functionalities.
The Project consists in Common Lisp and Prolog libraries implementing multivariate polynomials manipulation.
 

List of contents

Representation

Common Lisp

Expression:

Variable   X          → 'x

Monomial   XY^3       → '(* x (expt y 3))

Monomial   5XW        → '(* 5 x w)

Polynomial XY^3 + 5XW → '(+ (* x (expt y 3)) (* 5 x w))

VarPower: (V Power Variable)

; X^5
(V 5 X)

Monomial: (M Coefficient TotalDegree VarPowers)

; 2*X^4*Y
(M 2 5 ((V 4 X) (V 1 Y)))

Polynomial: (P Monomials)

; 4*X*Y + 2*Y*Z
(P ((M 4 2 ((V 1 X) (V 1 Y))) (M 2 2 ((V 1 Y) (V 1 Z)))))

 

Prolog

Expression:

Variable   X          → x

Monomial   XY^3       → x * y^3

Monomial   5XW        → 5 * x * w

Polynomial XY^3 + 5XW → x * y^3 + 5 * x * w

VarPower: v(Power, Variable)

% X^5
v(5, x)

Monomial: m(Coefficient, TotalDegree, VarPowers)

% 2*X^4*Y
m(2, 5, [v(4, x), v(1, y)])

Polynomial: poly(Monomials)

% 4*X*Y + 2*Y*Z
poly(m(4, 2, [v(1, x), v(1, y)]), m(2, 2, [v(1, y), v(1, z)]))

 

Interface

Common Lisp

(coefficients Poly) → Coefficients

(variables Poly) → Variables

(monomials Poly) → Monomials

(maxdegree Poly) → Degree

(mindegree Poly) → Degree

(polyplus Poly1 Poly2) → Result

(polyminus Poly1 Poly2) → Result

(polytimes Poly1 Poly2) → Result

(as_monomial Expression) → Monomial

(as_polynomial Expression) → Monomial

(polyval Polynomial VariableValues) → Value

(pprint_polynomial Polynomial) → NIL
 

Prolog

coefficients(+Poly, -Coefficients)

variables(+Poly, -Variables)

monomials(+Poly, -Monomials)

maxdegree(+Poly, -Degree)

mindegree(+Poly, -Degree)

polyplus(+Poly1, +Poly2, -Result)

polyminus(+Poly1, +Poly2, -Result)

polytimes(+Poly1, +Poly2, -Result)

as_monomial(+Expression, -Monomial)

as_polynomial(+Expression, -Monomial)

polyval(+Polynomial, +VariableValues, -Value)

pprint_polynomial(+Polynomial)
 

Examples

Common Lisp

CL-USER> (as-monomial '(* 3 y w (expt u 3)))
(M 3 5 ((V 3 U) (V 1 W) (V 1 Y)))

CL-USER> (setf qd (as-monomial 42))
(M 42 0 NIL)

CL-USER> (setf m1 (as-monomial '(* y (expt s 3) (expt u 3))))
(M 1 7 ((V 3 S) (V 3 U) (V 1 Y)))

CL-USER> (setf p1 (as-polynomial '(+ (* -1 x) (* x y))))
(P ((M -1 1 ((V 1 X))) (M 1 2 ((V 1 X) (V 1 Y)))))

CL-USER> (setf p2 (as-polynomial '(+ (* y (expt s 3) (expt u 3)) -4 (* x y))))
(P ((M -4 0 NIL)
    (M 1 2 ((V 1 X) (V 1 Y)))
    (M 1 7 ((V 3 S) (V 3 U) (V 1 Y)))))

CL-USER> (polytimes m1 p1)
(P ((M -1 8 ((V 3 S) (V 3 U) (V 1 X) (V 1 Y)))
    (M 1 9 ((V 3 S) (V 3 U) (V 1 X) (V 2 Y)))))

CL-USER> (pprint-polynomial *)
-1 * S^3 * U^3 * X * Y + S^3 * U^3 * X * Y^2
NIL

 

Prolog

?- as_monomial(3 * y * w * u^3, M).
M = m(3, 5, [v(3, u), v(1, w), v(1, y)]).

?- as_monomial(42, QD).
QD = m(42, 0, []).

?- as_polynomial(-1 * x + x * y, P1), variables(P1, Vs).
P1 = poly([m(-1, 1, [v(1, x)]), m(1, 2, [v(1, x), v(1, y)])]),
Vs = [x, y].

?- as_monomial(y * s^3 * u^3, M1),
|  as_polynomial(-1 * x + x * y, P1),
|  polytimes(M1, P1, R),
|  pprint_polynomial(R).
-1 * S^3 * U^3 * X * Y + S^3 * U^3 * X * Y^2
M1 = m(1, 7, [v(3, s), v(3, u), v(1, y)]),
P1 = poly([m(-1, 1, [v(1, x)]), m(1, 2, [v(1, x), v(1, y)])]),
R = poly([m(-1, 8, [v(3, s), v(3, u), v(1, x), v(1, y)]),
          m(1, 9, [v(3, s), v(3, u), v(1, x), v(2, y)])]).