相关论文: The Newton Procedure for several variables

It is very fundamental to study irreducible plane curve singularities in algebraic geometry. The contents of the paper consist of three parts, called Part[A], Part[B] and Part[C] with Good Appendix. Our aim is to prove by Part[B] and…

We define the resultant of two power series with coefficients in the ring of integers of a $p$-adic field. In order to do this, we prove a universal version of the Weierstrass preparation theorem.

Finding roots of univariate polynomials is one of the fundamental tasks of numerics, and there is still a wide gap between root finders that are well understood in theory and those that perform well in practice. We investigate the root…

We study monic univariate polynomials whose coefficients are analytic functions of a real variable and whose roots lie in a specified analytic curve. These include characteristic polynomials of unitary and hermitian matrices whose entries…

Suppose that we are given a formal power series of many variables with coefficients in $\mathbb{R}$ (or $\mathbb{C}$) and we want to compute its $n$-th (multiplicative) root. As can be expected coefficients of the root have to satisfy a…

This paper studies the integration problem in differential fields that may involve quantities reminiscent of the Weierstrass $\wp$ function, which are defined by a first-order nonlinear differential equation. We extend the classical notion…

We explain how to obtain the set of solutions of a multivariate polynomial equation modulo a power of a prime number. These solutions are determined by a tree, called the trunk, which makes it possible to reconstruct all solutions. We apply…

Adapting the Newton-Puiseux Polygon process to nonlinear q-difference equations of any order and degree, we compute their power series solutions, study the properties of the set of exponents of the solutions and give a bound for their…

In this paper, an explanation of the Newton-Peiseux algorithm is given. This explanation is supplemented with well-worked and explained examples of how to use the algorithm to find fractional power series expansions for all branches of a…

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…

This work is a continuation of [Fittouhi and Joseph, Parabolic adjoint action, Weierstrass Sections and components of the nilfibre in type $A$]. Let $P$ be a parabolic subgroup of an irreducible simple algebraic group $G$, $P'$ its derived…

Let $f(Y)\in K[[X_1,\dots,X_d]][Y]$ be a quasi-ordinary Weierstrass polynomial with coefficients in the ring of formal power series over an algebraically closed field of characteristic zero. In this paper we study the discriminant $D_f$ of…

Let $S=\{p_1,\dots,p_s\}$ be a finite non-empty set of distinct prime numbers, let $f\in \mathbb{Z}[X]$ be a polynomial of degree $n\ge 1$, and let $S'\subseteq S$ be the subset of all $p\in S$ such that $f$ has a root in $\mathbb{Z}_p$.…

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…

In this paper, we revisit the chaotic number of iterations needed by Newton's method to converge to a root. Here, we consider a simple modified Newton method depending on a parameter. It is demonstrated using polynomiography that even in…

Let $s_0,s_1,s_2,\ldots$ be a sequence of rational numbers whose $m$th divided difference is integer-valued. We prove that $s_n$ is a polynomial function in $n$ if $s_n \ll \theta^n$ for some positive number $\theta$ satisfying $\theta <…

We prove that all arrangements (consistent with the Rolle theorem and some other natural restrictions) of the real roots of a real polynomial and of its $s$-th derivative are realizable by real polynomials.

The following problem is treated: Characterizing the tangent cone and the equimultiple locus of a Puiseux surface (that is, an algebroid embedded surface admitting an equation whose roots are Puiseux power series), using a set of exponents…

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,…

We explain how to encode an algebraic series by finite data and how to do effective arithmetic on the level of these encodings. The reasoning is based on the Newton-Puiseux algorithm and an effective equality test for algebraic series.…