Related papers: New simultaneous methods for finding all zeros of …

This paper proposes new proximal Newton-type methods with a diagonal metric for solving composite optimization problems whose objective function is the sum of a twice continuously differentiable function and a proper closed directionally…

Finding an approximate region containing all the zeros of analytic polynomials is a well-studied problem. But the numb er of the zeros and regions containing all the zeros of complex-valued harmonic polynomials is relatively a fresh…

We show that the zeros of consecutive orthogonal polynomials $p_n$ and $p_{n-1}$ are linearly connected by a doubly stochastic matrix for which the entries are explicitly computed in terms of Christoffel numbers. We give similar results for…

We study the simultaneous zeros of a random family of $d$ polynomials in $d$ variables over the $p$-adic numbers. For a family of natural models, we obtain an explicit constant for the expected number of zeros that lie in the $d$-fold…

We describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equations. If the coordinates of the input systems and the initial…

We give sufficient conditions under which a polyanalytic polynomial of degree $n$ has (i) at least one zero, and (ii) finitely many zeros. In the latter case, we prove that the number of zeros is bounded by $n^2$. We then show that for all…

We are concerned with the tensor equations whose coefficient tensor is an M-tensor. We first propose a Newton method for solving the equation with a positive constant term and establish its global and quadratic convergence. Then we extend…

We give a survey concerning both very classical and recent results on the electrostatic interpretation of the zeros of some well-known families of polynomials, and the interplay between these models and the asymptotic distribution of their…

Monotone inclusions involving the sum of three maximally monotone operators or more have received much attention in recent years. In this paper, we propose three splitting algorithms for finding a zero of the sum of four monotone operators,…

A probabilistic approach to the study of the number of zeros of complex harmonic polynomials was initiated by W. Li and A. Wei (2009), who derived a Kac-Rice type formula for the expected number of zeros of random harmonic polynomials with…

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…

Splitting algorithms for finding a zero of sum of operators often involve multiple steps which are referred to as forward or backward steps. Forward steps are the explicit use of the operators and backward steps involve the operators…

In this work, by using techniques and results of differential geometry, we propose a new numerical method on complete Riemannian manifolds to find zeros of vector fields. Our algorithm generalizes the classical secant method

In this paper we present in detail Newton's method and its modification, based on the Continuous analog of Newton's method for computing periodic orbits of the planar three-body problem. The linear system at each step of the method is…

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

This paper investigates the zero distribution of a sequence of polynomials $\left\{ P_{m}(z)\right\} _{m=0}^{\infty}$ generated by the reciprocal of $1+ct+B(z)t^{2}+A(z)t^{3}$ where $c\in\mathbb{R}$ and $A(z)$, $B(z)$ are real linear…

Our goal in this paper is to study the zero distribution of a sequence of polynomials whose coefficients satisfy a three-term recurrence. Equivalently, these polynomials are Taylor polynomials of a rational function with a polynomial…

Null points are important locations in vector fields, such as a magnetic field. A new technique (a trilinear method for finding null points) is presented for finding null points over a large grid of points, such as those derived from a…

We present different techniques for applying Combinatorial Nullstellensatz to polynomials over finite fields. For examples, we generalize theorems from Noga Alon's paper on the subject, and present a few of our own.

We find a polynomial in three variables whose values at nonnegative integers satisfy the Erd\H{o}s-Straus Conjecture. Although the perfect squares are not covered by these values, it allows us to prove that there are arbitrarily long…