Approximated tensor sum preconditioner for stochastic automata networks

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

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

Tensors
Synchronization

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

Approximated tensor sum preconditioner for stochastic automata networks. / Touzene, Abderezak.

20th International Parallel and Distributed Processing Symposium, IPDPS 2006. Vol. 2006 2006. 1639649.

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

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
Touzene A. Approximated tensor sum preconditioner for stochastic automata networks. In 20th International Parallel and Distributed Processing Symposium, IPDPS 2006. Vol. 2006. 2006. 1639649 https://doi.org/10.1109/IPDPS.2006.1639649
Touzene, Abderezak. / Approximated tensor sum preconditioner for stochastic automata networks. 20th International Parallel and Distributed Processing Symposium, IPDPS 2006. Vol. 2006 2006.
@inproceedings{13a923091c534abcb9df2cee68f4225c,
title = "Approximated tensor sum preconditioner for stochastic automata networks",
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.",
author = "Abderezak Touzene",
year = "2006",
doi = "10.1109/IPDPS.2006.1639649",
language = "English",
isbn = "1424400546",
volume = "2006",
booktitle = "20th International Parallel and Distributed Processing Symposium, IPDPS 2006",

}

TY - GEN

T1 - Approximated tensor sum preconditioner for stochastic automata networks

AU - Touzene, Abderezak

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33847135354&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847135354&partnerID=8YFLogxK

U2 - 10.1109/IPDPS.2006.1639649

DO - 10.1109/IPDPS.2006.1639649

M3 - Conference contribution

SN - 1424400546

SN - 9781424400546

VL - 2006

BT - 20th International Parallel and Distributed Processing Symposium, IPDPS 2006

ER -