Computer Science 780: Advanced Symbolic Computation

Winter 2004

General Information

• Course personnel
  • Keith Geddes
  • Mark Giesbrecht
• Course Description: The goal of this course is a deep investigation into fundamental problems of symbolic computation. This year we will look at three topics:
  1. Symbolic Integration and Symbolic-Numeric Integration
  2. Groebner Bases and Solving Non-Linear Systems
  3. SNAP: Symbolic-Numeric Algorithms for Polynomials
• Course Outline
• Assignments and projects
• Announcements
  • Lecture Schedule for Feb 13-20:
    Fri 13 Feb: No lecture (due to research group meeting at UWO)
    Mon 16 Feb, 1:30-2:30 in DC 3313 (in place of Friday's lecture)
    Wed 18 Feb, 1:30-3:30 in RCH 205, as usual
    Fri 20 Feb: No lecture (due to "reading break")
  • Lecture Schedule:
    Wednesdays, 1:30-3:30 in RCH 205
    Fridays, 11:30-12:30 in DC 3314
  • Organizational Meeting: Mon 12 Jan 2004, 11:30 am in DC 3313
  • Lectures for the course will begin immediately next week, on a schedule of
    two 1.5-hr lectures per week.
  • At the organizational meeting, we will decide on the days of the week and the times for the lectures.
    • Keith's first proposal for the lecture schedule: Mon afternoon and Wed afternoon (times to be decided) OR Wed afternoon and Fri afternoon (times to be decided)

Resources

• Textbooks (none required)
  • Algorithms for Computer Algebra by K.O. Geddes, S.R. Czapor, and G. Labahn, Kluwer Academic Publishers, 1992.
  • Symbolic Integration I: Transcendental Functions by Manuel Bronstein, Springer-Verlag, 1997.
  • Modern Computer Algebra by J. von zur Gathen and J. Gerhard, Cambridge University Press, 1999.
  • Ideals, Varieties, and Algorithms, 2nd ed. by D. Cox, J. Little and D. O'Shea, Springer-Verlag, 1996.
• Research Articles Archive
• Maple Worksheets