Titlebook: Linear Algebra, Markov Chains, and Queueing Models; Carl D. Meyer,Robert J. Plemmons Conference proceedings 1993 Springer-Verlag New York,

Migratory

Analysis of ,-Cyclic Iterations for Markov Chainsshow how to repartition for optimal convergence. Recent results by Kontovasilis, Plemmons and Stewart on the new concept of convergence of SOR in an . sense are further analyzed and applied to the solution of periodic Markov chains.

膽小鬼

itinerary

0940-6573 shop which was an integral part of the 1991-92 IMA program on "Applied Linear Algebra". We thank Carl Meyer and R.J. Plemmons for editing the proceedings. We also take this opportunity to thank the National Science Founda- tion, whose financial support made the workshop possible. A vner Friedman Wil

心神不寧

Parabola

TERRA

Iterative Methods for Queueing Networks with Irregular State-Spacesom domain decomposition for elliptic problems on irregular domains, we derive three different kinds of such separable preconditioners. Numerical results show that for these preconditioners, the numbers of iterations required for convergence increase very slowly with increasing queue size.

自負的人

Iterative Methods for Finding the Stationary Vector for Markov Chainsand we give special emphasis to three ideas for exploiting this structure: decomposability, separability, and multilevel aggregation. Such ideas result in a large number of diverse algorithms, many of which are poorly understood.

預(yù)知

緯線

CRAY-2 Memory Organization and Interprocessor Memory Contentionehavior of throughput, time delay, and efficiency as functions of hardware parameters. The results suggest criteria for evaluating hardware designs and an index of quality for comparing different designs.

的事物