Data structures and algorithms for mathematical objects, including long integers, polynomials, and general mathematical formulae. Topics include computing polynomial greatest common divisors, the Fast Fourier transform, Hensel's lemma and p-adic methods, differentiation and simplification of formulae, and polynomial factorization. Students will use a computer algebra system such as Maple for calculations and programming. Students may not take a 700-division course if it is being offered in conjunction with a 400-division course which they have taken previously.
Data structures and algorithms for mathematical objects, including long integers, polynomials, and general mathematical formulae. Topics include computing polynomial greatest common divisors, the Fast Fourier transform, Hensel's lemma and p-adic methods, differentiation and simplification of formulae, and polynomial factorization. Students will use a computer algebra system such as Maple for calculations and programming. Students may not take a 700-division course if it is being offered in conjunction with a 400-division course which they have taken previously.
