Related papers: Dynamics of Newton-like root finding methods

The main object of this paper is to obtain several symmetric properties of the q-Zeta type functions. As applications of these properties, we give some new interesting identities for the modified q-Genocchi polynomials. Finally, our…

A generalization of Newton's identity on symmetric functions is given. Using the generalized Newton identity we give a unified method to show the existence of Hall-Littlewood, Jack and Macdonald polynomials. We also give a simple proof of…

Several algorithms in computer algebra involve the computation of a power series solution of a given ordinary differential equation. Over finite fields, the problem is often lifted in an approximate $p$-adic setting to be well-posed. This…

We propose a Newton algorithm to characterize the Hamiltonian of a quantum system interacting with a given laser field. The algorithm is based on the assumption that the evolution operator of the system is perfectly known at a fixed time.…

We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…

Operator square-roots are ubiquitous in theoretical physics. They appear, for example, in the Holstein-Primakoff representation of spin operators and in the Klein-Gordon equation. Often the use of a perturbative expansion is the only…

We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…

We approximate the d complex zeros of a univariate polynomial p(x) of a degree d or those zeros that lie in a fixed region of interest on the complex plane such as a disc or a square. Our divide and conquer algorithm of STOC 1995 supports…

In this paper, we construct families of polynomials defined by recurrence relations related to mean-zero random walks. We show these families of polynomials can be used to approximate $z^n$ by a polynomial of degree $\sim \sqrt{n}$ in…

The present author recently proposed and proved a relationship theorem between nonlinear polynomial equations and the corresponding Jacobian matrix. By using this theorem, this paper derives a Newton iterative formula without requiring the…

Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for…

A class of algorithms comprised by certain semismooth Newton and active-set methods is able to solve convex minimization problems involving sparsity-inducing regularizers very rapidly; the speed advantage of methods from this class is a…

We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{\"o}nhage's efficient algorithm of 1982 for a single root radius. We revisit this extension, advance it, based on our simple but…

We apply matrix methods to arithmetic functions by associating matrices to the functions in a manner drawn from the theory of symmetric functions. Then we study the characteristic polynomials of the associated matrices.

When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.

We investigate the hydrodynamic behavior of zeroes of trigonometric polynomials under repeated differentiation. We show that if the zeroes of a real-rooted, degree $d$ trigonometric polynomial are distributed according to some probability…

We investigate Newton's method applied to any odd or any even elliptic function with an arbitrary period lattice. For any function of this type whose set of poles coincides with its period lattice, we show that the Julia set of its Newton…

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…

The most frequently asked question in the $p-$adic lattice models of statistical mechanics is that whether a root of a polynomial equation belongs to domains $\mathbb{Z}_p^{*}, \ \mathbb{Z}_p\setminus\mathbb{Z}_p^{*}, \ \mathbb{Z}_p, \…

The goal of this paper is to study approaches to bridge the gap between first-order and second-order type methods for composite convex programs. Our key observations are: i) Many well-known operator splitting methods, such as…