Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
From MaRDI portal
Publication:2647451
DOI10.1007/BF02568028zbMath0029.24402MaRDI QIDQ2647451
Publication date: 1948
Published in: Commentarii Mathematici Helvetici (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/138937
Related Items (29)
Algorithms to compute the topology of orientable real algebraic surfaces ⋮ Automatic computation of the complete root classification for a parametric polynomial ⋮ Matrix computation of subresultant polynomial remainder sequences in integral domains ⋮ Über Polynomabbildungen ⋮ Cauchy index computation ⋮ On the complexity of computing the greatest common divisor of several univariate polynomials ⋮ Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity ⋮ An elementary approach to subresultants theory. ⋮ Solving the implicitization, inversion and reparametrization problems for rational curves through subresultants ⋮ Subresultants revisited. ⋮ Algorithmic Thomas decomposition of algebraic and differential systems ⋮ Subresultants and locally nilpotent derivations. ⋮ Birational properties of the gap subresultant varieties ⋮ Spécialisation de la suite de Sturm ⋮ Quantitative fundamental theorem of algebra ⋮ A fast version of the Schur-Cohn algorithm. ⋮ On the complexity of the Lickteig-Roy subresultant algorithm ⋮ A chain rule for subresultants ⋮ Sylvester-Habicht sequences and fast Cauchy index computation ⋮ On solving univariate sparse polynomials in logarithmic time ⋮ Thomas Decomposition of Algebraic and Differential Systems ⋮ Spécialisation de la suite de Sturm et sous-résultants (I) ⋮ The number of tetrahedra sharing the same metric invariants via symbolic and numerical computations ⋮ Recent advances on determining the number of real roots of parametric polynomials ⋮ A new method for computing polynomial greatest common divisors and polynomial remainder sequences ⋮ New structure theorem for subresultants ⋮ Resonance Set of a Polynomial and Problem of Formal Stability ⋮ A recursive algorithm for constructing generalized Sturm sequence ⋮ Systems of rational polynomial equations have polynomial size approximate zeros on the average
This page was built for publication: Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
