combin.h

Go to the documentation of this file.

/* =====================================================================================
 
                      The UQ Toolkit (UQTk) version 3.1.1
                          Copyright (2021) NTESS
                        https://www.sandia.gov/UQToolkit/
                        https://github.com/sandialabs/UQTk
 
     Copyright 2021 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
     Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
     retains certain rights in this software.
 
     This file is part of The UQ Toolkit (UQTk)
 
     UQTk is open source software: you can redistribute it and/or modify
     it under the terms of BSD 3-Clause License
 
     UQTk is distributed in the hope that it will be useful,
     but WITHOUT ANY WARRANTY; without even the implied warranty of
     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
     BSD 3 Clause License for more details.
 
     You should have received a copy of the BSD 3 Clause License
     along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
 
     Questions? Contact the UQTk Developers at <uqtk-developers@software.sandia.gov>
     Sandia National Laboratories, Livermore, CA, USA
===================================================================================== */
 
#ifndef COMBIN_H
#define COMBIN_H
 
#include "Array2D.h"
 
 
 
int choose(int n,int k);
 
int factorial(int number);
 
double logfactorial(int number);
 
void chooseComb(int n, int k,Array2D<int>& fullInd);
 
 
void get_perm(int n, int* perm,int seed);
 
void get_perm(Array1D<int>& perm, int seed);
 
 
double gammai(const double a, const double x);
 
double beta(const double z, const double w);
 
double betai(const double p, const double q, const double x);
 
double digama ( double x );
 
void clust(Array2D<double>& data_in, Array1D<double>& w,int ncl, Array1D<int>& numData,int *pClusterIndex);
 
double clust_best(Array2D<double>& data_in, Array1D<double>& w,int ncl, Array1D<int>& bestnumData,int *bestClusterIndex,int ntry);
int findNumCl(Array2D<double>& data_in,Array1D<double>& w,int ntry);
//---------------------------------------------------------------------------------------
#endif // COMBIN_H