Algoritmy na výpočet kořenů polynomu
An extension of the root perturbation -dimensional polynomial factorization method
An extremal problem related to probability.
An Implementation of Vincent's Theorem.
Are the coefficients of a polynomial well-conditioned functions of its roots?
Asymptotic behavior for the best lower bound of Jensen's functional
Asymptotic expansion of the equipoise curve of a polynomial inequality.
Asymptotic expansions and positivity of coefficients for large powers of analytic functions.
Behavior of the trinomial arcs when .
Berichtigung zur Arbeit "Über die Charakterisierung der Funktion f(x) = x durch Funktionalgleichungen, II", Band 30 (1986), 142-150.
Bernstein's inequality on algebraic curves
Bilinear representation formulas for polynominals.
Bounds of the roots of the real polynomial
An algorithm for the calculation of a lower bound of the absolute values of the roots of a real algebraic polynomial, of an arbitrary degree, is derived. An example is given to compare the bounds calculated by the method proposed and by other methods.
Braiding of the attractor and the failure of iterative algorithms.
Canonical decompositions of certain generalized Brownian bridges.
Choosing roots of polynomials with symmetries smoothly.
Comparison of L¹- and -norms of squares of polynomials
Complex Analogues of the Rolle's Theorem
2000 Mathematics Subject Classification: 30C10.Classical Rolle’s theorem and its analogues for complex algebraic polynomials are discussed. A complex Rolle’s theorem is conjectured.
Complexité et géométrie réelle
Computing amoebas.