Uses of Class
solvers.dataStructures.BigRational

Packages that use BigRational

Package	Description
solvers.basis	Basis representations of the MoM and CoMoM exact solution algorithms of JMVA.
solvers.control	Control logic of the JMVA solvers.
solvers.dataStructures	Data structures shared by the JMVA solvers (tuples, positions, lists and matrices).
solvers.linearSystem.btf	Block Triangular Form (BTF) of the linear systems arising in the MoM and CoMoM algorithms, as described in the method of moments literature.
solvers.linearSystem.btf.macroBlocks	Macro blocks of the Block Triangular Form linear system decomposition used by the JMVA MoM and CoMoM solvers.
solvers.linearSystem.btf.microBlocks	Micro blocks of the Block Triangular Form linear system decomposition used by the JMVA MoM and CoMoM solvers.
solvers.linearSystem.btf.topLevelBlocks	Top level blocks of the Block Triangular Form linear system decomposition used by the JMVA MoM and CoMoM solvers.
solvers.linearSystem.simple	Simple linear system solvers used by JMVA.
solvers.linearSystem.simple.matrix	Matrix implementation of the simple linear system solvers used by JMVA.
solvers.linearSystemSolver	Linear system solver used by the exact JMVA solution algorithms.
solvers.queueingnet	Queueing network model of JMVA: stations, classes, service demands and visits used by the exact and approximate solution algorithms.
solvers.queueingnet.treeAlgorithms.treeConvolution	TreeConvolution algorithm of JMVA, the tree based version of the convolution algorithm.
solvers.utilities	Utilities of the JMVA solvers, such as the processing capacity checker used to verify that the workload can be processed by the network.

Uses of BigRational in solvers.basis

Fields in solvers.basis declared as BigRational

Modifier and Type	Field	Description
protected BigRational[]	Basis.basis	The vectors in which to store the basis values
protected BigRational[]	Basis.previous_basis

Methods in solvers.basis that return BigRational

Modifier and Type	Method	Description
BigRational	Basis.getNewValue(int index)
abstract BigRational	Basis.getNormalisingConstant()	Returns the Normalising Constant for the current computed population
BigRational	CoMoMBasis.getNormalisingConstant()	Returns the Normalising Constant for the current computed population
BigRational	Basis.getOldValue(int index)

Methods in solvers.basis with parameters of type BigRational

Modifier and Type	Method	Description
void	Basis.setValue(BigRational value, int index)

Uses of BigRational in solvers.control

Methods in solvers.control that return BigRational

Modifier and Type	Method	Description
BigRational	MoMSolverDispatcher.getNormalisingConstant()	Returns the value of the normalising constant as a BigRational.

Uses of BigRational in solvers.dataStructures

Classes in solvers.dataStructures that implement interfaces with type arguments of type BigRational

Modifier and Type	Class	Description
class	BigRational	This class is a representation of rational numbers.

Fields in solvers.dataStructures declared as BigRational

Modifier and Type	Field	Description
static final BigRational	BigRational.MINUS_ONE	This is a variable equal to minus one.
static final BigRational	BigRational.ONE	This is a variable equal to one.
static final BigRational	BigRational.ZERO	This is a variable equal to zero.

Methods in solvers.dataStructures that return BigRational

Modifier and Type	Method	Description
BigRational	BigRational.abs()	Returns a BigRational object equal to the absolute value of this BigRational.
BigRational	BigRational.add(BigRational b)	Adds this number (a) to another (b)
BigRational	BigRational.copy()	Returns a copy of the current BigRational.
BigRational	BigRational.divide(BigRational b)	Divides this number (a) by another (b)
BigRational	EnhancedVector.getAsBigRational(int index)	Returns the number in a specific index of the EnhancedVector as a BigRational object.
BigRational	QNModel.getDelayAsBigRational(int r)	Returns the delay (think time) of a class as a BigRational object .
BigRational	QNModel.getDemandAsBigRational(int k, int r)	Returns the service demand of a class at a queue as a BigRational object.
BigRational[][]	QNModel.getMeanQueueLengths()	Returns the computed mean queue lengths Q of the current model.
BigRational[]	QNModel.getMeanThroughputs()	Returns the computed mean throughputs X of the current model.
BigRational	QNModel.getNormalisingConstant()	Returns the computed normalising constant G.
BigRational	BigRational.mod(BigInteger m)	Returns (this mod m), allowing for negative numbers or zeros as results.
BigRational	BigRational.modNormal(BigInteger m)	Returns (this mod m), allowing for positive numbers or zeros as results.
BigRational	BigRational.multiply(BigInteger b)	Multiplies this number (a) with another (b)
BigRational	BigRational.multiply(BigRational b)	Multiplies this number (a) with another (b)
BigRational	BigRational.negate()	Negates this number (a)
BigRational	BigRational.pow(int n)	Computes this number raised to the power of another
BigRational	BigRational.reciprocal()	Return the reciprocal (1/a) of this number (a)
BigRational	BigRational.subtract(BigRational b)	Subtracts a number (b) from this one (a)

Methods in solvers.dataStructures with parameters of type BigRational

Modifier and Type	Method	Description
BigRational	BigRational.add(BigRational b)	Adds this number (a) to another (b)
int	BigRational.compareTo(BigRational b)	Compares the BigRational with another.
BigRational	BigRational.divide(BigRational b)	Divides this number (a) by another (b)
boolean	BigRational.greaterOrEqualThan(BigRational b)	Checks whether this number is greater than or equal to another.
boolean	BigRational.greaterThan(BigRational b)	Checks whether this number is greater than another.
BigRational	BigRational.multiply(BigRational b)	Multiplies this number (a) with another (b)
void	QNModel.setNormalisingConstant(BigRational G)	Stores the normalising constant (G) in the model description object (QNModel).
void	QNModel.setPerformanceMeasures(BigRational[][] Q, BigRational[] X)	Stores the performance measures (mean throughputs X and mean queue lengths Q) in the model description object (QNModel).
boolean	BigRational.smallerOrEqualThan(BigRational b)	Checks whether this number is smaller than or equal to another.
boolean	BigRational.smallerThan(BigRational b)	Checks whether this number is smaller than another.
BigRational	BigRational.subtract(BigRational b)	Subtracts a number (b) from this one (a)

Uses of BigRational in solvers.linearSystem.btf

Methods in solvers.linearSystem.btf with parameters of type BigRational

Modifier and Type	Method	Description
void	BTFLinearSystem.multiply(BigRational[] lhs_result, BigRational[] rhs_result)	Multiplies the matrices by the values in the previous and current bases.
abstract void	ComponentBlock.multiply(BigRational[] result)	Carries out the appropriate matrix multiplication operation for the block
abstract void	ComponentBlock.solve(BigRational[] rhs)	Makes the block carry out its role in the solution of the linear system

Uses of BigRational in solvers.linearSystem.btf.macroBlocks

Fields in solvers.linearSystem.btf.macroBlocks declared as BigRational

Modifier and Type	Field	Description
protected BigRational[][][][]	BlockMatrix.matrix

Methods in solvers.linearSystem.btf.macroBlocks that return BigRational

Modifier and Type	Method	Description
BigRational	BlockMatrix.get(int row, int col)
BigRational	SparseBlock.get(int row, int col)
BigRational	SparseBlockMatrix.get(int row, int col)

Methods in solvers.linearSystem.btf.macroBlocks with parameters of type BigRational

Modifier and Type	Method	Description
void	BlockMatrix.multiply(BigRational[] result)
void	MacroBlock.multiply(BigRational[] result)
void	SecondaryMacroBlock.multiply(BigRational[] result)
void	SparseBlock.multiply(BigRational[] result)
void	SparseBlockMatrix.multiply(BigRational[] result)
void	BlockMatrix.solve(BigRational[] rhs)
void	MacroBlock.solve(BigRational[] rhs)
void	SecondaryMacroBlock.solve(BigRational[] rhs)
void	SparseBlock.solve(BigRational[] rhs)
void	SparseBlockMatrix.solve(BigRational[] rhs)
void	BlockMatrix.write(int row, int col, BigRational value)
void	SparseBlock.write(int row, int col, BigRational value)
void	SparseBlockMatrix.write(int row, int col, BigRational value)

Uses of BigRational in solvers.linearSystem.btf.microBlocks

Fields in solvers.linearSystem.btf.microBlocks declared as BigRational

Modifier and Type	Field	Description
protected BigRational[][]	MatrixMicroBlock.array	The underlying array

Methods in solvers.linearSystem.btf.microBlocks that return BigRational

Modifier and Type	Method	Description
protected BigRational	MatrixMicroBlock.multiplyRow(int index)
BigRational[]	LUP_Decomposition.test_solve(BigRational[] b)	Solve Method used for unit testing.

Methods in solvers.linearSystem.btf.microBlocks with parameters of type BigRational

Modifier and Type	Method	Description
void	B1MicroBlock.multiply(BigRational[] result)
void	B2MicroBlock.multiply(BigRational[] result)
void	CMicroBlock.multiply(BigRational[] result)
void	MatrixMicroBlock.multiply(BigRational[] result)
void	B1MicroBlock.solve(BigRational[] rhs)
void	B2MicroBlock.solve(BigRational[] rhs)
void	CMicroBlock.solve(BigRational[] rhs)
void	LUP_Decomposition.solve(BigRational[] rhs)	Solve method called by XMicroBlock, uses basis values and temporary basis rhs
void	XMicroBlock.solve(BigRational[] rhs)
void	YMicroBlock.solve(BigRational[] rhs)
void	XMicroBlock.solve2(BigRational[] rhs)	Alternative solve that uses the simple linear system solver
BigRational[]	LUP_Decomposition.test_solve(BigRational[] b)	Solve Method used for unit testing.

Constructors in solvers.linearSystem.btf.microBlocks with parameters of type BigRational

Modifier	Constructor	Description
	LUP_Decomposition(CoMoMBasis basis, Position position, BigRational[][] A, boolean in_place)

Uses of BigRational in solvers.linearSystem.btf.topLevelBlocks

Methods in solvers.linearSystem.btf.topLevelBlocks with parameters of type BigRational

Modifier and Type	Method	Description
void	ATopLevelBlock.multiply(BigRational[] result)
void	TopLevelBlock.multiply(BigRational[] result)
void	ATopLevelBlock.solve(BigRational[] rhs)
void	TopLevelBlock.solve(BigRational[] rhs)

Uses of BigRational in solvers.linearSystem.simple

Methods in solvers.linearSystem.simple that return BigRational

Modifier and Type	Method	Description
BigRational[]	SimpleLinearSystem.multiplylhs()
BigRational[]	SimpleLinearSystem.multiplyrhs()	Multiply methods for testing purposes

Uses of BigRational in solvers.linearSystem.simple.matrix

Methods in solvers.linearSystem.simple.matrix that return BigRational

Modifier and Type	Method	Description
abstract BigRational	Matrix.get(int row, int col)	Returns value a (row, col)
BigRational	StandardMatrix.get(int row, int col)
abstract BigRational[][]	Matrix.getArray()	Returns the matrix as a BigRational[][] array
BigRational[][]	StandardMatrix.getArray()
BigRational	StandardMatrix.getDeterminatnt()
abstract BigRational[]	Matrix.multiply()	Multiplies the previous basis by the matrix
BigRational[]	StandardMatrix.multiply()

Methods in solvers.linearSystem.simple.matrix with parameters of type BigRational

Modifier and Type	Method	Description
abstract void	Matrix.write(int row, int col, BigRational v)	Writes value v at position (row,col) in matrix
void	StandardMatrix.write(int row, int col, BigRational v)

Uses of BigRational in solvers.linearSystemSolver

Fields in solvers.linearSystemSolver declared as BigRational

Modifier and Type	Field	Description
protected BigRational[][]	Solver.A	Holds the initial version of A, as calling solve(..) destroys A's contents (the calculations are performed in-place).
protected BigRational[]	Solver.b	The vector b of the linear system Ax = b.
protected BigRational[][]	Solver.cleanA	Holds the initial version of A, as calling solve(..) destroys A's contents (the calculations are performed in-place).
protected static final BigRational	Solver.EPSILON	It is used to determine wheter the matrix A is singular.

Methods in solvers.linearSystemSolver that return BigRational

Modifier and Type	Method	Description
BigRational	ModularSolverParallelTask.getDetRes()	Returns the value of the residual determinant.
BigRational[]	ModularSolverParallelTask.getyRes()	The array of the semi-combined residual solutions.
BigRational[]	ModularSolver.solve(BigRational[] bInput)	Solves the linear system using residual systems solved by Gaussian elimination
BigRational[]	SimpleSolver.solve(BigRational[] b)	Solves the linear system using Gaussian elimination with partial pivoting
BigRational[]	Solver.solve(BigRational[] b)	Solves the linear system.
BigRational[]	SolverInterface.solve(BigRational[] b)	Gaussian elimination linear system solver with partial pivoting.

Methods in solvers.linearSystemSolver with parameters of type BigRational

Modifier and Type	Method	Description
void	ModularSolver.initialise(BigRational[][] A, List<Tuple<Integer,Integer>> UList, Set<Integer> uncomputables, int maxA, BigInteger maxb, BigRational maxG)
void	Solver.initialise(BigRational[][] A)	Initialises the solver object.
void	Solver.initialise(BigRational[][] A, List<Tuple<Integer,Integer>> UList, Set<Integer> uncomputables)	Initialises the solver object, taking into account a list of positions of A that may need to be updated when requested.
void	Solver.initialise(BigRational[][] A, List<Tuple<Integer,Integer>> UList, Set<Integer> uncomputables, int maxA, BigInteger maxb, BigRational maxG)	Initialises the solver object, taking into account a list of positions of A that may need to be updated when requested.
void	SolverInterface.initialise(BigRational[][] A)	Initialises the solver object.
void	SolverInterface.initialise(BigRational[][] A, List<Tuple<Integer,Integer>> UList, Set<Integer> uncomputables)	Initialises the solver object, taking into account a list of positions of A that may need to be updated when requested.
void	ModularSolverParallelTask.prepare(BigRational[][] Amod, BigRational[] b, Set<Integer> rowsToSkip, Set<Integer> columnsToSkip)	Initialises a ModularSolverParallelTask object for solving a residual linear system Ax=b.
BigRational[]	ModularSolver.solve(BigRational[] bInput)	Solves the linear system using residual systems solved by Gaussian elimination
BigRational[]	SimpleSolver.solve(BigRational[] b)	Solves the linear system using Gaussian elimination with partial pivoting
BigRational[]	Solver.solve(BigRational[] b)	Solves the linear system.
BigRational[]	SolverInterface.solve(BigRational[] b)	Gaussian elimination linear system solver with partial pivoting.

Uses of BigRational in solvers.queueingnet

Fields in solvers.queueingnet declared as BigRational

Modifier and Type	Field	Description
protected BigRational	QNSolver.G	The normalising constant is stored here after it has been computed.

Fields in solvers.queueingnet with type parameters of type BigRational

Modifier and Type	Field	Description
protected Map<Integer, BigRational>	RecursiveSolver.factorial	The factorials for some numbers are pre-computed for efficiency reasons.
protected Map<PopulationVector, Map<MultiplicitiesVector, BigRational>>	RecursiveSolver.Gmap	Here is stored every normalising constant computed.

Methods in solvers.queueingnet that return BigRational

Modifier and Type	Method	Description
BigRational	ConvolutionSolver.compute(MultiplicitiesVector m, PopulationVector p)	Computes any normalising constant using a simple recursion and taking advantage of any already computed and stored value.
protected BigRational	RECALNonRecursiveSolver.compute(MultiplicitiesVector finalm, PopulationVector finalp)	Computes any normalising constant non-recursively and by taking advantage of any already computed and stored value.
protected BigRational	RECALSolver.compute(MultiplicitiesVector m, PopulationVector p)	Computes any normalising constant using a simple recursion and taking advantage of any already computed and stored value.
protected BigRational	RecursiveSolver.compute(MultiplicitiesVector m, PopulationVector p)	Computes any normalising constant using a simple recursion and taking advantage of any already computed and stored value.
protected BigRational	RGFSolver.compute(MultiplicitiesVector m, PopulationVector p, int q, BigRational[][] load)
protected BigRational	RecursiveSolver.findG(MultiplicitiesVector m, PopulationVector p)	Searches for a normalising constant in the memory.
protected BigRational	RecursiveSolver.initialConditionFor(PopulationVector n)	Returns the initial condition corresponding to a particular PopulationVector object.
protected BigRational	RecursiveSolver.recallG(MultiplicitiesVector m, PopulationVector p)	Searches for a normalising constant in the memory.

Methods in solvers.queueingnet with parameters of type BigRational

Modifier and Type	Method	Description
protected BigRational	RGFSolver.compute(MultiplicitiesVector m, PopulationVector p, int q, BigRational[][] load)
protected void	RecursiveSolver.storeG(MultiplicitiesVector m, PopulationVector p, BigRational Gval)	Stores a computed normalising constant value for future re-use.
protected void	RecursiveSolver.storeG(MultiplicitiesVector m, PopulationVector p, BigRational Gval, Map<PopulationVector, Map<MultiplicitiesVector, BigRational>> map)	Stores at a particular Map<PopulationVector, Map<MultiplicitiesVector, BigRational>> data structure a computed normalising constant value for future re-use.

Method parameters in solvers.queueingnet with type arguments of type BigRational

Modifier and Type	Method	Description
protected void	RecursiveSolver.storeG(MultiplicitiesVector m, PopulationVector p, BigRational Gval, Map<PopulationVector, Map<MultiplicitiesVector, BigRational>> map)	Stores at a particular Map<PopulationVector, Map<MultiplicitiesVector, BigRational>> data structure a computed normalising constant value for future re-use.

Uses of BigRational in solvers.queueingnet.treeAlgorithms.treeConvolution

Methods in solvers.queueingnet.treeAlgorithms.treeConvolution that return BigRational

Modifier and Type	Method	Description
BigRational[][]	IThreadedTCSolver.calculateMeanQueueLengths(PopulationVector p)	Calculates per class and per station mean queue lengths using methods outlined in LamLien83 paper.
BigRational[][]	MultiThreadTCSolver.calculateMeanQueueLengths(PopulationVector p)	Calculates per class and per station mean queue lengths using methods outlined in LamLien83 paper.
BigRational[][]	SingleThreadTCSolver.calculateMeanQueueLengths(PopulationVector p)	Calculates per class and per station mean queue lengths using methods outlined in LamLien83 paper.
BigRational[]	IThreadedTCSolver.calculateThroughputs(PopulationVector p)	Calculates per class throughputs using methods outlined in LamLien83 paper.
BigRational[]	MultiThreadTCSolver.calculateThroughputs(PopulationVector p)	Calculates per class throughputs using methods outlined in LamLien83 paper.
BigRational[]	SingleThreadTCSolver.calculateThroughputs(PopulationVector p)	Calculates per class throughputs using methods outlined in LamLien83 paper.
BigRational	IThreadedTCSolver.computeG(Node node, PopulationVector pv)	Compute G using postorder tree traversal.
BigRational	MultiThreadTCSolver.computeG(Node node, PopulationVector pv)	Computes G using postorder tree traversal.
BigRational	SingleThreadTCSolver.computeG(Node node, PopulationVector pv)	Computes G using postorder tree traversal.
BigRational[]	ConvolutionLayer.computeGmPlusStoreMultiple(Node cloneParent, PopulationVector p, int m)	Calculates Gm+(n-1_k) by storing multiple g arrays, one for each partially covered class in pc.
BigRational[]	ConvolutionLayer.computeGmPlusStoreSingle(Node cloneParent, PopulationVector p, int m)	Calculates Gm+(n-1_k) using first method from section 4.2 in Lam/Lien paper.
BigRational	ConvolutionLayer.computeGNminusOneMethod1(Node root, int k, PopulationVector pv)	Computes the normalisation constant G(N - 1_k) for the specified class k, required to calculate the chain throughputs.

Uses of BigRational in solvers.utilities

Methods in solvers.utilities that return BigRational

Modifier and Type	Method	Description
static BigRational	MiscMathsFunctions.computeFactorial(int n)	Computes the factorial for a given number and returns the result as a BigRational.
static BigRational[]	MiscMathsFunctions.createBigRationalArray(int[] s)	Transforms an array of ints to an array of BigRationals.
static BigRational[][]	MiscMathsFunctions.createBigRationalArray(int[][] d)	Transforms an array of ints to an array of BigRationals.
static BigRational[]	MiscMathsFunctions.matrixVectorMultiply(BigRational[][] A, BigRational[] v)	Multiplies a two-dimensional matrix of BigRationals with a one-dimensional one.
static BigRational[]	MiscMathsFunctions.matrixVectorMultiplyJ(BigRational[][] A, BigRational[] v)

Methods in solvers.utilities that return types with arguments of type BigRational

Modifier and Type	Method	Description
static Map<Integer, BigRational>	MiscMathsFunctions.computeFactorials(int n)	Computes the factorials up to a given number and returns them as a Map<Integer,BigRational>.

Methods in solvers.utilities with parameters of type BigRational

Modifier and Type	Method	Description
static void	MiscMathsFunctions.dotprintMatrix(BigRational[][] A)
static BigRational[]	MiscMathsFunctions.matrixVectorMultiply(BigRational[][] A, BigRational[] v)	Multiplies a two-dimensional matrix of BigRationals with a one-dimensional one.
static BigRational[]	MiscMathsFunctions.matrixVectorMultiplyJ(BigRational[][] A, BigRational[] v)
static void	MiscMathsFunctions.printMatrix(BigRational[] A)	Prints a 1-dimensional matrix.
static void	MiscMathsFunctions.printMatrix(BigRational[][] A)	Prints a 2-dimensional matrix
static void	MiscMathsFunctions.printPrettyMatrix(BigRational[] A)	Prints a 1-dimensional matrix of BigRationals as doubles.
static void	MiscMathsFunctions.printPrettyMatrix(BigRational[][] A)	Prints a 2-dimensional matrix of BigRationals as doubles.