Algorithms for return probabilities for stochastic fluid flows
| dc.contributor.author | Bean, N. | |
| dc.contributor.author | O'Reilly, M. | |
| dc.contributor.author | Taylor, P. | |
| dc.date.issued | 2005 | |
| dc.description.abstract | We consider several known algorithms and introduce some new algorithms that can be used to calculate the probability of return to the initial level in the Markov stochastic fluid flow model. We give the physical interpretations of these algorithim within the fluid flow environment. The rates of convergence are explained in terms of the physical properties of the fluid flow processes. We compare these algorithms with respect to the numbers of iterations required and their complexity. The performance of the algorithms depends on the nature of the process considered in the analysis. We illustrate this with examples and give appropriate recommendations. | |
| dc.description.statementofresponsibility | Nigel G Bean, Malgorzata M O'Reilly and Peter G Taylor | |
| dc.identifier.citation | Stochastic Models, 2005; 21(1):149-184 | |
| dc.identifier.doi | 10.1081/STM-200046511 | |
| dc.identifier.issn | 1532-6349 | |
| dc.identifier.issn | 1532-4214 | |
| dc.identifier.orcid | Bean, N. [0000-0002-5351-3104] | |
| dc.identifier.uri | http://hdl.handle.net/2440/17851 | |
| dc.language.iso | en | |
| dc.publisher | Taylor & Francis Inc. | |
| dc.relation.grant | http://purl.org/au-research/grants/arc/DP0209921 | |
| dc.source.uri | https://doi.org/10.1081/stm-200046511 | |
| dc.subject | Asmussen's iteration | |
| dc.subject | Fixed-point iterations | |
| dc.subject | Latouche-Ramaswami method | |
| dc.subject | Markovian fluid model | |
| dc.subject | Newton's method | |
| dc.subject | Return probabilities | |
| dc.title | Algorithms for return probabilities for stochastic fluid flows | |
| dc.type | Journal article | |
| pubs.publication-status | Published |