File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/S0898-1221(99)00341-7
- Scopus: eid_2-s2.0-0034140281
- WOS: WOS:000085203800014
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Circulant approximation for preconditioning in stochastic automata networks
Title | Circulant approximation for preconditioning in stochastic automata networks |
---|---|
Authors | |
Issue Date | 2000 |
Publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/camwa |
Citation | Computers And Mathematics With Applications, 2000, v. 39 n. 3-4, p. 147-160 How to Cite? |
Abstract | Stochastic Automata Networks (SANs) are widely used in modeling practical systems such as queueing systems, communication systems, and manufacturing systems. For the performance analysis purposes, one needs to calculate the steady-state distributions of SANs. Usually, the steady-state distributions have no close form solutions and cannot be obtained efficiently by direct methods such as LU decomposition due to the huge size of the generator matrices. An efficient numerical method should make use of the tensor structure of SANs' generator matrices. The generalized Conjugate Gradient (CG) methods are possible choices though their convergence rates are slow in general. To speed up the convergence rate, preconditioned CG methods are considered in this paper. In particular, circulant based preconditioners for the SANs are constructed. The preconditioners presented in this paper are easy to construct and can be inverted efficiently. Numerical examples of practical SANs are also given to illustrate the fast convergence rate of the method. |
Persistent Identifier | http://hdl.handle.net/10722/75289 |
ISSN | 2023 Impact Factor: 2.9 2023 SCImago Journal Rankings: 0.949 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ching, WK | en_HK |
dc.contributor.author | Zhou, XY | en_HK |
dc.date.accessioned | 2010-09-06T07:09:43Z | - |
dc.date.available | 2010-09-06T07:09:43Z | - |
dc.date.issued | 2000 | en_HK |
dc.identifier.citation | Computers And Mathematics With Applications, 2000, v. 39 n. 3-4, p. 147-160 | en_HK |
dc.identifier.issn | 0898-1221 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/75289 | - |
dc.description.abstract | Stochastic Automata Networks (SANs) are widely used in modeling practical systems such as queueing systems, communication systems, and manufacturing systems. For the performance analysis purposes, one needs to calculate the steady-state distributions of SANs. Usually, the steady-state distributions have no close form solutions and cannot be obtained efficiently by direct methods such as LU decomposition due to the huge size of the generator matrices. An efficient numerical method should make use of the tensor structure of SANs' generator matrices. The generalized Conjugate Gradient (CG) methods are possible choices though their convergence rates are slow in general. To speed up the convergence rate, preconditioned CG methods are considered in this paper. In particular, circulant based preconditioners for the SANs are constructed. The preconditioners presented in this paper are easy to construct and can be inverted efficiently. Numerical examples of practical SANs are also given to illustrate the fast convergence rate of the method. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/camwa | en_HK |
dc.relation.ispartof | Computers and Mathematics with Applications | en_HK |
dc.title | Circulant approximation for preconditioning in stochastic automata networks | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0898-1221&volume=39&spage=147&epage=160&date=2000&atitle=Circulant+Approximation+for+Preconditioning+in+Stochastic+Automata+Networks | en_HK |
dc.identifier.email | Ching, WK:wching@hku.hk | en_HK |
dc.identifier.authority | Ching, WK=rp00679 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/S0898-1221(99)00341-7 | en_HK |
dc.identifier.scopus | eid_2-s2.0-0034140281 | en_HK |
dc.identifier.hkuros | 63210 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0034140281&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 39 | en_HK |
dc.identifier.issue | 3-4 | en_HK |
dc.identifier.spage | 147 | en_HK |
dc.identifier.epage | 160 | en_HK |
dc.identifier.isi | WOS:000085203800014 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Ching, WK=13310265500 | en_HK |
dc.identifier.scopusauthorid | Zhou, XY=7410089984 | en_HK |
dc.identifier.issnl | 0898-1221 | - |