相关论文: The Newton Procedure for several variables

We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…

In this paper, we study the dynamics of Newton maps for arbitrary polynomials. Let $p$ be an arbitrary polynomial with at least three distinct roots, and $f$ be its Newton map. It is shown that the boundary $\partial B$ of any immediate…

A new variant of Newton's method - named Backtracking New Q-Newton's method (BNQN) - which has strong theoretical guarantee, is easy to implement, and has good experimental performance, was recently introduced by the third author.…

We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…

According to the real \tau-conjecture, the number of real roots of a sum of products of sparse polynomials should be polynomially bounded in the size of such an expression. It is known that this conjecture implies a superpolynomial lower…

In multicentric calculus one takes a polynomial $p$ with distinct roots as a new variable and represents complex valued functions by $\mathbb C^d$-valued functions, where $d$ is the degree of $p$. An application is e.g. the possibility to…

Adapted pairs and Weierstrass sections are central to the invariant theory associated to the action of an algebraic Lie algebra a on a finite dimensional vector space X. In this a need not be a semisimple Lie algebra. Here their general…

For any positive integer n, a new family of periodic functions in power series form and of period n is used to solve in closed form a class of polynomial equation of order n. The n roots are the values of the appropriate function from that…

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…

For a given length and a given degree and an arbitrary partition of the positive integers, there always is a cell containing a polynomial progression of that length and that degree; moreover, the coefficients of the generating polynomial…

The system of $N$ classical particles on the line with the Weierstrass $\wp$ function as potential is known to be completely integrable. Recently D'Hoker and Phong found a beautiful parameterization by the polynomial of degree $N$ of the…

We describe explicit multiplicative excellent families of rational elliptic surfaces with Galois group isomorphic to the Weyl group of the root lattices E_7 or E_8. The Weierstrass coefficients of each family are related by an invertible…

We study polytopes associated to factorisations of prime powers. These polytopes have explicit descriptions either in terms of their vertices or as intersections of closed halfspaces associated to their facets. We give formulae for their…

We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform…

Some Wiener--Hopf determinants on [0,s] are calculated explicitly for all s>0. Their symbols are zero on an interval and they are related to the determinant with the sine-kernel appearing in the random matrix theory. The determinants are…

We provide an irreducibility test and factoring algorithm (with some qualifications) for formal power series in the unique factorization domain $R[[X]]$, where $R$ is any principal ideal domain. We also classify all integral domains arising…

Wooley ({\em J. Number Theory}, 1996) gave an elementary proof of a Bezout like theorem allowing one to count the number of isolated integer roots of a system of polynomial equations modulo some prime power. In this article, we adapt the…

The Zernike radial polynomials are a system of orthogonal polynomials over the unit interval with weight x. They are used as basis functions in optics to expand fields over the cross section of circular pupils. To calculate the roots of…

We extend the Weierstrass-Kerner method by applying the Chebychev method to the function F that Kerner has used to show that the formula of Weierstrass actually is the Newton method applied to that F. The resulting method is already known…

In this paper we outline an algorithmic approach to compute Puiseux series expansions for algebraic surfaces. The series expansions originate at the intersection of the surface with as many coordinate planes as the dimension of the surface.…