中文
相关论文

相关论文: Choosing roots of polynomials smoothly

200 篇论文

We show that the roots of any smooth curve of polynomials with only real roots can be parametrized twice differentiably (but not better).

经典分析与常微分方程 · 数学 2007-05-23 Andreas Kriegl , Mark Losik , Peter W. Michor

The roots of a smooth curve of hyperbolic polynomials may not in general be parameterized smoothly, even not $C^{1,\alpha}$ for any $\alpha > 0$. A sufficient condition for the existence of a smooth parameterization is that no two of the…

经典分析与常微分方程 · 数学 2010-03-30 Mark Losik , Armin Rainer

We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…

代数几何 · 数学 2025-09-01 Cosimo Flavi , Joachim Jelisiejew , Mateusz Michałek

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

环与代数 · 数学 2024-03-19 Alina G. Goutor , Sergey V. Tikhonov

We show that smooth curves of monic complex polynomials $P_a (Z)=Z^n+\sum_{j=1}^n a_j Z^{n-j}$, $a_j : I \to \mathbb C$ with $I \subset \mathbb R$ a compact interval, have absolutely continuous roots in a uniform way. More precisely, there…

经典分析与常微分方程 · 数学 2016-08-01 Adam Parusinski , Armin Rainer

After reconsidering the theorem of continuity of the roots of a polynomial in terms of its coefficients in the deformation framework, we study the stability of the greater common divisor of two polynomials compared to perturbations on their…

环与代数 · 数学 2022-08-22 Elisabeth Remm

We study the regularity of the roots of complex univariate polynomials whose coefficients depend smoothly on parameters. We show that any continuous choice of the roots of a $C^{n-1,1}$-curve of monic polynomials of degree $n$ is locally…

经典分析与常微分方程 · 数学 2021-04-06 Adam Parusinski , Armin Rainer

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

经典分析与常微分方程 · 数学 2008-03-11 Steve Fisk

This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…

数值分析 · 数学 2025-04-15 Yousra Gati , Vladimir Petrov Kostov , Mohamed Chaouki Tarchi

We study the regularity of the roots of complex monic polynomials $P(t)$ of fixed degree depending smoothly on a real parameter $t$. We prove that each continuous parameterization of the roots of a generic $C^\infty$ curve $P(t)$ (which…

经典分析与常微分方程 · 数学 2010-03-30 Armin Rainer

In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…

数值分析 · 数学 2019-08-20 Vitaly Zaderman , Liang Zhao

In the present study, we propose necessary and sufficient assumptions on the coefficients in order to only get distinct real roots of polynomials.

组合数学 · 数学 2019-02-04 J. -M Billiot , E Fontenas

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…

经典分析与常微分方程 · 数学 2008-08-14 Steve Fisk

We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…

数论 · 数学 2007-05-23 Greg Martin

We give a simplified approach to the Abhyankar--Moh theory of approximate roots. Our considerations are based on properties of the intersection multiplicity of local curves.

alg-geom · 数学 2016-08-14 Janusz Gwoździewicz , Arkadiusz Płoski

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

符号计算 · 计算机科学 2017-04-14 Victor Y. Pan , Liang Zhao

We study the family of rational curves on arbitrary smooth hypersurfaces of low degree using tools from analytic number theory.

代数几何 · 数学 2018-03-16 Tim Browning , Pankaj Vishe

We study the asymptotic distribution of roots of Lommel polynomials as polynomials of the order with a variable and purely imaginary argument. The roots are complex and accumulate on certain curves in the complex plane. We prove existence…

经典分析与常微分方程 · 数学 2021-02-02 Petr Blaschke , František Štampach

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.

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

This survey revolves around the question how the roots of a monic polynomial (resp. the spectral decomposition of a linear operator), whose coefficients depend in a smooth way on parameters, depend on those parameters. The parameter…

泛函分析 · 数学 2024-10-23 Adam Parusiński , Armin Rainer
‹ 上一页 1 2 3 10 下一页 ›