sampleSFS: Finds the SFS from a given solution of P and E

In ragnhildlaursen/SFS: Sampling the set of feasible solutions from a non-negative matrix factorization

Description

Finds the SFS from a given solution of P and E

Usage

sampleSFS(P, E, maxIter = 10^5L, check = 1000L, beta = 0.5, eps = 1e-10)

Arguments

P	One of the factorized two matrices, which will control the stopping criteria
E	The other of the facotrized matrizes
maxIter	The maximum number of iterations
check	Number of iterations between checking to stop
beta	The two shape parameters in the be3ta distribution to sample lambda
eps	Epsilon for the stopping criteria

Value

A list of outputs from the sampleSFS function

• avgChangeFinal - final average change for each entrance in P

• avgChangeEachCheck - average change for each entrance in P at each check

• totalIter - total number of iterations needed for convergence of the average change

• Pminimum - minimum for each entry in P

• Pmaximum - maximum for each entry in P

• Eminimum - minimum for each entry in E

• Emaximum - maximum for each entry in E

• P_lastCheckResults - results of P for the last 'check' iterations

• E_lastCheckResults - results of E for the last 'check' iterations

ragnhildlaursen/SFS documentation built on Nov. 15, 2021, 8:28 p.m.