scientific article; zbMATH DE number 903755

MaRDI QIDQ4885369zbMATH OpenFDO

Authors Michael N. Vrahatis

Publication date 11 November 1996

zbMATH Keywords

convergencefast bisection algorithmimprecise problemslarge systemsrootfinding proceduresystems of nonlinear algebraic and transcendental equationstopological degree

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Recommendations

• scientific article; zbMATH DE number 1086544
• A bisection method for systems of nonlinear equations
• Some tests of generalized bisection
• Efficiently Computing Many Roots of a Function
• Abstract Generalized Bisection and a Cost Bound

Cited in

(13)

• An efficient algorithm for range computation of polynomials using the Bernstein form
• Abstract Generalized Bisection and a Cost Bound
• Some tests of generalized bisection
• scientific article; zbMATH DE number 4037050 (Why is no real title available?)
• scientific article; zbMATH DE number 4060637 (Why is no real title available?)
• A bisection/successive approximation method for computing Gittins indices
• scientific article; zbMATH DE number 176428 (Why is no real title available?)
• scientific article; zbMATH DE number 1086544 (Why is no real title available?)
• scientific article; zbMATH DE number 1984133 (Why is no real title available?)
• Algorithm 987: MANBIS -- a C++ mathematical software package for locating and computing efficiently many roots of a function: theoretical issues
• scientific article; zbMATH DE number 4003374 (Why is no real title available?)
• Average-Case Optimality of a Hybrid Secant-Bisection Method
• Efficiently Computing Many Roots of a Function

This page was built for publication:

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