Approximated tensor sum preconditioner for stochastic automata networks

Some iterative and projection methods for SAN have been tested with a modest success. Several preconditioners for SAN have been developed to speedup the convergence rate. Recently Langville and Stewart proposed the nearest Kronecker product (NKP) preconditioner for SAN with a great success. Encourag...

Full description

Saved in:
Bibliographic Details
Main Author: Touzene, A.
Format: Conference Proceeding
Language:English
Subjects:
Automata
Convergence
Costs
Iterative methods
Large-scale systems
Power system modeling
Stochastic processes
Storage area networks
Tensile stress
Testing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Some iterative and projection methods for SAN have been tested with a modest success. Several preconditioners for SAN have been developed to speedup the convergence rate. Recently Langville and Stewart proposed the nearest Kronecker product (NKP) preconditioner for SAN with a great success. Encouraged by their work, we propose a new preconditioning method, called approximated tensor sum preconditioner (ATSP), which uses tensor sum preconditioner rather than Kronecker product preconditioner. In ATSP, we take into account the effect of the synchronizations using an approximation technique. Our preconditioner outperforms the NKP preconditioner for the tested SAN Model
ISSN:1530-2075
DOI:10.1109/IPDPS.2006.1639649