相关论文: A Generalization of Obreshkoff-Ehrlich Method for …

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…

We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…

We formulate a problem called \emph{Generalized Root Extraction} in finite Abelian groups that have more than one generator. We then study this problem for the specific case of the torsion subgroups of elliptic curves. We give a necessary…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

In most introductory numerical analysis textbooks, the treatment of a single nonlinear equation often consists of a collection of all-purpose methods that frequently do not work or are inefficient. These textbooks neglect to teach the…

Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…

The new method for obtaining a variety of extensions of Hermite polynomials is given. As a first example a family of orthogonal polynomial systems which includes the generalized Hermite polynomials is considered. Apparently, either these…

We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…

We show that the number of real roots of random trigonometric polynomials with i.i.d. coefficients, which are either bounded or satisfy the logarithmic Sobolev inequality, satisfies an exponential concentration of measure.

[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…

We give an anecdotal discussion of the problem of searching for polynomials with all roots on the unit circle, whose coefficients are rational numbers subject to certain congruence conditions. We illustrate with an example from a…

We extend the polynomial approach to hook length formula proposed in a recent joint paper with K\'arolyi, Nagy and Volkov to several other problems of the same type, including number of paths formula in the Young graph of strict partitions.

A general formula is presented for any order derivative of Chebyshev polynomials instead of the existing recursive relationship. Hence, the Chebyshev finite difference method is made applicable not only to second order problems but also to…

We show how the knowledge of the Fourier coefficients of the Cherednik kernel leads to combinatorial formulas for generalized exponents. We recover known formulas for generalized exponents of irreducible representations parameterized by…

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

A method for finding relations for the roots of polynomials is presented. Our approach allows us to get a number of relations for the zeros of the classical polynomials and for the roots of special polynomials associated with rational…

A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…

Chebyshev varieties are algebraic varieties parametrized by Chebyshev polynomials or their multivariate generalizations. We determine the dimension, degree, singular locus and defining equations of these varieties. We explain how they play…

The construction of initial conditions of an iterative method is one of the most important problems in solving nonlinear equations. In this paper, we obtain relationships between different types of initial conditions that guarantee the…

We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic…