The Erlangian approximation of Markovian fluid queues leads to the problem of computing the matrix exponential of a subgenerator having a block-triangular, block-Toeplitz structure. To this end, we propose some algorithms which exploit the Toeplitz structure and the properties of generators. Such algorithms allow us to compute the exponential of very large matrices, which would otherwise be untreatable with standard methods. We also prove interesting decay properties of the exponential of a generator having a block-triangular, block-Toeplitz structure
We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar ...
We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar ...
Multi-dimensional level-dependent Markov chains with the upper block-Hessenberg structure of the gen...
The Erlangian approximation of Markovian fluid queues leads to the problem of computing the matrix e...
By using the concept of generating function associated with a Toeplitz matrix, we analyze existence ...
The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and fo...
In this thesis, we study methods for computing the invariant probability measure for certain quasi-b...
It was recently observed that the singular values of the off-diagonal blocks of the matrix sequences...
Queues of M/G/1 type give rise to infinite embedded Markov chains whose transition matrices are uppe...
Krylov subspace techniques have been shown to yield robust methods for the numerical computation of ...
AbstractThe concept of displacement rank is used to devise an algorithm for the inversion of an n × ...
The concept of displacement rank is used to devise an algorithm for the inversion of an n x n block ...
Krylov subspace techniques have been shown to yield robust methods for the numerical computation of ...
We provide effective algorithms for solving block tridiagonal block Toeplitz systems with . m×m quas...
In this paper, we study Markov fluid queues where the net fluid rate to a single-buffer system varie...
We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar ...
We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar ...
Multi-dimensional level-dependent Markov chains with the upper block-Hessenberg structure of the gen...
The Erlangian approximation of Markovian fluid queues leads to the problem of computing the matrix e...
By using the concept of generating function associated with a Toeplitz matrix, we analyze existence ...
The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and fo...
In this thesis, we study methods for computing the invariant probability measure for certain quasi-b...
It was recently observed that the singular values of the off-diagonal blocks of the matrix sequences...
Queues of M/G/1 type give rise to infinite embedded Markov chains whose transition matrices are uppe...
Krylov subspace techniques have been shown to yield robust methods for the numerical computation of ...
AbstractThe concept of displacement rank is used to devise an algorithm for the inversion of an n × ...
The concept of displacement rank is used to devise an algorithm for the inversion of an n x n block ...
Krylov subspace techniques have been shown to yield robust methods for the numerical computation of ...
We provide effective algorithms for solving block tridiagonal block Toeplitz systems with . m×m quas...
In this paper, we study Markov fluid queues where the net fluid rate to a single-buffer system varie...
We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar ...
We study the problem of computing the matrix exponential of a block triangular matrix in a peculiar ...
Multi-dimensional level-dependent Markov chains with the upper block-Hessenberg structure of the gen...