An algorithm for the total, or partial, factorization of a polynomial
From MaRDI portal
Publication:4151651
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)
Related Items
A one parameter family of locally quartically convergent zero-finding methods ⋮ The Durand-Kerner polynomials roots-finding method in case of multiple roots ⋮ A composite polynomial zerofinding matrix algorithm ⋮ Modified Newton method in circular interval arithmetic ⋮ Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros ⋮ Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials ⋮ On zero-finding methods of the fourth order ⋮ A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence ⋮ On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity ⋮ Chebyshev-Halley methods for analytic functions ⋮ Symbolic computation and computer graphics as tools for developing and studying new root-finding methods ⋮ Higher-order iteration functions for simultaneously approximating polynomial zeros ⋮ Computing multiple roots of inexact polynomials ⋮ Some methods for simultaneous extraction of a part of all multiple roots of algebraic polynomials ⋮ Accelerating generators of iterative methods for finding multiple roots of nonlinear equations ⋮ On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros ⋮ Iteration functions re-visited ⋮ On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity ⋮ Multiplicity estimating algorithm for zeros of a complex polynomial and its applications ⋮ On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros ⋮ On some iteration functions for the simultaneous computation of multiple complex polynomial zeros ⋮ Some higher-order methods for the simultaneous approximation of multiple polynomial zeros ⋮ An acceleration of iterative processes for solving nonlinear equations ⋮ Improving the order of convergence of iteration functions ⋮ An algorithm for the computation of zeros of a special class of entire functions ⋮ Computer tools for the construction and analysis of some efficient root-finding simultaneous methods ⋮ Locating multiple zeros interactively
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
