File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/1190095.1190111
- Scopus: eid_2-s2.0-34748840231
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Fast solvers for queueing systems with negative customers
Title | Fast solvers for queueing systems with negative customers |
---|---|
Authors | |
Keywords | Gohberg-Semencul Formula Negative Customer Preconditioned Conjugate Gradient Method Preconditioners Queueing Systems |
Issue Date | 2006 |
Citation | Acm International Conference Proceeding Series, 2006, v. 180, article no. 13 How to Cite? |
Abstract | In this paper, we are interested in solving queueing systems having Poisson batch arrivals, exponential servers and negative customers. Preconditioned Conjugate Gradient (PCG) method is applied to solving the steady-state probability distribution of the queueing system. Preconditioners are constructed by exploiting near-Toeplitz structure of the generator matrix and the Gohberg-Semumcul formula. We proved that the preconditioned system has singular values clustered around one. Therefore Conjugate Gradient (CG) methods when applied to solving the preconditioned system, we expect fast convergence rate. Numerical examples are given to demonstrate our claim. Copyright 2006 ACM. |
Persistent Identifier | http://hdl.handle.net/10722/158864 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wen, YW | en_US |
dc.contributor.author | Ching, WK | en_US |
dc.contributor.author | Ng, MK | en_US |
dc.date.accessioned | 2012-08-08T09:03:59Z | - |
dc.date.available | 2012-08-08T09:03:59Z | - |
dc.date.issued | 2006 | en_US |
dc.identifier.citation | Acm International Conference Proceeding Series, 2006, v. 180, article no. 13 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/158864 | - |
dc.description.abstract | In this paper, we are interested in solving queueing systems having Poisson batch arrivals, exponential servers and negative customers. Preconditioned Conjugate Gradient (PCG) method is applied to solving the steady-state probability distribution of the queueing system. Preconditioners are constructed by exploiting near-Toeplitz structure of the generator matrix and the Gohberg-Semumcul formula. We proved that the preconditioned system has singular values clustered around one. Therefore Conjugate Gradient (CG) methods when applied to solving the preconditioned system, we expect fast convergence rate. Numerical examples are given to demonstrate our claim. Copyright 2006 ACM. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | ACM International Conference Proceeding Series | en_US |
dc.subject | Gohberg-Semencul Formula | en_US |
dc.subject | Negative Customer | en_US |
dc.subject | Preconditioned Conjugate Gradient Method | en_US |
dc.subject | Preconditioners | en_US |
dc.subject | Queueing Systems | en_US |
dc.title | Fast solvers for queueing systems with negative customers | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Ching, WK:wching@hku.hk | en_US |
dc.identifier.authority | Ching, WK=rp00679 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1145/1190095.1190111 | en_US |
dc.identifier.scopus | eid_2-s2.0-34748840231 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-34748840231&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 180 | en_US |
dc.identifier.spage | article no. 13 | - |
dc.identifier.epage | article no. 13 | - |
dc.identifier.scopusauthorid | Wen, YW=7401777008 | en_US |
dc.identifier.scopusauthorid | Ching, WK=13310265500 | en_US |
dc.identifier.scopusauthorid | Ng, MK=34571761900 | en_US |