Closed formulae for multiple roots of univariate polynomials through subresultants

TL;DR

This paper introduces new formulae using subresultants to efficiently compute the roots of univariate polynomials with multiple roots, simplifying the analysis of algebraic curves' topology even in non-general position cases.

Contribution

The paper presents novel rational formulae involving subresultants for describing multiple roots of univariate polynomials, enabling easier topology computation of algebraic curves.

Findings

Topology of cubics, quartics, and quintics can be computed easily even if not in general position.

New subresultant-based formulae describe multiple roots with at most one square root.

Technique applied to intersection of quadrics and ellipsoids.

Abstract

The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite number of changes of coordinates will move the initial curve to one in general position. We will show many cases where the topology of the considered curve around a critical point is very easy to compute even if the curve is not in general position. This will be achieved by introducing a new family of formulae describing, in many cases and through subresultants, the multiple roots of a univariate polynomial as rational functions of the considered polynomial involving at most one square root. This new approach will be used to show that the topology of cubics, quartics and quintics can be computed easily even if the curve is not in general position and to characterise those higher degree curves where this approach can be used. We will apply also this technique to determine the intersection curve of two quadrics and to study how to characterise the type of the curve arising when intersecting two ellipsoids.