An algorithm for the total, or partial, factorization of a polynomial

DOI10.1017/S0305004100054098zbMath0374.65019MaRDI QIDQ4151651

No author found.

Publication date: 1977

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

65H05: Numerical computation of solutions to single equations

Related Items

Computing multiple roots of inexact polynomials, Some higher-order methods for the simultaneous approximation of multiple polynomial zeros, Chebyshev-Halley methods for analytic functions, An algorithm for the computation of zeros of a special class of entire functions, Locating multiple zeros interactively, Improving the order of convergence of iteration functions, Multiplicity estimating algorithm for zeros of a complex polynomial and its applications, On some iteration functions for the simultaneous computation of multiple complex polynomial zeros, A composite polynomial zerofinding matrix algorithm, Modified Newton method in circular interval arithmetic, On zero-finding methods of the fourth order, A one parameter family of locally quartically convergent zero-finding methods, Some methods for simultaneous extraction of a part of all multiple roots of algebraic polynomials, An acceleration of iterative processes for solving nonlinear equations, The Durand-Kerner polynomials roots-finding method in case of multiple roots, Higher-order iteration functions for simultaneously approximating polynomial zeros

Cites Work

• Unnamed Item
• Unnamed Item
• A family of root finding methods
• A posteriori error bounds for the zeros of polynomials
• Convergence of the Newton process to multiple solutions
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Circular arithmetic and the determination of polynomial zeros
• Simultaneous inclusion of the zeros of a polynomial
• Roots of equations by functional iteration
• A Modified Bairstow Method for Multiple Zeros of a Polynomial
• A Machine Method for Solving Polynomial Equations
• Calculation of Zeros of a Real Polynomial Through Factorization Using Euclid’s Algorithm
• Über Simultanverfahren zur Bestimmung reeller Polynomwurzeln
• On the numerical solution of the generalized eigenproblem
• A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
• Principles for Testing Polynomial Zerofinding Programs
• A new method for solving polynomial equations
• Iterative Solution of the Generalized Eigenvalue Problem
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
• Finding zeros of a polynomial by the Q-D algorithm
• A modified Newton method for polynomials
• On Lehmer's Method for Finding the Zeros of a Polynomial
• The Simultaneous Newton Improvement of a Complete Set of Approximate Factors of a Polynomial
• Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens