STOCHASTIC COMPLEMENTATION, UNCOUPLING MARKOV-CHAINS, AND THE THEORY OF NEARLY REDUCIBLE SYSTEMS

被引：184

作者：

MEYER, CD ^{[1
]}

机构：

[1] N CAROLINA STATE UNIV,CTR RES SCI COMPUTAT,RALEIGH,NC 27695

来源：

关键词：

D O I：

10.1137/1031050

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：240 / 272

页数：33

共 22 条

[1]

Balsamo S., 1988, Computer Performance and Reliability. Proceedings of the Second International MCPR Workshop, P73

[2]

Berman A., 1994, CLASSICS APPL MATH, DOI DOI 10.1137/1.9781611971262

[3]

Courtois P.-J., 1986, Teletraffic Analysis and Computer Performance Evaluation. Proceedings of the International Seminar, P499

[4] BLOCK ITERATIVE ALGORITHMS FOR STOCHASTIC MATRICES [J].

COURTOIS, PJ ;

SEMAL, P .

[5]

COURTOIS PJ, 1985, ANAL LARGE MARKOVIAN, P1

[6]

COURTOIS PJ, 1977, DECOMPOSABILITY

[7]

GANTMACHER FR, 1960, MATRIX THEORY, V2

GRASSMANN, WK ;

TAKSAR, MI ;

HEYMAN, DP .

HAVIV, M ;

VANDERHEYDEN, L .

[10]

HAVIV M, 1987, SIAM J NUMER ANAL, V22, P952