相关论文: Newton's Method as a Formal Recurrence
We present a modification of Newton's method to restore quadratic convergence for isolated singular solutions of polynomial systems. Our method is symbolic-numeric: we produce a new polynomial system which has the original multiple solution…
We extend the Newton's method and show the extended Newton's method leads to the binomial expansion of Newton's method that the convergences become the quadratic and linearly. In case of the quadratic convergence, we give the convergence…
An iterative formula based on Newton Method alone is presented for the iterative solutions of equations that ensures convergence in cases where the traditional Newton Method may fail to converge to the desired root. In addition, the method…
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…
We use the properties of Hermite and Kamp\'e de F\'eriet polynomials to get closed forms for the repeated derivatives of functions whose argument is a quadratic or higher-order polynomial. The results we obtain are extended to product of…
We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…
The bifurcation sets of polynomial functions have been studied by many mathematicians from various points of view. In particular, N\'emethi and Zaharia described them in terms of Newton polytopes. In this paper, we will show analogous…
In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…
When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…
The paper contains a combinatorial theorem (the sequence of Newton polygons of a reccurent sequence of polynomials is quasi-linear) and two applications of it in classical and quantum topology, namely in the behavior of the $A$-polynomial…
The Newton iteration is a popular method for minimising a cost function on Euclidean space. Various generalisations to cost functions defined on manifolds appear in the literature. In each case, the convergence rate of the generalised…
Newton's method is used to approximate roots of complex valued functions f by creating a sequence of points that converges to a root of f in the usual topology. For any field K equipped with a set of pairwise inequivalent absolute values…
Recently, Chapoton found a $q$-analog of Ehrhart polynomials, which are polynomials in $x$ whose coefficients are rational functions in $q$. Chapoton conjectured the shape of the Newton polygon of the numerator of the $q$-Ehrhart polynomial…
The aim of this paper is to introduce a new Newton-type iterative method and then to show that this process converges to the unique solution of the scalar nonlinear equation f(x)=0 under weaker conditions involving only f and f' by fixed…
In this paper, we derive the quadratic formula as a consequence of constructively proving the existence of standard and factored forms for general form real quadratic functions. Emphasis is put on connections to graphing of corresponding…
Local fractional derivative and integrals are revealed as one of useful tools to deal with everywhere continuous but nowhere differentiable functions in fractal areas ranging from fundamental science to engineering. In this paper, a…
This work shows that, Newton's Proposition 1 in the {\it Principia}, is an {\it exact} graphical representation of a canonical transformation, a first-order symplectic integrator generated at a finite time-step by the Hamiltonian. A…
We introduce a new iterative root-finding method for complex polynomials, dubbed {\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in…
This article provides a simple proof of the quadratic formula, which also produces an efficient and natural method for solving general quadratic equations. The derivation is computationally light and conceptually natural, and has the…
An expression for the coefficients of a linear iterative equation in terms of the parameters of the source equation is given both for equations in standard form and for equations in reduced normal form. The operator generating an iterative…