MA-792K Computer Algebra II
Spring 2007
Mon 15h30-17h10 (in Williams 2104) Thu 11h32-12h22 (in Harrelson 335)

Syllabus People Maple Projects Homeworks Reading Grading Academics

Current Announcements

  • NEW For students who are taking the qualifying examination in August: the exam will cover the topics in the following list: topics07.pdf or topics07.html
  • I have uploaded your grades. I have all 4 items (homework, project, presentation grade, term paper) for all of you.
Old Announcements see below.

Peoples' home pages: Erich Kaltofen, Classlist

Maple programs for the course (Maple hints).

Homeworks

  • Homework 1 due Thurs, March 15, 2007, 5pm.
  • Homework 2 not assigned.

Projects

Computer Help Resources

Syllabus

Course Outline*

Lecture Topic(s) Notes Book(s)
1. Jan 11 Administrative meeting. Strassen's matrix multiplication

GG §12.1
2. Jan 16 Algebraic complexity; analysis of Strassen's scheme


3. Jan 18 Winograd's scheme


4. Jan 22 LUP factorization < matrix multiplication (Bunch-Hopcroft algorithm)


5. Jan 25 Outline of black box linear algebra


6. Jan 29 Hensel lifting

GG §15.4
7. Feb 1 Dixon's algorithm
Numer. Math., vol. 40, nr. 1 (1982)
8. Feb 5 P-adic numbers; recap of black box linear algebra

GG §9.6
9. Feb 8 the Berlekamp-Massey algorithm
Section 2.2 in JSC vol. 36 (2003)
GG §12.3
10. Feb 12 Proof of Wiedemann algorithm via the Schwartz/Zippel lemma
Section 3 in Math. Comput. vol. 64 (1995)
GG §6.9, Lemma 6.44
11. Feb 15 Wiedemann algorithm for singular matrices; the use of preconditioners
See talk at Fq6
Further reading LAA vol. 343-344 (2002)
GG §12.4
12. Feb 19 Gauss's lemma; GCD of several multivariate polynomials via linear combinations
Theorem 6.2 in J. ACM, vol. 35 (1988)
GG §6.2
13. Feb 22 GCD of several multivariate polynomials via linear combinations continued


14. Feb 27 Integration of rational functions
My Lect. Notes
GG §22
15. Mar 1


Week of Mar 5-9 Spring Break, no class
16. Mar 12 Lattice basis reduction (LLL)

GG §12.1-12.3
17. Mar 15 LLL continued


18. Mar 19 Integration of rational functions continued; proof that log(x) is irrational; Rothstein-Trager theorem


Wed, Mar 21, 5pm Last day to drop the course
19. Mar 22 GGH public key crypto-system; knapsack based crypto
Section 4 in JSC vol. 29, pp. 891-919 (2000)

20. Mar 26 Differential fields; quotient fields; algebraic function fields; proof that log(x) is transcendental
My Lect. Notes

21. Mar 29 Elementary Liouville extensions; structure theorem (not proved)


22. Apr 2 Liouville's theorem (not proved); impossibilities of closed form solution of the integral of certain transcendental functions


Tue, Apr 3, 5pm
Papers for class presentation must be declared at 5pm
23. Apr 5 Semi-algebraic sets; the principle of quantifier elimination on examples
Section 2 in JSC vol. 29, pp. 891-919 (2000)

24. Apr 9 Proof of Sturm's theorem; Cauchy root bound

GG Exercise 4.32
Tue, Apr 10
Approvals of papers for presentation by me are posted
25. Apr 12 Cauchy principle of argument; Cauchy index of a real rational function on an interval
Handout: chapters in Marden's and Gantmacher's books

26. Apr 16 Routh-Hurwitz algorithm for complex root isolation


27. Apr 19 Seidenberg's method
Handout: Seidenberg's paper; Section 6 in AAECC vol. 1, nr. 2, pp. 135-148 (1990)

Sat, Apr 21 East Coast Computer Algebra Day, Washington College
28. Apr 23 Paper presentations begin; recap of Fall-Spring courses


29. Apr 26 Extra topic: FFT

GG §8.2
Tue, May 1, 9-noon, HA 335. Presentations: Didier, Sharon, Robert
* This is a projected list and subject to amendment.

Textbook and Notes

I will be closely following whose sections are marked in the above syllabus by GG.

On-line information: All information on courses that I teach (except individual grades) is now accessible via html browsers, which includes this syllabus. Click on my courses' page of my resume. You can also find information on courses that I have taught in the past.

Grading and General Information

Grading will be done with plus/minus refinement.

There will be two homework assignments of approximately equal weight and one Maple programming projects. At the end of the course, each student will give a 30 minute presentation on paper in the last 3 ISSAC Conferences 2004-2006 and write a 3-5 page discussion of the ideas. The ISSAC Proceedings will be provided by me. Class attendance will not be monitored in any way. If you need assistance in any way, please let me know (see also the University's policy).

Academic Standards

Late submissions: All homeworks and projects must be submitted on time. The following penalties are given for (unexcused) late submissions:

Old Announcements

©2007 Erich Kaltofen. Permission to use provided that copyright notice is not removed.