Engineering↗
Polynomial GCD over a Unique Factorisation Domain
Computing polynomial GCDs over the integers, the growth problem in remainder sequences, and the modular approach that sidesteps it.
Tag
Polynomial GCD
Every page in the KEVOS library tagged Polynomial GCD. 5 pages.
Engineering↗
The Dedekind Criterion for p-Maximality
A cheap modular test deciding whether an order is maximal at a given prime, without computing the maximal order.
Engineering↗
The Polynomial Euclidean Algorithm over a Field
The Euclidean and extended Euclidean algorithms for polynomials over a field, and their role in inversion and interpolation.
Engineering↗
The Sub-Resultant GCD Algorithm
The sub-resultant remainder sequence: predicting the divisible factor at each step to keep coefficients near minimal without content computation.
Engineering↗
Polynomial Arithmetic and GCD in Unique Factorisation Domains
Dense and sparse polynomial representation, multiplication algorithms, pseudo-division over a UFD, primitive parts and content, and the subresultant and modular remedies for coe…
Related
Other tags in the library.
mathematics 387
abstract algebra 252
Machine Design 184
business 179
project management 158
Computational Number Theory 123
algebra handbook 85
graduate mathematics 85
handbook 79
templates and examples 78
History of Engineering 77
Manufacturing 76
algebra and trigonometry 74
universal algebra 62
algebra 60
project delivery 60
principles of project management 58
advanced algebra 53
Fasteners and Joints 53
Civil Engineering 48
CAD 42
Context and scope 42
Machine Elements 40
Threading and Gaging 37
Mechanical Engineering 35
Power Transmission 34
template 34
Operational Excellence 32
example 31
project leadership 31
project teams 31
strategy 31
Business Expansion 29
Metrology 29
project management research 29
Sales & Marketing 29
personal development 27
behaviour change 26
habits 26
systems 26