.png){kind=icon}
.png){kind=icon}
Return
Multigrid algorithm from cyclic reduction for Markovian queueing networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2011.01.108.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A multigrid method based on cyclic reduction strategy is proposed to solve huge, nonsymmetric singular linear systems arising from Markovian queueing networks. A simple way to construct the matrix-dependent prolongation and restriction operators is presented in this paper. Numerical results for multiple queues are given to illustrate the efficiency and robustness of our methods. (C) 2011 Elsevier Inc. All rights reserved.
Keywords:
Multigrid method
Cyclic reduction
Markovian queueing network
Nonsymmetric linear system
Boundary value method
Singular systems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
View more organizations