Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.amc.2018.08.041 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Rigorous numerics,Argument principle,Root finding,Interval analysis,Systems of analytic functions | Logarithmic integral function,Bisection,Mathematical analysis,Analytic function,Root-finding algorithm,Cuboid,Argument principle,Numerical analysis,Interval arithmetic,Mathematics | Journal |
Volume | ISSN | Citations |
348 | 0096-3003 | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Dahne | 1 | 0 | 0.34 |
| M. F. Ciappina | 2 | 0 | 1.35 |
| Warwick Tucker | 3 | 103 | 16.04 |