On numerical solution of the Markov renewal equation: Tight upper and lower kernel bounds (Q5959764): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:49, 4 March 2024
scientific article; zbMATH DE number 1726747
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On numerical solution of the Markov renewal equation: Tight upper and lower kernel bounds |
scientific article; zbMATH DE number 1726747 |
Statements
On numerical solution of the Markov renewal equation: Tight upper and lower kernel bounds (English)
0 references
11 April 2002
0 references
Some tight bounds and a fast parallel algorithm to compute the Markov renewal kernel are developed. Computational error and numerical stability for computing the bounds in parallel are discussed using known results in numerical analysis. Applying the results, the expected number of departures relative to a certain queueing network is studied.
0 references
Markov renewal process
0 references
Markov renewal equation
0 references
convolution integral equation
0 references
Toeplitz matrix
0 references
