Approximated tensor sum preconditioner for stochastic automata networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication20th International Parallel and Distributed Processing Symposium, IPDPS 2006
Volume2006
DOIs
Publication statusPublished - 2006

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Touzene, A. (2006). Approximated tensor sum preconditioner for stochastic automata networks. In 20th International Parallel and Distributed Processing Symposium, IPDPS 2006 (Vol. 2006). [1639649] https://doi.org/10.1109/IPDPS.2006.1639649