A divide and conquer method for polynomial zeros

DOI10.1016/0377-0427(90)90006-LzbMATH Open0696.65040OpenAlexW1992750972MaRDI QIDQ911228FDOQ911228

Authors: T. L. Freeman, R. W. Brankin 

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

Recommendations

• scientific article; zbMATH DE number 880382
• Newton Iteration Towards a Cluster of Polynomial Zeros
• On one method of factorization of polynomials
• Wiener-Hopf and spectral factorization of real polynomials by Newton's method
• scientific article; zbMATH DE number 4078649

zbMATH Keywords

factorizationcomputational efficiencypolynomial zerosNewton iterationJacobian matrixdivide and conquer methodblock Toeplitz structure

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)

Cites Work

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

Cited In (2)

• Numerical factorization of a polynomial by rational Hermite interpolation
• A polynomial-time algorithm for finding zero-sums.

Uses Software

• TOEPLITZ

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

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