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][NormalizePolynomialDim0] - normalize a polynomial w.r.t a 0-dim regular chain
Calling Sequence
NormalizePolynomialDim0(f, rc, R)
Parameters
R
-
a polynomial ring
rc
a regular chain of R
f
polynomial of R
Description
The command NormalizePolynomialDim0 returns a normalized form of f w.r.t. rc, that is, a polynomial which is associated to f modulo rc, such that is normalized w.r.t. rc.
rc is zero-dimensional regular chain, and f together with rc forms a zero-dimensional regular chain.
Moreover R must have a prime characteristic such that FFT-based polynomial arithmetic can be used for this actual 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.
Examples
We consider two bivariate polynomials and want to compute their common solutions
We first compute their subresultant chain using FFT techniques
We deduce their resultants
We observe below that no root of r2 cancels the leading coefficients of f1 or f2. Hence, any roots of r2 can be extended into a solution of the system by a GCD computation.
We define the regular chain consisting of r2
We compute the GCD of f1 and f2 modulo r2
We normalize this GCD w.r.t. r2 which leads to a simpler expression with one as leading coefficient
See Also
NormalForm, NormalFormDim0, NormalizeRegularChainDim0, ReduceCoefficientsDim0, RegularChains
Download Help Document