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.
- Argument principle
- Interval analysis
- Rigorous numerics
- Root finding
- Systems of analytic functions