中文
相关论文

相关论文: Choosing roots of polynomials smoothly

200 篇论文

We study continuity of the roots of nonmonic polynomials as a function of their coefficients using only the most elementary results from an introductory course in real analysis and the theory of single variable polynomials. Our approach…

经典分析与常微分方程 · 数学 2021-12-30 Anthony Stefan , Aaron Welters

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…

数值分析 · 数学 2020-09-15 Hashim A. Yamani , Abdulaziz D. Alhaidari

In this paper we consider the question of smoothness of slowly varying functions satisfying the modern definition that, in the last two decades, gained prevalence in the applications concerning function spaces and interpolation. We show,…

综合数学 · 数学 2025-11-06 Dalimil Peša

Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…

组合数学 · 数学 2016-01-13 Xueliang Li , Yongtang Shi

Many statistics of roots of random polynomials have been studied in the literature, but not much is known on the concentration aspect. In this note we present a systematic study of this question, aiming towards nearly optimal bounds to some…

概率论 · 数学 2024-02-15 Ander Aguirre , Hoi H. Nguyen , Jingheng Wang

We reprove the results of Jordan [18] and Siebert [31] and show that the Lie algebra of polynomial vector fields on an irreducible affine variety X is simple if and only if X is a smooth variety. Given proof is self-contained and does not…

表示论 · 数学 2017-11-27 Yuly Billig , Vyacheslav Futorny

The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…

数值分析 · 数学 2013-08-21 Juan Luis García Zapata , Juan Carlos Díaz Martín

Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a…

代数几何 · 数学 2021-01-01 Marco Besier , Dino Festi

In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.

数论 · 数学 2017-12-08 Abdelkader Benyattou , Miloud Mihoubi

It is shown that, under some natural assumptions, the tensor product of differentially smooth algebras and the skew-polynomial rings over differentially smooth algebras are differentially smooth.

环与代数 · 数学 2016-09-15 Tomasz Brzeziński , Christian Lomp

We provide a short proof that an $L^2_1$ and $J$-holomorphic curve is in fact smooth. As an application, we deduce a removal of singularity theorem for curves of finite energy.

辛几何 · 数学 2014-09-04 Max Lipyanskiy

We complete the enumeration of the possible roots of the Alexander polynomial (both conventional and over finite fields) of a trigonal curve. The curves are not assumed proper or irreducible.

代数几何 · 数学 2016-09-07 Alex Degtyarev

The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…

综合数学 · 数学 2007-05-23 Ashok Kumar Mittal , Ashok Kumar Gupta

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

数论 · 数学 2012-10-03 Ayah Almousa , Melanie Matchett Wood

We study a popular algorithm for fitting polynomial curves to scattered data based on the least squares with gradient weights. We show that sometimes this algorithm admits a substantial reduction of complexity, and, furthermore, find…

计算复杂性 · 计算机科学 2010-08-12 N. Chernov , C. Lesort , N. Simanyi

We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…

数论 · 数学 2018-12-31 Johannes Schleischitz

We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…

符号计算 · 计算机科学 2019-11-18 Rémi Imbach , Victor Y. Pan

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

数值分析 · 数学 2023-09-18 Bor Plestenjak , Michiel E. Hochstenbach

We consider the family of polynomials $P(x,a)=x^n+a_1x^{n-1}+... +a_n$, $x,a_i\in {\bf R}$, and the stratification of ${\bf R}^n\cong \{(a_1,... ,a_n)|a_i\in {\bf R}\}$ defined by the multiplicity vector of the real roots of $P$. We prove…

代数几何 · 数学 2007-05-23 Vladimir Petrov Kostov

This paper is devoted to several new results concerning (standard) octonion polynomials. The first is the determination of the roots of all right scalar multiples of octonion polynomials. The roots of left multiples are also discussed,…

环与代数 · 数学 2023-06-22 Adam Chapman , Solomon Vishkautsan