相关论文: Newton's Method as a Formal Recurrence

We describe a three precision variant of Newton's method for nonlinear equations. We evaluate the nonlinear residual in double precision, store the Jacobian matrix in single precision, and solve the equation for the Newton step with…

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

For a system of polynomial equations, whose coefficients depend on parameters, the Newton polyhedron of its discriminant is computed in terms of the Newton polyhedra of the coefficients. This leads to an explicit formula (involving mixed…

The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoretical proof of this fact based on a refinement of the…

Using a simple recurrence relation we give a new method to compute Jones polynomials of closed braids: we find a general expansion formula and a rational generating function for Jones polynomials. The method is used to estimate degree of…

It is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the potential advantage of having a…

We present generalizations of the Newton-Raphson-Simpson method. Specifically, for a positive integer $m$ and the sequence of coefficients of a Taylor series of a function $f(z)$, we define an algorithm we denote by NRS($m$) which is a way…

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.

We studies the Newton polygon for the L-function of toric exponential sums attached to a family of two variable generalized hyperkloosterman sum,$f_{t}(x,y)=x^{n}+y+\frac{t}{xy}$ with $t$ the parameter. The explicit Newton polygon is…

The $T$-adic exponential sum associated to a Laurent polynomial in one variable is studied. An explicit arithmetic polygon is proved to be the generic Newton polygon of the $C$-function of the T-adic exponential sum. It gives the generic…

Based on a generalized Newton's identity, we construct a family of symmetric functions which deform the modular Hall-Littlewood functions. We also give a determinant formula for the Macdonald functions.

The so-called polynomial equations play an important role both in algebra and in the theory of functional equations. If the unknown functions in the equation are additive, relatively many results are known. However, even in this case, there…

The iterative problem of solving nonlinear equations is studied. A new Newton like iterative method with adjustable parameters is designed based on the dynamic system theory. In order to avoid the derivative function in the iterative…

When exploring the literature, it can be observed that the operator obtained when applying \textit{Newton-like} root finding algorithms to the quadratic polynomials $z^2-c$ has the same form regardless of which algorithm has been used. In…

We determine the Newton trees of the rational polynomials of simple type, thus filling a gap in the proof of the classification of these polynomials given by Neumann and Norbury.

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…

Considering the L-function of exponential sums associated to a polynomial over a finite field F_q, Deligne proved that a reciprocal root's p-adic order is a rational number in the interval [0, 1]. Based on hypergeometric theory, in this…

We present an iterative root finding method for harmonic mappings in the complex plane, which is a generalization of Newton's method for analytic functions. The complex formulation of the method allows an analysis in a complex variables…

We give some new canonical representations for forms over $\cc$. For example, a general binary quartic form can be written as the square of a quadratic form plus the fourth power of a linear form. A general cubic form in $(x_1,...,x_n)$ can…