Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
DOI10.1016/0377-0427(94)00086-GzbMATH Open0837.65048MaRDI QIDQ1900755FDOQ1900755
Authors: Masao Igarashi, Tjalling J. Ypma 
Publication date: 1995
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
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
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)
Cites Work
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A Termination Criterion for Iterative Methods Used to Find the Zeros of Polynomials
- Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
- A class of iterative methods for holomorphic functions
- Practical problems arising for finding roots of nonlinear equations
Cited In (5)
- On rediscovered iteration methods for solving equations
- A study of accelerated Newton methods for multiple polynomial roots
- On the rediscovery of Halley's iterative method for computing the zero of an analytic function
- Computing multiple roots of inexact polynomials
- Computing singular points of projective plane algebraic curves by homotopy continuation methods
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)
