Numerical factorization of a polynomial by rational Hermite interpolation
From MaRDI portal
Publication:688142
DOI10.1007/BF02141948zbMath0788.65057MaRDI QIDQ688142
Tetsuya Sakurai, Tatsuo Torii, Sugiura, Hiroshi
Publication date: 30 May 1994
Published in: Numerical Algorithms (Search for Journal in Brave)
numerical examplesnumerical factorizationlocal and global convergencerational Hermite interpolationroot finding algorithmBairstow method
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Simultaneous factorization of a polynomial by rational approximation ⋮ Improvement of convergence of an iterative method for finding polynomial factors of analytic functions
Cites Work
- An iterative method for algebraic equation by Padé approximation
- A divide and conquer method for polynomial zeros
- 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
- A Property of Euclid’s Algorithm and an Application to Padé Approximation
This page was built for publication: Numerical factorization of a polynomial by rational Hermite interpolation
