Maple Professional
Maple Academic
Maple Student Edition
Maple Personal Edition
Maple Player
Maple Player for iPad
MapleSim Professional
MapleSim Academic
Maple T.A. - Testing & Assessment
Maple T.A. MAA Placement Test Suite
Möbius - Online Courseware
Machine Design / Industrial Automation
Aerospace
Vehicle Engineering
Robotics
Power Industries
System Simulation and Analysis
Model development for HIL
Plant Modeling for Control Design
Robotics/Motion Control/Mechatronics
Other Application Areas
Mathematics Education
Engineering Education
High Schools & Two-Year Colleges
Testing & Assessment
Students
Financial Modeling
Operations Research
High Performance Computing
Physics
Live Webinars
Recorded Webinars
Upcoming Events
MaplePrimes
Maplesoft Blog
Maplesoft Membership
Maple Ambassador Program
MapleCloud
Technical Whitepapers
E-Mail Newsletters
Maple Books
Math Matters
Application Center
MapleSim Model Gallery
User Case Studies
Exploring Engineering Fundamentals
Teaching Concepts with Maple
Maplesoft Welcome Center
Teacher Resource Center
Student Help Center
RegularChains[FastArithmeticTools][ReduceCoefficientsDim0] - reduce the coefficients of a polynomial w.r.t a 0-dim regular chain
Calling Sequence
ReduceCoefficientsDim0(f, rc, R)
Parameters
R
-
a polynomial ring
rc
a regular chain of R
f
polynomial of R
Description
The command ReduceCoefficientsDim0 returns the normal form of f w.r.t. rc in the sense of Groebner bases.
rc is assumed to be a normalized zero-dimensional regular chain and all variables of f but the main one must be algebraic w.r.t. rc. See the subpackage ChainTools for more information about these concepts.
R must have a prime characteristic such that FFT-based polynomial arithmetic can be used for this computation. The higher the degrees of f and rc are, the larger must be such that divides . If the degree of f or rc is too large, then an error is raised.
The algorithm relies on the fast division trick (based on power series inversion) and FFT-based multivariate multiplication.
Examples
We solve a system in 3 variables and 3 unknowns
Its triangular decomposition consists of only one regular chain
The polynomial in x is not normalized
Indeed its initial is not a constant in R
We compute the inverse of the initial of px w.r.t. rc Note that the Inverse will not fail if its first argument is not invertible w.r.t. its second one; computations will split if a zero-divisor is met. This explains the non-trivial signature of the Inverse function
We get the inverse the initial of px w.r.t. rc
We multiply px by the inverse of its initial and reduce the product w.r.t rc. The returned polynomial is now normalized w.r.t. rc. Note that only the polynomials of rc in y and z are used during this reduction process.
See Also
ChainTools, NormalForm, NormalFormDim0, NormalizePolynomialDim0, NormalizeRegularChainDim0, RegularChains
Download Help Document
