Abstract
Many methods for numerically inverting transforms require values of the transform at complex arguments. However, in some applications, the transforms are only characterized implicitly via functional equations. This is illustrated by the busy-period distribution in the M/G/1 queue. In this paper we provide conditions for iterative methods to converge for complex arguments. Moreover, we show that stochastic monotonicity properties can provide useful bounds.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
