On the \(R\)-order of some accelerated methods for the simultaneous finding of polynomial zeros
From MaRDI portal
Publication:1207050
DOI10.1007/BF02248695zbMath0781.65042OpenAlexW185361392MaRDI QIDQ1207050
Zvezdan M. Marjanović, Lidija V. Stefanović, Miodrag S. Petković
Publication date: 4 May 1993
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02248695
iterative methodscomputational efficiency\(R\)-order of convergenceNumerical examplesroots of a polynomialsingle step methodsmultiple complex zeros
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Family of simultaneous methods of Hansen--Patrick's type ⋮ Chebyshev-Halley methods for analytic functions
Cites Work
- Unnamed Item
- Unnamed Item
- On the convergence order of a modified method for simultaneous finding polynomial zeros
- A family of root finding methods
- Iterative methods for simultaneous inclusion of polynomial zeros
- Zur iterativen Auflösung algebraischer Gleichungen
- A family of simultaneous zero finding methods
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- Some higher-order methods for the simultaneous approximation of multiple polynomial zeros
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- A modified Newton method for polynomials
This page was built for publication: On the \(R\)-order of some accelerated methods for the simultaneous finding of polynomial zeros