MATH 5130
Computational Algebra
Course Description
This course is an introduction to computational methods in algebra. The course will cover a selection of computer algebra topics such as factorization and greatest common divisors, fast multiplication (FFT), solving polynomial equations, lattice reduction, linear difference equations, Groebner bases, and elimination theory. Additional topics may be introduced at the instructors discretion. The course will include a general introduction to the topics as well as a discussion of algorithms and applications.
Offerings
Fall 2023 | Benjamin Hutz | MWF 1:10pm-2:00pm |