# Applied Symbolic Computation (CS 300)

Announcments  Lectures  Programs  Course Resources   Assignments and Labs  Grading Policy
Course Description
This course covers the fundamentals of symbolic mathematical methods as embodied in symbolic mathematics software systems, including: fundamental techniques, simplification of expressions, solution of applications problems, intermediate expressions swell, basic economics of symbolic manipulation, efficient solution methods for large problems, hybrid symbolic/numeric techniques.
Course Goals
To provide students with the skills, judgment, and spirit necessary to effectively use a symbolic mathematics system such as Maple. To learn the features and limitations of Maple and related systems. To see how Maple can be used to solve a wide range of computational and mathematical problems. To see how computational tools can be applied to various application domains such as cryptography, signal processing, robotics, algorithm design and analysis, code generation, algebra and number theory, and scientific problems. To reinforce, through computational examples, students' understanding of mathematical concepts learned in previous courses.

This term, the course will focus algorithms for and applications of the exact solution of linear and non-linear systems.

Course Objectives
• To be able to use Maple (or similar system) to solve computational and mathematical problems.
• To be able to write Maple scripts to perform and analyze a series of computations, and to extend the features of Maple to solve a problem of interest
• To understand the difference between numeric and symbolic computation.
• To use Maple to explore a mathematical theorem, example, or concept or other scientific or engineering problems.
• To appreciate the limitations and features (symbolic, numeric, mathematical, visual, programming) of a symbolic mathematics system such as Maple.
• To use and understand some fundamental algebraic computations and algorithms (e.g. Euclidean algorithm, modular arithmetic and the Chinese Remainder theorem, fast Fourier transform, Groebner bases).
Audience
Undergraduate computer science, mathematics, engineering, and science students interested in learning about and applying computer algebra systems, such as MAPLE, to various application areas. The course is appropriate for students interested in scientific programming and an introduction to the algorithms underlying systems like MAPLE. The course counts towards the numeric and symbolic computing track for computer science students.
Prerequisites
Undergraduate data structures course (CS 260)
Courses in calculus (MATH 200 or equivalent), linear algebra (MATH 201 or equivalent), discrete mathematics (MATH 221 or equivalent).
Instructor
Jeremy Johnson
Office: University Crossings 139
phone: (215) 895-2893
e-mail: johnsojr@drexel.edu
office hours: TR 11-12 and M 8-9 (online), Additional hours by appointment.
Course Assistant
Rachel Goeken
Office: Cyber Learning Center
e-mail: rmg92@drexel.edu
office hours: T 4-6.
Course Meeting Time
TR 2:00-3:20 in Rush 014
Course Announcements and Discussion
Use piazza
Textbook

This course requires Maple 2016. Maple 2016 is available to Drexel students through a site license and may be obtained through IRT's software site. Course notes will be provided on the web page as Maple worksheets that can not be read without Maple. Students will also use the LinBox library for computational linear algebra. Additional resources are listed below.
1. Maplesoft
3. Maple User Manual
4. Maple Progrmaming Guide
5. Project LinBox: Exact computational linear algebra
6. In addition there students will be required to read journal articles and readings from texts available from the Drexel library.

### Topics

1. Introduction to symbolic mathematics systems in general and Maple in particular.
2. Effective use of Maple.
3. Programming in Maple.
4. Algorithms for exact arithmetic
5. Fundamental computer algebra algorithms such as the Euclidea algorithm, Chinese remainder algorithm, Fast Fourier transform (FFT), Guassian elimination, Hensel lifting, Berlekamp/Massey, Groebner bases.
6. Exact solution of linear systems
7. Exact solution of non-linear systems
8. Applications to cryptography, optimization, robotics.

1. Homework assignments (60% - 4 X 15%)
2. In class participation (labs and quizzes) (20%)
3. Final Project - due during the scheduled time of the final (20%)
Labs will be done in small groups. Assignments and quizzes will be returned on a regular basis to provide feedback to students. Assignments and quizzes must be done individually. Any violation of this will result in a zero grade for the assignment. A second violation may lead to an F for the course.

Grades are based on a curve with the mean normalized to a B provided the mean performance shows competency of the material.

Reference Books
1. tba
Web Pages

### Announcements and Discussion Board

See Piazza Discussion Forum for announcements and to ask questions and discuss course material.

### Lectures

This list is subject to change.

### Assignments and Labs

• lab1.mw (Higher Order Fibonacci Numbers, Companion Matrices and Eigenvalues) in class Jan. 11, 2018
• assign1.mw (Euclidean Algorithm) - due Sat. Jan 27 at 11:59pm.
• Quiz 1 (Jan. 18, 2018) Linear Recurrences and Induction.
• lab2.mw (Bit Complexity of the Euclidean Algorithm and Lehmer's Improvement) in class Jan. 25, 2018.
• assign2.mw (Modular Algorithms and Interpolation) - due Sat. Feb. 7 at 11:59pm.
• lab3.mw (Modular FFTs) in class Feb. 15.
• Quiz 2 (Feb. 27, 2018) Computing time analysis, recurrence relations and bit complexity
• assign3.mw (Linear Systems, Matrices, Determinants and Gaussian Elimination) - due Wed. Feb. 28 at 11:59pm.
• lab4.mw (Continued Fractions and Rational Reconstruction) - due Wed. Mar. 7.
• Quiz 3 (Mar. 8, 2018) Modular algorithms and determinants
• assign4.mw (Dixon's algorithm) - due Wed. Mar. 14 at 11:59pm.
• Final project due Mar. 24 at 11:59pm

### Solutions

• Solution to Assignment will be posted in Piazza (do not distribute).
Created: 12/20/16 (revised 2/20/18) by jjohnson AT cs DOT drexel DOT edu