A divide and conquer method for polynomial zeros

DOI10.1016/0377-0427(90)90006-LzbMath0696.65040OpenAlexW1992750972MaRDI QIDQ911228

R. W. Brankin, T. L. Freeman

Publication date: 1990

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(90)90006-l

zbMATH Keywords

Newton iterationfactorizationcomputational efficiencypolynomial zerosJacobian matrixdivide and conquer methodblock Toeplitz structure

Mathematics Subject Classification ID

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

Related Items (1)

Numerical factorization of a polynomial by rational Hermite interpolation

Uses Software

• TOEPLITZ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach
• A Divide and Conquer method for the symmetric tridiagonal eigenproblem
• Stability of Methods for Solving Toeplitz Systems of Equations
• A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
• A method for computing all the zeros of a polynomial with real coefficients
• On Bairstow's Method for the Solution of Polynomial Equations
• The Solution of a Toeplitz Set of Linear Equations
• An Algorithm for the Machine Calculation of Complex Fourier Series
• An Algorithm for the Inversion of Finite Toeplitz Matrices
• Finding zeros of a polynomial by the Q-D algorithm
• Corrections to numerical data on Q-D algorithm
• A Generalization of a Theorem of Bôcher
• Toeplitz Matrix Inversion: The Algorithm of W. F. Trench
• Associated Polynomials and Uniform Methods for the Solution of Linear Problems

This page was built for publication: A divide and conquer method for polynomial zeros