Global root bracketing method with adaptive mesh refinement

DOI10.1016/J.AMC.2015.06.121zbMATH Open1410.65170arXiv1501.05298OpenAlexW1606690785MaRDI QIDQ668161FDOQ668161

M. A. Razbani

Publication date: 18 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Abstract: An efficient method for finding all real roots of a univariate function in a given bounded domain is formulated. The proposed method uses adaptive mesh refinement to locate bracketing intervals based on bisection criterion for root finding. Each bracketing interval encloses one root. An adaptive form of error is introduced to enclose roots in a desired tolerance based on how much close the roots are. Detecting roots with even multiplicity, which is regarded out of the realm of bracketing methods, becomes possible with the method proposed in this paper. Also, strategies for finding odd-multiple roots with the least number of function evaluations is proposed. Adaptive mesh refinement lead to considerable reduction in function evaluations in comparison to previous global root bracketing methods. The reliability of the proposed method is being illustrated by several examples.

Full work available at URL: https://arxiv.org/abs/1501.05298

Recommendations

• Efficiently Computing Many Roots of a Function
• A globally convergent interval Newton's method for computing and bounding real roots of a function with one variable
• On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods
• A fast and robust method for computing real roots of nonlinear equations
• scientific article

zbMATH Keywords

adaptive mesh refinementroot findingbisectionbracketing methodseven-multiple rootodd-multiple roots

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical computation of solutions to single equations (65H05)

Cites Work

• A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
• Title not available (Why is that?)
• Some tests of generalized bisection
• A simple reliable solver for all the roots of a nonlinear function in a given domain
• Multidimensional bisection applied to global optimisation
• A bisection method for systems of nonlinear equations
• Efficiently Computing Many Roots of a Function

Cited In (1)

• Robust crossings detection in noisy signals using topological signal processing

This page was built for publication: Global root bracketing method with adaptive mesh refinement

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