Follow
Tuğrul Dayar
Tuğrul Dayar
Professor of Computer Engineering
No verified email - Homepage
Title
Cited by
Cited by
Year
Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains
T Dayar, WJ Stewart
SIAM Journal on Scientific Computing 21 (5), 1691-1705, 2000
982000
Iterative methods based on splittings for stochastic automata networks
E Uysal, T Dayar
European Journal of Operational Research 110 (1), 166-186, 1998
711998
Quasi lumpability, lower-bounding coupling matrices, and nearly completely decomposable Markov chains
T Dayar, WJ Stewart
SIAM Journal on Matrix Analysis and Applications 18 (2), 482-498, 1997
601997
Analyzing Markov chains using Kronecker products: theory and applications
T Dayar
Springer Science & Business Media, 2012
582012
Comparison of multilevel methods for Kronecker-based Markovian representations
P Buchholz, T Dayar
Computing 73, 349-371, 2004
552004
Bounding the equilibrium distribution of Markov population models
T Dayar, H Hermanns, D Spieler, V Wolf
Numerical linear algebra with applications 18 (6), 931-946, 2011
472011
Infinite level-dependent QBD processes and matrix-analytic solutions for stochastic chemical kinetics
T Dayar, W Sandmann, D Spieler, V Wolf
Advances in Applied Probability 43 (4), 1005-1026, 2011
452011
On the convergence of a class of multilevel methods for large sparse Markov chains
P Buchholz, T Dayar
SIAM Journal on Matrix Analysis and Applications 29 (3), 1025-1049, 2007
402007
On the effects of using the Grassmann–Taksar–Heyman method in iterative aggregation–disaggregation
T Dayar, WJ Stewart
SIAM Journal on Scientific Computing 17 (1), 287-303, 1996
381996
Block SOR for Kronecker structured representations
P Buchholz, T Dayar
Linear algebra and its applications 386, 83-109, 2004
332004
Block SOR preconditioned projection methods for Kronecker structured Markovian representations
P Buchholz, T Dayar
SIAM Journal on Scientific Computing 26 (4), 1289-1313, 2005
302005
Computing moments of first passage times to a subset of states in Markov chains
T Dayar, N Akar
SIAM Journal on Matrix Analysis and Applications 27 (2), 396-412, 2005
292005
Permuting Markov chains to nearly completely decomposable form
T Dayar
SIAM J. Matrix Anal. Appl., to appear, 1998
291998
State Space Orderings for Gauss--Seidel in Markov Chains Revisited
T Dayar
SIAM Journal on Scientific Computing 19 (1), 148-154, 1998
291998
Transforming stochastic matrices for stochastic comparison with the st-order
T Dayar, JM Fourneau, N Pekergin
RAIRO-Operations Research-Recherche Opérationnelle 37 (2), 85-97, 2003
262003
Stochastic automata networks and near complete decomposability
O Gusak, T Dayar, JM Fourneau
SIAM Journal on Matrix analysis and Applications 23 (2), 581-599, 2001
262001
Lumpable continuous-time stochastic automata networks
O Gusak, T Dayar, JM Fourneau
European Journal of Operational Research 148 (2), 436-451, 2003
242003
Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks
O Gusak, T Dayar, JM Fourneau
Performance Evaluation 53 (1), 43-69, 2003
212003
Analyzing Markov chains based on Kronecker products
T Dayar
MAM, 279-300, 2006
202006
Analytical modeling of robotic tape libraries using stochastic automata
T Dayar, OI Pentakalos, AB Stephens
Technical Repport TR-97-198, CESDIS, NASA/GSFC, 1997
201997
The system can't perform the operation now. Try again later.
Articles 1–20