Hypergraph-based parallel computation of passage time densities in large semi-Markov models

DOI10.1016/j.laa.2003.12.018zbMath1048.65006OpenAlexW2025754355WikidataQ61842137 ScholiaQ61842137MaRDI QIDQ1434432

Nicholas J. Dingle, Helen J. Wilson, William J. Knottenbelt, Jeremy T. Bradley

Publication date: 4 August 2004

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10044/1/5838

zbMATH Keywords

ConvergenceParallel computationIterative algorithmNumerical examplesHypergraph partitioningPassage time densitiesSemi-Markov chains

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Parallel numerical computation (65Y05)

Related Items (2)

Parallel multilevel algorithms for hypergraph partitioning ⋮ NP-hard and linear variants of hypergraph partitioning

Uses Software

• MPI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Fourier-series method for inverting transforms of probability distributions
• Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
• On the Laguerre Method for Numerically Inverting Laplace Transforms
• A probabilistic dynamic technique for the distributed generation of very large state spaces
• Numerical Inversion of Laplace Transforms of Probability Distributions
• Markov Renewal Processes: Definitions and Preliminary Properties

This page was built for publication: Hypergraph-based parallel computation of passage time densities in large semi-Markov models