Related papers: Backtracking New Q-Newton's method, Schr\"oder's t…
We use simple equations in order to compare the basins of attraction on the complex plane, corresponding to a large collection of numerical methods, of several order. Two cases are considered, regarding the total number of the roots, which…
We give iterative constructions for irreducible polynomials over F_q of degree nt^r for all nonnegative integers r, starting from irreducible polynomials of degree n. The iterative constructions correspond modulo fractional linear…
This paper presents a novel variant of the Broyden quasi-Newton secant-type method aimed at solving constrained mixed generalized equations, which can include functions that are not necessarily differentiable. The proposed method integrates…
When studying the multilinear PageRank problem, a system of polynomial equations needs to be solved. In this paper, we develop convergence theory for a modified Newton method in a particular parameter regime. The sequence of vectors…
Quasi-Newton methods refer to a class of algorithms at the interface between first and second order methods. They aim to progress as substantially as second order methods per iteration, while maintaining the computational complexity of…
This paper addresses the challenge of developing efficient algorithms for large-scale nonconvex multiobjective optimization problems (MOPs). While quasi-Newton methods are effective, their traditional application to MOPs is computationally…
The Newton-Raphson method is a fundamental root-finding technique with numerous applications in physics. In this study, we propose a parameterized variant of the Newton-Raphson method, inspired by principles from physics. Through analytical…
Newton's method is a fundamental technique in optimization with quadratic convergence within a neighborhood around the optimum. However reaching this neighborhood is often slow and dominates the computational costs. We exploit two…
We show that there exists an entire function f without zeros for which the associated Newton function N(z)=z-f(z)/f'(z) is a transcendental meromorphic functions without Baker domains. We also show that there exists an entire function f…
We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…
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…
This paper is a continuation of our papers \cite{EK1, EK2}. In \cite{EK2} we showed that for the root system $A_{n-1}$ one can obtain Macdonald's polynomials as weighted traces of intertwining operators between certain finite-dimensional…
We consider the phase retrieval problem, which involves recovering a rank-one positive semidefinite matrix from rank-one measurements. A recently proposed algorithm based on Bures-Wasserstein gradient descent (BWGD) exhibits superlinear…
This paper is a continuation of our papers [EK1, EK2]. In [EK2] we showed that for the root system A_n-1 one can obtain Macdonald's polynomials - a new interesting class of symmetric functions recently defined by I. Macdonald {M1] - as…
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…
These notes are not intended to substitute for a course in linear algebra on reduction of endomorphisms nor an exhaustive presentation of the Dunford's decomposition. We will limit ourselves to the case where the base is R or C, and the…
Some fractional Newton methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper we introduce a fractional Newton method with order $\alpha+1$ and compare with another fractional…
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…
We propose a gauge model of quantum electrodynamics (QED) and its nonabelian generalization from which we derive knot invariants such as the Jones polynomial. Our approach is inspired by the work of Witten who derived knot invariants from…
This paper aims to develop a Newton-type method to solve a class of nonconvex composite programs. In particular, the nonsmooth part is possibly nonconvex. To tackle the nonconvexity, we develop a notion of strong prox-regularity which is…