NDLI: A compressed cyclic reduction for QBDs with low rank upper and lower transitions

Content Provider	ACM Digital Library
Author	Meini, Beatrice Bini, Dario A. Favati, Paola
Abstract	Consider a quasi-birth-and-death (QBD) Markov chain [6], having probability transition matrix where Bi, Ai, i = ?1, 0, 1, are m x m matrices. In the numerical solution of QBD Markov chains a crucial step is the efficient computation of the minimal nonnegative solution R of the quadratic matrix equation X = $X_{2}A?1$ + $XA_{0}$ + $A_{1}.$ (1) To this purpose, many numerical methods, with different properties, have been designed in the last years (see for instance [1, 2, 3, 4]). However, many of these numericalmethods are defined for general block coefficients A?1, A0 and A1, and do not exploit the possible structure of these blocks. Recently, some attention has been addressed to the case where $A_{?1}$ has only few non-null columns, or A1 has only few non-null rows. These properties are satisfied when the QBD has restricted transitions to higher (or lower) levels. In particular, in [7] the authors exploit these properties of the matrix $A_{?1},$ or $A_{1},$ to formulate the QBD in terms of an M/G/1 type Markov chain, where the block matrices have size smaller than m; in particular, when both A?1 and A1 have the desired property, the latter M/G/1 type Markov chain reduces to a QBD. In [5] the structure of $A_{?1}$ is used in order to reduce the computational cost of some algorithms for computing R. Here we assume that both the matrices $A_{?1}$ and $A_{1}$ have small rank with respect to their size m. In particular, if A?1 and A1 have only few non-null columns and rows, respectively, they have small rank. We show that, under this assumption, the matrix R can be computed by using the cyclic reduction algorithm, where the matrices A(k) i , i = ?1, 0, 1, generated at the kth step of the algorithm, can be represented by small rank matrices. In particular, if $r_{?1}$ is the rank of $A_{?1},$ and if $r_{1}$ is the rank of $A_{1},$ then each step of cyclic reduction can be performed by means of $O((r_{?1+r1})_{3})$ arithmetic operations. This cost estimate must be compared with the cost of O(m3) arithmetic operations, needed without exploiting the structure of $A_{?1}$ and $A_{1}.$ Therefore, if $r_{1}$ and $r_{1}/are$ much smaller than m, the advantage is evident. It remains an open issue to understand how the structure can be exploited in the case where only one between $A_{?1}$ and $A_{1}$ has low rank.
Starting Page	33
Ending Page	33
Page Count	1
File Format	PDF
ISSN	01635999
DOI	10.1145/2185395.2185424
Journal	ACM SIGMETRICS Performance Evaluation Review (PERV)
Volume Number	39
Issue Number	4
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-01-10
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Hardware and Architecture Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Characterising program behaviour with phases and transitions

A reservation based cyclic server queue with limited service

Mean-field approximations for performance models with generally-timed transitions

Efficient crowdsourcing for multi-class labeling

Waiting-time approximations for cyclic-service systems with switch-over times

Trace reduction for virtual memory simulations

A structural low rank regularization method for single image super-resolution

On management of free space in compressed memory systems

Efficient cyclic reduction for QBDs with rank structured blocks

A compressed cyclic reduction for QBDs with low rank upper and lower transitions

Similar Documents

Characterising program behaviour with phases and transitions

A reservation based cyclic server queue with limited service

Mean-field approximations for performance models with generally-timed transitions

Efficient crowdsourcing for multi-class labeling

Waiting-time approximations for cyclic-service systems with switch-over times

Trace reduction for virtual memory simulations

A structural low rank regularization method for single image super-resolution

On management of free space in compressed memory systems

Efficient cyclic reduction for QBDs with rank structured blocks

A compressed cyclic reduction for QBDs with low rank upper and lower transitions