Package jline.api.mam
Class QbdRapResult
java.lang.Object
jline.api.mam.QbdRapResult
Return set of
Qbd_rap.qbd_rap(jline.util.matrix.Matrix, jline.util.matrix.Matrix, jline.util.matrix.Matrix, jline.util.matrix.Matrix, jline.util.matrix.Matrix, int). The fields mirror the MATLAB return
list of qbd_rap.m and the Python QbdRapResult dataclass.-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionbooleangetG()Matrix G solving A0*G^2 + A1*G + A2 = 0.Row vector of marginal level probabilities, levels 0 to numLevels.getPi0()Level-0 vector pi_0, the boundary vector of Theorem 7.(numLevels+1) x m matrix whose n-th row is the level vector pi_n.doublegetQN()Mean queue length, computed exactly as pi0*R*inv(I-R)^2*e.getR()Rate matrix R = A0*inv(-U).doublegetSpr()Spectral radius Sp(R); the process is positive recurrent iff Sp(R) < 1.getU()Matrix U = A1 + A0*G.inthashCode()toString()
-
Constructor Details
-
QbdRapResult
-
-
Method Details
-
getLevelProb
Row vector of marginal level probabilities, levels 0 to numLevels. -
getQN
public double getQN()Mean queue length, computed exactly as pi0*R*inv(I-R)^2*e. -
getR
Rate matrix R = A0*inv(-U). -
getG
Matrix G solving A0*G^2 + A1*G + A2 = 0. -
getU
Matrix U = A1 + A0*G. -
getSpr
public double getSpr()Spectral radius Sp(R); the process is positive recurrent iff Sp(R) < 1. -
getPqueue
(numLevels+1) x m matrix whose n-th row is the level vector pi_n. -
getPi0
Level-0 vector pi_0, the boundary vector of Theorem 7. -
equals
-
hashCode
public int hashCode() -
toString
-