Uses of Class
jline.util.matrix.Matrix
Packages that use Matrix
Package
Description
Age of Information (AoI) analysis algorithms.
Cache modeling algorithms and performance analysis methods.
APIs for stochastic models of loss networks and blocking systems.
Layered Stochastic Network (LSN) algorithms.
Matrix Analytic Methods (MAM) for structured Markov chains.
Marked Markov-Modulated Poisson Process (M3PP) manipulation and fitting.
MAP queueing network analysis algorithms.
Markov Chain analysis algorithms.
Statistical measures and distance metrics.
Non-Product Form Queueing Network algorithms.
Product-Form Queueing Network (PFQN) analysis algorithms.
Load-dependent Product Form Queueing Network algorithms.
Mean Value Analysis algorithms for Product Form Queueing Networks.
Normalizing constant algorithms for Product Form Queueing Networks.
Queueing system analysis algorithms.
Stochastic network analysis utilities.
Trace analysis algorithms for empirical data.
Workflow analysis algorithms.
Benchmarking utilities and performance test models for LINE solvers.
Comprehensive examples and tutorials for LINE queueing network modeling.
Input/output from the command line or XML files.
TikZ visualization package for LINE queueing networks.
Abstractions to declare basic elements of a model.
This package contains the classes used the specify LayeredNetwork objects
Node parameter specifications and configuration classes.
This package contains the classes used the specify Network objects
This package contains processes and statistical distributions used to specify arrival rates, service rates, and item popularities
Reward function types and utilities for CTMC analysis.
Classes that model the individual sections that form a Network node
Classes that model the state of a network and its individual nodes
Port of BuTools library for phase-type distributions and MAP processes.
Package containing Discrete Phase-Type (DPH) distribution functions.
Package containing trace fitting utility functions.
Package containing Matrix-Analytic Methods (MAM) solvers.
Package containing Markovian Arrival Process (MAP) functions.
Package containing Markov chain validation and solving functions.
Package containing phase-type distribution functions.
Package containing representation transformation functions.
Package containing trace analysis functions.
Port of the KPC-Toolbox library for Markovian process fitting and manipulation.
Port of M3A library for matrix-based moment matching approximation algorithms.
Port of permanent computation algorithms for matrix permanents.
Port of SMC library for structured Markov chain analysis algorithms.
Solver superclasses and related data structures.
Automatic solver selection and configuration for queueing networks.
This package provides an implementation of SolverCTMC.
Analyzers for SolverCTMC.
Handlers for SolverCTMC.
This package provides an implementation of SolverENV (ENV).
This package provides an implementation of SolverFluid (FLD).
Analyzers for SolverFluid.
Handlers for SolverFluid.
This package provides an implementation of SolverJMT.
LINE Discrete Event Simulator (LDES) solver using SSJ library.
This package provides an implementation of SolverLN.
This package provides an implementation of SolverMAM.
Handlers for SolverMAM.
This package provides an implementation of SolverMVA.
Handlers for SolverMVA.
This package provides an implementation of SolverNC.
This package provides an implementation of SolverQNS.
This package provides an implementation of SolverSSA.
Analyzers for SolverSSA.
Handlers for SolverSSA.
Fundamental data structures and utilities
Graph theory utilities and algorithms for network analysis.
Matrix operations and linear algebra utilities for queueing analysis.
-
Uses of Matrix in jline.api.aoi
Methods in jline.api.aoi that return MatrixModifier and TypeMethodDescriptionAoi_dist2phResult.component1()Aoi_dist2phResult.component2()Aoi_dist2phResult.getAlpha()AoiMfqResult.getAoiA()AoiMfqResult.getAoiG()AoiMfqResult.getAoiH()AoiMfqResult.getPaoiA()AoiMfqResult.getPaoiG()AoiMfqResult.getPaoiH()AoiParams.getS()AoiParams.getSigma()Aoi_dist2phResult.getT()AoiParams.getT()AoiParams.getTau()Methods in jline.api.aoi with parameters of type MatrixModifier and TypeMethodDescriptionstatic LstFunctionAoi_lst.aoi_lst_ph(Matrix alpha, Matrix T) LST for phase-type distribution: H*(s) = alpha * (s*I - T)^{-1} * (-T * e)static AoiMfqResultAoi_solve_bufferless.aoi_solve_bufferless(Matrix tau, Matrix T, Matrix sigma, Matrix S, double p) Solve bufferless (PH/PH/1/1 or PH/PH/1/1*) AoI system using MFQ.static AoiMfqResultAoi_solve_singlebuffer.aoi_solve_singlebuffer(double lambda, Matrix sigma, Matrix S, double r) Constructors in jline.api.aoi with parameters of type MatrixModifierConstructorDescriptionAoi_dist2phResult(Matrix alpha, Matrix T) AoiMfqResult(Matrix aoiG, Matrix aoiA, Matrix aoiH, double aoiMean, double aoiVar, Matrix paoiG, Matrix paoiA, Matrix paoiH, double paoiMean, double paoiVar, String systemType, double preemption) AoiParams(Matrix tau, Matrix T, Matrix sigma, Matrix S, double p, double lambda, double r, String systemType, String arrivalType) -
Uses of Matrix in jline.api.cache
Fields in jline.api.cache declared as MatrixModifier and TypeFieldDescriptionfinal MatrixCacheMissFpiResult.MIfinal MatrixCacheMissFpiResult.MUfinal MatrixCache_miss.CacheMissResult.perItemMissProbfinal MatrixCache_miss.CacheMissResult.perItemMissRatefinal MatrixCache_miss.CacheMissResult.perUserMissRatefinal MatrixCacheMissFpiResult.pi0Methods in jline.api.cache that return MatrixModifier and TypeMethodDescriptionstatic MatrixCache_erec.cache_erec(Matrix gamma, Matrix m) Computes the cache miss rate using an exact recursive method.static MatrixCache_erec.cache_erec_aux(Matrix gamma, Matrix m, int k) Auxiliary method for computing the cache miss rate using an exact recursive method.static MatrixCache_prob_erec.cache_prob_erec(Matrix gamma, Matrix m) Computes the cache state probabilities using an exact recursive method.static MatrixCache_prob_fpi.cache_prob_fpi(Matrix gamma, Matrix m) Estimate asymptotic values of the cache state probabilities at steady-state.static MatrixCache_prob_is.cache_prob_is(Matrix gamma, Matrix m) static MatrixCache_prob_is.cache_prob_is(Matrix gamma, Matrix m, int samples) Computes cache hit probabilities using Monte Carlo importance sampling.static MatrixCache_prob_rayint.cache_prob_rayint(Matrix gamma, Matrix m) Computes the cache state probabilities using the ray method.static MatrixCache_prob_spm.cache_prob_spm(Matrix gamma, Matrix m) Computes the cache state probabilities using the ray method.static MatrixCache_rrm_meanfield_ode.cache_rrm_meanfield_ode(Matrix x, Matrix lambda, Matrix m, int n, int h) ODE system for RRM (Random Replacement Model) mean field equations.static MatrixCache_t_hlru.cache_t_hlru(Matrix gamma, Matrix m) Computes the characteristic time of each list in the TTL approximation of h-LRU.static MatrixCache_t_hlru.cache_t_hlru_aux(double[] x, Matrix gamma, Matrix m, int n, int h) Auxiliary function for cache_t_hlru inner optimization.static MatrixCache_t_lrum.cache_t_lrum(Matrix gamma, Matrix m) Computes the characteristic time of each list in the TTL approximation of LRU(m).static MatrixCache_t_lrum.cache_t_lrum_aux(double[] x, Matrix gamma, Matrix m, int n, int h) Auxiliary function for cache_t_lrum inner optimization.static MatrixCache_t_lrum_map.cache_t_lrum_map(MatrixCell[] D0, MatrixCell[] D1, Matrix m) static MatrixCache_ttl_hlru.cache_ttl_hlru(Matrix[] lambda, Matrix m) Solve hierarchical least-recently-used caches h-LRU using the TTL approximation.static MatrixCache_ttl_lrua.cache_ttl_lrua(Matrix[] lambda, Matrix[][] R, Matrix m) Solve arbitrary replacement policy caches LRU(A) using the TTL tree approximation.static MatrixCache_ttl_lrum.cache_ttl_lrum(Matrix[] gamma, Matrix m) Solve multi-list least-recently-used caches LRU(m) using the TTL approximation.static MatrixCache_ttl_tree.cache_ttl_tree(Matrix[] lambda, Matrix[][] R, Matrix m) static MatrixCache_ttl_tree.cache_ttl_tree(Matrix[] lambda, Matrix[][] R, Matrix m, Long seed) static MatrixCache_xi_bvh.cache_xi_bvh(Matrix gamma, Matrix m) Computes the cache xi terms using the iterative method used in Gast-van Houdt, SIGMETRICS 2015.static MatrixCache_xi_iter.cache_xi_iter(Matrix gamma, Matrix m) Computes the cache xi terms using the iterative method (Gast-van Houdt, SIGMETRICS 2015).CacheMissFpiResult.getMI()CacheMissFpiResult.getMU()CacheMissFpiResult.getPi0()static Matrixstatic MatrixCache_t_lrum_map.lrummapTime(double[] x, MatrixCell[] D0Matrix, MatrixCell[] D1Matrix, Matrix m, int n, int h) Methods in jline.api.cache that return types with arguments of type MatrixModifier and TypeMethodDescriptionCache_mva_miss.cache_mva_miss(Matrix p, Matrix m, Matrix R) Compute cache miss probabilities using Mean Value Analysis approach.Methods in jline.api.cache with parameters of type MatrixModifier and TypeMethodDescriptionstatic MatrixCache_erec.cache_erec(Matrix gamma, Matrix m) Computes the cache miss rate using an exact recursive method.static MatrixCache_erec.cache_erec_aux(Matrix gamma, Matrix m, int k) Auxiliary method for computing the cache miss rate using an exact recursive method.static Ret.cacheGammaCache_gamma_lp.cache_gamma_lp(Matrix[] lambda, Matrix[][] R) Computes access factors for the cache.static Ret.cacheIsstatic Ret.cacheIsEstimate the normalizing constant of the cache steady state distribution using Monte Carlo importance sampling.static Cache_miss.CacheMissResultCache_miss.cache_miss(Matrix gamma, Matrix m) static Cache_miss.CacheMissResultCache_miss.cache_miss(Matrix gamma, Matrix m, Matrix lambda) static doubleCache_miss_asy.cache_miss_asy(Matrix gamma, Matrix m) static doubleCache_miss_asy.cache_miss_asy(Matrix gamma, Matrix m, int maxIter, double tolerance) Compute cache miss rates using asymptotic approximation (Fixed Point Iteration method).static CacheMissFpiResultCache_miss_fpi.cache_miss_fpi(Matrix gamma, Matrix m) static CacheMissFpiResultCache_miss_fpi.cache_miss_fpi(Matrix gamma, Matrix m, MatrixCell lambda) Compute cache miss rates using Fixed Point Iteration (FPI) method.static Ret.cacheMissSpmCache_miss_is.cache_miss_is(Matrix gamma, Matrix m, MatrixCell lambda) static Ret.cacheMissSpmCache_miss_is.cache_miss_is(Matrix gamma, Matrix m, MatrixCell lambda, int samples) Computes cache miss rates using Monte Carlo importance sampling.static Ret.cacheMissSpmCache_miss_rayint.cache_miss_rayint(Matrix gamma, Matrix m, MatrixCell lambda) Estimates the cache miss rate and related metrics using the ray method for PDEs.static Ret.cacheMissSpmCache_miss_spm.cache_miss_spm(Matrix gamma, Matrix m, MatrixCell lambda) static Ret.cacheMVAExact recursive solution of the caching model.Cache_mva_miss.cache_mva_miss(Matrix p, Matrix m, Matrix R) Compute cache miss probabilities using Mean Value Analysis approach.Finds the parent of a given list index.static MatrixCache_prob_erec.cache_prob_erec(Matrix gamma, Matrix m) Computes the cache state probabilities using an exact recursive method.static MatrixCache_prob_fpi.cache_prob_fpi(Matrix gamma, Matrix m) Estimate asymptotic values of the cache state probabilities at steady-state.static MatrixCache_prob_is.cache_prob_is(Matrix gamma, Matrix m) static MatrixCache_prob_is.cache_prob_is(Matrix gamma, Matrix m, int samples) Computes cache hit probabilities using Monte Carlo importance sampling.static MatrixCache_prob_rayint.cache_prob_rayint(Matrix gamma, Matrix m) Computes the cache state probabilities using the ray method.static MatrixCache_prob_spm.cache_prob_spm(Matrix gamma, Matrix m) Computes the cache state probabilities using the ray method.static Ret.cacheSpmCache_rayint.cache_rayint(Matrix gamma, Matrix m) Approximate the normalizing constant of the cache steady state distribution using the ray method.static MatrixCache_rrm_meanfield_ode.cache_rrm_meanfield_ode(Matrix x, Matrix lambda, Matrix m, int n, int h) ODE system for RRM (Random Replacement Model) mean field equations.static Ret.cacheSpmApproximate the normalizing constant of the cache steady state distribution using the SPM method.static MatrixCache_t_hlru.cache_t_hlru(Matrix gamma, Matrix m) Computes the characteristic time of each list in the TTL approximation of h-LRU.static MatrixCache_t_hlru.cache_t_hlru_aux(double[] x, Matrix gamma, Matrix m, int n, int h) Auxiliary function for cache_t_hlru inner optimization.static MatrixCache_t_lrum.cache_t_lrum(Matrix gamma, Matrix m) Computes the characteristic time of each list in the TTL approximation of LRU(m).static MatrixCache_t_lrum.cache_t_lrum_aux(double[] x, Matrix gamma, Matrix m, int n, int h) Auxiliary function for cache_t_lrum inner optimization.static MatrixCache_t_lrum_map.cache_t_lrum_map(MatrixCell[] D0, MatrixCell[] D1, Matrix m) static MatrixCache_ttl_hlru.cache_ttl_hlru(Matrix[] lambda, Matrix m) Solve hierarchical least-recently-used caches h-LRU using the TTL approximation.static MatrixCache_ttl_lrua.cache_ttl_lrua(Matrix[] lambda, Matrix[][] R, Matrix m) Solve arbitrary replacement policy caches LRU(A) using the TTL tree approximation.static MatrixCache_ttl_lrum.cache_ttl_lrum(Matrix[] gamma, Matrix m) Solve multi-list least-recently-used caches LRU(m) using the TTL approximation.static doubleCache_ttl_lrum_map.cache_ttl_lrum_map(MatrixCell[] D0Matrix, MatrixCell[] D1Matrix, Matrix m) static MatrixCache_ttl_tree.cache_ttl_tree(Matrix[] lambda, Matrix[][] R, Matrix m) static MatrixCache_ttl_tree.cache_ttl_tree(Matrix[] lambda, Matrix[][] R, Matrix m, Long seed) static MatrixCache_xi_bvh.cache_xi_bvh(Matrix gamma, Matrix m) Computes the cache xi terms using the iterative method used in Gast-van Houdt, SIGMETRICS 2015.static Ret.cacheXiFpCache_xi_fp.cache_xi_fp(Matrix gamma, Matrix m, Matrix xi) static MatrixCache_xi_iter.cache_xi_iter(Matrix gamma, Matrix m) Computes the cache xi terms using the iterative method (Gast-van Houdt, SIGMETRICS 2015).static Matrixstatic MatrixCache_t_lrum_map.lrummapTime(double[] x, MatrixCell[] D0Matrix, MatrixCell[] D1Matrix, Matrix m, int n, int h) Constructors in jline.api.cache with parameters of type MatrixModifierConstructorDescriptionCacheMissFpiResult(double M, Matrix MU, Matrix MI, Matrix pi0) CacheMissResult(double globalMissRate, Matrix perUserMissRate, Matrix perItemMissRate, Matrix perItemMissProb) -
Uses of Matrix in jline.api.fes
Fields in jline.api.fes declared as MatrixModifier and TypeFieldDescriptionfinal MatrixFESDeaggInfo.cutoffsfinal MatrixFESDeaggInfo.stochCompComplementfinal MatrixFESDeaggInfo.stochCompSubsetFields in jline.api.fes with type parameters of type MatrixMethods in jline.api.fes that return MatrixModifier and TypeMethodDescriptionFESDeaggInfo.getCutoffs()FESOptions.getCutoffs()Per-class population cutoffs (default: null, uses total jobs per class).FESDeaggInfo.getStochCompComplement()FESDeaggInfo.getStochCompSubset()Methods in jline.api.fes that return types with arguments of type MatrixMethods in jline.api.fes with parameters of type MatrixModifier and TypeMethodDescriptionstatic FESOptionsFESOptions.withCutoffs(Matrix cutoffs) Create options with specified cutoffs.Constructors in jline.api.fes with parameters of type MatrixModifierConstructorDescriptionFESDeaggInfo(Network originalModel, List<Station> stationSubset, int[] subsetIndices, int[] complementIndices, List<Matrix> throughputTable, Matrix cutoffs, Matrix stochCompSubset, Matrix stochCompComplement, Network isolatedModel, int fesNodeIdx) FESOptions(String solver, Matrix cutoffs, boolean verbose) -
Uses of Matrix in jline.api.fj
Methods in jline.api.fj with parameters of type MatrixModifier and TypeMethodDescriptionstatic FJArrivalFJConvert.convertToFJArrival(Matrix D0, Matrix D1) Convert LINE MAP to FJ arrival formatstatic FJServiceFJConvert.convertToFJService(Matrix S, Matrix s, Matrix tau) Convert LINE PH to FJ service format -
Uses of Matrix in jline.api.lossn
Methods in jline.api.lossn with parameters of type MatrixModifier and TypeMethodDescriptionstatic Ret.lossnErlangFPLossn_erlangfp.lossn_erlangfp(Matrix nuVec, Matrix Amat, Matrix cVec) Erlang fixed point approximation for loss networks. -
Uses of Matrix in jline.api.lsn
Methods in jline.api.lsn that return MatrixModifier and TypeMethodDescriptionstatic MatrixLsnMaxMultiplicity.lsnMaxMultiplicity(LayeredNetworkStruct lsn) Computes the maximum multiplicity that can be sustained by each task. -
Uses of Matrix in jline.api.mam
Fields in jline.api.mam declared as MatrixModifier and TypeFieldDescriptionfinal MatrixQbd_bmapbmap1.QbdBmapResult.A_1final MatrixQbd_bmapbmap1.QbdBmapResult.A0final MatrixQbd_rg.QbdRgResult.Bfinal MatrixQbd_bmapbmap1.QbdBmapResult.B0final MatrixQbd_rg.QbdRgResult.Ffinal MatrixMamap2m_coefficients.Mamap2mCoefficients.firstfinal MatrixQbd_rg.QbdCrResult.Gfinal MatrixQbd_rg.QbdRgResult.Gfinal MatrixQbd_rg.QbdRgResult.Lfinal MatrixQbd_rg.QbdCrResult.Rfinal MatrixQbd_rg.QbdRgResult.Rfinal MatrixMamap2m_coefficients.Mamap2mCoefficients.secondfinal MatrixMamap2m_coefficients.Mamap2mCoefficients.thirdfinal MatrixQbd_rg.QbdCrResult.Ufinal MatrixQbd_rg.QbdRgResult.UFields in jline.api.mam with type parameters of type MatrixMethods in jline.api.mam that return MatrixModifier and TypeMethodDescriptionQbd_rg.QbdRgResult.component1()LdqbdResult.component2()Qbd_rg.QbdRgResult.component2()Qbd_rg.QbdRgResult.component3()Qbd_rg.QbdRgResult.component4()Qbd_rg.QbdRgResult.component5()Qbd_rg.QbdRgResult.component6()static MatrixDmap_pie.dmap_pie(MatrixCell DMAP) static MatrixComputes the stationary vector at arrival epochs of a discrete-time MAP.QbdMapMap1Result.getA_1()QbdMapMap1Result.getA0()QbdMapMap1Result.getA1()QbdRapRap1Result.getB()QbdMapMap1Result.getEta()QbdRapRap1Result.getEta()QbdRapRap1Result.getF()QbdMapMap1Result.getG()QbdRapRap1Result.getG()QbdRapRap1Result.getL()LdqbdResult.getPi()QbdMapMap1Result.getPqueue()QbdRapRap1Result.getPqueue()QbdMapMap1Result.getR()QbdRapRap1Result.getR()QbdMapMap1Result.getU()static Matrix[]Mamap2m_fit.mamap2m_fit(double M1, double M2, double M3, double GAMMA, double[] P, double[] F, double[] B, Matrix S) static Matrix[]Mamap2m_fit.mamap2m_fit(double M1, double M2, double M3, double GAMMA, double[] P, double[] F, double[] B, Matrix S, double[] fbsWeights) static MatrixMap_acf.map_acf(MatrixCell MAP) static MatrixMap_acf.map_acf(MatrixCell MAP, Matrix lags) static Matrixstatic Matrixstatic MatrixComputes the autocorrelation function (ACF) for a given MAP at multiple lags.static Matrix[]Map_block.map_block(double E1, double E2, double E3, double G2) static Matrix[]Constructs a MAP(2) or MAP(1) according to given moments and autocorrelation parameters.static MatrixMap_cdf.map_cdf(MatrixCell MAP, Matrix points) CDF of MAP inter-arrival times when MAP is a MatrixCell.static MatrixComputes the cumulative distribution function (CDF) of the inter-arrival times of a Markovian Arrival Process (MAP).static MatrixMap_embedded.map_embedded(MatrixCell MAP) Computes the embedded discrete-time Markov chain (DTMC) matrix of a MAP given as a MatrixCell.static MatrixMap_embedded.map_embedded(Matrix D0, Matrix D1) Computes the embedded discrete-time Markov chain (DTMC) matrix of a MAP.static Matrix[]Map_feasblock.map_feasblock(double E1, double E2, double E3, double G2) static Matrix[]Map_feasblock.map_feasblock(double E1, double E2, double E3, double G2, String OPT) Fits the most similar feasible MAP when exact moment matching fails.static MatrixMap_infgen.map_infgen(MatrixCell MAP) Computes the infinitesimal generator matrix (Q) of the Continuous-Time Markov Chain (CTMC) underlying a Markovian Arrival Process (MAP).static MatrixMap_infgen.map_infgen(Matrix D0, Matrix D1) Computes the infinitesimal generator matrix (Q) of the Continuous-Time Markov Chain (CTMC) underlying a Markovian Arrival Process (MAP).static Matrix[]Convenience function for composing a list of MAPs.static Matrix[]Convenience function for composing exactly two MAPs.static MatrixMap_pie.map_pie(MatrixCell MAP) Computes the steady-state probability vector of the embedded DTMC of a MAP stored in a MatrixCell that contains the MAP's transition matrices.static MatrixComputes the steady-state probability vector of the embedded Discrete Time Markov Chain (DTMC) associated with a Markovian Arrival Process (MAP).static MatrixMap_piq.map_piq(MatrixCell MAP) Computes the steady-state vector (pi) of the Continuous-Time Markov Chain (CTMC) underlying a Markovian Arrival Process (MAP).static MatrixComputes the steady-state vector (pi) of the Continuous-Time Markov Chain (CTMC) underlying a Markovian Arrival Process (MAP).static MatrixMap_pntiter.map_pntiter(Matrix[] MAP, int na, double t) static MatrixMap_pntiter.map_pntiter(Matrix[] MAP, int na, double t, Integer M) Probability of having exactly na arrivals within time interval t using iterative method.static MatrixMap_prob.map_prob(MatrixCell MAP) Computes the equilibrium distribution of the underlying continuous-time Markov chain for a MAP.static MatrixComputes the equilibrium distribution of the underlying continuous-time Markov chain for a MAP.static MatrixMap_varcount.map_varcount(MatrixCell MAP, Matrix t) static MatrixMap_varcount.map_varcount(Matrix D0, Matrix D1, Matrix t) Variance of the counts in a MAP over multiple time periods.static MatrixMe_pie.me_pie(MatrixCell ME) Computes the stationary initial probability for an ME/RAP distribution using matrices stored in a MatrixCell.static MatrixComputes the stationary initial probability for an ME/RAP distribution.static MatrixMmap_backward_moment.mmap_backward_moment(MatrixCell MMAP, Matrix ORDERS) static MatrixMmap_backward_moment.mmap_backward_moment(MatrixCell MMAP, Matrix ORDERS, int NORM) Computes the backward moments of an MMAP for specified orders with normalization.static Matrix[]Mmap_compress.mmap_compress(Matrix[] mmap) static Matrix[]Mmap_compress.mmap_compress(Matrix[] mmap, String method) static MatrixMmap_count_idc.mmap_count_idc(MatrixCell MMAP, double t) Computes the index of dispersion for counts (IDC) for a Markovian Arrival Process with marked arrivals (MMAP) over a time period.static MatrixMmap_count_lambda.mmap_count_lambda(MatrixCell mmap) Computes the arrival rate vector of the counting process for the given Marked MAP (MMAP).static MatrixMmap_count_mcov.mmap_count_mcov(Matrix[] mmap, double t) Array-based overload.static MatrixMmap_count_mcov.mmap_count_mcov(MatrixCell MMAP, double t) Computes the count covariance between each pair of classes at a given time scale.static MatrixMmap_count_mean.mmap_count_mean(MatrixCell MMAP, double t) Computes the mean count vector of events of different types in a Markovian Arrival Process with marked arrivals (MMAP) over a time period.static MatrixMmap_count_var.mmap_count_var(MatrixCell MMAP, double t) Computes the variance of the count vector of events of different types in a MMAP over a time period.static MatrixMmap_cross_moment.mmap_cross_moment(MatrixCell mmap, int k) Computes the k-th cross-moment matrix for a given MMAP.static MatrixMmap_embedded.mmap_embedded(MatrixCell mmap) Computes the embedded chain of an MMAP.static MatrixMmap_forward_moment.mmap_forward_moment(MatrixCell MMAP, Matrix ORDERS) static MatrixMmap_forward_moment.mmap_forward_moment(MatrixCell MMAP, Matrix ORDERS, int NORM) Computes the forward moments of an MMAP for specified orders with normalization.static MatrixMmap_idc.mmap_idc(MatrixCell MMAP) Computes the asymptotic index of dispersion for counts (IDC) for a Markovian Arrival Process with marked arrivals (MMAP).static MatrixMmap_lambda.mmap_lambda(MatrixCell MMAP) Alias for mmap_count_lambda.static MatrixMmap_pc.mmap_pc(MatrixCell MMAP) Computes the proportion of counts (PC) for each type in a Markovian Arrival Process with marked arrivals (MMAP).static Matrixstatic MatrixMmap_pie.mmap_pie(MatrixCell mmap) static MatrixMmap_sigma.mmap_sigma(Matrix[] mmap) Computes one-step class transition probabilities for an MMAP given as Matrix[].static MatrixMmap_sigma.mmap_sigma(MatrixCell MMAP) Computes one-step class transition probabilities for a Marked Markovian Arrival Process (MMAP).static Matrix[]Mmpp2_fit_count.mmpp2_fit_count(double mu, double bt1, double bt2, double binf, double m3t2, double t1, double t2) static Matrix[]Mmpp2_fit_count_approx.mmpp2_fit_count_approx(double a, double bt1, double bt2, double binf, double m3t2, double t1, double t2) static Matrix[]Mmpp2_fitc.mmpp2_fitc(double mu, double bt1, double bt2, double binf, double m3t2, double t1, double t2) Fits a MMPP(2) according to [Heffes and Lucantoni, 1986].static Matrix[]Mmpp2_fitc_approx.mmpp2_fitc_approx(double a, double bt1, double bt2, double binf, double m3t2, double t1, double t2) Fits a second-order Marked MMPP using optimization.static Matrixstatic MatrixCompute R matrix using successive substitutions method for QBD processes.static MatrixQbd_R_logred.qbd_R_logred(Matrix B, Matrix L, Matrix F) static MatrixQbd_R_logred.qbd_R_logred(Matrix B, Matrix L, Matrix F, int iterMax) Compute R matrix using logarithmic reduction method for QBD processes.static MatrixRandp.randp(double[] P, int rows) static MatrixRandp.randp(double[] P, int rows, int cols) Pick random values with relative probability.static Matrixstatic MatrixMethods in jline.api.mam that return types with arguments of type MatrixModifier and TypeMethodDescriptionAph_bernstein.aph_bernstein(DoubleUnaryOperator f, int order) Fits an Acyclic Phase-type distribution using Bernstein's approximation.Aph_bernstein.aph_bernstein(DoubleUnaryOperator f, int order) Fits an Acyclic Phase-type distribution using Bernstein's approximation.Aph_convseq.aph_convseq(List<Pair<Matrix, Matrix>> aphParams) Performs sequential convolution of multiple APH distributions.Aph_convseq.aph_convseq(List<Pair<Matrix, Matrix>> aphParams) Performs sequential convolution of multiple APH distributions.Aph_simplify.aph_simplify(Matrix a1, Matrix T1, Matrix a2, Matrix T2, double p1, double p2, int pattern) Simplifies and combines two APH distributions using different structural patterns.Aph_simplify.aph_simplify(Matrix a1, Matrix T1, Matrix a2, Matrix T2, double p1, double p2, int pattern) Simplifies and combines two APH distributions using different structural patterns.LdqbdResult.component1()LdqbdResult.getR()Map_pntquad.map_pntquad(Matrix[] MAP, int na, double t) Compute MAP point process probabilities using ODE quadrature method.Map_pntquad.map_pntquad(Matrix[] MAP, int na, double t) Compute MAP point process probabilities using ODE quadrature method.Convert a MAP to MMPP format by extracting generator matrix Q and rate matrix LAMBDA.Convert a MAP to MMPP format by extracting generator matrix Q and rate matrix LAMBDA.static kotlin.Triple<Matrix, Matrix, MatrixCell> Map2ph.map2ph(MatrixCell MAP) Converts a MAP to a Phase-Type (PH) distribution.static kotlin.Triple<Matrix, Matrix, MatrixCell> Map2ph.map2ph(MatrixCell MAP) Converts a MAP to a Phase-Type (PH) distribution.static kotlin.Pair<MatrixCell, Matrix> Maph2m_fit.maph2m_fit_multiclass(MatrixCell aph, Matrix P, Matrix B) Fits MAPH(2,m) for multiple classes given underlying APH(2), class probabilities, and backward moments.Methods in jline.api.mam with parameters of type MatrixModifier and TypeMethodDescriptionAph_simplify.aph_simplify(Matrix a1, Matrix T1, Matrix a2, Matrix T2, double p1, double p2, int pattern) Simplifies and combines two APH distributions using different structural patterns.static BmapSample[]Map_sample.bmap_sample(Matrix D0, Matrix D1_total, Matrix[] Dk, long n, Random random) Generates samples from a BMAP using D0, D1_total, and individual Dk matrices.static doubleComputes the squared L2 distance between lag-L joint PMFs of two D-MAPs.static doublestatic doubleDmap_dist.dmap_dist_acf(Matrix D0A, Matrix D1A, Matrix D0B, Matrix D1B) Computes the squared L2 distance between autocorrelation functions of two D-MAPs.static doublestatic doubleDmap_dist.dmap_geo_mul_sum(Matrix D0A, Matrix D1A, Matrix D0B, Matrix D1B, int L, Matrix alA, Matrix alB) Computes the joint PMF inner product of two D-MAPs via recursive discrete Lyapunov equations.static doubleDmap_dist.dmap_geo_mul_sum_acf(Matrix D0A, Matrix D1A, Matrix D0B, Matrix D1B, Matrix alA, Matrix alB) Computes the geometric sum for the discrete autocorrelation distance of two D-MAPs.static doubleDmap_moment.dmap_moment(Matrix D0, Matrix D1, int order) Computes the k-th raw moment of the inter-arrival time of a discrete MAP.static MatrixComputes the stationary vector at arrival epochs of a discrete-time MAP.static double[]Dmap_sample.dmap_sample(Matrix D0, Matrix D1, int n, Random random) Generates samples of inter-arrival times from a discrete-time MAP.static MatrixCellMamap22_fit_multiclass.mamap22_fit_bs_multiclass(MatrixCell amap, Matrix P, Matrix B, Matrix S) static MatrixCellMamap22_fit_multiclass.mamap22_fit_bs_multiclass(MatrixCell amap, Matrix P, Matrix B, Matrix S, Object options, double[] weights) static MatrixCellMamap22_fit_multiclass.mamap22_fit_fs_multiclass(MatrixCell amap, Matrix P, Matrix F, Matrix S) static MatrixCellMamap22_fit_multiclass.mamap22_fit_fs_multiclass(MatrixCell amap, Matrix P, Matrix F, Matrix S, Object options, double[] weights) static MatrixCellMamap22_fit_multiclass.mamap22_fit_gamma_bs(double M1, double M2, double M3, double GAMMA, Matrix P, Matrix B, Matrix S) static MatrixCellMamap22_fit_multiclass.mamap22_fit_gamma_bs_trace(Matrix T, Matrix A) static MatrixCellMamap22_fit_multiclass.mamap22_fit_gamma_fs(double M1, double M2, double M3, double GAMMA, Matrix P, Matrix F, Matrix S) static MatrixCellMamap22_fit_multiclass.mamap22_fit_gamma_fs_trace(Matrix T, Matrix A) static Matrix[]Mamap2m_fit.mamap2m_fit(double M1, double M2, double M3, double GAMMA, double[] P, double[] F, double[] B, Matrix S) static Matrix[]Mamap2m_fit.mamap2m_fit(double M1, double M2, double M3, double GAMMA, double[] P, double[] F, double[] B, Matrix S, double[] fbsWeights) static MatrixCellMamap2m_fit_gamma_fb_trace.mamap2m_fit_gamma_fb_trace(Matrix T, Matrix A) Performs approximate fitting of a marked trace from Matrix inputs.static MatrixMap_acf.map_acf(MatrixCell MAP, Matrix lags) static Matrixstatic Matrixstatic MatrixComputes the autocorrelation function (ACF) for a given MAP at multiple lags.static double[]Computes the autocorrelation function coefficients (ACFC) for a MAP counting process.static doubleMap_ccdf_derivative.map_ccdf_derivative(Matrix D0, Matrix D1, int i) Compute derivative at 0 of a MAP complementary CDF.static MatrixMap_cdf.map_cdf(MatrixCell MAP, Matrix points) CDF of MAP inter-arrival times when MAP is a MatrixCell.static MatrixComputes the cumulative distribution function (CDF) of the inter-arrival times of a Markovian Arrival Process (MAP).static booleanMap_checkfeasible.map_checkfeasible(Matrix D0, Matrix D1) static booleanMap_checkfeasible.map_checkfeasible(Matrix D0, Matrix D1, double TOL) Check the feasibility of a MAP given separate D0 and D1 matrices.static doubleComputes the squared L2 distance between lag-L joint densities of two MAPs.static doubleComputes the squared L2 distance between lag-L joint densities of two MAPs.static doubleMap_dist_acf.map_dist_acf(Matrix A0, Matrix A1, Matrix B0, Matrix B1) Computes the squared L2 distance between autocorrelation functions of two MAPs.static doubleComputes the squared L2 distance between autocorrelation functions of two MAPs.static MatrixMap_embedded.map_embedded(Matrix D0, Matrix D1) Computes the embedded discrete-time Markov chain (DTMC) matrix of a MAP.static doubleMap_exp_mul_int.map_exp_mul_int(Matrix A0, Matrix A1, Matrix B0, Matrix B1, int L, Matrix alA, Matrix alB) Computes the inner product of lag-L joint densities of two MAPs.static doubleComputes the gamma parameter for a MAP, which is the autocorrelation decay rate.static doubleComputes the geometric sum needed for the autocorrelation distance.static doubleComputes the asymptotic index of dispersion (IDC) for a Markovian Arrival Process (MAP).static MatrixMap_infgen.map_infgen(Matrix D0, Matrix D1) Computes the infinitesimal generator matrix (Q) of the Continuous-Time Markov Chain (CTMC) underlying a Markovian Arrival Process (MAP).static doubleComputes the joint moments of a Markovian Arrival Process (MAP).static doubleMap_jointpdf_derivative.map_jointpdf_derivative(Matrix D0, Matrix D1, int[] iset) Compute partial derivative at 0 of a MAP's joint PDF.static Matrix[]Convenience function for composing exactly two MAPs.static doubleMap_lambda.map_lambda(Matrix D0, Matrix D1) Computes the arrival rate (lambda) of a Markovian Arrival Process (MAP).static MatrixCellMap_mark.map_mark(MatrixCell MAP, Matrix prob) Creates a Marked Markovian Arrival Process (MMAP) by marking a given MAP with additional phases based on specified marking probabilities.static doubleComputes the mean inter-arrival time of a Markovian Arrival Process (MAP).static doubleMap_moment.map_moment(Matrix D0, Matrix D1, int order) Computes the raw moments of the inter-arrival times of a MAP.static MatrixCellMap_normalize.map_normalize(Matrix D0, Matrix D1) Sanitizes the (D0, D1) matrices of a Markovian Arrival Process (MAP).static doublestatic double[]static MatrixComputes the steady-state probability vector of the embedded Discrete Time Markov Chain (DTMC) associated with a Markovian Arrival Process (MAP).static MatrixComputes the steady-state vector (pi) of the Continuous-Time Markov Chain (CTMC) underlying a Markovian Arrival Process (MAP).static MatrixMap_pntiter.map_pntiter(Matrix[] MAP, int na, double t) static MatrixMap_pntiter.map_pntiter(Matrix[] MAP, int na, double t, Integer M) Probability of having exactly na arrivals within time interval t using iterative method.Map_pntquad.map_pntquad(Matrix[] MAP, int na, double t) Compute MAP point process probabilities using ODE quadrature method.static MatrixComputes the equilibrium distribution of the underlying continuous-time Markov chain for a MAP.static MatrixCellMap_renewal.map_renewal(Matrix D0, Matrix D1) Creates a renewal MAP by removing all correlations from the input MAP.static double[]Map_sample.map_sample(Matrix D0, Matrix D1, long n, Random random) Generates samples of inter-arrival times from a MAP using a specified number of samples and a random generator.static MatrixCellRescales the mean inter-arrival time of a Markovian Arrival Process (MAP) to a specified new mean.static doubleComputes the squared coefficient of variation (SCV) of the inter-arrival times of a Markovian Arrival Process (MAP).static doubleComputes the skewness of the inter-arrival times for a MAP.static MatrixCellMap_stochcomp.map_stochcomp(Matrix D0, Matrix D1, int[] retainIdx) Performs stochastic complementation on a MAP by eliminating specified states.static doubleComputes the variance of the inter-arrival times for a MAP.static MatrixMap_varcount.map_varcount(MatrixCell MAP, Matrix t) static doubleMap_varcount.map_varcount(Matrix D0, Matrix D1, double t) Variance of the counts in a MAP over a time period t.static MatrixMap_varcount.map_varcount(Matrix D0, Matrix D1, Matrix t) Variance of the counts in a MAP over multiple time periods.Convert a MAP to MMPP format by extracting generator matrix Q and rate matrix LAMBDA.static MatrixCellMaph2m_fit.maph2m_fit(double M1, double M2, double M3, Matrix P, Matrix B) Computes the second-order MAPH[m] fitting given moments, class probs, and backward moments.static kotlin.Pair<MatrixCell, Matrix> Maph2m_fit.maph2m_fit_multiclass(MatrixCell aph, Matrix P, Matrix B) Fits MAPH(2,m) for multiple classes given underlying APH(2), class probabilities, and backward moments.static doubleComputes the mean of a Matrix Exponential (ME) distribution.static MatrixComputes the stationary initial probability for an ME/RAP distribution.static double[]Generates random samples from a Matrix Exponential (ME) distribution using inverse CDF interpolation.static doubleComputes the squared coefficient of variation (SCV) of a Matrix Exponential (ME) distribution.static doubleComputes the variance of a Matrix Exponential (ME) distribution.static MatrixMmap_backward_moment.mmap_backward_moment(MatrixCell MMAP, Matrix ORDERS) static MatrixMmap_backward_moment.mmap_backward_moment(MatrixCell MMAP, Matrix ORDERS, int NORM) Computes the backward moments of an MMAP for specified orders with normalization.static Matrix[]Mmap_compress.mmap_compress(Matrix[] mmap) static Matrix[]Mmap_compress.mmap_compress(Matrix[] mmap, String method) static MatrixMmap_count_mcov.mmap_count_mcov(Matrix[] mmap, double t) Array-based overload.static MatrixCellMmap_exponential.mmap_exponential(Matrix lambda) Fits a single-state MMAP based on the given arrival rates for each job class.static MatrixCellMmap_exponential.mmap_exponential(Matrix lambda, int n) Fits an order-n MMAP based on the given arrival rates for each job class.static MatrixMmap_forward_moment.mmap_forward_moment(MatrixCell MMAP, Matrix ORDERS) static MatrixMmap_forward_moment.mmap_forward_moment(MatrixCell MMAP, Matrix ORDERS, int NORM) Computes the forward moments of an MMAP for specified orders with normalization.static MatrixCellMmap_hide.mmap_hide(MatrixCell MMAP, Matrix types) Hides specified types of arrivals in a Markovian Arrival Process with marked arrivals (MMAP).static MatrixCellMmap_mark.mmap_mark(MatrixCell MMAP, Matrix prob) Converts a Markovian Arrival Process with marked arrivals (MMAP) into a new MMAP with redefined classes based on a given probability matrix.static MatrixCellMmap_mixture.mmap_mixture(Matrix alpha, Map<Integer, MatrixCell> MAPs) Creates a mixture of MMAPs using the given weights (alpha) and MAPs.static Ret.mamMMAPMixtureFitMmap_mixture_fit.mmap_mixture_fit(Object P2, Matrix M1, Matrix M2, Matrix M3) Fits a mixture of Markovian Arrival Processes (MMAPs) to match the given cross-moments.static Ret.mamMMAPMixtureFitMmap_mixture_fit_trace.mmap_mixture_fit_trace(Matrix T, Matrix A) Fits a MMAP with m classes using a mixture of m^2 PH-distributions from Matrix inputs.static Matrixstatic MatrixCellMmap_scale.mmap_scale(MatrixCell MMAP, Matrix M) Overloaded function for backward compatibility.static MatrixCellMmap_scale.mmap_scale(MatrixCell MMAP, Matrix M, int maxIter) Changes the mean inter-arrival time of a Markovian Arrival Process with marked arrivals (MMAP).static MatrixMmap_sigma.mmap_sigma(Matrix[] mmap) Computes one-step class transition probabilities for an MMAP given as Matrix[].static Qbd_bmapbmap1.QbdBmapResultQbd_bmapbmap1.qbd_bmapbmap1(MatrixCell MAPa, Matrix pbatcha, MatrixCell MAPs) Set up QBD matrices for BMAP/BMAP/1 queue analysis.static double[]Qbd_depproc_jointmom.qbd_depproc_jointmom(MatrixCell MAPa, MatrixCell MAPs, Matrix iset) Compute joint moments of consecutive inter-departure times.static Matrixstatic MatrixCompute R matrix using successive substitutions method for QBD processes.static MatrixQbd_R_logred.qbd_R_logred(Matrix B, Matrix L, Matrix F) static MatrixQbd_R_logred.qbd_R_logred(Matrix B, Matrix L, Matrix F, int iterMax) Compute R matrix using logarithmic reduction method for QBD processes.static intstatic Matrixstatic MatrixMethod parameters in jline.api.mam with type arguments of type MatrixModifier and TypeMethodDescriptionAph_convseq.aph_convseq(List<Pair<Matrix, Matrix>> aphParams) Performs sequential convolution of multiple APH distributions.Aph_convseq.aph_convseq(List<Pair<Matrix, Matrix>> aphParams) Performs sequential convolution of multiple APH distributions.static LdqbdResultstatic LdqbdResultConstructors in jline.api.mam with parameters of type MatrixModifierConstructorDescriptionLdqbdResult(List<Matrix> R, Matrix pi) Mamap2mCoefficients(Matrix first, Matrix second, Matrix third) QbdCrResult(Matrix G, Matrix R, Matrix U) QbdMapMap1Result(double XN, double QN, double UN, Matrix pqueue, Matrix R, Matrix eta, Matrix G, Matrix A_1, Matrix A0, Matrix A1, Matrix U, MatrixCell MAPs) QbdRapRap1Result(double XN, double QN, double UN, Matrix pqueue, Matrix R, Matrix eta, Matrix G, Matrix B, Matrix L, Matrix F) Constructor parameters in jline.api.mam with type arguments of type Matrix -
Uses of Matrix in jline.api.mam.m3pp
Methods in jline.api.mam.m3pp that return MatrixModifier and TypeMethodDescriptionstatic Matrix[]M3pp22_fitc_approx_cov.m3pp22_fitc_approx_cov(double a, double bt1, double bt2, double binf, double m3t2, double t1, double t2, double[] ai, double st3, double t3) Fits a second-order Marked MMPP for two classes using covariance approximation.static Matrix[]M3pp22_fitc_approx_cov_multiclass.m3pp22_fitc_approx_cov_multiclass(Matrix[] mmpp, double[] ai, double st3, double t3) Fits a M3PP(2,2) given the underlying MMPP(2).static Matrix[]M3pp2m_fitc.m3pp2m_fitc(double a, double bt1, double bt2, double binf, double m3t2, double t1, double t2, double[] ai, double[] dvt3, double t3) Fits a second-order Marked MMPP using exact count statistics.static Matrix[]M3pp2m_fitc_approx.m3pp2m_fitc_approx(double a, double bt1, double bt2, double binf, double m3t2, double t1, double t2, double[] ai, double[] dvt3, double t3) static Matrix[]M3pp2m_fitc_approx_ag.m3pp2m_fitc_approx_ag(double a, double bt1, double bt2, double binf, double m3t2, double t1, double t2, double[] ai, double[] gt3, double t3) Fits a second-order Marked MMPP using auto-gamma approach.static Matrix[]M3pp2m_fitc_approx_ag_multiclass.m3pp2m_fitc_approx_ag_multiclass(Matrix[] mmpp, double[] ai, double[] gt3, double t3) static Matrix[]M3pp2m_fitc_theoretical.m3pp2m_fitc_theoretical(MatrixCell mmap) static Matrix[]M3pp2m_fitc_theoretical.m3pp2m_fitc_theoretical(MatrixCell mmap, String method) static Matrix[]M3pp2m_fitc_theoretical.m3pp2m_fitc_theoretical(MatrixCell mmap, String method, double t) static Matrix[]M3pp2m_fitc_theoretical.m3pp2m_fitc_theoretical(MatrixCell mmap, String method, double t, double tinf) Fits the theoretical characteristics of a MMAP(n,m) with a M3PP(2,m).static Matrix[]M3pp2m_fitc_trace.m3pp2m_fitc_trace(double[] T, int[] A) static Matrix[]M3pp2m_fitc_trace.m3pp2m_fitc_trace(double[] T, int[] A, String method) static Matrix[]M3pp2m_fitc_trace.m3pp2m_fitc_trace(double[] T, int[] A, String method, Double t1, Double tinf) Fits a M3PP(2,m) from trace data using counting process characteristics.static Matrix[]M3pp2m_fitc_trace.m3pp2m_fitc_trace(Matrix T, Matrix A) static Matrix[]M3pp2m_fitc_trace.m3pp2m_fitc_trace(Matrix T, Matrix A, String method) static Matrix[]Fits a M3PP(2,m) from trace data using Matrix inputs.Methods in jline.api.mam.m3pp with parameters of type MatrixModifier and TypeMethodDescriptionM3pp_superpos_fitc_trace.m3pp_superpos_fitc_trace(Matrix T, Matrix A) M3pp_superpos_fitc_trace.m3pp_superpos_fitc_trace(Matrix T, Matrix A, Double t, Double tinf) Superposes k M3PP processes to fit a multi-class trace from Matrix inputs.static Matrix[]M3pp22_fitc_approx_cov_multiclass.m3pp22_fitc_approx_cov_multiclass(Matrix[] mmpp, double[] ai, double st3, double t3) Fits a M3PP(2,2) given the underlying MMPP(2).static Matrix[]M3pp2m_fitc_approx_ag_multiclass.m3pp2m_fitc_approx_ag_multiclass(Matrix[] mmpp, double[] ai, double[] gt3, double t3) static Matrix[]M3pp2m_fitc_trace.m3pp2m_fitc_trace(Matrix T, Matrix A) static Matrix[]M3pp2m_fitc_trace.m3pp2m_fitc_trace(Matrix T, Matrix A, String method) static Matrix[]Fits a M3PP(2,m) from trace data using Matrix inputs. -
Uses of Matrix in jline.api.map
Methods in jline.api.map with parameters of type MatrixModifier and TypeMethodDescriptionstatic double[]MAPM1PSCdfRespT.computeCdf(Matrix C, Matrix D, double mu, double[] x) static double[]MAPM1PSCdfRespT.computeCdf(Matrix C, Matrix D, double mu, double[] x, double epsilon) static double[]MAPM1PSCdfRespT.computeCdf(Matrix C, Matrix D, double mu, double[] x, double epsilon, double epsilonPrime) -
Uses of Matrix in jline.api.mapqn
Fields in jline.api.mapqn declared as MatrixModifier and TypeFieldDescriptionfinal MatrixMapqn_qr_bounds_bas_parameters.BBfinal MatrixMapqn_qr_bounds_bas_parameters.MMfinal MatrixMapqn_qr_bounds_bas_parameters.MM1final Matrix[]LinearReductionParameters.mufinal Matrix[]Mapqn_qr_bounds_bas_parameters.mufinal Matrix[]Mapqn_qr_bounds_rsrd_parameters.mufinal MatrixMVAVersionParameters.muMAPfinal MatrixLinearReductionParameters.rfinal MatrixMapqn_qr_bounds_bas_parameters.rfinal MatrixMapqn_qr_bounds_rsrd_parameters.rfinal MatrixMVAVersionParameters.rfinal Matrix[]LinearReductionParameters.vfinal Matrix[]Mapqn_qr_bounds_bas_parameters.vfinal Matrix[]Mapqn_qr_bounds_rsrd_parameters.vfinal MatrixMVAVersionParameters.vMethods in jline.api.mapqn that return MatrixConstructors in jline.api.mapqn with parameters of type MatrixModifierConstructorDescriptionLinearReductionParameters(int M, int N, int[] K, Matrix[] mu, Matrix r, Matrix[] v) Mapqn_qr_bounds_bas_parameters(int M, int N, int MR, int f, int[] K, int[] F, Matrix MM, Matrix MM1, int[] ZZ, Matrix BB, Matrix[] mu, Matrix[] v, Matrix r) Mapqn_qr_bounds_rsrd_parameters(int M, int N, int[] F, int[] K, Matrix[] mu, Matrix[] v, double[][] alpha, Matrix r) MVAVersionParameters(int M, int N, int K, double[] muM, Matrix muMAP, Matrix r, Matrix v) -
Uses of Matrix in jline.api.mc
Fields in jline.api.mc declared as MatrixModifier and TypeFieldDescriptionfinal MatrixCtmc_multi.CtmcMultiResult.pfinal MatrixCtmc_solve_reducible.CtmcSolveReducibleResult.pifinal MatrixDtmc_solve_reducible.DtmcSolveReducibleResult.pifinal MatrixDtmc_uniformization.DtmcUniformizationResult.pifinal MatrixCtmc_solve_reducible.CtmcSolveReducibleResult.pi0final MatrixDtmc_solve_reducible.DtmcSolveReducibleResult.pi0final MatrixDtmc_solve_reducible.DtmcSolveReducibleResult.pilfinal MatrixDtmc_solve_reducible.DtmcSolveReducibleResult.Plfinal MatrixCtmcSsgReachabilityResult.stateSpacefinal MatrixCtmcSsgReachabilityResult.stateSpaceAggrfinal MatrixCtmcSsgReachabilityResult.stateSpaceHashedFields in jline.api.mc with type parameters of type MatrixModifier and TypeFieldDescriptionfinal Map<StatefulNode, Matrix> CtmcSsgReachabilityResult.nodeStateSpaceCtmc_solve_reducible.CtmcSolveReducibleResult.pisDtmc_solve_reducible.DtmcSolveReducibleResult.pisMethods in jline.api.mc that return MatrixModifier and TypeMethodDescriptionDtmc_uniformization.DtmcUniformizationResult.component1()static MatrixCtmc_makeinfgen.ctmc_makeinfgen(Matrix Q) Converts a matrix into a valid infinitesimal generator for a CTMC.static MatrixCtmc_rand.ctmc_rand(int length) Form a random infinitesimal generator of a CTMCstatic MatrixCtmc_solve.ctmc_solve(Matrix Q) Return the steady-state probability of a CTMC.static MatrixCtmc_stmonotone.ctmc_stmonotone(Matrix Q) Computes the stochastically monotone upper bound for a CTMC.static MatrixCtmc_timereverse.ctmc_timereverse(Matrix Q) Compute the infinitesimal generator of the time-reserved CTMCstatic MatrixCtmc_uniformization.ctmc_uniformization(Matrix pi0, Matrix Q, double t) Return the transient probability distribution of the CTMC via the uniformization method.static MatrixDtmc_makestochastic.dtmc_makestochastic(Matrix P) Normalize a given non-negative matrix into a DTMC.static MatrixDtmc_rand.dtmc_rand(int length) Form a random infinitesimal generator of a DTMCstatic MatrixDtmc_solve.dtmc_solve(Matrix P) Returns the steady-state solution of a DTMC.static MatrixCtmc_stmonotone.dtmc_stmonotone(Matrix P) Implementation of the dtmc_stmonotone algorithm.static MatrixDtmc_stochcomp.dtmc_stochcomp(Matrix P, List<Integer> I) Returns the stochastic complement of a DTMC.static MatrixDtmc_timereverse.dtmc_timereverse(Matrix P) Compute the infinitesimal generator of the time-reversed DTMC.Ctmc_solve_reducible_blkdecompResult.getPi()Ctmc_solve_reducible_blkdecompResult.getPi0()CtmcSsgReachabilityResult.getStateSpace()CtmcSsgReachabilityResult.getStateSpaceAggr()CtmcSsgReachabilityResult.getStateSpaceHashed()Methods in jline.api.mc that return types with arguments of type MatrixModifier and TypeMethodDescriptionCtmc_courtois.ctmc_courtois(Matrix Q, List<List<Integer>> MS) Ctmc_courtois.ctmc_courtois(Matrix Q, List<List<Integer>> MS, double q) Courtois decomposition for nearly completely decomposable CTMCsKoury-McAllister-Stewart aggregation-disaggregation method for CTMCsCtmc_randomization.ctmc_randomization(Matrix Q) Ctmc_randomization.ctmc_randomization(Matrix Q, Double q) Convert a CTMC to a DTMC using randomization techniqueCtmc_solve_reducible.ctmc_solve_reducible(Matrix Q) Ctmc_solve_reducible.ctmc_solve_reducible(Matrix Q, Matrix pi0) Solve reducible CTMCs by converting to DTMC via randomization.Ctmc_solve_reducible_blkdecomp.ctmc_solve_reducible_blkdecomp(Matrix Q) Ctmc_solve_reducible_blkdecomp.ctmc_solve_reducible_blkdecomp(Matrix Q, Matrix pi0) Ctmc_solve_reducible_blkdecomp.ctmc_solve_reducible_blkdecomp(Matrix Q, Matrix pi0, Map<String, Object> options) Ctmc_takahashi.ctmc_takahashi(Matrix Q, List<List<Integer>> MS, int numSteps) Takahashi's aggregation-disaggregation method for CTMCsDtmc_solve_reducible.dtmc_solve_reducible(Matrix P) Dtmc_solve_reducible.dtmc_solve_reducible(Matrix P, Matrix pin) Estimate limiting distribution for a DTMC that may have reducible components.CtmcSsgReachabilityResult.getNodeStateSpace()Ctmc_solve_reducible_blkdecompResult.getPis()Methods in jline.api.mc with parameters of type MatrixModifier and TypeMethodDescriptionCtmc_courtois.ctmc_courtois(Matrix Q, List<List<Integer>> MS) Ctmc_courtois.ctmc_courtois(Matrix Q, List<List<Integer>> MS, double q) Courtois decomposition for nearly completely decomposable CTMCsKoury-McAllister-Stewart aggregation-disaggregation method for CTMCsstatic MatrixCtmc_makeinfgen.ctmc_makeinfgen(Matrix Q) Converts a matrix into a valid infinitesimal generator for a CTMC.static Ctmc_multi.CtmcMultiResultMulti-level aggregation method for CTMCs.static SolverCTMC.StochCompResultCtmc_pseudostochcomp.ctmc_pseudostochcomp(Matrix Q, List<Double> I_list) Ctmc_randomization.ctmc_randomization(Matrix Q) Ctmc_randomization.ctmc_randomization(Matrix Q, Double q) Convert a CTMC to a DTMC using randomization techniquestatic Object[]Ctmc_relsolve.ctmc_relsolve(Matrix Q) static Object[]Ctmc_relsolve.ctmc_relsolve(Matrix Q, int refstate) static Object[]Ctmc_relsolve.ctmc_relsolve(Matrix Q, int refstate, Map<String, Object> options) Equilibrium distribution of a continuous-time Markov chain re-normalized with respect to the probability of a reference state.static Ret.ctmcSimulationCtmc_simulate.ctmc_simulate(Matrix Q, double[] pi0, int n) static Ret.ctmcSimulationCtmc_simulate.ctmc_simulate(Matrix Q, double[] pi0, int n, Random random) static MatrixCtmc_solve.ctmc_solve(Matrix Q) Return the steady-state probability of a CTMC.Ctmc_solve_reducible.ctmc_solve_reducible(Matrix Q) Ctmc_solve_reducible.ctmc_solve_reducible(Matrix Q, Matrix pi0) Solve reducible CTMCs by converting to DTMC via randomization.Ctmc_solve_reducible_blkdecomp.ctmc_solve_reducible_blkdecomp(Matrix Q) Ctmc_solve_reducible_blkdecomp.ctmc_solve_reducible_blkdecomp(Matrix Q, Matrix pi0) Ctmc_solve_reducible_blkdecomp.ctmc_solve_reducible_blkdecomp(Matrix Q, Matrix pi0, Map<String, Object> options) Ctmc_solve_reducible_blkdecomp.ctmc_solve_reducible_blkdecomp_full(Matrix Q) Ctmc_solve_reducible_blkdecomp.ctmc_solve_reducible_blkdecomp_full(Matrix Q, Matrix pi0) Ctmc_solve_reducible_blkdecomp.ctmc_solve_reducible_blkdecomp_full(Matrix Q, Matrix pi0, Map<String, Object> options) Ctmc_solve_reducible.ctmc_solve_reducible_full(Matrix Q) Ctmc_solve_reducible.ctmc_solve_reducible_full(Matrix Q, Matrix pi0) Alternative signature that returns additional information.static MatrixCtmc_stmonotone.ctmc_stmonotone(Matrix Q) Computes the stochastically monotone upper bound for a CTMC.static SolverCTMC.StochCompResultCtmc_stochcomp.ctmc_stochcomp(Matrix Q, List<Double> I_list) Ctmc_takahashi.ctmc_takahashi(Matrix Q, List<List<Integer>> MS, int numSteps) Takahashi's aggregation-disaggregation method for CTMCsstatic booleanCtmc_testpf_kolmogorov.ctmc_testpf_kolmogorov(Matrix Q) Test if a CTMC has product form using Kolmogorov's criteria.static MatrixCtmc_timereverse.ctmc_timereverse(Matrix Q) Compute the infinitesimal generator of the time-reserved CTMCCtmc_transient.ctmc_transient(Matrix Q, double t1) Ctmc_transient.ctmc_transient(Matrix Q, Matrix pi0, double t1) Ctmc_transient.ctmc_transient(Matrix Q, Matrix pi0, double t0, double t1) Ctmc_transient.ctmc_transient(Matrix Q, Matrix pi0, double t0, double t1, Double timestep) static MatrixCtmc_uniformization.ctmc_uniformization(Matrix pi0, Matrix Q, double t) Return the transient probability distribution of the CTMC via the uniformization method.static intDtmc_isfeasible.dtmc_isfeasible(Matrix P) Check if a matrix represents a feasible DTMC transition matrixstatic MatrixDtmc_makestochastic.dtmc_makestochastic(Matrix P) Normalize a given non-negative matrix into a DTMC.static int[]Dtmc_simulate.dtmc_simulate(Matrix P, Matrix pi0, int n) Simulate a discrete-time Markov chain trajectory.static MatrixDtmc_solve.dtmc_solve(Matrix P) Returns the steady-state solution of a DTMC.Dtmc_solve_reducible.dtmc_solve_reducible(Matrix P) Dtmc_solve_reducible.dtmc_solve_reducible(Matrix P, Matrix pin) Estimate limiting distribution for a DTMC that may have reducible components.Dtmc_solve_reducible.dtmc_solve_reducible_full(Matrix P) Dtmc_solve_reducible.dtmc_solve_reducible_full(Matrix P, Matrix pin) Full version that returns all computed values.static MatrixCtmc_stmonotone.dtmc_stmonotone(Matrix P) Implementation of the dtmc_stmonotone algorithm.static MatrixDtmc_stochcomp.dtmc_stochcomp(Matrix P, List<Integer> I) Returns the stochastic complement of a DTMC.static MatrixDtmc_timereverse.dtmc_timereverse(Matrix P) Compute the infinitesimal generator of the time-reversed DTMC.Dtmc_uniformization.dtmc_uniformization(Matrix pi0, Matrix P) Dtmc_uniformization.dtmc_uniformization(Matrix pi0, Matrix P, double t) Dtmc_uniformization.dtmc_uniformization(Matrix pi0, Matrix P, double t, double tol) Dtmc_uniformization.dtmc_uniformization(Matrix pi0, Matrix P, double t, double tol, int maxiter) Compute the transient probability distribution of a DTMC using uniformization.Constructors in jline.api.mc with parameters of type MatrixModifierConstructorDescriptionCtmc_solve_reducible_blkdecompResult(Matrix pi, List<Matrix> pis, Matrix pi0, List<List<Integer>> scc, List<Boolean> isrec) CtmcMultiResult(Matrix p, double eps, double epsMAX) CtmcSolveReducibleResult(Matrix pi, List<Matrix> pis, Matrix pi0, List<List<Integer>> scc, List<Boolean> isrec) CtmcSsgReachabilityResult(Matrix stateSpace, Matrix stateSpaceAggr, Matrix stateSpaceHashed, Map<StatefulNode, Matrix> nodeStateSpace, NetworkStruct sn) DtmcSolveReducibleResult(Matrix pi, List<Matrix> pis, Matrix pi0, List<List<Integer>> scc, List<Boolean> isrec, Matrix Pl, Matrix pil) DtmcUniformizationResult(Matrix pi, int kmax) Constructor parameters in jline.api.mc with type arguments of type MatrixModifierConstructorDescriptionCtmc_solve_reducible_blkdecompResult(Matrix pi, List<Matrix> pis, Matrix pi0, List<List<Integer>> scc, List<Boolean> isrec) CtmcSolveReducibleResult(Matrix pi, List<Matrix> pis, Matrix pi0, List<List<Integer>> scc, List<Boolean> isrec) CtmcSsgReachabilityResult(Matrix stateSpace, Matrix stateSpaceAggr, Matrix stateSpaceHashed, Map<StatefulNode, Matrix> nodeStateSpace, NetworkStruct sn) DtmcSolveReducibleResult(Matrix pi, List<Matrix> pis, Matrix pi0, List<List<Integer>> scc, List<Boolean> isrec, Matrix Pl, Matrix pil) -
Uses of Matrix in jline.api.measures
Methods in jline.api.measures with parameters of type MatrixModifier and TypeMethodDescriptionstatic doubleMs_additivesymmetricchisquared.ms_additivesymmetricchisquared(Matrix P, Matrix Q) Additive symmetric chi-squared distance between two probability distributions.static doubleMs_anderson_darling.ms_anderson_darling(Matrix XX, Matrix YY) Anderson-Darling distance between two empirical distributions.static doubleMs_avgl1linfty.ms_avgl1linfty(Matrix P, Matrix Q) Average L1 L-infinity distance between two probability distributions.static doubleMs_bhattacharyya.ms_bhattacharyya(Matrix P, Matrix Q) Bhattacharyya distance between two probability distributions.static doubleMs_canberra.ms_canberra(Matrix P, Matrix Q) Canberra distance between two probability distributions.static doubleMs_chebyshev.ms_chebyshev(Matrix P, Matrix Q) Chebyshev distance between two probability distributions.static doubleMs_cityblock.ms_cityblock(Matrix P, Matrix Q) City block (Manhattan) distance between two probability distributions.static doubleClark distance between two probability distributions.static doubleMs_condentropy.ms_condentropy(Matrix x, Matrix y) Compute conditional entropy z=H(x|y) of two discrete variables x and y.static doubleCosine distance between two probability distributions.static doubleMs_cramer_von_mises.ms_cramer_von_mises(Matrix XX, Matrix YY) Cramer-von Mises distance between two empirical distributions.static doubleMs_czekanowski.ms_czekanowski(Matrix P, Matrix Q) Czekanowski distance between two probability distributions.static doubleDice distance between two probability distributions.static doubleMs_divergence.ms_divergence(Matrix P, Matrix Q) Divergence distance between two probability distributions.static doubleMs_entropy.ms_entropy(Matrix x) Compute entropy z=H(x) of a discrete variable x.static doubleMs_euclidean.ms_euclidean(Matrix P, Matrix Q) Euclidean distance between two probability distributions.static doubleMs_fidelity.ms_fidelity(Matrix P, Matrix Q) Fidelity distance between two probability distributions.static doubleGower distance between two probability distributions.static doubleMs_harmonicmean.ms_harmonicmean(Matrix P, Matrix Q) Harmonic mean distance between two probability distributions.static doubleMs_hellinger.ms_hellinger(Matrix P, Matrix Q) Hellinger distance between two probability distributions.static doubleMs_intersection.ms_intersection(Matrix P, Matrix Q) Intersection distance between two probability distributions.static doubleMs_jaccard.ms_jaccard(Matrix P, Matrix Q) Jaccard distance between two probability distributions.static doubleMs_jeffreys.ms_jeffreys(Matrix P, Matrix Q) Jeffreys divergence between two probability distributions.static doubleMs_jensendifference.ms_jensendifference(Matrix P, Matrix Q) Jensen difference divergence between two probability distributions.static doubleMs_jensenshannon.ms_jensenshannon(Matrix P, Matrix Q) Jensen-Shannon divergence between two probability distributions.static doubleMs_jointentropy.ms_jointentropy(Matrix x, Matrix y) Compute joint entropy z=H(x,y) of two discrete variables x and y.static doubleMs_kdivergence.ms_kdivergence(Matrix P, Matrix Q) K-divergence between two probability distributions.static doubleMs_kolmogorov_smirnov.ms_kolmogorov_smirnov(Matrix XX, Matrix YY) Kolmogorov-Smirnov distance between two empirical distributions.static doubleKuiper distance between two empirical distributions.static doubleMs_kulczynskid.ms_kulczynskid(Matrix P, Matrix Q) Kulczynski d distance between two probability distributions.static doubleMs_kulczynskis.ms_kulczynskis(Matrix P, Matrix Q) Kulczynski s distance between two probability distributions.static doubleMs_kullbackleibler.ms_kullbackleibler(Matrix P, Matrix Q) Kullback-Leibler divergence between two probability distributions.static doubleMs_kumarhassebrook.ms_kumarhassebrook(Matrix P, Matrix Q) Kumar-Hassebrook distance between two probability distributions.static doubleMs_kumarjohnson.ms_kumarjohnson(Matrix P, Matrix Q) Kumar-Johnson distance between two probability distributions.static doubleMs_lorentzian.ms_lorentzian(Matrix P, Matrix Q) Lorentzian distance between two probability distributions.static doubleMs_matusita.ms_matusita(Matrix P, Matrix Q) Matusita distance between two probability distributions.static doubleMs_minkowski.ms_minkowski(Matrix P, Matrix Q, double p) Minkowski distance between two probability distributions.static doubleMotyka distance between two probability distributions.static doubleMs_mutinfo.ms_mutinfo(Matrix x, Matrix y) Compute mutual information I(x,y) of two discrete variables x and y.static doubleMs_neymanchisquared.ms_neymanchisquared(Matrix P, Matrix Q) Neyman chi-squared distance between two probability distributions.static doubleCompute normalized mutual information I(x,y)/sqrt(H(x)*H(y)) of two discrete variables x and y.static doubleCompute normalized variation information z=(1-I(x,y)/H(x,y)) of two discrete variables x and y.static doubleMs_pearsonchisquared.ms_pearsonchisquared(Matrix P, Matrix Q) Pearson chi-squared distance between two probability distributions.static doubleMs_probsymmchisquared.ms_probsymmchisquared(Matrix P, Matrix Q) Probabilistic symmetry chi-squared distance between two probability distributions.static doubleMs_product.ms_product(Matrix P, Matrix Q) Product distance between two probability distributions.static doubleMs_relatentropy.ms_relatentropy(Matrix x, Matrix y) Compute relative entropy (KL divergence) z=KL(p(x)||p(y)) of two discrete variables x and y.static doubleMs_ruzicka.ms_ruzicka(Matrix P, Matrix Q) Ruzicka distance between two probability distributions.static doubleMs_soergel.ms_soergel(Matrix P, Matrix Q) Soergel distance between two probability distributions.static doubleMs_sorensen.ms_sorensen(Matrix P, Matrix Q) Sorensen distance between two probability distributions.static doubleMs_squaredchisquared.ms_squaredchisquared(Matrix P, Matrix Q) Squared chi-squared distance between two probability distributions.static doubleMs_squaredchord.ms_squaredchord(Matrix P, Matrix Q) Squared chord distance between two probability distributions.static doubleMs_squaredeuclidean.ms_squaredeuclidean(Matrix P, Matrix Q) Squared Euclidean distance between two probability distributions.static doubleTaneja distance between two probability distributions.static doubleMs_tanimoto.ms_tanimoto(Matrix P, Matrix Q) Tanimoto distance between two probability distributions.static doubleTopsoe distance between two probability distributions.static doubleMs_wasserstein.ms_wasserstein(Matrix XX, Matrix YY) Wasserstein distance (Earth Mover's Distance) between two empirical distributions.static doubleMs_wavehegdes.ms_wavehegdes(Matrix P, Matrix Q) Wave-Hedges distance between two probability distributions. -
Uses of Matrix in jline.api.nc
Methods in jline.api.nc that return MatrixModifier and TypeMethodDescriptionMeOqnResult.getCa()MeOqnResult.getCd()MeOqnResult.getL()MeOqnResult.getLambda()MeOqnResult.getRho()MeOqnResult.getW()Methods in jline.api.nc with parameters of type MatrixModifier and TypeMethodDescriptionstatic MeOqnResultstatic MeOqnResultMe_oqn.me_oqn(int M, int R, Matrix lambda0, Matrix Ca0, Matrix mu, Matrix Cs, Matrix[][] P, MeOqnOptions options) Maximum Entropy algorithm for Open Queueing Networks.Constructors in jline.api.nc with parameters of type Matrix -
Uses of Matrix in jline.api.npfqn
Methods in jline.api.npfqn with parameters of type MatrixModifier and TypeMethodDescriptionstatic Ret.npfqnNonexpApproxNpfqn_nonexp_approx.npfqn_nonexp_approx(String method, NetworkStruct sn, Matrix ST, Matrix V, Matrix SCV, Matrix Tin, Matrix Uin, Matrix gamma, Matrix nservers) Approximates non-product-form queueing networks using the specified method.static MatrixCellNpfqn_traffic_merge_cs.npfqn_traffic_merge_cs(Map<Integer, MatrixCell> MMAPs, Matrix prob) static MatrixCellNpfqn_traffic_merge_cs.npfqn_traffic_merge_cs(Map<Integer, MatrixCell> MMAPs, Matrix prob, String config) Merges MMAP traffic flows with class switching.static Map<Integer, MatrixCell> Npfqn_traffic_split_cs.npfqn_traffic_split_cs(MatrixCell MMAP, Matrix P) Splits MMAP traffic flows with class switching. -
Uses of Matrix in jline.api.pfqn
Methods in jline.api.pfqn that return MatrixModifier and TypeMethodDescriptionPfqnUniqueResult.getGamma_unique()PfqnUniqueResult.getL_unique()PfqnUniqueResult.getMi()PfqnUniqueResult.getMu_unique()static MatrixPfqn_replicas.pfqn_combine_mi(Matrix mi, int[] mapping, int M_unique) Combine user-provided multiplicity vector with detected replica multiplicity.Methods in jline.api.pfqn that return types with arguments of type MatrixModifier and TypeMethodDescriptionPfqn_replicas.pfqn_expand(Matrix QN, Matrix UN, Matrix CN, int[] mapping) Expand per-station metrics from reduced model to original dimensions.Pfqn_replicas.pfqn_expand(Matrix QN, Matrix UN, Matrix CN, int[] mapping) Expand per-station metrics from reduced model to original dimensions.Pfqn_replicas.pfqn_expand(Matrix QN, Matrix UN, Matrix CN, int[] mapping) Expand per-station metrics from reduced model to original dimensions.Methods in jline.api.pfqn with parameters of type MatrixModifier and TypeMethodDescriptionstatic MatrixPfqn_replicas.pfqn_combine_mi(Matrix mi, int[] mapping, int M_unique) Combine user-provided multiplicity vector with detected replica multiplicity.Pfqn_replicas.pfqn_expand(Matrix QN, Matrix UN, Matrix CN, int[] mapping) Expand per-station metrics from reduced model to original dimensions.static Ret.pfqnHarelBoundsPfqn_harel_bounds.pfqn_harel_bounds(Matrix rho, int N) static Ret.pfqnHarelBoundsPfqn_harel_bounds.pfqn_harel_bounds(Matrix rho, int N, double Z) static Ret.pfqnHarelBoundsPfqn_harel_bounds.pfqn_harel_bounds(Matrix rho, int N, double Z, Integer maxUB) static doublePfqn_harel_bounds.pfqn_harel_lb(Matrix rho, int N) static doublePfqn_harel_bounds.pfqn_harel_lb(Matrix rho, int N, double Z) static doublePfqn_harel_bounds.pfqn_harel_ub(Matrix rho, int N, int n) static doublePfqn_harel_bounds.pfqn_harel_ub(Matrix rho, int N, int n, double Z) static doublePfqn_joint.pfqn_joint(Matrix n, Matrix L, Matrix N) static doublePfqn_joint.pfqn_joint(Matrix n, Matrix L, Matrix N, Matrix Z) static doubleCompute the joint queue-length probability for vector nstatic PfqnUniqueResultPfqn_replicas.pfqn_unique(Matrix L) static PfqnUniqueResultPfqn_replicas.pfqn_unique(Matrix L, Matrix mu) static PfqnUniqueResultPfqn_replicas.pfqn_unique(Matrix L, Matrix mu, Matrix gamma) Consolidate replicated stations into unique stations with multiplicity.Constructors in jline.api.pfqn with parameters of type MatrixModifierConstructorDescriptionPfqnUniqueResult(Matrix L_unique, Matrix mu_unique, Matrix gamma_unique, Matrix mi, int[] mapping) -
Uses of Matrix in jline.api.pfqn.lcfs
Fields in jline.api.pfqn.lcfs declared as MatrixMethods in jline.api.pfqn.lcfs that return MatrixModifier and TypeMethodDescriptionLcfsqnMvaResult.getB()LcfsqnMvaResult.getQ()LcfsqnMvaResult.getT()LcfsqnMvaResult.getU()Methods in jline.api.pfqn.lcfs with parameters of type MatrixModifier and TypeMethodDescriptionstatic LcfsqnCaResultPfqn_lcfsqn_ca.pfqn_lcfsqn_ca(Matrix alpha, Matrix beta) static LcfsqnCaResultPfqn_lcfsqn_ca.pfqn_lcfsqn_ca(Matrix alpha, Matrix beta, Matrix N) Convolution algorithm for multiclass LCFS queueing networks.static LcfsqnMvaResultPfqn_lcfsqn_mva.pfqn_lcfsqn_mva(Matrix alpha, Matrix beta) static LcfsqnMvaResultPfqn_lcfsqn_mva.pfqn_lcfsqn_mva(Matrix alpha, Matrix beta, Matrix N) Pfqn_lcfsqn_nc.pfqn_lcfsqn_nc(Matrix alpha, Matrix beta, Matrix N) Normalizing constant for multiclass LCFS queueing networks.Constructors in jline.api.pfqn.lcfs with parameters of type MatrixModifierConstructorDescriptionLcfsqnMvaResult(Matrix T, Matrix Q, Matrix U, Matrix B) LcfsqnNcResult(double G, Matrix[] Ax) -
Uses of Matrix in jline.api.pfqn.ld
Methods in jline.api.pfqn.ld that return MatrixModifier and TypeMethodDescriptionstatic MatrixPfqn_ljdfun.ljd_delinearize(int idx, Matrix cutoffs) Convert linearized index back to per-class population vectorstatic MatrixPfqn_cdfun.pfqn_cdfun(Matrix nvec, List<SerializableFunction<Matrix, Double>> cdscaling, int M) Evaluate class-dependent (CD) scaling function.static MatrixPfqn_ljdfun.pfqn_ljdfun(Matrix nvec, List<Matrix> ljdscaling, List<Matrix> ljdcutoffs, int M, Matrix nservers) Evaluate limited joint-dependent (LJD) functionstatic MatrixPfqn_lldfun.pfqn_lldfun(Matrix n, Matrix lldscaling, Matrix nservers) Evaluate limited-load dependent (LLD) function.static MatrixPfqn_mu_ms.pfqn_mu_ms(int N, int m, int c) static MatrixPfqn_mushift.pfqn_mushift(Matrix mu, int k) Shifts a load-dependent scaling vector by one positionMethods in jline.api.pfqn.ld with parameters of type MatrixModifier and TypeMethodDescriptionstatic Ret.pfqnNcPfqn_ncld.compute_norm_const_ld(Matrix L, Matrix N, Matrix Z, Matrix mu, SolverOptions options) static doublePfqn_ljdfun.ljcd_interpolate(Matrix nvec, Matrix cutoffs, Matrix table, int K) Multi-linear interpolation for LJCD scaling tables.static MatrixPfqn_ljdfun.ljd_delinearize(int idx, Matrix cutoffs) Convert linearized index back to per-class population vectorstatic intPfqn_ljdfun.ljd_linearize(Matrix nvec, Matrix cutoffs) Convert per-class population vector to linearized index (0-indexed)static Ret.pfqnABstatic MatrixPfqn_cdfun.pfqn_cdfun(Matrix nvec, List<SerializableFunction<Matrix, Double>> cdscaling, int M) Evaluate class-dependent (CD) scaling function.static Ret.pfqnComomrmLdPfqn_comomrm_ld.pfqn_comomrm_ld(Matrix Lin, Matrix Nin, Matrix Zin, Matrix muIn, SolverOptions options) Run the COMOM normalizing constant solution method on a repairman model.static double[]Pfqn_conv.pfqn_conv(Matrix L, int[] N, double[] Z, Matrix mu, List<List<Matrix>> ljcdscaling, List<Matrix> ljcdcutoffs) Multichain convolution for LJCD networks.static Ret.pfqnFncCompute scaling factor of a load-dependent functional server use to calculate the meanstatic Ret.pfqnFncCompute scaling factor of a load-dependent functional server use to calculate the mean instantiated with scaling constant c.static Ret.pfqnNcPfqn_gld.pfqn_gld(Matrix L, Matrix N, Matrix mu, SolverOptions options) Compute the normalizing constant of a single-class load-dependent closed queueing network modelstatic Ret.pfqnNcComplexPfqn_gld_complex.pfqn_gld_complex(ComplexMatrix L, Matrix N, Matrix mu, SolverOptions options) Compute the normalizing constant of a single-class load-dependent closed queueing network model with complex demands.static Ret.pfqnNcPfqn_gldsingle.pfqn_gldsingle(Matrix L, Matrix N, Matrix mu, SolverOptions options) Auxiliary function used by pfqn_gld to compute the normalizing constant in a single-class load-dependent model.static Ret.pfqnNcComplexPfqn_gldsingle_complex.pfqn_gldsingle_complex(ComplexMatrix L, Matrix N, Matrix mu, SolverOptions options) Auxiliary function used by pfqn_gld to compute the normalizing constant in a single-class load-dependent model with complex demands.static MatrixPfqn_ljdfun.pfqn_ljdfun(Matrix nvec, List<Matrix> ljdscaling, List<Matrix> ljdcutoffs, int M, Matrix nservers) Evaluate limited joint-dependent (LJD) functionstatic MatrixPfqn_lldfun.pfqn_lldfun(Matrix n, Matrix lldscaling, Matrix nservers) Evaluate limited-load dependent (LLD) function.static doublePfqn_mu_ms.pfqn_mu_ms_gnaux(int n, int m, int c, Matrix g) static MatrixPfqn_mushift.pfqn_mushift(Matrix mu, int k) Shifts a load-dependent scaling vector by one positionstatic Ret.pfqnMVALDPfqn_mvald.pfqn_mvald(Matrix L, Matrix N, Matrix Z, Matrix mu) static Ret.pfqnMVALDPfqn_mvald.pfqn_mvald(Matrix L, Matrix N, Matrix Z, Matrix mu, boolean stabilize) static Ret.pfqnMVAWrapper for pfqn_mvaldmx that adjusts utilizations to account for multiservers.static Ret.pfqnMVALDMXMVA method for mixed queueing networks with load-dependent nodes.static Ret.pfqnMVALDMXECPfqn_mvaldmx_ec.pfqn_mvaldmx_ec(Matrix lambda, Matrix D, Matrix mu) Auxiliary function used by pfqn_mvaldmx to compute the EC terms.static Ret.pfqnNcstatic Ret.pfqnProcomom2Pfqn_procomom2.pfqn_procomom2(Matrix L, Matrix N, Matrix Z) static Ret.pfqnProcomom2Pfqn_procomom2.pfqn_procomom2(Matrix L, Matrix N, Matrix Z, Matrix mu) static Ret.pfqnProcomom2Compute marginal state probabilities for the queue in a model consisting of a queueing station and a delay station only.static Ret.pfqnSchmidtPfqn_schmidt.pfqn_schmidt(Matrix D, Matrix N, Matrix S, List<SchedStrategy> sched) static doublePfqn_xia.pfqn_xia(Matrix L, int N, Matrix s, SolverOptions options) Method parameters in jline.api.pfqn.ld with type arguments of type MatrixModifier and TypeMethodDescriptionstatic MatrixPfqn_cdfun.pfqn_cdfun(Matrix nvec, List<SerializableFunction<Matrix, Double>> cdscaling, int M) Evaluate class-dependent (CD) scaling function.static double[]Pfqn_conv.pfqn_conv(Matrix L, int[] N, double[] Z, Matrix mu, List<List<Matrix>> ljcdscaling, List<Matrix> ljcdcutoffs) Multichain convolution for LJCD networks.static MatrixPfqn_ljdfun.pfqn_ljdfun(Matrix nvec, List<Matrix> ljdscaling, List<Matrix> ljdcutoffs, int M, Matrix nservers) Evaluate limited joint-dependent (LJD) function -
Uses of Matrix in jline.api.pfqn.mva
Fields in jline.api.pfqn.mva declared as MatrixModifier and TypeFieldDescriptionfinal MatrixPfqn_sqni.PfqnSqniResult.Qfinal MatrixPfqn_sqni.PfqnSqniResult.Ufinal MatrixPfqn_sqni.PfqnSqniResult.XMethods in jline.api.pfqn.mva that return MatrixModifier and TypeMethodDescriptionMethods in jline.api.pfqn.mva with parameters of type MatrixModifier and TypeMethodDescriptionstatic Ret.pfqnAMVAMSPfqn_ab_amva.ab_amva(Matrix serviceTimes, Matrix N, Matrix V, Matrix nservers, List<SchedStrategy> schedStrategies, boolean fcfsSchmidt, String marginalProbMethod) static Ret.pfqnAMVAPfqn_ab_amva.ab_linearizer(int K, int M, Matrix population, Matrix nservers, List<SchedStrategy> type, Matrix v, Matrix s, boolean fcfsSchmidt, String marginalProbMethod) Pfqn_ab_amva.findMarginalProbs(double avgJobs, int numServers, Matrix population, int classIdx, String marginalProbMethod) static Ret.pfqnAMVAPfqn_ab_amva.pfqn_ab_core(int K, int M, Matrix population, Matrix nservers, List<SchedStrategy> type, Matrix v, Matrix s, int maxiter, double[][][] D, Matrix lIn, boolean fcfsSchmidt, String marginalProbMethod) static Ret.pfqnAMVAstatic Ret.pfqnAMVAstatic Ret.pfqnAMVAstatic Ret.pfqnAMVAstatic Ret.pfqnAMVAstatic Ret.pfqnAMVAstatic Ret.pfqnAMVAstatic Ret.pfqnAMVAstatic Ret.pfqnAMVAPfqn_bs.pfqn_bs(Matrix L, Matrix N, Matrix Z, double tol, int maxiter, Matrix QN0, SchedStrategy[] type) static Ret.pfqnAMVAPfqn_bs.pfqn_bs(Matrix L, Matrix N, Matrix Z, double tol, int maxiter, Matrix QN0, SchedStrategy[] type, Matrix weight) Bard-Schweitzer approximate mean value analysis algorithm with optional weighted priorities.static Ret.pfqnAMVABard-Schweitzer approximate mean value analysis algorithm with weighted priorities.static Ret.pfqnAMVAPfqn_bsfcfs.pfqn_bsfcfs(Matrix L, Matrix N) static Ret.pfqnAMVAPfqn_bsfcfs.pfqn_bsfcfs(Matrix L, Matrix N, Matrix Z) static Ret.pfqnAMVAPfqn_bsfcfs.pfqn_bsfcfs(Matrix L, Matrix N, Matrix Z, double tol) static Ret.pfqnAMVAPfqn_bsfcfs.pfqn_bsfcfs(Matrix L, Matrix N, Matrix Z, double tol, int maxiter) static Ret.pfqnAMVAPfqn_bsfcfs.pfqn_bsfcfs(Matrix L, Matrix N, Matrix Z, double tol, int maxiter, Matrix QN0) static Ret.pfqnAMVAPfqn_bsfcfs.pfqn_bsfcfs(Matrix L, Matrix N, Matrix Z, double tol, int maxiter, Matrix QN0, Matrix weight) Bard-Schweitzer approximate MVA for FCFS scheduling with weighted priorities.static Ret.pfqnAMVAMSPfqn_conwayms.pfqn_conwayms(Matrix L, Matrix N, Matrix Z) static Ret.pfqnAMVAMSPfqn_conwayms.pfqn_conwayms(Matrix L, Matrix N, Matrix Z, int[] nservers) static Ret.pfqnAMVAMSPfqn_conwayms.pfqn_conwayms(Matrix L, Matrix N, Matrix Z, int[] nservers, SchedStrategy[] type, double tol, int maxiter) static Ret.LinearizerResultPfqn_conwayms.pfqn_conwayms_core(Matrix L, int M, int R, Matrix N_1, Matrix Z, int[] nservers, Matrix Q, Matrix P, Matrix PB, MatrixCell Delta, SchedStrategy[] type, double tol, int maxiter) static Ret.pfqnEstimatePfqn_conwayms.pfqn_conwayms_estimate(int M, int R, Matrix N_1, int[] nservers, Matrix Q, Matrix P, Matrix PB, MatrixCell Delta, Matrix W) static Ret.LinearizerResultPfqn_conwayms.pfqn_conwayms_forwardmva(Matrix L, int M, int R, Matrix N_1, Matrix Z, int[] nservers, SchedStrategy[] type, MatrixCell Q_1, MatrixCell P_1, Matrix PB_1, Matrix T_1) static Ret.pfqnAMVAPfqn_egflinearizer.pfqn_egflinearizer(Matrix L, Matrix N, Matrix Z, SchedStrategy[] type, double tol, int maxiter, Matrix alpha) static Ret.pfqnAMVAPfqn_gflinearizer.pfqn_gflinearizer(Matrix L, Matrix N, Matrix Z, SchedStrategy[] type, double tol, int maxiter, double alpha) General-form linearizer algorithmstatic Ret.pfqnAMVAPfqn_linearizer.pfqn_linearizer(Matrix L, Matrix N, Matrix Z, SchedStrategy[] type) static Ret.pfqnAMVAPfqn_linearizer.pfqn_linearizer(Matrix L, Matrix N, Matrix Z, SchedStrategy[] type, double tol) static Ret.pfqnAMVAPfqn_linearizer.pfqn_linearizer(Matrix L, Matrix N, Matrix Z, SchedStrategy[] type, double tol, int maxiter) Linearizer approximate mean value analysis algorithmstatic Ret.pfqnAMVAMSPfqn_linearizerms.pfqn_linearizerms(Matrix L, Matrix N, Matrix nservers) static Ret.pfqnAMVAMSPfqn_linearizerms.pfqn_linearizerms(Matrix L, Matrix N, Matrix Z, Matrix nservers) static Ret.pfqnAMVAMSPfqn_linearizerms.pfqn_linearizerms(Matrix L, Matrix N, Matrix Z, Matrix nservers, List<SchedStrategy> type) static Ret.pfqnAMVAMSPfqn_linearizerms.pfqn_linearizerms(Matrix L, Matrix N, Matrix Z, Matrix nservers, List<SchedStrategy> type, double tol, int maxiter) static Ret.pfqnAMVAPfqn_linearizermx.pfqn_linearizermx(Matrix lambda, Matrix L, Matrix N, Matrix Z, Matrix nservers, SchedStrategy[] type, double tol, int maxiter, String method) Linearizer method for mixed models with multi-server stations.static Ret.pfqnAMVAPfqn_linearizerpp.pfqn_linearizerpp(Matrix L, Matrix N, int level) static Ret.pfqnAMVAPfqn_linearizerpp.pfqn_linearizerpp(Matrix L, Matrix N, Matrix Z, int level) static Ret.pfqnAMVAPfqn_linearizerpp.pfqn_linearizerpp(Matrix L, Matrix N, Matrix Z, int level, double tol) static Ret.pfqnAMVAPfqn_linearizerpp.pfqn_linearizerpp(Matrix L, Matrix N, Matrix Z, int level, double tol, int maxiter) static Ret.pfqnAMVAPfqn_linearizerpp.pfqn_linearizerpp(Matrix L, Matrix N, Matrix Z, int level, double tol, int maxiter, int flag) static Ret.pfqnMVAstatic Ret.pfqnMVAstatic Ret.pfqnMVAMean Value Analysis (MVA) Algorithm for closed Product-Form Queueing Networks.static Ret.pfqnMVAstatic Ret.pfqnMVAGeneral purpose script to handle mixed Query Networks with multiserver nodes.static Ret.pfqnMVAPfqn_mvamx.pfqn_mvamx(Matrix lambda, Matrix D, Matrix N, Matrix mi) static Ret.pfqnMVAMean Value Analysis (MVA) method for open and mixed queueing networks with no multi-server nodes.static Ret.pfqnQdstatic Ret.pfqnQdPfqn_qd.pfqn_qd(Matrix L, Matrix N, Pfqn_qd.GammaFunction ga) static Ret.pfqnQdPfqn_qd.pfqn_qd(Matrix L, Matrix N, Pfqn_qd.GammaFunction ga, Pfqn_qd.BetaFunction be) static Ret.pfqnQdPfqn_qd.pfqn_qd(Matrix L, Matrix N, Pfqn_qd.GammaFunction ga, Pfqn_qd.BetaFunction be, Matrix Q0) Queue-Dependent (QD) approximate MVA solverstatic doublePfqn_qzgblow.pfqn_qzgblow(Matrix L, double N, double Z, int i) Computes the lower Geometric Bound (GB) for the queue length of the given closed single-class queueing networksstatic doublePfqn_qzgbup.pfqn_qzgbup(Matrix L, double N, double Z, int i) Computes the upper Geometric Bound (GB) for the queue length of the given closed single-class queueing networks.static Ret.pfqnAMVASchmidtPfqn_schmidt_amva.pfqn_schmidt(Matrix rates, Matrix N, Matrix S, Matrix v, List<SchedStrategy> sched) static Ret.pfqnAMVASchmidtPfqn_schmidt_amva.pfqn_schmidt_ext(Matrix rates, Matrix N, Matrix S, Matrix v, List<SchedStrategy> sched) static Pfqn_sqni.PfqnSqniResultstatic doublePfqn_xzabalow.pfqn_xzabalow(Matrix L, double N, double Z) Computes the low ABA for the throughput of the given closed single-class queueing networksstatic doublePfqn_xzabaup.pfqn_xzabaup(Matrix L, double N, double Z) Computes the upper ABA for the throughput of the given closed single-class queueing networksstatic doublePfqn_xzgsblow.pfqn_xzgsblow(Matrix L, double N, double Z) Computes the lower Geometric Square-Root Bound (GSB) for the throughput of the given closed single-class queueing networks.static doublePfqn_xzgsbup.pfqn_xzgsbup(Matrix L, double N, double Z) Computes the upper Geometric Square-Root Bound (GSB) for the throughput of the given closed single-class queueing networks.Constructors in jline.api.pfqn.mva with parameters of type Matrix -
Uses of Matrix in jline.api.pfqn.nc
Methods in jline.api.pfqn.nc that return MatrixModifier and TypeMethodDescriptionstatic MatrixPfqn_le_hessian.pfqn_le_hessian(Matrix L, Matrix N, Matrix u0) Auxiliary function to compute the Hessian used in the logistic expansion method.static Matrixstatic Matrix[][]Pfqn_stdf.pfqn_stdf(Matrix L, Matrix N, Matrix Z, Matrix S, Matrix fcfsNodes, Matrix rates, Matrix tset) Sojourn time distribution function at multiserver FCFS nodes (McKenna 1987 JACM).static Matrix[][]Pfqn_stdf_heur.pfqn_stdf_heur(Matrix L, Matrix N, Matrix Z, Matrix S, Matrix fcfsNodes, Matrix rates, Matrix tset) Heuristic sojourn time distribution analysis at multiserver FCFS nodes.Methods in jline.api.pfqn.nc that return types with arguments of type MatrixModifier and TypeMethodDescriptionstatic SerializableFunction<Matrix, ComplexMatrix> Pfqn_nrl.infradius_h(Matrix L, Matrix N, Matrix alpha) static SerializableFunction<Matrix, ComplexMatrix> Pfqn_nrp.infradius_hnorm(Matrix L, Matrix N, Matrix alpha) static kotlin.jvm.functions.Function1<Matrix, org.apache.commons.math3.complex.Complex> static kotlin.jvm.functions.Function1<Matrix, org.apache.commons.math3.complex.Complex> Methods in jline.api.pfqn.nc with parameters of type MatrixModifier and TypeMethodDescriptionstatic Ret.pfqnNcXQPfqn_nc.compute_norm_const(Matrix L, Matrix N, Matrix Z, SolverOptions options) static SerializableFunction<Matrix, ComplexMatrix> Pfqn_nrl.infradius_h(Matrix L, Matrix N, Matrix alpha) static SerializableFunction<Matrix, ComplexMatrix> Pfqn_nrp.infradius_hnorm(Matrix L, Matrix N, Matrix alpha) static kotlin.jvm.functions.Function1<Matrix, org.apache.commons.math3.complex.Complex> static kotlin.jvm.functions.Function1<Matrix, org.apache.commons.math3.complex.Complex> static Ret.pfqnNcstatic Ret.pfqnNcstatic doublePfqn_comom.pfqn_comom(Matrix L, Matrix N, Matrix Z, double atol) static Ret.pfqnComomrmPfqn_comomrm.pfqn_comomrm(Matrix L, Matrix N, Matrix Z, Integer m, double atol) Compute the normalizing constant of a repairmen model using COMOMstatic Ret.pfqnComomrmMsPfqn_comomrm_ms.pfqn_comomrm_ms(Matrix L, Matrix N, Matrix Z, int S) static Ret.pfqnComomrmMsPfqn_comomrm_ms.pfqn_comomrm_ms(Matrix L, Matrix N, Matrix Z, int m, int S) Compute the normalizing constant of a multiserver repairman model using CoMoM.static doublePfqn_comomrm_orig.pfqn_comomrm_orig(Matrix L, Matrix N, Matrix Z) static doublePfqn_comomrm_orig.pfqn_comomrm_orig(Matrix L, Matrix N, Matrix Z, double atol) static Ret.pfqnNcCubature method to compute the normalizing constant of a load-independent closed queueing network modelstatic Ret.pfqnNcCubature method to compute the normalizing constant of a load-independent closed queueing network modelstatic doublePfqn_grnmol.pfqn_grnmol(Matrix L, Matrix N) Compute the normalizing constant using Grundmann-Moeller quadraturestatic Ret.pfqnNcKnessl-Tier asymptotic expansion of the normalizing constant using the ray method.static doubleCompute the Laplace approximation for the log normalizing constant.static Ret.pfqnNcstatic Ret.pfqnNcLogistic expansion method to compute the normalizing constant.static Ret.pfqnLeFpiPfqn_le_fpi.pfqn_le_fpi(Matrix L, Matrix N) Fixed-point iteration used in the logistic expansion method.static Ret.pfqnLeFpiZPfqn_le_fpiZ.pfqn_le_fpiZ(Matrix L, Matrix N, Matrix Z) Fixed-point iteration used in the logistic expansion method in models with delays.static MatrixPfqn_le_hessian.pfqn_le_hessian(Matrix L, Matrix N, Matrix u0) Auxiliary function to compute the Hessian used in the logistic expansion method.static Ret.pfqnNcstatic Ret.pfqnNcstatic Ret.pfqnNcstatic Ret.pfqnNcLogistic sampling method to compute the normalizing constant.static Ret.pfqnNcstatic Ret.pfqnNcPfqn_mmint2.pfqn_mmint2(Matrix L, Matrix N, Matrix Z) static Ret.pfqnNcPfqn_mmint2_gausslaguerre.pfqn_mmint2_gausslaguerre(Matrix L, Matrix N, Matrix Z) static Ret.pfqnNcPfqn_mmint2_gausslaguerre.pfqn_mmint2_gausslaguerre(Matrix L, Matrix N, Matrix Z, int m) static Ret.pfqnNcPfqn_mmint2_gausslegendre.pfqn_mmint2_gausslegendre(Matrix L, Matrix N, Matrix Z, Integer m) Compute the normalizing constant of a repairmen model using Gauss-Legendre integration.static Ret.pfqnNcPfqn_mmsample2.pfqn_mmsample2(Matrix L, Matrix N, Matrix Z, int samples) static Ret.pfqnMomstatic Ret.pfqnNcXQstatic Ret.pfqnNcSanitizePfqn_nc_sanitize.pfqn_nc_sanitize(Matrix lambda, Matrix L, Matrix N, Matrix Z, double atol) Sanitizes product-form model parameters to avoid degeneracies.static Matrixstatic doublestatic doublestatic Ret.pfqnNcPfqn_panacea.pfqn_panacea(Matrix L, Matrix N, Matrix Z) static Ret.pfqnNcPfqn_panacea.pfqn_panacea(Matrix L, Matrix N, Matrix Z, SolverOptions options) Compute the PANACEA approximationstatic doublePfqn_pff_delay.pfqn_pff_delay(Matrix Z, Matrix n) Compute the product-form factor relatively to a Delay station.static Ret.pfqnProcomomPfqn_procomom.pfqn_procomom(Matrix L, Matrix N) static Ret.pfqnProcomomPfqn_procomom.pfqn_procomom(Matrix L, Matrix N, Matrix Z) static Ret.pfqnProcomomPfqn_procomom.pfqn_procomom(Matrix L, Matrix N, Matrix Z, double atol) static Ret.pfqnNcXQPfqn_propfair.pfqn_propfair(Matrix L, Matrix N, Matrix Z) Compute the proportionally fair allocation approximation.static Ret.pfqnRdstatic Ret.pfqnNcPfqn_recal.pfqn_recal(Matrix L, Matrix N) RECAL method to compute the normalizing constant of a load-independent closed queueing network model.static Ret.pfqnNcPfqn_recal.pfqn_recal(Matrix L, Matrix N, Matrix Z) static Ret.pfqnNcPfqn_recal.pfqn_recal(Matrix L, Matrix N, Matrix Z, Matrix m0) static Matrix[][]Pfqn_stdf.pfqn_stdf(Matrix L, Matrix N, Matrix Z, Matrix S, Matrix fcfsNodes, Matrix rates, Matrix tset) Sojourn time distribution function at multiserver FCFS nodes (McKenna 1987 JACM).static Matrix[][]Pfqn_stdf_heur.pfqn_stdf_heur(Matrix L, Matrix N, Matrix Z, Matrix S, Matrix fcfsNodes, Matrix rates, Matrix tset) Heuristic sojourn time distribution analysis at multiserver FCFS nodes. -
Uses of Matrix in jline.api.qsys
Fields in jline.api.qsys declared as MatrixMethods in jline.api.qsys that return MatrixModifier and TypeMethodDescriptionQsysRetrialResult.getPi()QsysMapDcResult.getQueueLengthDist()QsysMapPhResult.getQueueLengthDist()QsysMapPhResult.getQueueLengthMoments()QsysMapPhResult.getSojournTimeMoments()QsysMapDcResult.getWaitingTimeDist()Methods in jline.api.qsys with parameters of type MatrixModifier and TypeMethodDescriptionstatic QsysRetrialResultQsys_bmapphnn_retrial.qsys_bmapphnn_retrial(Matrix[] D, Matrix beta, Matrix S, int N, double alpha, double gamma, double p, int R) static QsysRetrialResultQsys_bmapphnn_retrial.qsys_bmapphnn_retrial(Matrix[] D, Matrix beta, Matrix S, int N, double alpha, double gamma, double p, int[] R) static QsysRetrialResultQsys_bmapphnn_retrial.qsys_bmapphnn_retrial(Matrix[] D, Matrix beta, Matrix S, int N, double alpha, double gamma, double p, int[] R, int maxLevel) static QsysRetrialResultQsys_bmapphnn_retrial.qsys_bmapphnn_retrial(Matrix[] D, Matrix beta, Matrix S, int N, double alpha, double gamma, double p, int[] R, int maxLevel, double tolerance, boolean verbose) static QsysRetrialResultQsys_bmapphnn_retrial.qsys_bmapphnn_retrial(Matrix[] D, Matrix beta, Matrix S, int N, double alpha, double gamma, double p, int R, int maxLevel) static QsysRetrialResultQsys_bmapphnn_retrial.qsys_bmapphnn_retrial(Matrix[] D, Matrix beta, Matrix S, int N, double alpha, double gamma, double p, int R, int maxLevel, double tolerance, boolean verbose) static QsysMapDcResultQsys_mapd1.qsys_mapd1(Matrix D0, Matrix D1, double s) static QsysMapDcResultQsys_mapd1.qsys_mapd1(Matrix D0, Matrix D1, double s, int maxNumComp) static QsysMapDcResultQsys_mapd1.qsys_mapd1(Matrix D0, Matrix D1, double s, int maxNumComp, int numSteps) Analyzes a MAP/D/1 queue (single server with deterministic service).static QsysMapDcResultQsys_mapdc.qsys_mapdc(Matrix D0, Matrix D1, double s, int c) static QsysMapDcResultQsys_mapdc.qsys_mapdc(Matrix D0, Matrix D1, double s, int c, int maxNumComp) static QsysMapDcResultQsys_mapdc.qsys_mapdc(Matrix D0, Matrix D1, double s, int c, int maxNumComp, int numSteps) static QsysMapDcResultQsys_mapdc.qsys_mapdc(Matrix D0, Matrix D1, double s, int c, int maxNumComp, int numSteps, int verbose) Analyzes a MAP/D/c queue (multi-server with deterministic service).static QsysMapPhResultQsys_mapg1.qsys_mapg1(Matrix D0, Matrix D1, double[] serviceMoments) static QsysMapPhResultQsys_mapg1.qsys_mapg1(Matrix D0, Matrix D1, double[] serviceMoments, int numQLMoms) static QsysMapPhResultQsys_mapg1.qsys_mapg1(Matrix D0, Matrix D1, double[] serviceMoments, int numQLMoms, int numQLProbs) static QsysMapPhResultQsys_mapg1.qsys_mapg1(Matrix D0, Matrix D1, double[] serviceMoments, int numQLMoms, int numQLProbs, int numSTMoms) Analyzes a MAP/G/1 queue.static QsysMapPhResultQsys_mapg1.qsys_mapg1(Matrix D0, Matrix D1, double meanService, double cvService) Analyzes a MAP/G/1 queue with service time specified as mean and CV.static QsysMapPhResultQsys_mapm1.qsys_mapm1(Matrix D0, Matrix D1, double mu) static QsysMapPhResultQsys_mapm1.qsys_mapm1(Matrix D0, Matrix D1, double mu, int maxNumComp) Analyzes a MAP/M/1 queue (single server with exponential service).static QsysMapPhResultQsys_mapmap1.qsys_mapmap1(Matrix C0, Matrix C1, Matrix D0, Matrix D1) static QsysMapPhResultQsys_mapmap1.qsys_mapmap1(Matrix C0, Matrix C1, Matrix D0, Matrix D1, int numQLMoms, int numQLProbs, int numSTMoms) Analyzes a MAP/MAP/1 queue.static QsysMapPhResultQsys_mapmc.qsys_mapmc(Matrix D0, Matrix D1, double mu, int c) static QsysMapPhResultQsys_mapmc.qsys_mapmc(Matrix D0, Matrix D1, double mu, int c, String mode, int maxNumComp) static QsysMapPhResultQsys_mapmc.qsys_mapmc(Matrix D0, Matrix D1, double mu, int c, String mode, int maxNumComp, int verbose) Analyzes a MAP/M/c queue (multi-server with exponential service).static QsysMapPhResultQsys_mapph1.qsys_mapph1(Matrix D0, Matrix D1, Matrix sigma, Matrix S) static QsysMapPhResultQsys_mapph1.qsys_mapph1(Matrix D0, Matrix D1, Matrix sigma, Matrix S, int numQLMoms) static QsysMapPhResultQsys_mapph1.qsys_mapph1(Matrix D0, Matrix D1, Matrix sigma, Matrix S, int numQLMoms, int numQLProbs) static QsysMapPhResultQsys_mapph1.qsys_mapph1(Matrix D0, Matrix D1, Matrix sigma, Matrix S, int numQLMoms, int numQLProbs, int numSTMoms) Analyzes a MAP/PH/1 queue.static Ret.qsys_prioQsys_mg1_fb.qsys_mg1_fb(Matrix lambda, Matrix mu, Matrix cs) Analyzes an M/G/1 queueing system with FB (Feedback/LAS) scheduling.static Ret.qsys_prioQsys_mg1_lrpt.qsys_mg1_lrpt(Matrix lambda, Matrix mu, Matrix cs) Analyzes an M/G/1 queueing system with LRPT (Longest Remaining Processing Time) scheduling.static Ret.qsys_prioQsys_mg1_prio.qsys_mg1_prio(Matrix lambda, Matrix mu, Matrix cs) Analyzes an M/G/1 queueing system with non-preemptive (Head-of-Line) priorities.static Ret.qsys_prioQsys_mg1_psjf.qsys_mg1_psjf(Matrix lambda, Matrix mu, Matrix cs) Analyzes an M/G/1 queueing system with PSJF (Preemptive Shortest Job First) scheduling.static Ret.qsys_prioQsys_mg1_setf.qsys_mg1_setf(Matrix lambda, Matrix mu, Matrix cs) Analyzes an M/G/1 queueing system with SETF (non-preemptive FB) scheduling.static Ret.qsys_prioQsys_mg1_srpt.qsys_mg1_srpt(Matrix lambda, Matrix mu, Matrix cs) Analyzes an M/G/1 queueing system with SRPT (Shortest Remaining Processing Time) scheduling.static QsysMapDcResultAnalyzes a PH/D/c queue.static QsysMapPhResultAnalyzes a PH/PH/1 queue with exponential service (simplified E/M/1).static QsysMapPhResultAnalyzes a PH/M/c queue.static QsysMapPhResultQsys_phph1.qsys_phph1(Matrix alpha, Matrix T, Matrix beta, Matrix S) static QsysMapPhResultQsys_phph1.qsys_phph1(Matrix alpha, Matrix T, Matrix beta, Matrix S, int numQLMoms) static QsysMapPhResultQsys_phph1.qsys_phph1(Matrix alpha, Matrix T, Matrix beta, Matrix S, int numQLMoms, int numQLProbs) static QsysMapPhResultQsys_phph1.qsys_phph1(Matrix alpha, Matrix T, Matrix beta, Matrix S, int numQLMoms, int numQLProbs, int numSTMoms) Analyzes a PH/PH/1 queue.Constructors in jline.api.qsys with parameters of type MatrixModifierConstructorDescriptionQsysMapDcResult(double meanQueueLength, double meanWaitingTime, double meanSojournTime, double utilization, Matrix queueLengthDist, Matrix waitingTimeDist, String analyzer) QsysMapPhResult(double meanQueueLength, double meanWaitingTime, double meanSojournTime, double utilization, Matrix queueLengthDist, Matrix queueLengthMoments, Matrix sojournTimeMoments, String analyzer) QsysRetrialResult(double L_orbit, double N_server, double L_system, double Utilization, double Throughput, double P_idle, double P_empty_orbit, double P_empty_system, Matrix pi, int truncLevel, String analyzer) -
Uses of Matrix in jline.api.rl
Fields in jline.api.rl declared as MatrixModifier and TypeFieldDescriptionfinal MatrixRlTdAgentGeneral.ApproximationResult.coefficientsfinal MatrixRlTdAgentGeneral.ApproximationResult.Xfinal MatrixRlTdAgentGeneral.HashmapResult.Xfinal MatrixRlTdAgentGeneral.ApproximationResult.Yfinal MatrixRlTdAgentGeneral.HashmapResult.YConstructors in jline.api.rl with parameters of type MatrixModifierConstructorDescriptionApproximationResult(Matrix X, Matrix Y, Matrix coefficients) HashmapResult(Matrix X, Matrix Y) -
Uses of Matrix in jline.api.sn
Methods in jline.api.sn that return MatrixModifier and TypeMethodDescriptionstatic MatrixSnGetArvRFromTput.snGetArvRFromTput(NetworkStruct sn, Matrix TN, AvgHandle TH) Calculates the average arrival rates at each station from the network throughputs.static MatrixSnGetNodeArvRFromTput.snGetNodeArvRFromTput(NetworkStruct sn, Matrix TN, AvgHandle TH, Matrix AN) static MatrixSnGetNodeTputFromTput.snGetNodeTputFromTput(NetworkStruct sn, Matrix TN, AvgHandle TH, Matrix ANn) static MatrixSnGetResidTFromRespT.snGetResidTFromRespT(NetworkStruct sn, Matrix RNclass, AvgHandle WH) Calculates the residence times at each station from the response times.Methods in jline.api.sn that return types with arguments of type MatrixModifier and TypeMethodDescriptionSnFjVisitsSpn.snFjVisitsSpn(NetworkStruct sn) Compute fork-join node visit ratios via auxiliary SPN models.static Map<StatefulNode, Matrix> SnGetStateAggr.snGetStateAggr(NetworkStruct sn) Aggregates the state of the network.SnRtnodesToRtorig.snRtnodesToRtorig(NetworkStruct sn) Converts routing matrices from nodes to original format, specifically handling class switching nodes.SnRtnodesToRtorig.snRtnodesToRtorig(NetworkStruct sn) Converts routing matrices from nodes to original format, specifically handling class switching nodes.Methods in jline.api.sn with parameters of type MatrixModifier and TypeMethodDescriptionSnDeaggregateChainResults.snDeaggregateChainResults(NetworkStruct sn, Matrix Lchain, Matrix ST, Matrix STchain, Matrix Vchain, Matrix alpha, Matrix Qchain, Matrix Uchain, Matrix Rchain, Matrix Tchain, Matrix Cchain, Matrix Xchain) Calculate class-based performance metrics for a queueing network based on performance measures of its chains.static MatrixSnGetArvRFromTput.snGetArvRFromTput(NetworkStruct sn, Matrix TN, AvgHandle TH) Calculates the average arrival rates at each station from the network throughputs.static MatrixSnGetNodeArvRFromTput.snGetNodeArvRFromTput(NetworkStruct sn, Matrix TN, AvgHandle TH, Matrix AN) static MatrixSnGetNodeTputFromTput.snGetNodeTputFromTput(NetworkStruct sn, Matrix TN, AvgHandle TH, Matrix ANn) static MatrixSnGetResidTFromRespT.snGetResidTFromRespT(NetworkStruct sn, Matrix RNclass, AvgHandle WH) Calculates the residence times at each station from the response times.static NetworkStructSnRefreshVisits.snRefreshVisits(NetworkStruct sn, Matrix chains, Matrix rt, Matrix rtnodes) static NetworkStructSnSetArrival.snSetArrivalBatch(NetworkStruct sn, Matrix rates) static NetworkStructSnSetArrival.snSetArrivalBatch(NetworkStruct sn, Matrix rates, Matrix scvs) static NetworkStructSnSetArrival.snSetArrivalBatch(NetworkStruct sn, Matrix rates, Matrix scvs, ModifyMode mode) static NetworkStructSnSetArrival.snSetArrivalBatch(NetworkStruct sn, Matrix rates, Matrix scvs, ModifyMode mode, ValidationLevel validation) static NetworkStructSnSetArrival.snSetArrivalBatch(NetworkStruct sn, Matrix rates, Matrix scvs, ModifyMode mode, ValidationLevel validation, boolean autoRefresh) Sets arrival rates for multiple classes in a single operation.static NetworkStructSnSetPopulation.snSetPopulationBatch(NetworkStruct sn, Matrix njobs) static NetworkStructSnSetPopulation.snSetPopulationBatch(NetworkStruct sn, Matrix njobs, ModifyMode mode) static NetworkStructSnSetPopulation.snSetPopulationBatch(NetworkStruct sn, Matrix njobs, ModifyMode mode, ValidationLevel validation) static NetworkStructSnSetPopulation.snSetPopulationBatch(NetworkStruct sn, Matrix njobs, ModifyMode mode, ValidationLevel validation, boolean autoRefresh) Sets populations for multiple classes in a single operation.static NetworkStructSnSetPriority.snSetPriorityBatch(NetworkStruct sn, Matrix priorities) static NetworkStructSnSetPriority.snSetPriorityBatch(NetworkStruct sn, Matrix priorities, ModifyMode mode) static NetworkStructSnSetPriority.snSetPriorityBatch(NetworkStruct sn, Matrix priorities, ModifyMode mode, ValidationLevel validation) Sets priorities for multiple classes in a single operation.static NetworkStructSnSetRouting.snSetRoutingMatrix(NetworkStruct sn, Matrix rt) static NetworkStructSnSetRouting.snSetRoutingMatrix(NetworkStruct sn, Matrix rt, ModifyMode mode) static NetworkStructSnSetRouting.snSetRoutingMatrix(NetworkStruct sn, Matrix rt, ModifyMode mode, ValidationLevel validation) static NetworkStructSnSetRouting.snSetRoutingMatrix(NetworkStruct sn, Matrix rt, ModifyMode mode, ValidationLevel validation, boolean autoRefresh) Sets the entire routing matrix for stateful nodes.static NetworkStructSnSetRouting.snSetRoutingNodesMatrix(NetworkStruct sn, Matrix rtnodes) static NetworkStructSnSetRouting.snSetRoutingNodesMatrix(NetworkStruct sn, Matrix rtnodes, ModifyMode mode) static NetworkStructSnSetRouting.snSetRoutingNodesMatrix(NetworkStruct sn, Matrix rtnodes, ModifyMode mode, ValidationLevel validation) static NetworkStructSnSetRouting.snSetRoutingNodesMatrix(NetworkStruct sn, Matrix rtnodes, ModifyMode mode, ValidationLevel validation, boolean autoRefresh) Sets the entire routing matrix for all nodes.static NetworkStructSnSetServers.snSetServersBatch(NetworkStruct sn, Matrix nServers) static NetworkStructSnSetServers.snSetServersBatch(NetworkStruct sn, Matrix nServers, ModifyMode mode) static NetworkStructSnSetServers.snSetServersBatch(NetworkStruct sn, Matrix nServers, ModifyMode mode, ValidationLevel validation) Sets the number of servers for multiple stations in a single operation.static NetworkStructSnSetService.snSetServiceBatch(NetworkStruct sn, Matrix rates) static NetworkStructSnSetService.snSetServiceBatch(NetworkStruct sn, Matrix rates, Matrix scvs) static NetworkStructSnSetService.snSetServiceBatch(NetworkStruct sn, Matrix rates, Matrix scvs, ModifyMode mode) static NetworkStructSnSetService.snSetServiceBatch(NetworkStruct sn, Matrix rates, Matrix scvs, ModifyMode mode, ValidationLevel validation) static NetworkStructSnSetService.snSetServiceBatch(NetworkStruct sn, Matrix rates, Matrix scvs, ModifyMode mode, ValidationLevel validation, boolean autoRefresh) Sets service rates for multiple station-class pairs in a single operation. -
Uses of Matrix in jline.api.trace
Fields in jline.api.trace declared as MatrixModifier and TypeFieldDescriptionfinal MatrixMtrace_summary.MtraceSummary.B1final MatrixMtrace_summary.MtraceSummary.B2final MatrixMtrace_summary.MtraceSummary.C1final MatrixMtrace_summary.MtraceSummary.C2final MatrixMtrace_summary.MtraceSummary.F1final MatrixMtrace_summary.MtraceSummary.F2final MatrixMtrace_summary.MtraceSummary.Pabfinal MatrixMtrace_summary.MtraceSummary.PcMethods in jline.api.trace that return MatrixModifier and TypeMethodDescriptionstatic Matrix[][]Mtrace_cov.mtrace_cov(double[] T, int[] A) Computes the covariance matrix for multi-type traces.static MatrixMtrace_cross_moment.mtrace_cross_moment(double[] T, int[] L, int k) Computes the k-th order moment of the inter-arrival time between an event of class i and an event of class j, for all possible pairs of classes.static MatrixMtrace_forward_moment.mtrace_forward_moment(double[] T, int[] A, int[] orders) static MatrixMtrace_forward_moment.mtrace_forward_moment(double[] T, int[] A, int[] orders, int norm) Computes the forward moments of a marked trace.static MatrixMtrace_iat2counts.mtrace_iat2counts(double[] T, int[] A, double scale) Computes the per-class counting processes of T, i.e., the counts after "scale" units of time from an arrival.static MatrixMtrace_joint.mtrace_joint(double[] T, int[] A, int[] i) Given a multi-class trace, computes the empirical class-dependent joint moments that estimate E[ ( X^(a)_j )^i(1) (X^(a)_(j+l) )^i(2) ] for all classes a.static MatrixMtrace_mean.mtrace_mean(double[] trace, int ntypes, int[] type) Computes the mean of a trace, divided by types.static MatrixMtrace_moment.mtrace_moment(double[] T, int[] A, int[] orders) static MatrixMtrace_moment.mtrace_moment(double[] T, int[] A, int[] orders, int after) static MatrixMtrace_moment.mtrace_moment(double[] T, int[] A, int[] orders, int after, int norm) Computes the empirical class-dependent moments of a multi-class trace.static MatrixMtrace_moment_simple.mtrace_moment_simple(double[] T, int[] L, int k) Computes the k-th order moment of the inter-arrival time between an event of class i and an event of class j, for all possible pairs of classes.static MatrixMtrace_pc.mtrace_pc(double[] T, int[] C) Computes the probabilities of arrival for each class.static MatrixMtrace_sigma.mtrace_sigma(double[] T, int[] L) Computes the empirical probability of observing a specific 2-element sequence of events, i.e.Constructors in jline.api.trace with parameters of type Matrix -
Uses of Matrix in jline.api.wf
Fields in jline.api.wf declared as MatrixMethods in jline.api.wf that return MatrixModifier and TypeMethodDescriptionWf_pattern_updater.ServiceParameters.getAlpha()Wf_analyzer.WorkflowRepresentation.getLinkMatrix()Wf_pattern_updater.UpdatedWorkflow.getLinkMatrix()Wf_pattern_updater.ServiceParameters.getT()Methods in jline.api.wf with parameters of type MatrixModifier and TypeMethodDescriptionstatic List<Wf_branch_detector.BranchPattern> Wf_branch_detector.detectBranches(Matrix linkMatrix, List<Integer> serviceNodes, List<Integer> joinNodes) Wf_loop_detector.detectLoops(Matrix linkMatrix, List<Integer> serviceNodes, List<Integer> routerNodes) Wf_loop_detector.detectLoops(Matrix linkMatrix, List<Integer> serviceNodes, List<Integer> routerNodes, List<Integer> joinNodes) Wf_parallel_detector.detectParallel(Matrix linkMatrix, List<Integer> serviceNodes, List<Integer> forkNodes, List<Integer> joinNodes) Detect parallel patterns in a workflow network.Wf_sequence_detector.detectSequences(Matrix linkMatrix, List<Integer> serviceNodes) Detect sequence patterns in a workflow network.static doubleWf_loop_detector.getLoopProbability(int serviceNode, Matrix linkMatrix, List<Integer> routerNodes) Wf_loop_detector.getLoopStats(List<Integer> loopNodes, Matrix linkMatrix, List<Integer> routerNodes) Wf_pattern_updater.getUpdateStats(Matrix originalMatrix, Wf_pattern_updater.UpdatedWorkflow updatedWorkflow) Wf_pattern_updater.updatePatterns(Matrix linkMatrix, List<Integer> serviceNodes, List<Integer> forkNodes, List<Integer> joinNodes, List<Integer> routerNodes, Map<Integer, Wf_pattern_updater.ServiceParameters> serviceParams) static booleanWf_branch_detector.validateBranchPattern(Wf_branch_detector.BranchPattern pattern, Matrix linkMatrix) static booleanWf_loop_detector.validateLoopPattern(int loopNode, Matrix linkMatrix, List<Integer> routerNodes) static booleanWf_parallel_detector.validateParallelPattern(List<Integer> pattern, Matrix linkMatrix, List<Integer> forkNodes, List<Integer> joinNodes) static booleanWf_sequence_detector.validateSequence(List<Integer> sequence, Matrix linkMatrix) Validate that a sequence chain is properly connected.Constructors in jline.api.wf with parameters of type MatrixModifierConstructorDescriptionServiceParameters(Matrix alpha, Matrix T) UpdatedWorkflow(Matrix linkMatrix, Map<Integer, Wf_pattern_updater.ServiceParameters> serviceParameters) WorkflowRepresentation(Matrix linkMatrix, List<Integer> serviceNodes, List<Integer> forkNodes, List<Integer> joinNodes, List<Integer> routerNodes, Map<Integer, Wf_pattern_updater.ServiceParameters> serviceParameters) -
Uses of Matrix in jline.bench
Methods in jline.bench that return MatrixModifier and TypeMethodDescriptionstatic MatrixBenchmarkUtils.randGallery(int rows, int cols, int seed) Generate random gallery matrix (similar to MATLAB's randgallery) This creates a random matrix with values in [0,1]Methods in jline.bench with parameters of type MatrixModifier and TypeMethodDescriptionstatic doubleCalculate mean error on sum for queue length metrics Returns mean absolute error relative to sum of each column Similar to MATLAB: mean(abs(exact-approx))/sum(exact)static doubleCalculate Mean Absolute Percentage Error (MAPE) Wrapper for Utils.mape for benchmark compatibilitystatic doubleBenchmarkUtils.maxErrorOnSum(Matrix approx, Matrix exact) Calculate maximum error on sum for queue length metrics Returns max absolute error relative to sum of each column Similar to MATLAB: max(abs(exact-approx))/sum(exact)static doubleBenchmarkUtils.utilizationError(Matrix approx, Matrix exact, Network model) Calculate utilization error for benchmarks Excludes delay stations (row 0) from comparison -
Uses of Matrix in jline.examples
Methods in jline.examples that return MatrixModifier and TypeMethodDescriptionstatic MatrixNetworkGeneratorExample.starTopology(int n) Custom topology function - creates a star topology where node 0 is connected to all other nodes -
Uses of Matrix in jline.gen
Modifier and TypeMethodDescriptionstatic MatrixNetworkGenerator.cyclicGraph(int numVertices) Generate a cyclic graph topologystatic MatrixNetworkGenerator.randGraph(int numVertices) Generate a random strongly connected graph topology This implements the algorithm from MATLAB's randGraph functionModifier and TypeMethodDescriptionvoidNetworkGenerator.setTopologyFcn(Function<Integer, Matrix> fcn) ModifierConstructorDescriptionNetworkGenerator(String schedStrat, String routingStrat, String distribution, String cclassJobLoad, boolean hasVaryingServiceRates, boolean hasMultiServerQueues, boolean hasRandomCSNodes, boolean hasMultiChainCS, boolean initializeStates, Function<Integer, Matrix> topologyFcn) Constructor with all options including state initializationNetworkGenerator(String schedStrat, String routingStrat, String distribution, String cclassJobLoad, boolean hasVaryingServiceRates, boolean hasMultiServerQueues, boolean hasRandomCSNodes, boolean hasMultiChainCS, Function<Integer, Matrix> topologyFcn) Constructor with custom settings -
Uses of Matrix in jline.inference.api
Fields in jline.inference.api declared as MatrixModifier and TypeFieldDescriptionfinal MatrixInfer_fluid_ps_rt_likelihood.FluidPsRtResult.augPhasesfinal MatrixInfer_fluid_ps_rt_likelihood.FluidPsRtResult.qIndicesMethods in jline.inference.api that return MatrixModifier and TypeMethodDescriptionstatic MatrixInfer_compute_ql_at_arrival.infer_compute_ql_at_arrival(double[] at, int[] atJobid, double[] rt, int[] rtJobid, int[] classVec, int R) Compute per-class queue lengths at arrival.static MatrixInfer_qmle.infer_qmle(Matrix Q, double[] N, double[] Z) Quick Maximum Likelihood Estimation closed-form formula.Methods in jline.inference.api that return types with arguments of type MatrixModifier and TypeMethodDescriptionInfer_get_qlen_arrival.infer_get_qlen_arrival(double[][][] data, int K) Compute queue lengths at arrival from legacy cell data format.Methods in jline.inference.api with parameters of type MatrixModifier and TypeMethodDescriptionstatic doubleInfer_fluid_ps_rt_likelihood.infer_fluid_ps_rt_solve(Infer_fluid_ps_rt_likelihood.FluidPsRtResult result, Matrix y0Levels, double Rsampled, int taggedClass) static double[]Infer_fmlps.infer_fmlps(Network model, Queue node, double[] rt, int[] classVec, Matrix ql, int W) FMLPS demand estimation using fluid-based likelihood.static double[]Infer_minps.infer_minps(Network model, Queue node, double[] rt, int[] classVec, Matrix ql) MINPS demand estimation method.static double[]Infer_mlps.infer_mlps(Network model, Queue node, double[] rt, int[] classVec, Matrix ql) static MatrixInfer_qmle.infer_qmle(Matrix Q, double[] N, double[] Z) Quick Maximum Likelihood Estimation closed-form formula.static double[]Regression for Processor Sharing (RPS) demand estimation.Constructors in jline.inference.api with parameters of type MatrixModifierConstructorDescriptionFluidPsRtResult(org.apache.commons.math3.ode.FirstOrderDifferentialEquations ode, Matrix qIndices, Matrix augPhases, int stateSize, int refIdx, int newK) -
Uses of Matrix in jline.inference.lang
Methods in jline.inference.lang that return Matrix -
Uses of Matrix in jline.inference.util
Methods in jline.inference.util that return MatrixModifier and TypeMethodDescriptionstatic MatrixSolve the NNLS problem: min ||Ax - b||^2 subject to x >= 0.Methods in jline.inference.util that return types with arguments of type MatrixModifier and TypeMethodDescriptionQuadratic program solver with non-negative constraints.Methods in jline.inference.util with parameters of type Matrix -
Uses of Matrix in jline.io
Modifier and TypeFieldDescriptionRet.snGetDemands.alphaRet.snToAG.APRet.pfqnProcomom2.BRet.lossnErlangFP.blockProbRet.pfqnFnc.cRet.pfqnAMVA.CRet.pfqnAMVAMS.CRet.pfqnAMVASchmidt.CWaiting time matrix (M x R)Ret.snDeaggregateChainResults.CRet.pfqnAB.CNWaiting time matrix (M x R)Ret.pfqnSchmidt.CNWaiting time matrix (M x R)final MatrixRet.pfqnLeFpi.dfinal MatrixRet.pfqnLeFpiZ.dRet.snGetDemands.DRet.snGetProductFormParams.DRet.snGetDemands.DchainRet.pfqnMVALDMXEC.ERet.pfqnMVALDMXEC.ECRet.pfqnMVALDMXEC.EprimeRet.npfqnNonexpApprox.etaRet.SampleResult.eventEvent sequence corresponding to the state trajectory.Ret.pfqnProcomom2.FRet.FJApprox.fjclassmapRet.FJApprox.fjforkmapRet.cacheGamma.gammaRet.npfqnNonexpApprox.gammaRet.getHashOrAddResult.hashidRet.pfqnNcSanitize.LRet.pfqnNcSanitize.lambdaRet.snGetProductFormParams.lambdaRet.pfqnComomrm.lGbasisRet.pfqnMVALDMXEC.LoRet.lossnErlangFP.lossProbRet.pfqnFnc.muRet.snGetProductFormParams.muRet.pfqnNcSanitize.NRet.snGetProductFormParams.NRet.snGetDemands.NchainRet.npfqnNonexpApprox.nserversRet.FJsortForks.outerForksRet.afterEventHashedOrAddResult.outhashRet.afterEventHashedOrAddResult.outprobfinal MatrixRet.EventResult.outprobRet.afterEventHashedOrAddResult.outratefinal MatrixRet.EventResult.outratefinal MatrixRet.EventResult.outspaceRet.LinearizerResult.PMatrix[]Ret.pfqnLinearizerMSEstimate.P_1Ret.FJsortForks.parentForksRet.LinearizerResult.PBfinal MatrixRet.pfqnEstimate.PB_1Ret.pfqnLinearizerMSEstimate.PB_1Ret.pfqnMVALDMX.PcRet.cacheMVA.piRet.pfqnMVALD.piRet.cacheMVA.pi0Ret.cacheXiFp.pi0Ret.cacheMVA.pijRet.cacheXiFp.pijRet.pfqnProcomom2.pkRet.pfqnProcomom.PrRet.pfqnComomrmLd.probRet.pfqnComomrmMs.probRet.ProbabilityResult.probabilityThe probability value(s).Ret.snToAG.processMapRet.LinearizerResult.QRet.pfqnAMVA.QRet.pfqnAMVAMS.QRet.pfqnAMVASchmidt.QQueue length matrix (M x R)Ret.pfqnMom.QRet.pfqnMVA.QRet.pfqnMVALD.QRet.pfqnMVALDMX.QRet.pfqnNcXQ.QRet.pfqnProcomom.QRet.pfqnQd.QRet.snDeaggregateChainResults.QMatrix[]Ret.pfqnLinearizerEstimate.Q_1Matrix[]Ret.pfqnLinearizerMSEstimate.Q_1Ret.lossnErlangFP.qLenRet.pfqnAB.QNQueue length matrix (M x R)Ret.pfqnSchmidt.QNQueue length matrix (M x R)Ret.pfqnAMVA.RRet.pfqnAMVAMS.RRet.pfqnMVA.RRet.pfqnMVALD.RRet.pfqnMVALDMX.RRet.snDeaggregateChainResults.RMatrix[][]Ret.snToAG.RRet.snGetDemands.refstatchainRet.npfqnNonexpApprox.rhoRet.pfqnAB.RNResponse time matrix (M x R)Ret.pfqnSchmidt.RNResponse time matrix (M x R)Ret.SVD.sRet.snGetProductFormParams.SRet.npfqnNonexpApprox.scvaRet.snGetDemands.SCVchainRet.npfqnNonexpApprox.scvsRet.SpectralDecomposition.spectrumRet.reachableSpaceGeneratorResult.SShRet.reachableSpaceGeneratorResult.SSqRet.npfqnNonexpApprox.STRet.ProbabilityResult.stateThe state specification for which the probability was computed.Ret.snGetDemands.STchainRet.SampleResult.tTime points for the sampled trajectory.Ret.LinearizerResult.TRet.pfqnAMVA.TRet.snDeaggregateChainResults.Tfinal MatrixRet.pfqnEstimate.T_1Ret.pfqnLinearizerEstimate.T_1Ret.DistributionResult.timePointsTime points for transient distributions.Ret.pfqnAB.TNThroughput matrix (M x R)Ret.pfqnSchmidt.TNThroughput matrix (M x R)Ret.cacheMVA.ufinal MatrixRet.pfqnLeFpi.ufinal MatrixRet.pfqnLeFpiZ.uRet.SVD.uRet.pfqnAMVA.URet.pfqnAMVAMS.URet.pfqnAMVASchmidt.UUtilization matrix (M x R)Ret.pfqnMVA.URet.pfqnMVALD.URet.pfqnMVALDMX.URet.pfqnQd.URet.snDeaggregateChainResults.URet.pfqnAB.UNUtilization matrix (M x R)Ret.pfqnSchmidt.UNUtilization matrix (M x R)Ret.SVD.vRet.snGetProductFormParams.VRet.Eigs.valuesRet.snGetDemands.VchainRet.Eigs.vectorsRet.LinearizerResult.Wstatic MatrixRet.qsys_prio.WRet.cacheMVA.xRet.LinearizerResult.XRet.pfqnAMVA.XRet.pfqnAMVAMS.XRet.pfqnAMVASchmidt.XSystem throughput vector (1 x R)Ret.pfqnMom.XRet.pfqnMVA.XRet.pfqnMVALD.XRet.pfqnMVALDMX.XRet.pfqnNcXQ.XRet.pfqnQd.XRet.snDeaggregateChainResults.XRet.cacheSpm.xiRet.cacheXiFp.xiRet.pfqnAB.XNSystem throughput vector (1 x R)Ret.pfqnSchmidt.XNSystem throughput vector (1 x R)Ret.pfqnNcSanitize.ZRet.snGetDemands.ZRet.snGetProductFormParams.ZModifier and TypeFieldDescriptionRet.DistributionResult.cdfDataThe CDF data organized as a cell array [stations x classes].Ret.pfqnSchmidt.PNState probabilities per stationRet.pfqnProcomom2.TModifier and TypeMethodDescriptionRet.DistributionResult.getCdf(int station, int jobClass) Gets the CDF for a specific station and class.Ret.ProbabilityResult.getProbabilityMatrix()Gets the probability matrix.Ret.SampleResult.getStateMatrix()Gets the state trajectory as a matrix (for single-node sampling).Modifier and TypeMethodDescriptionRet.DistributionResult.getAllCdfData()Gets the complete CDF data structure.Ret.SampleResult.getSystemStateList()Gets the system state trajectories as a list of matrices (for system-wide sampling).Modifier and TypeMethodDescriptionvoidSets the CDF for a specific station and class.static Ret.LinearizerResultModifierConstructorDescriptionafterEventHashedOrAddResult(Matrix outhash, Matrix outrate, Matrix outprob, NetworkStruct sn) cacheGamma(Matrix gamma, int u, int n, int h) Constructor for initializing the cacheGammaLpReturn object.Constructor for initializing the cacheMVAReturn object.cacheRayInt(double Z, double lZ, Matrix xi) Deprecated.Constructor for initializing the cacheSpmReturn object.Creates a new cacheXiFp result object.DistributionResult(int numStations, int numClasses, String distributionType, Matrix timePoints) Constructor for transient distributions.EventResult(Matrix outspace, Matrix outrate, Matrix outprob) FJApprox(Network nonfjmodel, Matrix fjclassmap, Matrix fjforkmap, Map<Integer, Integer> fj_auxiliary_delays, Map<Integer, Integer> fanout) FJsortForks(Matrix outerForks, Matrix parentForks) getHashOrAddResult(Matrix hashid, NetworkStruct sn) LinearizerResult(Matrix Q, Matrix W, Matrix T) LinearizerResult(Matrix Q, Matrix W, Matrix T, int iter) lossnErlangFP(Matrix q, Matrix l, Matrix b, int n) npfqnNonexpApprox(Matrix ST, Matrix gamma, Matrix nservers, Matrix rho, Matrix scva, Matrix scvs, Matrix eta) pfqnAB(Matrix QN, Matrix UN, Matrix RN, Matrix TN, Matrix CN, Matrix XN, String method, int iter, double runtime) pfqnComomrm(double lG, Matrix lGbasis) pfqnComomrmLd(double GN, double lG, Matrix prob) pfqnComomrmMs(double G, double lG, Matrix prob) pfqnEstimate(MatrixCell Q_1, MatrixCell P_1, Matrix PB_1, Matrix T_1) pfqnLeFpiZ(Matrix u, double v, Matrix d) pfqnLinearizerEstimate(Matrix[] Q_1, Matrix T_1) pfqnLinearizerMSEstimate(Matrix[] Q_1, Matrix[] P_1, Matrix PB_1) pfqnMom(Matrix X, Matrix Q, org.apache.commons.math3.fraction.BigFraction G, double lG, org.apache.commons.math3.fraction.BigFraction[] g, org.apache.commons.math3.fraction.BigFraction[] g_1) pfqnMVALD(Matrix XN, Matrix QN, Matrix UN, Matrix RN, List<Double> lG, boolean isNumStable, Matrix pi) pfqnMVALDMXEC(Matrix EC, Matrix E, Matrix Eprime, Matrix Lo) pfqnNcSanitize(Matrix lambda, Matrix L, Matrix N, Matrix Z, double lGremaind) pfqnProcomom(Matrix Pr, Matrix Q) pfqnSchmidt(Matrix QN, Matrix UN, Matrix RN, Matrix TN, Matrix CN, Matrix XN, List<Matrix> PN, String method, int iter, double runtime) ProbabilityResult(Matrix probability) Constructor for matrix probability results.Constructs a qsys_prio return object.reachableSpaceGeneratorResult(Matrix SSq, Matrix SSh, NetworkStruct sn) SampleResult(String handle, Matrix t, List<Matrix> systemState, Matrix event, boolean isAggregate, int numEvents) Constructor for system-wide sampling results.SampleResult(String handle, Matrix t, Matrix state, Matrix event, boolean isAggregate, Integer nodeIndex, int numEvents) Constructor for single-node sampling results.snGetDemands(Matrix D, Matrix Z) snGetDemands(Matrix Dchain, Matrix STchain, Matrix Vchain, Matrix alpha, Matrix Nchain, Matrix SCVchain, Matrix refstatchain) snGetDemands(Matrix D, Matrix Z, Matrix Dchain, Matrix STchain, Matrix Vchain, Matrix alpha, Matrix Nchain, Matrix SCVchain, Matrix refstatchain) ModifierConstructorDescriptionpfqnSchmidt(Matrix QN, Matrix UN, Matrix RN, Matrix TN, Matrix CN, Matrix XN, List<Matrix> PN, String method, int iter, double runtime) SampleResult(String handle, Matrix t, List<Matrix> systemState, Matrix event, boolean isAggregate, int numEvents) Constructor for system-wide sampling results. -
Uses of Matrix in jline.io.tikz
Fields in jline.io.tikz declared as Matrix -
Uses of Matrix in jline.lang
Fields in jline.lang declared as MatrixModifier and TypeFieldDescriptionModelAdapter.DeaggInfo.alphaNetworkStruct.capNetwork.routingMatrixReturn.chainsNetworkStruct.chainsNetworkStruct.classcapNetworkStruct.classdeadlineNetworkStruct.classprioprotected MatrixChain.completesNetworkStruct.connmatrixNetworkStruct.csmaskNetworkStruct.fjNetworkStruct.immfeedNetworkStruct.isCatastropheNetworkStruct.issignalNetworkStruct.isslcNetworkStruct.isstatedepNetworkStruct.isstatefulNetworkStruct.isstationModelAdapter.DeaggInfo.lambdaChainModelAdapter.DeaggInfo.LchainNetwork.routingMatrixReturn.linksmatNetworkStruct.lldscalingModelAdapter.DeaggInfo.Nchainprotected MatrixChain.njobsNetworkStruct.njobsNetworkStruct.nodeToStatefulNetworkStruct.nodeToStationNetworkStruct.nserversNetworkStruct.nservertypesNumber of server types per station.NetworkStruct.nvarsNetworkStruct.phasesNetworkStruct.phaseshiftNetworkStruct.phasesszEnvironment.probEnvEnvironment.probOrigNetworkStruct.ratesNetworkStruct.refclassModelAdapter.DeaggInfo.refstatNetworkStruct.refstatModelAdapter.DeaggInfo.refstatchainNetworkStruct.regionruleNetworkStruct.regionszNetworkStruct.regionweightNetwork.routingMatrixReturn.rtNetworkStruct.rtNetwork.routingMatrixReturn.rtnodesNetworkStruct.rtnodesNetworkStruct.schedparamNetworkStruct.scvModelAdapter.DeaggInfo.SCVchainprotected MatrixEvent.stateModeEvent.stateNetworkStruct.statefulToNodeNetworkStruct.statefulToStationNetworkStruct.stationToNodeNetworkStruct.stationToStatefulModelAdapter.DeaggInfo.STchainNetworkStruct.syncreplyNetworkStruct.varsparamModelAdapter.DeaggInfo.Vchainprotected MatrixChain.visitsFields in jline.lang with type parameters of type MatrixModifier and TypeFieldDescriptionNetworkStruct.cdscalingNetworkStruct.impatienceMuNetworkStruct.impatiencePhiNetworkStruct.impatiencePieModelAdapter.DeaggInfo.inchainNetworkStruct.inchainNetworkStruct.ljcdcutoffsNetworkStruct.ljcdscalingNetworkStruct.ljdcutoffsNetworkStruct.ljdscalingNetworkStruct.muNetworkStruct.nodevisitsNodeParam.outlinksOutbound link specifications by job class - defines outgoing connectionsNetworkStruct.phiNetworkStruct.pieEvent.probFunEvent.probFunNetworkStruct.retrialMuNetworkStruct.retrialPhiNodeParam.rlValueFunctionRL value function by job class.Network.routingMatrixReturn.rtNodesByClassNetwork.routingMatrixReturn.rtNodesByStationNetworkStruct.rtorigNetworkStruct.servercompatServer-class compatibility matrix per station.NetworkStruct.serverspertypeNumber of servers per server type at each station.NetworkStruct.spaceNetworkStruct.stateNetworkStruct.statepriorNetworkStruct.visitsNodeParam.weightsRouting weights by job class - controls probabilistic routing decisionsNodeParam.withMemoryMemory-dependent parameters by job class - for state-dependent behaviorMethods in jline.lang that return MatrixModifier and TypeMethodDescriptionstatic MatrixModelAdapter.findPaths(NetworkStruct sn, Matrix P, int startNode, int endNode, int r, ArrayList<Integer> toMerge, Matrix QN, Matrix TN, double currentTime, Matrix fjclassmap, Matrix fjforkmap, Network nonfjmodel) Finds the response times along each path leading out of startNode up to (and not including) endNodestatic MatrixModelAdapter.findPathsCS(NetworkStruct sn, Matrix P, int curNode, int endNode, int curClass, ArrayList<Integer> toMerge, Matrix QN, Matrix TN, double currentTime, Matrix fjclassmap, Matrix fjforkmap, Network nonfjmodel) Finds the response times along each path leading out of curNode up to (and not including) endNode Variant for models with class switchingRoutingMatrix.get(int jobclass1, int jobclass2) ModelAdapter.AggregateChainResult.getAlpha()Network.getClassSwitchingMask()Network.getConnectionMatrix()Region.getConstraintA()Gets the linear constraint matrix A.Region.getConstraintB()Gets the linear constraint vector b.Network.getCsMatrix()Network.getDemandsChain()Network.getForkJoins()Network.getLimitedLoadDependence()ClassSwitchMatrix.getMatrix()Expose the raw Matrix only if callers genuinely need itNetwork.getNumberOfJobs()Network.getReferenceClasses()Network.getReferenceStations()Event.getState()Gets the system state matrix when this event occurred.ModeEvent.getState()Network.getStatefulServers()Network.getStationServers()Methods in jline.lang that return types with arguments of type MatrixModifier and TypeMethodDescriptionNetwork.getLimitedClassDependence()Network.getLimitedJointClassDependence()Gets the limited joint-class-dependent scaling tables and cutoffs for all stations.Network.getLimitedJointClassDependence()Gets the limited joint-class-dependent scaling tables and cutoffs for all stations.Network.getLimitedJointDependence()Gets the limited joint-dependent scaling tables and cutoffs for all stations.Network.getLimitedJointDependence()Gets the limited joint-dependent scaling tables and cutoffs for all stations.Network.getLinkedRoutingMatrix()Event.getProbFun()Gets the probability function used to dynamically compute event probability.Event.getProbFun()Gets the probability function used to dynamically compute event probability.Methods in jline.lang with parameters of type MatrixModifier and TypeMethodDescriptionstatic NetworkNetwork.cluster(Matrix lambda, Matrix D, SchedStrategy[] strategy, Matrix S, RoutingStrategy dispatching) Creates an open cluster network: Source -> Dispatcher (Router) -> Servers -> Sink.static NetworkNetwork.clusterClosed(Matrix N, Matrix Z, Matrix D, SchedStrategy[] strategy, Matrix S, RoutingStrategy dispatching) Creates a closed cluster network: Think (Delay) -> Dispatcher (Router) -> Servers -> Think.static NetworkNetwork.clusterFcfs(Matrix lambda, Matrix D, Matrix S, RoutingStrategy dispatching) Creates an open FCFS cluster with one server per queue.static NetworkNetwork.clusterPs(Matrix lambda, Matrix D, RoutingStrategy dispatching) Creates an open PS cluster with one server per queue.static NetworkNetwork.clusterPs(Matrix lambda, Matrix D, Matrix S, RoutingStrategy dispatching) Creates an open PS cluster.static NetworkNetwork.cyclic(Matrix N, Matrix D, SchedStrategy[] strategy, Matrix S) Creates a cyclic queueing network model with specified job populations, service demands, scheduling strategies, and server counts.static NetworkNetwork.cyclicFcfs(Matrix N, Matrix D) Creates a cyclic queueing network with First Come First Served (FCFS) scheduling at all stations.static NetworkNetwork.cyclicFcfs(Matrix N, Matrix D, Matrix S) Creates a cyclic queueing network with FCFS scheduling and specified server counts.static NetworkNetwork.cyclicFcfsInf(Matrix N, Matrix D, Matrix Z) Creates a cyclic network with infinite server (delay) stations followed by FCFS queue stations.static NetworkNetwork.cyclicFcfsInf(Matrix N, Matrix D, Matrix Z, Matrix S) Creates a cyclic network with infinite server stations followed by FCFS queue stations with specified server counts.static NetworkCreates a cyclic queueing network with Processor Sharing (PS) scheduling at all stations.static NetworkCreates a cyclic queueing network with PS scheduling and specified server counts.static NetworkNetwork.cyclicPsInf(Matrix N, Matrix D, Matrix Z) Creates a cyclic network with infinite server (delay) stations followed by PS queue stations.static NetworkNetwork.cyclicPsInf(Matrix N, Matrix D, Matrix Z, Matrix S) Creates a cyclic network with infinite server stations followed by PS queue stations with specified server counts.static MatrixModelAdapter.findPaths(NetworkStruct sn, Matrix P, int startNode, int endNode, int r, ArrayList<Integer> toMerge, Matrix QN, Matrix TN, double currentTime, Matrix fjclassmap, Matrix fjforkmap, Network nonfjmodel) Finds the response times along each path leading out of startNode up to (and not including) endNodestatic MatrixModelAdapter.findPathsCS(NetworkStruct sn, Matrix P, int curNode, int endNode, int curClass, ArrayList<Integer> toMerge, Matrix QN, Matrix TN, double currentTime, Matrix fjclassmap, Matrix fjforkmap, Network nonfjmodel) Finds the response times along each path leading out of curNode up to (and not including) endNode Variant for models with class switchingNetwork.getRoutingMatrix(Matrix arvRates, int returnVal) voidNetwork.initFromAvgQLen(Matrix AvgQLen) voidNetwork.initFromMarginal(Matrix n) voidNetwork.initFromMarginalAndRunning(Matrix n, Matrix s) voidNetwork.initFromMarginalAndStarted(Matrix n, Matrix s) static Ret.FJApproxFork-Join Transform approach to evaluate queueing networks including fork-join systems.voidNetwork.refreshRoutingMatrix(Matrix rates) Environment.ResetEnvRatesFunction.reset(Markovian originalDist, Matrix QExit, Matrix UExit, Matrix TExit) voidvoidvoidvoidNetwork.setConnectionMatrix(Matrix connection) voidNetwork.setCsMatrix(Matrix csMatrix) voidRegion.setLinearConstraints(Matrix A, Matrix b) Sets general linear admission constraints An <= b.voidSets the system state matrix for this event.voidvoidstatic Ret.FJsortForksModelAdapter.sort_forks(NetworkStruct sn, NetworkStruct nonfjstruct, Matrix fjforkmap, Matrix fjclassmap, Network nonfjmodel) Determines a directed acyclic graph of relationships among fork nodes.doubleNetwork.sub_jsq(int ind, int jnd, int r, int s, Matrix linksmat, Map<Node, Matrix> state_before, Map<Node, Matrix> state_after) doubleNetwork.sub_kchoices(int ind, int jnd, int r, int s, Matrix linksmat, Map<Node, Matrix> state_before, Map<Node, Matrix> state_after) Power-of-K choices marginal routing probability.doubleNetwork.sub_rl(int ind, int jnd, int r, int s, Matrix linksmat, Map<Node, Matrix> state_before, Map<Node, Matrix> state_after) Reinforcement-learning routing marginal probability.doubleNetwork.sub_rr_wrr(int ind, int jnd, int r, int s, Matrix linksmat, Map<Node, Matrix> state_before, Map<Node, Matrix> state_after) static NetworkNetwork.tandem(Matrix lambda, Matrix D, SchedStrategy[] strategy, Matrix S) Creates a tandem queueing network with specified arrival rates and service demands.static NetworkNetwork.tandemFcfs(Matrix lambda, Matrix D, Matrix S) static NetworkNetwork.tandemFcfsInf(Matrix lambda, Matrix D) Creates a tandem network with FCFS infinite servers.static NetworkNetwork.tandemFcfsInf(Matrix lambda, Matrix D, Matrix Z) Creates a tandem network with FCFS infinite servers and delay centers.static NetworkNetwork.tandemFcfsInf(Matrix lambda, Matrix D, Matrix Z, Matrix S) Creates a tandem network with FCFS infinite servers, delays, and specified server counts.static Networkstatic NetworkNetwork.tandemPsInf(Matrix lambda, Matrix D) Creates a tandem network with processor sharing infinite servers.static NetworkNetwork.tandemPsInf(Matrix lambda, Matrix D, Matrix Z) Creates a tandem network with processor sharing infinite servers and delays.static NetworkNetwork.tandemPsInf(Matrix lambda, Matrix D, Matrix Z, Matrix S) Method parameters in jline.lang with type arguments of type MatrixModifier and TypeMethodDescriptiondoubleComputes the probability of this event using the probability function and current system state.doubleComputes the probability of this event using the probability function and current system state.voidRelink the network from a modified rtorig map.voidEvent.setProbFun(SerializableFunction<Pair<Map<Node, Matrix>, Map<Node, Matrix>>, Double> probFun) Sets the probability function to dynamically compute event probability based on system state.voidEvent.setProbFun(SerializableFunction<Pair<Map<Node, Matrix>, Map<Node, Matrix>>, Double> probFun) Sets the probability function to dynamically compute event probability based on system state.doubleNetwork.sub_jsq(int ind, int jnd, int r, int s, Matrix linksmat, Map<Node, Matrix> state_before, Map<Node, Matrix> state_after) doubleNetwork.sub_kchoices(int ind, int jnd, int r, int s, Matrix linksmat, Map<Node, Matrix> state_before, Map<Node, Matrix> state_after) Power-of-K choices marginal routing probability.doubleNetwork.sub_rl(int ind, int jnd, int r, int s, Matrix linksmat, Map<Node, Matrix> state_before, Map<Node, Matrix> state_after) Reinforcement-learning routing marginal probability.doubleNetwork.sub_rr_wrr(int ind, int jnd, int r, int s, Matrix linksmat, Map<Node, Matrix> state_before, Map<Node, Matrix> state_after) voidUpdates sn.rtorig without replacing the entire NetworkStruct.Constructors in jline.lang with parameters of type MatrixModifierConstructorDescriptionAggregateChainResult(Network chainModel, Matrix alpha, ModelAdapter.DeaggInfo deaggInfo) ClassSwitchMatrix(Matrix matrix) Creates a new Event with all basic parameters specified.Event(EventType event, int node, int jobclass, SerializableFunction<Pair<Map<Node, Matrix>, Map<Node, Matrix>>, Double> probFun, Matrix state, double t, double job) Creates a new Event where probability is determined by a function of system state.ModeEvent(EventType event, int node, int mode, double weight, double prob, Matrix state, double t, double job) routingMatrixReturn(Matrix rt, Matrix rtnodes, Matrix linksmat, Matrix chains, Map<JobClass, Map<JobClass, Matrix>> rtNodesByClass, Map<Node, Map<Node, Matrix>> rtNodesByStation) Constructor parameters in jline.lang with type arguments of type MatrixModifierConstructorDescriptionEvent(EventType event, int node, int jobclass, SerializableFunction<Pair<Map<Node, Matrix>, Map<Node, Matrix>>, Double> probFun, Matrix state, double t, double job) Creates a new Event where probability is determined by a function of system state.Event(EventType event, int node, int jobclass, SerializableFunction<Pair<Map<Node, Matrix>, Map<Node, Matrix>>, Double> probFun, Matrix state, double t, double job) Creates a new Event where probability is determined by a function of system state.routingMatrixReturn(Matrix rt, Matrix rtnodes, Matrix linksmat, Matrix chains, Map<JobClass, Map<JobClass, Matrix>> rtNodesByClass, Map<Node, Map<Node, Matrix>> rtNodesByStation) -
Uses of Matrix in jline.lang.layered
Fields in jline.lang.layered declared as MatrixModifier and TypeFieldDescriptionLayeredNetworkStruct.actphaseLayeredNetworkStruct.actposttypeLayeredNetworkStruct.actpretypeprotected MatrixActivity.asyncCallMeansLayeredNetworkStruct.callpairLayeredNetworkStruct.conntasksLayeredNetworkStruct.dagLayeredNetworkStruct.fanoutprotected MatrixEntry.forwardingProbsLayeredNetworkStruct.graphLayeredNetworkStruct.isasynccallerLayeredNetworkStruct.iscacheLayeredNetworkStruct.iscallerLayeredNetworkStruct.isfunctionLayeredNetworkStruct.isrefLayeredNetworkStruct.issynccallerLayeredNetworkStruct.maxmultLayeredNetworkStruct.multLayeredNetworkStruct.nitemsLayeredNetworkStruct.parentprotected MatrixActivityPrecedence.postParamsprotected MatrixActivityPrecedence.preParamsLayeredNetworkStruct.replLayeredNetworkStruct.replacementLayeredNetworkStruct.replacestratLayeredNetworkStruct.replygraphLayeredNetworkStruct.schedidprotected MatrixActivity.schedulingprotected MatrixEntry.schedulingprotected MatrixActivity.syncCallMeansLayeredNetworkStruct.taskgraphLayeredNetworkStruct.typeFields in jline.lang.layered with type parameters of type MatrixModifier and TypeFieldDescriptionLayeredNetworkStruct.actthink_paramsLayeredNetworkStruct.arrival_paramsLayeredNetworkStruct.callproc_paramsLayeredNetworkStruct.delayofftime_paramsLayeredNetworkStruct.hostdem_paramsLayeredNetworkStruct.itemproc_paramsLayeredNetworkStruct.setuptime_paramsLayeredNetworkStruct.think_paramsMethods in jline.lang.layered that return MatrixModifier and TypeMethodDescriptionActivity.getAsyncCallMeans()Entry.getForwardingProbs()Get the matrix of forwarding probabilities.ActivityPrecedence.getPostParams()Returns the parameters for the following activities.ActivityPrecedence.getPreParams()Returns the parameters for the preceding activities.Activity.getSyncCallMeans()Methods in jline.lang.layered with parameters of type MatrixModifier and TypeMethodDescriptionstatic ActivityPrecedenceCreates an ActivityPrecedence object representing an AND-fork relationship with a specified fanout matrix.static ActivityPrecedenceCreates an ActivityPrecedence object representing an AND-fork relationship with a specified fanout matrix.static ActivityPrecedenceCreates an ActivityPrecedence object representing an AND-join relationship with a specified quorum matrix.static ActivityPrecedenceCreates an ActivityPrecedence object representing an AND-join relationship with a specified quorum matrix.static ActivityPrecedenceActivityPrecedence.fromActivities(List<Activity> preActs, List<Activity> postActs, String preType, String postType, Matrix preParams) Creates an ActivityPrecedence with Activity objects, without postParams.static ActivityPrecedenceActivityPrecedence.fromActivities(List<Activity> preActs, List<Activity> postActs, String preType, String postType, Matrix preParams, Matrix postParams) Creates an ActivityPrecedence with Activity objects.static ActivityPrecedenceCreates an ActivityPrecedence object representing a loop relationship.static ActivityPrecedencestatic ActivityPrecedenceCreates an ActivityPrecedence object representing a loop relationship.static ActivityPrecedencestatic ActivityPrecedenceCreates an ActivityPrecedence object representing a loop relationship.static ActivityPrecedenceCreates an ActivityPrecedence object representing a loop relationship.static ActivityPrecedenceCreates an ActivityPrecedence object representing an OR-fork relationship with a specified probability matrix.static ActivityPrecedenceCreates an ActivityPrecedence object representing an OR-fork relationship with a specified probability matrix.static DiscreteDistributionLayeredNetwork.reconstructDiscreteDistribution(ProcessType type, Matrix params, Double mean) Reconstruct a DiscreteDistribution object from primitive parameters.static DistributionLayeredNetwork.reconstructDistribution(ProcessType type, Matrix params, Double mean, Double scv, MatrixCell proc) Reconstruct a Distribution object from primitive parameters.Activity.setAsyncCallMeans(Matrix asyncCallMeans) Activity.setSyncCallMeans(Matrix syncCallMeans) static ActivityPrecedenceCreates an ActivityPrecedence object representing an XOR relationship.static ActivityPrecedenceCreates an ActivityPrecedence object representing an XOR relationship.Constructors in jline.lang.layered with parameters of type MatrixModifierConstructorDescriptionActivityPrecedence(List<String> preActs, List<String> postActs, String preType, String postType, Matrix preParams) Constructs an ActivityPrecedence with the specified parameters, without postParams.ActivityPrecedence(List<String> preActs, List<String> postActs, String preType, String postType, Matrix preParams, Matrix postParams) Constructs an ActivityPrecedence with the specified parameters. -
Uses of Matrix in jline.lang.nodeparam
Fields in jline.lang.nodeparam declared as MatrixModifier and TypeFieldDescriptionMatrix[][]CacheNodeParam.accostAccess cost matrix for cache items by class [items x classes x servers]CacheNodeParam.actualhitprobActual hit probabilities computed during analysis [items x classes]CacheNodeParam.actualmissprobActual miss probabilities computed during analysis [items x classes]TransitionNodeParam.fireweightTransitionNodeParam.firingphasesTransitionNodeParam.firingprioCacheNodeParam.hitclassJob class routing matrix for cache hits [items x classes]CacheNodeParam.itemcapCapacity matrix specifying maximum number of each item type [items x 1]CacheNodeParam.missclassJob class routing matrix for cache misses [items x classes]TransitionNodeParam.nmodeserversFields in jline.lang.nodeparam with type parameters of type Matrix -
Uses of Matrix in jline.lang.nodes
Fields in jline.lang.nodes declared as MatrixModifier and TypeFieldDescriptionMatrix[][]Cache.accessProbTransition.firingPrioritiesTransition.firingWeightsprotected MatrixStation.ljcdCutoffsprotected MatrixStation.ljdCutoffsprotected MatrixStation.ljdScalingprotected MatrixStation.lldScalingprotected MatrixNode.stateFields in jline.lang.nodes with type parameters of type MatrixModifier and TypeFieldDescriptionTransition.enablingConditionsTransition.firingOutcomesTransition.inhibitingConditionsprotected SerializableFunction<Matrix, Double> Station.lcdScalingStation.ljcdScalingMethods in jline.lang.nodes that return MatrixModifier and TypeMethodDescriptionCache.getAccessProb(int i, int j) Gets the access probability matrix for a specific cache level and job class.Matrix[]Cache.getGraph()Gets the graph structure defining the cache organization.Cache.getHitClass()For an incoming job of class r, HITCLASS[r] is the new class of that job after a hitCache.getHitRatio()Gets the actual hit probability/ratio for each job class.Cache.getItemLevelCap()Gets the capacity configuration for each cache level.Station.getLimitedJointClassDependenceCutoffs()Gets the per-class cutoffs for joint class dependence.Station.getLimitedJointDependence()Gets the limited joint-dependent scaling matrix for this station.Station.getLimitedJointDependenceCutoffs()Gets the per-class cutoffs for joint dependence.Station.getLimitedLoadDependence()Gets the limited load-dependent scaling matrix for this station.Cache.getMissClass()For an incoming job of class r, MISSCLASS[r] is the new class of that job after a missCache.getMissRatio()Gets the actual miss probability/ratio for each job class.Transition.getNumberOfModeServers()Node.getState()Gets the current state of this node.StatefulNode.getState()StatefulNode.getStatePrior()StatefulNode.getStateSpace()Methods in jline.lang.nodes that return types with arguments of type MatrixModifier and TypeMethodDescriptionStation.getLimitedClassDependence()Gets the limited class-dependent scaling function for this station.Station.getLimitedJointClassDependence()Gets the limited joint-class-dependent scaling tables for this station.Methods in jline.lang.nodes with parameters of type MatrixModifier and TypeMethodDescriptionvoidCache.setAccessProb(Matrix[][] R) Sets the access probability matrices for all cache levels and job classes.voidQueue.setJointClassDependence(Map<JobClass, Matrix> scalingTables, Matrix cutoffs) Sets per-class joint class-dependent scaling for service rates.voidQueue.setJointDependence(Matrix scalingTable) Sets joint class-dependent scaling with auto-computed cutoffs.voidQueue.setJointDependence(Matrix scalingTable, Matrix cutoffs) Sets joint class-dependent scaling for service rates using a lookup table.voidStation.setLimitedJointClassDependence(Map<JobClass, Matrix> scalingTables, Matrix cutoffs) Sets the limited joint-class-dependent scaling for this station.voidStation.setLimitedJointDependence(Matrix scalingTable, Matrix cutoffs) Sets the limited joint-dependent scaling for this station.voidStation.setLimitedLoadDependence(Matrix alpha) Sets the limited load-dependent scaling matrix for this station.voidQueue.setLoadDependence(Matrix alpha) Sets load-dependent service rate scaling factors.voidCache.setResultHitProb(Matrix actualHitProb) Sets the actual hit probabilities from simulation or analysis results.voidCache.setResultMissProb(Matrix actualMissProb) Sets the actual miss probabilities from simulation or analysis results.voidNode.setRLRouting(JobClass jobClass, Matrix valueFunction, int[] vfShape, int[] nodesNeedAction, int stateSize) Configures reinforcement-learning routing for a job class.voidSets the state of this node.voidvoidStatefulNode.setStatePrior(Matrix prior) voidStatefulNode.setStateSpace(Matrix space) Method parameters in jline.lang.nodes with type arguments of type MatrixModifier and TypeMethodDescriptionvoidQueue.setClassDependence(SerializableFunction<Matrix, Double> beta) Sets a class-dependent scaling function for service rates.voidQueue.setJointClassDependence(Map<JobClass, Matrix> scalingTables, Matrix cutoffs) Sets per-class joint class-dependent scaling for service rates.voidStation.setLimitedClassDependence(SerializableFunction<Matrix, Double> gamma) Sets the limited class-dependent scaling function for this station.voidStation.setLimitedJointClassDependence(Map<JobClass, Matrix> scalingTables, Matrix cutoffs) Sets the limited joint-class-dependent scaling for this station.Constructors in jline.lang.nodes with parameters of type MatrixModifierConstructorDescriptionCache(Network model, String name, int nitems, int itemLevelCap, ReplacementStrategy replPolicy, Matrix[] graph) Creates a single-level cache with the specified item capacity, replacement policy, and graph structure.Cache(Network model, String name, int nitems, Matrix itemLevelCap, ReplacementStrategy replPolicy) Creates a multi-level cache with different capacities per level and a replacement policy.Cache(Network model, String name, int nitems, Matrix itemLevelCap, ReplacementStrategy replPolicy, Matrix[] graph) Creates a multi-level cache with different capacities per level, replacement policy, and graph structure.ClassSwitch(Network model, String name, Matrix csFun) -
Uses of Matrix in jline.lang.processes
Fields in jline.lang.processes declared as MatrixModifier and TypeFieldDescriptionprotected MatrixEmpiricalCDF.dataprotected MatrixMarkovProcess.infGenprotected MatrixMarkovChain.stateSpaceprotected MatrixMarkovProcess.stateSpaceprotected MatrixMarkovChain.transMatFields in jline.lang.processes with type parameters of type MatrixMethods in jline.lang.processes that return MatrixModifier and TypeMethodDescriptionMarkovian.acf(int maxLag) Kotlin-style property alias for getACF()DMAP.D(int i) MAP.D(int i) Marked.D(int i) Marked.D(int i, int k) Markovian.D(int i) Gets the i-th matrix of the Markovian arrival process representation.MMPP2.D(int i) Markovian.embedded()Kotlin-style property alias for getEmbedded()Markovian.embeddedProb()Kotlin-style property alias for getEmbeddedProb()MAP.evalACFT(int[] lags, double timescale) Evaluates the autocorrelation function at given lags and timescale.MarkovModulated.evalACFT(int[] lags, double timescale) MMPP2.evalACFT(int[] lags, double timescale) APH.evalCDFMatrix()Evaluates the CDF at default time points and returns as a Matrix.APH.evalCDFMatrix(double[] timePoints) Evaluates the CDF at specified time points and returns as a Matrix.Zipf.evalPMF()Evaluates the probability mass function at tME.getA()Gets the matrix parameter A.Gets the autocorrelation function at the specified lags.ME.getAlpha()Gets the initial vector alpha.BMAP.getBatchMatrix(int batchSize) Get the D_k matrix for batch size kMultivariateNormal.getCorrelation()Gets the correlation matrix from the covariance matrix.MultivariateNormal.getCovariance()Gets the covariance matrix.Marked.getD1k(int k) EmpiricalCDF.getData()Get the empirical dataMarkovian.getEmbedded()Gets the embedded Markov chain transition matrix.MMPP2.getEmbedded()Markovian.getEmbeddedProb()Gets the stationary probability vector of the embedded Markov chain.MMPP2.getEmbeddedProb()MarkovProcess.getGenerator()Get the infinitesimal generator matrixRAP.getH0()Gets the H0 matrix (hidden transition rates).RAP.getH1()Gets the H1 matrix (visible transition rates).APH.getInitProb()Markovian.getInitProb()Gets the initial probability vector.PH.getInitProb()MultivariateNormal.getMeanVector()Gets the mean vector.Coxian.getMu()DMAP.getMu()Row sums of (I - D0).Markovian.getMu()Gets the diagonal rate matrix containing the negative diagonal elements of D0.Coxian.getPhi()Markovian.getPhi()Gets the exit probability vector (phi).MarkovProcess.getProbState(Matrix state) Get probability of a specific state using Cramer's ruleMarkovChain.getStateSpace()Get the state spaceMarkovProcess.getStateSpace()Get the state spaceAPH.getSubgenerator()Markovian.getSubgenerator()PH.getSubgenerator()DMAP.getTransitionMatrix()Embedded chain P = (I - D0)^{-1} * D1.MarkovChain.getTransMat()Get the transition matrixMMAP.getTypeMatrix(int type) Get the D_k matrix for arrival type kAPH.initProb()Kotlin-style property alias for getInitProb()Markovian.initProb()Kotlin-style property alias for getInitProb()PH.initProb()Kotlin-style property alias for getInitProb()Coxian.mu()Kotlin-style property alias for getMu()Markovian.mu()Kotlin-style property alias for getMu()Coxian.phi()Kotlin-style property alias for getPhi()Markovian.phi()Kotlin-style property alias for getPhi()MMDP.Q()Returns the generator matrix Q.MMDP2.Q()Returns the generator matrix Q (closed-form for 2 states).MMDP.r()Returns the rate vector (diagonal of R).MMDP2.r()Returns the rate vector (diagonal of R).MMDP.R()Returns the rate matrix R (diagonal).MMDP2.R()Returns the rate matrix R (diagonal, closed-form for 2 states).MarkovChain.sample()Sample from the DTMCMarkovChain.sample(int n) Sample n steps from the DTMC starting from initial distributionSample n steps from the DTMCMarkovProcess.sample()Sample from the CTMCMarkovProcess.sample(int n) Sample n state transitions from the CTMC starting from steady-stateSample n state transitions from the CTMCMultivariateNormal.sampleMatrix(int n, Random random) Generates random samples from the distribution.MarkovProcess.solve()Solve the CTMC for steady-state probabilitiesMarkovian.subgenerator()Kotlin-style property alias for getSubgenerator()PH.subgenerator()Kotlin-style property alias for getSubgenerator()GMM.toMatrix()Converts this GMM to a simplified matrix representation.Methods in jline.lang.processes that return types with arguments of type MatrixModifier and TypeMethodDescriptionImmediate.getPH()Det.getProcess()Gets the matrix representation of this deterministic process (for PH compatibility).Det.process()Kotlin-style property alias for getProcess()Methods in jline.lang.processes with parameters of type MatrixModifier and TypeMethodDescriptiondoubleEvaluates the probability density function.static MMAPFactory method to create a simple 2-type MMAP from two MAPsstatic BMAPBMAP.fromMAPWithBatchPMF(Matrix D0, Matrix D1, int[] batchSizes, double[] pmf) Factory method to create BMAP from a base MAP and batch size distribution Given a base MAP (D0_base, D1_base) for inter-batch arrivals and a batch size distribution, constructs the BMAP by scaling: Dk = D1_base * pmf[k-1]static GMMGMM.fromMatrix(Matrix sgmm) Creates a GMM from a simplified matrix representation.static MarkovChainMarkovChain.fromSampleSysAggr(Matrix samples) Create DTMC from sample system aggregationstatic MarkovChainMarkovChain.fromSampleSysAggr(Matrix samples, int numStates) Create DTMC from sample system aggregationstatic MarkovProcessMarkovProcess.fromSampleSysAggr(Matrix samples) Create CTMC from sample system aggregation (assuming unit sojourn times)static MarkovProcessMarkovProcess.fromSampleSysAggr(Matrix samples, Matrix sojournTimes) Create CTMC from sample system aggregationstatic MarkovProcessMarkovProcess.fromSampleSysAggr(Matrix samples, Matrix sojournTimes, int numStates) Create CTMC from sample system aggregationGets the autocorrelation function at the specified lags.doubleMMPP2.getACFDecay(Matrix lags) MarkovProcess.getProbState(Matrix state) Get probability of a specific state using Cramer's rulestatic booleanMMDP.isFeasible(Matrix Q, Matrix R) Checks if the given (Q, R) matrices define a valid MMDP.Sample n steps from the DTMCSample n state transitions from the CTMCvoidMarkovChain.setStateSpace(Matrix stateSpace) Set the state spacevoidMarkovProcess.setStateSpace(Matrix stateSpace) Set the state spaceMethod parameters in jline.lang.processes with type arguments of type MatrixModifier and TypeMethodDescriptionvoidDet.setProcess(Map<Integer, Matrix> proc) Sets the matrix representation of this deterministic process.Constructors in jline.lang.processes with parameters of type MatrixModifierConstructorDescriptionConstruct a BMAP from D0 and variable number of Dk matricesDiscreteSampler(Matrix p, Matrix x) Constructs a discrete distribution from a finite probability vector p at the points specified in vector xEmpiricalCDF(Matrix xdata) Creates an EmpiricalCDF with the given dataEmpiricalCDF(Matrix cdfdata, Matrix xdata) Creates an EmpiricalCDF with separate CDF and value dataMarkedMarkovProcess(Matrix infGen, MatrixCell eventFilt, List<Map<String, Object>> evs) Creates a MarkedCTMC with the specified generator, event filters, and eventsMarkedMarkovProcess(Matrix infGen, MatrixCell eventFilt, List<Map<String, Object>> evs, boolean isFinite) Creates a MarkedCTMC with the specified generator, event filters, events, and finite flagMarkedMarkovProcess(Matrix infGen, MatrixCell eventFilt, List<Map<String, Object>> evs, boolean isFinite, Matrix stateSpace) Creates a MarkedCTMC with the specified generator, event filters, events, finite flag, and state spaceMarkovChain(Matrix transMat) Creates a DTMC with the specified transition matrixMarkovChain(Matrix transMat, boolean isFinite) Creates a DTMC with the specified transition matrix and finite flagMarkovProcess(Matrix infGen) Creates a CTMC with the specified infinitesimal generatorMarkovProcess(Matrix infGen, boolean isFinite) Creates a CTMC with the specified infinitesimal generator and finite flagMarkovProcess(Matrix infGen, boolean isFinite, Matrix stateSpace) Creates a CTMC with the specified infinitesimal generator, finite flag, and state spaceCreates a Matrix Exponential distribution with specified initial vector and matrix parameter.Construct an MMAP from D0 and variable number of Dk matricesCreates an MMDP with specified generator Q and rate matrix R.MultivariateNormal(double[] mu, Matrix Sigma) Creates a multivariate normal distribution.MultivariateNormal(Matrix mu, Matrix Sigma) Creates a multivariate normal distribution.Creates a Rational Arrival Process with specified H0 and H1 matrices. -
Uses of Matrix in jline.lang.reward
Methods in jline.lang.reward with parameters of type MatrixModifier and TypeMethodDescriptiondoubleRewardFunction.compute(Matrix state, NetworkStruct sn) Compute the reward value for a given state. -
Uses of Matrix in jline.lang.sections
Fields in jline.lang.sections declared as MatrixModifier and TypeFieldDescriptionCacheClassSwitcher.actualHitProbCacheClassSwitcher.actualMissProbCacheClassSwitcher.hitClassCacheClassSwitcher.missClassCSFunInput.stateOptional state matrixCSFunInput.statedepOptional state-dependent matrixMethods in jline.lang.sections with parameters of type MatrixModifier and TypeMethodDescriptiondoubleCacheClassSwitcher.simpleHitMiss(int r, int s, Matrix state) doubleCacheClassSwitcher.simpleHitMiss(int r, int s, Matrix state, Matrix statep) voidStatelessClassSwitcher.updateClassSwitch(Matrix csMatrix) Constructors in jline.lang.sections with parameters of type MatrixModifierConstructorDescriptionCacheClassSwitcher(List<JobClass> jobClasses, int items, Matrix capacity) CacheClassSwitcher(List<JobClass> jobClasses, int items, Matrix capacity, int levels) CSFunInput(int r, int s, Matrix state, Matrix statedep) Creates a new CSFunInput.StatelessClassSwitcher(List<JobClass> jobClasses, Matrix csMatrix) -
Uses of Matrix in jline.lang.state
Fields in jline.lang.state declared as MatrixModifier and TypeFieldDescriptionState.StateSpaceGeneratorResult.Adjfinal MatrixState.spaceGeneratorNodesResult.capacitycfinal MatrixEventCacheKey.inspaceState.StateMarginalStatistics.niState.StateMarginalStatistics.nirfinal MatrixAfterGlobalEvent.AfterGlobalEventResult.outprobProbability matrix for each resulting state transition.final MatrixState.EventHandleResult.outprobfinal MatrixAfterGlobalEvent.AfterGlobalEventResult.outrateTransition rates matrix for each resulting state.final MatrixState.EventHandleResult.outratefinal MatrixState.EventHandleResult.outspaceState.StateMarginalStatistics.sirState.StateSpaceGeneratorResult.SSState.StateSpaceGeneratorResult.SShFields in jline.lang.state with type parameters of type MatrixModifier and TypeFieldDescriptionfinal Map<StatefulNode, Matrix> State.initialStatefinal Map<StatefulNode, Matrix> State.initialStateSpaceState.StateMarginalStatistics.kirfinal Map<StatefulNode, Matrix> State.spaceGeneratorNodesResult.nodeStateSpaceAfterGlobalEvent.AfterGlobalEventResult.outglspaceUpdated global state space after event processing.final Map<StatefulNode, Matrix> State.priorInitialStateState.StateSpaceGeneratorResult.QNC.spaceMethods in jline.lang.state that return MatrixModifier and TypeMethodDescriptionstatic MatrixFromMarginal.fromMarginal(NetworkStruct sn, int ind, Matrix n) static MatrixFromMarginal.fromMarginalAndRunning(Network sn, int ind, Matrix n, Matrix s) static MatrixFromMarginal.fromMarginalAndRunning(NetworkStruct sn, int ind, Matrix n, Matrix s) static MatrixFromMarginal.fromMarginalAndRunning(NetworkStruct sn, int ind, Matrix n, Matrix s, boolean optionsForce) static MatrixFromMarginal.fromMarginalAndStarted(Network network, int ind, Matrix n, Matrix s) static MatrixFromMarginal.fromMarginalAndStarted(NetworkStruct sn, int ind, Matrix n, Matrix s) static MatrixFromMarginal.fromMarginalAndStarted(NetworkStruct sn, int ind, Matrix n, Matrix s, Boolean optionsForce) static MatrixFromMarginal.fromMarginalBounds(NetworkStruct sn, int ind, Matrix ub, double cap, SolverOptions options) static MatrixState.spaceCachePublic(int n, Matrix m) Make spaceCache method public Generates cache state spacestatic MatrixState.spaceClosedMulti(int M, Matrix N) static MatrixState.spaceClosedMultiCS(int M, Matrix N, Matrix chains) static MatrixState.spaceClosedSinglePublic(int M, int N) Make spaceClosedSingle method public Generates state space for single-class closed networksstatic MatrixState.spaceLocalVarsPublic(NetworkStruct sn, int ind) Make spaceLocalVars method public Generates local variable state spacesMethods in jline.lang.state with parameters of type MatrixModifier and TypeMethodDescriptionstatic Ret.EventResultState.afterEvent(NetworkStruct sn, int ind, Matrix inspace, EventType event, int jobClass, boolean isSimulation) static Ret.EventResultState.afterEvent(NetworkStruct sn, int ind, Matrix inspace, EventType event, int jobClass, boolean isSimulation, EventCache eventCache) static intstatic MatrixFromMarginal.fromMarginal(NetworkStruct sn, int ind, Matrix n) static MatrixFromMarginal.fromMarginalAndRunning(Network sn, int ind, Matrix n, Matrix s) static MatrixFromMarginal.fromMarginalAndRunning(NetworkStruct sn, int ind, Matrix n, Matrix s) static MatrixFromMarginal.fromMarginalAndRunning(NetworkStruct sn, int ind, Matrix n, Matrix s, boolean optionsForce) static MatrixFromMarginal.fromMarginalAndStarted(Network network, int ind, Matrix n, Matrix s) static MatrixFromMarginal.fromMarginalAndStarted(NetworkStruct sn, int ind, Matrix n, Matrix s) static MatrixFromMarginal.fromMarginalAndStarted(NetworkStruct sn, int ind, Matrix n, Matrix s, Boolean optionsForce) static MatrixFromMarginal.fromMarginalBounds(NetworkStruct sn, int ind, Matrix ub, double cap, SolverOptions options) static Ret.getHashOrAddResultState.getHashOrAdd(NetworkStruct sn, int ind, Matrix inspace) Get hash ID for a state space, or add the state to the space if not found Migrated from MATLAB getHashOrAdd.mprotected static State.EventHandleResultState.handleEnableEvent(NetworkStruct sn, int ind, GlobalSync glevent, List<Matrix> glspace, List<Matrix> outglspace, Matrix inspace, Matrix spaceBuf, Matrix spaceSrv, Matrix spaceVar, Matrix fK, Matrix fKs, int mode, TransitionNodeParam transParam, int R) Handles ENABLE events for transitions in Stochastic Petri Net (SPN) event processing.protected static State.EventHandleResultState.handleFireEvent(NetworkStruct sn, int ind, GlobalSync glevent, List<Matrix> glspace, List<Matrix> outglspace, Matrix inspace, Matrix spaceBuf, Matrix spaceSrv, Matrix spaceVar, Matrix fK, Matrix fKs, int mode, TransitionNodeParam transParam, int R) Handles FIRE events for transitions in Stochastic Petri Net (SPN) event processing.static booleanstatic booleanState.isValid(NetworkStruct sn, Matrix n, Matrix s) static MatrixState.spaceCachePublic(int n, Matrix m) Make spaceCache method public Generates cache state spacestatic MatrixState.spaceClosedMulti(int M, Matrix N) static MatrixState.spaceClosedMultiCS(int M, Matrix N, Matrix chains) State.spaceGenerator(NetworkStruct sn, Matrix cutoff, SolverOptions options) Generates the state space for a queueing network using a matrix cutoff.State.spaceGeneratorNodes(NetworkStruct sn, Matrix cutoff, SolverOptions options) ToMarginal.toMarginal(NetworkStruct sn, int ind, Matrix state_i, Matrix phasesz, Matrix phaseshift, Matrix space_buf, Matrix space_srv, Matrix space_var) Computes marginal statistics for a stateful node in a Stochastic Petri Net.ToMarginal.toMarginalAggr(NetworkStruct sn, int ind, Matrix state_i, Matrix K, Matrix Ks, Matrix space_buf, Matrix space_srv, Matrix space_var) Computes aggregated marginal statistics for a stateful node using specified aggregation weights.Method parameters in jline.lang.state with type arguments of type MatrixModifier and TypeMethodDescriptionAfterGlobalEvent.afterGlobalEvent(NetworkStruct sn, int ind, List<Matrix> glspace, GlobalSync glevent, boolean isSimulation) Processes a global event in a Stochastic Petri Net (SPN) and computes the resulting state space.static Map<StatefulNode, Map<String, Integer>> State.buildSpaceHashMap(Map<StatefulNode, Matrix> space) protected static State.EventHandleResultState.handleEnableEvent(NetworkStruct sn, int ind, GlobalSync glevent, List<Matrix> glspace, List<Matrix> outglspace, Matrix inspace, Matrix spaceBuf, Matrix spaceSrv, Matrix spaceVar, Matrix fK, Matrix fKs, int mode, TransitionNodeParam transParam, int R) Handles ENABLE events for transitions in Stochastic Petri Net (SPN) event processing.protected static State.EventHandleResultState.handleFireEvent(NetworkStruct sn, int ind, GlobalSync glevent, List<Matrix> glspace, List<Matrix> outglspace, Matrix inspace, Matrix spaceBuf, Matrix spaceSrv, Matrix spaceVar, Matrix fK, Matrix fKs, int mode, TransitionNodeParam transParam, int R) Handles FIRE events for transitions in Stochastic Petri Net (SPN) event processing.Constructors in jline.lang.state with parameters of type MatrixModifierConstructorDescriptionAfterGlobalEventResult(List<Matrix> outglspace, Matrix outrate, Matrix outprob) Constructs a new result container for global event processing.EventCacheKey(int ind, Matrix inspace, EventType event, int jobClass, boolean isSimulation) EventHandleResult(Matrix outspace, Matrix outrate, Matrix outprob) spaceGeneratorNodesResult(Map<StatefulNode, Matrix> nodeStateSpace, NetworkStruct sn, Matrix capacityc) StateSpaceGeneratorResult(Matrix ss, Matrix sSh, NetworkStruct sn) Constructor parameters in jline.lang.state with type arguments of type MatrixModifierConstructorDescriptionAfterGlobalEventResult(List<Matrix> outglspace, Matrix outrate, Matrix outprob) Constructs a new result container for global event processing.spaceGeneratorNodesResult(Map<StatefulNode, Matrix> nodeStateSpace, NetworkStruct sn, Matrix capacityc) State(Map<StatefulNode, Matrix> initialState, Map<StatefulNode, Matrix> priorInitialState, Map<StatefulNode, Matrix> initialStateSpace) -
Uses of Matrix in jline.lang.workflow
Methods in jline.lang.workflow that return types with arguments of type MatrixModifier and TypeMethodDescriptionWorkflow.composeParallel(Matrix alpha1, Matrix T1, Matrix alpha2, Matrix T2) Workflow.composeParallel(Matrix alpha1, Matrix T1, Matrix alpha2, Matrix T2) Workflow.composeRepeat(Matrix alpha, Matrix T, int count) Workflow.composeRepeat(Matrix alpha, Matrix T, int count) Workflow.composeSerial(Matrix alpha1, Matrix T1, Matrix alpha2, Matrix T2) Workflow.composeSerial(Matrix alpha1, Matrix T1, Matrix alpha2, Matrix T2) WorkflowActivity.getPHRepresentation()WorkflowActivity.getPHRepresentation()Methods in jline.lang.workflow with parameters of type MatrixModifier and TypeMethodDescriptionWorkflow.composeParallel(Matrix alpha1, Matrix T1, Matrix alpha2, Matrix T2) Workflow.composeRepeat(Matrix alpha, Matrix T, int count) Workflow.composeSerial(Matrix alpha1, Matrix T1, Matrix alpha2, Matrix T2) -
Uses of Matrix in jline.lib.butools
Methods in jline.lib.butools that return MatrixModifier and TypeMethodDescriptionstatic MatrixFactorialMomsFromMoms.factorialMomsFromMoms(Matrix m) Returns the factorial moments given the raw moments.static MatrixHankelMomsFromMoms.hankelMomsFromMoms(Matrix m) Returns the Hankel moments given the raw moments.static MatrixJFactorialMomsFromJMoms.jFactorialMomsFromJMoms(Matrix jm) Returns the lag-1 joint factorial moments given the lag-1 joint raw moments.static MatrixJMomsFromJFactorialMoms.jMomsFromJFactorialMoms(Matrix jfm) Returns the lag-1 joint raw moments given the lag-1 joint factorial moments.static MatrixMomsFromFactorialMoms.MomsFromFactorialMoms(Matrix fm) Returns the raw moments given the factorial moments.static MatrixMomsFromHankelMoms.momsFromHankelMoms(Matrix hm) Returns the raw moments given the Hankel moments.static MatrixMomsFromNormMoms.momsFromNormMoms(Matrix nm) Returns the raw moments given the normalized moments.static MatrixMomsFromReducedMoms.momsFromReducedMoms(Matrix rm) Returns the raw moments given the reduced moments.static Matrixstatic MatrixReducedMomsFromMoms.reducedMomsFromMoms(Matrix m) Returns the reduced moments given the raw moments.static MatrixSimilarityMatrixForVectors.SimilarityMatrixForVectors(Matrix vecA, Matrix vecB) Methods in jline.lib.butools that return types with arguments of type MatrixModifier and TypeMethodDescriptionFluidFundamentalMatrices.FluidFundamentalMatrices(Matrix Fpp, Matrix Fpm, Matrix Fmp, Matrix Fmm, Double precision_, Integer maxNumIt_, String method_) MMAPPH1FCFS.MMAPPH1FCFS(MatrixCell D, Map<Integer, Matrix> sigma, Map<Integer, Matrix> S, Integer numOfQLMoms, Integer numOfQLProbs, Integer numOfSTMoms, Matrix stDistr, boolean stDistrME, boolean stDistrPH, Double prec, Matrix classes_) MMAPPH1NPPR.MMAPPH1NPPR(MatrixCell D, MatrixCell sigma, MatrixCell S, Integer numOfQLMoms, Integer numOfQLProbs, Integer numOfSTMoms, Matrix stCdfPoints, Double prec, Integer erlMaxOrder_, Matrix classes_) MMAPPH1PRPR.MMAPPH1PRPR(MatrixCell D, MatrixCell sigma, MatrixCell S, Integer numOfQLMoms, Integer numOfQLProbs, Integer numOfSTMoms, Matrix stCdfPoints, Double prec, Integer erlMaxOrder_, Matrix classes_) QBDFundamentalMatrices.QBDFundamentalMatrices(Matrix B, Matrix L, Matrix F, Double precision_, Integer maxNumIt_, String method_, Integer Verbose_) MMAPPH1FCFS.solve(MatrixCell D, Map<Integer, Matrix> sigma, Map<Integer, Matrix> S, Integer numOfQLMoms, Integer numOfQLProbs, Integer numOfSTMoms, Matrix stDistr, boolean stDistrME, boolean stDistrPH, Double prec, Matrix classes_) Convenience alias for callers that expect asolve(...)entry point on the MMAPPH1FCFS class.Methods in jline.lib.butools with parameters of type MatrixModifier and TypeMethodDescriptionstatic booleanCheckMoments.checkMoments(Matrix m) static booleanCheckMoments.checkMoments(Matrix m, double prec) Checks if the given moment sequence is valid in the sense that it belongs to a distribution with support (0,inf).static MatrixFactorialMomsFromMoms.factorialMomsFromMoms(Matrix m) Returns the factorial moments given the raw moments.FluidFundamentalMatrices.FluidFundamentalMatrices(Matrix Fpp, Matrix Fpm, Matrix Fmp, Matrix Fmm, Double precision_, Integer maxNumIt_, String method_) static MatrixHankelMomsFromMoms.hankelMomsFromMoms(Matrix m) Returns the Hankel moments given the raw moments.static MatrixJFactorialMomsFromJMoms.jFactorialMomsFromJMoms(Matrix jm) Returns the lag-1 joint factorial moments given the lag-1 joint raw moments.static MatrixJMomsFromJFactorialMoms.jMomsFromJFactorialMoms(Matrix jfm) Returns the lag-1 joint raw moments given the lag-1 joint factorial moments.MMAPPH1FCFS.MMAPPH1FCFS(MatrixCell D, Map<Integer, Matrix> sigma, Map<Integer, Matrix> S, Integer numOfQLMoms, Integer numOfQLProbs, Integer numOfSTMoms, Matrix stDistr, boolean stDistrME, boolean stDistrPH, Double prec, Matrix classes_) MMAPPH1NPPR.MMAPPH1NPPR(MatrixCell D, MatrixCell sigma, MatrixCell S, Integer numOfQLMoms, Integer numOfQLProbs, Integer numOfSTMoms, Matrix stCdfPoints, Double prec, Integer erlMaxOrder_, Matrix classes_) MMAPPH1PRPR.MMAPPH1PRPR(MatrixCell D, MatrixCell sigma, MatrixCell S, Integer numOfQLMoms, Integer numOfQLProbs, Integer numOfSTMoms, Matrix stCdfPoints, Double prec, Integer erlMaxOrder_, Matrix classes_) static MatrixMomsFromFactorialMoms.MomsFromFactorialMoms(Matrix fm) Returns the raw moments given the factorial moments.static MatrixMomsFromHankelMoms.momsFromHankelMoms(Matrix hm) Returns the raw moments given the Hankel moments.static MatrixMomsFromNormMoms.momsFromNormMoms(Matrix nm) Returns the raw moments given the normalized moments.static MatrixMomsFromReducedMoms.momsFromReducedMoms(Matrix rm) Returns the raw moments given the reduced moments.static MatrixQBDFundamentalMatrices.QBDFundamentalMatrices(Matrix B, Matrix L, Matrix F, Double precision_, Integer maxNumIt_, String method_, Integer Verbose_) static MatrixReducedMomsFromMoms.reducedMomsFromMoms(Matrix m) Returns the reduced moments given the raw moments.static MatrixSimilarityMatrixForVectors.SimilarityMatrixForVectors(Matrix vecA, Matrix vecB) MMAPPH1FCFS.solve(MatrixCell D, Map<Integer, Matrix> sigma, Map<Integer, Matrix> S, Integer numOfQLMoms, Integer numOfQLProbs, Integer numOfSTMoms, Matrix stDistr, boolean stDistrME, boolean stDistrPH, Double prec, Matrix classes_) Convenience alias for callers that expect asolve(...)entry point on the MMAPPH1FCFS class.Method parameters in jline.lib.butools with type arguments of type MatrixModifier and TypeMethodDescriptionMMAPPH1FCFS.MMAPPH1FCFS(MatrixCell D, Map<Integer, Matrix> sigma, Map<Integer, Matrix> S, Integer numOfQLMoms, Integer numOfQLProbs, Integer numOfSTMoms, Matrix stDistr, boolean stDistrME, boolean stDistrPH, Double prec, Matrix classes_) MMAPPH1FCFS.solve(MatrixCell D, Map<Integer, Matrix> sigma, Map<Integer, Matrix> S, Integer numOfQLMoms, Integer numOfQLProbs, Integer numOfSTMoms, Matrix stDistr, boolean stDistrME, boolean stDistrPH, Double prec, Matrix classes_) Convenience alias for callers that expect asolve(...)entry point on the MMAPPH1FCFS class. -
Uses of Matrix in jline.lib.butools.dmap
Methods in jline.lib.butools.dmap that return MatrixModifier and TypeMethodDescriptionstatic MatrixLagkJointMomentsFromDMAP.lagkJointMomentsFromDMAP(Matrix D0, Matrix D1) static MatrixLagkJointMomentsFromDMAP.lagkJointMomentsFromDMAP(Matrix D0, Matrix D1, int K) static MatrixLagkJointMomentsFromDMAP.lagkJointMomentsFromDMAP(Matrix D0, Matrix D1, int K, int L) static MatrixLagkJointMomentsFromDMAP.lagkJointMomentsFromDMAP(Matrix D0, Matrix D1, int K, int L, double prec) Returns the lag-L joint moments of a discrete Markovian arrival process.static MatrixLagkJointMomentsFromDRAP.lagkJointMomentsFromDRAP(Matrix H0, Matrix H1) static MatrixLagkJointMomentsFromDRAP.lagkJointMomentsFromDRAP(Matrix H0, Matrix H1, int K) static MatrixLagkJointMomentsFromDRAP.lagkJointMomentsFromDRAP(Matrix H0, Matrix H1, int K, int L) static MatrixLagkJointMomentsFromDRAP.lagkJointMomentsFromDRAP(Matrix H0, Matrix H1, int K, int L, double prec) Returns the lag-L joint moments of a discrete rational arrival process.Methods in jline.lib.butools.dmap that return types with arguments of type MatrixModifier and TypeMethodDescriptionCanonicalFromDMAP2.canonicalFromDMAP2(Matrix D0, Matrix D1) CanonicalFromDMAP2.canonicalFromDMAP2(Matrix D0, Matrix D1) CanonicalFromDMAP2.canonicalFromDMAP2(Matrix D0, Matrix D1, double prec) Returns the canonical form of an order-2 discrete Markovian arrival process.CanonicalFromDMAP2.canonicalFromDMAP2(Matrix D0, Matrix D1, double prec) Returns the canonical form of an order-2 discrete Markovian arrival process.DMAP2FromMoments.dmap2FromMoments(double[] moms, double corr1) Returns a discrete MAP(2) which has the same 3 marginal moments and lag-1 autocorrelation as given.DMAP2FromMoments.dmap2FromMoments(double[] moms, double corr1) Returns a discrete MAP(2) which has the same 3 marginal moments and lag-1 autocorrelation as given.DMAPFromDRAP.dmapFromDRAP(Matrix H0, Matrix H1) DMAPFromDRAP.dmapFromDRAP(Matrix H0, Matrix H1) DMAPFromDRAP.dmapFromDRAP(Matrix H0, Matrix H1, double prec) Obtains a Markovian representation of a discrete rational arrival process of the same size, if possible.DMAPFromDRAP.dmapFromDRAP(Matrix H0, Matrix H1, double prec) Obtains a Markovian representation of a discrete rational arrival process of the same size, if possible.DRAPFromMoments.drapFromMoments(double[] moms, Matrix Nm) Creates a discrete rational arrival process that has the same marginal and lag-1 joint moments as given.DRAPFromMoments.drapFromMoments(double[] moms, Matrix Nm) Creates a discrete rational arrival process that has the same marginal and lag-1 joint moments as given.RandomDMAP.randomDMAP(int order) RandomDMAP.randomDMAP(int order) RandomDMAP.randomDMAP(int order, double mean) RandomDMAP.randomDMAP(int order, double mean) RandomDMAP.randomDMAP(int order, double mean, int zeroEntries) RandomDMAP.randomDMAP(int order, double mean, int zeroEntries) RandomDMAP.randomDMAP(int order, double mean, int zeroEntries, int maxTrials) RandomDMAP.randomDMAP(int order, double mean, int zeroEntries, int maxTrials) RandomDMAP.randomDMAP(int order, double mean, int zeroEntries, int maxTrials, double prec) RandomDMAP.randomDMAP(int order, double mean, int zeroEntries, int maxTrials, double prec) RandomDMAP.randomDMAP(int order, double mean, int zeroEntries, int maxTrials, double prec, Random random) Returns a random discrete Markovian arrival process.RandomDMAP.randomDMAP(int order, double mean, int zeroEntries, int maxTrials, double prec, Random random) Returns a random discrete Markovian arrival process.Methods in jline.lib.butools.dmap with parameters of type MatrixModifier and TypeMethodDescriptionCanonicalFromDMAP2.canonicalFromDMAP2(Matrix D0, Matrix D1) CanonicalFromDMAP2.canonicalFromDMAP2(Matrix D0, Matrix D1, double prec) Returns the canonical form of an order-2 discrete Markovian arrival process.static booleanCheckDMAPRepresentation.checkDMAPRepresentation(Matrix D0, Matrix D1) static booleanCheckDMAPRepresentation.checkDMAPRepresentation(Matrix D0, Matrix D1, double prec) Checks if the input matrices define a discrete time MAP.static booleanCheckDMMAPRepresentation.checkDMMAPRepresentation(Matrix[] D) static booleanCheckDMMAPRepresentation.checkDMMAPRepresentation(Matrix[] D, double prec) Overload for Matrix[].static booleanCheckDMRAPRepresentation.checkDMRAPRepresentation(Matrix[] H) static booleanCheckDMRAPRepresentation.checkDMRAPRepresentation(Matrix[] H, double prec) Overload for Matrix[].static booleanCheckDRAPRepresentation.checkDRAPRepresentation(Matrix D0, Matrix D1) static booleanCheckDRAPRepresentation.checkDRAPRepresentation(Matrix D0, Matrix D1, double prec) Checks if the input matrices define a discrete time RAP.DMAPFromDRAP.dmapFromDRAP(Matrix H0, Matrix H1) DMAPFromDRAP.dmapFromDRAP(Matrix H0, Matrix H1, double prec) Obtains a Markovian representation of a discrete rational arrival process of the same size, if possible.static MatrixCellDMMAPFromDMRAP.dmmapFromDMRAP(Matrix[] H) static MatrixCellDMMAPFromDMRAP.dmmapFromDMRAP(Matrix[] H, double prec) static MatrixCellDMRAPFromMoments.dmrapFromMoments(double[] moms, Matrix[] Nm) DRAPFromMoments.drapFromMoments(double[] moms, Matrix Nm) Creates a discrete rational arrival process that has the same marginal and lag-1 joint moments as given.static double[]LagCorrelationsFromDMAP.lagCorrelationsFromDMAP(Matrix D0, Matrix D1) static double[]LagCorrelationsFromDMAP.lagCorrelationsFromDMAP(Matrix D0, Matrix D1, int L) static double[]LagCorrelationsFromDMAP.lagCorrelationsFromDMAP(Matrix D0, Matrix D1, int L, double prec) Returns the lag autocorrelations of a discrete Markovian arrival process.static double[]LagCorrelationsFromDRAP.lagCorrelationsFromDRAP(Matrix H0, Matrix H1) static double[]LagCorrelationsFromDRAP.lagCorrelationsFromDRAP(Matrix H0, Matrix H1, int L) static double[]LagCorrelationsFromDRAP.lagCorrelationsFromDRAP(Matrix H0, Matrix H1, int L, double prec) Returns the lag autocorrelations of a discrete rational arrival process.static MatrixLagkJointMomentsFromDMAP.lagkJointMomentsFromDMAP(Matrix D0, Matrix D1) static MatrixLagkJointMomentsFromDMAP.lagkJointMomentsFromDMAP(Matrix D0, Matrix D1, int K) static MatrixLagkJointMomentsFromDMAP.lagkJointMomentsFromDMAP(Matrix D0, Matrix D1, int K, int L) static MatrixLagkJointMomentsFromDMAP.lagkJointMomentsFromDMAP(Matrix D0, Matrix D1, int K, int L, double prec) Returns the lag-L joint moments of a discrete Markovian arrival process.static MatrixCellLagkJointMomentsFromDMMAP.lagkJointMomentsFromDMMAP(Matrix[] D) static MatrixCellLagkJointMomentsFromDMMAP.lagkJointMomentsFromDMMAP(Matrix[] D, int K) static MatrixCellLagkJointMomentsFromDMMAP.lagkJointMomentsFromDMMAP(Matrix[] D, int K, int L) static MatrixCellLagkJointMomentsFromDMMAP.lagkJointMomentsFromDMMAP(Matrix[] D, int K, int L, double prec) Overload for Matrix[].static MatrixCellLagkJointMomentsFromDMRAP.lagkJointMomentsFromDMRAP(Matrix[] H) static MatrixCellLagkJointMomentsFromDMRAP.lagkJointMomentsFromDMRAP(Matrix[] H, int K) static MatrixCellLagkJointMomentsFromDMRAP.lagkJointMomentsFromDMRAP(Matrix[] H, int K, int L) static MatrixCellLagkJointMomentsFromDMRAP.lagkJointMomentsFromDMRAP(Matrix[] H, int K, int L, double prec) static MatrixLagkJointMomentsFromDRAP.lagkJointMomentsFromDRAP(Matrix H0, Matrix H1) static MatrixLagkJointMomentsFromDRAP.lagkJointMomentsFromDRAP(Matrix H0, Matrix H1, int K) static MatrixLagkJointMomentsFromDRAP.lagkJointMomentsFromDRAP(Matrix H0, Matrix H1, int K, int L) static MatrixLagkJointMomentsFromDRAP.lagkJointMomentsFromDRAP(Matrix H0, Matrix H1, int K, int L, double prec) Returns the lag-L joint moments of a discrete rational arrival process.MarginalDistributionFromDMAP.marginalDistributionFromDMAP(Matrix D0, Matrix D1) MarginalDistributionFromDMAP.marginalDistributionFromDMAP(Matrix D0, Matrix D1, double prec) Returns the discrete phase type distributed marginal distribution of a discrete Markovian arrival process.MarginalDistributionFromDMMAP.marginalDistributionFromDMMAP(Matrix[] D) MarginalDistributionFromDMMAP.marginalDistributionFromDMMAP(Matrix[] D, double prec) MarginalDistributionFromDMRAP.marginalDistributionFromDMRAP(Matrix[] H) MarginalDistributionFromDMRAP.marginalDistributionFromDMRAP(Matrix[] H, double prec) Overload for Matrix[].MarginalDistributionFromDRAP.marginalDistributionFromDRAP(Matrix H0, Matrix H1) MarginalDistributionFromDRAP.marginalDistributionFromDRAP(Matrix H0, Matrix H1, double prec) Returns the matrix geometrically distributed marginal distribution of a discrete rational arrival process.static double[]MarginalMomentsFromDMAP.marginalMomentsFromDMAP(Matrix D0, Matrix D1) static double[]MarginalMomentsFromDMAP.marginalMomentsFromDMAP(Matrix D0, Matrix D1, int K) static double[]MarginalMomentsFromDMAP.marginalMomentsFromDMAP(Matrix D0, Matrix D1, int K, double prec) Returns the moments of the marginal distribution of a discrete Markovian arrival process.static double[]MarginalMomentsFromDMMAP.marginalMomentsFromDMMAP(Matrix[] D) static double[]MarginalMomentsFromDMMAP.marginalMomentsFromDMMAP(Matrix[] D, int K) static double[]MarginalMomentsFromDMMAP.marginalMomentsFromDMMAP(Matrix[] D, int K, double prec) Overload for Matrix[].static double[]MarginalMomentsFromDMRAP.marginalMomentsFromDMRAP(Matrix[] H) static double[]MarginalMomentsFromDMRAP.marginalMomentsFromDMRAP(Matrix[] H, int K) static double[]MarginalMomentsFromDMRAP.marginalMomentsFromDMRAP(Matrix[] H, int K, double prec) Overload for Matrix[].static double[]MarginalMomentsFromDRAP.marginalMomentsFromDRAP(Matrix H0, Matrix H1) static double[]MarginalMomentsFromDRAP.marginalMomentsFromDRAP(Matrix H0, Matrix H1, int K) static double[]MarginalMomentsFromDRAP.marginalMomentsFromDRAP(Matrix H0, Matrix H1, int K, double prec) Returns the moments of the marginal distribution of a discrete rational arrival process.static int[]SamplesFromDMAP.samplesFromDMAP(Matrix D0, Matrix D1, int K) static int[]SamplesFromDMAP.samplesFromDMAP(Matrix D0, Matrix D1, int K, Integer initial) static int[]SamplesFromDMAP.samplesFromDMAP(Matrix D0, Matrix D1, int K, Integer initial, double prec) static int[]SamplesFromDMAP.samplesFromDMAP(Matrix D0, Matrix D1, int K, Integer initial, double prec, Random random) Generates random samples from a discrete Markovian arrival process.static ObjectSamplesFromDMMAP.samplesFromDMMAP(Matrix[] D, int K) static ObjectSamplesFromDMMAP.samplesFromDMMAP(Matrix[] D, int K, Integer initial, double prec, Random random) -
Uses of Matrix in jline.lib.butools.dph
Fields in jline.lib.butools.dph declared as MatrixModifier and TypeFieldDescriptionfinal MatrixMGFromMoments.MGRepresentation.Afinal MatrixMGFromMoments.MGRepresentation.alphafinal MatrixCanonicalFromDPH2.DPH2Representation.Bfinal MatrixCanonicalFromDPH3.DPH3Representation.Bfinal MatrixCanonicalFromDPH2.DPH2Representation.betafinal MatrixCanonicalFromDPH3.DPH3Representation.betaMethods in jline.lib.butools.dph that return MatrixModifier and TypeMethodDescriptionCanonicalFromDPH2.DPH2Representation.component1()MGFromMoments.MGRepresentation.component1()CanonicalFromDPH2.DPH2Representation.component2()MGFromMoments.MGRepresentation.component2()MGFromMoments.MGRepresentation.getA()MGFromMoments.MGRepresentation.getAlpha()Methods in jline.lib.butools.dph with parameters of type MatrixModifier and TypeMethodDescriptionAcyclicDPHFromMG.acyclicDPHFromMG(double[] alpha, Matrix A) AcyclicDPHFromMG.acyclicDPHFromMG(double[] alpha, Matrix A, double prec) AcyclicDPHFromMG.acyclicDPHFromMG(Matrix alpha, Matrix A) AcyclicDPHFromMG.acyclicDPHFromMG(Matrix alpha, Matrix A, double prec) Transforms a matrix-geometric representation to an acyclic DPH representation of the same size, if possible.CanonicalFromDPH2.canonicalFromDPH2(double[] alpha, Matrix A) CanonicalFromDPH2.canonicalFromDPH2(double[] alpha, Matrix A, double prec) Overload for double[] alpha.CanonicalFromDPH2.canonicalFromDPH2(Matrix alpha, Matrix A) CanonicalFromDPH2.canonicalFromDPH2(Matrix alpha, Matrix A, double prec) CanonicalFromDPH3.canonicalFromDPH3(double[] alpha, Matrix A) CanonicalFromDPH3.canonicalFromDPH3(double[] alpha, Matrix A, double prec) CanonicalFromDPH3.canonicalFromDPH3(Matrix alpha, Matrix A) CanonicalFromDPH3.canonicalFromDPH3(Matrix alpha, Matrix A, double prec) static doubleCdfFromDPH.cdfFromDPH(double[] alpha, Matrix A, int x) Overload for double[] alpha and single integer x.static double[]CdfFromDPH.cdfFromDPH(double[] alpha, Matrix A, int[] x) Overload for double[] alpha.static doubleCdfFromDPH.cdfFromDPH(Matrix alpha, Matrix A, int x) Overload for single integer x.static double[]CdfFromDPH.cdfFromDPH(Matrix alpha, Matrix A, int[] x) Returns the cumulative distribution function of a discrete phase-type distribution.static doubleOverload for double[] alpha and single integer x.static double[]Overload for double[] alpha.static doubleOverload for single integer x.static double[]Returns the cumulative distribution function of a matrix-geometric distribution.static booleanCheckDPHRepresentation.checkDPHRepresentation(double[] alpha, Matrix A) static booleanCheckDPHRepresentation.checkDPHRepresentation(double[] alpha, Matrix A, double prec) Overload for double[] alpha.static booleanCheckDPHRepresentation.checkDPHRepresentation(Matrix alpha, Matrix A) static booleanCheckDPHRepresentation.checkDPHRepresentation(Matrix alpha, Matrix A, double prec) Checks if the given vector and matrix define a valid discrete phase-type representation.static booleanCheckMGRepresentation.checkMGRepresentation(double[] alpha, Matrix A) static booleanCheckMGRepresentation.checkMGRepresentation(double[] alpha, Matrix A, double prec) static booleanCheckMGRepresentation.checkMGRepresentation(Matrix alpha, Matrix A) static booleanCheckMGRepresentation.checkMGRepresentation(Matrix alpha, Matrix A, double prec) Checks if the given vector and matrix define a valid matrix-geometric representation.Overload for double[] alpha.Obtains a Markovian representation of a matrix-geometric distribution of the same size, if possible.static double[]MomentsFromDPH.momentsFromDPH(double[] alpha, Matrix A) static double[]MomentsFromDPH.momentsFromDPH(double[] alpha, Matrix A, int K) Overload for double[] alpha.static double[]MomentsFromDPH.momentsFromDPH(Matrix alpha, Matrix A) static double[]MomentsFromDPH.momentsFromDPH(Matrix alpha, Matrix A, int K) Returns the first K moments of a discrete phase-type distribution.static double[]MomentsFromMG.momentsFromMG(double[] alpha, Matrix A) static double[]MomentsFromMG.momentsFromMG(double[] alpha, Matrix A, int K) static double[]MomentsFromMG.momentsFromMG(Matrix alpha, Matrix A) static double[]MomentsFromMG.momentsFromMG(Matrix alpha, Matrix A, int K) Returns the first K moments of a matrix-geometric distribution.static doublePmfFromDPH.pmfFromDPH(double[] alpha, Matrix A, int x) Overload for double[] alpha and single integer x.static double[]PmfFromDPH.pmfFromDPH(double[] alpha, Matrix A, int[] x) Overload for double[] alpha.static doublePmfFromDPH.pmfFromDPH(Matrix alpha, Matrix A, int x) Overload for single integer x.static double[]PmfFromDPH.pmfFromDPH(Matrix alpha, Matrix A, int[] x) Returns the probability mass function of a discrete phase-type distribution.static doublestatic double[]static doublestatic double[]Returns the probability mass function of a matrix-geometric distribution.static int[]SamplesFromDPH.samplesFromDPH(double[] alpha, Matrix A, int K) static int[]SamplesFromDPH.samplesFromDPH(double[] alpha, Matrix A, int K, Random random) Overload for double[] alpha.static int[]SamplesFromDPH.samplesFromDPH(Matrix alpha, Matrix A, int K) static int[]SamplesFromDPH.samplesFromDPH(Matrix alpha, Matrix A, int K, Random random) Generates random samples from a discrete phase-type distribution.Constructors in jline.lib.butools.dph with parameters of type MatrixModifierConstructorDescriptionDPH2Representation(Matrix beta, Matrix B) DPH3Representation(Matrix beta, Matrix B) MGRepresentation(Matrix alpha, Matrix A) -
Uses of Matrix in jline.lib.butools.fitting
Fields in jline.lib.butools.fitting declared as MatrixModifier and TypeFieldDescriptionfinal MatrixPHFromTrace.PHFitResult.Afinal MatrixPHFromTrace.PHFitResult.alphafinal MatrixMAPFitResult.D0final MatrixMAPFitResult.D1Methods in jline.lib.butools.fitting with parameters of type MatrixModifier and TypeMethodDescriptionstatic doubleLikelihoodFromTrace.likelihoodFromTraceMAP(double[] trace, Matrix D0, Matrix D1) static doubleLikelihoodFromTrace.likelihoodFromTraceMAP(double[] trace, Matrix D0, Matrix D1, double prec) Evaluates the log-likelihood of a trace with the given MAP.static doubleLikelihoodFromTrace.likelihoodFromTracePH(double[] trace, Matrix alpha, Matrix A) static doubleLikelihoodFromTrace.likelihoodFromTracePH(double[] trace, Matrix alpha, Matrix A, double prec) Evaluates the log-likelihood of a trace with the given PH distribution.static MAPFitResultMAPFromTrace.mapFromTrace(double[] trace, int[] orders, int maxIter, double stopCond, Matrix[] initialGuess) static MAPFitResultMAPFromTrace.mapFromTrace(double[] trace, int[] orders, int maxIter, double stopCond, Matrix[] initialGuess, String resultFormat) Performs MAP fitting using the EM algorithm (ErCHMM).Constructors in jline.lib.butools.fitting with parameters of type MatrixModifierConstructorDescriptionMAPFitResult(Matrix D0, Matrix D1, double logli) PHFitResult(Matrix alpha, Matrix A, double logli) -
Uses of Matrix in jline.lib.butools.mam
Fields in jline.lib.butools.mam declared as MatrixModifier and TypeFieldDescriptionfinal MatrixFluidSolve.FluidSolution.clofinal MatrixFluidSolve.FluidSolution.inifinal MatrixFluidSolve.FluidSolution.Kfinal MatrixFluidSolve.FluidSolution.mass0Methods in jline.lib.butools.mam that return MatrixModifier and TypeMethodDescriptionstatic MatrixFluidStationaryDistr.fluidStationaryDistr(Matrix mass0, Matrix ini, Matrix K, Matrix clo, double[] x) Returns the stationary distribution of a Markovian fluid model at specific points.GeneralFluidSolution.getClo()GeneralFluidSolution.getIni()GeneralFluidSolution.getK()GeneralFluidSolution.getMass0()static MatrixGM1FundamentalMatrix.gm1FundamentalMatrix(List<Matrix> A) static MatrixGM1FundamentalMatrix.gm1FundamentalMatrix(List<Matrix> A, double precision) static MatrixGM1FundamentalMatrix.gm1FundamentalMatrix(List<Matrix> A, double precision, int maxNumIt) static MatrixGM1FundamentalMatrix.gm1FundamentalMatrix(List<Matrix> A, double precision, int maxNumIt, GM1FundamentalMatrix.GM1Method method) Returns matrix R corresponding to the G/M/1 type Markov chain given by matrices A.static MatrixGM1StationaryDistr.gm1StationaryDistr(List<Matrix> B, Matrix R, int K) Returns the stationary distribution of the G/M/1 type Markov chain up to a given level K.static MatrixGM1StationaryDistr.gm1StationaryDistr(Matrix[] B, Matrix R, int K) Overload accepting Matrix[].static MatrixMG1FundamentalMatrix.mg1FundamentalMatrix(List<Matrix> A) static MatrixMG1FundamentalMatrix.mg1FundamentalMatrix(List<Matrix> A, double precision) static MatrixMG1FundamentalMatrix.mg1FundamentalMatrix(List<Matrix> A, double precision, int maxNumIt) static MatrixMG1FundamentalMatrix.mg1FundamentalMatrix(List<Matrix> A, double precision, int maxNumIt, MG1FundamentalMatrix.MG1Method method) Returns matrix G corresponding to the M/G/1 type Markov chain defined by matrices A.static MatrixMG1StationaryDistr.mg1StationaryDistr(List<Matrix> A) static MatrixMG1StationaryDistr.mg1StationaryDistr(List<Matrix> A, List<Matrix> B) static Matrixstatic Matrixstatic MatrixReturns the stationary distribution of the M/G/1 type Markov chain up to a given level K.static MatrixMG1StationaryDistr.mg1StationaryDistr(Matrix[] A) static MatrixMG1StationaryDistr.mg1StationaryDistr(Matrix[] A, Matrix[] B) static MatrixMG1StationaryDistr.mg1StationaryDistr(Matrix[] A, Matrix[] B, Matrix G) static MatrixMG1StationaryDistr.mg1StationaryDistr(Matrix[] A, Matrix[] B, Matrix G, int K) static MatrixMG1StationaryDistr.mg1StationaryDistr(Matrix[] A, Matrix[] B, Matrix G, int K, double prec) Overload accepting Matrix[] for A and B.static MatrixQBDStationaryDistr.qbdStationaryDistr(double[] pi0, Matrix R, int K) Overload for double[] pi0.static MatrixQBDStationaryDistr.qbdStationaryDistr(Matrix pi0, Matrix R, int K) Returns the stationary distribution of a QBD up to a given level K.Methods in jline.lib.butools.mam that return types with arguments of type MatrixModifier and TypeMethodDescriptionReturns the parameters of the matrix-geometrically distributed stationary distribution of a QBD.Returns the parameters of the matrix-geometrically distributed stationary distribution of a QBD.Methods in jline.lib.butools.mam with parameters of type MatrixModifier and TypeMethodDescriptionstatic FluidSolve.FluidSolutionFluidSolve.fluidSolve(Matrix Fpp, Matrix Fpm, Matrix Fmp, Matrix Fmm) static FluidSolve.FluidSolutionFluidSolve.fluidSolve(Matrix Fpp, Matrix Fpm, Matrix Fmp, Matrix Fmm, double prec) Returns the parameters of the matrix-exponentially distributed stationary distribution of a canonical Markovian fluid model.static MatrixFluidStationaryDistr.fluidStationaryDistr(Matrix mass0, Matrix ini, Matrix K, Matrix clo, double[] x) Returns the stationary distribution of a Markovian fluid model at specific points.static GeneralFluidSolutionGeneralFluidSolve.generalFluidSolve(Matrix Q, Matrix R) static GeneralFluidSolutionGeneralFluidSolve.generalFluidSolve(Matrix Q, Matrix R, Matrix Q0) static GeneralFluidSolutionGeneralFluidSolve.generalFluidSolve(Matrix Q, Matrix R, Matrix Q0, double prec) Returns the parameters of the matrix-exponentially distributed stationary distribution of a general Markovian fluid model.static MatrixGM1StationaryDistr.gm1StationaryDistr(List<Matrix> B, Matrix R, int K) Returns the stationary distribution of the G/M/1 type Markov chain up to a given level K.static MatrixGM1StationaryDistr.gm1StationaryDistr(Matrix[] B, Matrix R, int K) Overload accepting Matrix[].static Matrixstatic Matrixstatic MatrixReturns the stationary distribution of the M/G/1 type Markov chain up to a given level K.static MatrixMG1StationaryDistr.mg1StationaryDistr(Matrix[] A) static MatrixMG1StationaryDistr.mg1StationaryDistr(Matrix[] A, Matrix[] B) static MatrixMG1StationaryDistr.mg1StationaryDistr(Matrix[] A, Matrix[] B, Matrix G) static MatrixMG1StationaryDistr.mg1StationaryDistr(Matrix[] A, Matrix[] B, Matrix G, int K) static MatrixMG1StationaryDistr.mg1StationaryDistr(Matrix[] A, Matrix[] B, Matrix G, int K, double prec) Overload accepting Matrix[] for A and B.Returns the parameters of the matrix-geometrically distributed stationary distribution of a QBD.static MatrixQBDStationaryDistr.qbdStationaryDistr(double[] pi0, Matrix R, int K) Overload for double[] pi0.static MatrixQBDStationaryDistr.qbdStationaryDistr(Matrix pi0, Matrix R, int K) Returns the stationary distribution of a QBD up to a given level K.Method parameters in jline.lib.butools.mam with type arguments of type MatrixModifier and TypeMethodDescriptionstatic MatrixGM1FundamentalMatrix.gm1FundamentalMatrix(List<Matrix> A) static MatrixGM1FundamentalMatrix.gm1FundamentalMatrix(List<Matrix> A, double precision) static MatrixGM1FundamentalMatrix.gm1FundamentalMatrix(List<Matrix> A, double precision, int maxNumIt) static MatrixGM1FundamentalMatrix.gm1FundamentalMatrix(List<Matrix> A, double precision, int maxNumIt, GM1FundamentalMatrix.GM1Method method) Returns matrix R corresponding to the G/M/1 type Markov chain given by matrices A.static MatrixGM1StationaryDistr.gm1StationaryDistr(List<Matrix> B, Matrix R, int K) Returns the stationary distribution of the G/M/1 type Markov chain up to a given level K.static MatrixMG1FundamentalMatrix.mg1FundamentalMatrix(List<Matrix> A) static MatrixMG1FundamentalMatrix.mg1FundamentalMatrix(List<Matrix> A, double precision) static MatrixMG1FundamentalMatrix.mg1FundamentalMatrix(List<Matrix> A, double precision, int maxNumIt) static MatrixMG1FundamentalMatrix.mg1FundamentalMatrix(List<Matrix> A, double precision, int maxNumIt, MG1FundamentalMatrix.MG1Method method) Returns matrix G corresponding to the M/G/1 type Markov chain defined by matrices A.static MatrixMG1StationaryDistr.mg1StationaryDistr(List<Matrix> A) static MatrixMG1StationaryDistr.mg1StationaryDistr(List<Matrix> A, List<Matrix> B) static Matrixstatic Matrixstatic MatrixReturns the stationary distribution of the M/G/1 type Markov chain up to a given level K.Constructors in jline.lib.butools.mam with parameters of type MatrixModifierConstructorDescriptionFluidSolution(Matrix mass0, Matrix ini, Matrix K, Matrix clo) GeneralFluidSolution(Matrix mass0, Matrix ini, Matrix K, Matrix clo) -
Uses of Matrix in jline.lib.butools.map
Methods in jline.lib.butools.map that return MatrixModifier and TypeMethodDescriptionMAPRepresentation.component1()MAPRepresentation.component2()MAPRepresentation.getD0()MAPRepresentation.getD1()static MatrixLagkJointMomentsFromMAP.lagkJointMomentsFromMAP(Matrix D0, Matrix D1) static MatrixLagkJointMomentsFromMAP.lagkJointMomentsFromMAP(Matrix D0, Matrix D1, int K) static MatrixLagkJointMomentsFromMAP.lagkJointMomentsFromMAP(Matrix D0, Matrix D1, int K, int L) static MatrixLagkJointMomentsFromMAP.lagkJointMomentsFromMAP(Matrix D0, Matrix D1, int K, int L, double prec) Returns the lag-L joint moments of a continuous Markovian arrival process.static MatrixLagkJointMomentsFromRAP.lagkJointMomentsFromRAP(Matrix H0, Matrix H1) static MatrixLagkJointMomentsFromRAP.lagkJointMomentsFromRAP(Matrix H0, Matrix H1, int K) static MatrixLagkJointMomentsFromRAP.lagkJointMomentsFromRAP(Matrix H0, Matrix H1, int K, int L) static MatrixLagkJointMomentsFromRAP.lagkJointMomentsFromRAP(Matrix H0, Matrix H1, int K, int L, double prec) Returns the lag-L joint moments of a continuous rational arrival process.static Matrix[]MAPFromFewMomentsAndCorrelations.mapFromFewMomentsAndCorrelations(double[] moms) static Matrix[]MAPFromFewMomentsAndCorrelations.mapFromFewMomentsAndCorrelations(double[] moms, double corr1) static Matrix[]MAPFromFewMomentsAndCorrelations.mapFromFewMomentsAndCorrelations(double[] moms, double corr1, Double r) Creates a Markovian arrival process that has the given 2 or 3 marginal moments and lag-1 autocorrelation.Methods in jline.lib.butools.map that return types with arguments of type MatrixModifier and TypeMethodDescriptionCanonicalFromMAP2.canonicalFromMAP2(Matrix D0, Matrix D1) CanonicalFromMAP2.canonicalFromMAP2(Matrix D0, Matrix D1) CanonicalFromMAP2.canonicalFromMAP2(Matrix D0, Matrix D1, double prec) Returns the canonical form of an order-2 Markovian arrival process.CanonicalFromMAP2.canonicalFromMAP2(Matrix D0, Matrix D1, double prec) Returns the canonical form of an order-2 Markovian arrival process.MAP2FromMoments.map2FromMoments(double[] moms, double corr1) Returns a MAP(2) which has the same 3 marginal moments and lag-1 autocorrelation as given.MAP2FromMoments.map2FromMoments(double[] moms, double corr1) Returns a MAP(2) which has the same 3 marginal moments and lag-1 autocorrelation as given.MAPFromRAP.mapFromRAP(Matrix H0, Matrix H1) MAPFromRAP.mapFromRAP(Matrix H0, Matrix H1) MAPFromRAP.mapFromRAP(Matrix H0, Matrix H1, double prec) Obtains a Markovian representation of a continuous rational arrival process of the same size, if possible.MAPFromRAP.mapFromRAP(Matrix H0, Matrix H1, double prec) Obtains a Markovian representation of a continuous rational arrival process of the same size, if possible.MinimalRepFromRAP.minimalRepFromRAP(Matrix H0, Matrix H1) MinimalRepFromRAP.minimalRepFromRAP(Matrix H0, Matrix H1) MinimalRepFromRAP.minimalRepFromRAP(Matrix H0, Matrix H1, String how) MinimalRepFromRAP.minimalRepFromRAP(Matrix H0, Matrix H1, String how) MinimalRepFromRAP.minimalRepFromRAP(Matrix H0, Matrix H1, String how, double precision) Returns the minimal representation of a rational arrival process.MinimalRepFromRAP.minimalRepFromRAP(Matrix H0, Matrix H1, String how, double precision) Returns the minimal representation of a rational arrival process.MRAPFromMoments.rapFromMoments(double[] moms, Matrix Nm) Creates a rational arrival process that has the same marginal and lag-1 joint moments as given.MRAPFromMoments.rapFromMoments(double[] moms, Matrix Nm) Creates a rational arrival process that has the same marginal and lag-1 joint moments as given.RAPFromMomentsAndCorrelations.rapFromMomentsAndCorrelations(double[] moms, double[] corr) Returns a rational arrival process that has the same moments and lag autocorrelation coefficients as given.RAPFromMomentsAndCorrelations.rapFromMomentsAndCorrelations(double[] moms, double[] corr) Returns a rational arrival process that has the same moments and lag autocorrelation coefficients as given.Methods in jline.lib.butools.map with parameters of type MatrixModifier and TypeMethodDescriptionCanonicalFromMAP2.canonicalFromMAP2(Matrix D0, Matrix D1) CanonicalFromMAP2.canonicalFromMAP2(Matrix D0, Matrix D1, double prec) Returns the canonical form of an order-2 Markovian arrival process.static booleanCheckMAPRepresentation.checkMAPRepresentation(Matrix D0, Matrix D1) static booleanCheckMAPRepresentation.checkMAPRepresentation(Matrix D0, Matrix D1, double prec) Checks if the input matrices define a continuous time MAP.static booleanCheckMMAPRepresentation.checkMMAPRepresentation(Matrix[] D) static booleanCheckMMAPRepresentation.checkMMAPRepresentation(Matrix[] D, double prec) Overload for Matrix[].static booleanCheckMRAPRepresentation.checkMRAPRepresentation(Matrix[] H) static booleanCheckMRAPRepresentation.checkMRAPRepresentation(Matrix[] H, double prec) Overload for Matrix[].static booleanCheckMAPRepresentation.checkRAPRepresentation(Matrix H0, Matrix H1) static booleanCheckMAPRepresentation.checkRAPRepresentation(Matrix H0, Matrix H1, double prec) Checks if the input matrices define a valid RAP representation.static double[]LagCorrelationsFromMAP.lagCorrelationsFromMAP(Matrix D0, Matrix D1) static double[]LagCorrelationsFromMAP.lagCorrelationsFromMAP(Matrix D0, Matrix D1, int L) Returns the lag autocorrelations of a Markovian arrival process.static double[]LagCorrelationsFromMAP.lagCorrelationsFromRAP(Matrix H0, Matrix H1) static double[]LagCorrelationsFromMAP.lagCorrelationsFromRAP(Matrix H0, Matrix H1, int L) Returns the lag autocorrelations of a rational arrival process.static MatrixLagkJointMomentsFromMAP.lagkJointMomentsFromMAP(Matrix D0, Matrix D1) static MatrixLagkJointMomentsFromMAP.lagkJointMomentsFromMAP(Matrix D0, Matrix D1, int K) static MatrixLagkJointMomentsFromMAP.lagkJointMomentsFromMAP(Matrix D0, Matrix D1, int K, int L) static MatrixLagkJointMomentsFromMAP.lagkJointMomentsFromMAP(Matrix D0, Matrix D1, int K, int L, double prec) Returns the lag-L joint moments of a continuous Markovian arrival process.static MatrixCellLagkJointMomentsFromMMAP.lagkJointMomentsFromMMAP(Matrix[] D) static MatrixCellLagkJointMomentsFromMMAP.lagkJointMomentsFromMMAP(Matrix[] D, int K) static MatrixCellLagkJointMomentsFromMMAP.lagkJointMomentsFromMMAP(Matrix[] D, int K, int L) static MatrixCellLagkJointMomentsFromMMAP.lagkJointMomentsFromMMAP(Matrix[] D, int K, int L, double prec) Overload for Matrix[].static MatrixCellLagkJointMomentsFromMRAP.lagkJointMomentsFromMRAP(Matrix[] H, int K, int L, double prec) Overload for Matrix[].static MatrixLagkJointMomentsFromRAP.lagkJointMomentsFromRAP(Matrix H0, Matrix H1) static MatrixLagkJointMomentsFromRAP.lagkJointMomentsFromRAP(Matrix H0, Matrix H1, int K) static MatrixLagkJointMomentsFromRAP.lagkJointMomentsFromRAP(Matrix H0, Matrix H1, int K, int L) static MatrixLagkJointMomentsFromRAP.lagkJointMomentsFromRAP(Matrix H0, Matrix H1, int K, int L, double prec) Returns the lag-L joint moments of a continuous rational arrival process.MAPFromRAP.mapFromRAP(Matrix H0, Matrix H1) MAPFromRAP.mapFromRAP(Matrix H0, Matrix H1, double prec) Obtains a Markovian representation of a continuous rational arrival process of the same size, if possible.static PHRepresentationMarginalDistributionFromMAP.marginalDistributionFromMAP(Matrix D0, Matrix D1) Returns the phase type distributed marginal distribution of a Markovian arrival process.static PHRepresentationMarginalDistributionFromMMAP.marginalDistributionFromMMAP(Matrix[] D) static PHRepresentationMarginalDistributionFromMMAP.marginalDistributionFromMMAP(Matrix[] D, double prec) static PHRepresentationMarginalDistributionFromMRAP.marginalDistributionFromMRAP(Matrix[] H) static PHRepresentationMarginalDistributionFromMRAP.marginalDistributionFromMRAP(Matrix[] H, double prec) Overload for Matrix[].static PHRepresentationMarginalDistributionFromMAP.marginalDistributionFromRAP(Matrix H0, Matrix H1) Returns the matrix exponential distributed marginal distribution of a rational arrival process.static double[]MarginalMomentsFromMAP.marginalMomentsFromMAP(Matrix D0, Matrix D1) static double[]MarginalMomentsFromMAP.marginalMomentsFromMAP(Matrix D0, Matrix D1, int K) Returns the moments of the marginal distribution of a Markovian arrival process.static double[]MarginalMomentsFromMMAP.marginalMomentsFromMMAP(Matrix[] D) static double[]MarginalMomentsFromMMAP.marginalMomentsFromMMAP(Matrix[] D, int K) static double[]MarginalMomentsFromMMAP.marginalMomentsFromMMAP(Matrix[] D, int K, double prec) Overload for Matrix[].static double[]MarginalMomentsFromMRAP.marginalMomentsFromMRAP(Matrix[] H) static double[]MarginalMomentsFromMRAP.marginalMomentsFromMRAP(Matrix[] H, int K) static double[]MarginalMomentsFromMRAP.marginalMomentsFromMRAP(Matrix[] H, int K, double prec) Overload for Matrix[].static double[]MarginalMomentsFromMAP.marginalMomentsFromRAP(Matrix H0, Matrix H1) static double[]MarginalMomentsFromMAP.marginalMomentsFromRAP(Matrix H0, Matrix H1, int K) Returns the moments of the marginal distribution of a rational arrival process.static MatrixCellMinimalRepFromMRAP.minimalRepFromMRAP(Matrix[] H, String how, double precision) Overload for Matrix[].MinimalRepFromRAP.minimalRepFromRAP(Matrix H0, Matrix H1) MinimalRepFromRAP.minimalRepFromRAP(Matrix H0, Matrix H1, String how) MinimalRepFromRAP.minimalRepFromRAP(Matrix H0, Matrix H1, String how, double precision) Returns the minimal representation of a rational arrival process.static MatrixCellMMAPFromMRAP.mmapFromMRAP(Matrix[] H) static MatrixCellMMAPFromMRAP.mmapFromMRAP(Matrix[] H, double prec) Overload for Matrix[].static MatrixCellMRAPFromMoments.mrapFromMoments(double[] moms, Matrix[] Nm) Overload for Matrix[].MRAPFromMoments.rapFromMoments(double[] moms, Matrix Nm) Creates a rational arrival process that has the same marginal and lag-1 joint moments as given.static double[]SamplesFromMAP.samplesFromMAP(Matrix D0, Matrix D1, int K) static double[]SamplesFromMAP.samplesFromMAP(Matrix D0, Matrix D1, int K, Integer initial) static double[]SamplesFromMAP.samplesFromMAP(Matrix D0, Matrix D1, int K, Integer initial, Random random) Generates random samples from a Markovian arrival process.static ObjectSamplesFromMMAP.samplesFromMMAP(Matrix[] D, int K) static ObjectSamplesFromMMAP.samplesFromMMAP(Matrix[] D, int K, Integer initial, double prec, Random random) Constructors in jline.lib.butools.map with parameters of type Matrix -
Uses of Matrix in jline.lib.butools.mc
Methods in jline.lib.butools.mc that return MatrixModifier and TypeMethodDescriptionstatic Matrixstatic MatrixComputes the stationary solution of a continuous time rational process (CRP).static Matrixstatic MatrixComputes the stationary solution of a continuous time Markov chain.static MatrixComputes the stationary solution of a discrete time rational process (DRP).static Matrixstatic MatrixComputes the stationary solution of a discrete time Markov chain.Methods in jline.lib.butools.mc with parameters of type MatrixModifier and TypeMethodDescriptionstatic booleanCheckGenerator.checkGenerator(Matrix Q) static booleanCheckGenerator.checkGenerator(Matrix Q, boolean transient_) static booleanCheckGenerator.checkGenerator(Matrix Q, boolean transient_, double prec) Checks if the matrix is a valid generator matrix.static booleanCheckProbMatrix.checkProbMatrix(Matrix P) static booleanCheckProbMatrix.checkProbMatrix(Matrix P, boolean transient_) static booleanCheckProbMatrix.checkProbMatrix(Matrix P, boolean transient_, double prec) Checks if the matrix is a valid probability matrix.static booleanCheckProbVector.checkProbVector(Matrix pi) static booleanCheckProbVector.checkProbVector(Matrix pi, boolean sub) static booleanCheckProbVector.checkProbVector(Matrix pi, boolean sub, double prec) Checks if the vector is a valid probability vector: the vector has only non-negative elements, the sum of the vector elements is 1.static Matrixstatic MatrixComputes the stationary solution of a continuous time rational process (CRP).static Matrixstatic MatrixComputes the stationary solution of a continuous time Markov chain.static MatrixComputes the stationary solution of a discrete time rational process (DRP).static Matrixstatic MatrixComputes the stationary solution of a discrete time Markov chain. -
Uses of Matrix in jline.lib.butools.ph
Fields in jline.lib.butools.ph declared as MatrixModifier and TypeFieldDescriptionfinal MatrixMERepresentation.Afinal MatrixPH2From3Moments.PH2Representation.Afinal MatrixPH3Representation.Afinal MatrixPHRepresentation.Afinal MatrixMERepresentation.alphafinal MatrixPH2From3Moments.PH2Representation.alphafinal MatrixPH3Representation.alphafinal MatrixPHRepresentation.alphaMethods in jline.lib.butools.ph that return MatrixModifier and TypeMethodDescriptionMERepresentation.component1()PH2From3Moments.PH2Representation.component1()PH3Representation.component1()PHRepresentation.component1()MERepresentation.component2()PH2From3Moments.PH2Representation.component2()PH3Representation.component2()PHRepresentation.component2()MERepresentation.getA()PH3Representation.getA()PHRepresentation.getA()MERepresentation.getAlpha()PH3Representation.getAlpha()PHRepresentation.getAlpha()Methods in jline.lib.butools.ph with parameters of type MatrixModifier and TypeMethodDescriptionstatic PHRepresentationAcyclicPHFromME.acyclicPHFromME(Matrix alpha, Matrix A) static PHRepresentationAcyclicPHFromME.acyclicPHFromME(Matrix alpha, Matrix A, int maxSize) static PHRepresentationAcyclicPHFromME.acyclicPHFromME(Matrix alpha, Matrix A, int maxSize, double prec) Transforms an arbitrary matrix-exponential representation to an acyclic phase-type representation.CanonicalFromPH2.canonicalFromPH2(double[] alpha, Matrix A) CanonicalFromPH2.canonicalFromPH2(double[] alpha, Matrix A, double prec) CanonicalFromPH2.canonicalFromPH2(Matrix alpha, Matrix A) CanonicalFromPH2.canonicalFromPH2(Matrix alpha, Matrix A, double prec) Returns the canonical form of an order-2 phase-type distribution.static PH3RepresentationCanonicalFromPH3.canonicalFromPH3(double[] alpha, Matrix A) static PH3RepresentationCanonicalFromPH3.canonicalFromPH3(double[] alpha, Matrix A, double prec) static PH3RepresentationCanonicalFromPH3.canonicalFromPH3(Matrix alpha, Matrix A) static PH3RepresentationCanonicalFromPH3.canonicalFromPH3(Matrix alpha, Matrix A, double prec) Returns the canonical form of an order-3 phase-type distribution.static double[]Overload for double[] alpha.static double[]Returns the cumulative distribution function of a matrix-exponential distribution.static double[]Overload for double[] alpha.static double[]Returns the cumulative distribution function of a phase-type distribution.static booleanCheckMEPositiveDensity.checkMEPositiveDensity(Matrix alpha, Matrix A) static booleanCheckMEPositiveDensity.checkMEPositiveDensity(Matrix alpha, Matrix A, int maxSize) static booleanCheckMEPositiveDensity.checkMEPositiveDensity(Matrix alpha, Matrix A, int maxSize, double prec) Checks if the given ME distribution has positive density.static booleanCheckMERepresentation.checkMERepresentation(double[] alpha, Matrix A) static booleanCheckMERepresentation.checkMERepresentation(double[] alpha, Matrix A, double prec) Overload for double[] alpha.static booleanCheckMERepresentation.checkMERepresentation(Matrix alpha, Matrix A) static booleanCheckMERepresentation.checkMERepresentation(Matrix alpha, Matrix A, double prec) Checks if the given vector and matrix define a valid matrix- exponential representation.static booleanCheckPHRepresentation.checkPHRepresentation(double[] alpha, Matrix A) static booleanCheckPHRepresentation.checkPHRepresentation(double[] alpha, Matrix A, double prec) Overload for double[] alpha.static booleanCheckPHRepresentation.checkPHRepresentation(Matrix alpha, Matrix A) static booleanCheckPHRepresentation.checkPHRepresentation(Matrix alpha, Matrix A, double prec) Checks if the given vector and matrix define a valid phase- type representation.static booleanCheckRAPRepresentation.checkRAPRepresentation(Matrix H0, Matrix H1) static booleanCheckRAPRepresentation.checkRAPRepresentation(Matrix H0, Matrix H1, double prec) Checks if the given matrices define a valid Rational Arrival Process (RAP) representation.static Pair<double[], double[]> IntervalPdfFromPH.intervalPdfFromME(Matrix alpha, Matrix A, double[] intBounds) Returns the approximate probability density function of a matrix-exponential distribution, based on the probability of falling into intervals.static Pair<double[], double[]> IntervalPdfFromPH.intervalPdfFromPH(Matrix alpha, Matrix A, double[] intBounds) Returns the approximate probability density function of a continuous phase-type distribution, based on the probability of falling into intervals.static intstatic intstatic intReturns the order of the ME distribution (which is not necessarily equal to the size of the representation).static MERepresentationMinimalRepFromME.minimalRepFromME(Matrix alpha, Matrix A) static MERepresentationMinimalRepFromME.minimalRepFromME(Matrix alpha, Matrix A, String how) static MERepresentationMinimalRepFromME.minimalRepFromME(Matrix alpha, Matrix A, String how, double prec) Returns the minimal representation of the given ME distribution.static double[]MomentsFromME.momentsFromME(double[] alpha, Matrix A) static double[]MomentsFromME.momentsFromME(double[] alpha, Matrix A, int K) Overload for double[] alpha.static double[]MomentsFromME.momentsFromME(Matrix alpha, Matrix A) static double[]MomentsFromME.momentsFromME(Matrix alpha, Matrix A, int K) Returns the first K moments of a matrix-exponential distribution.static double[]MomentsFromME.momentsFromPH(double[] alpha, Matrix A) static double[]MomentsFromME.momentsFromPH(double[] alpha, Matrix A, int K) Overload for double[] alpha.static double[]MomentsFromME.momentsFromPH(Matrix alpha, Matrix A) static double[]MomentsFromME.momentsFromPH(Matrix alpha, Matrix A, int K) Returns the first K moments of a phase-type distribution.static PHRepresentationMonocyclicPHFromME.monocyclicPHFromME(Matrix alpha, Matrix A) static PHRepresentationMonocyclicPHFromME.monocyclicPHFromME(Matrix alpha, Matrix A, int maxSize) static PHRepresentationMonocyclicPHFromME.monocyclicPHFromME(Matrix alpha, Matrix A, int maxSize, double prec) Transforms an arbitrary matrix-exponential representation to a Markovian monocyclic representation.static double[]Overload for double[] alpha.static double[]Returns the probability density function of a matrix-exponential distribution.static double[]Overload for double[] alpha.static double[]Returns the probability density function of a phase-type distribution.static PHRepresentationstatic PHRepresentationObtains a Markovian representation of a matrix exponential distribution of the same size, if possible, using elementary similarity transformations.static double[]SamplesFromPH.samplesFromPH(double[] alpha, Matrix A, int K) static double[]SamplesFromPH.samplesFromPH(double[] alpha, Matrix A, int K, Random random) static double[]SamplesFromPH.samplesFromPH(Matrix alpha, Matrix A, int K) static double[]SamplesFromPH.samplesFromPH(Matrix alpha, Matrix A, int K, Random random) Generates random samples from a phase-type distribution.Constructors in jline.lib.butools.ph with parameters of type MatrixModifierConstructorDescriptionMERepresentation(Matrix alpha, Matrix A) PH2Representation(Matrix alpha, Matrix A) PH3Representation(Matrix alpha, Matrix A) PHRepresentation(Matrix alpha, Matrix A) -
Uses of Matrix in jline.lib.butools.queues
Methods in jline.lib.butools.queues with parameters of type MatrixModifier and TypeMethodDescriptionstatic FluFluResultFluFluQueue.fluFluQueue(Matrix Qin, Matrix Rin, Matrix Qout, Matrix Rout, boolean srv0stop) static FluFluResultFluFluQueue.fluFluQueue(Matrix Qin, Matrix Rin, Matrix Qout, Matrix Rout, boolean srv0stop, int numFluidMoments, int numSojournMoments) static FluFluResultFluFluQueue.fluFluQueue(Matrix Qin, Matrix Rin, Matrix Qout, Matrix Rout, boolean srv0stop, int numFluidMoments, int numSojournMoments, double prec) Returns various performance measures of a fluid queue with independent fluid arrival and service processes.FluidQueue.fluidQueue(Matrix Q, Matrix Rin, Matrix Rout, Map<String, Object> measures, Matrix Q0, double prec) Returns various performance measures of a fluid queue.MAPMAP1.mapmap1(Matrix D0, Matrix D1, Matrix S0, Matrix S1, Map<String, Object> measures, double prec) Returns various performance measures of a continuous time MAP/MAP/1 queue.QBDQueue.qbdQueue(Matrix B, Matrix L, Matrix F, Matrix L0, Map<String, Object> measures, double prec) Returns various performance measures of a continuous time QBD queue. -
Uses of Matrix in jline.lib.butools.reptrans
Methods in jline.lib.butools.reptrans that return MatrixModifier and TypeMethodDescriptionMarkovianRepresentation.getB()MarkovianRepresentation.getBeta()static MatrixSimilarityMatrix.similarityMatrix(Matrix A1, Matrix A2) Returns the matrix that transforms A1 to A2.static MatrixTransformToAcyclic.transformToAcyclic(Matrix A) static MatrixTransformToAcyclic.transformToAcyclic(Matrix A, int maxSize) static MatrixTransformToAcyclic.transformToAcyclic(Matrix A, int maxSize, double precision) Transforms an arbitrary matrix to a Markovian bi-diagonal matrix.static MatrixTransformToMonocyclic.transformToMonocyclic(Matrix A) static MatrixTransformToMonocyclic.transformToMonocyclic(Matrix A, int maxSize) static MatrixTransformToMonocyclic.transformToMonocyclic(Matrix A, int maxSize, double precision) Transforms an arbitrary matrix to a Markovian monocyclic matrix.Methods in jline.lib.butools.reptrans that return types with arguments of type MatrixModifier and TypeMethodDescriptionFindMarkovianRepresentation.findMarkovianRepresentation(List<Matrix> rep, FindMarkovianRepresentation.TransFun transfun, FindMarkovianRepresentation.EvalFun evalfun, double precision) Overload accepting Java functional-interface flavors of the arguments.FindMarkovianRepresentation.findMarkovianRepresentation(List<Matrix> rep, kotlin.jvm.functions.Function2<List<Matrix>, Matrix, List<Matrix>> transfun, kotlin.jvm.functions.Function2<List<Matrix>, Integer, Double> evalfun) FindMarkovianRepresentation.findMarkovianRepresentation(List<Matrix> rep, kotlin.jvm.functions.Function2<List<Matrix>, Matrix, List<Matrix>> transfun, kotlin.jvm.functions.Function2<List<Matrix>, Integer, Double> evalfun, double precision) Obtains a Markovian representation from a non-Markovian one while keeping the size the same, by applying a series of elementary transformations.MStaircase.mStaircase(List<Matrix> Y, Matrix Z) MStaircase.mStaircase(List<Matrix> Y, Matrix Z, double precision) Computes a smaller representation using the staircase algorithm.Methods in jline.lib.butools.reptrans with parameters of type MatrixModifier and TypeMethodDescriptionstatic MarkovianRepresentationExtendToMarkovian.extendToMarkovian(Matrix alpha, Matrix A) static MarkovianRepresentationExtendToMarkovian.extendToMarkovian(Matrix alpha, Matrix A, int maxSize) static MarkovianRepresentationExtendToMarkovian.extendToMarkovian(Matrix alpha, Matrix A, int maxSize, double precision) Extends a non-Markovian initial vector to a Markovian one by appending an Erlang tail.MStaircase.mStaircase(List<Matrix> Y, Matrix Z) MStaircase.mStaircase(List<Matrix> Y, Matrix Z, double precision) Computes a smaller representation using the staircase algorithm.static MatrixSimilarityMatrix.similarityMatrix(Matrix A1, Matrix A2) Returns the matrix that transforms A1 to A2.static MatrixTransformToAcyclic.transformToAcyclic(Matrix A) static MatrixTransformToAcyclic.transformToAcyclic(Matrix A, int maxSize) static MatrixTransformToAcyclic.transformToAcyclic(Matrix A, int maxSize, double precision) Transforms an arbitrary matrix to a Markovian bi-diagonal matrix.static MatrixTransformToMonocyclic.transformToMonocyclic(Matrix A) static MatrixTransformToMonocyclic.transformToMonocyclic(Matrix A, int maxSize) static MatrixTransformToMonocyclic.transformToMonocyclic(Matrix A, int maxSize, double precision) Transforms an arbitrary matrix to a Markovian monocyclic matrix.Method parameters in jline.lib.butools.reptrans with type arguments of type MatrixModifier and TypeMethodDescriptiondoubleFindMarkovianRepresentation.findMarkovianRepresentation(List<Matrix> rep, FindMarkovianRepresentation.TransFun transfun, FindMarkovianRepresentation.EvalFun evalfun, double precision) Overload accepting Java functional-interface flavors of the arguments.FindMarkovianRepresentation.findMarkovianRepresentation(List<Matrix> rep, kotlin.jvm.functions.Function2<List<Matrix>, Matrix, List<Matrix>> transfun, kotlin.jvm.functions.Function2<List<Matrix>, Integer, Double> evalfun) FindMarkovianRepresentation.findMarkovianRepresentation(List<Matrix> rep, kotlin.jvm.functions.Function2<List<Matrix>, Matrix, List<Matrix>> transfun, kotlin.jvm.functions.Function2<List<Matrix>, Integer, Double> evalfun) FindMarkovianRepresentation.findMarkovianRepresentation(List<Matrix> rep, kotlin.jvm.functions.Function2<List<Matrix>, Matrix, List<Matrix>> transfun, kotlin.jvm.functions.Function2<List<Matrix>, Integer, Double> evalfun) FindMarkovianRepresentation.findMarkovianRepresentation(List<Matrix> rep, kotlin.jvm.functions.Function2<List<Matrix>, Matrix, List<Matrix>> transfun, kotlin.jvm.functions.Function2<List<Matrix>, Integer, Double> evalfun) FindMarkovianRepresentation.findMarkovianRepresentation(List<Matrix> rep, kotlin.jvm.functions.Function2<List<Matrix>, Matrix, List<Matrix>> transfun, kotlin.jvm.functions.Function2<List<Matrix>, Integer, Double> evalfun, double precision) Obtains a Markovian representation from a non-Markovian one while keeping the size the same, by applying a series of elementary transformations.FindMarkovianRepresentation.findMarkovianRepresentation(List<Matrix> rep, kotlin.jvm.functions.Function2<List<Matrix>, Matrix, List<Matrix>> transfun, kotlin.jvm.functions.Function2<List<Matrix>, Integer, Double> evalfun, double precision) Obtains a Markovian representation from a non-Markovian one while keeping the size the same, by applying a series of elementary transformations.FindMarkovianRepresentation.findMarkovianRepresentation(List<Matrix> rep, kotlin.jvm.functions.Function2<List<Matrix>, Matrix, List<Matrix>> transfun, kotlin.jvm.functions.Function2<List<Matrix>, Integer, Double> evalfun, double precision) Obtains a Markovian representation from a non-Markovian one while keeping the size the same, by applying a series of elementary transformations.FindMarkovianRepresentation.findMarkovianRepresentation(List<Matrix> rep, kotlin.jvm.functions.Function2<List<Matrix>, Matrix, List<Matrix>> transfun, kotlin.jvm.functions.Function2<List<Matrix>, Integer, Double> evalfun, double precision) Obtains a Markovian representation from a non-Markovian one while keeping the size the same, by applying a series of elementary transformations.MStaircase.mStaircase(List<Matrix> Y, Matrix Z) MStaircase.mStaircase(List<Matrix> Y, Matrix Z, double precision) Computes a smaller representation using the staircase algorithm.Constructors in jline.lib.butools.reptrans with parameters of type Matrix -
Uses of Matrix in jline.lib.butools.trace
Methods in jline.lib.butools.trace that return MatrixModifier and TypeMethodDescriptionstatic MatrixLagCorrelationsFromTrace.lagkJointMomentsFromTrace(double[] trace, int K) static MatrixLagCorrelationsFromTrace.lagkJointMomentsFromTrace(double[] trace, int K, int L) Returns the lag-L joint moments of a trace. -
Uses of Matrix in jline.lib.fjcodes
Fields in jline.lib.fjcodes declared as MatrixModifier and TypeFieldDescriptionfinal MatrixComputeT.ComputeTResult.A_jumpfinal MatrixReturnWaitResult.alfafinal MatrixSRKResult.Kcfinal MatrixSRKResult.Kefinal MatrixFJArrival.lambda0final MatrixFJArrival.lambda1final MatrixPiResult.pi0final MatrixSRKResult.R0final MatrixComputeT.ComputeTResult.Sfinal MatrixComputeT.ComputeTResult.S_Arrfinal MatrixSRKResult.S_lastfinal MatrixSRKResult.S_longfinal MatrixSRKResult.Sefinal MatrixSRKResult.Sestarfinal MatrixFJService.STfinal MatrixComputeT.ComputeTResult.sum_Ajumpfinal MatrixComputeT.ComputeTResult.Tfinal MatrixFJService.tau_stfinal MatrixReturnWaitResult.wait_alphafinal MatrixReturnWaitResult.wait_SmatMethods in jline.lib.fjcodes that return MatrixModifier and TypeMethodDescriptionstatic MatrixFjCodesUtilsKt.build_index(int m, int cr) Build combinatorial index patterns: enumerate all ways to distributecritems intombins.static MatrixFJUtils.build_index(int m, int cr) Build combinatorial index patterns.ComputeT.ComputeTResult.component1()GenerateServiceResult.component1()SAResult.component1()ComputeT.ComputeTResult.component2()SAResult.component2()ComputeT.ComputeTResult.component3()ComputeT.ComputeTResult.component4()ComputeT.ComputeTResult.component5()static MatrixComputeT_NARE.computeT_NARE(Matrix D0, Matrix D1, Matrix S, Matrix A_jump) static MatrixComputeT_Sylvester.computeT_Sylvester(Matrix D0, Matrix D1, Matrix S, Matrix A_jump) Compute T-matrix via Sylvester equation methodstatic MatrixFJStateSpace.constructNotAllBusy(int C, FJService services, FJServiceH service_h) Construct state space matrix for not-all-busy states.SAResult.getA_jump()ReturnWaitResult.getAlfa()FJServiceH.getBeta()SRKResult.getKc()SRKResult.getKe()FJArrival.getLambda0()FJArrival.getLambda1()PiResult.getPi0()SRKResult.getR0()FJServiceH.getS()SAResult.getS()SRKResult.getS_last()SRKResult.getS_long()SRKResult.getSe()FJServiceH.getService_phases()SRKResult.getSestar()FJService.getSt()FJService.getST()GenerateServiceResult.getT()FJService.getTau_st()ReturnWaitResult.getWait_alpha()ReturnWaitResult.getWait_Smat()static MatrixCompute Kronecker sum of two matrices: A xor B = A x I + I x B.static MatrixCompute Kronecker sum of two matrices.static MatrixExtract percentiles from a Phase-Type (PH) distributionstatic MatrixCompute response time percentiles for K=1 Fork-Join queue.static Matrixstatic MatrixCompute response time percentiles for K=2 Fork-Join queue.Methods in jline.lib.fjcodes with parameters of type MatrixModifier and TypeMethodDescriptionstatic PiResultComputePi.computePi(Matrix T, FJArrival arrival, FJService services, FJServiceH service_h, int C, Matrix S, Matrix A_jump) Compute steady-state distribution for the case with 2 replicas.static MatrixComputeT_NARE.computeT_NARE(Matrix D0, Matrix D1, Matrix S, Matrix A_jump) static MatrixComputeT_Sylvester.computeT_Sylvester(Matrix D0, Matrix D1, Matrix S, Matrix A_jump) Compute T-matrix via Sylvester equation methodstatic SRKResultFJStateSpace.constructSRK(int C, FJService services, FJServiceH service_h, Matrix S) Construct extended state space matrices (Se, Sestar, R0, Ke, Kc).static GenerateServiceResultGenerateService.generateService(FJService services, FJServiceH service_h, int C, Matrix S) Generate Phase-Type representation for service time.static double[]FjCodesUtilsKt.getRowAsArray(Matrix matrix, int row) Extract rowrowofmatrixas adouble[].static double[]FJUtils.getRowAsArray(Matrix matrix, int row) Extract a row from a Matrix as a double[].static MatrixCompute Kronecker sum of two matrices: A xor B = A x I + I x B.static MatrixCompute Kronecker sum of two matrices.static MatrixExtract percentiles from a Phase-Type (PH) distributionstatic ReturnWaitResultReturnWait.returnWait(double En1, Matrix pi0, Matrix T, Matrix phi, Matrix sum_Ajump) Compute Phase-Type representation of stationary waiting time.static voidFjCodesUtilsKt.setSubMatrix(Matrix target, int startRow, int startCol, Matrix source) Copysourceintotargetstarting at the given (0-based) row/column position.static voidFJUtils.setSubMatrix(Matrix target, int startRow, int startCol, Matrix source) Copy a submatrix into a target matrix at specified position.static intFind the 1-based index of the row inmatrixthat matchesrowelementwise (within 1e-10), or -1 if no row matches.static intFind the row index in a matrix that matches a given row vector.Constructors in jline.lib.fjcodes with parameters of type MatrixModifierConstructorDescriptionFJServiceH(Matrix service_phases, Matrix beta, Matrix S) GenerateServiceResult(Matrix T, int newdim, int dim_notbusy) ReturnWaitResult(Matrix wait_alpha, Matrix wait_Smat, double prob_wait, Matrix alfa) -
Uses of Matrix in jline.lib.kpctoolbox
Methods in jline.lib.kpctoolbox that return MatrixModifier and TypeMethodDescriptionstatic Matrixstatic MatrixMarkovChain.ctmcSteadyState(Matrix Q) static MatrixMarkovChain.ctmcTransient(Matrix Q, double t) static MatrixMarkovChain.dtmcSteadyState(Matrix P) static MatrixKpctoolbox.eye(int n) static MatrixKpctoolbox.ones(int m, int n) static Matrixstatic MatrixKpctoolbox.trace_bicov(Matrix S, int[] grid) static MatrixKpctoolbox.trace_bicov(Matrix S1, Matrix S2, int maxLag) static MatrixKpctoolbox.trace_gamma(Matrix S, int limit) static MatrixKpctoolbox.trace_iat2bins(Matrix S, int numBins) static MatrixKpctoolbox.trace_iat2counts(Matrix S, int numBins) static Matrixstatic MatrixKpctoolbox.trace_shuffle(Matrix S) static MatrixKpctoolbox.zeros(int m, int n) Methods in jline.lib.kpctoolbox that return types with arguments of type MatrixModifier and TypeMethodDescriptionAPH.fromMoments(Matrix moments) APH.fromMoments(Matrix moments) Methods in jline.lib.kpctoolbox with parameters of type MatrixModifier and TypeMethodDescriptionstatic Matrixstatic MatrixMarkovChain.ctmcSteadyState(Matrix Q) static MatrixMarkovChain.ctmcTransient(Matrix Q, double t) static MatrixMarkovChain.dtmcSteadyState(Matrix P) static MatrixCellstatic MatrixCellstatic MatrixCellstatic MatrixCellstatic MatrixCellAPH.fromMoments(Matrix moments) static intstatic intstatic doublestatic doublestatic doublestatic doubleKpctoolbox.mvph_mean_x(Matrix alpha, Matrix A, Matrix B) static doubleKpctoolbox.mvph_mean_y(Matrix alpha, Matrix A, Matrix C) static Matrixstatic MatrixKpctoolbox.trace_bicov(Matrix S, int[] grid) static MatrixKpctoolbox.trace_bicov(Matrix S1, Matrix S2, int maxLag) static MatrixKpctoolbox.trace_gamma(Matrix S, int limit) static MatrixKpctoolbox.trace_iat2bins(Matrix S, int numBins) static MatrixKpctoolbox.trace_iat2counts(Matrix S, int numBins) static doublestatic doublestatic doubleKpctoolbox.trace_joint(Matrix S, Matrix lags, Matrix orders) static doubleKpctoolbox.trace_mean(Matrix S) static Matrixstatic doublestatic MatrixKpctoolbox.trace_shuffle(Matrix S) static doubleKpctoolbox.trace_skew(Matrix S) static TraceAnalysis.TraceSummaryKpctoolbox.trace_summary(Matrix S) static doubleMethod parameters in jline.lib.kpctoolbox with type arguments of type MatrixModifier and TypeMethodDescriptionstatic doubleKpctoolbox.mtrace_mean(List<Matrix> traces) static doubleKpctoolbox.mtrace_var(List<Matrix> traces) -
Uses of Matrix in jline.lib.kpctoolbox.aph
Methods in jline.lib.kpctoolbox.aph that return types with arguments of type MatrixModifier and TypeMethodDescriptionAPH.aph_convpara(List<Pair<double[], Matrix>> distributions) APH.aph_convseq(List<Pair<double[], Matrix>> distributions) APH.aph_simplify(double[] a1, Matrix T1, double[] a2, Matrix T2, double p1, double p2, APH.ConvolutionPattern pattern) APH.aph_simplify(double[] a1, Matrix T1, double[] a2, Matrix T2, APH.ConvolutionPattern pattern) Methods in jline.lib.kpctoolbox.aph with parameters of type MatrixModifier and TypeMethodDescriptionAPH.aph_simplify(double[] a1, Matrix T1, double[] a2, Matrix T2, double p1, double p2, APH.ConvolutionPattern pattern) APH.aph_simplify(double[] a1, Matrix T1, double[] a2, Matrix T2, APH.ConvolutionPattern pattern) Method parameters in jline.lib.kpctoolbox.aph with type arguments of type Matrix -
Uses of Matrix in jline.lib.kpctoolbox.basic
Methods in jline.lib.kpctoolbox.basic that return MatrixModifier and TypeMethodDescriptionSpectralDecomposition.component3()SpectralDecomposition.component4()static MatrixBasicUtils.e(int n) Creates a vector e(n) = [1, 1, ..., 1]^T used in matrix operations.static MatrixBasicUtils.eye(int n) Creates an identity matrix.SpectralDecomposition.getEigenvalueMatrix()SpectralDecomposition.getEigenvectors()static MatrixBasicUtils.ones(int n) Creates a column vector of ones.static MatrixBasicUtils.zeros(int m, int n) Creates a zero matrix.Methods in jline.lib.kpctoolbox.basic that return types with arguments of type MatrixModifier and TypeMethodDescriptionSpectralDecomposition.component2()SpectralDecomposition.getProjectors()Methods in jline.lib.kpctoolbox.basic with parameters of type MatrixModifier and TypeMethodDescriptionstatic SpectralDecompositionComputes the spectral decomposition of a matrix.Constructors in jline.lib.kpctoolbox.basic with parameters of type MatrixModifierConstructorDescriptionSpectralDecomposition(double[] spectrum, List<Matrix> projectors, Matrix eigenvectors, Matrix eigenvalueMatrix) Constructor parameters in jline.lib.kpctoolbox.basic with type arguments of type MatrixModifierConstructorDescriptionSpectralDecomposition(double[] spectrum, List<Matrix> projectors, Matrix eigenvectors, Matrix eigenvalueMatrix) -
Uses of Matrix in jline.lib.kpctoolbox.mc
Fields in jline.lib.kpctoolbox.mc declared as MatrixMethods in jline.lib.kpctoolbox.mc that return MatrixModifier and TypeMethodDescriptionstatic MatrixCTMC.ctmc_makeinfgen(Matrix Q) Normalizes a matrix to be a valid infinitesimal generator.static MatrixCTMC.ctmc_rand(int n) Generates a random infinitesimal generator matrix.static MatrixCTMC.ctmc_timereverse(Matrix Q) Computes the time-reversed generator of a CTMC.static MatrixDTMC.dtmc_makestochastic(Matrix P) static MatrixDTMC.dtmc_rand(int n) static MatrixDTMC.dtmc_stochcomp(Matrix P) static MatrixDTMC.dtmc_stochcomp(Matrix P, int[] I) static MatrixDTMC.dtmc_timereverse(Matrix P) Methods in jline.lib.kpctoolbox.mc that return types with arguments of type MatrixModifier and TypeMethodDescriptionCTMC.ctmc_randomization(Matrix Q) CTMC.ctmc_randomization(Matrix Q, Double q) Applies uniformization (randomization) to transform a CTMC into a DTMC.Methods in jline.lib.kpctoolbox.mc with parameters of type MatrixModifier and TypeMethodDescriptionstatic MatrixCTMC.ctmc_makeinfgen(Matrix Q) Normalizes a matrix to be a valid infinitesimal generator.CTMC.ctmc_randomization(Matrix Q) CTMC.ctmc_randomization(Matrix Q, Double q) Applies uniformization (randomization) to transform a CTMC into a DTMC.static double[]CTMC.ctmc_relsolve(Matrix Q) Computes the equilibrium distribution relative to a reference state.static double[]CTMC.ctmc_relsolve(Matrix Q, int refstate) static double[]CTMC.ctmc_solve(Matrix Q) Computes the equilibrium distribution of a continuous-time Markov chain.static CTMC.CTMCSolveResultCTMC.ctmc_solveFull(Matrix Q) Computes the equilibrium distribution with full details.static MatrixCTMC.ctmc_timereverse(Matrix Q) Computes the time-reversed generator of a CTMC.CTMC.ctmc_uniformization(double[] pi0, Matrix Q, double t) Computes transient probabilities using uniformization method.CTMC.ctmc_uniformization(double[] pi0, Matrix Q, double t, double tol, int maxiter) static intDTMC.dtmc_isfeasible(Matrix P) static MatrixDTMC.dtmc_makestochastic(Matrix P) static int[]DTMC.dtmc_simulate(Matrix P, double[] pi0, int nSteps) static double[]DTMC.dtmc_solve(Matrix P) static MatrixDTMC.dtmc_stochcomp(Matrix P) static MatrixDTMC.dtmc_stochcomp(Matrix P, int[] I) static MatrixDTMC.dtmc_timereverse(Matrix P) DTMC.dtmc_uniformization(double[] pi0, Matrix P) DTMC.dtmc_uniformization(double[] pi0, Matrix P, double t) DTMC.dtmc_uniformization(double[] pi0, Matrix P, double t, double tol) DTMC.dtmc_uniformization(double[] pi0, Matrix P, double t, double tol, int maxiter) static CTMC.ConnectedComponentsCTMC.weaklyconncomp(Matrix G) Finds weakly connected components in a directed graph.Constructors in jline.lib.kpctoolbox.mc with parameters of type MatrixModifierConstructorDescriptionCTMCSolveResult(double[] equilibriumDistribution, Matrix generator, int numComponents, int[] componentAssignment) -
Uses of Matrix in jline.lib.kpctoolbox.mvph
Methods in jline.lib.kpctoolbox.mvph with parameters of type MatrixModifier and TypeMethodDescriptionstatic doublestatic doublestatic doubleMVPH.mvph_joint(double[] alpha, Matrix S, Matrix T, Matrix D, int n1, int n2) Computes the joint moment E[X^n1 * Y^n2] of a bivariate phase-type distribution.static doubleMVPH.mvph_mean_x(double[] alpha, Matrix S, Matrix T, Matrix D) static doubleMVPH.mvph_mean_y(double[] alpha, Matrix S, Matrix T, Matrix D) -
Uses of Matrix in jline.lib.kpctoolbox.smp
Methods in jline.lib.kpctoolbox.smp that return Matrix -
Uses of Matrix in jline.lib.m3a
Methods in jline.lib.m3a with parameters of type MatrixModifier and TypeMethodDescriptionstatic MTraceM3aFit.m3afit_init(Matrix S, Matrix C) Prepares multiclass trace for M3A fitting from Matrix inputs. -
Uses of Matrix in jline.lib.perm
Fields in jline.lib.perm declared as MatrixMethods in jline.lib.perm that return MatrixMethods in jline.lib.perm that return types with arguments of type MatrixModifier and TypeMethodDescriptionQueueingNetwork.preprocessingDS(Matrix M) Make a matrix doubly stochastic via the Sinkhorn algorithm.Methods in jline.lib.perm with parameters of type MatrixModifier and TypeMethodDescriptionQueueingNetwork.preprocessingDS(Matrix M) Make a matrix doubly stochastic via the Sinkhorn algorithm.Constructors in jline.lib.perm with parameters of type MatrixModifierConstructorDescriptionAdaPartSampler(Matrix matrix) AdaPartSampler(Matrix matrix, int maximumAcceptedSamples, long maximumTime, int maximumSamples, String mode, boolean solve) BethePermanent(Matrix matrix) BethePermanent(Matrix matrix, double epsilon, int maxIteration) BethePermanent(Matrix matrix, double epsilon, int maxIteration, boolean solve) HeuristicPermanent(Matrix matrix) Constructor with just matrix parameter.HeuristicPermanent(Matrix matrix, boolean solve) Constructor with just matrix and solve parameters.HeuristicPermanent(Matrix matrix, double tolerance, int maxIterations, boolean solve) Constructor with all parameters.HuberLawSampler(Matrix matrix) HuberLawSampler(Matrix matrix, double delta, double alpha2, double epsilon, String mode, int numberOfSamples, long maximumTime, boolean solve) NaivePermanent(Matrix matrix) NaivePermanent(Matrix matrix, boolean solve) PermSolver(Matrix matrix) RyzerPermanent(Matrix matrix) RyzerPermanent(Matrix matrix, String mode) RyzerPermanent(Matrix matrix, String mode, boolean solve) -
Uses of Matrix in jline.lib.qmam
Fields in jline.lib.qmam declared as MatrixModifier and TypeFieldDescriptionfinal MatrixMMAPKPHK1Result.qlTotalfinal MatrixMAPDcResult.queueLengthfinal MatrixMAPMAP1Result.queueLengthfinal MatrixMAPMcResult.queueLengthfinal MatrixPHPH1Result.queueLengthfinal MatrixQ_RAP_RAP_1.RAPRAP1Result.queueLengthfinal MatrixMAPMAP1Result.Smatfinal MatrixMAPMcResult.Smatfinal MatrixMMAPKPHK1Result.Smatfinal MatrixMAPMAP1Result.sojAlphafinal MatrixMAPMAP1Result.waitAlphafinal MatrixMAPMcResult.waitAlphafinal MatrixPHPH1Result.waitAlphafinal MatrixMAPDcResult.waitingTimefinal MatrixPHPH1Result.waitTFields in jline.lib.qmam with type parameters of type MatrixModifier and TypeFieldDescriptionMMAPKPHK1Result.qlPerTypeMMAPKPHK1Result.sojAlphaMMAPKPHK1Result.waitAlphaMethods in jline.lib.qmam that return MatrixModifier and TypeMethodDescriptionMAPMAP1Result.component1()PHPH1Result.component1()MAPMAP1Result.component2()PHPH1Result.component2()MAPMAP1Result.component3()PHPH1Result.component3()MAPMAP1Result.component4()MMAPKPHK1Result.getQlTotal()MAPDcResult.getQueueLength()MAPMAP1Result.getQueueLength()MAPMcResult.getQueueLength()PHPH1Result.getQueueLength()MAPMAP1Result.getSmat()MAPMcResult.getSmat()MMAPKPHK1Result.getSmat()MAPMAP1Result.getSojAlpha()MAPMAP1Result.getWaitAlpha()MAPMcResult.getWaitAlpha()PHPH1Result.getWaitAlpha()MAPDcResult.getWaitingTime()PHPH1Result.getWaitT()static MatrixSolves the equation X*kron(A,I)+BX=-I using a Schur-based approach.Methods in jline.lib.qmam that return types with arguments of type MatrixModifier and TypeMethodDescriptionMMAPKPHK1Result.getQlPerType()MMAPKPHK1Result.getSojAlpha()MMAPKPHK1Result.getWaitAlpha()Q_Sylvest.schurDecomposition(Matrix A) Performs Schur decomposition of a matrix.Q_Sylvest.schurDecomposition(Matrix A) Performs Schur decomposition of a matrix.Methods in jline.lib.qmam with parameters of type MatrixModifier and TypeMethodDescriptionstatic MAPDcResultstatic MAPDcResultQ_CT_MAP_D_C.qCtMapDC(Matrix D0, Matrix D1, double s, int c, MAPDcOptions options) Computes queue length and waiting time distribution for a MAP/D/c/FCFS queue.static MAPMAP1ResultQ_CT_MAP_MAP_1.qCtMapMap1(Matrix C0, Matrix C1, Matrix D0, Matrix D1) static MAPMAP1ResultQ_CT_MAP_MAP_1.qCtMapMap1(Matrix C0, Matrix C1, Matrix D0, Matrix D1, MAPMAP1Options options) Computes queue length and time distributions for a MAP/MAP/1/FCFS queue.static MAPMcResultstatic MAPMcResultQ_CT_MAP_M_C.qCtMapMC(Matrix D0, Matrix D1, double mu, int c, MAPMcOptions options) static MMAPKPHK1Resultstatic MMAPKPHK1ResultQ_CT_MMAPK_PHK_1.qCtMmapkPhk1(Matrix D0, List<Matrix> D, List<Matrix> alpha, List<Matrix> S, MMAPKPHK1Options options) static PHPH1Resultstatic PHPH1ResultComputes queue length and waiting time distribution for a PH/PH/1/FCFS queue.static Q_RAP_RAP_1.RAPRAP1Resultstatic Q_RAP_RAP_1.RAPRAP1ResultQ_RAP_RAP_1.qRapRap1(Matrix C0, Matrix C1, Matrix D0, Matrix D1, Q_RAP_RAP_1.RAPRAP1Options options) Computes queue length distribution for a RAP/RAP/1/FCFS queue.static MatrixSolves the equation X*kron(A,I)+BX=-I using a Schur-based approach.Q_Sylvest.schurDecomposition(Matrix A) Performs Schur decomposition of a matrix.Method parameters in jline.lib.qmam with type arguments of type MatrixModifier and TypeMethodDescriptionstatic MMAPKPHK1Resultstatic MMAPKPHK1ResultQ_CT_MMAPK_PHK_1.qCtMmapkPhk1(Matrix D0, List<Matrix> D, List<Matrix> alpha, List<Matrix> S, MMAPKPHK1Options options) Constructors in jline.lib.qmam with parameters of type MatrixModifierConstructorDescriptionMAPDcResult(Matrix queueLength, Matrix waitingTime) MAPMAP1Result(Matrix queueLength, Matrix sojAlpha, Matrix waitAlpha, Matrix Smat) MAPMcResult(Matrix queueLength, Matrix waitAlpha, Matrix Smat) MMAPKPHK1Result(List<Matrix> qlPerType, Matrix qlTotal, List<Matrix> sojAlpha, List<Matrix> waitAlpha, Matrix Smat) PHPH1Result(Matrix queueLength, Matrix waitAlpha, Matrix waitT) RAPRAP1Result(Matrix queueLength) Constructor parameters in jline.lib.qmam with type arguments of type Matrix -
Uses of Matrix in jline.lib.smc
Fields in jline.lib.smc declared as MatrixModifier and TypeFieldDescriptionfinal MatrixGIM1PiOptions.boundaryfinal MatrixMG1_ETAQA.ETAQAResult.Gfinal MatrixMG1_ETAQA.ETAQAResult.piMethods in jline.lib.smc that return MatrixModifier and TypeMethodDescriptionGIM1PiOptions.component1()GIM1CaudalResult.component2()MG1DecayResult.component2()GIM1PiOptions.getBoundary()MG1PiOptions.getBoundary()MG1_ETAQA.ETAQAResult.getG()MG1_ETAQA.ETAQAResult.getPi()MG1FIOptions.getStartValue()MG1DecayResult.getUT()GIM1CaudalResult.getV()static Matrixstatic MatrixGIM1_pi.gim1_pi(Matrix B, Matrix R, GIM1PiOptions options) Computes the stationary distribution of a GI/M/1-type Markov chain.static Matrixstatic MatrixGIM1_R.gim1_R(Matrix A, GIM1_R.GIM1ROptions options) Computes the R matrix for a GI/M/1-type Markov chain.static MatrixComputes the G matrix using Cyclic Reduction for M/G/1-type Markov Chains.static MatrixMG1_pi.mg1_cr(Matrix A, MG1CROptions options) static Matrixstatic MatrixDetermines G directly if rank(A0)=1 for M/G/1-type Markov chains.static Matrixstatic MatrixMG1_FI.mg1_fi(Matrix A, MG1FIOptions options) Functional Iterations for M/G/1-Type Markov Chains.static MatrixMG1_ETAQA.mg1_g_etaqa(Matrix A) Computes the G matrix for M/G/1-type Markov chains.static Matrixstatic MatrixMG1_pi.mg1_pi(Matrix B, Matrix A, MG1PiOptions options) static MatrixMG1_ETAQA.mg1_pi_etaqa(Matrix B, Matrix A) static MatrixMG1_ETAQA.mg1_pi_etaqa(Matrix B, Matrix A, Matrix G) static MatrixMG1_ETAQA.mg1_pi_etaqa(Matrix B, Matrix A, Matrix G, Matrix C0) Computes the aggregated stationary probability vector for an M/G/1-type Markov chain using the ETAQA method.static Matrixstatic MatrixNSF_GHT.nsfGht(Matrix A, int N, NSFGHTOptions options) Gail-Hantler-Taylor algorithm for Non-Skip-Free Markov chains.static Matrixstatic MatrixNSF_GHT.nsfPi(Matrix B, Matrix A, Matrix G, NSFPiOptions options) NSF_pi - Stationary vector of a Non-Skip-Free Markov chain.static MatrixQBD_NI_Sylvest.QBD_NI_Sylvest(Matrix A, Matrix B, Matrix C, Matrix D) Solves the Sylvester equation AXB + CX = D using complex Schur and Hessenberg-triangular decomposition.static MatrixQBD_pi: Stationary vector of a Quasi-Birth-Death Markov Chains [Neuts]static MatrixQBD_pi.QBD_pi(Matrix B0, Matrix B1, Matrix R, int MaxNumComp, int Verbose, Matrix Boundary, int RAPComp) static MatrixMethods in jline.lib.smc that return types with arguments of type MatrixModifier and TypeMethodDescriptionMG1_Shifts.mg1_shifts(Matrix A) MG1_Shifts.mg1_shifts(Matrix A) MG1_Shifts.mg1_shifts(Matrix A, String shiftType) Applies the shift technique to an M/G/1-type block matrix.MG1_Shifts.mg1_shifts(Matrix A, String shiftType) Applies the shift technique to an M/G/1-type block matrix.QBD_CR.QBD_CR(Matrix A0arg, Matrix A1arg, Matrix A2arg, Integer MaxNumIt_, Integer Verbose_, String Mode_, Integer RAPComp_) QBD_FI.QBD_FI(Matrix A0arg, Matrix A1arg, Matrix A2arg, Integer MaxNumIt_, Integer Verbose_, String Mode_, Matrix StartValue_, Integer RAPComp_) QBD_IS.QBD_IS(Matrix A0, Matrix A1, Matrix A2, Integer MaxNumIt_, Integer Verbose_, String Mode_, Integer RAPComp_) QBD_LR.QBD_LR(Matrix A0arg, Matrix A1arg, Matrix A2arg, Integer MaxNumIt_, Integer Verbose_, String Mode_, Integer RAPComp_) QBD_NI.QBD_NI(Matrix A0, Matrix A1, Matrix A2, Integer MaxNumIt_, Integer Verbose_, String Mode_, Integer RAPComp_) QBD_CR.solve(Matrix A0arg, Matrix A1arg, Matrix A2arg, Integer MaxNumIt_, Integer Verbose_, String Mode_, Integer RAPComp_) Convenience alias for callers that expect asolve(...)entry point on the QBD_CR class.QBD_FI.solve(Matrix A0arg, Matrix A1arg, Matrix A2arg, Integer MaxNumIt_, Integer Verbose_, String Mode_, Matrix StartValue_, Integer RAPComp_) Convenience alias for callers that expect asolve(...)entry point on the QBD_FI class.Methods in jline.lib.smc with parameters of type MatrixModifier and TypeMethodDescriptionstatic GIM1CaudalResultGIM1_Caudal.gim1_caudal(Matrix A) static GIM1CaudalResultGIM1_Caudal.gim1_caudal(Matrix A, boolean dual) static GIM1CaudalResultGIM1_Caudal.gim1_caudal(Matrix A, boolean dual, boolean computeEigenvector) Computes the dominant eigenvalue of the R matrix for GI/M/1-type chains.static Matrixstatic MatrixGIM1_pi.gim1_pi(Matrix B, Matrix R, GIM1PiOptions options) Computes the stationary distribution of a GI/M/1-type Markov chain.static Matrixstatic MatrixGIM1_R.gim1_R(Matrix A, GIM1_R.GIM1ROptions options) Computes the R matrix for a GI/M/1-type Markov chain.static MatrixComputes the G matrix using Cyclic Reduction for M/G/1-type Markov Chains.static MatrixMG1_pi.mg1_cr(Matrix A, MG1CROptions options) static MG1DecayResultstatic MG1DecayResultComputes the decay rate of a recurrent M/G/1 type Markov chain.static Matrixstatic MatrixDetermines G directly if rank(A0)=1 for M/G/1-type Markov chains.static Matrixstatic MatrixMG1_FI.mg1_fi(Matrix A, MG1FIOptions options) Functional Iterations for M/G/1-Type Markov Chains.static MatrixMG1_ETAQA.mg1_g_etaqa(Matrix A) Computes the G matrix for M/G/1-type Markov chains.static Matrixstatic MatrixMG1_pi.mg1_pi(Matrix B, Matrix A, MG1PiOptions options) static MatrixMG1_ETAQA.mg1_pi_etaqa(Matrix B, Matrix A) static MatrixMG1_ETAQA.mg1_pi_etaqa(Matrix B, Matrix A, Matrix G) static MatrixMG1_ETAQA.mg1_pi_etaqa(Matrix B, Matrix A, Matrix G, Matrix C0) Computes the aggregated stationary probability vector for an M/G/1-type Markov chain using the ETAQA method.static doubleMG1_ETAQA.mg1_qlen_etaqa(Matrix B, Matrix A, Matrix pi, int n) Computes the n-th moment of queue length using ETAQA.MG1_Shifts.mg1_shifts(Matrix A) MG1_Shifts.mg1_shifts(Matrix A, String shiftType) Applies the shift technique to an M/G/1-type block matrix.static Matrixstatic MatrixNSF_GHT.nsfGht(Matrix A, int N, NSFGHTOptions options) Gail-Hantler-Taylor algorithm for Non-Skip-Free Markov chains.static Matrixstatic MatrixNSF_GHT.nsfPi(Matrix B, Matrix A, Matrix G, NSFPiOptions options) NSF_pi - Stationary vector of a Non-Skip-Free Markov chain.static doubleQBD_CAUDAL.QBD_CAUDAL(Matrix A0, Matrix A1, Matrix A2) static doubleQBD_CAUDAL.QBD_CAUDAL(Matrix A0, Matrix A1, Matrix A2, boolean Dual) QBD_CR.QBD_CR(Matrix A0arg, Matrix A1arg, Matrix A2arg, Integer MaxNumIt_, Integer Verbose_, String Mode_, Integer RAPComp_) QBD_FI.QBD_FI(Matrix A0arg, Matrix A1arg, Matrix A2arg, Integer MaxNumIt_, Integer Verbose_, String Mode_, Matrix StartValue_, Integer RAPComp_) QBD_IS.QBD_IS(Matrix A0, Matrix A1, Matrix A2, Integer MaxNumIt_, Integer Verbose_, String Mode_, Integer RAPComp_) QBD_LR.QBD_LR(Matrix A0arg, Matrix A1arg, Matrix A2arg, Integer MaxNumIt_, Integer Verbose_, String Mode_, Integer RAPComp_) QBD_NI.QBD_NI(Matrix A0, Matrix A1, Matrix A2, Integer MaxNumIt_, Integer Verbose_, String Mode_, Integer RAPComp_) static MatrixQBD_NI_Sylvest.QBD_NI_Sylvest(Matrix A, Matrix B, Matrix C, Matrix D) Solves the Sylvester equation AXB + CX = D using complex Schur and Hessenberg-triangular decomposition.static voidQBD_ParsePara.QBD_ParsePara(Matrix A0, Matrix A1, Matrix A2) static MatrixQBD_pi: Stationary vector of a Quasi-Birth-Death Markov Chains [Neuts]static MatrixQBD_pi.QBD_pi(Matrix B0, Matrix B1, Matrix R, int MaxNumComp, int Verbose, Matrix Boundary, int RAPComp) static voidQBD_RAP_ParsePara.QBD_RAP_ParsePara(Matrix A0, Matrix A1, Matrix A2) QBD_RAP_ParsePara checks the validity of the input matrices A0, A1 and A2 for a QBD with RAP components.QBD_CR.solve(Matrix A0arg, Matrix A1arg, Matrix A2arg, Integer MaxNumIt_, Integer Verbose_, String Mode_, Integer RAPComp_) Convenience alias for callers that expect asolve(...)entry point on the QBD_CR class.QBD_FI.solve(Matrix A0arg, Matrix A1arg, Matrix A2arg, Integer MaxNumIt_, Integer Verbose_, String Mode_, Matrix StartValue_, Integer RAPComp_) Convenience alias for callers that expect asolve(...)entry point on the QBD_FI class.static MatrixConstructors in jline.lib.smc with parameters of type MatrixModifierConstructorDescriptionETAQAResult(Matrix pi, Matrix G) GIM1CaudalResult(double eta, Matrix v) GIM1PiOptions(Matrix boundary, int maxNumComp, int verbose) MG1DecayResult(double eta, Matrix uT) MG1FIOptions(String mode, int maxNumIt, int verbose, String shiftType, Matrix startValue, int[] nonZeroBlocks) MG1PiOptions(Matrix boundary, int maxNumComp, int precision, String solver, boolean verbose, String mode) -
Uses of Matrix in jline.solvers
Fields in jline.solvers declared as MatrixModifier and TypeFieldDescriptionSolverResult.ANMean arrival rates [stations x classes]SolverResult.ANfcrFCR mean arrival rates (attempted entries) [regions x classes]SolverResult.CNMean system response times [1 x chains]Matrix[][]SolverResult.CNtTransient system response times [time_points][1 x chains]SolverOptions.cutoffCutoff threshold for numerical computations.SolverOptions.init_solInitial solution for iterative solversSolverResult.pi_tTransient probability distributions over timeLayeredSolverResult.PNMean processor utilization [processors x 1]SolverResult.QNMean queue lengths [stations x classes]SolverResult.QNfcrFCR mean queue lengths (jobs waiting at ingress) [regions x classes]Matrix[][]SolverResult.QNtTransient queue lengths [time_points][stations x classes].LayeredSolverResult.rawEdgesWaitingWaiting time by call edge [calls x 1]LayeredSolverResult.rawPhase1ServiceTimePhase 1 service time by node [nodes x 1]LayeredSolverResult.rawPhase1UtilizationPhase 1 utilization by node [nodes x 1]LayeredSolverResult.rawPhase2ServiceTimePhase 2 service time by node [nodes x 1]LayeredSolverResult.rawPhase2UtilizationPhase 2 utilization by node [nodes x 1]LayeredSolverResult.rawProcUtilizationProcessor utilization by node [nodes x 1]LayeredSolverResult.rawProcWaitingProcessor waiting time by node [nodes x 1]LayeredSolverResult.rawThroughputThroughput by node [nodes x 1]LayeredSolverResult.rawUtilizationRaw utilization by node [nodes x 1]SolverResult.RNMean response times [stations x classes]SolverResult.RNfcrFCR mean response times (wait time at ingress) [regions x classes]Matrix[][]SolverResult.RNtTransient response times [time_points][stations x classes]LayeredSolverResult.SNMean service time [tasks x 1]SolverResult.SSSteady-state probability distributionSolverResult.SysTardNMean system tardiness [1 x classes]SolverResult.tTime points for transient analysisSolverResult.TardNMean tardiness [stations x classes]SolverResult.TNMean throughputs [stations x classes]SolverResult.TNfcrFCR mean throughputs (entry rate) [regions x classes]Matrix[][]SolverResult.TNtTransient throughputs [time_points][stations x classes]SolverResult.UNMean server utilizations [stations x classes]SolverResult.UNfcrFCR mean utilizations (capacity utilization) [regions x classes]Matrix[][]SolverResult.UNtTransient utilizations [time_points][stations x classes]SolverResult.WNMean residence times [stations x classes]SolverResult.WNfcrFCR mean residence times [regions x classes]SolverResult.XNMean system throughputs [1 x chains]Matrix[][]SolverResult.XNtTransient system throughputs [time_points][1 x chains]Methods in jline.solvers that return MatrixModifier and TypeMethodDescriptionNetworkSolver.avgArvR()NetworkSolver.avgArvRChain()NetworkSolver.avgNodeArvRChain()NetworkSolver.avgNodeQLenChain()NetworkSolver.avgNodeResidTChain()NetworkSolver.avgNodeRespTChain()NetworkSolver.avgNodeTputChain()NetworkSolver.avgNodeUtilChain()NetworkSolver.avgQLen()NetworkSolver.avgQLenChain()NetworkSolver.avgResidT()NetworkSolver.avgResidTChain()NetworkSolver.avgRespT()NetworkSolver.avgRespTChain()NetworkSolver.avgSysRespT()NetworkSolver.avgSysTput()NetworkSolver.avgTput()NetworkSolver.avgTputChain()NetworkSolver.avgUtil()NetworkSolver.avgUtilChain()NetworkSolver.avgWaitT()NetworkSolver.getAvgArvR()Computes and returns average arrival rates at steady-state.NetworkSolver.getAvgArvRChain()Returns average arrival rates aggregated by job chains.NetworkSolver.getAvgNodeArvRChain()Returns average node arrival rates aggregated by job chains.NetworkSolver.getAvgNodeQLenChain()Returns average node queue lengths aggregated by job chains.NetworkSolver.getAvgNodeResidTChain()Returns average node residence times aggregated by job chains.NetworkSolver.getAvgNodeRespTChain()Returns average node response times aggregated by job chains.NetworkSolver.getAvgNodeTputChain()Returns average node throughputs aggregated by job chains.NetworkSolver.getAvgNodeUtilChain()Returns average node utilizations aggregated by job chains.NetworkSolver.getAvgQLen()Computes and returns average queue lengths at steady-state.NetworkSolver.getAvgQLenChain()Returns average queue lengths aggregated by job chains.NetworkSolver.getAvgResidT()Computes and returns average residence times in queue (including service).NetworkSolver.getAvgResidTChain()Returns average residence times aggregated by job chains.NetworkSolver.getAvgRespT()Computes and returns average response times at steady-state.NetworkSolver.getAvgRespTChain()Returns average response times aggregated by job chains.NetworkSolver.getAvgSysRespT()Returns average system response times at steady state.NetworkSolver.getAvgSysTput()Returns average system throughputs at steady state.NetworkSolver.getAvgTput()Computes and returns average throughputs at steady-state.NetworkSolver.getAvgTputChain()Returns average throughputs aggregated by job chains.NetworkSolver.getAvgUtil()Computes and returns average server utilizations at steady-state.NetworkSolver.getAvgUtilChain()Returns average server utilizations aggregated by job chains.NetworkSolver.getAvgWaitT()Computes and returns average waiting times in queue excluding service time.SolverOptions.getCutoffMatrix(int nstations, int nclasses) Ensures the cutoff is properly dimensioned for the given network structure.AvgTable.getData()Returns the underlying matrix data.AvgTable.toMatrix()Returns the table data as a Matrix after sanitizing numerical values.Methods in jline.solvers with parameters of type MatrixModifier and TypeMethodDescriptionSets the numerical cutoff threshold as a matrix (builder pattern).Returns marginal state probabilities for a specific node and state.NetworkSolver.getProbAggr(int node, Matrix state_a) Probability of a SPECIFIC per-class job distribution at a station.NetworkSolver.getProbMarg(int node, int jobclass, Matrix state_m) Probability distribution for queue length of a SINGLE class at a station.voidNetworkSolver.setAvgResults(Matrix Q, Matrix U, Matrix R, Matrix T, Matrix A, Matrix W, Matrix C, Matrix X, double runtime, String method, int iter) Stores computed average metrics at steady-state in the solver result.protected final voidNetworkSolver.setDistribResults(Matrix RD, double runtime) Stores distribution metrics at steady-state.voidNetworkSolver.setTranAvgResults(Matrix[][] Qt, Matrix[][] Ut, Matrix[][] Rt, Matrix[][] Tt, Matrix[][] Ct, Matrix[][] Xt, double runtimet) Stores computed transient average metrics.protected final voidNetworkSolver.setTranProb(Matrix t, Matrix pi_t, Matrix SS, double runtimet) Stores transient probability distributions.Constructors in jline.solvers with parameters of type Matrix -
Uses of Matrix in jline.solvers.auto
Methods in jline.solvers.auto that return MatrixModifier and TypeMethodDescriptionSolverAUTO.avgArvR()Alias for getAvgArvR()SolverAUTO.avgArvRChain()Alias for getAvgArvRChain()SolverAUTO.avgQLen()Alias for getAvgQLen()SolverAUTO.avgQLenChain()Alias for getAvgQLenChain()SolverAUTO.avgResidT()Alias for getAvgResidT()SolverAUTO.avgResidTChain()Alias for getAvgResidTChain()SolverAUTO.avgRespT()Alias for getAvgRespT()SolverAUTO.avgRespTChain()Alias for getAvgRespTChain()SolverAUTO.avgSysRespT()Alias for getAvgSysRespT()SolverAUTO.avgSysTput()Alias for getAvgSysTput()SolverAUTO.avgTput()Alias for getAvgTput()SolverAUTO.avgTputChain()Alias for getAvgTputChain()SolverAUTO.avgUtil()Alias for getAvgUtil()SolverAUTO.avgUtilChain()Alias for getAvgUtilChain()SolverAUTO.avgWaitT()Alias for getAvgWaitT()SolverAUTO.getAvgArvR()Get average arrival rates at steady-stateSolverAUTO.getAvgArvRChain()SolverAUTO.getAvgNodeArvRChain()Get average node arrival rate by chainSolverAUTO.getAvgNodeQLenChain()Get average node queue length by chainSolverAUTO.getAvgNodeResidTChain()Get average node residence time by chainSolverAUTO.getAvgNodeRespTChain()Get average node response time by chainSolverAUTO.getAvgNodeTputChain()Get average node throughput by chainSolverAUTO.getAvgNodeUtilChain()Get average node utilization by chainSolverAUTO.getAvgQLen()Get average queue lengths at steady-stateSolverAUTO.getAvgQLenChain()SolverAUTO.getAvgResidT()Get average residence times at steady-stateSolverAUTO.getAvgResidTChain()Get average residence time by chainSolverAUTO.getAvgRespT()Get average response times at steady-stateSolverAUTO.getAvgRespTChain()SolverAUTO.getAvgSysRespT()SolverAUTO.getAvgSysTput()SolverAUTO.getAvgTput()Get average throughputs at steady-stateSolverAUTO.getAvgTputChain()SolverAUTO.getAvgUtil()Get average utilizations at steady-stateSolverAUTO.getAvgUtilChain()SolverAUTO.getAvgWaitT()Get average waiting times (queue time excluding service)SolverAUTO.getPerctRespT(double[] percentiles) Get response time percentilesMatrix[]SolverAUTO.getTranProb(Node node) Matrix[]SolverAUTO.getTranProbAggr(Node node) Matrix[]SolverAUTO.getTranProbSys()Matrix[]SolverAUTO.getTranProbSysAggr()SolverAUTO.perctRespT(double[] percentiles) Alias for getPerctRespT()Methods in jline.solvers.auto with parameters of type MatrixModifier and TypeMethodDescriptiondoubledoubleSolverAUTO.getProbAggr(Node node, Matrix state_a) doubleSolverAUTO.getProbMarg(Node node, int jobclass, Matrix state_m) Get marginalized state probabilitydoubleAlias for getProb()doubleAlias for getProbAggr()doubleAlias for getProbMarg() -
Uses of Matrix in jline.solvers.ctmc
Fields in jline.solvers.ctmc declared as MatrixModifier and TypeFieldDescriptionSolverCTMC.AnalyzerResult.CNSolverCTMC.TransientResult.CNtCTMCResult.infGenSolverCTMC.generatorResult.infGenSolverCTMC.AnalyzerResult.InfGenSolverCTMC.TransientResult.InfGenCTMCResult.Prob.jointCTMCResult.Prob.marginalCTMCResult.TranProbAggrResult.pitCTMCResult.TranProbResult.pitCTMCResult.TranProbSysAggrResult.pitCTMCResult.TranProbSysResult.pitSolverCTMC.TransientResult.pitSolverCTMC.StochCompResult.Q11SolverCTMC.StochCompResult.Q12SolverCTMC.StochCompResult.Q21SolverCTMC.StochCompResult.Q22SolverCTMC.AnalyzerResult.QNSolverCTMC.TransientResult.QNtSolverCTMC.AnalyzerResult.RNSolverCTMC.TransientResult.RNtSolverCTMC.StochCompResult.SCTMCResult.solverSpecificCTMCResult.spaceCTMCResult.spaceAggrSolverCTMC.SampleResult.stateSolverCTMC.SampleSysResult.stateCTMCResult.TranProbResult.stateSpaceCTMCResult.TranProbSysResult.stateSpaceprotected MatrixResultCTMC.stateSpaceSolverCTMC.StateSpace.stateSpaceSolverCTMC.AnalyzerResult.StateSpaceSolverCTMC.TransientResult.StateSpaceCTMCResult.TranProbSysAggrResult.stateSpaceAggrSolverCTMC.AnalyzerResult.StateSpaceAggrSolverCTMC.TransientResult.StateSpaceAggrCTMCResult.TranProbAggrResult.tCTMCResult.TranProbResult.tCTMCResult.TranProbSysAggrResult.tCTMCResult.TranProbSysResult.tSolverCTMC.SampleResult.tSolverCTMC.SampleSysResult.tSolverCTMC.TransientResult.tSolverCTMC.StochCompResult.TSolverCTMC.AnalyzerResult.TNSolverCTMC.TransientResult.TNtSolverCTMC.AnalyzerResult.UNSolverCTMC.TransientResult.UNtSolverCTMC.AnalyzerResult.XNSolverCTMC.TransientResult.XNtFields in jline.solvers.ctmc with type parameters of type MatrixModifier and TypeFieldDescriptionCTMCResult.nodeSpaceCTMCResult.AVG.QCTMCResult.AVG.TCTMCResult.AVG.UMethods in jline.solvers.ctmc that return MatrixModifier and TypeMethodDescriptionSolverCTMC.getCdfRespT(Matrix R) Get the cumulative distribution function of response times using tagged job methodologySolverCTMC.getCdfSysRespT()Get the cumulative distribution function of system response timesResultCTMCMargAggr.getPi()Get the steady-state distributionResultCTMCMargAggr.getPnir()Get the marginal probabilities at stationsSolverCTMC.SolverCtmcJointResult.getPnir()ResultCTMC.getQ()SolverCTMC.getRewardValueFunction(String rewardName) Get the value function for a specific reward.ResultCTMC.getStateSpace()SolverCTMC.CtmcSsgResult.getStateSpace()ResultCTMC.getStateSpaceAggr()SolverCTMC.CtmcSsgResult.getStateSpaceAggr()SolverCTMC.getStateSpaceAggr()SolverCTMC.CtmcSsgResult.getStateSpaceHashed()Methods in jline.solvers.ctmc with parameters of type MatrixModifier and TypeMethodDescriptionSolverCTMC.getCdfRespT(Matrix R) Get the cumulative distribution function of response times using tagged job methodologySolverCTMC.getProb(StatefulNode node, Matrix state) SolverCTMC.getProbAggr(int node, Matrix state_a) SolverCTMC.getProbAggr(Node node, Matrix state_a) SolverCTMC.getProbAggr(StatefulNode node, Matrix state_a) static voidSolverCTMC.printEventFilt(MatrixCell eventFilt, Matrix SS) static voidSolverCTMC.printInfGen(Matrix Q, Matrix SS) Constructors in jline.solvers.ctmc with parameters of type MatrixModifierConstructorDescriptionAnalyzerResult(Matrix QN, Matrix UN, Matrix RN, Matrix TN, Matrix CN, Matrix XN, Matrix InfGen, Matrix StateSpace, Matrix StateSpaceAggr, MatrixCell EventFiltration, double runtime, String fname, NetworkStruct sncopy) CtmcSsgResult(Matrix stateSpace, Matrix stateSpaceAggr, Matrix stateSpaceHashed, Map<StatefulNode, Matrix> nodeStateSpace, NetworkStruct sn) generatorResult(Matrix infGen, MatrixCell eventFilt, Map<Integer, Sync> ev) ResultCTMC(Matrix q, Matrix stateSpace, Matrix stateSpaceAggr, MatrixCell dfilt, double[][][] arvRates, double[][][] depRates, NetworkStruct sn) ResultCTMCMargAggr(Matrix Pnir, Matrix pi, double runtime, String fname) SolverCtmcJointResult(Matrix pnir, double runtime, String fname) StateSpace(Matrix stateSpace, MatrixCell localStateSpace) TransientResult(Matrix t, Matrix pit, Matrix QNt, Matrix UNt, Matrix RNt, Matrix TNt, Matrix CNt, Matrix XNt, Matrix InfGen, Matrix StateSpace, Matrix StateSpaceAggr, MatrixCell EventFiltration, double runtime, String fname) Constructor parameters in jline.solvers.ctmc with type arguments of type MatrixModifierConstructorDescriptionCtmcSsgResult(Matrix stateSpace, Matrix stateSpaceAggr, Matrix stateSpaceHashed, Map<StatefulNode, Matrix> nodeStateSpace, NetworkStruct sn) -
Uses of Matrix in jline.solvers.ctmc.analyzers
Methods in jline.solvers.ctmc.analyzers that return MatrixMethods in jline.solvers.ctmc.analyzers that return types with arguments of type MatrixConstructors in jline.solvers.ctmc.analyzers with parameters of type MatrixModifierConstructorDescriptionRewardResult(Map<String, Matrix> valueFunction, double[] time, List<String> rewardNames, Matrix stateSpace, Map<String, Double> steadyState, double runtime) Constructor parameters in jline.solvers.ctmc.analyzers with type arguments of type Matrix -
Uses of Matrix in jline.solvers.ctmc.handlers
Methods in jline.solvers.ctmc.handlers that return MatrixModifier and TypeMethodDescriptionstatic MatrixSolver_ctmc_marg.solver_ctmc_marg(NetworkStruct sn, SolverOptions options) -
Uses of Matrix in jline.solvers.env
Fields in jline.solvers.env declared as MatrixModifier and TypeFieldDescriptionSolverENV.SamplePathResult.SamplePathSegment.finalQSolverENV.SamplePathResult.SamplePathSegment.finalTSolverENV.SamplePathResult.SamplePathSegment.finalUSolverENV.SamplePathResult.SamplePathSegment.initialQSolverENV.SamplePathResult.SamplePathSegment.initialTSolverENV.SamplePathResult.SamplePathSegment.initialUMatrix[][]SolverENV.SamplePathResult.SamplePathSegment.QNtMatrix[][]SolverENV.EnvGeneratorResult.renvEventFiltSolverENV.EnvGeneratorResult.renvInfGenMatrix[]SolverENV.EnvGeneratorResult.stageInfGenSolverENV.SamplePathResult.SamplePathSegment.tMatrix[][]SolverENV.SamplePathResult.SamplePathSegment.TNtMatrix[][]SolverENV.SamplePathResult.SamplePathSegment.UNtMethods in jline.solvers.env with parameters of type MatrixModifier and TypeMethodDescriptionstatic jline.solvers.env.SolverENV.Compression_resultSolverENV.ctmc_courtois(Matrix Q, MatrixCell MS) static jline.solvers.env.SolverENV.Compression_resultSolverENV.ctmc_courtois(Matrix Q, MatrixCell MS, double q) static jline.solvers.env.SolverENV.Compression_resultSolverENV.ctmc_decompose(Matrix Q, MatrixCell MS, SolverOptions options) Perform CTMC decomposition using the configured method.Constructors in jline.solvers.env with parameters of type MatrixModifierConstructorDescriptionEnvGeneratorResult(Matrix[] stageInfGen, Matrix renvInfGen, MatrixCell[] stageEventFilt, Matrix[][] renvEventFilt, Map<Integer, Sync>[] stageEvents, List<RenvEvent> renvEvents) RenvEvent(int nodeIdx, int jobclassIdx, double prob, Matrix state, double t, double job, Pair<Integer, Integer> envTransition) -
Uses of Matrix in jline.solvers.fluid
Fields in jline.solvers.fluid declared as MatrixModifier and TypeFieldDescriptionMatrix[][]FluidResult.distribCDistribution matrices for response time and passage time CDFs [stations][classes]FluidResult.hitProbCache hit probabilities [nodes x classes] from cacheqn analysisFluidResult.missProbCache miss probabilities [nodes x classes] from cacheqn analysisFluidResult.odeStateVecODE state vector solution from fluid approximationMethods in jline.solvers.fluid that return MatrixModifier and TypeMethodDescriptionMatrix[]SolverFluid.getCdfAoI()Get CDF of Age of Information with automatic time range.Matrix[]Get CDF of Age of Information.Methods in jline.solvers.fluid with parameters of type MatrixModifier and TypeMethodDescriptionMatrix[]Get CDF of Age of Information.voidSolverFluid.setFluidDistribResults(Matrix RD, double runtime) Set distribution results with enhanced metadata for fluid solvervoidSolverFluid.setFluidTranAvgResults(Matrix[][] Qt, Matrix[][] Ut, Matrix[][] Rt, Matrix[][] Tt, Matrix[][] Ct, Matrix[][] Xt, double runtimet) Set transient average results with proper validation -
Uses of Matrix in jline.solvers.fluid.analyzers
Fields in jline.solvers.fluid.analyzers declared as MatrixModifier and TypeFieldDescriptionClosingAndStateDepMethodsAnalyzer.xvec_itMatrixMethodAnalyzer.xvec_itClosingAndStateDepMethodsAnalyzer.xvec_tMatrixMethodAnalyzer.xvec_tMethods in jline.solvers.fluid.analyzers that return MatrixModifier and TypeMethodDescriptionClosingAndStateDepMethodsAnalyzer.getXVecIt()FluidAnalyzer.getXVecIt()MatrixMethodAnalyzer.getXVecIt()MFQAnalyzer.getXVecIt()RMFAnalyzer.getXVecIt()Methods in jline.solvers.fluid.analyzers with parameters of type MatrixModifier and TypeMethodDescriptionbooleanClosingAndStateDepMethodsAnalyzer.detectStiffnessUsingOstrowski(NetworkStruct sn, Matrix rate) -
Uses of Matrix in jline.solvers.fluid.handlers
Fields in jline.solvers.fluid.handlers declared as MatrixModifier and TypeFieldDescriptionImmediateElimination.EliminationResult.allJumpsReducedImmediateElimination.EliminationResult.eventIdxReducedImmediateElimination.EliminationResult.rateBaseReducedMethodStepHandler.tVecTransientDataHandler.tVecTime vector storing integration time pointsMethodStepHandler.xVecTransientDataHandler.xVecState vector matrix storing system state at each time point [time x dimensions]Methods in jline.solvers.fluid.handlers that return MatrixMethods in jline.solvers.fluid.handlers with parameters of type MatrixModifier and TypeMethodDescriptionImmediateElimination.eliminateImmediate(Matrix allJumps, Matrix rateBase, Matrix eventIdx, NetworkStruct sn, SolverOptions options) Eliminate immediate transitions from ODE systemorg.apache.commons.math3.optim.PointValuePairPStarSearcher.findPStarValues(Network model, Matrix targetQueueLengths) Constructors in jline.solvers.fluid.handlers with parameters of type MatrixModifierConstructorDescriptionClosingAndStateDepMethodsODE(NetworkStruct sn, Map<Station, Map<JobClass, Matrix>> mu, Map<Station, Map<JobClass, Matrix>> phi, Map<Station, Map<JobClass, MatrixCell>> proc, Matrix rt, Matrix S, SolverOptions options) ClosingAndStateDepMethodsODE(NetworkStruct sn, Map<Station, Map<JobClass, Matrix>> mu, Map<Station, Map<JobClass, Matrix>> phi, Map<Station, Map<JobClass, MatrixCell>> proc, Matrix rt, Matrix S, SolverOptions options, int numDimensions) CMAESObjectiveFunction(Matrix targetQueueLengths, Network model, boolean stiff) EliminationResult(Matrix allJumpsReduced, Matrix rateBaseReduced, Matrix eventIdxReduced, int[] stateMap) MatrixMethodODE(Matrix W, Matrix SQ, Matrix S, Matrix Qa, Matrix ALambda, int numDimensions, boolean[] isSourceState) MatrixMethodODE(Matrix W, Matrix SQ, Matrix S, Matrix Qa, Matrix ALambda, int numDimensions, boolean[] isSourceState, NetworkStruct sn, List<Double> pStarValues) PassageTimeODE(NetworkStruct sn, Map<Station, Map<JobClass, Matrix>> mu, Map<Station, Map<JobClass, Matrix>> phi, Map<Station, Map<JobClass, MatrixCell>> proc, Matrix rt, Matrix S, SolverOptions options) PassageTimeODE(NetworkStruct sn, Map<Station, Map<JobClass, Matrix>> mu, Map<Station, Map<JobClass, Matrix>> phi, Map<Station, Map<JobClass, MatrixCell>> proc, Matrix rt, Matrix S, SolverOptions options, int numDimensions) PStarOptimisationFunction(Matrix QNSSA, Network model, boolean stiff) Constructor parameters in jline.solvers.fluid.handlers with type arguments of type MatrixModifierConstructorDescriptionClosingAndStateDepMethodsODE(NetworkStruct sn, Map<Station, Map<JobClass, Matrix>> mu, Map<Station, Map<JobClass, Matrix>> phi, Map<Station, Map<JobClass, MatrixCell>> proc, Matrix rt, Matrix S, SolverOptions options) ClosingAndStateDepMethodsODE(NetworkStruct sn, Map<Station, Map<JobClass, Matrix>> mu, Map<Station, Map<JobClass, Matrix>> phi, Map<Station, Map<JobClass, MatrixCell>> proc, Matrix rt, Matrix S, SolverOptions options, int numDimensions) PassageTimeODE(NetworkStruct sn, Map<Station, Map<JobClass, Matrix>> mu, Map<Station, Map<JobClass, Matrix>> phi, Map<Station, Map<JobClass, MatrixCell>> proc, Matrix rt, Matrix S, SolverOptions options) PassageTimeODE(NetworkStruct sn, Map<Station, Map<JobClass, Matrix>> mu, Map<Station, Map<JobClass, Matrix>> phi, Map<Station, Map<JobClass, MatrixCell>> proc, Matrix rt, Matrix S, SolverOptions options, int numDimensions) -
Uses of Matrix in jline.solvers.jmt
Fields in jline.solvers.jmt declared as MatrixModifier and TypeFieldDescriptionJMTResult.cacheANCache node arrival rates [nnodes x nclasses].JMTResult.cacheTNCache node throughputs [nnodes x nclasses].JMTResult.TransientProbabilityResult.Pi_tJMTResult.TransientProbabilityResult.SSnode_aMethods in jline.solvers.jmt that return MatrixModifier and TypeMethodDescriptionMatrix[][]SolverJMT.getTranQLen()Returns transient queue length results from the last getTranAvg() call.Matrix[][]SolverJMT.getTranTput()Returns transient throughput results from the last getTranAvg() call.Matrix[][]SolverJMT.getTranUtil()Returns transient utilization results from the last getTranAvg() call.Methods in jline.solvers.jmt with parameters of type MatrixConstructors in jline.solvers.jmt with parameters of type Matrix -
Uses of Matrix in jline.solvers.jmt.io
Methods in jline.solvers.jmt.io that return MatrixModifier and TypeMethodDescriptionMatrix[][][]JMTIO.parseLogs(boolean[] isNodeLogged, MetricType metric) Parses JMT log files for the specified metric type.Matrix[][]JMTIO.parseTranRespT(List<String[]> arvData, List<String[]> depData) Parses transient response time data from arrival and departure logs.Methods in jline.solvers.jmt.io with parameters of type Matrix -
Uses of Matrix in jline.solvers.ldes
Fields in jline.solvers.ldes declared as MatrixModifier and TypeFieldDescriptionLNLDESResult.ALNArrival rate per LQN element [1 x nidx]LDESResult.ANCIConfidence interval half-widths for arrival rates [stations x classes]LDESResult.avgOrbitSizeAverage orbit size (time-weighted mean jobs in orbit) [stations x classes]LDESResult.avgRenegingWaitTimeAverage wait time before reneging [stations x classes]LDESResult.balkedCustomersNumber of customers who balked (refused to join upon arrival) [stations x classes]LDESResult.balkingProbabilityBalking probability (balked / arrivals) [stations x classes]LNLDESResult.QLNQueue length per LQN element [1 x nidx]LNLDESResult.QLNCIQueue length confidence interval half-widths [1 x nidx]LDESResult.QNCIConfidence interval half-widths for queue lengths [stations x classes]LDESResult.QNRelPrecRelative precision achieved for queue lengths (CI half-width / mean) [stations x classes]LDESResult.QNSamplesNumber of samples (observations) used for queue length estimation [stations x classes]LDESResult.renegedCustomersNumber of customers who reneged (abandoned queue due to expired patience) [stations x classes]LDESResult.renegingRateReneging rate (reneged / (completed + reneged + dropped)) [stations x classes]LDESResult.retrialDroppedNumber of customers dropped after exceeding max retrial attempts [stations x classes]LDESResult.retriedCustomersNumber of successful retrial attempts (customers who re-entered queue from orbit) [stations x classes]LNLDESResult.RLNResponse time per LQN element [1 x nidx]LNLDESResult.RLNCIResponse time confidence interval half-widths [1 x nidx]LDESResult.RNCIConfidence interval half-widths for response times [stations x classes]LDESResult.RNRelPrecRelative precision achieved for response times (CI half-width / mean) [stations x classes]LDESResult.RNSamplesNumber of samples (observations) used for response time estimation [stations x classes]LNLDESResult.TLNThroughput per LQN element [1 x nidx]LNLDESResult.TLNCIThroughput confidence interval half-widths [1 x nidx]LDESResult.TNCIConfidence interval half-widths for throughputs [stations x classes]LDESResult.TNRelPrecRelative precision achieved for throughputs (CI half-width / mean) [stations x classes]LDESResult.TNSamplesNumber of samples (observations) used for throughput estimation [stations x classes]LDESResult.tranProbPitTransient state probabilities over time [numTimePoints x numStates].LDESResult.tranProbStateSpaceTransient state space matrix [numStates x stateVectorLength].LDESResult.tranProbTTime points for transient probability analysis.LDESResult.tranSyncTransient synchronization matrix for multi-class coordinationLNLDESResult.ULNUtilization per LQN element [1 x nidx]LNLDESResult.ULNCIUtilization confidence interval half-widths [1 x nidx]LDESResult.UNCIConfidence interval half-widths for utilizations [stations x classes]LDESResult.UNRelPrecRelative precision achieved for utilizations (CI half-width / mean) [stations x classes]LDESResult.UNSamplesNumber of samples (observations) used for utilization estimation [stations x classes]LNLDESResult.WLNResidence/waiting time per LQN element [1 x nidx]LDESResult.WNCIConfidence interval half-widths for residence times [stations x classes]Fields in jline.solvers.ldes with type parameters of type MatrixModifier and TypeFieldDescriptionLDESResult.tranProbAggrPitTransient aggregated state probabilities per node [nodeIdx] -> [numTimePoints x numAggrStates].LDESResult.tranProbAggrStateSpaceTransient aggregated state space per node [nodeIdx] -> [numAggrStates x numClasses].LDESResult.tranSysStateTransient system state matrices indexed by time pointsMethods in jline.solvers.ldes with parameters of type MatrixModifier and TypeMethodDescriptionEstimates state probability using node index.SolverLDES.getProb(StatefulNode node, Matrix state) Estimates the steady-state probability of a specific state at a node via LDES simulation.SolverLDES.getProbAggr(int nodeIndex, Matrix stateAggr) Estimates aggregated state probability using node index.SolverLDES.getProbAggr(StatefulNode node, Matrix stateAggr) Estimates the steady-state probability of a specific aggregated (per-class) state at a node.Constructors in jline.solvers.ldes with parameters of type MatrixModifierConstructorDescriptionLDESResult(Matrix QN, Matrix UN, Matrix RN, Matrix TN, Matrix CN, Matrix XN, Map<Integer, Matrix> tranSysState, Matrix tranSync, NetworkStruct sn) Constructs a LDESResult with the specified performance metrics and state information.Constructor parameters in jline.solvers.ldes with type arguments of type Matrix -
Uses of Matrix in jline.solvers.ln
Fields in jline.solvers.ln declared as MatrixModifier and TypeFieldDescriptionSolverLN.arvproc_classes_updmapSolverLN.call_classes_updmapSolverLN.callresidtSolverLN.LNState.callresidtSolverLN.callresidt_prevSolverLN.LNState.callresidtPrevSolverLN.callservtSolverLN.LNState.callservtSolverLN.callservt_prevSolverLN.LNState.callservtPrevSolverLN.ignoreSolverLN.ilscalingSolverLN.LNState.ilscalingSolverLN.LNState.njobsSolverLN.njobsSolverLN.njobsorigSolverLN.prOvertakeSolverLN.LNState.ptaskcallersSolverLN.ptaskcallersSolverLN.LNState.residtSolverLN.residtSolverLN.residt_prevSolverLN.LNState.residtPrevSolverLN.route_prob_updmapSolverLN.LNState.servtSolverLN.servtSolverLN.servt_classes_updmapSolverLN.servt_ph1SolverLN.servt_ph2SolverLN.servt_prevSolverLN.servtmatrixSolverLN.LNState.servtPrevSolverLN.LNState.thinktSolverLN.thinktSolverLN.thinkt_classes_updmapSolverLN.thinkt_prevSolverLN.LNState.thinktPrevSolverLN.LNState.tputSolverLN.tputSolverLN.tput_prevSolverLN.LNState.tputPrevSolverLN.unique_route_prob_updmapSolverLN.LNState.utilSolverLN.utilSolverLN.util_ph1SolverLN.util_ph2Fields in jline.solvers.ln with type parameters of type MatrixModifier and TypeFieldDescriptionSolverLN.callservtcdfSolverLN.ptaskcallers_stepSolverLN.servtcdfMethods in jline.solvers.ln that return MatrixModifier and TypeMethodDescriptionSolverLN.getArvproc_classes_updmap()SolverLN.getCall_classes_updmap()SolverLN.getEntryServiceMatrix()SolverLN.getEntryServiceMatrixRecursion(LayeredNetworkStruct lqn, int aidx, int eidx, Matrix U) SolverLN.getRoute_prob_updmap()SolverLN.getServt_classes_updmap()SolverLN.getThinkt_classes_updmap()SolverLN.integerMapToMatrix(Map<Integer, List<Integer[]>> cell) Methods in jline.solvers.ln with parameters of type MatrixModifier and TypeMethodDescriptionSolverLN.getEntryServiceMatrixRecursion(LayeredNetworkStruct lqn, int aidx, int eidx, Matrix U) -
Uses of Matrix in jline.solvers.mam
Fields in jline.solvers.mam declared as MatrixFields in jline.solvers.mam with type parameters of type MatrixMethods in jline.solvers.mam that return MatrixModifier and TypeMethodDescriptionMAMFJResult.getQN()MAMFJResult.getRN()MAMFJResult.getTN()MAMFJResult.getUN()MAMFJResult.getXN()Methods in jline.solvers.mam with parameters of type MatrixModifier and TypeMethodDescriptionSolverMAM.getProbMarg(int node, int jobclass, Matrix state_m) Get marginal queue-length probability distribution for a job class.Constructors in jline.solvers.mam with parameters of type MatrixModifierConstructorDescriptionMAMFJResult(Matrix QN, Matrix UN, Matrix RN, Matrix TN, Matrix XN, List<MainFJ.FJPercentileResult> percentileResults) -
Uses of Matrix in jline.solvers.mam.handlers
Fields in jline.solvers.mam.handlers declared as MatrixModifier and TypeFieldDescriptionfinal MatrixRCATModel.APfinal MatrixMetricsResult.CNfinal MatrixBMAPMAP1Result.GG matrixfinal MatrixBMAPMAP1Result.piAggregated stationary probabilities [pi0, pi1, piStar]final MatrixMAPBMAP1Result.pifinal MatrixRCATModel.processMapfinal MatrixMetricsResult.QNfinal MatrixMAPBMAP1Result.Rfinal Matrix[][]RCATModel.Rfinal MatrixMetricsResult.RNfinal MatrixMetricsResult.TNfinal MatrixMetricsResult.UNfinal MatrixINAPResult.xfinal MatrixMetricsResult.XNFields in jline.solvers.mam.handlers with type parameters of type MatrixMethods in jline.solvers.mam.handlers that return MatrixModifier and TypeMethodDescriptionINAPResult.component1()BMAPMAP1Result.component5()BMAPMAP1Result.component6()MetricsResult.getCN()BMAPMAP1Result.getG()BMAPMAP1Result.getPi()MetricsResult.getQN()Matrix[][]TransientResult.getQt()MetricsResult.getRN()MetricsResult.getTN()Matrix[][]TransientResult.getTt()MetricsResult.getUN()Matrix[][]TransientResult.getUt()INAPResult.getX()MetricsResult.getXN()Methods in jline.solvers.mam.handlers that return types with arguments of type MatrixModifier and TypeMethodDescriptionINAPResult.component2()INAPResult.component3()INAPResult.getPi()INAPResult.getQ()Methods in jline.solvers.mam.handlers with parameters of type MatrixModifier and TypeMethodDescriptionstatic doubleQna_superpos.qna_superpos(Matrix lambda, Matrix a2) static BMAPMAP1ResultSolver_mam_bmap_map_1.solver_mam_bmap_map_1(List<Matrix> D, Matrix S0, Matrix S1) static BMAPMAP1ResultSolver_mam_bmap_map_1.solver_mam_bmap_map_1(List<Matrix> D, Matrix S0, Matrix S1, int nMoments) Solves a BMAP/MAP/1 queue using M/G/1 type matrix-analytic methods.static MAPBMAP1ResultSolver_mam_map_bmap_1.solver_mam_map_bmap_1(Matrix C0, Matrix C1, List<Matrix> D) Method parameters in jline.solvers.mam.handlers with type arguments of type MatrixModifier and TypeMethodDescriptionstatic BMAPMAP1ResultSolver_mam_bmap_map_1.solver_mam_bmap_map_1(List<Matrix> D, Matrix S0, Matrix S1) static BMAPMAP1ResultSolver_mam_bmap_map_1.solver_mam_bmap_map_1(List<Matrix> D, Matrix S0, Matrix S1, int nMoments) Solves a BMAP/MAP/1 queue using M/G/1 type matrix-analytic methods.static MAPBMAP1ResultSolver_mam_map_bmap_1.solver_mam_map_bmap_1(Matrix C0, Matrix C1, List<Matrix> D) Constructors in jline.solvers.mam.handlers with parameters of type MatrixModifierConstructorDescriptionBMAPMAP1Result(double meanQueueLength, double utilization, double meanResponseTime, double throughput, Matrix pi, Matrix G, double meanBatchSize) MAPBMAP1Result(double meanQueueLength, double utilization, double meanResponseTime, double throughput, Matrix pi, Matrix R, double meanBatchSize) TransientResult(Matrix[][] Qt, Matrix[][] Ut, Matrix[][] Tt) Constructor parameters in jline.solvers.mam.handlers with type arguments of type Matrix -
Uses of Matrix in jline.solvers.mva
Fields in jline.solvers.mva declared as MatrixModifier and TypeFieldDescriptionMVAResult.hitProbCache hit probabilities [items x classes] (used by cache analyzers)MVAResult.missProbCache miss probabilities [items x classes] (used by cache analyzers)Methods in jline.solvers.mva that return MatrixModifier and TypeMethodDescriptionProbabilityResult.getMarginal(int station, int jobclass) Get the marginal probability distribution for a specific station and class.ProbabilityResult.getProbabilityVector()Get the probability distribution vector.Methods in jline.solvers.mva with parameters of type MatrixModifier and TypeMethodDescriptionSolverMVA.getProbMarg(int ist, int jobclass, Matrix state_m) Get marginalized state probabilities for a specific station and job class with state filtervoidProbabilityResult.setMarginal(int station, int jobclass, Matrix probVector) Set the marginal probability distribution for a specific station and class.Constructors in jline.solvers.mva with parameters of type MatrixModifierConstructorDescriptionProbabilityResult(Matrix probabilityVector) Constructor for probability distribution result. -
Uses of Matrix in jline.solvers.mva.handlers
Methods in jline.solvers.mva.handlers that return types with arguments of type MatrixModifier and TypeMethodDescriptionSolver_amvald.solver_amvald_forward(List<Matrix> gamma, Matrix tau, Matrix Qchain_in, Matrix Xchain_in, Matrix Uchain_in, Matrix STchain_in, Matrix Vchain_in, Matrix Nchain_in, Matrix SCVchain_in, double Nt, double delta, Matrix deltaclass, List<Integer> ocl, List<Integer> ccl, List<Integer> nnzclasses, Map<Integer, List<Integer>> nnzclasses_eprio, Map<Integer, List<Integer>> nnzclasses_hprio, Map<Integer, List<Integer>> nnzclasses_ehprio, int M, int K, Matrix nservers, Matrix schedparam, Matrix lldscaling_in, Map<Station, SerializableFunction<Matrix, Double>> cdscaling, Map<Station, Matrix> ljdscaling, Map<Station, Matrix> ljdcutoffs, List<List<Matrix>> ljcdscaling, List<Matrix> ljcdcutoffs, List<SchedStrategy> sched, List<Station> stations, SolverOptions options) Solver_amvald.solver_amvald_forward(List<Matrix> gamma, Matrix tau, Matrix Qchain_in, Matrix Xchain_in, Matrix Uchain_in, Matrix STchain_in, Matrix Vchain_in, Matrix Nchain_in, Matrix SCVchain_in, double Nt, double delta, Matrix deltaclass, List<Integer> ocl, List<Integer> ccl, List<Integer> nnzclasses, Map<Integer, List<Integer>> nnzclasses_eprio, Map<Integer, List<Integer>> nnzclasses_hprio, Map<Integer, List<Integer>> nnzclasses_ehprio, int M, int K, Matrix nservers, Matrix schedparam, Matrix lldscaling_in, Map<Station, SerializableFunction<Matrix, Double>> cdscaling, Map<Station, Matrix> ljdscaling, Map<Station, Matrix> ljdcutoffs, List<List<Matrix>> ljcdscaling, List<Matrix> ljcdcutoffs, List<SchedStrategy> sched, List<Station> stations, SolverOptions options) Methods in jline.solvers.mva.handlers with parameters of type MatrixModifier and TypeMethodDescriptionstatic doubleSolver_qna.qna_superpos(Matrix lambda, Matrix a2) Solver_amvald.solver_amvald_forward(List<Matrix> gamma, Matrix tau, Matrix Qchain_in, Matrix Xchain_in, Matrix Uchain_in, Matrix STchain_in, Matrix Vchain_in, Matrix Nchain_in, Matrix SCVchain_in, double Nt, double delta, Matrix deltaclass, List<Integer> ocl, List<Integer> ccl, List<Integer> nnzclasses, Map<Integer, List<Integer>> nnzclasses_eprio, Map<Integer, List<Integer>> nnzclasses_hprio, Map<Integer, List<Integer>> nnzclasses_ehprio, int M, int K, Matrix nservers, Matrix schedparam, Matrix lldscaling_in, Map<Station, SerializableFunction<Matrix, Double>> cdscaling, Map<Station, Matrix> ljdscaling, Map<Station, Matrix> ljdcutoffs, List<List<Matrix>> ljcdscaling, List<Matrix> ljcdcutoffs, List<SchedStrategy> sched, List<Station> stations, SolverOptions options) Method parameters in jline.solvers.mva.handlers with type arguments of type MatrixModifier and TypeMethodDescriptionSolver_amvald.solver_amvald_forward(List<Matrix> gamma, Matrix tau, Matrix Qchain_in, Matrix Xchain_in, Matrix Uchain_in, Matrix STchain_in, Matrix Vchain_in, Matrix Nchain_in, Matrix SCVchain_in, double Nt, double delta, Matrix deltaclass, List<Integer> ocl, List<Integer> ccl, List<Integer> nnzclasses, Map<Integer, List<Integer>> nnzclasses_eprio, Map<Integer, List<Integer>> nnzclasses_hprio, Map<Integer, List<Integer>> nnzclasses_ehprio, int M, int K, Matrix nservers, Matrix schedparam, Matrix lldscaling_in, Map<Station, SerializableFunction<Matrix, Double>> cdscaling, Map<Station, Matrix> ljdscaling, Map<Station, Matrix> ljdcutoffs, List<List<Matrix>> ljcdscaling, List<Matrix> ljcdcutoffs, List<SchedStrategy> sched, List<Station> stations, SolverOptions options) -
Uses of Matrix in jline.solvers.nc
Fields in jline.solvers.nc declared as MatrixModifier and TypeFieldDescriptionSolverNC.SolverNCLDReturn.CNCResult.hitProbSolverNC.SolverNCMargReturn.lPrNCResult.missProbNCResult.pijSolverNC.SolverNCLDReturn.QSolverNC.SolverNCReturn.QSolverNC.SolverNCLDReturn.RSolverNC.SolverNCReturn.RNCResult.STeffSolverNC.SolverNCReturn.STeffSolverNC.SolverNCLDReturn.TSolverNC.SolverNCReturn.TSolverNC.SolverNCLDReturn.USolverNC.SolverNCReturn.USolverNC.SolverNCLDReturn.XSolverNC.SolverNCReturn.XMethods in jline.solvers.nc that return MatrixModifier and TypeMethodDescriptionSolverNC.getCdfRespT(AvgHandle... R) Get cumulative distribution function of response times at FCFS and delay nodesMethods in jline.solvers.nc with parameters of type MatrixModifier and TypeMethodDescriptionSolverNC.getProbAggr(Node node, Matrix state_a) Get aggregated probability for a specific node and stateConstructors in jline.solvers.nc with parameters of type MatrixModifierConstructorDescriptionSolverNCLDReturn(Matrix Q, Matrix U, Matrix R, Matrix T, Matrix C, Matrix X, double lG, double runtime, int it, String method) SolverNCMargReturn(Matrix lPr, double G, double lG, double runtime) SolverNCReturn(Matrix Q, Matrix U, Matrix R, Matrix T, int C, Matrix X, Double lG, Matrix STeff, int it, double runtime, String method) -
Uses of Matrix in jline.solvers.qns
Methods in jline.solvers.qns with parameters of type MatrixConstructors in jline.solvers.qns with parameters of type Matrix -
Uses of Matrix in jline.solvers.ssa
Fields in jline.solvers.ssa declared as MatrixModifier and TypeFieldDescriptionSSAResult.ANCIConfidence interval half-widths for arrival rates [stations x classes]final MatrixSSAValues.piSSAResult.QNCIConfidence interval half-widths for queue lengths [stations x classes]SSAResult.RNCIConfidence interval half-widths for response times [stations x classes]final MatrixSSAValues.SSqSampleNodeState.stateState information at each time pointSampleNodeState.tTime points of the samplingSampleSysState.tTime points of the samplingSSAResult.TNCIConfidence interval half-widths for throughputs [stations x classes]SSAResult.tranSyncTransient synchronization matrix for multi-class coordinationfinal MatrixSSAValues.tranSyncSSAResult.UNCIConfidence interval half-widths for utilizations [stations x classes]SSAResult.WNCIConfidence interval half-widths for residence times [stations x classes]Fields in jline.solvers.ssa with type parameters of type MatrixModifier and TypeFieldDescriptionSSAValues.arvRatesSSAValues.depRatesSSAResult.spaceState space matrices for each station in the networkSampleSysState.stateState information for each stateful node at each time pointSSAResult.tranSysStateTransient system state matrices indexed by time pointsSSAValues.tranSysStateMethods in jline.solvers.ssa with parameters of type MatrixModifier and TypeMethodDescriptionGet marginal probability for a specific node state (by node index).doubleGet probability for a specific node statedoubleSolverSSA.getProbAggr(Node node, Matrix state) Get aggregated probability for a specific node stateConstructors in jline.solvers.ssa with parameters of type MatrixModifierConstructorDescriptionSampleSysState(List<Node> handle, Matrix t, List<Matrix> state, List<Event> event, boolean isaggregate) SSAResult(Matrix QN, Matrix UN, Matrix RN, Matrix TN, Matrix CN, Matrix XN, Map<Integer, Matrix> tranSysState, Matrix tranSync, NetworkStruct sn) Constructs an SSAResult with the specified performance metrics and state information.SSAValues(Matrix pi, Matrix SSq, Map<Integer, Matrix> arvRates, Map<Integer, Matrix> depRates, Map<Integer, Matrix> tranSysState, Matrix tranSync, NetworkStruct sn) Constructor parameters in jline.solvers.ssa with type arguments of type MatrixModifierConstructorDescriptionSSAResult(Matrix QN, Matrix UN, Matrix RN, Matrix TN, Matrix CN, Matrix XN, Map<Integer, Matrix> tranSysState, Matrix tranSync, NetworkStruct sn) Constructs an SSAResult with the specified performance metrics and state information.SSAValues(Matrix pi, Matrix SSq, Map<Integer, Matrix> arvRates, Map<Integer, Matrix> depRates, Map<Integer, Matrix> tranSysState, Matrix tranSync, NetworkStruct sn) -
Uses of Matrix in jline.solvers.ssa.analyzers
Method parameters in jline.solvers.ssa.analyzers with type arguments of type MatrixModifier and TypeMethodDescriptionstatic SSAResultSolver_ssa_analyzer_nrm.solver_ssa_analyzer_nrm(NetworkStruct sn, Map<StatefulNode, Matrix> init_state, SolverOptions options) static SSAResultSolver_ssa_analyzer_parallel.solver_ssa_analyzer_parallel(NetworkStruct sn, Map<StatefulNode, Matrix> init_state, SolverOptions options, SolverSSA solverSSA) static SSAResultSolver_ssa_analyzer_serial.solver_ssa_analyzer_serial(NetworkStruct sn, boolean hash, Map<StatefulNode, Matrix> init_state, SolverOptions options, SolverSSA solverSSA) -
Uses of Matrix in jline.solvers.ssa.handlers
Fields in jline.solvers.ssa.handlers declared as MatrixModifier and TypeFieldDescriptionfinal MatrixSolverSSAResultNRM.CNfinal MatrixSolver_ssa_nrm_space.SolverSSAResultNRMSpace.depRatesfinal MatrixSolver_ssa_nrm_space.SolverSSAResultNRMSpace.outspacefinal MatrixSolver_ssa_nrm_space.SolverSSAResultNRMSpace.pifinal MatrixSolverSSAResultNRM.QNfinal MatrixSolverSSAResultNRM.RNfinal MatrixSolverSSAResultNRM.TNfinal MatrixSolverSSAResultNRM.UNfinal MatrixSolverSSAResultNRM.XNMethods in jline.solvers.ssa.handlers that return MatrixModifier and TypeMethodDescriptionSolverSSAResultNRM.getCN()SolverSSAResultNRM.getQN()SolverSSAResultNRM.getRN()SolverSSAResultNRM.getTN()SolverSSAResultNRM.getUN()SolverSSAResultNRM.getXN()Methods in jline.solvers.ssa.handlers that return types with arguments of type MatrixModifier and TypeMethodDescriptionSolver_ssa_nrm_space.next_reaction_method_space(Matrix S, List<List<Integer>> D, kotlin.jvm.functions.Function1<Matrix, Double>[] a, Matrix nvec0, int samples, SolverOptions options, Map<String, double[]> reactcache, kotlin.jvm.functions.Function1<Matrix, String> hashfun) static kotlin.Triple<Matrix, Matrix, NetworkStruct> Solver_ssa_reachability.solver_ssa_reachability(NetworkStruct sn, SolverOptions options) static kotlin.Triple<Matrix, Matrix, NetworkStruct> Solver_ssa_reachability.solver_ssa_reachability(NetworkStruct sn, SolverOptions options) Methods in jline.solvers.ssa.handlers with parameters of type MatrixModifier and TypeMethodDescriptionstatic voidSolver_ssa_nrm.next_reaction_method_direct(Matrix S, List<Integer>[] D, Function<Matrix, Double>[] a, Matrix nvec0, int samples, SolverOptions options, Matrix QN, Matrix UN, Matrix RN, Matrix TN, Matrix CN, Matrix XN, NetworkStruct sn, List<Integer> fromIdx, List<int[]> fromIR) Solver_ssa_nrm_space.next_reaction_method_space(Matrix S, List<List<Integer>> D, kotlin.jvm.functions.Function1<Matrix, Double>[] a, Matrix nvec0, int samples, SolverOptions options, Map<String, double[]> reactcache, kotlin.jvm.functions.Function1<Matrix, String> hashfun) static voidSolver_ssa_findenabled.solver_ssa_findenabled(NetworkStruct sn, EventCache eventCache, int A, Map<Integer, Integer> node_a, Map<Integer, Map<Integer, Matrix>> next_state, Map<Integer, Matrix> stateCell, Map<Integer, EventType> event_a, Map<Integer, Integer> class_a, boolean isSimulation, Map<Integer, Double> outprob_a, Map<Integer, Integer> node_p, int local, Map<Integer, EventType> event_p, Map<Integer, Integer> class_p, Map<Integer, Double> outprob_p, Map<Integer, Double> prob_sync_p, Map<Integer, Sync> sync, Map<Integer, Integer> node_a_sf, Map<Integer, Integer> node_p_sf, Map<Integer, Matrix> depRatesSamples, int samples_collected, Map<Integer, Matrix> arvRatesSamples, Matrix csmask, Map<Integer, Double> enabled_rates, Map<Integer, Integer> enabled_sync, SolverSSA solverSSA) static org.ejml.data.DMatrixRMajSolver_ssa.update_paddings_dense(NetworkStruct sn, Map<Integer, Matrix> stateCell, Matrix statelen, org.ejml.data.DMatrixRMaj tranStateD) Method parameters in jline.solvers.ssa.handlers with type arguments of type MatrixModifier and TypeMethodDescriptionstatic voidSolver_ssa.save_log_dense(double dt, Map<Integer, Matrix> cur_state, org.ejml.data.DMatrixRMaj tranStateD, int samples_collected, double[] tranSyncData, Map<Integer, Integer> enabled_sync, int firing_ctr, NetworkStruct sn, Map<Integer, Matrix> nir, Map<Integer, Matrix> stateCell, org.ejml.data.DMatrixRMaj SSqD) static voidSolver_ssa.save_log_dense(double dt, Map<Integer, Matrix> cur_state, org.ejml.data.DMatrixRMaj tranStateD, int samples_collected, double[] tranSyncData, Map<Integer, Integer> enabled_sync, int firing_ctr, NetworkStruct sn, Map<Integer, Matrix> nir, Map<Integer, Matrix> stateCell, org.ejml.data.DMatrixRMaj SSqD, Collector streamingCollector, double curTime) static SSAValuesSolver_ssa.solver_ssa(NetworkStruct sn_in, EventCache eventCache, Map<StatefulNode, Matrix> init_state, SolverOptions optionsIn, SolverSSA solverSSA) static org.ejml.data.DMatrixRMajSolver_ssa.update_paddings_dense(NetworkStruct sn, Map<Integer, Matrix> stateCell, Matrix statelen, org.ejml.data.DMatrixRMaj tranStateD) Constructors in jline.solvers.ssa.handlers with parameters of type MatrixModifierConstructorDescriptionSolverSSAResultNRM(Matrix QN, Matrix UN, Matrix RN, Matrix TN, Matrix CN, Matrix XN, NetworkStruct sn) SolverSSAResultNRMSpace(Matrix pi, Matrix outspace, Matrix depRates, NetworkStruct sn) -
Uses of Matrix in jline.streaming
Methods in jline.streaming with parameters of type MatrixModifier and TypeMethodDescriptionvoidCollector.recordState(double simulationTime, double dt, Matrix nirState, Matrix depRates, Matrix arvRates) Record state observation from simulation loop. -
Uses of Matrix in jline.util
Fields in jline.util declared as MatrixModifier and TypeFieldDescriptionMaths.laplaceApproxReturn.HPopulationLattice.sprodResult.nPopulationLattice.sprodResult.sPopulationLattice.sprodResult.Sfinal MatrixUniqueRowResult.sortedMatrixfinal MatrixUniqueRowResult.viMethods in jline.util that return MatrixModifier and TypeMethodDescriptionstatic MatrixImplementation of MATLAB "hist": puts elements of v into k binsstatic MatrixMaths.circul(int c) Returns a circulant matrix of order c.static MatrixReturns a circulant matrix from the given first column.static MatrixAdapted from jblas and IHMC Original documentation:static MatrixMaths.multichoose(double n, double k) static MatrixMaths.multichoose(int n, int k) Generates all combinations of n objects taken k at a time with repetition (multichoose).static MatrixMaths.multiChooseCon(Matrix n, double S) static MatrixComputes the combinations of the elements in v taken k at a timestatic MatrixMaths.num_grad_h(Matrix x0, double h, SerializableFunction<Matrix, Matrix> hfun) static MatrixMaths.num_hess_h(Matrix x0, double h, SerializableFunction<Matrix, Matrix> hfun) static MatrixMaths.permutations(Matrix vec) static MatrixInitializes a population product iterator.static MatrixAdvances to the next population state in lexicographic order.static Matrixstatic MatrixSet difference operation for Matrix objects that are vectors.static MatrixGMMUtils.sgmmConvolve(Matrix sgmm1, Matrix sgmm2) Convolves two simplified GMMs (sum of independent random variables).static MatrixGMMUtils.sgmmMixture(Matrix sgmm1, Matrix sgmm2, double p1, double p2) Creates a mixture of two simplified GMMs.static MatrixMaths.uniqueAndSort(Matrix space) static MatrixMaths.uniquePerms(Matrix vec) Methods in jline.util that return types with arguments of type MatrixModifier and TypeMethodDescriptionMaths.multiChooseCombinations(int k, int n) Generate all combinations of distributing n items into k binsMethods in jline.util with parameters of type MatrixModifier and TypeMethodDescriptionvoidAdds a pre-computed value for a specific state.Applies the function to the given state.static MatrixImplementation of MATLAB "hist": puts elements of v into k binsstatic MatrixReturns a circulant matrix from the given first column.static intComputes a hash index for a population vector within a lattice.static intComputes a hash index for a population vector using precomputed products.static Maths.laplaceApproxReturnMaths.laplaceapprox_h(Matrix x0, SerializableFunction<Matrix, Matrix> h) Maths.laplaceapprox_h_complex(Matrix x0, SerializableFunction<Matrix, ComplexMatrix> h) static doubleMaths.logmeanexp(Matrix x) static doubleReturn mean absolute percentage error of approx with respect to exactstatic Utils.MapeResultUtils.mapeWithNanMean(Matrix approx, Matrix exact) Polymorphic version that returns both MAPE and nanMean.static MatrixAdapted from jblas and IHMC Original documentation:static intReturns the position of the maximum value in a vector.static int[]Returns the positions of the n largest values in a vector.static intReturns the position of the minimum value in a vector.static int[]Returns the positions of the n smallest values in a vector.static MatrixMaths.multiChooseCon(Matrix n, double S) static doubleMaths.multinomialln(Matrix n) static MatrixComputes the combinations of the elements in v taken k at a timestatic MatrixMaths.num_grad_h(Matrix x0, double h, SerializableFunction<Matrix, Matrix> hfun) static ComplexMatrixMaths.num_grad_h_complex(Matrix x0, double h, SerializableFunction<Matrix, ComplexMatrix> hfun) static MatrixMaths.num_hess_h(Matrix x0, double h, SerializableFunction<Matrix, Matrix> hfun) static ComplexMatrixMaths.num_hess_h_complex(Matrix x0, double h, SerializableFunction<Matrix, ComplexMatrix> hfun) static MatrixMaths.permutations(Matrix vec) static MatrixInitializes a population product iterator.static MatrixAdvances to the next population state in lexicographic order.static Matrixstatic intMaths.probchoose(Matrix p) Choose an element index according to probability vector.static org.apache.commons.math3.complex.Complex[]static voidMatFileUtils.saveCTMCWorkspace(Matrix stateSpace, Matrix infGen, Matrix pi, String filename) Saves CTMC solver workspace to a .mat filestatic voidMatFileUtils.saveMatrix(Matrix matrix, String variableName, String filename) Saves a single matrix to a .mat filestatic MatrixSet difference operation for Matrix objects that are vectors.static MatrixGMMUtils.sgmmConvolve(Matrix sgmm1, Matrix sgmm2) Convolves two simplified GMMs (sum of independent random variables).static doubleCalculates the first moment (E[X]) of a simplified GMM.static doubleCalculates the second moment (E[X²]) of a simplified GMM.static doubleCalculates the mean of a simplified GMM directly from matrix representation.static MatrixGMMUtils.sgmmMixture(Matrix sgmm1, Matrix sgmm2, double p1, double p2) Creates a mixture of two simplified GMMs.static double[]Generates random samples from a simplified GMM representation.static doubleCalculates the standard deviation of a simplified GMM.static doubleCalculates the variance of a simplified GMM.static doubleMaths.simplex_fun(double[] x, Matrix L, Matrix N) Computes a specialized function used in simplex-based optimization algorithms.PopulationLattice.sprod(Matrix s, Matrix S, MatrixCell D) static MatrixMaths.uniqueAndSort(Matrix space) static MatrixMaths.uniquePerms(Matrix vec) Method parameters in jline.util with type arguments of type MatrixModifier and TypeMethodDescriptionstatic Maths.laplaceApproxReturnMaths.laplaceapprox_h(Matrix x0, SerializableFunction<Matrix, Matrix> h) static Maths.laplaceApproxReturnMaths.laplaceapprox_h(Matrix x0, SerializableFunction<Matrix, Matrix> h) Maths.laplaceapprox_h_complex(Matrix x0, SerializableFunction<Matrix, ComplexMatrix> h) static MatrixMaths.num_grad_h(Matrix x0, double h, SerializableFunction<Matrix, Matrix> hfun) static MatrixMaths.num_grad_h(Matrix x0, double h, SerializableFunction<Matrix, Matrix> hfun) static ComplexMatrixMaths.num_grad_h_complex(Matrix x0, double h, SerializableFunction<Matrix, ComplexMatrix> hfun) static MatrixMaths.num_hess_h(Matrix x0, double h, SerializableFunction<Matrix, Matrix> hfun) static MatrixMaths.num_hess_h(Matrix x0, double h, SerializableFunction<Matrix, Matrix> hfun) static ComplexMatrixMaths.num_hess_h_complex(Matrix x0, double h, SerializableFunction<Matrix, ComplexMatrix> hfun) static voidMatFileUtils.saveWorkspace(Map<String, Matrix> matrices, String filename) Saves multiple matrices to a .mat file as a workspaceConstructors in jline.util with parameters of type MatrixModifierConstructorDescriptionlaplaceApproxReturn(Matrix H, double I, double logI) sprodResult(Matrix s, Matrix n, Matrix S, MatrixCell D) -
Uses of Matrix in jline.util.graph
Methods in jline.util.graph that return MatrixModifier and TypeMethodDescriptionstatic MatrixPerforms topological sorting using Kahn's algorithm.DirectedGraph.toMatrix()UndirectedGraph.toMatrix()Methods in jline.util.graph with parameters of type MatrixModifier and TypeMethodDescriptionstatic booleanTests if the given adjacency matrix represents a Directed Acyclic Graph (DAG).static MatrixPerforms topological sorting using Kahn's algorithm.Constructors in jline.util.graph with parameters of type MatrixModifierConstructorDescriptionDirectedGraph(Matrix param) Constructs a directed graph with the given adjacency matrix (no column filtering).DirectedGraph(Matrix param, Set<Integer> colsToIgnore) Constructs a directed graph with the given adjacency matrix and column filter.UndirectedGraph(Matrix param) UndirectedGraph(Matrix param, Set<Integer> colsToIgnore) Constructs an undirected graph with the given adjacency matrix and column filter.UndirectedGraph(Matrix param, Set<Integer> colsToIgnore, boolean normalize) Constructs an undirected graph with optional weight normalization. -
Uses of Matrix in jline.util.matrix
Fields in jline.util.matrix declared as MatrixModifier and TypeFieldDescriptionComplexMatrix.imThe imaginary component of the complex matrixComplexMatrix.realThe real component of the complex matrixMethods in jline.util.matrix that return MatrixModifier and TypeMethodDescriptionMatrix.add(double alpha) Adds a scalar multiple of the all-ones matrix to this matrix:this + alpha * 1.Addsalpha * matrixto this matrix.Adds another matrix to this matrix:this + matrix.static MatrixReturns all elements in a matrix except the first onesstatic MatrixMatrix.broadcastColPlusRow(Matrix colVector, Matrix rowVector) Computes the element-wise sum of a column vector and a row vector, producing a matrix where each entry (i, j) is the sum of colVector[i] and rowVector[j].static MatrixCartesian product of two matrices.Matrix.ceil()Returns a new matrix where each element is the ceiling of the corresponding element in this matrix.Matrix.ceilEq()Applies the ceiling operation in-place to each element of this matrix.static MatrixConcatenates a collection of matrices stored in a map into a single row vector.static MatrixComputes the element-wise sum of all matrices stored in a map.MatrixCell.cellsum()Computes the element-wise sum of all matrices in this cell.Matrix.colon()Returns the matrix in column-major order.Matrix.columnMajorOrder()Equivalent to the colon operator in MATLAB (:).Matrix.compatibleSizesAdd(Matrix b) Performs element-wise addition with shape broadcasting where applicable.Matrix.concatCols(Matrix other) Concatenates this matrix with another matrix horizontally.static MatrixMatrix.concatColumns(Matrix left, Matrix right, Matrix out) Concatenates two matrices horizontally (column-wise).static MatrixMatrix.concatRows(Matrix top, Matrix bottom, Matrix out) Concatenates two matrices vertically (row-wise).Matrix.copy()Returns a deep copy of this matrix.Matrix.countEachRow(double val) Counts the number of occurrences of a value in each row of the matrix.Matrix.createBlockDiagonal(Matrix matrix2) Creates a block diagonal matrix by placing the current matrix in the top-left and another matrix (if provided) in the bottom-right.static MatrixMatrix.createLike(Matrix B) Creates a new empty matrix with the same shape and internal structure as the given matrix.Matrix.cumsumViaCol()Computes the cumulative sum of the matrix down each column.Matrix.cumsumViaRow()Computes the cumulative sum of the matrix across each row.static Matrixstatic MatrixMatrix.diag(double... values) Creates a square diagonal matrix from the given values.static MatrixMatrix.diagMatrix(double[] values) Creates a square diagonal matrix from a given array of values.static MatrixMatrix.diagMatrix(Matrix values) Creates a square diagonal matrix from the elements of a column or row vector matrix.static MatrixMatrix.diagMatrix(Matrix A, double[] values, int offset, int length) Creates or fills a square diagonal matrix with the specified values.Performs element-wise division between this matrix and the provided matrix.static MatrixSolves the discrete Sylvester equation A * X * B - X + C = 0.Matrix.elementDiv(Matrix B) Performs element-wise division of this matrix by another matrix.Matrix.elementDivide(Matrix b) Performs element-wise division with another matrix.Matrix.elementIncrease(double val) Increases each element of the matrix by a constant value.Matrix.elementMult(Matrix B) Performs in-place element-wise multiplication with another matrix.Matrix.elementMult(Matrix B, Matrix output) Performs element-wise multiplication with another matrix, storing the result in the given output matrix.Matrix.elementMultWithVector(Matrix B) Performs element-wise multiplication between this matrix and a row vector.Matrix.elementPow(double a) Raises each non-zero element of the matrix to the specified power.Matrix.elementPower(double t) Raises each element of the matrix to the given power.Matrix.exp()Applies the exponential function to each element of the matrix.Matrix.expm()Computes the matrix exponential.Matrix.expm_higham()Computes the matrix exponential using Higham's scaling and squaring method.static MatrixExtracts a rectangular submatrix from the given source matrix.Matrix.extractCols(int col0, int col1) Extracts a range of columns from this matrix (instance method).static MatrixMatrix.extractColumn(Matrix A, int column, Matrix out) Extracts a single column from the given matrix.static MatrixMatrix.extractColumns(Matrix A, int col0, int col1) Extracts a range of columns from the matrix [col0:col1).static MatrixMatrix.extractColumns(Matrix A, int col0, int col1, Matrix out) Extracts a range of columns from the matrix [col0:col1) into a destination matrix.Matrix.extractRows(int row0, int row1) Extracts rows from this matrix (instance method).static MatrixMatrix.extractRows(Matrix A, int row0, int row1) Extracts a range of rows from the matrix [row0:row1).static MatrixMatrix.extractRows(Matrix A, int row0, int row1, Matrix out) Extracts a range of rows from the matrix [row0:row1) into a destination matrix.static MatrixMatrix.eye(int length) Creates an identity matrix of given size.Matrix.fact()Computes the factorial of each element in the matrix.Matrix.factln()Computes the natural logarithm of the factorial for each element.static MatrixComputes the natural logarithm of the factorial (log(x!)) for each element in the input matrix.Matrix.fill(double val) Fills all entries in the matrix with the given value.Matrix.find()Returns the linear indices of all non-zero elements in the matrix.Matrix.findNonNegative()Returns the linear indices of all elements that are non-negative (≥ 0).Matrix.findNumber(double number) Finds all linear indices where the matrix has a specific value.Matrix.findZero()Finds all linear indices where the matrix value is zero.Matrix.fromArray2D(double[][] matrix) Populates the matrix from a 2D double array.Matrix.fromArray2D(int[][] matrix) Populates the matrix from a 2D integer array.static MatrixConstructs a Matrix from a list of rows, where each inner list is a row.MatrixCell.get(int i) Retrieves the matrix stored at the specified index.Matrix.getColumn(int j) Returns a column of the matrix as a new single-column matrix.Matrix.getRow(int i) Returns the specified row as a single-row matrix.Matrix.getRowsFrom(int row) Returns a new matrix consisting of rows from the given start index to the end.Matrix.getSlice(boolean[] rowFlags, boolean[] colFlags) Extracts a submatrix from rows/columns marked as true in input flags.Matrix.getSlice(int r0, int r1, int c0, int c1) Extracts a submatrix based on row/column bounds.static MatrixMatrix.getSubMatrix(Matrix sourceMatrix, int x0, int x1, int y0, int y1) Extracts a submatrix from the source matrix using zero-based index ranges.Matrix.getSubMatrix(Matrix rows, Matrix cols) Returns a matrix consisting of rows and columns selected by two index matrices.Performs the Hadamard (element-wise) product of two matrices.Matrix.inv()Computes the inverse of the matrix.static MatrixComputes the inverse of the given matrix.Computes the Kronecker product of this matrix and another matrix.Computes the Kronecker sum of two matrices: A ⊕ B = A \otimes I + I \otimes B, where \otimes is the Kronecker product and I is the identity matrix of matching size.Matrix.leftMatrixDivide(Matrix b) Solves the equation AX = B for X, where A is this matrix and B is the right-hand side.Matrix.log()Applies the natural logarithm element-wise.MatrixEquation.lookupSimple(String token) Retrieves a matrix result from the equation context by variable name.static MatrixComputes the solution to the continuous-time Lyapunov equation AX + XAᵀ + Q = 0.static MatrixMatrix.matrixAddVector(Matrix matrix, Matrix vector) Adds a vector to each row or column of the matrix, depending on the vector's orientation.Matrix.meanCol()Computes the mean of each column.Matrix.meanRow()Computes the mean of each row.Performs matrix multiplication: this * BPerforms matrix multiplication: this * BMatrix.neg()Returns the negation of this matrix (all elements multiplied by -1).static MatrixNegates all elements in the matrix and returns the result.static MatrixMatrix.oneMinusMatrix(Matrix matrix) Computes the matrix 1 - A, where diagonal entries become 1 - A(i, i) and off-diagonal entries become -A(i, j).static MatrixDecreases a single element of an integer vector by one.static MatrixDecreases multiple elements of an integer vector by one.static MatrixMatrix.ones(int rows, int cols) Creates a matrix of the given shape filled with ones.Matrix.pinv()Computes the Moore-Penrose pseudo-inverse of the matrix using SVD.static MatrixComputes the matrix power A^b for a non-negative integer exponent b.static MatrixMatrix.readFromFile(String fileName) Reads a CSV-formatted matrix from a file.Matrix.reciprocal()Computes the element-wise reciprocal (1/x) of the matrix.Matrix.repmat(int rows, int cols) Repeats the matrix to match the specified row and column replication.Matrix.reverse()Reverses the elements of a vector (row or column) matrix.Matrix.reverseRows()Reverses the order of rows in the matrix.Matrix.rightMatrixDivide(Matrix b) Performs right matrix division A / B = A * inv(B)static MatrixMatrix.robustLeftDivide(Matrix A, Matrix B) Robust linear solve for A·X = B that handles singular matrices.Matrix.scale(double scalar) Scales the matrix by the given scalar value.static MatrixMultiplies all elements of a matrix by a scalar.Stores a matrix at the specified index.Sets the specified column to the values in the given vector.Matrix.setColumns(int j0, int j1, Matrix cols) Sets multiple columns starting from column index j0 to j1 (exclusive) using values from another matrix.Sets the specified row to the values in the given vector.Sets multiple rows starting from row index i0 to i1 (exclusive) using values from another matrix.Returns a new matrix representing the updated slice after assigning values from newSlice.static MatrixMatrix.singleton(double value) Creates a 1×1 matrix containing a single scalar value.Matrix.sort()Returns a new matrix with the non-zero values sorted in ascending order.Matrix.sortEq()Sorts the current matrix's non-zero values in place.Matrix.sqrt()Computes the element-wise square root of the matrix.Matrix.square()Computes the matrix multiplied by itself.Matrix.sub(double x) Subtract a scalar from all elements.Subtracts alpha-scaled version of the provided matrix.Subtracts another matrix.Matrix.sumCols()Sums the values in each column and returns the results as a row vector.Matrix.sumCols(int startRow, int endRow) Computes the sum of a subset of rows for each column.Matrix.sumRows()Computes the sum of each row and returns the result as a column vector.Matrix.sumRows(int startCol, int endCol) Computes the sum over a subrange of columns for each row.static MatrixSolves the Sylvester equation A·X + X·B = -C using a Schur decomposition-based method.Matrix.transpose()Computes the transpose of the current matrix.static MatrixReturns the lower triangular part of a matrix (zeroing elements above the main diagonal).static MatrixReturns the elements on and below the kth diagonal of matrix A.static MatrixComputes the union of two matrices A and B.Matrix.uniqueInCol(int colIdx) Finds unique integer values in the specified column of the matrix.Matrix.uniqueInRow(int rowIdx) Finds unique integer values in the specified row of the matrix.Matrix.uniqueNonNegativeInCol(int colIdx) Finds unique positive values (strictly greater than 0) in the specified column.Matrix.uniqueNonNegativeInRow(int rowIdx) Finds unique positive values (strictly greater than 0) in the specified row.Matrix.uniqueNonZerosInCol(int colIdx) Finds unique non-zero values in the specified column.Matrix.uniqueNonZerosInRow(int rowIdx) Finds unique non-zero values in the specified row.static MatrixMatrix.zeros(int rows, int cols) Creates a matrix of the specified shape filled with zeros.Methods in jline.util.matrix that return types with arguments of type MatrixModifier and TypeMethodDescriptionMatrix.qr()Performs QR decomposition on the matrix.Matrix.schur()Computes the Schur decomposition with the default method and iteration count.Computes the Schur decomposition of the matrix.MatrixCell.toMap()Creates a copy of the internal mapping from indices to matrices.Methods in jline.util.matrix with parameters of type MatrixModifier and TypeMethodDescriptionAddsalpha * matrixto this matrix.Adds another matrix to this matrix:this + matrix.voidAddsalpha * matrixto this matrix in-place:this += alpha * matrix.voidAdds another matrix to this matrix in-place:this += matrix.static MatrixReturns all elements in a matrix except the first onesstatic MatrixMatrix.broadcastColPlusRow(Matrix colVector, Matrix rowVector) Computes the element-wise sum of a column vector and a row vector, producing a matrix where each entry (i, j) is the sum of colVector[i] and rowVector[j].static MatrixCartesian product of two matrices.static double[]Matrix.columnMatrixToDoubleArray(Matrix columnMatrix) Converts a column matrix (of size m x 1) to a dense double array of length m.static booleanCompares two matrices element-wise using a specified comparison operator.booleanMatrix.compareMatrix(Matrix matrix) Compares this matrix to another matrix for approximate equality.Matrix.compatibleSizesAdd(Matrix b) Performs element-wise addition with shape broadcasting where applicable.Matrix.concatCols(Matrix other) Concatenates this matrix with another matrix horizontally.static MatrixMatrix.concatColumns(Matrix left, Matrix right, Matrix out) Concatenates two matrices horizontally (column-wise).static MatrixMatrix.concatRows(Matrix top, Matrix bottom, Matrix out) Concatenates two matrices vertically (row-wise).Matrix.createBlockDiagonal(Matrix matrix2) Creates a block diagonal matrix by placing the current matrix in the top-left and another matrix (if provided) in the bottom-right.static MatrixMatrix.createLike(Matrix B) Creates a new empty matrix with the same shape and internal structure as the given matrix.static Matrixstatic MatrixMatrix.diagMatrix(Matrix values) Creates a square diagonal matrix from the elements of a column or row vector matrix.static MatrixMatrix.diagMatrix(Matrix A, double[] values, int offset, int length) Creates or fills a square diagonal matrix with the specified values.Performs element-wise division between this matrix and the provided matrix.voidPerforms in-place element-wise division between this matrix and the provided matrix.voidDivides this matrix by a scalar and stores the result in the output matrix.static MatrixSolves the discrete Sylvester equation A * X * B - X + C = 0.doubleRowView.dotProduct(Matrix columnVector) Computes the dot product of this row with a column vector.Matrix.elementDiv(Matrix B) Performs element-wise division of this matrix by another matrix.Matrix.elementDivide(Matrix b) Performs element-wise division with another matrix.static doubleMatrix.elementMinNonZero(Matrix matrix) Returns the smallest non-zero positive element in the given matrix.Matrix.elementMult(Matrix B) Performs in-place element-wise multiplication with another matrix.Matrix.elementMult(Matrix B, Matrix output) Performs element-wise multiplication with another matrix, storing the result in the given output matrix.Matrix.elementMultWithVector(Matrix B) Performs element-wise multiplication between this matrix and a row vector.static MatrixExtracts a rectangular submatrix from the given source matrix.static voidMatrix.extract(Matrix src, int srcX0, int srcX1, int srcY0, int srcY1, Matrix dst, int dstY0, int dstX0) Extracts a rectangular submatrix from a source matrix and stores it in a destination matrix.static MatrixMatrix.extractColumn(Matrix A, int column, Matrix out) Extracts a single column from the given matrix.static MatrixMatrix.extractColumns(Matrix A, int col0, int col1) Extracts a range of columns from the matrix [col0:col1).static MatrixMatrix.extractColumns(Matrix A, int col0, int col1, Matrix out) Extracts a range of columns from the matrix [col0:col1) into a destination matrix.static voidMatrix.extractDiag(Matrix A, Matrix outputB) Extracts the diagonal elements of a matrix and stores them in a destination matrix.static MatrixMatrix.extractRows(Matrix A, int row0, int row1) Extracts a range of rows from the matrix [row0:row1).static MatrixMatrix.extractRows(Matrix A, int row0, int row1, Matrix out) Extracts a range of rows from the matrix [row0:row1) into a destination matrix.static MatrixComputes the natural logarithm of the factorial (log(x!)) for each element in the input matrix.Matrix.findIndexWithZeroSum(Matrix matrix, boolean isRow) Finds the indices of all rows or columns in a matrix that have a sum of zero.Finds the indices of all rows in a matrix that exactly match a given row vector.static doubleComputes the 1-norm (maximum absolute column sum) of the matrix.static MatrixMatrix.getSubMatrix(Matrix sourceMatrix, int x0, int x1, int y0, int y1) Extracts a submatrix from the source matrix using zero-based index ranges.Matrix.getSubMatrix(Matrix rows, Matrix cols) Returns a matrix consisting of rows and columns selected by two index matrices.Performs the Hadamard (element-wise) product of two matrices.static doubleComputes the infinity norm (maximum absolute row sum) of the matrix.voidMatrix.insertSubMatrix(int start_row, int start_col, int end_row, int end_col, Matrix matrix_to_be_inserted) Inserts a sub-matrix into the current matrix at the specified location.Computes the intersection of scalar values present in two matrices.static MatrixComputes the inverse of the given matrix.booleanChecks if two matrices are exactly equal.booleanMatrix.isEqualToTol(Matrix m, double tol) Checks if two matrices are equal within a specified tolerance.Computes the Kronecker product of this matrix and another matrix.Computes the Kronecker sum of two matrices: A ⊕ B = A \otimes I + I \otimes B, where \otimes is the Kronecker product and I is the identity matrix of matching size.Matrix.leftMatrixDivide(Matrix b) Solves the equation AX = B for X, where A is this matrix and B is the right-hand side.static doubleComputes the sum of the natural logarithms of all elements in the matrix.static doubleComputes log(sum_i exp(x_i)) in a numerically stable way (log-sum-exp trick).static MatrixComputes the solution to the continuous-time Lyapunov equation AX + XAᵀ + Q = 0.static intReturns the index of the row in the matrix that exactly matches the given row vector.static MatrixMatrix.matrixAddVector(Matrix matrix, Matrix vector) Adds a vector to each row or column of the matrix, depending on the vector's orientation.static doubleMatrix.maxAbsDiff(Matrix a, Matrix b) Computes the maximum relative absolute difference between corresponding elements of two matrices: max(abs((a - b) / b)).Performs matrix multiplication: this * BPerforms matrix multiplication: this * BvoidReplaces this matrix with the result of this * B.static MatrixNegates all elements in the matrix and returns the result.static MatrixMatrix.oneMinusMatrix(Matrix matrix) Computes the matrix 1 - A, where diagonal entries become 1 - A(i, i) and off-diagonal entries become -A(i, j).static MatrixDecreases a single element of an integer vector by one.static MatrixDecreases multiple elements of an integer vector by one.static MatrixComputes the matrix power A^b for a non-negative integer exponent b.static double[][][]Matrix.removeRows(double[][][] array, Matrix rowsToRemove) Matrix.rightMatrixDivide(Matrix b) Performs right matrix division A / B = A * inv(B)static MatrixMatrix.robustLeftDivide(Matrix A, Matrix B) Robust linear solve for A·X = B that handles singular matrices.voidScales this matrix by the given scalar value and stores the result in the provided output matrix.static MatrixMultiplies all elements of a matrix by a scalar.Stores a matrix at the specified index.Sets the specified column to the values in the given vector.Matrix.setColumns(int j0, int j1, Matrix cols) Sets multiple columns starting from column index j0 to j1 (exclusive) using values from another matrix.Sets the specified row to the values in the given vector.Sets multiple rows starting from row index i0 to i1 (exclusive) using values from another matrix.Returns a new matrix representing the updated slice after assigning values from newSlice.voidMatrix.setSliceEq(int rowStart, int rowEnd, int colStart, int colEnd, Matrix newSlice) Sets the values of a submatrix (in-place) using the specified newSlice matrix.voidCopies the data from another matrix into this matrix.static booleanSolves the sparse linear system Ax = b.static booleanMatrix.solveDirect(Matrix a, Matrix b, Matrix x) Solves the linear system A*x = b directly using LU decomposition without singularity checks.static booleanSolves the linear system Ax = b for x, handling singular matrices gracefully.static Ret.SpectralDecompositionComputes the spectral decomposition of a matrix A using its eigendecomposition.Subtracts alpha-scaled version of the provided matrix.Subtracts another matrix.voidSubtracts a scaled matrix from the current matrix in place.voidSubtracts a matrix from the current matrix in place.static doubleMatrix.sumCumprod(Matrix matrix) Computes the sum of the cumulative product along a row vector.static MatrixSolves the Sylvester equation A·X + X·B = -C using a Schur decomposition-based method.org.ejml.data.DMatrixSparseCSCMatrix.toDMatrixSparseCSC(Matrix matrix) Converts a specified matrix to a copy of its underlyingDMatrixSparseCSCstructure.static MatrixReturns the lower triangular part of a matrix (zeroing elements above the main diagonal).static MatrixReturns the elements on and below the kth diagonal of matrix A.static MatrixComputes the union of two matrices A and B.static UniqueRowResultMatrix.uniqueRowIndexes(Matrix m) Finds the indices of unique rows in a matrix without returning a matrix of the unique rows themselves.static UniqueRowResultMatrix.uniqueRowIndexesFromColumn(Matrix m, int startCol) Identifies unique rows in a matrix starting from a specified column index.static UniqueRowResultMatrix.uniqueRows(Matrix m) Finds all unique rows in a matrix and returns the unique sorted rows, along with mapping indices to/from the original matrix.Matrix.weaklyConnect(Matrix param, Set<Integer> colsToIgnore) Weakly-connected components of a sub-matrix.Method parameters in jline.util.matrix with type arguments of type MatrixModifier and TypeMethodDescriptionstatic MatrixConcatenates a collection of matrices stored in a map into a single row vector.static MatrixComputes the element-wise sum of all matrices stored in a map.static intMatrix.getColIndexSum(Map<Integer, Matrix> cellArray) Computes the total number of elements across all matrices in a map, summingnumRows * numColsfor each matrix.Constructors in jline.util.matrix with parameters of type MatrixModifierConstructorDescriptionComplexMatrix(Matrix real) Creates a complex matrix from a real matrix with zero imaginary component.ComplexMatrix(Matrix real, Matrix im) Creates a complex matrix from separate real and imaginary component matrices.Creates a copy of the specified matrix.MatrixCell(Matrix[] x) Creates a MatrixCell from an array of matrices.MatrixCell(Matrix D0, Matrix D1) Creates a MatrixCell containing exactly two matrices.