Approximated tensor sum preconditioner for stochastic automata networks

Abderezak Touzene*

*المؤلف المقابل لهذا العمل

نتاج البحث: Conference contribution

1 اقتباس (Scopus)

ملخص

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.

اللغة الأصليةEnglish
عنوان منشور المضيف20th International Parallel and Distributed Processing Symposium, IPDPS 2006
ناشرIEEE Computer Society
رقم المعيار الدولي للكتب (المطبوع)1424400546, 9781424400546
المعرِّفات الرقمية للأشياء
حالة النشرPublished - 2006
الحدث20th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2006 - Rhodes Island, Greece
المدة: أبريل ٢٥ ٢٠٠٦أبريل ٢٩ ٢٠٠٦

سلسلة المنشورات

الاسم20th International Parallel and Distributed Processing Symposium, IPDPS 2006
مستوى الصوت2006

Conference

Conference20th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2006
الدولة/الإقليمGreece
المدينةRhodes Island
المدة٤/٢٥/٠٦٤/٢٩/٠٦

ASJC Scopus subject areas

  • ???subjectarea.asjc.2200.2200???

بصمة

أدرس بدقة موضوعات البحث “Approximated tensor sum preconditioner for stochastic automata networks'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا