The Simultaneous Newton Improvement of a Complete Set of Approximate Factors of a Polynomial

DOI10.1137/0708040zbMath0221.65081OpenAlexW2005539622MaRDI QIDQ5626149

A. A. Grau

Publication date: 1971

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0708040

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (8)

On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials ⋮ Simultaneous factorization of a polynomial by rational approximation ⋮ On simultaneous factoring of a polynomial ⋮ Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. ⋮ Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding ⋮ An algorithm for the total, or partial, factorization of a polynomial ⋮ Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)] ⋮ Improvement of convergence of an iterative method for finding polynomial factors of analytic functions

This page was built for publication: The Simultaneous Newton Improvement of a Complete Set of Approximate Factors of a Polynomial