Global root bracketing method with adaptive mesh refinement

M.A. Razbani

Applied Mathematics and Computation, 2015, vol. 268, issue C, 628-635

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 close the roots are. Detecting roots with even multiplicity, which is regarded as beyond 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 are 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 illustrated by several examples.

Keywords: Root finding; Bracketing methods; Bisection; Adaptive mesh refinement; Odd-multiple roots; Even-multiple root (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315009029
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:268:y:2015:i:c:p:628-635

DOI: 10.1016/j.amc.2015.06.121

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().