Numerical factorization of a polynomial by rational Hermite interpolation

DOI10.1007/BF02141948zbMATH Open0788.65057MaRDI QIDQ688142FDOQ688142

Tetsuya Sakurai, Tatsuo Torii, Hiroshi Sugiura

Publication date: 30 May 1994

Published in: Numerical Algorithms (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 5938734
• On some iterative algorithms for polynomial factorization
• scientific article; zbMATH DE number 4024643
• scientific article; zbMATH DE number 3967804
• On one method of factorization of polynomials

zbMATH Keywords

numerical exampleslocal and global convergencerational Hermite interpolationroot finding algorithmBairstow methodnumerical factorization

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)

Cites Work

• A Property of Euclid’s Algorithm and an Application to Padé Approximation
• A high-order iterative formula for simultaneous determination of zeros of a polynomial
• On the use of Kronecker's algorithm in the generalized rational interpolation problem
• Some iterations for factoring polynomials
• Root determination by use of Padé approximants
• An iterative method for algebraic equation by Padé approximation
• A divide and conquer method for polynomial zeros

Cited In (3)

• Simultaneous factorization of a polynomial by rational approximation
• Improvement of convergence of an iterative method for finding polynomial factors of analytic functions
• Title not available (Why is that?)

This page was built for publication: Numerical factorization of a polynomial by rational Hermite interpolation

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