Enclosing all zeros of a system of analytic functions

J. Dahne, M.F. Ciappina and W. Tucker

Applied Mathematics and Computation, 2019, vol. 348, issue C, 513-522

Abstract: We present a rigorous numerical method for location of simple zeros of a system of two analytic functions in a rectangular cuboid domain based on the logarithmic integral. We compare this to a simpler, also rigorous, method based on bisection. The latter is determined to be more efficient in the examples considered. This is mainly due to inefficient methods for computing the logarithmic integral occurring in the former method.

Keywords: Rigorous numerics; Argument principle; Root finding; Interval analysis; Systems of analytic functions (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318307550
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:348:y:2019:i:c:p:513-522

DOI: 10.1016/j.amc.2018.08.041

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 ().