Real arithmetic versions of simultaneous iteration methods for polynomial root finding

DOI10.1007/BF03167915MaRDI QIDQ3831939zbMATH OpenOpenAlexFDO

Authors Shigeru Ando

Publication date 1989

Published in Japan Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03167915

zbMATH Keywords

Aberth's methodalgorithmsconvergenceDurand- Kerner methodnumerical examplespolynomial factorizationpolynomial root findingsimultaneous iteration methods

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Real polynomials: location of zeros (26C10) Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 4024643
• scientific article; zbMATH DE number 3903860
• On simultaneous factoring of a polynomial
• On one method of factorization of polynomials
• Real polynomial root-finding by means of matrix and polynomial iterations

Cites work

• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously

Cited in

(6)

• Real polynomial root-finding by means of matrix and polynomial iterations
• scientific article; zbMATH DE number 4130494 (Why is no real title available?)
• scientific article; zbMATH DE number 4024643 (Why is no real title available?)
• On some iterative algorithms for polynomial factorization
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Finding roots by deflated polynomial approximation

This page was built for publication: Real arithmetic versions of simultaneous iteration methods for polynomial root finding

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