Package jline.api.pfqn.nc

Class Pfqn_rgf

java.lang.Object

jline.api.pfqn.nc.Pfqn_rgf

public final class Pfqn_rgf
extends Object

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static final class	Pfqn_rgf.Result	Result of the RGF recursion: the whole log-normalizing-constant sequence.

Method Summary

Modifier and Type	Method	Description
static Pfqn_rgf.Result	pfqn_rgf(Matrix L, double N, double Z)	Exact normalizing constant by convolution of per-node generating-function sequences.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Details

pfqn_rgf

public static Pfqn_rgf.Result pfqn_rgf(Matrix L,
 double N,
 double Z)

Exact normalizing constant by convolution of per-node generating-function sequences.

A GROUP of m stations sharing the same demand p collapses into the single negative-binomial sequence r(k) = C(k+m-1,k) p^k, so the whole group costs one sequence rather than m convolution passes; the delay contributes the Poisson sequence Z^k/k!. Cost O(G N^2) against Buzen's O(M N), so RGF is the cheaper route on heavily replicated models with moderate populations (G N < M). The recursion runs entirely in the log domain, so no intermediate overflow or underflow is possible.

Parameters:

L - service demand vector (M x 1) of the queueing stations

N - population (nonnegative integer)

Z - think time

Returns:

the normalizing constant, its logarithm, and the full log g(0..N) sequence