Computing the Root of an Equation Occurring in Oueueing Theory and Branching Processes
The least positive root q of the equation F(s) = s, where F(s) is a probability generating function, is of interest in the theory of branching processes and in the theory of the GI/M/n queue. A computational procedure is given to approximate q to any given degree of accuracy. The question of startin...
Gespeichert in:
| Veröffentlicht in: | INFOR. Information systems and operational research 1977-02, Vol.15 (1), p.72-75 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | The least positive root q of the equation F(s) = s, where F(s) is a probability generating function, is of interest in the theory of branching processes and in the theory of the GI/M/n queue. A computational procedure is given to approximate q to any given degree of accuracy. The question of starting values for the algorithm is discussed. |
|---|---|
| ISSN: | 0315-5986 1916-0615 |
| DOI: | 10.1080/03155986.1977.11731656 |