Related papers: Virtual Immediate Basins of Newton Maps and Asympt…

A new method of root finding is formulated that uses a numerical iterative process involving three points. A given function y = f(x) whose roots are desired is fitted and approximated by a polynomial function of the form P(x)= a(x-b)^N that…

In this paper we prove the infinitesimal uniqueness theorem for the Newton potential of non simply connected bodies using the singularity theory approach. We consider the Newtonian potentials of the domains in ${\bf R}^n$ boundaries of…

This paper is concerned with an algorithm for finding a singularity of the nonsmooth vector fields. Firstly, we discuss the main results of the Newton method presented in [1] for solving the aforementioned problem. Combining this method…

Let $X$ be a compact metric space and $f:X\to X$ a homeomorphism on $X$. We construct a fundamental domain for the set with finite peaks for each cocycle induced by $\phi\in C(X,R)$. In particular we prove that if a partially hyperbolic…

We define Baker omitted value, in short bov, of an entire or meromorphic function f in the complex plane as an omitted value for which there exists r0 > 0 such that for each ball Dr(a) centered at a and with radius r satisfying 0 < r < r0,…

We introduce matrix algebra of subsets in metric spaces and we apply it to improve results of Yamauchi and Davila regarding Asymptotic Property C. Here is a representative result: Suppose $X$ is an $\infty$-pseudo-metric space and $n\ge 0$…

Newton method is one of the most powerful methods for finding solutions of nonlinear equations and for proving their existence. In its "pure" form it has fast convergence near the solution, but small convergence domain. On the other hand…

We specify a small set, consisting of $O(d(\log\log d)^2)$ points, that intersects the basins under Newton's method of \emph{all} roots of \emph{all} (suitably normalized) complex polynomials of fixed degrees $d$, with arbitrarily high…

Superlinear convergence has been an elusive goal for black-box nonsmooth optimization. Even in the convex case, the subgradient method is very slow, and while some cutting plane algorithms, including traditional bundle methods, are popular…

Let $\mathbb{C}_v$ be a characteristic zero algebraically closed field which is complete with respect to a non-Archimedean absolute value. We provide a necessary and sufficient condition for two tame polynomials in $\mathbb{C}_v[z]$ of…

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…

Let $C_{n,g}$ be the number of rooted cubic maps with $2n$ vertices on the orientable surface of genus $g$. We show that the sequence $(C_{n,g}:g\ge 0)$ is asymptotically normal with mean and variance asymptotic to $(1/2)(n-\ln n)$ and…

We obtain the asymptotic variance, as the degree goes to infinity, of the normalized number of real roots of a square Kostlan-Shub-Smale random polynomial system of any size. Our main tools are the Kac-Rice formula for the second factorial…

Let $\Phi:\mathcal{H}\longrightarrow\mathbb{R\cup}\left\{ +\infty\right\} $ be a closed convex proper function on a real Hilbert space $\mathcal{H}$, and $\partial\Phi:\mathcal{H}\rightrightarrows\mathcal{H}$ its subdifferential. For any…

The Newton-Raphson (N-R) method is useful to find the roots of a polynomial of degree n. However, this method is limited since it diverges for the case in which polynomials only have complex roots if a real initial condition is taken. In…

Nearest neighbor random walks in the quarter plane that are absorbed when reaching the boundary are studied. The cases of positive and zero drift are considered. Absorption probabilities at a given time and at a given site are made…

The Newton method is a powerful optimization algorithm, valued for its rapid local convergence and elegant geometric properties. However, its theoretical guarantees are usually limited to convex problems. In this work, we ask whether…

We propose a second-order method for unconditional minimization of functions $f(z)$ of complex arguments. We call it the Mixed Newton Method due to the use of the mixed Wirtinger derivative $\frac{\partial^2f}{\partial\bar z\partial z}$ for…

We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…

In this paper we numerically explore the convergence properties of the pseudo-Newtonian circular restricted problem of three and four primary bodies. The classical Newton-Raphson iterative scheme is used for revealing the basins of…