Related papers: Numerical Root Finding via Cox Rings
We examine a method for solving an infinite-dimensional tensor eigenvalue problem $H x = \lambda x$, where the infinite-dimensional symmetric matrix $H$ exhibits a translational invariant structure. We provide a formulation of this type of…
We examine several of the normal-form multivariate polynomial rootfinding methods of Telen, Mourrain, and Van Barel and some variants of those methods. We analyze the performance of these variants in terms of their asymptotic temporal…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
We propose a new approach to the numerical solution of ergodic problems arising in the homogenization of Hamilton-Jacobi (HJ) equations. It is based on a Newton-like method for solving inconsistent systems of nonlinear equations, coming…
An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…
In this article we show and implement a simple and effcient method to strictly locate eigenvectors and eigenvalues of a given matrix, based on the modified cone condition. As a consequence we can also effectively localize zeros of complex…
The approximation of a multiple isolated root is a difficult problem. In fact the root can even be a repulsive root for a fixed point method like the Newton method. However there exists a huge literature on this topic but the answers given…
Quartic eigenvalue problem $(\lambda^4 A + \lambda^3 B + \lambda^2C + \lambda D + E)x = \mathbf{0}$ naturally arises e.g. when solving the Orr-Sommerfeld equation in the analysis of the stability of the {Poiseuille} flow, in theoretical…
Using the interplay between topological, combinatorial, and geometric properties of polynomials and analytic results (primarily the covering structure and distortion estimates), we analyze a path-lifting method for finding approximate…
We describe several algorithms for computing $e$-th roots of elements in a number field $K$, where $e$ is an odd prime-power integer. In particular we generalize Couveignes' and Thom\'e's algorithms originally designed to compute…
We revisit the notion of root polynomials, thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020] for general polynomial matrices, and…
Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the…
In this paper, we present several algorithms for dealing with graded components of Laurent polynomial rings. To be more precise, let $S$ be the Laurent polynomial ring $k[x_1,...,x_{r},x_{r+1}^{\pm 1},..., x_n^{\pm 1}]$, $k$ algebraicaly…
The objective of this paper is to show how the recently proposed method by Giusti, Heintz, Morais, Morgenstern, Pardo \cite{gihemorpar} can be applied to a case of real polynomial equation solving. Our main result concerns the problem of…
We design and analyze an algorithm for computing solutions with coefficients in a finite field $\mathbb{F}_q$ of underdetermined systems defined over $\mathbb{F}_q$. The algorithm is based on reductions to zero-dimensional searches. The…
This paper seeks to further explore the distribution of the real roots of random polynomials with non-centered coefficients. We focus on polynomials where the typical values of the coefficients have power growth and count the average number…
This work proposes a novel convex-non-convex formulation of the image segmentation and the image completion problems. The proposed approach is based on the minimization of a functional involving two distinct regularization terms: one…
We investigate nodal radial solutions to semilinear problems of type \[\begin{cases}-\Delta u = f(|x|,u) \qquad & \text{ in } \Omega, \newline u= 0 & \text{ on } \partial \Omega, \end{cases} \] where $\Omega$ is a bounded radially symmetric…
Let $L \subset \mathbb{C}^r \otimes \mathbb{C}[x_1^\pm, \ldots, x_n^\pm]$ be a finite dimensional subspace of vector-valued Laurent polynomials invariant under the action of torus $(\mathbb{C}^*)^n$. We study subvarieties in the torus,…
Motivated by the interest in computing explicit formulas for resultants and discriminants initiated by B\'ezout, Cayley and Sylvester in the eighteenth and nineteenth centuries, and emphasized in the latest years due to the increase of…