APM 4777 - Computer Algebra

(4)

A study of the mathematics and algorithms which are used in symbolic algebraic manipulation packages. Topics include computer representation of symbolic mathematics, polynomial ring theory, field theory and algebraic extensions, modular and p-adic methods, subresultant algorithm for polynomial GCD’s, Groebner bases for polynomial ideals and Buchberger’s algorithm, factorization and zeros of polynomials. Required background includes a course in abstract algebra and knowledge of a scientific programming language. Cross-listed with APM 5777. Student may not receive credit for both courses.
Prerequisite(s): MTH 2775 with a grade of (C) or higher and knowledge of a scientific computer programming language, or permission of instructor