Related papers: Algorithms for Checking Rational Roots of $b$-func…
The singularity theory of rational functions, i.e., the quotient of two polynomials, has been investigated in the past two decades. The Bernstein-Sato polynomial of a rational function has recently been introduced by Takeuchi. However, only…
We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…
We develop a theory of Bernstein-Sato polynomials for meromorphic functions and we use it to study the analytic continuation of Archimedian local zeta functions in this setting. We also introduce both an analytic and an algebraic theory of…
We give estimates for the zero loci of Bernstein-Sato ideals. An upper bound is proved as a multivariate generalisation of the upper bound by Lichtin for the roots of Bernstein-Sato polynomials. The lower bounds generalise the fact that…
We give an introduction to a theory of b-functions, i.e. Bernstein-Sato polynomials. After reviewing some facts from D-modules, we introduce b-functions including the one for arbitrary ideals of the structure sheaf. We explain the relation…
We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…
Given $p$ polynomials with coefficients in a commutative unitary integral ring $\mathcal{C}$ containing $\mathbb{Q}$, we define the notion of a generic Bernstein-Sato polynomial on an irreducible affine scheme $V \subset…
A function that is analytic on a domain of $\mathbb{C}^n$ is holonomic if it is the solution to a holonomic system of linear homogeneous differential equations with polynomial coefficients. We define and study the Bernstein-Sato polynomial…
It is proposed the algorithm that find a basis of the ideal and a basis of the space of all root functionals by using the extension operation for bounded root functionals, when the number of polynomials is equal to the number of variables,…
Following work of Musta\c{t}\u{a} and Bitoun we recently developed a notion of Bernstein-Sato roots for arbitrary ideals, which is a prime characteristic analogue for the roots of the Bernstein-Sato polynomial. Here we prove that for…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…
We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…
We describe the roots of the Bernstein-Sato polynomial of a monomial ideal using reduction mod p and invariants of singularities in positive chracteristic. We give in this setting a positive answer to a problem of Takagi, Watanabe and the…
We define Bernstein-Sato polynomials for meromorphic functions and study their basic properties. In particular, we prove a Kashiwara-Malgrange type theorem on their geometric monodromies, which would be useful also in relation with the…
We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…
We overview numerous algorithms in computational $D$-module theory together with the theoretical background as well as the implementation in the computer algebra system \textsc{Singular}. We discuss new approaches to the computation of…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
We give an anecdotal discussion of the problem of searching for polynomials with all roots on the unit circle, whose coefficients are rational numbers subject to certain congruence conditions. We illustrate with an example from a…
We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…