Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
From MaRDI portal
(Redirected from Publication:1900755)
Recommendations
- An optimal multiple root-finding method of order three
- On an efficient method for the simultaneous approximation of polynomial multiple roots
- Introduction to higher-order iterative methods for finding multiple roots of nonlinear equations
- On some optimal multiple root-finding methods and their dynamics
- scientific article; zbMATH DE number 3876483
Cites work
- A Termination Criterion for Iterative Methods Used to Find the Zeros of Polynomials
- A class of iterative methods for holomorphic functions
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
- Practical problems arising for finding roots of nonlinear equations
Cited in
(5)- Computing multiple roots of inexact polynomials
- A study of accelerated Newton methods for multiple polynomial roots
- Computing singular points of projective plane algebraic curves by homotopy continuation methods
- On the rediscovery of Halley's iterative method for computing the zero of an analytic function
- On rediscovered iteration methods for solving equations
This page was built for publication: Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900755)
