Package jline.api.mc
Class Ctmc_solve_reducible_blkdecomp
java.lang.Object
jline.api.mc.Ctmc_solve_reducible_blkdecomp
Solve reducible CTMCs via direct block decomposition on the generator matrix.
Algorithm (based on SMART's computeInfinityDistribution):
1. Decompose states into transient and recurrent classes via SCC detection
2. For transient states: solve n * Q_tt = -p0_t for expected sojourn
3. Compute hitting probabilities: h = n * Q_ta + p0_r
4. For each recurrent class: solve pi_c * Q_cc = 0, scale by hitting prob
-
Method Summary
Modifier and TypeMethodDescription
-
Method Details
-
ctmc_solve_reducible_blkdecomp
-
ctmc_solve_reducible_blkdecomp
-
ctmc_solve_reducible_blkdecomp
-
ctmc_solve_reducible_blkdecomp_full
-
ctmc_solve_reducible_blkdecomp_full
public static Ctmc_solve_reducible_blkdecompResult ctmc_solve_reducible_blkdecomp_full(Matrix Q, Matrix pi0) -
ctmc_solve_reducible_blkdecomp_full
-