Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Detecting Block GI/M/1 and Block M/G/1 Matrices from Model Specifications Read chapter Read first chapter

1995 | OriginalPaper | Chapter

Aggregation/Disaggregation Method on Parallel Computer

Authors : Yukio Takahashi, Kou Fujimoto

Published in: Computations with Markov Chains

Publisher: Springer US

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

The aggregation/disaggregation method (the A/D method) is an iterative method for calculating the stationary probabilities of large scale Markov chains numerically. It consists of two phases; the aggregation phase and the disaggregation phase. In the disaggregation phase, a number of linear equations have to be solved. Since these calculations can be done in parallel, the A/D method is a suitable numerical method for parallel computers.

previous chapter State Space Decomposition for Large Markov Chains
next chapter Parallel Implementation of the GTH Algorithm for Markov Chains
Metadata
Title
Aggregation/Disaggregation Method on Parallel Computer
Authors
Yukio Takahashi
Kou Fujimoto
Copyright Year
1995
Publisher
Springer US
Book
Computations with Markov Chains

Print ISBN: 978-1-4613-5943-2

Electronic ISBN: 978-1-4615-2241-6

Copyright Year: 1995

DOI
https://doi.org/10.1007/978-1-4615-2241-6_34

Premium Partner

    Image Credits