The University of Southampton
University of Southampton Institutional Repository

Circulant preconditioners for stochastic automata networks

Circulant preconditioners for stochastic automata networks
Circulant preconditioners for stochastic automata networks
Stochastic Automata Networks (SANs) are widely used in modeling communication systems, manufacturing systems and computer systems. The SAN approach gives a more compact and efficient representation of the network when compared to the stochastic Petri nets approach. To find the steady state distribution of SANs, it requires solutions of linear systems involving the generator matrices of the SANs. Very often, direct methods such as the LU decomposition are inefficient because of the huge size of the generator matrices. An efficient algorithm should make use of the structure of the matrices. Iterative methods such as the conjugate gradient methods are possible choices. However, their convergence rates are slow in general and preconditioning is required. We note that the MILU and MINV based preconditioners are not appropriate because of their expensive construction cost. In this paper, we consider preconditioners obtained by circulant approximations of SANs. They have low construction cost and can be inverted efficiently. We prove that if only one of the automata is large in size compared to the others, then the preconditioned system of the normal equations will converge very fast. Numerical results for three different SANs solved by CGS are given to illustrate the fast convergence of our method.
35-57
Chan, Raymond H.
1898019c-f54f-4b64-807d-d1335e76fd38
Ching, Wai Ki
cfee9d26-97e3-42ce-a4e9-b91e6d8aeef7
Chan, Raymond H.
1898019c-f54f-4b64-807d-d1335e76fd38
Ching, Wai Ki
cfee9d26-97e3-42ce-a4e9-b91e6d8aeef7

Chan, Raymond H. and Ching, Wai Ki (2000) Circulant preconditioners for stochastic automata networks. Numerische Mathematik, 87 (1), 35-57. (doi:10.1007/s002110000173).

Record type: Article

Abstract

Stochastic Automata Networks (SANs) are widely used in modeling communication systems, manufacturing systems and computer systems. The SAN approach gives a more compact and efficient representation of the network when compared to the stochastic Petri nets approach. To find the steady state distribution of SANs, it requires solutions of linear systems involving the generator matrices of the SANs. Very often, direct methods such as the LU decomposition are inefficient because of the huge size of the generator matrices. An efficient algorithm should make use of the structure of the matrices. Iterative methods such as the conjugate gradient methods are possible choices. However, their convergence rates are slow in general and preconditioning is required. We note that the MILU and MINV based preconditioners are not appropriate because of their expensive construction cost. In this paper, we consider preconditioners obtained by circulant approximations of SANs. They have low construction cost and can be inverted efficiently. We prove that if only one of the automata is large in size compared to the others, then the preconditioned system of the normal equations will converge very fast. Numerical results for three different SANs solved by CGS are given to illustrate the fast convergence of our method.

This record has no associated files available for download.

More information

Published date: 2000
Organisations: Operational Research

Identifiers

Local EPrints ID: 29749
URI: http://eprints.soton.ac.uk/id/eprint/29749
PURE UUID: ac42f24f-334c-4522-b8ab-d8825f8aba10

Catalogue record

Date deposited: 20 Jul 2006
Last modified: 15 Mar 2024 07:34

Export record

Altmetrics

Contributors

Author: Raymond H. Chan
Author: Wai Ki Ching

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×