Symbolic Computation

This page is about the Symbolic Computation courses in the Computer Engineering department of Gebze Technical University.

Undergraduate Course CSE 426

This course is a last year elective course in the curriculum of the Computer Engineering Department. The purppose is to introduce students to the amazing world of symbolic computation and the endless possibilities it provides. The students get an overview of some parts of the field, mostly related to applications and engineering questions. The main evaluation method is participation in class and the project (but there is also a final exam).

Although the content is the same as for the graduate course, the expectations are different. The main expectation from undergrad student is for them to explore what symbolic computation can offer to them. Connect it to what they know already and potentially decide how they can relate to symbolic computation in the future.

Graduate Course CSE 526

This course is a graduate elective course in the curriculum of the Natural Sciences Instiute graduate curriculum. The purppose is to introduce students to the methodology of symbolic computation and the wealth of its applications. The students get an overview of some parts of the field, mostly related to applications and engineering questions. The main evaluation method is participation in class and the project (but there is also a final exam).

Although the topics covered are the same as for CSE 426, the expectations are different. The main expectation from grad students is to complete a semester project that could be considered as a small research or review paper.

The most important expected outcome is the understanding of importantace and applicabity of exact computation in mathematics and computer science alike.

Project Topics

You can also collaborate in teams of 2-3 students. If the number is 3, then at least one undergraduate must be part of the team. A team can also combine topics from the list. For example:
  • Systolic Algorithms in FPGA, Integer/Polynomial Arithmetic in AVX-512 (Xeon Phi), Continued Fraction Arithmetic
  • Parallel Groebner Bases, Machine Learning for Grobner bases, Parallel Real Root Isolation
  • Syllabus

    The CSE 426/626 Symbolic Computation course is attended by both undergrad and grad students. The requirements for success for these two groups differ.

    CSE 426
    20Participation in class
    20Midterm exam
    20Final exam
    30Project
    20Presentation

    CSE 626
    20Participation in class
    20Final exam
    35Project
    25Presentation

    Participation in class

    You are expected to participate in class, interacting with the rest of us (collectively, not in small groups during the lecture).

    Midterm exam

    For undergraduate students this will be a checkpoint to make sure you understood the first part of the lecture.

    Final exam

    Well, that will be the final exam.

    Project

    A project should be completed and presented in during the course. You should choose a topic as early as possible in order to have more time to complete it. You should choose a topic late enough to be able to know you like it.

    Presentation

    The presentation is either the presentation of your project or of some other topic.