Resultant-based methods for plane curves intersection problems

http://www.springeronline.com/3-540-28966-6We present an algorithm for solving polynomial equations, which uses generalized eigenvalues and eigenvectors of resultant matrices. We give special attention to the case of two bivariate polynomials and the Sylvester or Bezout resultant constructions. We propose a new method to treat multiple roots, detail its numerical aspects and describe experiments on tangential problems, which show the efficiency of the approach. An industrial application of the method is presented at the end of the paper. It consists in recovering cylinders from a large cloud of points and requires intensive resolution of polynomial equations

Resultant-based methods for plane curves intersection problems

http://www.springeronline.com/3-540-28966-6We present an algorithm for solving polynomial equations, which uses generalized eigenvalues and eigenvectors of resultant matrices. We give special attention to the case of two bivariate polynomials and the Sylvester or Bezout resultant constructions. We propose a new method to treat multiple roots, detail its numerical aspects and describe experiments on tangential problems, which show the efficiency of the approach. An industrial application of the method is presented at the end of the paper. It consists in recovering cylinders from a large cloud of points and requires intensive resolution of polynomial equations

The implicit equation of a canal surface

A canal surface is an envelope of a one parameter family of spheres. In this paper we present an efficient algorithm for computing the implicit equation of a canal surface generated by a rational family of spheres. By using Laguerre and Lie geometries, we relate the equation of the canal surface to the equation of a dual variety of a certain curve in 5-dimensional projective space. We define the \mu-basis for arbitrary dimension and give a simple algorithm for its computation. This is then applied to the dual variety, which allows us to deduce the implicit equations of the the dual variety, the canal surface and any offset to the canal surface.Comment: 26 pages, to be published in Journal of Symbolic Computatio

Roots of bivariate polynomial systems via determinantal representations

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal representation is suitable for polynomials with scalar or matrix coefficients, and consists of matrices with asymptotic order $n^2/4$, where $n$ is the degree of the polynomial. The second representation is useful for scalar polynomials and has asymptotic order $n^2/6$. The resulting method to compute the roots of a system of two bivariate polynomials is competitive with some existing methods for polynomials up to degree 10, as well as for polynomials with a small number of terms.Comment: 22 pages, 9 figure

Algebraic and analytical tools for the study of the period function

In this paper we consider analytic planar differential systems having a first integral of the form H(x, y) = A(x) + B(x)y + C(x)y2 and an integrating factor κ(x) not depending on y. Our aim is to provide tools to study the period function of the centers of this type of differential system and to this end we prove three results. Theorem A gives a characterization of isochronicity, a criterion to bound the number of critical periods and a necessary condition for the period function to be monotone. Theorem B is intended for being applied in combination with Theorem A in an algebraic setting that we shall specify. Finally, Theorem C is devoted to study the number of critical periods bifurcating from the period annulus of an isochrone perturbed linearly inside a family of centers. Four different applications are given to illustrate these results

Algebraic and analytical tools for the study of the period function

In this paper we consider analytic planar differential systems having a first integral of the form H(x, y) = A(x) + B(x)y + C(x)y2 and an integrating factor κ(x) not depending on y. Our aim is to provide tools to study the period function of the centers of this type of differential system and to this end we prove three results. Theorem A gives a characterization of isochronicity, a criterion to bound the number of critical periods and a necessary condition for the period function to be monotone. Theorem B is intended for being applied in combination with Theorem A in an algebraic setting that we shall specify. Finally, Theorem C is devoted to study the number of critical periods bifurcating from the period annulus of an isochrone perturbed linearly inside a family of centers. Four different applications are given to illustrate these results

Separating linear forms and Rational Univariate Representations of bivariate systems

International audienceWe address the problem of solving systems of bivariate polynomials with integer coefficients. We first present an algorithm for computing a separating linear form of such systems, that is a linear combination of the variables that takes different values when evaluated at distinct (complex) solutions of the system. In other words, a separating linear form defines a shear of the coordinate system that sends the algebraic system in generic position, in the sense that no two distinct solutions are vertically aligned. The computation of such linear forms is at the core of most algorithms that solve algebraic systems by computing rational parameterizations of the solutions and, moreover, the computation of a separating linear form is the bottleneck of these algorithms, in terms of worst-case bit complexity. Given two bivariate polynomials of total degree at most $d$ with integer coefficients of bitsize at most~$\tau$, our algorithm computes a separating linear form {of bitsize $O(\log d)$} in \comp\ bit operations in the worst case, which decreases by a factor $d^2$ the best known complexity for this problem (where \sO refers to the complexity where polylogarithmic factors are omitted and $O_B$ refers to the bit complexity). We then present simple polynomial formulas for the Rational Univariate Representations (RURs) of such systems. {This yields that, given a separating linear form of bitsize $O(\log d)$, the corresponding RUR can be computed in worst-case bit complexity \sOB(d^7+d^6\tau) and that its coefficients have bitsize \sO(d^2+d\tau).} We show in addition that isolating boxes of the solutions of the system can be computed from the RUR with \sOB(d^{8}+d^7\tau) bit operations in the worst case. Finally, we show how a RUR can be used to evaluate the sign of a bivariate polynomial (of degree at most $d$ and bitsize at most $\tau$) at one real solution of the system in \sOB(d^{8}+d^7\tau) bit operations and at all the $\Theta(d^2)$ real solutions in only $O(d)$ times that for one solution