Computer tools for the construction and analysis of some efficient root-finding simultaneous methods

DOI10.2298/FIL2007151PMaRDI QIDQ5865291zbMATH OpenFDO

Authors Ivan Petković, Djordje Herceg

Publication date 13 June 2022

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/FIL2007151P

zbMATH Keywords

computer visualizationconvergence analysispolynomial multiple zerosSchröder's methodssimultaneous iterative methods

Mathematics Subject Classification ID

Numerical approximation and evaluation of special functions (33F05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of solutions to single equations (65H05) Analysis of algorithms (68W40)

Cites work

• A note on \(Q\)-order of convergence
• A note on some improvements of the simultaneous methods for determination of polynomial zeros
• An algorithm for the total, or partial, factorization of a polynomial
• Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
• Dynamic study of Schröder's families of first and second kind
• Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions
• General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
• General local convergence theory for a class of iterative processes and its applications to Newton's method
• Graphic and numerical comparison between iterative methods
• scientific article; zbMATH DE number 996039 (Why is no real title available?)
• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 3492087 (Why is no real title available?)
• scientific article; zbMATH DE number 1179336 (Why is no real title available?)
• scientific article; zbMATH DE number 3407053 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• Iteration functions re-visited
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Iterative methods for simultaneous inclusion of polynomial zeros
• Locating multiple zeros interactively
• New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
• Numerical computation of polynomial zeros by means of Aberth's method
• Numerical methods for roots of polynomials. II
• Numerical methods for roots of polynomials. Part I
• On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity
• On iteration methods without derivatives for the simultaneous determination of polynomial zeros
• On rediscovered iteration methods for solving equations
• On Schröder's families of root-finding methods
• On the global convergence of Halley's iteration formula
• On the global convergence of Schröder's iteration formula for real zeros of entire functions
• Point estimation of root finding methods
• Polynomial root-finding and polynomiography
• Relationships between different types of initial conditions for simultaneous root finding methods
• Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
• Unified convergence analysis for Picard iteration in n-dimensional vector spaces

Cited in

(1)

• Computer technology of constructing \(T\)-efficient algorithms for computing \({\varepsilon}\)-solutions of computational and applied mathematical problems

Describes a project that uses

Uses Software

• na10

This page was built for publication: Computer tools for the construction and analysis of some efficient root-finding simultaneous methods

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