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

A method to solve the problem f(x) = 0 efficiently on any n-dimensional domain Omega under very broad hypoteses is proposed. The position of the root of f, assumed unique, is found by computing the center of mass of an Omega-shaped object…

We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits…

We study a relation between roots of characteristic polynomials and intersection points of line arrangements. Using these results, we obtain a lot of applications for line arrangements. Namely, we give (i) a generalized addition theorem for…

Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…

In this article we apply a formula for the $n$-th power of a $3\times 3$ matrix (found previously by the authors) to investigate a procedure of Khovanskii's for finding the cube root of a positive integer. We show, for each positive integer…

We establish necessary and sufficient conditions for an arbitrary polynomial of degree $n$, especially with only real roots, to be trivial, i.e. to have the form a(x-b)^n. To do this, we derive new properties of polynomials and their roots.…

For the general monic cubic and quartic with real coefficients, polynomial conditions on the coefficients are derived as directly and as simply as possible from the Sturm sequence that will determine the real and complex root multiplicities…

The speed of convergence of the R-linear GMRES is bounded in terms of a polynomial approximation problem on a finite subset of the spectrum. This result resembles the classical GMRES convergence estimate except that the matrix involved is…

The average density of zeros for monic generalized polynomials, $P_n(z)=\phi(z)+\sum_{k=1}^nc_kf_k(z)$, with real holomorphic $\phi ,f_k$ and real Gaussian coefficients is expressed in terms of correlation functions of the values of the…

A new one-parameter family of iterative method for solving nonlinear equations is constructed and studied. Two variants, both with cubic convergence, are developed, one for finding simple zeros and other for multiple zeros of known…

The Julia set of the Chebyshev's method applied to polynomials with exactly two distinct roots is shown to be connected, and its Fatou set is proved to be the union of attracting basins corresponding to the two roots. Further, if the two…

Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots…

Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…

The main topic of this paper is various "hyperbolic" generalizations of the Edmonds-Rado theorem on the rank of intersection of two matroids. We prove several results in this direction and pose a few questions. We also give generalizations…

We study the roots of a random polynomial over the field of p-adic numbers. For a random monic polynomial with coefficients in $\mathbb{Z}_p$, we obtain an asymptotic formula for the factorial moments of the number of roots of this…

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

Here we introduce a way to construct generalized trigonometric functions associated with any complex polynomials, and the well known trigonometric functions can be seen to associate with polynomial $x^2-1$. We will show that those…