Fast algorithms for a linear system with infinitesimal generator structure of a Markovian queueing model
In this paper, we focused on solving the perturbed four-banded linear system derived from the traffic process associated with a Markovian queueing model. Utilizing the spectral decomposition of circulant and skew circulant matrices, we computed the product of Toeplitz inversion and a vector, leading...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2025-03-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2025299 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we focused on solving the perturbed four-banded linear system derived from the traffic process associated with a Markovian queueing model. Utilizing the spectral decomposition of circulant and skew circulant matrices, we computed the product of Toeplitz inversion and a vector, leading to a decomposition algorithm for perturbed four-banded linear systems. This decomposed Toeplitz system features multiple right-hand terms, significantly reducing computational complexity through Toeplitz inversion. Additionally, we introduced an algorithm based on banded LU decomposition, resulting in a banded linear system with multiple right-hand terms, where the sparsity of the banded LU decomposition is pivotal. To evaluate the algorithm's performance, we presented two examples in numerical simulations. |
|---|---|
| ISSN: | 2473-6988 |