Finding roots of a real polynomial simultaneously by means of Bairstow's method
From MaRDI portal
Publication:1914869
DOI10.1007/BF01731985zbMath0857.65052MaRDI QIDQ1914869
Publication date: 16 March 1997
Published in: BIT (Search for Journal in Brave)
numerical examplesparallel computationparallel anticipatory implicit deflationroots of a real polynomial
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros ⋮ A new optimal root-finding iterative algorithm: local and semilocal analysis with polynomiography ⋮ On the simultaneous refinement of the zeros of H-palindromic polynomials ⋮ Recursive algorithm without extra function evaluations for the Jacobian matrix of Viéta's polynomial system with applications ⋮ On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Calculating polynomial zeros on a local memory parallel computer
- Finding the roots of a polynomial on an MIMD multicomputer
- Some remarks on Dvorcuk's root-finding method
- Computation of the Latent Roots of a Hessenberg Matrix by Bairstow's Method
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Finding zeros of a polynomial by the Q-D algorithm
- Corrections to numerical data on Q-D algorithm
- Factorization of a polynomial into quadratic factors by Newton method
This page was built for publication: Finding roots of a real polynomial simultaneously by means of Bairstow's method
