Schröder-like algorithms for multiple complex zeros of a polynomial

DOI10.1007/BF02250583zbMATH Open0722.65025MaRDI QIDQ756374FDOQ756374

Authors: M. S. Petković 

Publication date: 1990

Published in: Computing (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2015316
• Convergence of Schröder method for polynomial zeros of unknown multiplicity
• Improved methods for the simultaneous inclusion of multiple polynomial zeros
• On some iteration functions for the simultaneous computation of multiple complex polynomial zeros
• On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity

zbMATH Keywords

algorithmsconvergencecomputational efficiencyinterval methodspolynomial equationcircular arithmeticmultiple complex zeroSchröder's method

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) 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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A family of root finding methods
• Iterative methods for simultaneous inclusion of polynomial zeros
• Title not available (Why is that?)
• Parallel Laguerre iterations: The complex case
• Circular arithmetic and the determination of polynomial zeros
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
• On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
• Some interval iterations for finding a zero of a polynomial with error bounds
• On an iterative method for simultaneous inclusion of polynomial complex zeros
• On the efficiency of some combined methods for polynomial complex zeros

Cited In (5)

• Title not available (Why is that?)
• Regions of convergence and dynamics of Schröder-like iteration formulae as applied to complex polynomial equations with multiple roots
• Convergence of Schröder method for polynomial zeros of unknown multiplicity
• The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic
• The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. I: Correction methods

This page was built for publication: Schröder-like algorithms for multiple complex zeros of a polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756374)