Related papers: Algorithms for Checking Rational Roots of $b$-func…
We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…
We study a set of topological roots of the local Bernstein-Sato polynomial of arbitrary plane curve singularities. These roots are characterized in terms of certain divisorial valuations and the numerical data of the minimal log resolution.…
We generalize the Bernstein-Sato polynomials of Budur, Mustata and Saito to ideals in normal semigroup rings. In the case of monomial ideals, we also relate the roots of the Bernstein-Sato polynomial to the jumping coefficients of the…
Let $G$ be a linearly reductive group acting on a vector space $V$, and $f$ a (semi-)invariant polynomial on $V$. In this paper we study systematically decompositions of the Bernstein-Sato polynomial of $f$ in parallel with some…
Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a…
This paper is concerned with certifying that a given point is near an exact root of an overdetermined or singular polynomial system with rational coefficients. The difficulty lies in the fact that consistency of overdetermined systems is…
Many problems in applied mathematics require root finding algorithms. Unfortunately, root finding methods have limitations. Firstly, regarding the convergence, there is a trade-off between the size of it's domain and it's rate. Secondly the…
In this paper, we study functions of the roots of a univariate polynomial in which the roots have a given multiplicity structure $\mu$. Traditionally, root functions are studied via the theory of symmetric polynomials; we extend this theory…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system $f_1=\cdots=f_n=0$, with $f_i\in\mathbb{C}[x_1,\ldots,x_n]$, and a…
Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…
We present a practical implementation based on Newton's method to find all roots of several families of complex polynomials of degrees exceeding one billion ($10^9$) so that the observed complexity to find all roots is between $O(d\ln d)$…
For a central, not necessarily reduced, hyperplane arrangement $f$ equipped with any factorization $f = f_{1} \cdots f_{r}$ and for $f^{\prime}$ dividing $f$, we consider a more general type of Bernstein--Sato ideal consisting of the…
We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of degree d, with rational coefficients of bit size bounded by…
Approximating the roots of a holomorphic function in an input box is a fundamental problem in many domains. Most algorithms in the literature for solving this problem are conditional, i.e., they make some simplifying assumptions, such as,…
Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…
We present algorithmic, complexity and implementation results for the problem of isolating the real roots of a univariate polynomial in $B_{\alpha} \in L[y]$, where $L=\QQ(\alpha)$ is a simple algebraic extension of the rational numbers. We…
Given a multivariate real (or complex) polynomial $p$ and a domain $\cal D$, we would like to decide whether an algorithm exists to evaluate $p(x)$ accurately for all $x \in {\cal D}$ using rounded real (or complex) arithmetic. Here…
We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…
In this article, we develop a positive characteristic analogue of the Bernstein--Sato theory for holonomic D-modules in the complex setting. We work with D-modules on a Noetherian regular $F$-finite $\mathbb{F}_p$-scheme $X$, and define…