Department of Mathematics
Server

Parallel computing is an increasingly important research field in high performance computing, especially nowadays when multicore processors have become a standard component in almost all computing devices.

In computer algebra, the solving of polynomial equations is a fundamental problem that scales well on parallel computing. One of its important subproblems is computing the resultant.

In this talk we review a few parallel algorithms on the resultant and examine some key ideas to decide which of them offers a better processor utilization that can be considered for our algorithm (which is currently under development).

We also discuss attempts on extending resultants to skew polynomials over division rings.