Tuǧrul Dayar

Tuǧrul Dayar

Auto-generated profile, based on publicly available information

Tuǧrul Dayar

Bilkent University

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2000 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
TDTuugrul Dayar
Tuugrul Dayar
WSWilliam J. Stewart
William J. Stewart
Experimental results for large, sparse Markov chains, especially the ill-conditioned nearly completely decomposable (NCD) ones, are few. We believe there is need for further research in this area, specifically to aid in the understanding of the effects of the degree of coupling of NCD Markov chains and their nonzero structure on the convergence characteristics and space requirements of iterative solvers. The work of several researchers has raised the following questions that led to research in a related direction: How must one go about partitioning the global coefficient matrix into blocks when the system is NCD and a two-level iterative solver (such as block SOR) is to be employed? Are block partitionings dictated by the NCD form of the stochastic one-step transition probability matrix necessarily superior to others? Is it worth investigating alternative partitionings? Better yet, for a fixed labeling and partitioning of the states, how does the performance of block SOR (or even that of point SOR) compare to the performance of the iterative aggregation-disaggregation (IAD) algorithm? Finally, is there any merit in using two-level iterative solvers when preconditioned Krylov subspace methods are available? We seek answers to these questions on a test suite of 13 Markov chains arising in 7 applications.

1 December 2011 in Advances in Applied Probability
Verified
Journal Article
Closed access
PDF file
TDTuğrul Dayar
Tuğrul Dayar
WSWerner Sandmann
Werner Sandmann
DSDavid Spieler
David Spieler
VWVerena Wolf
Verena Wolf
Systems of stochastic chemical kinetics are modeled as infinite level-dependent quasi-birth-and-death (LDQBD) processes. For these systems, in contrast to many other applications, levels have an increasing number of states as the level number increases and the probability mass may reside arbitrarily far away from lower levels. Ideas from Lyapunov theory are combined with existing matrix-analytic formulations to obtain accurate approximations to the stationary probability distribution when the infinite LDQBD process is ergodic. Results of numerical experiments on a set of problems are provided.

18 October 2011 in Numerical Linear Algebra with Applications
Verified
Journal Article
Closed access
PDF file
TDTuǧrul Dayar
Tuǧrul Dayar
HHHolger Hermanns
Holger Hermanns
DSDavid Spieler
David Spieler
VWVerena Wolf
Verena Wolf

1 October 1998 in European Journal of Operational Research
Verified
Journal Article
Closed access
EUErtuǧrul Uysal
Ertuǧrul Uysal
TDTuǧrul Dayar
Tuǧrul Dayar

1 April 1997 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
TDTugrul Dayar
Tugrul Dayar
WSWilliam J. Stewart
William J. Stewart
In this paper, it is shown that nearly completely decomposable (NCD) Markov chains are quasi-lumpable. The state space partition is the natural one, and the technique may be used to compute lower and upper bounds on the stationary probability of each NCD block. In doing so, a lower-bounding nonnegative coupling matrix is employed. The nature of the stationary probability bounds is closely related to the structure of this lower-bounding matrix. Irreducible lower-bounding matrices give tighter bounds compared with bounds obtained using reducible lower-bounding matrices. It is also noticed that the quasi-lumped chain of an NCD Markov chain is an ill-conditioned matrix and the bounds obtained generally will not be tight. However, under some circumstances, it is possible to compute the stationary probabilities of some NCD blocks exactly.

26 July 2004 in Computing
Verified
Journal Article
Closed access
PDF file
PBPeter Buchholz
Peter Buchholz
TDT. Dayar
T. Dayar