Related papers: Algorithms for Checking Rational Roots of $b$-func…

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

This paper is concerned with exact real solving of well-constrained, bivariate polynomial systems. The main problem is to isolate all common real roots in rational rectangles, and to determine their intersection multiplicities. We present…

Univariate polynomial root-finding has been studied for four millennia and very intensively in the last decades. Our new near-optimal root-finders approximate all zeros of a polynomial p almost as fast as one accesses its coefficients with…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…

We prove a conjecture of the first author relating the Bernstein-Sato ideal of a finite collection of multivariate polynomials with cohomology support loci of rank one complex local systems. This generalizes a classical theorem of Malgrange…

Satisfiability Modulo the Theory of Nonlinear Real Arithmetic, SMT(NRA) for short, concerns the satisfiability of polynomial formulas, which are quantifier-free Boolean combinations of polynomial equations and inequalities with integer…

Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for…

Given a family of analytic functions near 0 \in C^n parametrized by a smooth space, we study the Bernstein polynomial of the fiber on an irreducible variety V of the space of parameters and we show that it is generically constant. We prove…

Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…

This article describes a normal form algorithm for the Brieskorn lattice of an isolated hypersurface singularity. It is the basis of efficient algorithms to compute the Bernstein-Sato polynomial, the complex monodromy, and Hodge-theoretic…

As showed in (Fiedler, 1990), any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be…

We show that there is a pair of homogeneous polynomials such that the sets of roots of their Bernstein-Sato polynomials which are strictly supported at the origin are different although the sets of roots which are not strictly supported at…

In characteristic zero, the Bernstein-Sato polynomial of a hypersurface can be described as the minimal polynomial of the action of an Euler operator on a suitable D-module. We consider the analogous D-module in positive characteristic, and…

A novel very simple method for finding roots of polynomials over finite fields has been proposed. The essence of the proposed method is to search the roots via nested cycles over the subgroups of the multiplicative group of the Galois…

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{\"o}nhage's efficient algorithm of 1982 for a single root radius. We revisit this extension, advance it, based on our simple but…

We compute the Bernstein-Sato polynomial of $f$, a function which given a pair $(M,v)$ in $X = M_n(\mathbf{C}) \times \mathbf{C}^n$ tests whether $v$ is a cyclic vector for $M$. The proof includes a description of shift operators…

This is the second part of a work dedicated to the study of Bernstein-Sato polynomials for several analytic functions depending on parameters. In this part, we give constructive results generalizing previous ones obtained by the author in…

We present an algorithm to compute all factorizations into linear factors of univariate polynomials over the split quaternions, provided such a factorization exists. Failure of the algorithm is equivalent to non-factorizability for which we…

The paper presents (human-oriented) specification and (pen-and-paper) verification of the square root function. The function implements Newton method and uses a look-up table for initial approximations. Specification is done in terms of…