Improving a method of search for solving polynomial equations

DOI10.1016/0898-1221(95)00231-6MaRDI QIDQ1361293zbMATH OpenOpenAlexFDO

Authors Mihály Hujter

Publication date 8 December 1997

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(95)00231-6

zbMATH Keywords

diskspolynomial zeroscomplex polynomialsfinding zerosLehmer-Schur methods

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 8841
• scientific article; zbMATH DE number 5307160
• Improvement on the Lehmer-Schur root detection method

Cites work

• scientific article; zbMATH DE number 8841 (Why is no real title available?)
• scientific article; zbMATH DE number 3997049 (Why is no real title available?)
• scientific article; zbMATH DE number 3226460 (Why is no real title available?)
• scientific article; zbMATH DE number 3289958 (Why is no real title available?)
• A Machine Method for Solving Polynomial Equations
• Methods of Search for Solving Polynomial Equations
• On Lehmer's Method for Finding the Zeros of a Polynomial
• Über einige Kreisüberdeckungen

Cited in

(1)

• On a linear diophantine problem for geometrical type sequences

This page was built for publication: Improving a method of search for solving polynomial equations

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