MultiplicationMatrix - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Algebra : Polynomials : Groebner : MultiplicationMatrix

Groebner

  

MultiplicationMatrix

  

compute multiplication matrices

  

NormalSet

  

compute monomial bases

 

Calling Sequence

Parameters

Description

Examples

References

Calling Sequence

NormalSet(J, tord)

MultiplicationMatrix(f, ns, rv, G, tord, characteristic=p)

Parameters

J

-

Groebner basis with respect to tord or a PolynomialIdeal (zero-dimensional)

tord

-

ShortMonomialOrder

f

-

a polynomial

ns, rv

-

normal set (the sequence returned by NormalSet)

p

-

(optional) characteristic

Description

• 

The NormalSet command computes a monomial basis for the quotient K[x1,...,xn]/J when J is a zero-dimensional ideal. The input can be either a Groebner basis with respect to tord or a PolynomialIdeal, in which case a Groebner basis with respect to tord is computed. The output is a sequence of two elements, ns and rv.  ns is sorted list of monomials comprising a basis for the quotient as a vector space, while rv is a table which reverses ns, i.e.: rv[ns[i]] = i for i=1..nops(ns).  The purpose of rv is to allow one to assign the coefficients of a polynomial to a vector with respect to ns in linear time.

• 

The number of elements in a normal set ns is equal to the number of solutions of the system over the algebraic closure of the coefficient field.

• 

The MultiplicationMatrix command constructs the multiplication matrix for a polynomial f with respect to J and tord. The rows of this matrix are the normal forms of ns[i]*f written as a vector with respect to ns, and its eigenvalues include the values of the polynomial f on the variety V(J). In particular, if f = x is a variable one obtains the x-coordinates of the solution of J among the eigenvalues of the multiplication matrix. This can be used to solve a zero-dimensional polynomial system.

Examples

Example 1: A Lagrange multiplier problem

(1)

(2)

(3)

Verify that the matrices commute

(4)

Example 2: A geometric intersection problem

(5)

(6)

(7)

(8)

(9)

Read the roots of the system from the eigenvalues of the multiplication matrices M1, M2

(10)

(11)

Example 3: A celestial mechanics problem. System S4 (Newtonian planar 4-body problem with equal masses)

(12)

The minimal polynomial of Mphi is part of the plex Groebner basis of [e1,e2,e3] and P37 is a multiple of it.

(13)

References

  

Corless, Robert M. "Groebner Bases and Matrix Eigenproblems." SIGSAM Bulletin (Communications in Computer Algebra), Vol. 30, No. 4, Issue 118, (December 1996): 26-32.

  

Cox, D.; Little, J.; and O'Shea, D. Using Algebraic Geometry. Springer-Verlag, 1998

See Also

Basis

NormalForm

UnivariatePolynomial

 


Download Help Document