Scaled parallel iterative method for finding real roots of nonlinear equations

DOI10.1080/02331934.2021.1873985MaRDI QIDQ5038158zbMATH OpenOpenAlexFDO

Authors Chuei Yee Chen, Abdul Hakim Ghazali, W. J. Leong

Publication date 29 September 2022

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2021.1873985

zbMATH Keywords

performance profileinterval valued functionsparallel iterative methodroot finding proceduremidpoint scaling procedure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Nonconvex programming, global optimization (90C26) Numerical computation of roots of polynomial equations (65H04)

Recommendations

• A fast and robust method for computing real roots of nonlinear equations
• An accelerated iteration method for finding all zeros of a polynomial
• A modified iterative method for finding the real roots of a polynomial
• scientific article; zbMATH DE number 697758
• On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial

Cites work

• scientific article; zbMATH DE number 3161517 (Why is no real title available?)
• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 4147405 (Why is no real title available?)
• scientific article; zbMATH DE number 1440908 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A posteriori error bounds for the zeros of polynomials
• An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
• Benchmarking optimization software with performance profiles.
• Circular arithmetic and the determination of polynomial zeros
• Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Global optimization using interval analysis: The one-dimensional case
• Introduction to Interval Analysis
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• On an iterative method for simultaneous inclusion of polynomial complex zeros
• On some methods for the simultaneous determination of polynomial zeros
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
• On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
• On the interval zoro symmetric single-step procedure for simultaneous finding of polynomial zeros
• The interval symmetric single-step \textit{ISS1} procedure for simultaneously bounding simple polynomial zeros
• Weierstrass method for quaternionic polynomial root-finding

Describes a project that uses

Uses Software

• IZSS1
• INTLAB

This page was built for publication: Scaled parallel iterative method for finding real roots of nonlinear equations

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