On dependence of MR- and MM-algorithms upon the value of switching control variable CTR

DOI10.1016/0377-0427(88)90335-4MaRDI QIDQ1107267zbMATH OpenOpenAlexFDO

Authors Andrzej S. Kozek, Anna Trzmielak-Stanisławska

Publication date 1988

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(88)90335-4

zbMATH Keywords

switching control variablezero-finding algorithms

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Review text

Improvements of the zero-finding algorithms by \textit{J. C. P. Bus} and \textit{T. J. Dekker} [ACM Trans. Math. Software 1, 330-345 (1975; Zbl 0315.65031)] are briefly discussed and compared to the originals by means of numerical results for a set of test functions published in one of the references.

Recommendations

• On a class of omnibus algorithms for zero-finding
• Three New Rapidly Convergent Algorithms for Finding a Zero of a Function
• Algorithm 748: enclosing zeros of continuous functions
• New zero-finders for trust-region computations
• scientific article; zbMATH DE number 1742537

Cites work

• A comparison of non-linear equation solvers
• An efficient derivative-free method for solving nonlinear equations
• On a class of omnibus algorithms for zero-finding
• Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function

Cited in

(1)

• On a class of omnibus algorithms for zero-finding

Describes a project that uses

Uses Software

• zeroin

This page was built for publication: On dependence of MR- and MM-algorithms upon the value of switching control variable CTR

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