Pages that link to "Item:Q4151651"
From MaRDI portal
The following pages link to An algorithm for the total, or partial, factorization of a polynomial (Q4151651):
Displaying 28 items.
- Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros (Q343681) (← links)
- Iteration functions re-visited (Q730575) (← links)
- On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity (Q738970) (← links)
- Chebyshev-Halley methods for analytic functions (Q929962) (← links)
- Accelerating generators of iterative methods for finding multiple roots of nonlinear equations (Q988247) (← links)
- An algorithm for the computation of zeros of a special class of entire functions (Q1062726) (← links)
- Locating multiple zeros interactively (Q1067359) (← links)
- Improving the order of convergence of iteration functions (Q1301699) (← links)
- On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity (Q1697274) (← links)
- Symbolic computation and computer graphics as tools for developing and studying new root-finding methods (Q1734734) (← links)
- Multiplicity estimating algorithm for zeros of a complex polynomial and its applications (Q1801851) (← links)
- On some iteration functions for the simultaneous computation of multiple complex polynomial zeros (Q1822456) (← links)
- A composite polynomial zerofinding matrix algorithm (Q1903777) (← links)
- Modified Newton method in circular interval arithmetic (Q1904962) (← links)
- On zero-finding methods of the fourth order (Q1917923) (← links)
- On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros (Q2279594) (← links)
- A one parameter family of locally quartically convergent zero-finding methods (Q2372917) (← links)
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials (Q2402410) (← links)
- Some methods for simultaneous extraction of a part of all multiple roots of algebraic polynomials (Q2487209) (← links)
- An acceleration of iterative processes for solving nonlinear equations (Q2572682) (← links)
- The Durand-Kerner polynomials roots-finding method in case of multiple roots (Q2640316) (← links)
- Higher-order iteration functions for simultaneously approximating polynomial zeros (Q3311583) (← links)
- Computing multiple roots of inexact polynomials (Q4654026) (← links)
- Some higher-order methods for the simultaneous approximation of multiple polynomial zeros (Q4728106) (← links)
- On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros (Q5225442) (← links)
- Computer tools for the construction and analysis of some efficient root-finding simultaneous methods (Q5865291) (← links)
- A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence (Q6049349) (← links)
- Families of high-order simultaneous methods with several corrections (Q6618238) (← links)
