Skip to main content

Aggregation/Disaggregation Method on Parallel Computer

  • Conference paper
Computations with Markov Chains
  • 508 Accesses

Extended Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer Science+Business Media New York

About this paper

Cite this paper

Takahashi, Y., Fujimoto, K. (1995). Aggregation/Disaggregation Method on Parallel Computer. In: Stewart, W.J. (eds) Computations with Markov Chains. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2241-6_34

Download citation

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

  • Publisher Name: Springer, Boston, MA

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

  • Online ISBN: 978-1-4615-2241-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics