Computation of dominant real roots of polynomials
From MaRDI portal
Publication:840004
DOI10.1007/S11086-008-2003-1zbMATH Open1185.68864OpenAlexW4237129554MaRDI QIDQ840004FDOQ840004
Authors: Doru Ştefănescu 
Publication date: 4 September 2009
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11086-008-2003-1
Recommendations
- Computing real roots of real polynomials
- Computation of bounds for polynomial roots
- scientific article; zbMATH DE number 579389
- Computing the real roots of a polynomial by the exclusion algorithm
- The computation of multiple roots of a polynomial
- Real polynomial root-finding by means of matrix and polynomial iterations
- Real polynomial root-finding by means of matrix and polynomial iterations
- scientific article; zbMATH DE number 833249
- scientific article; zbMATH DE number 1500715
- Roots of polynomials with dominant term
Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Cited In (7)
- Counting and testing dominant polynomials
- An age-structured fishery model: dynamics and optimal management with perfect elastic demand
- Computing real roots of a polynomial in Chebyshev series form through subdivision with linear testing and cubic solves
- Estimations of positive roots of polynomials
- Computing Real Roots of Real Polynomials ... and now For Real!
- Computing real radicals and \(S\)-radicals of polynomial systems
- Real and complex polynomial root-finding with eigen-solving and preprocessing
Uses Software
This page was built for publication: Computation of dominant real roots of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840004)
