Note on Jacobi's method for approximating dominant roots

DOI10.1016/J.JSC.2003.07.003MaRDI QIDQ2643518zbMATH OpenOpenAlexFDO

Authors Hoon Hong

Publication date 24 August 2007

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2003.07.003

zbMATH Keywords

dominant rootsroot bounds

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Numerical computation of solutions to single equations (65H05) Symbolic computation and algebraic computation (68W30)

Recommendations

• On a method of approximation by Jacobi polynomials
• Some remarks on Dvorcuk's root-finding method
• Use of resultants and approximate roots for doing the Jacobian problem
• On the approximation of the Jacobi polynomials
• scientific article; zbMATH DE number 1304525
• Note on the root locus method
• scientific article; zbMATH DE number 749851
• scientific article; zbMATH DE number 598909
• scientific article; zbMATH DE number 621974
• Approximating roots by quadratic iteration

Cites work

• Bounds for absolute positiveness of multivariate polynomials
• Estimates for polynomial roots
• Linear recurrent sequences and polynomial roots
• On some bounds for zeros of norm-bounded polynomials
• On the product of the largest roots of a polynomial

Cited in

(2)

• Linear recurrent sequences and polynomial roots
• Application of Baker's method to the Dandelin-Graeffe's method

This page was built for publication: Note on Jacobi's method for approximating dominant roots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643518)