Ítem
Solo Metadatos

A fast newton's iteration for M/G/1-type and GI/M/1-type markov chains

dc.creatorPérez, Juan F.spa
dc.creatorTelek, Miklósspa
dc.creatorVan Houdt, Bennyspa
dc.date.accessioned2020-08-19T14:42:10Z
dc.date.available2020-08-19T14:42:10Z
dc.date.created2012-11-06spa
dc.description.abstractIn this article we revisit Newton's iteration as a method to find the G or R matrix in M/G/1-type and GI/M/1-type Markov chains. We start by reconsidering the method proposed in Ref.[ 15 ], which required O(m 6 + Nm 4) time per iteration, and show that it can be reduced to O(Nm 4), where m is the block size and N the number of blocks. Moreover, we show how this method is able to further reduce this time complexity to O(Nr 3 + Nm 2 r 2 + m 3 r) when A 0 has rank r < m. In addition, we consider the case where [A 1 A 2…A N ] is of rank r < m and propose a new Newton's iteration method which is proven to converge quadratically and that has a time complexity of O(Nm 3 + Nm 2 r 2 + mr 3) per iteration. The computational gains in all the cases are illustrated through numerical examples.eng
dc.format.mimetypeapplication/pdf
dc.identifier.doihttps://doi.org/10.1080/15326349.2012.726038
dc.identifier.issnISSN: 1532-6349
dc.identifier.issnEISSN: 1532-4214
dc.identifier.urihttps://repository.urosario.edu.co/handle/10336/27431
dc.language.isoengspa
dc.publisherThe Institute for Operations Research and the Management Sciencesspa
dc.publisherTaylor & Francisspa
dc.relation.citationEndPage383
dc.relation.citationIssueNo. 3
dc.relation.citationStartPage357
dc.relation.citationTitleStochastic Models
dc.relation.citationVolumeVol. 26
dc.relation.ispartofStochastic Models, ISSN: 1532-6349;EISSN: 1532-4214, Vol.26, No.3 (2010); pp. 357–383spa
dc.relation.urihttps://www.tandfonline.com/doi/abs/10.1080/15326349.2012.726038spa
dc.rights.accesRightsinfo:eu-repo/semantics/restrictedAccess
dc.rights.accesoRestringido (Acceso a grupos específicos)spa
dc.sourceStochastic Modelsspa
dc.source.instnameinstname:Universidad del Rosario
dc.source.reponamereponame:Repositorio Institucional EdocUR
dc.subject.keywordMarkov chainsspa
dc.subject.keywordMatrix-anaytic methodsspa
dc.subject.keywordNewton iterationspa
dc.subject.keywordNumerical methods for Markov chainsspa
dc.titleA fast newton's iteration for M/G/1-type and GI/M/1-type markov chainsspa
dc.title.TranslatedTitleUna iteración de newton rápida para cadenas de markov de tipo M / G / 1 y tipo GI / M / 1spa
dc.typearticleeng
dc.type.hasVersioninfo:eu-repo/semantics/publishedVersion
dc.type.spaArtículospa
Archivos
Colecciones