Computing the Root of an Equation Occurring in Oueueing Theory and Branching Processes

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:INFOR. Information systems and operational research 1977-02, Vol.15 (1), p.72-75
Hauptverfasser: John, R.D., Quine, M.P.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 75
container_issue 1
container_start_page 72
container_title INFOR. Information systems and operational research
container_volume 15
creator John, R.D.
Quine, M.P.
description 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.
doi_str_mv 10.1080/03155986.1977.11731656
format Article
fullrecord <record><control><sourceid>crossref_infor</sourceid><recordid>TN_cdi_crossref_primary_10_1080_03155986_1977_11731656</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1080_03155986_1977_11731656</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1056-4adba802d9439bfee53c94452446181003dcb0b59c01b8518e0a5fea68838ed93</originalsourceid><addsrcrecordid>eNqFkNtKAzEQhoMoWKuvIHmBrTPNJptc1lIPIFSkehuy2cSutJua7CJ9extqr72aA98_MB8htwgTBAl3wJBzJcUEVVVNECuGgoszMkKFogCB_JyMMlRk6pJcpfQFgFNW4Yh8zMN2N_Rt90n7taNvIfQ0eGo6uvgeTN-Gji6tHWLMRHsYBje43K_WLsT9AWzofTSdXeflawzWpeTSNbnwZpPczV8dk_eHxWr-VLwsH5_ns5fCInBRlKapjYRpo0qmau8cZ1aVJZ-WpUCJAKyxNdRcWcBacpQODPfOCCmZdI1iYyKOd20MKUXn9S62WxP3GkFnO_pkR2c7-mTnEJwdg23nQ9yanxA3je7NfhOiz_-0SbN_bvwCaRRsNQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Computing the Root of an Equation Occurring in Oueueing Theory and Branching Processes</title><source>EBSCOhost Business Source Complete</source><creator>John, R.D. ; Quine, M.P.</creator><creatorcontrib>John, R.D. ; Quine, M.P.</creatorcontrib><description>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.</description><identifier>ISSN: 0315-5986</identifier><identifier>EISSN: 1916-0615</identifier><identifier>DOI: 10.1080/03155986.1977.11731656</identifier><language>eng</language><publisher>Taylor &amp; Francis</publisher><ispartof>INFOR. Information systems and operational research, 1977-02, Vol.15 (1), p.72-75</ispartof><rights>Copyright 1977 Taylor and Francis Group LLC 1977</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c1056-4adba802d9439bfee53c94452446181003dcb0b59c01b8518e0a5fea68838ed93</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>John, R.D.</creatorcontrib><creatorcontrib>Quine, M.P.</creatorcontrib><title>Computing the Root of an Equation Occurring in Oueueing Theory and Branching Processes</title><title>INFOR. Information systems and operational research</title><description>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.</description><issn>0315-5986</issn><issn>1916-0615</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1977</creationdate><recordtype>article</recordtype><recordid>eNqFkNtKAzEQhoMoWKuvIHmBrTPNJptc1lIPIFSkehuy2cSutJua7CJ9extqr72aA98_MB8htwgTBAl3wJBzJcUEVVVNECuGgoszMkKFogCB_JyMMlRk6pJcpfQFgFNW4Yh8zMN2N_Rt90n7taNvIfQ0eGo6uvgeTN-Gji6tHWLMRHsYBje43K_WLsT9AWzofTSdXeflawzWpeTSNbnwZpPczV8dk_eHxWr-VLwsH5_ns5fCInBRlKapjYRpo0qmau8cZ1aVJZ-WpUCJAKyxNdRcWcBacpQODPfOCCmZdI1iYyKOd20MKUXn9S62WxP3GkFnO_pkR2c7-mTnEJwdg23nQ9yanxA3je7NfhOiz_-0SbN_bvwCaRRsNQ</recordid><startdate>19770201</startdate><enddate>19770201</enddate><creator>John, R.D.</creator><creator>Quine, M.P.</creator><general>Taylor &amp; Francis</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19770201</creationdate><title>Computing the Root of an Equation Occurring in Oueueing Theory and Branching Processes</title><author>John, R.D. ; Quine, M.P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1056-4adba802d9439bfee53c94452446181003dcb0b59c01b8518e0a5fea68838ed93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1977</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>John, R.D.</creatorcontrib><creatorcontrib>Quine, M.P.</creatorcontrib><collection>CrossRef</collection><jtitle>INFOR. Information systems and operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>John, R.D.</au><au>Quine, M.P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Computing the Root of an Equation Occurring in Oueueing Theory and Branching Processes</atitle><jtitle>INFOR. Information systems and operational research</jtitle><date>1977-02-01</date><risdate>1977</risdate><volume>15</volume><issue>1</issue><spage>72</spage><epage>75</epage><pages>72-75</pages><issn>0315-5986</issn><eissn>1916-0615</eissn><abstract>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.</abstract><pub>Taylor &amp; Francis</pub><doi>10.1080/03155986.1977.11731656</doi><tpages>4</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0315-5986
ispartof INFOR. Information systems and operational research, 1977-02, Vol.15 (1), p.72-75
issn 0315-5986
1916-0615
language eng
recordid cdi_crossref_primary_10_1080_03155986_1977_11731656
source EBSCOhost Business Source Complete
title Computing the Root of an Equation Occurring in Oueueing Theory and Branching Processes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T07%3A23%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_infor&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Computing%20the%20Root%20of%20an%20Equation%20Occurring%20in%20Oueueing%20Theory%20and%20Branching%20Processes&rft.jtitle=INFOR.%20Information%20systems%20and%20operational%20research&rft.au=John,%20R.D.&rft.date=1977-02-01&rft.volume=15&rft.issue=1&rft.spage=72&rft.epage=75&rft.pages=72-75&rft.issn=0315-5986&rft.eissn=1916-0615&rft_id=info:doi/10.1080/03155986.1977.11731656&rft_dat=%3Ccrossref_infor%3E10_1080_03155986_1977_11731656%3C/crossref_infor%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true