From 19d7fe49711dcddbc083f523685ae210b869fbca Mon Sep 17 00:00:00 2001 From: Bert Debusschere Date: Mon, 11 Nov 2024 15:29:47 -0800 Subject: [PATCH 01/11] updating syntax for Sundials 7.0.0+ and adding sundials core library --- cpp/app/dfi/CMakeLists.txt | 1 + cpp/app/gp_regr/CMakeLists.txt | 1 + cpp/app/lr_eval/CMakeLists.txt | 1 + cpp/app/model_inf/CMakeLists.txt | 1 + cpp/app/pce_eval/CMakeLists.txt | 1 + cpp/app/pce_quad/CMakeLists.txt | 1 + cpp/app/pce_resp/CMakeLists.txt | 1 + cpp/app/pce_rv/CMakeLists.txt | 1 + cpp/app/pce_sens/CMakeLists.txt | 1 + cpp/app/pdf_cl/CMakeLists.txt | 1 + cpp/app/regression/CMakeLists.txt | 1 + cpp/app/sens/CMakeLists.txt | 1 + cpp/lib/pce/PCSet.cpp | 15 +++++++++------ cpp/lib/pce/PCSet.h | 12 +++++++----- cpp/tests/Array1DMiscTest/CMakeLists.txt | 1 + cpp/tests/Array2DMiscTest/CMakeLists.txt | 1 + cpp/tests/ArrayDelColumn/CMakeLists.txt | 1 + cpp/tests/ArrayReadAndWrite/CMakeLists.txt | 1 + cpp/tests/ArraySortTest/CMakeLists.txt | 1 + cpp/tests/BCS1dTest/CMakeLists.txt | 1 + cpp/tests/BCS2dTest/CMakeLists.txt | 1 + cpp/tests/CorrTest/CMakeLists.txt | 1 + cpp/tests/Deriv1dTest/CMakeLists.txt | 1 + cpp/tests/GradHessianTest/CMakeLists.txt | 1 + cpp/tests/GradientPCETest/CMakeLists.txt | 1 + cpp/tests/Hessian2dTest/CMakeLists.txt | 1 + cpp/tests/MCMC2dTest/CMakeLists.txt | 1 + cpp/tests/MCMCNestedTest/CMakeLists.txt | 1 + cpp/tests/MCMCRandomTest/CMakeLists.txt | 1 + cpp/tests/MultiIndexTest/CMakeLists.txt | 1 + cpp/tests/PCE1dTest/CMakeLists.txt | 1 + cpp/tests/PCEImplTest/CMakeLists.txt | 1 + cpp/tests/PCELogTest/CMakeLists.txt | 1 + cpp/tests/QuadLUTest/CMakeLists.txt | 1 + cpp/tests/SecondDeriv1dTest/CMakeLists.txt | 1 + cpp/tests/TMCMC2dTest/CMakeLists.txt | 1 + examples/ops/CMakeLists.txt | 2 ++ examples/pce_bcs/CMakeLists.txt | 1 + examples/surf_rxn/CMakeLists.txt | 8 ++++---- 39 files changed, 57 insertions(+), 15 deletions(-) diff --git a/cpp/app/dfi/CMakeLists.txt b/cpp/app/dfi/CMakeLists.txt index cd679043..92270a53 100644 --- a/cpp/app/dfi/CMakeLists.txt +++ b/cpp/app/dfi/CMakeLists.txt @@ -12,6 +12,7 @@ target_link_libraries (dfi uqtkarray) target_link_libraries (dfi depdsfmt ) target_link_libraries (dfi deplbfgs ) +target_link_libraries (dfi sundials_core) target_link_libraries (dfi sundials_cvode) target_link_libraries (dfi sundials_nvecserial) target_link_libraries (dfi sundials_sunlinsoldense) diff --git a/cpp/app/gp_regr/CMakeLists.txt b/cpp/app/gp_regr/CMakeLists.txt index 7bc3a336..481cbe51 100644 --- a/cpp/app/gp_regr/CMakeLists.txt +++ b/cpp/app/gp_regr/CMakeLists.txt @@ -11,6 +11,7 @@ target_link_libraries (gp_regr uqtkarray) target_link_libraries (gp_regr depdsfmt ) target_link_libraries (gp_regr deplbfgs ) +target_link_libraries (gp_regr sundials_core) target_link_libraries (gp_regr sundials_cvode) target_link_libraries (gp_regr sundials_nvecserial) target_link_libraries (gp_regr sundials_sunlinsoldense) diff --git a/cpp/app/lr_eval/CMakeLists.txt b/cpp/app/lr_eval/CMakeLists.txt index e1d3090e..807e90d9 100644 --- a/cpp/app/lr_eval/CMakeLists.txt +++ b/cpp/app/lr_eval/CMakeLists.txt @@ -12,6 +12,7 @@ target_link_libraries (lr_eval uqtkarray) target_link_libraries (lr_eval depdsfmt ) target_link_libraries (lr_eval deplbfgs ) +target_link_libraries (lr_eval sundials_core) target_link_libraries (lr_eval sundials_cvode) target_link_libraries (lr_eval sundials_nvecserial) target_link_libraries (lr_eval sundials_sunlinsoldense) diff --git a/cpp/app/model_inf/CMakeLists.txt b/cpp/app/model_inf/CMakeLists.txt index a6bc37d5..edfbf765 100644 --- a/cpp/app/model_inf/CMakeLists.txt +++ b/cpp/app/model_inf/CMakeLists.txt @@ -12,6 +12,7 @@ target_link_libraries (model_inf uqtkarray) target_link_libraries (model_inf depdsfmt ) target_link_libraries (model_inf deplbfgs ) +target_link_libraries (model_inf sundials_core) target_link_libraries (model_inf sundials_cvode) target_link_libraries (model_inf sundials_nvecserial) target_link_libraries (model_inf sundials_sunlinsoldense) diff --git a/cpp/app/pce_eval/CMakeLists.txt b/cpp/app/pce_eval/CMakeLists.txt index 421d225f..c7551f62 100644 --- a/cpp/app/pce_eval/CMakeLists.txt +++ b/cpp/app/pce_eval/CMakeLists.txt @@ -8,6 +8,7 @@ target_link_libraries (pce_eval uqtktools) target_link_libraries (pce_eval uqtkarray) target_link_libraries (pce_eval depdsfmt ) +target_link_libraries (pce_eval sundials_core) target_link_libraries (pce_eval sundials_cvode) target_link_libraries (pce_eval sundials_nvecserial) target_link_libraries (pce_eval sundials_sunlinsoldense) diff --git a/cpp/app/pce_quad/CMakeLists.txt b/cpp/app/pce_quad/CMakeLists.txt index ac99b927..a9722e07 100644 --- a/cpp/app/pce_quad/CMakeLists.txt +++ b/cpp/app/pce_quad/CMakeLists.txt @@ -10,6 +10,7 @@ target_link_libraries (pce_quad uqtktools) target_link_libraries (pce_quad uqtkarray) target_link_libraries (pce_quad depdsfmt ) +target_link_libraries (pce_quad sundials_core) target_link_libraries (pce_quad sundials_cvode) target_link_libraries (pce_quad sundials_nvecserial) target_link_libraries (pce_quad sundials_sunlinsoldense) diff --git a/cpp/app/pce_resp/CMakeLists.txt b/cpp/app/pce_resp/CMakeLists.txt index 3fa0db71..c0fa9aa9 100644 --- a/cpp/app/pce_resp/CMakeLists.txt +++ b/cpp/app/pce_resp/CMakeLists.txt @@ -8,6 +8,7 @@ target_link_libraries (pce_resp uqtktools) target_link_libraries (pce_resp uqtkarray) target_link_libraries (pce_resp depdsfmt ) +target_link_libraries (pce_resp sundials_core) target_link_libraries (pce_resp sundials_cvode) target_link_libraries (pce_resp sundials_nvecserial) target_link_libraries (pce_resp sundials_sunlinsoldense) diff --git a/cpp/app/pce_rv/CMakeLists.txt b/cpp/app/pce_rv/CMakeLists.txt index fa17c2a0..5d13efda 100644 --- a/cpp/app/pce_rv/CMakeLists.txt +++ b/cpp/app/pce_rv/CMakeLists.txt @@ -8,6 +8,7 @@ target_link_libraries (pce_rv uqtktools) target_link_libraries (pce_rv uqtkarray) target_link_libraries (pce_rv depdsfmt ) +target_link_libraries (pce_rv sundials_core) target_link_libraries (pce_rv sundials_cvode) target_link_libraries (pce_rv sundials_nvecserial) target_link_libraries (pce_rv sundials_sunlinsoldense) diff --git a/cpp/app/pce_sens/CMakeLists.txt b/cpp/app/pce_sens/CMakeLists.txt index f8a68a49..d11c6336 100644 --- a/cpp/app/pce_sens/CMakeLists.txt +++ b/cpp/app/pce_sens/CMakeLists.txt @@ -8,6 +8,7 @@ target_link_libraries (pce_sens uqtktools) target_link_libraries (pce_sens uqtkarray) target_link_libraries (pce_sens depdsfmt ) +target_link_libraries (pce_sens sundials_core) target_link_libraries (pce_sens sundials_cvode) target_link_libraries (pce_sens sundials_nvecserial) target_link_libraries (pce_sens sundials_sunlinsoldense) diff --git a/cpp/app/pdf_cl/CMakeLists.txt b/cpp/app/pdf_cl/CMakeLists.txt index 2b6cc28c..80dac175 100644 --- a/cpp/app/pdf_cl/CMakeLists.txt +++ b/cpp/app/pdf_cl/CMakeLists.txt @@ -6,6 +6,7 @@ target_link_libraries (pdf_cl uqtktools) target_link_libraries (pdf_cl uqtkarray) target_link_libraries (pdf_cl depdsfmt ) +target_link_libraries (pdf_cl sundials_core) target_link_libraries (pdf_cl sundials_cvode) target_link_libraries (pdf_cl sundials_nvecserial) target_link_libraries (pdf_cl sundials_sunlinsoldense) diff --git a/cpp/app/regression/CMakeLists.txt b/cpp/app/regression/CMakeLists.txt index eddc5e62..5ae333ae 100644 --- a/cpp/app/regression/CMakeLists.txt +++ b/cpp/app/regression/CMakeLists.txt @@ -11,6 +11,7 @@ target_link_libraries (regression uqtkarray) target_link_libraries (regression depdsfmt ) target_link_libraries (regression deplbfgs ) +target_link_libraries (regression sundials_core) target_link_libraries (regression sundials_cvode) target_link_libraries (regression sundials_nvecserial) target_link_libraries (regression sundials_sunlinsoldense) diff --git a/cpp/app/sens/CMakeLists.txt b/cpp/app/sens/CMakeLists.txt index d94e488e..e4df334d 100644 --- a/cpp/app/sens/CMakeLists.txt +++ b/cpp/app/sens/CMakeLists.txt @@ -11,6 +11,7 @@ target_link_libraries (trdSpls uqtkarray) target_link_libraries (trdSpls depdsfmt ) target_link_libraries (trdSpls deplbfgs ) +target_link_libraries (trdSpls sundials_core) target_link_libraries (trdSpls sundials_cvode) target_link_libraries (trdSpls sundials_nvecserial) target_link_libraries (trdSpls sundials_sunlinsoldense) diff --git a/cpp/lib/pce/PCSet.cpp b/cpp/lib/pce/PCSet.cpp index 72139b2d..df19b1d2 100644 --- a/cpp/lib/pce/PCSet.cpp +++ b/cpp/lib/pce/PCSet.cpp @@ -2047,7 +2047,7 @@ void PCSet::LogInt(const double* p1, double* p2) const // initial condition array SUNContext sunctx; - SUNContext_Create(NULL, &sunctx); + SUNContext_Create(SUN_COMM_NULL, &sunctx); N_Vector u ; u = N_VNew_Serial( this->nPCTerms_ , sunctx) ; double p1Mean = p1[0]; @@ -2056,7 +2056,7 @@ void PCSet::LogInt(const double* p1, double* p2) const NV_Ith_S(u,k) = 0.0 ; // initialize tolerances - realtype relT ; + sunrealtype relT ; N_Vector absT ; relT = CVrelt_ ; absT = N_VNew_Serial( this->nPCTerms_ , sunctx) ; @@ -2064,7 +2064,7 @@ void PCSet::LogInt(const double* p1, double* p2) const NV_Ith_S(absT,k) = CVabst_ ; // initialize integration limits - realtype tstart,tend,tret ; + sunrealtype tstart,tend,tret ; tstart = 0.0 ; tend = 1.0 ; @@ -2120,8 +2120,11 @@ void PCSet::LogInt(const double* p1, double* p2) const this->Check_CVflag((void *)linsolve, "SUNDenseLinearSolver", 0); /* Call CVDlsSetLinearSolver to attach the matrix and linear solver to CVode */ - cvflag = CVDlsSetLinearSolver(cvode_mem, linsolve, denseMat); - this->Check_CVflag(&cvflag, "CVDlsSetLinearSolver", 1); + // cvflag = CVDlsSetLinearSolver(cvode_mem, linsolve, denseMat); // Deprecated + cvflag = CVodeSetLinearSolver(cvode_mem, linsolve, denseMat); + + // this->Check_CVflag(&cvflag, "CVDlsSetLinearSolver", 1); + this->Check_CVflag(&cvflag, "CVodeSetLinearSolver", 1); // // Set dense solver // cvflag = CVDense(cvode_mem, (this->nPCTerms_) ); @@ -2170,7 +2173,7 @@ void PCSet::LogInt(const double* p1, double* p2) const } -int PCSet::LogIntRhs(realtype t, N_Vector y, N_Vector ydot, void *f_data) const +int PCSet::LogIntRhs(sunrealtype t, N_Vector y, N_Vector ydot, void *f_data) const { // do nothing diff --git a/cpp/lib/pce/PCSet.h b/cpp/lib/pce/PCSet.h index f877cb2c..a85243dd 100644 --- a/cpp/lib/pce/PCSet.h +++ b/cpp/lib/pce/PCSet.h @@ -45,13 +45,15 @@ /* CVODE headers */ #include /* prototypes for CVODE fcts., consts. */ -#include /* access to CVDls interface */ +// #include /* access to CVDls interface */ #include /* serial N_Vector types, fcts., macros */ #include /* access to dense SUNMatrix */ #include /* access to dense SUNLinearSolver */ // #include /* prototype for CVDense */ -#include /* definitions DlsMat DENSE_ELEM */ -#include /* definition of type realtype */ +#include /* definition of type sunrealtype */ +#include /* for SUNContext_Create */ +#include /* definitions DlsMat DENSE_ELEM */ + #include #include @@ -800,7 +802,7 @@ class PCSet { /// carries an integer handle identifying the appropriate PC object /// \todo Why is this function a static int instead of static void? Should /// there be a return statement at the end? - static int LogIntRhsWrapper(realtype t, N_Vector y, N_Vector ydot, void *f_data) + static int LogIntRhsWrapper(sunrealtype t, N_Vector y, N_Vector ydot, void *f_data) { double indxobj = ((double*) f_data)[0] ; @@ -821,7 +823,7 @@ class PCSet { } /// \brief Evaluates rhs necessary to compute natural logarithm via integration - int LogIntRhs(realtype t, N_Vector y, N_Vector ydot, void *f_data) const; + int LogIntRhs(sunrealtype t, N_Vector y, N_Vector ydot, void *f_data) const; /// \brief Verbosity level /// \note Currently the values of 0, 1 or 2 are implemented. diff --git a/cpp/tests/Array1DMiscTest/CMakeLists.txt b/cpp/tests/Array1DMiscTest/CMakeLists.txt index e2733d3c..d0b8009f 100644 --- a/cpp/tests/Array1DMiscTest/CMakeLists.txt +++ b/cpp/tests/Array1DMiscTest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (Array1DMiscTest main.cpp) target_link_libraries (Array1DMiscTest uqtk ) target_link_libraries (Array1DMiscTest depdsfmt ) +target_link_libraries (Array1DMiscTest sundials_core) target_link_libraries (Array1DMiscTest sundials_cvode) target_link_libraries (Array1DMiscTest sundials_nvecserial) target_link_libraries (Array1DMiscTest sundials_sunlinsoldense) diff --git a/cpp/tests/Array2DMiscTest/CMakeLists.txt b/cpp/tests/Array2DMiscTest/CMakeLists.txt index 98902f2f..933334f8 100644 --- a/cpp/tests/Array2DMiscTest/CMakeLists.txt +++ b/cpp/tests/Array2DMiscTest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (Array2DMiscTest main.cpp) target_link_libraries (Array2DMiscTest uqtk ) target_link_libraries (Array2DMiscTest depdsfmt ) +target_link_libraries (Array2DMiscTest sundials_core) target_link_libraries (Array2DMiscTest sundials_cvode) target_link_libraries (Array2DMiscTest sundials_nvecserial) target_link_libraries (Array2DMiscTest sundials_sunlinsoldense) diff --git a/cpp/tests/ArrayDelColumn/CMakeLists.txt b/cpp/tests/ArrayDelColumn/CMakeLists.txt index 815cbc9a..24d93e98 100644 --- a/cpp/tests/ArrayDelColumn/CMakeLists.txt +++ b/cpp/tests/ArrayDelColumn/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (ArrayDelColumn main.cpp) target_link_libraries (ArrayDelColumn uqtk ) target_link_libraries (ArrayDelColumn depdsfmt ) +target_link_libraries (ArrayDelColumn sundials_core) target_link_libraries (ArrayDelColumn sundials_cvode) target_link_libraries (ArrayDelColumn sundials_nvecserial) target_link_libraries (ArrayDelColumn sundials_sunlinsoldense) diff --git a/cpp/tests/ArrayReadAndWrite/CMakeLists.txt b/cpp/tests/ArrayReadAndWrite/CMakeLists.txt index be07db4d..ad23ab0f 100644 --- a/cpp/tests/ArrayReadAndWrite/CMakeLists.txt +++ b/cpp/tests/ArrayReadAndWrite/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (ArrayReadAndWrite main.cpp) target_link_libraries (ArrayReadAndWrite uqtk ) target_link_libraries (ArrayReadAndWrite depdsfmt ) +target_link_libraries (ArrayReadAndWrite sundials_core) target_link_libraries (ArrayReadAndWrite sundials_cvode) target_link_libraries (ArrayReadAndWrite sundials_nvecserial) target_link_libraries (ArrayReadAndWrite sundials_sunlinsoldense) diff --git a/cpp/tests/ArraySortTest/CMakeLists.txt b/cpp/tests/ArraySortTest/CMakeLists.txt index feca201e..9bd39511 100644 --- a/cpp/tests/ArraySortTest/CMakeLists.txt +++ b/cpp/tests/ArraySortTest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (ArraySortTest main.cpp) target_link_libraries (ArraySortTest uqtk ) target_link_libraries (ArraySortTest depdsfmt ) +target_link_libraries (ArraySortTest sundials_core) target_link_libraries (ArraySortTest sundials_cvode) target_link_libraries (ArraySortTest sundials_nvecserial) target_link_libraries (ArraySortTest sundials_sunlinsoldense) diff --git a/cpp/tests/BCS1dTest/CMakeLists.txt b/cpp/tests/BCS1dTest/CMakeLists.txt index 7cf92d32..89ecfb50 100644 --- a/cpp/tests/BCS1dTest/CMakeLists.txt +++ b/cpp/tests/BCS1dTest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (BCS1dTest main.cpp) target_link_libraries (BCS1dTest uqtk ) target_link_libraries (BCS1dTest depdsfmt ) +target_link_libraries (BCS1dTest sundials_core) target_link_libraries (BCS1dTest sundials_cvode) target_link_libraries (BCS1dTest sundials_nvecserial) target_link_libraries (BCS1dTest sundials_sunlinsoldense) diff --git a/cpp/tests/BCS2dTest/CMakeLists.txt b/cpp/tests/BCS2dTest/CMakeLists.txt index 2ca82f53..ab8d73fa 100644 --- a/cpp/tests/BCS2dTest/CMakeLists.txt +++ b/cpp/tests/BCS2dTest/CMakeLists.txt @@ -11,6 +11,7 @@ add_executable (BCS2dTest main.cpp) target_link_libraries (BCS2dTest uqtk ) target_link_libraries (BCS2dTest depdsfmt ) +target_link_libraries (BCS2dTest sundials_core) target_link_libraries (BCS2dTest sundials_cvode) target_link_libraries (BCS2dTest sundials_nvecserial) target_link_libraries (BCS2dTest sundials_sunlinsoldense) diff --git a/cpp/tests/CorrTest/CMakeLists.txt b/cpp/tests/CorrTest/CMakeLists.txt index 8cfa1b56..d44814a7 100644 --- a/cpp/tests/CorrTest/CMakeLists.txt +++ b/cpp/tests/CorrTest/CMakeLists.txt @@ -21,6 +21,7 @@ add_executable (CorrTest main.cpp) target_link_libraries (CorrTest uqtk ) target_link_libraries (CorrTest depdsfmt ) +target_link_libraries (CorrTest sundials_core) target_link_libraries (CorrTest sundials_cvode) target_link_libraries (CorrTest sundials_nvecserial) target_link_libraries (CorrTest sundials_sunlinsoldense) diff --git a/cpp/tests/Deriv1dTest/CMakeLists.txt b/cpp/tests/Deriv1dTest/CMakeLists.txt index 4a8daaf3..34ff2811 100644 --- a/cpp/tests/Deriv1dTest/CMakeLists.txt +++ b/cpp/tests/Deriv1dTest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (Deriv1dTest main.cpp) target_link_libraries (Deriv1dTest uqtk ) target_link_libraries (Deriv1dTest depdsfmt ) +target_link_libraries (Deriv1dTest sundials_core) target_link_libraries (Deriv1dTest sundials_cvode) target_link_libraries (Deriv1dTest sundials_nvecserial) target_link_libraries (Deriv1dTest sundials_sunlinsoldense) diff --git a/cpp/tests/GradHessianTest/CMakeLists.txt b/cpp/tests/GradHessianTest/CMakeLists.txt index 09708f7f..26b9c711 100644 --- a/cpp/tests/GradHessianTest/CMakeLists.txt +++ b/cpp/tests/GradHessianTest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (GradHessianTest main.cpp) target_link_libraries (GradHessianTest uqtk ) target_link_libraries (GradHessianTest depdsfmt ) +target_link_libraries (GradHessianTest sundials_core) target_link_libraries (GradHessianTest sundials_cvode) target_link_libraries (GradHessianTest sundials_nvecserial) target_link_libraries (GradHessianTest sundials_sunlinsoldense) diff --git a/cpp/tests/GradientPCETest/CMakeLists.txt b/cpp/tests/GradientPCETest/CMakeLists.txt index 903161fc..07f82650 100644 --- a/cpp/tests/GradientPCETest/CMakeLists.txt +++ b/cpp/tests/GradientPCETest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (GradientPCETest main.cpp) target_link_libraries (GradientPCETest uqtk ) target_link_libraries (GradientPCETest depdsfmt ) +target_link_libraries (GradientPCETest sundials_core) target_link_libraries (GradientPCETest sundials_cvode) target_link_libraries (GradientPCETest sundials_nvecserial) target_link_libraries (GradientPCETest sundials_sunlinsoldense) diff --git a/cpp/tests/Hessian2dTest/CMakeLists.txt b/cpp/tests/Hessian2dTest/CMakeLists.txt index f0fae151..a31abf77 100644 --- a/cpp/tests/Hessian2dTest/CMakeLists.txt +++ b/cpp/tests/Hessian2dTest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (Hessian2dTest main.cpp) target_link_libraries (Hessian2dTest uqtk ) target_link_libraries (Hessian2dTest depdsfmt ) +target_link_libraries (Hessian2dTest sundials_core) target_link_libraries (Hessian2dTest sundials_cvode) target_link_libraries (Hessian2dTest sundials_nvecserial) target_link_libraries (Hessian2dTest sundials_sunlinsoldense) diff --git a/cpp/tests/MCMC2dTest/CMakeLists.txt b/cpp/tests/MCMC2dTest/CMakeLists.txt index 35820104..55a63625 100644 --- a/cpp/tests/MCMC2dTest/CMakeLists.txt +++ b/cpp/tests/MCMC2dTest/CMakeLists.txt @@ -26,6 +26,7 @@ add_executable (MCMC2dTest main.cpp) target_link_libraries (MCMC2dTest uqtk ) target_link_libraries (MCMC2dTest depdsfmt ) +target_link_libraries (MCMC2dTest sundials_core) target_link_libraries (MCMC2dTest sundials_cvode) target_link_libraries (MCMC2dTest sundials_nvecserial) target_link_libraries (MCMC2dTest sundials_sunlinsoldense) diff --git a/cpp/tests/MCMCNestedTest/CMakeLists.txt b/cpp/tests/MCMCNestedTest/CMakeLists.txt index c3b3503b..ba86e5f8 100644 --- a/cpp/tests/MCMCNestedTest/CMakeLists.txt +++ b/cpp/tests/MCMCNestedTest/CMakeLists.txt @@ -7,6 +7,7 @@ add_executable (MCMCNestedTest main.cpp) target_link_libraries (MCMCNestedTest uqtk ) target_link_libraries (MCMCNestedTest depdsfmt ) +target_link_libraries (MCMCNestedTest sundials_core) target_link_libraries (MCMCNestedTest sundials_cvode) target_link_libraries (MCMCNestedTest sundials_nvecserial) target_link_libraries (MCMCNestedTest sundials_sunlinsoldense) diff --git a/cpp/tests/MCMCRandomTest/CMakeLists.txt b/cpp/tests/MCMCRandomTest/CMakeLists.txt index 867b349f..9cee8d1f 100644 --- a/cpp/tests/MCMCRandomTest/CMakeLists.txt +++ b/cpp/tests/MCMCRandomTest/CMakeLists.txt @@ -7,6 +7,7 @@ add_executable (MCMCRandomTest main.cpp) target_link_libraries (MCMCRandomTest uqtk ) target_link_libraries (MCMCRandomTest depdsfmt ) +target_link_libraries (MCMCRandomTest sundials_core) target_link_libraries (MCMCRandomTest sundials_cvode) target_link_libraries (MCMCRandomTest sundials_nvecserial) target_link_libraries (MCMCRandomTest sundials_sunlinsoldense) diff --git a/cpp/tests/MultiIndexTest/CMakeLists.txt b/cpp/tests/MultiIndexTest/CMakeLists.txt index fa757de7..63cf47fa 100644 --- a/cpp/tests/MultiIndexTest/CMakeLists.txt +++ b/cpp/tests/MultiIndexTest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (MultiIndexTest main.cpp) target_link_libraries (MultiIndexTest uqtk) target_link_libraries (MultiIndexTest depdsfmt ) +target_link_libraries (MultiIndexTest sundials_core) target_link_libraries (MultiIndexTest sundials_cvode) target_link_libraries (MultiIndexTest sundials_nvecserial) target_link_libraries (MultiIndexTest sundials_sunlinsoldense) diff --git a/cpp/tests/PCE1dTest/CMakeLists.txt b/cpp/tests/PCE1dTest/CMakeLists.txt index 1c45349d..0c188b3f 100644 --- a/cpp/tests/PCE1dTest/CMakeLists.txt +++ b/cpp/tests/PCE1dTest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (PCE1dTest main.cpp) target_link_libraries (PCE1dTest uqtk ) target_link_libraries (PCE1dTest depdsfmt ) +target_link_libraries (PCE1dTest sundials_core) target_link_libraries (PCE1dTest sundials_cvode) target_link_libraries (PCE1dTest sundials_nvecserial) target_link_libraries (PCE1dTest sundials_sunlinsoldense) diff --git a/cpp/tests/PCEImplTest/CMakeLists.txt b/cpp/tests/PCEImplTest/CMakeLists.txt index 2182d26b..6d8bc1d3 100644 --- a/cpp/tests/PCEImplTest/CMakeLists.txt +++ b/cpp/tests/PCEImplTest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (PCEImplTest main.cpp) target_link_libraries (PCEImplTest uqtk ) target_link_libraries (PCEImplTest depdsfmt ) +target_link_libraries (PCEImplTest sundials_core) target_link_libraries (PCEImplTest sundials_cvode) target_link_libraries (PCEImplTest sundials_nvecserial) target_link_libraries (PCEImplTest sundials_sunlinsoldense) diff --git a/cpp/tests/PCELogTest/CMakeLists.txt b/cpp/tests/PCELogTest/CMakeLists.txt index ee0331cb..4f1ff7f0 100644 --- a/cpp/tests/PCELogTest/CMakeLists.txt +++ b/cpp/tests/PCELogTest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (PCELogTest main.cpp) target_link_libraries (PCELogTest uqtk ) target_link_libraries (PCELogTest depdsfmt ) +target_link_libraries (PCELogTest sundials_core) target_link_libraries (PCELogTest sundials_cvode) target_link_libraries (PCELogTest sundials_nvecserial) target_link_libraries (PCELogTest sundials_sunlinsoldense) diff --git a/cpp/tests/QuadLUTest/CMakeLists.txt b/cpp/tests/QuadLUTest/CMakeLists.txt index 73b5289d..1de1fdad 100644 --- a/cpp/tests/QuadLUTest/CMakeLists.txt +++ b/cpp/tests/QuadLUTest/CMakeLists.txt @@ -11,6 +11,7 @@ add_executable (QuadLUTest main.cpp) target_link_libraries (QuadLUTest uqtk ) target_link_libraries (QuadLUTest depdsfmt ) +target_link_libraries (QuadLUTest sundials_core) target_link_libraries (QuadLUTest sundials_cvode) target_link_libraries (QuadLUTest sundials_nvecserial) target_link_libraries (QuadLUTest sundials_sunlinsoldense) diff --git a/cpp/tests/SecondDeriv1dTest/CMakeLists.txt b/cpp/tests/SecondDeriv1dTest/CMakeLists.txt index 0a3eeaa5..f9aa6fd3 100644 --- a/cpp/tests/SecondDeriv1dTest/CMakeLists.txt +++ b/cpp/tests/SecondDeriv1dTest/CMakeLists.txt @@ -5,6 +5,7 @@ add_executable (SecondDeriv1dTest main.cpp) target_link_libraries (SecondDeriv1dTest uqtk ) target_link_libraries (SecondDeriv1dTest depdsfmt ) +target_link_libraries (SecondDeriv1dTest sundials_core) target_link_libraries (SecondDeriv1dTest sundials_cvode) target_link_libraries (SecondDeriv1dTest sundials_nvecserial) target_link_libraries (SecondDeriv1dTest sundials_sunlinsoldense) diff --git a/cpp/tests/TMCMC2dTest/CMakeLists.txt b/cpp/tests/TMCMC2dTest/CMakeLists.txt index a0adce19..ae4b0810 100644 --- a/cpp/tests/TMCMC2dTest/CMakeLists.txt +++ b/cpp/tests/TMCMC2dTest/CMakeLists.txt @@ -23,6 +23,7 @@ add_executable (TMCMC2dTest main.cpp) target_link_libraries (TMCMC2dTest uqtk ) target_link_libraries (TMCMC2dTest depdsfmt ) +target_link_libraries (TMCMC2dTest sundials_core) target_link_libraries (TMCMC2dTest sundials_cvode) target_link_libraries (TMCMC2dTest sundials_nvecserial) target_link_libraries (TMCMC2dTest sundials_sunlinsoldense) diff --git a/examples/ops/CMakeLists.txt b/examples/ops/CMakeLists.txt index 803c9dc2..108b5fc0 100644 --- a/examples/ops/CMakeLists.txt +++ b/examples/ops/CMakeLists.txt @@ -30,6 +30,7 @@ target_link_libraries (Ops.x uqtktools) target_link_libraries (Ops.x uqtkarray ) target_link_libraries (Ops.x depdsfmt ) +target_link_libraries (Ops.x sundials_core) target_link_libraries (Ops.x sundials_cvode) target_link_libraries (Ops.x sundials_nvecserial) target_link_libraries (Ops.x sundials_sunlinsoldense) @@ -71,6 +72,7 @@ target_link_libraries (LogComp.x uqtktools) target_link_libraries (LogComp.x uqtkarray) target_link_libraries (LogComp.x depdsfmt ) +target_link_libraries (LogComp.x sundials_core) target_link_libraries (LogComp.x sundials_cvode) target_link_libraries (LogComp.x sundials_nvecserial) target_link_libraries (LogComp.x sundials_sunlinsoldense) diff --git a/examples/pce_bcs/CMakeLists.txt b/examples/pce_bcs/CMakeLists.txt index 48681afa..2b823cc3 100644 --- a/examples/pce_bcs/CMakeLists.txt +++ b/examples/pce_bcs/CMakeLists.txt @@ -27,6 +27,7 @@ target_link_libraries (pce_bcs.x uqtkxmlutils ) target_link_libraries (pce_bcs.x depdsfmt ) target_link_libraries (pce_bcs.x deplbfgs ) +target_link_libraries (pce_bcs.x sundials_core) target_link_libraries (pce_bcs.x sundials_cvode) target_link_libraries (pce_bcs.x sundials_nvecserial) target_link_libraries (pce_bcs.x sundials_sunlinsoldense) diff --git a/examples/surf_rxn/CMakeLists.txt b/examples/surf_rxn/CMakeLists.txt index 5dd157a7..1ebefc5b 100644 --- a/examples/surf_rxn/CMakeLists.txt +++ b/examples/surf_rxn/CMakeLists.txt @@ -46,25 +46,25 @@ add_executable (SurfRxnISP.x SurfRxnISP.cpp Utils.cpp) add_executable (SurfRxnDet.x SurfRxnDet.cpp Utils.cpp) target_link_libraries (SurfRxnNISP.x uqtkpce uqtkmcmc uqtkquad uqtktools uqtkarray uqtkxmlutils uqtkss uqtkamcmc) -target_link_libraries (SurfRxnNISP.x sundials_cvode sundials_nvecserial sundials_sunlinsoldense sundials_sunmatrixdense) +target_link_libraries (SurfRxnNISP.x sundials_core sundials_cvode sundials_nvecserial sundials_sunlinsoldense sundials_sunmatrixdense) target_link_libraries (SurfRxnNISP.x depdsfmt deplbfgs depslatec depfigtree depann) target_link_libraries (SurfRxnNISP.x m lapack ${LAPACK_LIBRARIES}) target_link_libraries (SurfRxnNISP.x m blas ${BLAS_LIBRARIES}) target_link_libraries (SurfRxnNISP_MC.x uqtkpce uqtkmcmc uqtkquad uqtktools uqtkarray uqtkxmlutils uqtkss uqtkamcmc) -target_link_libraries (SurfRxnNISP_MC.x sundials_cvode sundials_nvecserial sundials_sunlinsoldense sundials_sunmatrixdense) +target_link_libraries (SurfRxnNISP_MC.x sundials_core sundials_cvode sundials_nvecserial sundials_sunlinsoldense sundials_sunmatrixdense) target_link_libraries (SurfRxnNISP_MC.x depdsfmt deplbfgs depslatec depfigtree depann) target_link_libraries (SurfRxnNISP_MC.x m lapack ${LAPACK_LIBRARIES}) target_link_libraries (SurfRxnNISP_MC.x m blas ${BLAS_LIBRARIES}) target_link_libraries (SurfRxnISP.x uqtkpce uqtkmcmc uqtkquad uqtktools uqtkarray uqtkxmlutils uqtkss uqtkamcmc) -target_link_libraries (SurfRxnISP.x sundials_cvode sundials_nvecserial sundials_sunlinsoldense sundials_sunmatrixdense) +target_link_libraries (SurfRxnISP.x sundials_core sundials_cvode sundials_nvecserial sundials_sunlinsoldense sundials_sunmatrixdense) target_link_libraries (SurfRxnISP.x depdsfmt deplbfgs depslatec depfigtree depann) target_link_libraries (SurfRxnISP.x m lapack ${LAPACK_LIBRARIES}) target_link_libraries (SurfRxnISP.x m blas ${BLAS_LIBRARIES}) target_link_libraries (SurfRxnDet.x uqtkpce uqtkmcmc uqtkquad uqtktools uqtkarray uqtkxmlutils uqtkss uqtkamcmc) -target_link_libraries (SurfRxnDet.x sundials_cvode sundials_nvecserial sundials_sunlinsoldense sundials_sunmatrixdense) +target_link_libraries (SurfRxnDet.x sundials_core sundials_cvode sundials_nvecserial sundials_sunlinsoldense sundials_sunmatrixdense) target_link_libraries (SurfRxnDet.x depdsfmt deplbfgs depslatec depfigtree depann) target_link_libraries (SurfRxnDet.x m lapack ${LAPACK_LIBRARIES}) target_link_libraries (SurfRxnDet.x m blas ${BLAS_LIBRARIES}) From 3a0629903218f321cc9086e62f985788b91aaa74 Mon Sep 17 00:00:00 2001 From: Bert Debusschere Date: Mon, 18 Nov 2024 18:12:27 -0800 Subject: [PATCH 02/11] had to add one more library from Sundials to link to so that Python tests would pass --- PyUQTk/mcmc/CMakeLists.txt | 4 ++-- PyUQTk/pce/CMakeLists.txt | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/PyUQTk/mcmc/CMakeLists.txt b/PyUQTk/mcmc/CMakeLists.txt index 4eac9832..4ff2d313 100644 --- a/PyUQTk/mcmc/CMakeLists.txt +++ b/PyUQTk/mcmc/CMakeLists.txt @@ -73,8 +73,8 @@ if(BUILD_SUNDIALS) SWIG_LINK_LIBRARIES(mcmc ${PROJECT_BINARY_DIR}/../dep/sundials/src/sunlinsol/dense/libsundials_sunlinsoldense.a) SWIG_LINK_LIBRARIES(mcmc ${PROJECT_BINARY_DIR}/../dep/sundials/src/sunmatrix/dense/libsundials_sunmatrixdense.a) else() - SWIG_LINK_LIBRARIES(mcmc ${CMAKE_SUNDIALS_DIR}/lib/libsundials_cvode.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_nvecserial.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_sunlinsoldense.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_sunmatrixdense.a) -endif() + SWIG_LINK_LIBRARIES(mcmc ${CMAKE_SUNDIALS_DIR}/lib/libsundials_core.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_cvode.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_nvecserial.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_sunlinsoldense.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_sunmatrixdense.a) + endif() INSTALL(TARGETS _mcmc DESTINATION PyUQTk/) INSTALL(FILES ${CMAKE_BINARY_DIR}/${outdir}PyUQTk/mcmc/mcmc.py DESTINATION PyUQTk) diff --git a/PyUQTk/pce/CMakeLists.txt b/PyUQTk/pce/CMakeLists.txt index dd4f7c45..0888bfe8 100644 --- a/PyUQTk/pce/CMakeLists.txt +++ b/PyUQTk/pce/CMakeLists.txt @@ -28,7 +28,7 @@ pybind11_add_module(_pce pypce.cpp) if(BUILD_SUNDIALS) TARGET_LINK_LIBRARIES(_pce PUBLIC uqtk depuqtk blas lapack gfortran ${PROJECT_BINARY_DIR}/../dep/sundials/src/cvode/libsundials_cvode.a ${PROJECT_BINARY_DIR}/../dep/sundials/src/nvector/serial/libsundials_nvecserial.a ${PROJECT_BINARY_DIR}/../dep/sundials/src/sunlinsol/dense/libsundials_sunlinsoldense.a ${PROJECT_BINARY_DIR}/../dep/sundials/src/sunmatrix/dense/libsundials_sunmatrixdense.a) else() - TARGET_LINK_LIBRARIES(_pce PUBLIC uqtk depuqtk blas lapack gfortran ${CMAKE_SUNDIALS_DIR}/lib/libsundials_cvode.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_nvecserial.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_sunlinsoldense.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_sunmatrixdense.a) + TARGET_LINK_LIBRARIES(_pce PUBLIC uqtk depuqtk blas lapack gfortran ${CMAKE_SUNDIALS_DIR}/lib/libsundials_core.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_nvecserial.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_cvode.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_sunlinsoldense.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_sunmatrixdense.a) endif() #SET(copy_FILES From f30b3b6c19cddfda2f85f44654c246e5869edf50 Mon Sep 17 00:00:00 2001 From: "Pieterjan Magda M Robbe (-EXP)" Date: Tue, 19 Nov 2024 10:09:39 -0800 Subject: [PATCH 03/11] Updated some cmake files in PyUQTk --- PyUQTk/numpy.cmake | 41 +++++++++++++------------------ PyUQTk/pyuqtkarray/CMakeLists.txt | 41 ++++++++++++++++++------------- 2 files changed, 41 insertions(+), 41 deletions(-) diff --git a/PyUQTk/numpy.cmake b/PyUQTk/numpy.cmake index 46f34a65..a996e686 100644 --- a/PyUQTk/numpy.cmake +++ b/PyUQTk/numpy.cmake @@ -1,27 +1,20 @@ -IF (NUMPY_INCLUDE_DIR) - SET(NUMPY_FIND_QUIETLY TRUE) -endif (NUMPY_INCLUDE_DIR) +# Use modern Python detection (requires CMake 3.12+) +find_package(Python3 COMPONENTS Interpreter Development NumPy REQUIRED) -# To set the variables PYTHON_EXECUTABLE -FIND_PACKAGE(PythonInterp QUIET REQUIRED) -FIND_PACKAGE(PythonLibs QUIET REQUIRED) +# Check if NumPy was found +if (Python3_NumPy_FOUND) + # Extract NumPy include directory and version + set(NUMPY_INCLUDE_DIR ${Python3_NumPy_INCLUDE_DIRS}) + set(NUMPY_VERSION ${Python3_NumPy_VERSION}) -# Look for the include path -# WARNING: The variable PYTHON_EXECUTABLE is defined by the script FindPythonInterp.cmake -EXECUTE_PROCESS(COMMAND "${PYTHON_EXECUTABLE}" -c "import numpy; print (numpy.get_include()); print (numpy.version.version)" - OUTPUT_VARIABLE NUMPY_OUTPUT - ERROR_VARIABLE NUMPY_ERROR) - -IF(NOT NUMPY_ERROR) - STRING(REPLACE "\n" ";" NUMPY_OUTPUT ${NUMPY_OUTPUT}) - LIST(GET NUMPY_OUTPUT 0 NUMPY_INCLUDE_DIR) - LIST(GET NUMPY_OUTPUT 1 NUMPY_VERSION) -ENDIF(NOT NUMPY_ERROR) + # Debugging output + message(STATUS "Found NumPy:") + message(STATUS " Include Directory: ${NUMPY_INCLUDE_DIR}") + message(STATUS " Version: ${NUMPY_VERSION}") +else() + # Handle error if NumPy is not found + message(FATAL_ERROR "NumPy not found. Please ensure NumPy is installed in your Python3 environment.") +endif() -INCLUDE(FindPackageHandleStandardArgs) - -FIND_PACKAGE_HANDLE_STANDARD_ARGS(NumPy DEFAULT_MSG NUMPY_VERSION NUMPY_INCLUDE_DIR) - -MARK_AS_ADVANCED(NUMPY_INCLUDE_DIR) - -INCLUDE_DIRECTORIES(${NUMPY_INCLUDE_DIR}) +# Include NumPy headers +include_directories(${NUMPY_INCLUDE_DIR}) \ No newline at end of file diff --git a/PyUQTk/pyuqtkarray/CMakeLists.txt b/PyUQTk/pyuqtkarray/CMakeLists.txt index 7bbcf185..9c8eff6d 100644 --- a/PyUQTk/pyuqtkarray/CMakeLists.txt +++ b/PyUQTk/pyuqtkarray/CMakeLists.txt @@ -1,27 +1,34 @@ -# Using Pybind to build the python module +# Enable support for modern IN_LIST operator +if (POLICY CMP0057) + cmake_policy(SET CMP0057 NEW) +endif() +# Using Pybind to build the Python module find_package(pybind11 REQUIRED) -include_directories(../../cpp/lib/array) #array directory -include_directories(../../cpp/lib/include) # include directory +# Include directories for UQTk headers +include_directories(../../cpp/lib/array) # Array directory +include_directories(../../cpp/lib/include) # Include directory + +# Add the Pybind11 module pybind11_add_module(_uqtkarray pyuqtkarray.cpp) -TARGET_LINK_LIBRARIES(_uqtkarray PUBLIC uqtk blas lapack) -#SET(copy_FILES -# __init__.py -# ) +# Link required libraries +target_link_libraries(_uqtkarray PUBLIC uqtk blas lapack) -SET(copy_FILES +# Files to be copied +set(copy_FILES pyuqtkarray_tools.py - ) - -INSTALL(FILES ${copy_FILES} DESTINATION PyUQTk/) +) -configure_file(${CMAKE_CURRENT_SOURCE_DIR}/pyuqtkarray_tools.py - ${CMAKE_CURRENT_BINARY_DIR}/pyuqtkarray_tools.py COPYONLY) +# Install Python files +install(FILES ${copy_FILES} DESTINATION PyUQTk/) -#INSTALL(FILES ${copy_FILES} DESTINATION PyUQTk/pyuqtkarray) +# Ensure Python tools script is available in the build directory +configure_file( + ${CMAKE_CURRENT_SOURCE_DIR}/pyuqtkarray_tools.py + ${CMAKE_CURRENT_BINARY_DIR}/pyuqtkarray_tools.py COPYONLY +) -INSTALL(TARGETS _uqtkarray DESTINATION PyUQTk/) -#INSTALL(FILES ${CMAKE_BINARY_DIR}/${outdir}PyUQTk/pyuqtkarray/_uqtkarray -# DESTINATION PyUQTk/) +# Install the compiled Python module (_uqtkarray) +install(TARGETS _uqtkarray DESTINATION PyUQTk/) \ No newline at end of file From e0b42bbd8420d6efe86398018e53aef074e47d10 Mon Sep 17 00:00:00 2001 From: Bert Debusschere Date: Fri, 22 Nov 2024 14:26:54 -0800 Subject: [PATCH 04/11] updating sundials to latest version --- .gitmodules | 2 +- dep/sundials | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/.gitmodules b/.gitmodules index 83c3c0dc..80a27f08 100644 --- a/.gitmodules +++ b/.gitmodules @@ -1,3 +1,3 @@ [submodule "dep/sundials"] path = dep/sundials - url = https://github.com/LLNL/sundials.git \ No newline at end of file + url = https://github.com/LLNL/sundials.git diff --git a/dep/sundials b/dep/sundials index 7c318244..1a5e4110 160000 --- a/dep/sundials +++ b/dep/sundials @@ -1 +1 @@ -Subproject commit 7c318244182061ea482b449bdb5a14d4d3c71e57 +Subproject commit 1a5e4110b2b19f7b0e35933343ad83405908fa67 From 38e624e2af4e7738b1c213bd7a485d54aa80b705 Mon Sep 17 00:00:00 2001 From: Bert Debusschere Date: Fri, 22 Nov 2024 15:01:21 -0800 Subject: [PATCH 05/11] updated git to latest version (hopefully) --- dep/sundials | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/dep/sundials b/dep/sundials index 1a5e4110..c28eaa37 160000 --- a/dep/sundials +++ b/dep/sundials @@ -1 +1 @@ -Subproject commit 1a5e4110b2b19f7b0e35933343ad83405908fa67 +Subproject commit c28eaa3764a03705d61decb6025b409360e9d53f From c3cbff07dc159492adafd790d86b086e46c9a8c1 Mon Sep 17 00:00:00 2001 From: Bert Debusschere Date: Fri, 22 Nov 2024 15:33:32 -0800 Subject: [PATCH 06/11] updates to make sundials 7.1.1. work as a submodule --- PyUQTk/pce/CMakeLists.txt | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/PyUQTk/pce/CMakeLists.txt b/PyUQTk/pce/CMakeLists.txt index 0888bfe8..a18a9149 100644 --- a/PyUQTk/pce/CMakeLists.txt +++ b/PyUQTk/pce/CMakeLists.txt @@ -26,7 +26,7 @@ pybind11_add_module(_pce pypce.cpp) if(BUILD_SUNDIALS) - TARGET_LINK_LIBRARIES(_pce PUBLIC uqtk depuqtk blas lapack gfortran ${PROJECT_BINARY_DIR}/../dep/sundials/src/cvode/libsundials_cvode.a ${PROJECT_BINARY_DIR}/../dep/sundials/src/nvector/serial/libsundials_nvecserial.a ${PROJECT_BINARY_DIR}/../dep/sundials/src/sunlinsol/dense/libsundials_sunlinsoldense.a ${PROJECT_BINARY_DIR}/../dep/sundials/src/sunmatrix/dense/libsundials_sunmatrixdense.a) + TARGET_LINK_LIBRARIES(_pce PUBLIC uqtk depuqtk blas lapack gfortran ${PROJECT_BINARY_DIR}/../dep/sundials/src/sundials/libsundials_core.a ${PROJECT_BINARY_DIR}/../dep/sundials/src/cvode/libsundials_cvode.a ${PROJECT_BINARY_DIR}/../dep/sundials/src/nvector/serial/libsundials_nvecserial.a ${PROJECT_BINARY_DIR}/../dep/sundials/src/sunlinsol/dense/libsundials_sunlinsoldense.a ${PROJECT_BINARY_DIR}/../dep/sundials/src/sunmatrix/dense/libsundials_sunmatrixdense.a) else() TARGET_LINK_LIBRARIES(_pce PUBLIC uqtk depuqtk blas lapack gfortran ${CMAKE_SUNDIALS_DIR}/lib/libsundials_core.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_nvecserial.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_cvode.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_sunlinsoldense.a ${CMAKE_SUNDIALS_DIR}/lib/libsundials_sunmatrixdense.a) endif() From 13a55945bc3c3d95790a03b398f2a995f6150609 Mon Sep 17 00:00:00 2001 From: Bert Debusschere Date: Fri, 22 Nov 2024 20:32:01 -0800 Subject: [PATCH 07/11] updating CMakeLists.txt in various folders for new CMAKE compatibility --- CMakeLists.txt | 2 +- PyUQTk/CMakeLists.txt | 5 +++++ PyUQTk/kle/CMakeLists.txt | 1 - PyUQTk/pce/CMakeLists.txt | 1 - PyUQTk/pyuqtkarray/CMakeLists.txt | 5 ----- PyUQTk/quad/CMakeLists.txt | 5 +++++ PyUQTk/tools/CMakeLists.txt | 1 - cpp/lib/kle/CMakeLists.txt | 1 - dep/sundials | 2 +- 9 files changed, 12 insertions(+), 11 deletions(-) diff --git a/CMakeLists.txt b/CMakeLists.txt index f9be61e7..7419ad67 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -1,4 +1,4 @@ -cmake_minimum_required (VERSION 3.1) +cmake_minimum_required (VERSION 3.12) set (CMAKE_CXX_STANDARD 14) project (UQTk) diff --git a/PyUQTk/CMakeLists.txt b/PyUQTk/CMakeLists.txt index 58262806..87978b0d 100644 --- a/PyUQTk/CMakeLists.txt +++ b/PyUQTk/CMakeLists.txt @@ -1,5 +1,10 @@ project (UQTk) +# Enable support for modern IN_LIST operator +if (POLICY CMP0057) + cmake_policy(SET CMP0057 NEW) +endif() + add_subdirectory (inference) add_subdirectory (plotting) add_subdirectory (sens) diff --git a/PyUQTk/kle/CMakeLists.txt b/PyUQTk/kle/CMakeLists.txt index 89f3dbb5..94dda72e 100644 --- a/PyUQTk/kle/CMakeLists.txt +++ b/PyUQTk/kle/CMakeLists.txt @@ -1,5 +1,4 @@ # Using Pybind to build the python module - find_package(pybind11 REQUIRED) include_directories(../../cpp/lib/array) #array directory diff --git a/PyUQTk/pce/CMakeLists.txt b/PyUQTk/pce/CMakeLists.txt index dd4f7c45..ed4036c9 100644 --- a/PyUQTk/pce/CMakeLists.txt +++ b/PyUQTk/pce/CMakeLists.txt @@ -1,5 +1,4 @@ # Using Pybind to build the python module for PCE - find_package(pybind11 REQUIRED) #include source files diff --git a/PyUQTk/pyuqtkarray/CMakeLists.txt b/PyUQTk/pyuqtkarray/CMakeLists.txt index 9c8eff6d..e656e52d 100644 --- a/PyUQTk/pyuqtkarray/CMakeLists.txt +++ b/PyUQTk/pyuqtkarray/CMakeLists.txt @@ -1,8 +1,3 @@ -# Enable support for modern IN_LIST operator -if (POLICY CMP0057) - cmake_policy(SET CMP0057 NEW) -endif() - # Using Pybind to build the Python module find_package(pybind11 REQUIRED) diff --git a/PyUQTk/quad/CMakeLists.txt b/PyUQTk/quad/CMakeLists.txt index c16dfff3..b7820d92 100644 --- a/PyUQTk/quad/CMakeLists.txt +++ b/PyUQTk/quad/CMakeLists.txt @@ -1,3 +1,8 @@ +# Enable support for modern IN_LIST operator +if (POLICY CMP0057) + cmake_policy(SET CMP0057 NEW) +endif() + # Using Pybind to build the python module find_package(pybind11 REQUIRED) diff --git a/PyUQTk/tools/CMakeLists.txt b/PyUQTk/tools/CMakeLists.txt index 1daa1221..d7622597 100644 --- a/PyUQTk/tools/CMakeLists.txt +++ b/PyUQTk/tools/CMakeLists.txt @@ -1,5 +1,4 @@ # Using Pybind to build the python module - find_package(pybind11 REQUIRED) include_directories(../../cpp/lib/array) #array directory diff --git a/cpp/lib/kle/CMakeLists.txt b/cpp/lib/kle/CMakeLists.txt index 01c65404..d8c8272b 100644 --- a/cpp/lib/kle/CMakeLists.txt +++ b/cpp/lib/kle/CMakeLists.txt @@ -1,4 +1,3 @@ - SET(kle_HEADERS kle.h ) diff --git a/dep/sundials b/dep/sundials index 7c318244..c28eaa37 160000 --- a/dep/sundials +++ b/dep/sundials @@ -1 +1 @@ -Subproject commit 7c318244182061ea482b449bdb5a14d4d3c71e57 +Subproject commit c28eaa3764a03705d61decb6025b409360e9d53f From 551f5a438a3fe833916a779c3aacbc2c25b971b5 Mon Sep 17 00:00:00 2001 From: Bert Debusschere Date: Fri, 22 Nov 2024 20:38:44 -0800 Subject: [PATCH 08/11] one more extra policy command removed --- PyUQTk/quad/CMakeLists.txt | 6 ------ 1 file changed, 6 deletions(-) diff --git a/PyUQTk/quad/CMakeLists.txt b/PyUQTk/quad/CMakeLists.txt index b7820d92..4a57a866 100644 --- a/PyUQTk/quad/CMakeLists.txt +++ b/PyUQTk/quad/CMakeLists.txt @@ -1,10 +1,4 @@ -# Enable support for modern IN_LIST operator -if (POLICY CMP0057) - cmake_policy(SET CMP0057 NEW) -endif() - # Using Pybind to build the python module - find_package(pybind11 REQUIRED) include_directories(../../cpp/lib/quad) #quad directory From 7b0fb395ebcb6a52e668a1bf153c426b7ba90935 Mon Sep 17 00:00:00 2001 From: Bert Debusschere Date: Fri, 22 Nov 2024 20:57:08 -0800 Subject: [PATCH 09/11] fixing umbridge pthread link issue --- examples/tmcmc_umbridge/CMakeLists.txt | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/examples/tmcmc_umbridge/CMakeLists.txt b/examples/tmcmc_umbridge/CMakeLists.txt index ce62b01a..3d22b119 100644 --- a/examples/tmcmc_umbridge/CMakeLists.txt +++ b/examples/tmcmc_umbridge/CMakeLists.txt @@ -13,8 +13,9 @@ SET(copy_FILES link_directories(${CMAKE_SUNDIALS_DIR}/lib) add_executable (umbridge_model.x umbridge_model.cpp) -add_executable (tmcmc_umbridge.x tmcmc_umbridge.cpp) +target_link_libraries (umbridge_model.x pthread) +add_executable (tmcmc_umbridge.x tmcmc_umbridge.cpp) target_link_libraries (tmcmc_umbridge.x uqtk ) target_link_libraries (tmcmc_umbridge.x depdsfmt ) target_link_libraries (tmcmc_umbridge.x depslatec) From 655cfca2bc96ee4a07cc3b53fca214a90fc148d4 Mon Sep 17 00:00:00 2001 From: Bert Debusschere Date: Fri, 22 Nov 2024 21:34:53 -0800 Subject: [PATCH 10/11] updated version numbers and added Doxygen files --- PyUQTk/PyPCE/__init__.py | 6 +- PyUQTk/PyPCE/adaptation_tools.py | 6 +- PyUQTk/PyPCE/pce_tools.py | 6 +- PyUQTk/__init__.py | 6 +- PyUQTk/bcs/PyBCS.cpp | 6 +- PyUQTk/inference/__init__.py | 6 +- PyUQTk/inference/bayes_evid.py | 6 +- PyUQTk/inference/evidence_solvers.py | 6 +- PyUQTk/inference/mcmc.py | 6 +- PyUQTk/inference/postproc.py | 6 +- PyUQTk/kle/PyKle.cpp | 6 +- PyUQTk/mcmc/mcmc.i | 6 +- PyUQTk/multirun/__init__.py | 6 +- PyUQTk/multirun/multirun.py | 6 +- PyUQTk/multirun/srun.x | 6 +- PyUQTk/numpy/numpy.i | 6 +- PyUQTk/plotting/__init__.py | 6 +- PyUQTk/plotting/fits.py | 6 +- PyUQTk/plotting/inout.py | 6 +- PyUQTk/plotting/pdfs.py | 6 +- PyUQTk/plotting/surrogate.py | 6 +- PyUQTk/pytests/PyArrayTest.py | 6 +- PyUQTk/pytests/PyArrayTest2.py | 6 +- PyUQTk/pytests/PyBADPTest.py | 6 +- PyUQTk/pytests/PyBCSTest.py | 6 +- PyUQTk/pytests/PyBCSTest1D.py | 6 +- PyUQTk/pytests/PyBCSTest2D.py | 6 +- PyUQTk/pytests/PyGalerkinTest.py | 6 +- PyUQTk/pytests/PyHMCMCTest.py | 6 +- PyUQTk/pytests/PyMCMC2dTest.py | 6 +- PyUQTk/pytests/PyMCMCTest.py | 6 +- PyUQTk/pytests/PyModTest.py | 6 +- PyUQTk/pytests/PyPCE1dTest.py | 6 +- PyUQTk/pytests/PyPCE2dTest.py | 6 +- PyUQTk/pytests/PyQuadTest.py | 6 +- PyUQTk/pytests/PyRegressionTest.py | 6 +- PyUQTk/pyuqtkarray/pyuqtkarray_tools.py | 6 +- PyUQTk/sens/__init__.py | 6 +- PyUQTk/sens/gsalib.py | 6 +- PyUQTk/sens/gsatest.py | 6 +- PyUQTk/tmcmc/tmcmc.i | 6 +- PyUQTk/tools/pyTools.cpp | 6 +- PyUQTk/utils/__init__.py | 6 +- PyUQTk/utils/colors.py | 6 +- PyUQTk/utils/correlations.py | 6 +- PyUQTk/utils/crps.py | 6 +- PyUQTk/utils/func.py | 6 +- PyUQTk/utils/mindex_order.py | 6 +- PyUQTk/utils/multiindex.py | 6 +- PyUQTk/utils/pdf_kde.py | 6 +- PyUQTk/utils/regr.py | 6 +- README.md | 4 +- config/config-gcc-Python.sh | 8 +- config/config-gcc-base.sh | 8 +- config/config-intel.sh | 6 +- config/config-options.sh | 6 +- cpp/app/dfi/dfi.cpp | 6 +- cpp/app/dfi/likelihood.cpp | 6 +- cpp/app/dfi/likelihood.h | 6 +- cpp/app/dfi/model.cpp | 6 +- cpp/app/dfi/model.h | 6 +- cpp/app/dfi/utils.cpp | 6 +- cpp/app/dfi/utils.h | 6 +- cpp/app/gen_mi/gen_mi.cpp | 6 +- cpp/app/generate_quad/generate_quad.cpp | 6 +- cpp/app/gkpSparse/gkpSparse.cpp | 6 +- cpp/app/gkpSparse/gkpclib.cpp | 6 +- cpp/app/gkpSparse/gkpflib.f | 6 +- cpp/app/gkpSparse/gkplib.h | 6 +- cpp/app/gp_regr/gp_regr.cpp | 6 +- cpp/app/lr_eval/lr_eval.cpp | 6 +- cpp/app/lr_regr/lr_regr.cpp | 6 +- cpp/app/model_inf/model_inf.cpp | 6 +- cpp/app/pce_eval/pce_eval.cpp | 6 +- cpp/app/pce_quad/pce_quad.cpp | 6 +- cpp/app/pce_resp/pce_resp.cpp | 6 +- cpp/app/pce_rv/pce_rv.cpp | 6 +- cpp/app/pce_sens/pce_sens.cpp | 6 +- cpp/app/pdf_cl/pdf_cl.cpp | 6 +- cpp/app/regression/regression.cpp | 6 +- cpp/app/sens/sens.cpp | 6 +- cpp/app/sens/trdSpls.cpp | 6 +- cpp/lib/amcmc/amcmc.cpp | 6 +- cpp/lib/amcmc/amcmc.h | 6 +- cpp/lib/array/Array1D.h | 6 +- cpp/lib/array/Array2D.h | 6 +- cpp/lib/array/Array3D.h | 6 +- cpp/lib/array/arrayio.cpp | 6 +- cpp/lib/array/arrayio.h | 6 +- cpp/lib/array/arraytools.cpp | 6 +- cpp/lib/array/arraytools.h | 6 +- cpp/lib/bcs/bcs.cpp | 6 +- cpp/lib/bcs/bcs.h | 6 +- cpp/lib/dfi/dfi.cpp | 6 +- cpp/lib/dfi/dfi.h | 6 +- cpp/lib/dfi/userFunctions.h | 6 +- cpp/lib/gproc/gproc.cpp | 6 +- cpp/lib/gproc/gproc.h | 6 +- cpp/lib/include/depblas.h | 6 +- cpp/lib/include/deplapack.h | 6 +- cpp/lib/include/error_handlers.h | 6 +- cpp/lib/include/ftndefs.h | 6 +- cpp/lib/include/gen_defs.h | 6 +- cpp/lib/include/uqtkconfig.h | 6 +- cpp/lib/infer/inference.cpp | 6 +- cpp/lib/infer/inference.h | 6 +- cpp/lib/infer/mrv.cpp | 6 +- cpp/lib/infer/mrv.h | 6 +- cpp/lib/infer/post.cpp | 6 +- cpp/lib/infer/post.h | 6 +- cpp/lib/kle/kle.cpp | 6 +- cpp/lib/kle/kle.h | 6 +- cpp/lib/lowrank/lowrank.cpp | 6 +- cpp/lib/lowrank/lowrank.h | 6 +- cpp/lib/lreg/lreg.cpp | 6 +- cpp/lib/lreg/lreg.h | 6 +- cpp/lib/mala/mala.cpp | 6 +- cpp/lib/mala/mala.h | 6 +- cpp/lib/mcmc/mcmc.cpp | 6 +- cpp/lib/mcmc/mcmc.h | 6 +- cpp/lib/mmala/mmala.cpp | 6 +- cpp/lib/mmala/mmala.h | 6 +- cpp/lib/pce/PCBasis.cpp | 6 +- cpp/lib/pce/PCBasis.h | 6 +- cpp/lib/pce/PCSet.cpp | 6 +- cpp/lib/pce/PCSet.h | 6 +- cpp/lib/quad/quad.cpp | 6 +- cpp/lib/quad/quad.h | 6 +- cpp/lib/sampling/lhs.cpp | 6 +- cpp/lib/sampling/qmc.cpp | 6 +- cpp/lib/sampling/sampling.hpp | 6 +- cpp/lib/ss/ss.cpp | 6 +- cpp/lib/ss/ss.h | 6 +- cpp/lib/tmcmc/tmcmc.cpp | 6 +- cpp/lib/tmcmc/tmcmc.h | 6 +- cpp/lib/tools/combin.cpp | 6 +- cpp/lib/tools/combin.h | 6 +- cpp/lib/tools/func.cpp | 6 +- cpp/lib/tools/func.h | 6 +- cpp/lib/tools/gq.cpp | 6 +- cpp/lib/tools/gq.h | 6 +- cpp/lib/tools/minmax.cpp | 6 +- cpp/lib/tools/minmax.h | 6 +- cpp/lib/tools/multiindex.cpp | 6 +- cpp/lib/tools/multiindex.h | 6 +- cpp/lib/tools/pcmaps.cpp | 6 +- cpp/lib/tools/pcmaps.h | 6 +- cpp/lib/tools/probability.cpp | 6 +- cpp/lib/tools/probability.h | 6 +- cpp/lib/tools/rosenblatt.cpp | 6 +- cpp/lib/tools/rosenblatt.h | 6 +- cpp/lib/tools/tools.h | 6 +- cpp/lib/tools/toolsf.f | 6 +- cpp/lib/xmlutils/MyException.h | 6 +- cpp/lib/xmlutils/Object.h | 6 +- cpp/lib/xmlutils/RefPtr.h | 6 +- cpp/lib/xmlutils/XMLAttributeList.cpp | 6 +- cpp/lib/xmlutils/XMLAttributeList.h | 6 +- cpp/lib/xmlutils/XMLElement.cpp | 6 +- cpp/lib/xmlutils/XMLElement.h | 6 +- cpp/lib/xmlutils/XMLExpatParser.cpp | 6 +- cpp/lib/xmlutils/XMLExpatParser.h | 6 +- cpp/lib/xmlutils/XMLParser.cpp | 6 +- cpp/lib/xmlutils/XMLParser.h | 6 +- cpp/lib/xmlutils/XMLUtils.cpp | 6 +- cpp/lib/xmlutils/XMLUtils.h | 6 +- cpp/tests/Array1DMiscTest/main.cpp | 6 +- cpp/tests/Array2DMiscTest/main.cpp | 6 +- cpp/tests/ArrayDelColumn/main.cpp | 6 +- cpp/tests/ArrayReadAndWrite/main.cpp | 6 +- cpp/tests/ArraySortTest/main.cpp | 6 +- cpp/tests/BCS1dTest/main.cpp | 6 +- cpp/tests/BCS2dTest/main.cpp | 6 +- cpp/tests/CorrTest/main.cpp | 6 +- cpp/tests/Deriv1dTest/main.cpp | 6 +- cpp/tests/GradHessianTest/main.cpp | 6 +- cpp/tests/GradientPCETest/main.cpp | 6 +- cpp/tests/Hessian2dTest/main.cpp | 6 +- cpp/tests/LowRankRegrTest/main.cpp | 6 +- cpp/tests/MCMC2dTest/main.cpp | 6 +- cpp/tests/MCMC2dTest/model.cpp | 6 +- cpp/tests/MCMC2dTest/tmcmc_getLL.sh | 6 +- cpp/tests/MCMC2dTest/tmcmc_getLP.sh | 6 +- .../MCMC2dTest/tmcmc_moveIntermediateFiles.sh | 6 +- cpp/tests/MCMCNestedTest/main.cpp | 6 +- cpp/tests/MCMCRandomTest/main.cpp | 6 +- cpp/tests/MultiIndexTest/main.cpp | 6 +- cpp/tests/PCE1dTest/main.cpp | 6 +- cpp/tests/PCEImplTest/main.cpp | 6 +- cpp/tests/PCELogTest/main.cpp | 6 +- cpp/tests/QuadLUTest/main.cpp | 6 +- cpp/tests/SecondDeriv1dTest/main.cpp | 6 +- cpp/tests/TMCMC2dTest/main.cpp | 6 +- cpp/tests/TMCMC2dTest/model.cpp | 6 +- cpp/tests/TMCMC2dTest/tmcmc_getLL.sh | 6 +- cpp/tests/TMCMC2dTest/tmcmc_getLP.sh | 6 +- .../tmcmc_moveIntermediateFiles.sh | 6 +- doc/doxy/UQTkCppDoxyConfig | 2 +- docs/html/Array1D_8h.html | 99 + docs/html/Array1D_8h_source.html | 965 +++ docs/html/Array2D_8h.html | 95 + docs/html/Array2D_8h_source.html | 562 ++ docs/html/Array3D_8h.html | 92 + docs/html/Array3D_8h_source.html | 273 + docs/html/DoxyMain_8dox.html | 66 + docs/html/MyException_8h.html | 83 + docs/html/MyException_8h_source.html | 151 + docs/html/Object_8h.html | 81 + docs/html/Object_8h_source.html | 154 + docs/html/PCBasis_8cpp.html | 88 + docs/html/PCBasis_8h.html | 93 + docs/html/PCBasis_8h_source.html | 256 + docs/html/PCSet_8cpp.html | 108 + docs/html/PCSet_8h.html | 131 + docs/html/PCSet_8h_source.html | 702 +++ docs/html/RefPtr_8h.html | 84 + docs/html/RefPtr_8h_source.html | 327 + docs/html/XMLAttributeList_8cpp.html | 190 + docs/html/XMLAttributeList_8h.html | 82 + docs/html/XMLAttributeList_8h_source.html | 204 + docs/html/XMLElement_8cpp.html | 73 + docs/html/XMLElement_8h.html | 84 + docs/html/XMLElement_8h_source.html | 198 + docs/html/XMLExpatParser_8cpp.html | 108 + docs/html/XMLExpatParser_8h.html | 84 + docs/html/XMLExpatParser_8h_source.html | 170 + docs/html/XMLParser_8cpp.html | 71 + docs/html/XMLParser_8h.html | 82 + docs/html/XMLParser_8h_source.html | 127 + docs/html/XMLUtils_8cpp.html | 109 + docs/html/XMLUtils_8h.html | 112 + docs/html/XMLUtils_8h_source.html | 104 + docs/html/_formulas.aux | 2 + docs/html/_formulas.dvi | Bin 0 -> 19788 bytes docs/html/_formulas.log | 157 + docs/html/_formulas.tex | 316 + docs/html/_formulas_dark.aux | 2 + docs/html/_formulas_dark.dvi | Bin 0 -> 19824 bytes docs/html/_formulas_dark.log | 157 + docs/html/_formulas_dark.tex | 318 + docs/html/annotated.html | 114 + docs/html/arrayio_8cpp.html | 1021 ++++ docs/html/arrayio_8h.html | 452 ++ docs/html/arrayio_8h_source.html | 150 + docs/html/arraytools_8cpp.html | 4094 +++++++++++++ docs/html/arraytools_8h.html | 3083 ++++++++++ docs/html/arraytools_8h_source.html | 372 ++ docs/html/bc_s.png | Bin 0 -> 676 bytes docs/html/bc_sd.png | Bin 0 -> 635 bytes docs/html/bcs_8cpp.html | 280 + docs/html/bcs_8h.html | 315 + docs/html/bcs_8h_source.html | 142 + docs/html/citelist.html | 71 + docs/html/classArray1D-members.html | 103 + docs/html/classArray1D.html | 1149 ++++ .../classArray1D_3_01double_01_4-members.html | 105 + docs/html/classArray1D_3_01double_01_4.html | 1141 ++++ .../classArray1D_3_01int_01_4-members.html | 105 + docs/html/classArray1D_3_01int_01_4.html | 1141 ++++ docs/html/classArray2D-members.html | 113 + docs/html/classArray2D.html | 1471 +++++ docs/html/classArray3D-members.html | 93 + docs/html/classArray3D.html | 928 +++ docs/html/classDFI-members.html | 99 + docs/html/classDFI.html | 793 +++ docs/html/classDFIsurr-members.html | 78 + docs/html/classDFIsurr.html | 236 + docs/html/classGproc-members.html | 126 + docs/html/classGproc.html | 1652 +++++ docs/html/classKLDecompUni-members.html | 101 + docs/html/classKLDecompUni.html | 966 +++ docs/html/classLik__ABC-members.html | 118 + docs/html/classLik__ABC.html | 355 ++ docs/html/classLik__ABC.png | Bin 0 -> 358 bytes docs/html/classLik__ABCm-members.html | 118 + docs/html/classLik__ABCm.html | 355 ++ docs/html/classLik__ABCm.png | Bin 0 -> 401 bytes docs/html/classLik__Classical-members.html | 117 + docs/html/classLik__Classical.html | 323 + docs/html/classLik__Classical.png | Bin 0 -> 405 bytes docs/html/classLik__Eov-members.html | 117 + docs/html/classLik__Eov.html | 324 + docs/html/classLik__Eov.png | Bin 0 -> 356 bytes docs/html/classLik__Full-members.html | 119 + docs/html/classLik__Full.html | 386 ++ docs/html/classLik__Full.png | Bin 0 -> 344 bytes docs/html/classLik__GausMarg-members.html | 117 + docs/html/classLik__GausMarg.html | 323 + docs/html/classLik__GausMarg.png | Bin 0 -> 462 bytes docs/html/classLik__GausMargD-members.html | 117 + docs/html/classLik__GausMargD.html | 322 + docs/html/classLik__GausMargD.png | Bin 0 -> 478 bytes docs/html/classLik__Koh-members.html | 118 + docs/html/classLik__Koh.html | 352 ++ docs/html/classLik__Koh.png | Bin 0 -> 362 bytes docs/html/classLik__MVN-members.html | 118 + docs/html/classLik__MVN.html | 355 ++ docs/html/classLik__MVN.png | Bin 0 -> 355 bytes docs/html/classLik__Marg-members.html | 119 + docs/html/classLik__Marg.html | 386 ++ docs/html/classLik__Marg.png | Bin 0 -> 382 bytes docs/html/classLogPosteriorBase-members.html | 71 + docs/html/classLogPosteriorBase.html | 134 + docs/html/classLreg-members.html | 121 + docs/html/classLreg.html | 1535 +++++ docs/html/classLreg.png | Bin 0 -> 620 bytes docs/html/classMCMC-members.html | 173 + docs/html/classMCMC.html | 2593 ++++++++ docs/html/classMrv-members.html | 93 + docs/html/classMrv.html | 792 +++ docs/html/classMyException-members.html | 74 + docs/html/classMyException.html | 244 + docs/html/classMyException.png | Bin 0 -> 474 bytes docs/html/classObject-members.html | 77 + docs/html/classObject.html | 333 + docs/html/classObject.png | Bin 0 -> 1349 bytes docs/html/classPCBasis-members.html | 111 + docs/html/classPCBasis.html | 1280 ++++ docs/html/classPCSet-members.html | 246 + docs/html/classPCSet.html | 5421 +++++++++++++++++ docs/html/classPCreg-members.html | 126 + docs/html/classPCreg.html | 501 ++ docs/html/classPCreg.png | Bin 0 -> 353 bytes docs/html/classPLreg-members.html | 125 + docs/html/classPLreg.html | 465 ++ docs/html/classPLreg.png | Bin 0 -> 344 bytes docs/html/classPost-members.html | 115 + docs/html/classPost.html | 1405 +++++ docs/html/classPost.png | Bin 0 -> 2638 bytes docs/html/classQuad-members.html | 134 + docs/html/classQuad.html | 2248 +++++++ docs/html/classRBFreg-members.html | 125 + docs/html/classRBFreg.html | 473 ++ docs/html/classRBFreg.png | Bin 0 -> 363 bytes docs/html/classRefPtr-members.html | 92 + docs/html/classRefPtr.html | 817 +++ docs/html/classXMLAttributeList-members.html | 107 + docs/html/classXMLAttributeList.html | 957 +++ docs/html/classXMLAttributeList.png | Bin 0 -> 485 bytes docs/html/classXMLElement-members.html | 101 + docs/html/classXMLElement.html | 784 +++ docs/html/classXMLElement.png | Bin 0 -> 451 bytes docs/html/classXMLExpatParser-members.html | 93 + docs/html/classXMLExpatParser.html | 652 ++ docs/html/classXMLExpatParser.png | Bin 0 -> 799 bytes docs/html/classXMLParser-members.html | 80 + docs/html/classXMLParser.html | 254 + docs/html/classXMLParser.png | Bin 0 -> 806 bytes docs/html/classbase-members.html | 70 + docs/html/classbase.html | 110 + ...classdataPosteriorInformation-members.html | 95 + docs/html/classdataPosteriorInformation.html | 495 ++ docs/html/classes.html | 108 + docs/html/classmain-members.html | 71 + docs/html/classmain.html | 127 + ...parameterPosteriorInformation-members.html | 76 + .../classparameterPosteriorInformation.html | 191 + docs/html/clipboard.js | 61 + docs/html/closed.png | Bin 0 -> 132 bytes docs/html/combin_8cpp.html | 535 ++ docs/html/combin_8h.html | 494 ++ docs/html/combin_8h_source.html | 148 + docs/html/dfi_8cpp.html | 232 + docs/html/dfi_8h.html | 453 ++ docs/html/dfi_8h_source.html | 524 ++ .../dir_006721c806d6821325371dd377832d8c.html | 79 + .../dir_06694bf5fd41ba74684056be78273ad2.html | 80 + .../dir_093fd1291c916f9be3adb1135a493bae.html | 80 + .../dir_128519fc8b37a5a067b4c5f6cc8f4c49.html | 95 + .../dir_16a870b7d07bdaacfd3f0908a78f5e9d.html | 80 + .../dir_19007e3130b5965ca6c49213286cf7eb.html | 77 + .../dir_1eb400768e3494ee2ca629243c22fbce.html | 92 + .../dir_20f2680a3977f3851122b2d6066a454e.html | 77 + .../dir_28e3df397f43e8f1af7e6c2b7d87b0e6.html | 125 + .../dir_40ca0f9b78da4ccbb14e5a28ee282e45.html | 86 + .../dir_4532e4717bdbef31626f1f4eec1ad1de.html | 80 + .../dir_5c4c5ed82fd393e0105f6bcdb5914010.html | 77 + .../dir_7a58a101592a95cebbfd07e6a75340e1.html | 98 + .../dir_7b5ab9ffb3898dc1cc468814aa6ead1a.html | 80 + .../dir_7e9b6b5d4305474956bab61a81ab07f7.html | 100 + .../dir_8dadda8c97c669c14bc759cc9927688a.html | 80 + .../dir_93836573b90394f9b606bea0a1f27892.html | 77 + .../dir_97f84c1072eb90142eaac1b180b6d7c5.html | 77 + .../dir_9edb83e4ed44c497265383775a8507cd.html | 77 + .../dir_9faeda79623e471167af325f01dc9fc9.html | 98 + .../dir_a3750b93c2443f2a35afa7a30a5b3dee.html | 77 + .../dir_b5a0728fb7018a88df0fa60e862f7cd4.html | 77 + .../dir_b915a5b945a42a3919ddfe29e13bcb81.html | 77 + .../dir_dc842bf419791690b2dfdb2fe51d5bc8.html | 78 + .../dir_df511e5bd85cec96854b39d5e1c27aa8.html | 78 + .../dir_e002628c42d6516cdcbe6e17a7fdfaec.html | 77 + .../dir_fcacb3c2852ebd65abb669ef5bd9c0b5.html | 78 + docs/html/doc.svg | 12 + docs/html/docd.svg | 12 + docs/html/doxygen.css | 2247 +++++++ docs/html/doxygen.svg | 28 + docs/html/doxygen_crawl.html | 2478 ++++++++ docs/html/dynsections.js | 198 + docs/html/files.html | 174 + docs/html/folderclosed.svg | 11 + docs/html/folderclosedd.svg | 11 + docs/html/folderopen.svg | 17 + docs/html/folderopend.svg | 12 + docs/html/func_8cpp.html | 699 +++ docs/html/func_8h.html | 708 +++ docs/html/func_8h_source.html | 170 + docs/html/functions.html | 98 + docs/html/functions_b.html | 83 + docs/html/functions_c.html | 125 + docs/html/functions_d.html | 109 + docs/html/functions_e.html | 109 + docs/html/functions_f.html | 83 + docs/html/functions_func.html | 81 + docs/html/functions_func_b.html | 74 + docs/html/functions_func_c.html | 103 + docs/html/functions_func_d.html | 88 + docs/html/functions_func_e.html | 101 + docs/html/functions_func_f.html | 70 + docs/html/functions_func_g.html | 182 + docs/html/functions_func_h.html | 68 + docs/html/functions_func_i.html | 86 + docs/html/functions_func_k.html | 70 + docs/html/functions_func_l.html | 92 + docs/html/functions_func_m.html | 81 + docs/html/functions_func_n.html | 71 + docs/html/functions_func_o.html | 76 + docs/html/functions_func_p.html | 87 + docs/html/functions_func_q.html | 69 + docs/html/functions_func_r.html | 86 + docs/html/functions_func_s.html | 136 + docs/html/functions_func_t.html | 70 + docs/html/functions_func_u.html | 68 + docs/html/functions_func_w.html | 71 + docs/html/functions_func_x.html | 72 + docs/html/functions_func_y.html | 68 + docs/html/functions_func_z.html | 68 + docs/html/functions_func_~.html | 100 + docs/html/functions_g.html | 186 + docs/html/functions_h.html | 75 + docs/html/functions_i.html | 93 + docs/html/functions_j.html | 70 + docs/html/functions_k.html | 72 + docs/html/functions_l.html | 103 + docs/html/functions_m.html | 96 + docs/html/functions_n.html | 97 + docs/html/functions_o.html | 84 + docs/html/functions_p.html | 122 + docs/html/functions_q.html | 76 + docs/html/functions_r.html | 100 + docs/html/functions_rela.html | 67 + docs/html/functions_s.html | 156 + docs/html/functions_t.html | 75 + docs/html/functions_type.html | 70 + docs/html/functions_u.html | 73 + docs/html/functions_v.html | 75 + docs/html/functions_vars.html | 84 + docs/html/functions_vars_b.html | 76 + docs/html/functions_vars_c.html | 87 + docs/html/functions_vars_d.html | 88 + docs/html/functions_vars_e.html | 75 + docs/html/functions_vars_f.html | 80 + docs/html/functions_vars_g.html | 71 + docs/html/functions_vars_h.html | 74 + docs/html/functions_vars_i.html | 73 + docs/html/functions_vars_j.html | 70 + docs/html/functions_vars_k.html | 69 + docs/html/functions_vars_l.html | 78 + docs/html/functions_vars_m.html | 81 + docs/html/functions_vars_n.html | 93 + docs/html/functions_vars_o.html | 74 + docs/html/functions_vars_p.html | 102 + docs/html/functions_vars_q.html | 74 + docs/html/functions_vars_r.html | 81 + docs/html/functions_vars_s.html | 87 + docs/html/functions_vars_t.html | 71 + docs/html/functions_vars_u.html | 72 + docs/html/functions_vars_v.html | 75 + docs/html/functions_vars_w.html | 74 + docs/html/functions_vars_x.html | 71 + docs/html/functions_vars_y.html | 72 + docs/html/functions_vars_z.html | 69 + docs/html/functions_w.html | 78 + docs/html/functions_x.html | 76 + docs/html/functions_y.html | 73 + docs/html/functions_z.html | 70 + docs/html/functions_~.html | 100 + docs/html/gen__mi_8cpp.html | 260 + docs/html/generate__quad_8cpp.html | 302 + docs/html/gkpSparse_8cpp.html | 200 + docs/html/gkpclib_8cpp.html | 1200 ++++ docs/html/gkplib_8h.html | 552 ++ docs/html/gkplib_8h_source.html | 147 + docs/html/globals.html | 68 + docs/html/globals_a.html | 83 + docs/html/globals_b.html | 75 + docs/html/globals_c.html | 86 + docs/html/globals_d.html | 88 + docs/html/globals_defs.html | 228 + docs/html/globals_e.html | 71 + docs/html/globals_enum.html | 66 + docs/html/globals_eval.html | 67 + docs/html/globals_f.html | 98 + docs/html/globals_func.html | 81 + docs/html/globals_func_b.html | 70 + docs/html/globals_func_c.html | 83 + docs/html/globals_func_d.html | 80 + docs/html/globals_func_e.html | 69 + docs/html/globals_func_f.html | 93 + docs/html/globals_func_g.html | 104 + docs/html/globals_func_h.html | 70 + docs/html/globals_func_i.html | 79 + docs/html/globals_func_j.html | 69 + docs/html/globals_func_l.html | 76 + docs/html/globals_func_m.html | 78 + docs/html/globals_func_n.html | 73 + docs/html/globals_func_p.html | 80 + docs/html/globals_func_q.html | 69 + docs/html/globals_func_r.html | 73 + docs/html/globals_func_s.html | 83 + docs/html/globals_func_t.html | 73 + docs/html/globals_func_u.html | 76 + docs/html/globals_func_v.html | 69 + docs/html/globals_func_w.html | 71 + docs/html/globals_g.html | 105 + docs/html/globals_h.html | 70 + docs/html/globals_i.html | 81 + docs/html/globals_j.html | 69 + docs/html/globals_l.html | 80 + docs/html/globals_m.html | 91 + docs/html/globals_n.html | 80 + docs/html/globals_o.html | 69 + docs/html/globals_p.html | 91 + docs/html/globals_q.html | 71 + docs/html/globals_r.html | 74 + docs/html/globals_s.html | 92 + docs/html/globals_t.html | 75 + docs/html/globals_u.html | 76 + docs/html/globals_v.html | 71 + docs/html/globals_vars.html | 87 + docs/html/globals_w.html | 82 + docs/html/globals_x.html | 79 + docs/html/globals_y.html | 68 + docs/html/gp__regr_8cpp.html | 250 + docs/html/gproc_8cpp.html | 123 + docs/html/gproc_8h.html | 90 + docs/html/gproc_8h_source.html | 247 + docs/html/gq_8cpp.html | 537 ++ docs/html/gq_8h.html | 327 + docs/html/gq_8h_source.html | 118 + docs/html/hierarchy.html | 126 + docs/html/index.html | 68 + docs/html/inference_8cpp.html | 405 ++ docs/html/inference_8h.html | 395 ++ docs/html/inference_8h_source.html | 130 + docs/html/jquery.js | 204 + docs/html/kle_8cpp.html | 74 + docs/html/kle_8h.html | 85 + docs/html/kle_8h_source.html | 206 + docs/html/lreg_8cpp.html | 128 + docs/html/lreg_8h.html | 98 + docs/html/lreg_8h_source.html | 315 + docs/html/mcmc_8cpp.html | 115 + docs/html/mcmc_8h.html | 104 + docs/html/mcmc_8h_source.html | 439 ++ docs/html/menu.js | 134 + docs/html/menudata.js | 190 + docs/html/minmax_8cpp.html | 435 ++ docs/html/minmax_8h.html | 458 ++ docs/html/minmax_8h_source.html | 138 + docs/html/minus.svg | 8 + docs/html/minusd.svg | 8 + docs/html/model__inf_8cpp.html | 501 ++ docs/html/mrv_8cpp.html | 107 + docs/html/mrv_8h.html | 94 + docs/html/mrv_8h_source.html | 193 + docs/html/multiindex_8cpp.html | 453 ++ docs/html/multiindex_8h.html | 491 ++ docs/html/multiindex_8h_source.html | 153 + docs/html/nav_f.png | Bin 0 -> 153 bytes docs/html/nav_fd.png | Bin 0 -> 169 bytes docs/html/nav_g.png | Bin 0 -> 95 bytes docs/html/nav_h.png | Bin 0 -> 98 bytes docs/html/nav_hd.png | Bin 0 -> 114 bytes docs/html/navtree.css | 149 + docs/html/open.png | Bin 0 -> 123 bytes docs/html/pages.html | 72 + docs/html/pce__eval_8cpp.html | 612 ++ docs/html/pce__quad_8cpp.html | 289 + docs/html/pce__rv_8cpp.html | 355 ++ docs/html/pce__sens_8cpp.html | 244 + docs/html/pcmaps_8cpp.html | 395 ++ docs/html/pcmaps_8h.html | 352 ++ docs/html/pcmaps_8h_source.html | 118 + docs/html/pdf__cl_8cpp.html | 230 + docs/html/plus.svg | 9 + docs/html/plusd.svg | 9 + docs/html/post_8cpp.html | 110 + docs/html/post_8h.html | 124 + docs/html/post_8h_source.html | 432 ++ docs/html/probability_8cpp.html | 983 +++ docs/html/probability_8h.html | 1000 +++ docs/html/probability_8h_source.html | 204 + docs/html/quad_8cpp.html | 86 + docs/html/quad_8h.html | 120 + docs/html/quad_8h_source.html | 300 + docs/html/regression_8cpp.html | 338 + docs/html/resize.js | 147 + docs/html/rosenblatt_8cpp.html | 395 ++ docs/html/rosenblatt_8h.html | 390 ++ docs/html/rosenblatt_8h_source.html | 124 + docs/html/sens_8cpp.html | 214 + docs/html/splitbar.png | Bin 0 -> 314 bytes docs/html/splitbard.png | Bin 0 -> 282 bytes .../structMCMC_1_1chainstate-members.html | 77 + docs/html/structMCMC_1_1chainstate.html | 147 + .../structMCMC_1_1outputInfo-members.html | 77 + docs/html/structMCMC_1_1outputInfo.html | 145 + docs/html/structQuad_1_1QuadRule-members.html | 75 + docs/html/structQuad_1_1QuadRule.html | 124 + docs/html/sync_off.png | Bin 0 -> 853 bytes docs/html/sync_on.png | Bin 0 -> 845 bytes docs/html/tab_a.png | Bin 0 -> 142 bytes docs/html/tab_ad.png | Bin 0 -> 135 bytes docs/html/tab_b.png | Bin 0 -> 169 bytes docs/html/tab_bd.png | Bin 0 -> 173 bytes docs/html/tab_h.png | Bin 0 -> 177 bytes docs/html/tab_hd.png | Bin 0 -> 180 bytes docs/html/tab_s.png | Bin 0 -> 184 bytes docs/html/tab_sd.png | Bin 0 -> 188 bytes docs/html/tabs.css | 1 + docs/html/todo.html | 207 + docs/html/tools_8h.html | 85 + docs/html/tools_8h_source.html | 118 + docs/html/trdSpls_8cpp.html | 364 ++ docs/html/userFunctions_8h.html | 248 + docs/html/userFunctions_8h_source.html | 126 + examples/d_spring_series/d_springs_tools.py | 6 +- examples/d_spring_series/run_d_springs.py | 6 +- examples/dfi/line/main.cpp | 6 +- examples/dfi/line/userFunctions_line.cpp | 6 +- examples/iuq/get_postpred.py | 6 +- examples/iuq/get_postsam.py | 6 +- examples/iuq/plot_fit1d.py | 6 +- examples/iuq/plot_pdfs.py | 6 +- examples/iuq/plot_prpost.py | 6 +- examples/iuq/plot_sens.py | 6 +- examples/iuq/plot_shade.py | 6 +- examples/iuq/postp_infer.x | 6 +- examples/iuq/prep_calib.x | 6 +- examples/iuq/prep_data1.x | 6 +- examples/iuq/prep_data2.x | 6 +- examples/iuq/prep_model1.x | 6 +- examples/iuq/prep_model2.x | 6 +- examples/iuq/run_infer.x | 6 +- examples/iuq/workflow.x | 6 +- examples/kle_ex1/data/kl-prep-scus.py | 6 +- examples/kle_ex1/data/kl_prep_grid.py | 6 +- examples/kle_ex1/kl_1D.cpp | 6 +- examples/kle_ex1/kl_2D.cpp | 6 +- examples/kle_ex1/kl_2Du.cpp | 6 +- examples/kle_ex1/kl_utils.cpp | 6 +- examples/kle_ex1/kl_utils.h | 6 +- examples/kle_ex1/mkplots.py | 6 +- examples/kle_ex1/pl2Dsgrid.py | 6 +- examples/kle_ex1/pl2Dugrid.py | 6 +- examples/kle_ex1/pyutils.py | 6 +- examples/kle_ex1/run1D.sh | 6 +- examples/kle_ex1/run2D.sh | 6 +- examples/line_infer/XMLreader.h | 6 +- examples/line_infer/line_infer.cpp | 6 +- examples/line_infer/line_infer.py | 6 +- examples/line_infer/model.h | 6 +- examples/line_infer/posterior.h | 6 +- examples/muq/genzGP.py | 6 +- examples/muq/muqPCE2uqtk.cpp | 6 +- examples/num_integ/full_quad.py | 6 +- examples/num_integ/quad_tools.py | 6 +- examples/num_integ/sparse_quad.py | 6 +- examples/ops/LogComp.cpp | 6 +- examples/ops/Ops.cpp | 6 +- examples/ops/Utils.cpp | 6 +- examples/ops/Utils.h | 6 +- examples/ops/plot_logs.py | 6 +- examples/ops/plot_pdf.py | 6 +- examples/ops/test_all.sh | 6 +- examples/pce_bcs/pce_bcs.cpp | 6 +- examples/pce_bcs/pce_bcs.h | 6 +- examples/polynomial/run/full_run.sh | 6 +- examples/polynomial/scripts/evidence.py | 6 +- examples/polynomial/scripts/fit.py | 6 +- examples/polynomial/scripts/get_data.py | 6 +- examples/polynomial/scripts/graph_tools.py | 6 +- examples/polynomial/scripts/post.py | 6 +- examples/polynomial/scripts/tools.py | 6 +- examples/sensMC/genRndSpls.sh | 6 +- examples/sensMC/model.sh | 6 +- examples/sensMC/rmspls.sh | 6 +- examples/sensMC/run.sh | 6 +- examples/surf_rxn/SurfRxnDet.cpp | 6 +- examples/surf_rxn/SurfRxnISP.cpp | 6 +- examples/surf_rxn/SurfRxnMulti.py | 6 +- examples/surf_rxn/SurfRxnNISP.cpp | 6 +- examples/surf_rxn/SurfRxnNISP_MC.cpp | 6 +- examples/surf_rxn/Utils.cpp | 6 +- examples/surf_rxn/Utils.h | 6 +- examples/surf_rxn/XMLreader.h | 6 +- examples/surf_rxn/cleandir.sh | 6 +- examples/surf_rxn/file_utils.py | 6 +- examples/surf_rxn/forUQ_BB_sr.py | 6 +- examples/surf_rxn/forUQ_BB_utils.py | 6 +- examples/surf_rxn/forUQ_sr.py | 6 +- examples/surf_rxn/model.h | 6 +- examples/surf_rxn/other/SurfRxnInfer.cpp | 6 +- examples/surf_rxn/other/plChain.py | 6 +- examples/surf_rxn/other/plPDF_bw.py | 6 +- examples/surf_rxn/other/plTriang.py | 6 +- examples/surf_rxn/other/plot_chain_samples.py | 6 +- .../other/plot_surf_rxn_ISP-NISP_umodes.py | 6 +- .../other/plot_surf_rxn_ISP_umodes.py | 6 +- .../other/plot_surf_rxn_NISP_umodes.py | 6 +- examples/surf_rxn/other/plot_uvdata.py | 6 +- examples/surf_rxn/other/prob4.py | 6 +- examples/surf_rxn/plPDF_method.py | 6 +- examples/surf_rxn/plSurfRxnMstd.py | 6 +- examples/surf_rxn/plot_utils.py | 6 +- examples/surf_rxn/posterior.h | 6 +- examples/surf_rxn/postpred.py | 6 +- examples/surf_rxn/utils.py | 6 +- examples/tmcmc_bimodal/bimodal.cpp | 6 +- examples/tmcmc_bimodal/tmcmc_bimodal.cpp | 6 +- examples/tmcmc_bimodal/tmcmc_bimodal.py | 6 +- examples/tmcmc_bimodal/tmcmc_getLL.sh | 6 +- examples/tmcmc_bimodal/tmcmc_getLP.sh | 6 +- .../tmcmc_moveIntermediateFiles.sh | 6 +- examples/tmcmc_umbridge/tmcmc_getLL.sh | 6 +- examples/tmcmc_umbridge/tmcmc_getLP.sh | 6 +- .../tmcmc_moveIntermediateFiles.sh | 6 +- examples/tmcmc_umbridge/tmcmc_umbridge.cpp | 6 +- examples/tmcmc_umbridge/tmcmc_umbridge.py | 6 +- examples/tmcmc_umbridge/umbridge_model.cpp | 6 +- examples/uqpc/col_ave.x | 6 +- examples/uqpc/example_0.x | 6 +- examples/uqpc/example_1.x | 6 +- examples/uqpc/example_2.x | 6 +- examples/uqpc/example_3.x | 6 +- examples/uqpc/generate_inputsamples.py | 6 +- examples/uqpc/get_modelpc.py | 6 +- examples/uqpc/getrange.x | 6 +- examples/uqpc/join_results.py | 6 +- examples/uqpc/model.py | 6 +- examples/uqpc/model_sens.x | 6 +- examples/uqpc/plot.py | 6 +- examples/uqpc/plot_prep.py | 6 +- examples/uqpc/prepare_inpc.py | 6 +- examples/uqpc/scale.x | 6 +- examples/uqpc/transpose_file.x | 6 +- examples/uqpc/uq_pc.py | 6 +- 757 files changed, 100161 insertions(+), 956 deletions(-) create mode 100644 docs/html/Array1D_8h.html create mode 100644 docs/html/Array1D_8h_source.html create mode 100644 docs/html/Array2D_8h.html create mode 100644 docs/html/Array2D_8h_source.html create mode 100644 docs/html/Array3D_8h.html create mode 100644 docs/html/Array3D_8h_source.html create mode 100644 docs/html/DoxyMain_8dox.html create mode 100644 docs/html/MyException_8h.html create mode 100644 docs/html/MyException_8h_source.html create mode 100644 docs/html/Object_8h.html create mode 100644 docs/html/Object_8h_source.html create mode 100644 docs/html/PCBasis_8cpp.html create mode 100644 docs/html/PCBasis_8h.html create mode 100644 docs/html/PCBasis_8h_source.html create mode 100644 docs/html/PCSet_8cpp.html create mode 100644 docs/html/PCSet_8h.html create mode 100644 docs/html/PCSet_8h_source.html create mode 100644 docs/html/RefPtr_8h.html create mode 100644 docs/html/RefPtr_8h_source.html create mode 100644 docs/html/XMLAttributeList_8cpp.html create mode 100644 docs/html/XMLAttributeList_8h.html create mode 100644 docs/html/XMLAttributeList_8h_source.html create mode 100644 docs/html/XMLElement_8cpp.html create mode 100644 docs/html/XMLElement_8h.html create mode 100644 docs/html/XMLElement_8h_source.html create mode 100644 docs/html/XMLExpatParser_8cpp.html create mode 100644 docs/html/XMLExpatParser_8h.html create mode 100644 docs/html/XMLExpatParser_8h_source.html create mode 100644 docs/html/XMLParser_8cpp.html create mode 100644 docs/html/XMLParser_8h.html create mode 100644 docs/html/XMLParser_8h_source.html create mode 100644 docs/html/XMLUtils_8cpp.html create mode 100644 docs/html/XMLUtils_8h.html create mode 100644 docs/html/XMLUtils_8h_source.html create mode 100644 docs/html/_formulas.aux create mode 100644 docs/html/_formulas.dvi create mode 100644 docs/html/_formulas.log create mode 100644 docs/html/_formulas.tex create mode 100644 docs/html/_formulas_dark.aux create mode 100644 docs/html/_formulas_dark.dvi create mode 100644 docs/html/_formulas_dark.log create mode 100644 docs/html/_formulas_dark.tex create mode 100644 docs/html/annotated.html create mode 100644 docs/html/arrayio_8cpp.html create mode 100644 docs/html/arrayio_8h.html create mode 100644 docs/html/arrayio_8h_source.html create mode 100644 docs/html/arraytools_8cpp.html create mode 100644 docs/html/arraytools_8h.html create mode 100644 docs/html/arraytools_8h_source.html create mode 100644 docs/html/bc_s.png create mode 100644 docs/html/bc_sd.png create mode 100644 docs/html/bcs_8cpp.html create mode 100644 docs/html/bcs_8h.html create mode 100644 docs/html/bcs_8h_source.html create mode 100644 docs/html/citelist.html create mode 100644 docs/html/classArray1D-members.html create mode 100644 docs/html/classArray1D.html create mode 100644 docs/html/classArray1D_3_01double_01_4-members.html create mode 100644 docs/html/classArray1D_3_01double_01_4.html create mode 100644 docs/html/classArray1D_3_01int_01_4-members.html create mode 100644 docs/html/classArray1D_3_01int_01_4.html create mode 100644 docs/html/classArray2D-members.html create mode 100644 docs/html/classArray2D.html create mode 100644 docs/html/classArray3D-members.html create mode 100644 docs/html/classArray3D.html create mode 100644 docs/html/classDFI-members.html create mode 100644 docs/html/classDFI.html create mode 100644 docs/html/classDFIsurr-members.html create mode 100644 docs/html/classDFIsurr.html create mode 100644 docs/html/classGproc-members.html create mode 100644 docs/html/classGproc.html create mode 100644 docs/html/classKLDecompUni-members.html create mode 100644 docs/html/classKLDecompUni.html create mode 100644 docs/html/classLik__ABC-members.html create mode 100644 docs/html/classLik__ABC.html create mode 100644 docs/html/classLik__ABC.png create mode 100644 docs/html/classLik__ABCm-members.html create mode 100644 docs/html/classLik__ABCm.html create mode 100644 docs/html/classLik__ABCm.png create mode 100644 docs/html/classLik__Classical-members.html create mode 100644 docs/html/classLik__Classical.html create mode 100644 docs/html/classLik__Classical.png create mode 100644 docs/html/classLik__Eov-members.html create mode 100644 docs/html/classLik__Eov.html create mode 100644 docs/html/classLik__Eov.png create mode 100644 docs/html/classLik__Full-members.html create mode 100644 docs/html/classLik__Full.html create mode 100644 docs/html/classLik__Full.png create mode 100644 docs/html/classLik__GausMarg-members.html create mode 100644 docs/html/classLik__GausMarg.html create mode 100644 docs/html/classLik__GausMarg.png create mode 100644 docs/html/classLik__GausMargD-members.html create mode 100644 docs/html/classLik__GausMargD.html create mode 100644 docs/html/classLik__GausMargD.png create mode 100644 docs/html/classLik__Koh-members.html create mode 100644 docs/html/classLik__Koh.html create mode 100644 docs/html/classLik__Koh.png create mode 100644 docs/html/classLik__MVN-members.html create mode 100644 docs/html/classLik__MVN.html create mode 100644 docs/html/classLik__MVN.png create mode 100644 docs/html/classLik__Marg-members.html create mode 100644 docs/html/classLik__Marg.html create mode 100644 docs/html/classLik__Marg.png create mode 100644 docs/html/classLogPosteriorBase-members.html create mode 100644 docs/html/classLogPosteriorBase.html create mode 100644 docs/html/classLreg-members.html create mode 100644 docs/html/classLreg.html create mode 100644 docs/html/classLreg.png create mode 100644 docs/html/classMCMC-members.html create mode 100644 docs/html/classMCMC.html create mode 100644 docs/html/classMrv-members.html create mode 100644 docs/html/classMrv.html create mode 100644 docs/html/classMyException-members.html create mode 100644 docs/html/classMyException.html create mode 100644 docs/html/classMyException.png create mode 100644 docs/html/classObject-members.html create mode 100644 docs/html/classObject.html create mode 100644 docs/html/classObject.png create mode 100644 docs/html/classPCBasis-members.html create mode 100644 docs/html/classPCBasis.html create mode 100644 docs/html/classPCSet-members.html create mode 100644 docs/html/classPCSet.html create mode 100644 docs/html/classPCreg-members.html create mode 100644 docs/html/classPCreg.html create mode 100644 docs/html/classPCreg.png create mode 100644 docs/html/classPLreg-members.html create mode 100644 docs/html/classPLreg.html create mode 100644 docs/html/classPLreg.png create mode 100644 docs/html/classPost-members.html create mode 100644 docs/html/classPost.html create mode 100644 docs/html/classPost.png create mode 100644 docs/html/classQuad-members.html create mode 100644 docs/html/classQuad.html create mode 100644 docs/html/classRBFreg-members.html create mode 100644 docs/html/classRBFreg.html create mode 100644 docs/html/classRBFreg.png create mode 100644 docs/html/classRefPtr-members.html create mode 100644 docs/html/classRefPtr.html create mode 100644 docs/html/classXMLAttributeList-members.html create mode 100644 docs/html/classXMLAttributeList.html create mode 100644 docs/html/classXMLAttributeList.png create mode 100644 docs/html/classXMLElement-members.html create mode 100644 docs/html/classXMLElement.html create mode 100644 docs/html/classXMLElement.png create mode 100644 docs/html/classXMLExpatParser-members.html create mode 100644 docs/html/classXMLExpatParser.html create mode 100644 docs/html/classXMLExpatParser.png create mode 100644 docs/html/classXMLParser-members.html create mode 100644 docs/html/classXMLParser.html create mode 100644 docs/html/classXMLParser.png create mode 100644 docs/html/classbase-members.html create mode 100644 docs/html/classbase.html create mode 100644 docs/html/classdataPosteriorInformation-members.html create mode 100644 docs/html/classdataPosteriorInformation.html create mode 100644 docs/html/classes.html create mode 100644 docs/html/classmain-members.html create mode 100644 docs/html/classmain.html create mode 100644 docs/html/classparameterPosteriorInformation-members.html create mode 100644 docs/html/classparameterPosteriorInformation.html create mode 100644 docs/html/clipboard.js create mode 100644 docs/html/closed.png create mode 100644 docs/html/combin_8cpp.html create mode 100644 docs/html/combin_8h.html create mode 100644 docs/html/combin_8h_source.html create mode 100644 docs/html/dfi_8cpp.html create mode 100644 docs/html/dfi_8h.html create mode 100644 docs/html/dfi_8h_source.html create mode 100644 docs/html/dir_006721c806d6821325371dd377832d8c.html create mode 100644 docs/html/dir_06694bf5fd41ba74684056be78273ad2.html create mode 100644 docs/html/dir_093fd1291c916f9be3adb1135a493bae.html create mode 100644 docs/html/dir_128519fc8b37a5a067b4c5f6cc8f4c49.html create mode 100644 docs/html/dir_16a870b7d07bdaacfd3f0908a78f5e9d.html create mode 100644 docs/html/dir_19007e3130b5965ca6c49213286cf7eb.html create mode 100644 docs/html/dir_1eb400768e3494ee2ca629243c22fbce.html create mode 100644 docs/html/dir_20f2680a3977f3851122b2d6066a454e.html create mode 100644 docs/html/dir_28e3df397f43e8f1af7e6c2b7d87b0e6.html create mode 100644 docs/html/dir_40ca0f9b78da4ccbb14e5a28ee282e45.html create mode 100644 docs/html/dir_4532e4717bdbef31626f1f4eec1ad1de.html create mode 100644 docs/html/dir_5c4c5ed82fd393e0105f6bcdb5914010.html create mode 100644 docs/html/dir_7a58a101592a95cebbfd07e6a75340e1.html create mode 100644 docs/html/dir_7b5ab9ffb3898dc1cc468814aa6ead1a.html create mode 100644 docs/html/dir_7e9b6b5d4305474956bab61a81ab07f7.html create mode 100644 docs/html/dir_8dadda8c97c669c14bc759cc9927688a.html create mode 100644 docs/html/dir_93836573b90394f9b606bea0a1f27892.html create mode 100644 docs/html/dir_97f84c1072eb90142eaac1b180b6d7c5.html create mode 100644 docs/html/dir_9edb83e4ed44c497265383775a8507cd.html create mode 100644 docs/html/dir_9faeda79623e471167af325f01dc9fc9.html create mode 100644 docs/html/dir_a3750b93c2443f2a35afa7a30a5b3dee.html create mode 100644 docs/html/dir_b5a0728fb7018a88df0fa60e862f7cd4.html create mode 100644 docs/html/dir_b915a5b945a42a3919ddfe29e13bcb81.html create mode 100644 docs/html/dir_dc842bf419791690b2dfdb2fe51d5bc8.html create mode 100644 docs/html/dir_df511e5bd85cec96854b39d5e1c27aa8.html create mode 100644 docs/html/dir_e002628c42d6516cdcbe6e17a7fdfaec.html create mode 100644 docs/html/dir_fcacb3c2852ebd65abb669ef5bd9c0b5.html create mode 100644 docs/html/doc.svg create mode 100644 docs/html/docd.svg create mode 100644 docs/html/doxygen.css create mode 100644 docs/html/doxygen.svg create mode 100644 docs/html/doxygen_crawl.html create mode 100644 docs/html/dynsections.js create mode 100644 docs/html/files.html create mode 100644 docs/html/folderclosed.svg create mode 100644 docs/html/folderclosedd.svg create mode 100644 docs/html/folderopen.svg create mode 100644 docs/html/folderopend.svg create mode 100644 docs/html/func_8cpp.html create mode 100644 docs/html/func_8h.html create mode 100644 docs/html/func_8h_source.html create mode 100644 docs/html/functions.html create mode 100644 docs/html/functions_b.html create mode 100644 docs/html/functions_c.html create mode 100644 docs/html/functions_d.html create mode 100644 docs/html/functions_e.html create mode 100644 docs/html/functions_f.html create mode 100644 docs/html/functions_func.html create mode 100644 docs/html/functions_func_b.html create mode 100644 docs/html/functions_func_c.html create mode 100644 docs/html/functions_func_d.html create mode 100644 docs/html/functions_func_e.html create mode 100644 docs/html/functions_func_f.html create mode 100644 docs/html/functions_func_g.html create mode 100644 docs/html/functions_func_h.html create mode 100644 docs/html/functions_func_i.html create mode 100644 docs/html/functions_func_k.html create mode 100644 docs/html/functions_func_l.html create mode 100644 docs/html/functions_func_m.html create mode 100644 docs/html/functions_func_n.html create mode 100644 docs/html/functions_func_o.html create mode 100644 docs/html/functions_func_p.html create mode 100644 docs/html/functions_func_q.html create mode 100644 docs/html/functions_func_r.html create mode 100644 docs/html/functions_func_s.html create mode 100644 docs/html/functions_func_t.html create mode 100644 docs/html/functions_func_u.html create mode 100644 docs/html/functions_func_w.html create mode 100644 docs/html/functions_func_x.html create mode 100644 docs/html/functions_func_y.html create mode 100644 docs/html/functions_func_z.html create mode 100644 docs/html/functions_func_~.html create mode 100644 docs/html/functions_g.html create mode 100644 docs/html/functions_h.html create mode 100644 docs/html/functions_i.html create mode 100644 docs/html/functions_j.html create mode 100644 docs/html/functions_k.html create mode 100644 docs/html/functions_l.html create mode 100644 docs/html/functions_m.html create mode 100644 docs/html/functions_n.html create mode 100644 docs/html/functions_o.html create mode 100644 docs/html/functions_p.html create mode 100644 docs/html/functions_q.html create mode 100644 docs/html/functions_r.html create mode 100644 docs/html/functions_rela.html create mode 100644 docs/html/functions_s.html create mode 100644 docs/html/functions_t.html create mode 100644 docs/html/functions_type.html create mode 100644 docs/html/functions_u.html create mode 100644 docs/html/functions_v.html create mode 100644 docs/html/functions_vars.html create mode 100644 docs/html/functions_vars_b.html create mode 100644 docs/html/functions_vars_c.html create mode 100644 docs/html/functions_vars_d.html create mode 100644 docs/html/functions_vars_e.html create mode 100644 docs/html/functions_vars_f.html create mode 100644 docs/html/functions_vars_g.html create mode 100644 docs/html/functions_vars_h.html create mode 100644 docs/html/functions_vars_i.html create mode 100644 docs/html/functions_vars_j.html create mode 100644 docs/html/functions_vars_k.html create mode 100644 docs/html/functions_vars_l.html create mode 100644 docs/html/functions_vars_m.html create mode 100644 docs/html/functions_vars_n.html create mode 100644 docs/html/functions_vars_o.html create mode 100644 docs/html/functions_vars_p.html create mode 100644 docs/html/functions_vars_q.html create mode 100644 docs/html/functions_vars_r.html create mode 100644 docs/html/functions_vars_s.html create mode 100644 docs/html/functions_vars_t.html create mode 100644 docs/html/functions_vars_u.html create mode 100644 docs/html/functions_vars_v.html create mode 100644 docs/html/functions_vars_w.html create mode 100644 docs/html/functions_vars_x.html create mode 100644 docs/html/functions_vars_y.html create mode 100644 docs/html/functions_vars_z.html create mode 100644 docs/html/functions_w.html create mode 100644 docs/html/functions_x.html create mode 100644 docs/html/functions_y.html create mode 100644 docs/html/functions_z.html create mode 100644 docs/html/functions_~.html create mode 100644 docs/html/gen__mi_8cpp.html create mode 100644 docs/html/generate__quad_8cpp.html create mode 100644 docs/html/gkpSparse_8cpp.html create mode 100644 docs/html/gkpclib_8cpp.html create mode 100644 docs/html/gkplib_8h.html create mode 100644 docs/html/gkplib_8h_source.html create mode 100644 docs/html/globals.html create mode 100644 docs/html/globals_a.html create mode 100644 docs/html/globals_b.html create mode 100644 docs/html/globals_c.html create mode 100644 docs/html/globals_d.html create mode 100644 docs/html/globals_defs.html create mode 100644 docs/html/globals_e.html create mode 100644 docs/html/globals_enum.html create mode 100644 docs/html/globals_eval.html create mode 100644 docs/html/globals_f.html create mode 100644 docs/html/globals_func.html create mode 100644 docs/html/globals_func_b.html create mode 100644 docs/html/globals_func_c.html create mode 100644 docs/html/globals_func_d.html create mode 100644 docs/html/globals_func_e.html create mode 100644 docs/html/globals_func_f.html create mode 100644 docs/html/globals_func_g.html create mode 100644 docs/html/globals_func_h.html create mode 100644 docs/html/globals_func_i.html create mode 100644 docs/html/globals_func_j.html create mode 100644 docs/html/globals_func_l.html create mode 100644 docs/html/globals_func_m.html create mode 100644 docs/html/globals_func_n.html create mode 100644 docs/html/globals_func_p.html create mode 100644 docs/html/globals_func_q.html create mode 100644 docs/html/globals_func_r.html create mode 100644 docs/html/globals_func_s.html create mode 100644 docs/html/globals_func_t.html create mode 100644 docs/html/globals_func_u.html create mode 100644 docs/html/globals_func_v.html create mode 100644 docs/html/globals_func_w.html create mode 100644 docs/html/globals_g.html create mode 100644 docs/html/globals_h.html create mode 100644 docs/html/globals_i.html create mode 100644 docs/html/globals_j.html create mode 100644 docs/html/globals_l.html create mode 100644 docs/html/globals_m.html create mode 100644 docs/html/globals_n.html create mode 100644 docs/html/globals_o.html create mode 100644 docs/html/globals_p.html create mode 100644 docs/html/globals_q.html create mode 100644 docs/html/globals_r.html create mode 100644 docs/html/globals_s.html create mode 100644 docs/html/globals_t.html create mode 100644 docs/html/globals_u.html create mode 100644 docs/html/globals_v.html create mode 100644 docs/html/globals_vars.html create mode 100644 docs/html/globals_w.html create mode 100644 docs/html/globals_x.html create mode 100644 docs/html/globals_y.html create mode 100644 docs/html/gp__regr_8cpp.html create mode 100644 docs/html/gproc_8cpp.html create mode 100644 docs/html/gproc_8h.html create mode 100644 docs/html/gproc_8h_source.html create mode 100644 docs/html/gq_8cpp.html create mode 100644 docs/html/gq_8h.html create mode 100644 docs/html/gq_8h_source.html create mode 100644 docs/html/hierarchy.html create mode 100644 docs/html/index.html create mode 100644 docs/html/inference_8cpp.html create mode 100644 docs/html/inference_8h.html create mode 100644 docs/html/inference_8h_source.html create mode 100644 docs/html/jquery.js create mode 100644 docs/html/kle_8cpp.html create mode 100644 docs/html/kle_8h.html create mode 100644 docs/html/kle_8h_source.html create mode 100644 docs/html/lreg_8cpp.html create mode 100644 docs/html/lreg_8h.html create mode 100644 docs/html/lreg_8h_source.html create mode 100644 docs/html/mcmc_8cpp.html create mode 100644 docs/html/mcmc_8h.html create mode 100644 docs/html/mcmc_8h_source.html create mode 100644 docs/html/menu.js create mode 100644 docs/html/menudata.js create mode 100644 docs/html/minmax_8cpp.html create mode 100644 docs/html/minmax_8h.html create mode 100644 docs/html/minmax_8h_source.html create mode 100644 docs/html/minus.svg create mode 100644 docs/html/minusd.svg create mode 100644 docs/html/model__inf_8cpp.html create mode 100644 docs/html/mrv_8cpp.html create mode 100644 docs/html/mrv_8h.html create mode 100644 docs/html/mrv_8h_source.html create mode 100644 docs/html/multiindex_8cpp.html create mode 100644 docs/html/multiindex_8h.html create mode 100644 docs/html/multiindex_8h_source.html create mode 100644 docs/html/nav_f.png create mode 100644 docs/html/nav_fd.png create mode 100644 docs/html/nav_g.png create mode 100644 docs/html/nav_h.png create mode 100644 docs/html/nav_hd.png create mode 100644 docs/html/navtree.css create mode 100644 docs/html/open.png create mode 100644 docs/html/pages.html create mode 100644 docs/html/pce__eval_8cpp.html create mode 100644 docs/html/pce__quad_8cpp.html create mode 100644 docs/html/pce__rv_8cpp.html create mode 100644 docs/html/pce__sens_8cpp.html create mode 100644 docs/html/pcmaps_8cpp.html create mode 100644 docs/html/pcmaps_8h.html create mode 100644 docs/html/pcmaps_8h_source.html create mode 100644 docs/html/pdf__cl_8cpp.html create mode 100644 docs/html/plus.svg create mode 100644 docs/html/plusd.svg create mode 100644 docs/html/post_8cpp.html create mode 100644 docs/html/post_8h.html create mode 100644 docs/html/post_8h_source.html create mode 100644 docs/html/probability_8cpp.html create mode 100644 docs/html/probability_8h.html create mode 100644 docs/html/probability_8h_source.html create mode 100644 docs/html/quad_8cpp.html create mode 100644 docs/html/quad_8h.html create mode 100644 docs/html/quad_8h_source.html create mode 100644 docs/html/regression_8cpp.html create mode 100644 docs/html/resize.js create mode 100644 docs/html/rosenblatt_8cpp.html create mode 100644 docs/html/rosenblatt_8h.html create mode 100644 docs/html/rosenblatt_8h_source.html create mode 100644 docs/html/sens_8cpp.html create mode 100644 docs/html/splitbar.png create mode 100644 docs/html/splitbard.png create mode 100644 docs/html/structMCMC_1_1chainstate-members.html create mode 100644 docs/html/structMCMC_1_1chainstate.html create mode 100644 docs/html/structMCMC_1_1outputInfo-members.html create mode 100644 docs/html/structMCMC_1_1outputInfo.html create mode 100644 docs/html/structQuad_1_1QuadRule-members.html create mode 100644 docs/html/structQuad_1_1QuadRule.html create mode 100644 docs/html/sync_off.png create mode 100644 docs/html/sync_on.png create mode 100644 docs/html/tab_a.png create mode 100644 docs/html/tab_ad.png create mode 100644 docs/html/tab_b.png create mode 100644 docs/html/tab_bd.png create mode 100644 docs/html/tab_h.png create mode 100644 docs/html/tab_hd.png create mode 100644 docs/html/tab_s.png create mode 100644 docs/html/tab_sd.png create mode 100644 docs/html/tabs.css create mode 100644 docs/html/todo.html create mode 100644 docs/html/tools_8h.html create mode 100644 docs/html/tools_8h_source.html create mode 100644 docs/html/trdSpls_8cpp.html create mode 100644 docs/html/userFunctions_8h.html create mode 100644 docs/html/userFunctions_8h_source.html diff --git a/PyUQTk/PyPCE/__init__.py b/PyUQTk/PyPCE/__init__.py index c2c116ce..03a427ac 100755 --- a/PyUQTk/PyPCE/__init__.py +++ b/PyUQTk/PyPCE/__init__.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/PyPCE/adaptation_tools.py b/PyUQTk/PyPCE/adaptation_tools.py index 029c5f65..9ef4f320 100644 --- a/PyUQTk/PyPCE/adaptation_tools.py +++ b/PyUQTk/PyPCE/adaptation_tools.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/PyPCE/pce_tools.py b/PyUQTk/PyPCE/pce_tools.py index 37359207..1357b8fb 100644 --- a/PyUQTk/PyPCE/pce_tools.py +++ b/PyUQTk/PyPCE/pce_tools.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/__init__.py b/PyUQTk/__init__.py index cfa21c58..23044520 100644 --- a/PyUQTk/__init__.py +++ b/PyUQTk/__init__.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/bcs/PyBCS.cpp b/PyUQTk/bcs/PyBCS.cpp index 9fc14281..c9d00b02 100644 --- a/PyUQTk/bcs/PyBCS.cpp +++ b/PyUQTk/bcs/PyBCS.cpp @@ -1,11 +1,11 @@ //===================================================================================== // -// The UQ Toolkit (UQTk) version @UQTKVERSION@ -// Copyright (@UQTKYEAR@) NTESS +// The UQ Toolkit (UQTk) version 3.1.5 +// Copyright (2024) NTESS // https://www.sandia.gov/UQToolkit/ // https://github.com/sandialabs/UQTk // -// Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +// Copyright 2024 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. // diff --git a/PyUQTk/inference/__init__.py b/PyUQTk/inference/__init__.py index 9c440a53..d90ff394 100755 --- a/PyUQTk/inference/__init__.py +++ b/PyUQTk/inference/__init__.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/inference/bayes_evid.py b/PyUQTk/inference/bayes_evid.py index c5df3e80..af9cfd8b 100644 --- a/PyUQTk/inference/bayes_evid.py +++ b/PyUQTk/inference/bayes_evid.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/inference/evidence_solvers.py b/PyUQTk/inference/evidence_solvers.py index a690e493..54ab67d8 100644 --- a/PyUQTk/inference/evidence_solvers.py +++ b/PyUQTk/inference/evidence_solvers.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/inference/mcmc.py b/PyUQTk/inference/mcmc.py index c0e2c906..9f2fbac5 100755 --- a/PyUQTk/inference/mcmc.py +++ b/PyUQTk/inference/mcmc.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/inference/postproc.py b/PyUQTk/inference/postproc.py index 20e45b67..125173f4 100755 --- a/PyUQTk/inference/postproc.py +++ b/PyUQTk/inference/postproc.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/kle/PyKle.cpp b/PyUQTk/kle/PyKle.cpp index 6d7099a4..1a224e81 100644 --- a/PyUQTk/kle/PyKle.cpp +++ b/PyUQTk/kle/PyKle.cpp @@ -1,11 +1,11 @@ //===================================================================================== // -// The UQ Toolkit (UQTk) version @UQTKVERSION@ -// Copyright (@UQTKYEAR@) NTESS +// The UQ Toolkit (UQTk) version 3.1.5 +// Copyright (2024) NTESS // https://www.sandia.gov/UQToolkit/ // https://github.com/sandialabs/UQTk // -// Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +// Copyright 2024 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. // diff --git a/PyUQTk/mcmc/mcmc.i b/PyUQTk/mcmc/mcmc.i index 5605c974..a68ed61d 100644 --- a/PyUQTk/mcmc/mcmc.i +++ b/PyUQTk/mcmc/mcmc.i @@ -1,12 +1,12 @@ %module(directors="1") mcmc //===================================================================================== // -// The UQ Toolkit (UQTk) version @UQTKVERSION@ -// Copyright (@UQTKYEAR@) NTESS +// The UQ Toolkit (UQTk) version 3.1.5 +// Copyright (2024) NTESS // https://www.sandia.gov/UQToolkit/ // https://github.com/sandialabs/UQTk // -// Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +// Copyright 2024 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. // diff --git a/PyUQTk/multirun/__init__.py b/PyUQTk/multirun/__init__.py index 3bbb361e..eea164a2 100755 --- a/PyUQTk/multirun/__init__.py +++ b/PyUQTk/multirun/__init__.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/multirun/multirun.py b/PyUQTk/multirun/multirun.py index 32ee9f16..2444fea9 100755 --- a/PyUQTk/multirun/multirun.py +++ b/PyUQTk/multirun/multirun.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/multirun/srun.x b/PyUQTk/multirun/srun.x index 6d8e92f6..bc9a73e6 100755 --- a/PyUQTk/multirun/srun.x +++ b/PyUQTk/multirun/srun.x @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/numpy/numpy.i b/PyUQTk/numpy/numpy.i index 9dd619e3..6523d6d6 100644 --- a/PyUQTk/numpy/numpy.i +++ b/PyUQTk/numpy/numpy.i @@ -1,12 +1,12 @@ /* -*- C -*- (not really, but good for syntax highlighting) */ //===================================================================================== // -// The UQ Toolkit (UQTk) version @UQTKVERSION@ -// Copyright (@UQTKYEAR@) NTESS +// The UQ Toolkit (UQTk) version 3.1.5 +// Copyright (2024) NTESS // https://www.sandia.gov/UQToolkit/ // https://github.com/sandialabs/UQTk // -// Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +// Copyright 2024 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. // diff --git a/PyUQTk/plotting/__init__.py b/PyUQTk/plotting/__init__.py index a7f955db..673c1b97 100755 --- a/PyUQTk/plotting/__init__.py +++ b/PyUQTk/plotting/__init__.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/plotting/fits.py b/PyUQTk/plotting/fits.py index 5d67a923..f686c894 100644 --- a/PyUQTk/plotting/fits.py +++ b/PyUQTk/plotting/fits.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/plotting/inout.py b/PyUQTk/plotting/inout.py index 5d69be93..59f96449 100644 --- a/PyUQTk/plotting/inout.py +++ b/PyUQTk/plotting/inout.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/plotting/pdfs.py b/PyUQTk/plotting/pdfs.py index 3764afc2..522e4f6e 100644 --- a/PyUQTk/plotting/pdfs.py +++ b/PyUQTk/plotting/pdfs.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/plotting/surrogate.py b/PyUQTk/plotting/surrogate.py index 18994ee9..8083c8b1 100644 --- a/PyUQTk/plotting/surrogate.py +++ b/PyUQTk/plotting/surrogate.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyArrayTest.py b/PyUQTk/pytests/PyArrayTest.py index 6aa21bb7..f5db1b44 100644 --- a/PyUQTk/pytests/PyArrayTest.py +++ b/PyUQTk/pytests/PyArrayTest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyArrayTest2.py b/PyUQTk/pytests/PyArrayTest2.py index 485293c2..fd862375 100644 --- a/PyUQTk/pytests/PyArrayTest2.py +++ b/PyUQTk/pytests/PyArrayTest2.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyBADPTest.py b/PyUQTk/pytests/PyBADPTest.py index fb759d12..069526a9 100644 --- a/PyUQTk/pytests/PyBADPTest.py +++ b/PyUQTk/pytests/PyBADPTest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyBCSTest.py b/PyUQTk/pytests/PyBCSTest.py index 40411eed..8b89b76c 100644 --- a/PyUQTk/pytests/PyBCSTest.py +++ b/PyUQTk/pytests/PyBCSTest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyBCSTest1D.py b/PyUQTk/pytests/PyBCSTest1D.py index d8702318..11704ace 100644 --- a/PyUQTk/pytests/PyBCSTest1D.py +++ b/PyUQTk/pytests/PyBCSTest1D.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyBCSTest2D.py b/PyUQTk/pytests/PyBCSTest2D.py index 3650c60a..e805bb89 100644 --- a/PyUQTk/pytests/PyBCSTest2D.py +++ b/PyUQTk/pytests/PyBCSTest2D.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyGalerkinTest.py b/PyUQTk/pytests/PyGalerkinTest.py index ec7a58e5..1e0d965b 100644 --- a/PyUQTk/pytests/PyGalerkinTest.py +++ b/PyUQTk/pytests/PyGalerkinTest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyHMCMCTest.py b/PyUQTk/pytests/PyHMCMCTest.py index 013f061c..4173e2d0 100644 --- a/PyUQTk/pytests/PyHMCMCTest.py +++ b/PyUQTk/pytests/PyHMCMCTest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyMCMC2dTest.py b/PyUQTk/pytests/PyMCMC2dTest.py index ecc9642f..0c65ec50 100644 --- a/PyUQTk/pytests/PyMCMC2dTest.py +++ b/PyUQTk/pytests/PyMCMC2dTest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyMCMCTest.py b/PyUQTk/pytests/PyMCMCTest.py index 896a7ca8..3cb241a3 100644 --- a/PyUQTk/pytests/PyMCMCTest.py +++ b/PyUQTk/pytests/PyMCMCTest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyModTest.py b/PyUQTk/pytests/PyModTest.py index 721d208a..8cb037ef 100644 --- a/PyUQTk/pytests/PyModTest.py +++ b/PyUQTk/pytests/PyModTest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyPCE1dTest.py b/PyUQTk/pytests/PyPCE1dTest.py index 299093f4..6ca0a736 100644 --- a/PyUQTk/pytests/PyPCE1dTest.py +++ b/PyUQTk/pytests/PyPCE1dTest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyPCE2dTest.py b/PyUQTk/pytests/PyPCE2dTest.py index bcf4e0c6..dad2537d 100644 --- a/PyUQTk/pytests/PyPCE2dTest.py +++ b/PyUQTk/pytests/PyPCE2dTest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyQuadTest.py b/PyUQTk/pytests/PyQuadTest.py index 3ebe939e..becee4c1 100644 --- a/PyUQTk/pytests/PyQuadTest.py +++ b/PyUQTk/pytests/PyQuadTest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pytests/PyRegressionTest.py b/PyUQTk/pytests/PyRegressionTest.py index 84b4e209..d483d95c 100644 --- a/PyUQTk/pytests/PyRegressionTest.py +++ b/PyUQTk/pytests/PyRegressionTest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/pyuqtkarray/pyuqtkarray_tools.py b/PyUQTk/pyuqtkarray/pyuqtkarray_tools.py index 45389715..0f57e80f 100644 --- a/PyUQTk/pyuqtkarray/pyuqtkarray_tools.py +++ b/PyUQTk/pyuqtkarray/pyuqtkarray_tools.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/sens/__init__.py b/PyUQTk/sens/__init__.py index 945570be..2085e655 100755 --- a/PyUQTk/sens/__init__.py +++ b/PyUQTk/sens/__init__.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/sens/gsalib.py b/PyUQTk/sens/gsalib.py index 01ec7756..2330635e 100644 --- a/PyUQTk/sens/gsalib.py +++ b/PyUQTk/sens/gsalib.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/sens/gsatest.py b/PyUQTk/sens/gsatest.py index 7f50a737..ce5efec4 100644 --- a/PyUQTk/sens/gsatest.py +++ b/PyUQTk/sens/gsatest.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/tmcmc/tmcmc.i b/PyUQTk/tmcmc/tmcmc.i index 88e0abee..c794397f 100644 --- a/PyUQTk/tmcmc/tmcmc.i +++ b/PyUQTk/tmcmc/tmcmc.i @@ -1,12 +1,12 @@ %module(directors="1") tmcmc //===================================================================================== // -// The UQ Toolkit (UQTk) version @UQTKVERSION@ -// Copyright (@UQTKYEAR@) NTESS +// The UQ Toolkit (UQTk) version 3.1.5 +// Copyright (2024) NTESS // https://www.sandia.gov/UQToolkit/ // https://github.com/sandialabs/UQTk // -// Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +// Copyright 2024 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. // diff --git a/PyUQTk/tools/pyTools.cpp b/PyUQTk/tools/pyTools.cpp index 45ad30d2..bd10549f 100644 --- a/PyUQTk/tools/pyTools.cpp +++ b/PyUQTk/tools/pyTools.cpp @@ -1,11 +1,11 @@ //===================================================================================== // -// The UQ Toolkit (UQTk) version @UQTKVERSION@ -// Copyright (@UQTKYEAR@) NTESS +// The UQ Toolkit (UQTk) version 3.1.5 +// Copyright (2024) NTESS // https://www.sandia.gov/UQToolkit/ // https://github.com/sandialabs/UQTk // -// Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +// Copyright 2024 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. // diff --git a/PyUQTk/utils/__init__.py b/PyUQTk/utils/__init__.py index 5f4cf004..91315b42 100755 --- a/PyUQTk/utils/__init__.py +++ b/PyUQTk/utils/__init__.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/utils/colors.py b/PyUQTk/utils/colors.py index ea1d28d5..fb0d602a 100644 --- a/PyUQTk/utils/colors.py +++ b/PyUQTk/utils/colors.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/utils/correlations.py b/PyUQTk/utils/correlations.py index fcc8bdc9..28f0c19a 100644 --- a/PyUQTk/utils/correlations.py +++ b/PyUQTk/utils/correlations.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/utils/crps.py b/PyUQTk/utils/crps.py index 0219c774..5bbd4f3a 100644 --- a/PyUQTk/utils/crps.py +++ b/PyUQTk/utils/crps.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/utils/func.py b/PyUQTk/utils/func.py index 305aee53..8df5f0ad 100755 --- a/PyUQTk/utils/func.py +++ b/PyUQTk/utils/func.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/utils/mindex_order.py b/PyUQTk/utils/mindex_order.py index 8846cbdf..c3ca3409 100644 --- a/PyUQTk/utils/mindex_order.py +++ b/PyUQTk/utils/mindex_order.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/utils/multiindex.py b/PyUQTk/utils/multiindex.py index 082f2752..6a91588d 100755 --- a/PyUQTk/utils/multiindex.py +++ b/PyUQTk/utils/multiindex.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/utils/pdf_kde.py b/PyUQTk/utils/pdf_kde.py index 1feb37bf..1e7cdf30 100755 --- a/PyUQTk/utils/pdf_kde.py +++ b/PyUQTk/utils/pdf_kde.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/PyUQTk/utils/regr.py b/PyUQTk/utils/regr.py index f2a13aae..78d6544a 100755 --- a/PyUQTk/utils/regr.py +++ b/PyUQTk/utils/regr.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/README.md b/README.md index 6a30e9f2..d7174e80 100644 --- a/README.md +++ b/README.md @@ -1,12 +1,12 @@ # Sandia National Labs -# Uncertainty Quantification Toolkit (UQTk) version @UQTKVERSION@ +# Uncertainty Quantification Toolkit (UQTk) version 3.1.5 #### Bert Debusschere, Caitlin Curry, Cosmin Safta, Katherine Johnston, Kenny Chowdhary, Khachik Sargsyan, Luke Boll, Mohammad Khalil, Prashant Rai, Tiernan Casey, Xiaoshu Zeng ## Overview The UQ Toolkit (UQTk) is a collection of libraries and tools for the quantification of uncertainty in numerical model predictions. Version -@UQTKVERSION@ offers Polynomial Chaos Expansions to represent random variables, +3.1.5 offers Polynomial Chaos Expansions to represent random variables, intrusive and non-intrusive methods for propagating uncertainties through computational models, tools for sensitivity analysis, methods for sparse surrogate construction, and Bayesian inference tools for inferring parameters diff --git a/config/config-gcc-Python.sh b/config/config-gcc-Python.sh index 7c5acf50..e7bae816 100755 --- a/config/config-gcc-Python.sh +++ b/config/config-gcc-Python.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # @@ -45,7 +45,7 @@ done # Adjust the UQTK_SRC_DIR to point to where the UQTk source directory is. Feel free # to update the desired installation directory as you prefer. UQTK_SRC_DIR=../UQTk-SNL -#../@UQTKSRCDIR@ +#../UQTk-SNL UQTK_INSTALL_DIR=$UQTK_SRC_DIR-install echo "This script assumes the UQTk source code is in $UQTK_SRC_DIR" diff --git a/config/config-gcc-base.sh b/config/config-gcc-base.sh index ab609766..90099444 100755 --- a/config/config-gcc-base.sh +++ b/config/config-gcc-base.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # @@ -44,7 +44,7 @@ done # Adjust the UQTK_SRC_DIR to point to where the UQTk source directory is. Feel free # to update the desired installation directory as you prefer. -UQTK_SRC_DIR=../@UQTKSRCDIR@ +UQTK_SRC_DIR=../UQTk-SNL UQTK_INSTALL_DIR=$UQTK_SRC_DIR-install echo "This script assumes the UQTk source code is in $UQTK_SRC_DIR" diff --git a/config/config-intel.sh b/config/config-intel.sh index 4cc1861a..a628fef6 100755 --- a/config/config-intel.sh +++ b/config/config-intel.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/config/config-options.sh b/config/config-options.sh index 8ca653ef..9c9b8fe9 100755 --- a/config/config-options.sh +++ b/config/config-options.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/cpp/app/dfi/dfi.cpp b/cpp/app/dfi/dfi.cpp index 76f91d96..58016149 100644 --- a/cpp/app/dfi/dfi.cpp +++ b/cpp/app/dfi/dfi.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/dfi/likelihood.cpp b/cpp/app/dfi/likelihood.cpp index 27c8d235..d832536a 100644 --- a/cpp/app/dfi/likelihood.cpp +++ b/cpp/app/dfi/likelihood.cpp @@ -1,12 +1,12 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/dfi/likelihood.h b/cpp/app/dfi/likelihood.h index 0b106b48..3a0d22a3 100644 --- a/cpp/app/dfi/likelihood.h +++ b/cpp/app/dfi/likelihood.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/dfi/model.cpp b/cpp/app/dfi/model.cpp index 2db5cf5d..0007150c 100644 --- a/cpp/app/dfi/model.cpp +++ b/cpp/app/dfi/model.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/dfi/model.h b/cpp/app/dfi/model.h index d32233f6..8caca4f3 100644 --- a/cpp/app/dfi/model.h +++ b/cpp/app/dfi/model.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/dfi/utils.cpp b/cpp/app/dfi/utils.cpp index 1c997004..329efa09 100644 --- a/cpp/app/dfi/utils.cpp +++ b/cpp/app/dfi/utils.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/dfi/utils.h b/cpp/app/dfi/utils.h index b22ed2b6..613d5bb5 100644 --- a/cpp/app/dfi/utils.h +++ b/cpp/app/dfi/utils.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/gen_mi/gen_mi.cpp b/cpp/app/gen_mi/gen_mi.cpp index 99e24e36..a12b6174 100644 --- a/cpp/app/gen_mi/gen_mi.cpp +++ b/cpp/app/gen_mi/gen_mi.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/generate_quad/generate_quad.cpp b/cpp/app/generate_quad/generate_quad.cpp index 9f560ee4..684a8cd8 100644 --- a/cpp/app/generate_quad/generate_quad.cpp +++ b/cpp/app/generate_quad/generate_quad.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/gkpSparse/gkpSparse.cpp b/cpp/app/gkpSparse/gkpSparse.cpp index 725b3b05..a9edf511 100644 --- a/cpp/app/gkpSparse/gkpSparse.cpp +++ b/cpp/app/gkpSparse/gkpSparse.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/gkpSparse/gkpclib.cpp b/cpp/app/gkpSparse/gkpclib.cpp index 25ce05f9..e0187b48 100644 --- a/cpp/app/gkpSparse/gkpclib.cpp +++ b/cpp/app/gkpSparse/gkpclib.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/gkpSparse/gkpflib.f b/cpp/app/gkpSparse/gkpflib.f index 43202d2f..d59dbbba 100644 --- a/cpp/app/gkpSparse/gkpflib.f +++ b/cpp/app/gkpSparse/gkpflib.f @@ -1,11 +1,11 @@ c$$$===================================================================================== c$$$ -c$$$ The UQ Toolkit (UQTk) version @UQTKVERSION@ -c$$$ Copyright (@UQTKYEAR@) NTESS +c$$$ The UQ Toolkit (UQTk) version 3.1.5 +c$$$ Copyright (2024) NTESS c$$$ https://www.sandia.gov/UQToolkit/ c$$$ https://github.com/sandialabs/UQTk c$$$ -c$$$ Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +c$$$ Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS). c$$$ Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government c$$$ retains certain rights in this software. c$$$ diff --git a/cpp/app/gkpSparse/gkplib.h b/cpp/app/gkpSparse/gkplib.h index fe435e3f..dff659b6 100644 --- a/cpp/app/gkpSparse/gkplib.h +++ b/cpp/app/gkpSparse/gkplib.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/gp_regr/gp_regr.cpp b/cpp/app/gp_regr/gp_regr.cpp index 65ba3f10..ee9e3fc7 100644 --- a/cpp/app/gp_regr/gp_regr.cpp +++ b/cpp/app/gp_regr/gp_regr.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/lr_eval/lr_eval.cpp b/cpp/app/lr_eval/lr_eval.cpp index 40b336cb..1e5855e7 100644 --- a/cpp/app/lr_eval/lr_eval.cpp +++ b/cpp/app/lr_eval/lr_eval.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/lr_regr/lr_regr.cpp b/cpp/app/lr_regr/lr_regr.cpp index d8e4ac66..6ed2a92a 100644 --- a/cpp/app/lr_regr/lr_regr.cpp +++ b/cpp/app/lr_regr/lr_regr.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/model_inf/model_inf.cpp b/cpp/app/model_inf/model_inf.cpp index 2cf8e097..e44628c5 100644 --- a/cpp/app/model_inf/model_inf.cpp +++ b/cpp/app/model_inf/model_inf.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/pce_eval/pce_eval.cpp b/cpp/app/pce_eval/pce_eval.cpp index f469518d..4f7cda1a 100644 --- a/cpp/app/pce_eval/pce_eval.cpp +++ b/cpp/app/pce_eval/pce_eval.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/pce_quad/pce_quad.cpp b/cpp/app/pce_quad/pce_quad.cpp index 1708d019..1104477d 100644 --- a/cpp/app/pce_quad/pce_quad.cpp +++ b/cpp/app/pce_quad/pce_quad.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/pce_resp/pce_resp.cpp b/cpp/app/pce_resp/pce_resp.cpp index 9d7b8f01..ba6312f7 100644 --- a/cpp/app/pce_resp/pce_resp.cpp +++ b/cpp/app/pce_resp/pce_resp.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/pce_rv/pce_rv.cpp b/cpp/app/pce_rv/pce_rv.cpp index 546307d6..9c843697 100644 --- a/cpp/app/pce_rv/pce_rv.cpp +++ b/cpp/app/pce_rv/pce_rv.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/pce_sens/pce_sens.cpp b/cpp/app/pce_sens/pce_sens.cpp index 74e1090d..7870e7b8 100644 --- a/cpp/app/pce_sens/pce_sens.cpp +++ b/cpp/app/pce_sens/pce_sens.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/pdf_cl/pdf_cl.cpp b/cpp/app/pdf_cl/pdf_cl.cpp index ec665292..c05c59dc 100644 --- a/cpp/app/pdf_cl/pdf_cl.cpp +++ b/cpp/app/pdf_cl/pdf_cl.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/regression/regression.cpp b/cpp/app/regression/regression.cpp index 723234cb..fa007031 100644 --- a/cpp/app/regression/regression.cpp +++ b/cpp/app/regression/regression.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/sens/sens.cpp b/cpp/app/sens/sens.cpp index cb349a6d..901d2e60 100644 --- a/cpp/app/sens/sens.cpp +++ b/cpp/app/sens/sens.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/app/sens/trdSpls.cpp b/cpp/app/sens/trdSpls.cpp index 8ae84530..5b7c4ee4 100644 --- a/cpp/app/sens/trdSpls.cpp +++ b/cpp/app/sens/trdSpls.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/amcmc/amcmc.cpp b/cpp/lib/amcmc/amcmc.cpp index 4d1d3b16..f31b3c49 100644 --- a/cpp/lib/amcmc/amcmc.cpp +++ b/cpp/lib/amcmc/amcmc.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/amcmc/amcmc.h b/cpp/lib/amcmc/amcmc.h index 4395d632..985cb7ef 100644 --- a/cpp/lib/amcmc/amcmc.h +++ b/cpp/lib/amcmc/amcmc.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/array/Array1D.h b/cpp/lib/array/Array1D.h index 76d0310a..31ef7825 100644 --- a/cpp/lib/array/Array1D.h +++ b/cpp/lib/array/Array1D.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/array/Array2D.h b/cpp/lib/array/Array2D.h index 56187c58..f2928010 100644 --- a/cpp/lib/array/Array2D.h +++ b/cpp/lib/array/Array2D.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/array/Array3D.h b/cpp/lib/array/Array3D.h index f35e54fd..28716852 100644 --- a/cpp/lib/array/Array3D.h +++ b/cpp/lib/array/Array3D.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/array/arrayio.cpp b/cpp/lib/array/arrayio.cpp index 29647f5b..ef04900c 100644 --- a/cpp/lib/array/arrayio.cpp +++ b/cpp/lib/array/arrayio.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/array/arrayio.h b/cpp/lib/array/arrayio.h index b83d24ee..afc30237 100644 --- a/cpp/lib/array/arrayio.h +++ b/cpp/lib/array/arrayio.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/array/arraytools.cpp b/cpp/lib/array/arraytools.cpp index 3ec08cd2..5eb29c05 100644 --- a/cpp/lib/array/arraytools.cpp +++ b/cpp/lib/array/arraytools.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/array/arraytools.h b/cpp/lib/array/arraytools.h index c997c2a1..94d0a049 100644 --- a/cpp/lib/array/arraytools.h +++ b/cpp/lib/array/arraytools.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/bcs/bcs.cpp b/cpp/lib/bcs/bcs.cpp index ab893419..a1aaffb8 100644 --- a/cpp/lib/bcs/bcs.cpp +++ b/cpp/lib/bcs/bcs.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/bcs/bcs.h b/cpp/lib/bcs/bcs.h index 05f66c65..d1c5f66d 100644 --- a/cpp/lib/bcs/bcs.h +++ b/cpp/lib/bcs/bcs.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/dfi/dfi.cpp b/cpp/lib/dfi/dfi.cpp index be3fbc8c..fa2a05d2 100644 --- a/cpp/lib/dfi/dfi.cpp +++ b/cpp/lib/dfi/dfi.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/dfi/dfi.h b/cpp/lib/dfi/dfi.h index 0b018616..3fb65122 100644 --- a/cpp/lib/dfi/dfi.h +++ b/cpp/lib/dfi/dfi.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/dfi/userFunctions.h b/cpp/lib/dfi/userFunctions.h index 320a21d2..347affc2 100644 --- a/cpp/lib/dfi/userFunctions.h +++ b/cpp/lib/dfi/userFunctions.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/gproc/gproc.cpp b/cpp/lib/gproc/gproc.cpp index 8e21c84b..3dbc339b 100644 --- a/cpp/lib/gproc/gproc.cpp +++ b/cpp/lib/gproc/gproc.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/gproc/gproc.h b/cpp/lib/gproc/gproc.h index 0d043dfa..e711867d 100644 --- a/cpp/lib/gproc/gproc.h +++ b/cpp/lib/gproc/gproc.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/include/depblas.h b/cpp/lib/include/depblas.h index d670562b..3bda342e 100644 --- a/cpp/lib/include/depblas.h +++ b/cpp/lib/include/depblas.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/include/deplapack.h b/cpp/lib/include/deplapack.h index c47102bb..26eb688b 100644 --- a/cpp/lib/include/deplapack.h +++ b/cpp/lib/include/deplapack.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/include/error_handlers.h b/cpp/lib/include/error_handlers.h index 5f5472c7..94fede6d 100644 --- a/cpp/lib/include/error_handlers.h +++ b/cpp/lib/include/error_handlers.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/include/ftndefs.h b/cpp/lib/include/ftndefs.h index eee0c253..7b1a87c7 100644 --- a/cpp/lib/include/ftndefs.h +++ b/cpp/lib/include/ftndefs.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/include/gen_defs.h b/cpp/lib/include/gen_defs.h index 7c2e38ef..0bc4a203 100644 --- a/cpp/lib/include/gen_defs.h +++ b/cpp/lib/include/gen_defs.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/include/uqtkconfig.h b/cpp/lib/include/uqtkconfig.h index fa5b9f4e..274ad8a8 100644 --- a/cpp/lib/include/uqtkconfig.h +++ b/cpp/lib/include/uqtkconfig.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/infer/inference.cpp b/cpp/lib/infer/inference.cpp index ed50d231..95cc04c6 100644 --- a/cpp/lib/infer/inference.cpp +++ b/cpp/lib/infer/inference.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/infer/inference.h b/cpp/lib/infer/inference.h index 4df4fa6c..774c6f1a 100644 --- a/cpp/lib/infer/inference.h +++ b/cpp/lib/infer/inference.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/infer/mrv.cpp b/cpp/lib/infer/mrv.cpp index c19f5dd7..f79aad9b 100644 --- a/cpp/lib/infer/mrv.cpp +++ b/cpp/lib/infer/mrv.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/infer/mrv.h b/cpp/lib/infer/mrv.h index d1434b3f..aac92744 100644 --- a/cpp/lib/infer/mrv.h +++ b/cpp/lib/infer/mrv.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/infer/post.cpp b/cpp/lib/infer/post.cpp index 1fa4865d..fe165848 100644 --- a/cpp/lib/infer/post.cpp +++ b/cpp/lib/infer/post.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/infer/post.h b/cpp/lib/infer/post.h index e975b8db..51739d21 100644 --- a/cpp/lib/infer/post.h +++ b/cpp/lib/infer/post.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/kle/kle.cpp b/cpp/lib/kle/kle.cpp index b1469386..f5d5868f 100644 --- a/cpp/lib/kle/kle.cpp +++ b/cpp/lib/kle/kle.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/kle/kle.h b/cpp/lib/kle/kle.h index 24c46f1b..aa30c870 100644 --- a/cpp/lib/kle/kle.h +++ b/cpp/lib/kle/kle.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/lowrank/lowrank.cpp b/cpp/lib/lowrank/lowrank.cpp index 42967603..3addca96 100644 --- a/cpp/lib/lowrank/lowrank.cpp +++ b/cpp/lib/lowrank/lowrank.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/lowrank/lowrank.h b/cpp/lib/lowrank/lowrank.h index 6f73636d..c4582b90 100644 --- a/cpp/lib/lowrank/lowrank.h +++ b/cpp/lib/lowrank/lowrank.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/lreg/lreg.cpp b/cpp/lib/lreg/lreg.cpp index 6b948a92..8ebed67f 100644 --- a/cpp/lib/lreg/lreg.cpp +++ b/cpp/lib/lreg/lreg.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/lreg/lreg.h b/cpp/lib/lreg/lreg.h index 5236858b..4a677be8 100644 --- a/cpp/lib/lreg/lreg.h +++ b/cpp/lib/lreg/lreg.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/mala/mala.cpp b/cpp/lib/mala/mala.cpp index b909b01d..d34d04cf 100644 --- a/cpp/lib/mala/mala.cpp +++ b/cpp/lib/mala/mala.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/mala/mala.h b/cpp/lib/mala/mala.h index aca09c2d..105bb4b3 100644 --- a/cpp/lib/mala/mala.h +++ b/cpp/lib/mala/mala.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/mcmc/mcmc.cpp b/cpp/lib/mcmc/mcmc.cpp index 95f7ec0b..27bcf65a 100644 --- a/cpp/lib/mcmc/mcmc.cpp +++ b/cpp/lib/mcmc/mcmc.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/mcmc/mcmc.h b/cpp/lib/mcmc/mcmc.h index fbc1f72b..b72d60d7 100644 --- a/cpp/lib/mcmc/mcmc.h +++ b/cpp/lib/mcmc/mcmc.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/mmala/mmala.cpp b/cpp/lib/mmala/mmala.cpp index 9895f730..0f703bb3 100644 --- a/cpp/lib/mmala/mmala.cpp +++ b/cpp/lib/mmala/mmala.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/mmala/mmala.h b/cpp/lib/mmala/mmala.h index d25d8783..5973311c 100644 --- a/cpp/lib/mmala/mmala.h +++ b/cpp/lib/mmala/mmala.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/pce/PCBasis.cpp b/cpp/lib/pce/PCBasis.cpp index 704afda5..3f3c718a 100644 --- a/cpp/lib/pce/PCBasis.cpp +++ b/cpp/lib/pce/PCBasis.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/pce/PCBasis.h b/cpp/lib/pce/PCBasis.h index cc0d98e8..a979e0b1 100644 --- a/cpp/lib/pce/PCBasis.h +++ b/cpp/lib/pce/PCBasis.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/pce/PCSet.cpp b/cpp/lib/pce/PCSet.cpp index df19b1d2..e85d9905 100644 --- a/cpp/lib/pce/PCSet.cpp +++ b/cpp/lib/pce/PCSet.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/pce/PCSet.h b/cpp/lib/pce/PCSet.h index a85243dd..44918d82 100644 --- a/cpp/lib/pce/PCSet.h +++ b/cpp/lib/pce/PCSet.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/quad/quad.cpp b/cpp/lib/quad/quad.cpp index 8ce7308e..57325ebe 100644 --- a/cpp/lib/quad/quad.cpp +++ b/cpp/lib/quad/quad.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/quad/quad.h b/cpp/lib/quad/quad.h index 6172d4c2..ef7a30b2 100644 --- a/cpp/lib/quad/quad.h +++ b/cpp/lib/quad/quad.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/sampling/lhs.cpp b/cpp/lib/sampling/lhs.cpp index dcf4b352..cd08de8f 100644 --- a/cpp/lib/sampling/lhs.cpp +++ b/cpp/lib/sampling/lhs.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/sampling/qmc.cpp b/cpp/lib/sampling/qmc.cpp index f342056f..61884d96 100644 --- a/cpp/lib/sampling/qmc.cpp +++ b/cpp/lib/sampling/qmc.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/sampling/sampling.hpp b/cpp/lib/sampling/sampling.hpp index b6b7cbb5..8996e5e7 100644 --- a/cpp/lib/sampling/sampling.hpp +++ b/cpp/lib/sampling/sampling.hpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/ss/ss.cpp b/cpp/lib/ss/ss.cpp index 66d5c3c8..293ae35d 100644 --- a/cpp/lib/ss/ss.cpp +++ b/cpp/lib/ss/ss.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/ss/ss.h b/cpp/lib/ss/ss.h index 42aa0132..1b7b1404 100644 --- a/cpp/lib/ss/ss.h +++ b/cpp/lib/ss/ss.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tmcmc/tmcmc.cpp b/cpp/lib/tmcmc/tmcmc.cpp index eb9b7092..ddb6d597 100644 --- a/cpp/lib/tmcmc/tmcmc.cpp +++ b/cpp/lib/tmcmc/tmcmc.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tmcmc/tmcmc.h b/cpp/lib/tmcmc/tmcmc.h index 4ef42944..01234d7e 100644 --- a/cpp/lib/tmcmc/tmcmc.h +++ b/cpp/lib/tmcmc/tmcmc.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/combin.cpp b/cpp/lib/tools/combin.cpp index 3f169f80..3f769164 100644 --- a/cpp/lib/tools/combin.cpp +++ b/cpp/lib/tools/combin.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/combin.h b/cpp/lib/tools/combin.h index 14b3bbbb..d91f0af7 100644 --- a/cpp/lib/tools/combin.h +++ b/cpp/lib/tools/combin.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/func.cpp b/cpp/lib/tools/func.cpp index 83ee3351..6724fa1c 100644 --- a/cpp/lib/tools/func.cpp +++ b/cpp/lib/tools/func.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/func.h b/cpp/lib/tools/func.h index 2672c8b3..5fb6a56a 100644 --- a/cpp/lib/tools/func.h +++ b/cpp/lib/tools/func.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/gq.cpp b/cpp/lib/tools/gq.cpp index a3ba33f2..6a0ebc0d 100644 --- a/cpp/lib/tools/gq.cpp +++ b/cpp/lib/tools/gq.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/gq.h b/cpp/lib/tools/gq.h index d814db5a..6aa0f513 100644 --- a/cpp/lib/tools/gq.h +++ b/cpp/lib/tools/gq.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/minmax.cpp b/cpp/lib/tools/minmax.cpp index 540d9996..c7b698b4 100644 --- a/cpp/lib/tools/minmax.cpp +++ b/cpp/lib/tools/minmax.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/minmax.h b/cpp/lib/tools/minmax.h index fdb4f0f2..b4352ec5 100644 --- a/cpp/lib/tools/minmax.h +++ b/cpp/lib/tools/minmax.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/multiindex.cpp b/cpp/lib/tools/multiindex.cpp index 6b3b938b..0ec655ea 100644 --- a/cpp/lib/tools/multiindex.cpp +++ b/cpp/lib/tools/multiindex.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/multiindex.h b/cpp/lib/tools/multiindex.h index 06050ecd..3c841f9f 100644 --- a/cpp/lib/tools/multiindex.h +++ b/cpp/lib/tools/multiindex.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/pcmaps.cpp b/cpp/lib/tools/pcmaps.cpp index c71e1c64..caa03147 100644 --- a/cpp/lib/tools/pcmaps.cpp +++ b/cpp/lib/tools/pcmaps.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/pcmaps.h b/cpp/lib/tools/pcmaps.h index bfa5fdb1..b763407b 100644 --- a/cpp/lib/tools/pcmaps.h +++ b/cpp/lib/tools/pcmaps.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/probability.cpp b/cpp/lib/tools/probability.cpp index 37c3bfbb..3db46f34 100644 --- a/cpp/lib/tools/probability.cpp +++ b/cpp/lib/tools/probability.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/probability.h b/cpp/lib/tools/probability.h index befcda9e..f1be8e67 100644 --- a/cpp/lib/tools/probability.h +++ b/cpp/lib/tools/probability.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/rosenblatt.cpp b/cpp/lib/tools/rosenblatt.cpp index 7cdf6566..ac8b946e 100644 --- a/cpp/lib/tools/rosenblatt.cpp +++ b/cpp/lib/tools/rosenblatt.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/rosenblatt.h b/cpp/lib/tools/rosenblatt.h index 6593dcf7..de57ed61 100644 --- a/cpp/lib/tools/rosenblatt.h +++ b/cpp/lib/tools/rosenblatt.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/tools.h b/cpp/lib/tools/tools.h index 8f5af209..157b145f 100644 --- a/cpp/lib/tools/tools.h +++ b/cpp/lib/tools/tools.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/tools/toolsf.f b/cpp/lib/tools/toolsf.f index 43202d2f..d59dbbba 100644 --- a/cpp/lib/tools/toolsf.f +++ b/cpp/lib/tools/toolsf.f @@ -1,11 +1,11 @@ c$$$===================================================================================== c$$$ -c$$$ The UQ Toolkit (UQTk) version @UQTKVERSION@ -c$$$ Copyright (@UQTKYEAR@) NTESS +c$$$ The UQ Toolkit (UQTk) version 3.1.5 +c$$$ Copyright (2024) NTESS c$$$ https://www.sandia.gov/UQToolkit/ c$$$ https://github.com/sandialabs/UQTk c$$$ -c$$$ Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +c$$$ Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS). c$$$ Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government c$$$ retains certain rights in this software. c$$$ diff --git a/cpp/lib/xmlutils/MyException.h b/cpp/lib/xmlutils/MyException.h index cfded7c8..1a371ec0 100644 --- a/cpp/lib/xmlutils/MyException.h +++ b/cpp/lib/xmlutils/MyException.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/xmlutils/Object.h b/cpp/lib/xmlutils/Object.h index c4f9e684..9b4732cb 100644 --- a/cpp/lib/xmlutils/Object.h +++ b/cpp/lib/xmlutils/Object.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/xmlutils/RefPtr.h b/cpp/lib/xmlutils/RefPtr.h index 34e80467..0783a46b 100644 --- a/cpp/lib/xmlutils/RefPtr.h +++ b/cpp/lib/xmlutils/RefPtr.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/xmlutils/XMLAttributeList.cpp b/cpp/lib/xmlutils/XMLAttributeList.cpp index 324dc428..3974b87e 100644 --- a/cpp/lib/xmlutils/XMLAttributeList.cpp +++ b/cpp/lib/xmlutils/XMLAttributeList.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/xmlutils/XMLAttributeList.h b/cpp/lib/xmlutils/XMLAttributeList.h index 1c5815ae..4b11bd89 100644 --- a/cpp/lib/xmlutils/XMLAttributeList.h +++ b/cpp/lib/xmlutils/XMLAttributeList.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/xmlutils/XMLElement.cpp b/cpp/lib/xmlutils/XMLElement.cpp index b7983e73..74268986 100644 --- a/cpp/lib/xmlutils/XMLElement.cpp +++ b/cpp/lib/xmlutils/XMLElement.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/xmlutils/XMLElement.h b/cpp/lib/xmlutils/XMLElement.h index 289b4727..f60b64ae 100644 --- a/cpp/lib/xmlutils/XMLElement.h +++ b/cpp/lib/xmlutils/XMLElement.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/xmlutils/XMLExpatParser.cpp b/cpp/lib/xmlutils/XMLExpatParser.cpp index 9aa06328..6ee102e5 100644 --- a/cpp/lib/xmlutils/XMLExpatParser.cpp +++ b/cpp/lib/xmlutils/XMLExpatParser.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/xmlutils/XMLExpatParser.h b/cpp/lib/xmlutils/XMLExpatParser.h index 2a80a198..41e98f09 100644 --- a/cpp/lib/xmlutils/XMLExpatParser.h +++ b/cpp/lib/xmlutils/XMLExpatParser.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/xmlutils/XMLParser.cpp b/cpp/lib/xmlutils/XMLParser.cpp index 27050caa..ebd3b31d 100644 --- a/cpp/lib/xmlutils/XMLParser.cpp +++ b/cpp/lib/xmlutils/XMLParser.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/xmlutils/XMLParser.h b/cpp/lib/xmlutils/XMLParser.h index 93e524fc..0b6ac41e 100644 --- a/cpp/lib/xmlutils/XMLParser.h +++ b/cpp/lib/xmlutils/XMLParser.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/xmlutils/XMLUtils.cpp b/cpp/lib/xmlutils/XMLUtils.cpp index 80239f85..bf995425 100644 --- a/cpp/lib/xmlutils/XMLUtils.cpp +++ b/cpp/lib/xmlutils/XMLUtils.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/lib/xmlutils/XMLUtils.h b/cpp/lib/xmlutils/XMLUtils.h index 591938c2..ff45c1e9 100644 --- a/cpp/lib/xmlutils/XMLUtils.h +++ b/cpp/lib/xmlutils/XMLUtils.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/Array1DMiscTest/main.cpp b/cpp/tests/Array1DMiscTest/main.cpp index 489f3cb0..c4de21d0 100644 --- a/cpp/tests/Array1DMiscTest/main.cpp +++ b/cpp/tests/Array1DMiscTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/Array2DMiscTest/main.cpp b/cpp/tests/Array2DMiscTest/main.cpp index 76e9e5e9..70448692 100644 --- a/cpp/tests/Array2DMiscTest/main.cpp +++ b/cpp/tests/Array2DMiscTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/ArrayDelColumn/main.cpp b/cpp/tests/ArrayDelColumn/main.cpp index 6dab7fe3..cb3afd4f 100644 --- a/cpp/tests/ArrayDelColumn/main.cpp +++ b/cpp/tests/ArrayDelColumn/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/ArrayReadAndWrite/main.cpp b/cpp/tests/ArrayReadAndWrite/main.cpp index 37d75c65..a6fd6683 100644 --- a/cpp/tests/ArrayReadAndWrite/main.cpp +++ b/cpp/tests/ArrayReadAndWrite/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/ArraySortTest/main.cpp b/cpp/tests/ArraySortTest/main.cpp index 7ec31bb1..31774e74 100644 --- a/cpp/tests/ArraySortTest/main.cpp +++ b/cpp/tests/ArraySortTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/BCS1dTest/main.cpp b/cpp/tests/BCS1dTest/main.cpp index 6dd74f04..b0305e4a 100644 --- a/cpp/tests/BCS1dTest/main.cpp +++ b/cpp/tests/BCS1dTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/BCS2dTest/main.cpp b/cpp/tests/BCS2dTest/main.cpp index db9259a2..8e1a3b46 100644 --- a/cpp/tests/BCS2dTest/main.cpp +++ b/cpp/tests/BCS2dTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/CorrTest/main.cpp b/cpp/tests/CorrTest/main.cpp index 78fed001..acb39012 100644 --- a/cpp/tests/CorrTest/main.cpp +++ b/cpp/tests/CorrTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/Deriv1dTest/main.cpp b/cpp/tests/Deriv1dTest/main.cpp index f84081b7..5cff4c22 100644 --- a/cpp/tests/Deriv1dTest/main.cpp +++ b/cpp/tests/Deriv1dTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/GradHessianTest/main.cpp b/cpp/tests/GradHessianTest/main.cpp index 89ee105e..e06c979b 100644 --- a/cpp/tests/GradHessianTest/main.cpp +++ b/cpp/tests/GradHessianTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/GradientPCETest/main.cpp b/cpp/tests/GradientPCETest/main.cpp index 89ee105e..e06c979b 100644 --- a/cpp/tests/GradientPCETest/main.cpp +++ b/cpp/tests/GradientPCETest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/Hessian2dTest/main.cpp b/cpp/tests/Hessian2dTest/main.cpp index 2f4c0ab5..535da14f 100644 --- a/cpp/tests/Hessian2dTest/main.cpp +++ b/cpp/tests/Hessian2dTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/LowRankRegrTest/main.cpp b/cpp/tests/LowRankRegrTest/main.cpp index 46a9697a..4fd597ff 100644 --- a/cpp/tests/LowRankRegrTest/main.cpp +++ b/cpp/tests/LowRankRegrTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/MCMC2dTest/main.cpp b/cpp/tests/MCMC2dTest/main.cpp index ea1069ba..3d4f1f6b 100644 --- a/cpp/tests/MCMC2dTest/main.cpp +++ b/cpp/tests/MCMC2dTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/MCMC2dTest/model.cpp b/cpp/tests/MCMC2dTest/model.cpp index 7cc30fa0..613f51e3 100644 --- a/cpp/tests/MCMC2dTest/model.cpp +++ b/cpp/tests/MCMC2dTest/model.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/MCMC2dTest/tmcmc_getLL.sh b/cpp/tests/MCMC2dTest/tmcmc_getLL.sh index 64e75e16..8dc7a6c3 100755 --- a/cpp/tests/MCMC2dTest/tmcmc_getLL.sh +++ b/cpp/tests/MCMC2dTest/tmcmc_getLL.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/cpp/tests/MCMC2dTest/tmcmc_getLP.sh b/cpp/tests/MCMC2dTest/tmcmc_getLP.sh index e5003177..b4ef922d 100755 --- a/cpp/tests/MCMC2dTest/tmcmc_getLP.sh +++ b/cpp/tests/MCMC2dTest/tmcmc_getLP.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/cpp/tests/MCMC2dTest/tmcmc_moveIntermediateFiles.sh b/cpp/tests/MCMC2dTest/tmcmc_moveIntermediateFiles.sh index 5d957922..f7680011 100755 --- a/cpp/tests/MCMC2dTest/tmcmc_moveIntermediateFiles.sh +++ b/cpp/tests/MCMC2dTest/tmcmc_moveIntermediateFiles.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/cpp/tests/MCMCNestedTest/main.cpp b/cpp/tests/MCMCNestedTest/main.cpp index 261c2a0e..f9ecdfc6 100644 --- a/cpp/tests/MCMCNestedTest/main.cpp +++ b/cpp/tests/MCMCNestedTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/MCMCRandomTest/main.cpp b/cpp/tests/MCMCRandomTest/main.cpp index f4a0962b..fee28817 100644 --- a/cpp/tests/MCMCRandomTest/main.cpp +++ b/cpp/tests/MCMCRandomTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/MultiIndexTest/main.cpp b/cpp/tests/MultiIndexTest/main.cpp index ab38e2be..0d4bced8 100644 --- a/cpp/tests/MultiIndexTest/main.cpp +++ b/cpp/tests/MultiIndexTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/PCE1dTest/main.cpp b/cpp/tests/PCE1dTest/main.cpp index a845ad4e..d9bcd395 100644 --- a/cpp/tests/PCE1dTest/main.cpp +++ b/cpp/tests/PCE1dTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/PCEImplTest/main.cpp b/cpp/tests/PCEImplTest/main.cpp index 60e82fa3..9b4a6006 100644 --- a/cpp/tests/PCEImplTest/main.cpp +++ b/cpp/tests/PCEImplTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/PCELogTest/main.cpp b/cpp/tests/PCELogTest/main.cpp index 8b6c098f..ba603ae7 100644 --- a/cpp/tests/PCELogTest/main.cpp +++ b/cpp/tests/PCELogTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/QuadLUTest/main.cpp b/cpp/tests/QuadLUTest/main.cpp index 70bb9cc5..27eb0f01 100644 --- a/cpp/tests/QuadLUTest/main.cpp +++ b/cpp/tests/QuadLUTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/SecondDeriv1dTest/main.cpp b/cpp/tests/SecondDeriv1dTest/main.cpp index 4d24a1fe..65dadca4 100644 --- a/cpp/tests/SecondDeriv1dTest/main.cpp +++ b/cpp/tests/SecondDeriv1dTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/TMCMC2dTest/main.cpp b/cpp/tests/TMCMC2dTest/main.cpp index b7f271bd..d59a2d23 100644 --- a/cpp/tests/TMCMC2dTest/main.cpp +++ b/cpp/tests/TMCMC2dTest/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/TMCMC2dTest/model.cpp b/cpp/tests/TMCMC2dTest/model.cpp index 7cc30fa0..613f51e3 100644 --- a/cpp/tests/TMCMC2dTest/model.cpp +++ b/cpp/tests/TMCMC2dTest/model.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/cpp/tests/TMCMC2dTest/tmcmc_getLL.sh b/cpp/tests/TMCMC2dTest/tmcmc_getLL.sh index 27e5c40a..77ceae8e 100755 --- a/cpp/tests/TMCMC2dTest/tmcmc_getLL.sh +++ b/cpp/tests/TMCMC2dTest/tmcmc_getLL.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/cpp/tests/TMCMC2dTest/tmcmc_getLP.sh b/cpp/tests/TMCMC2dTest/tmcmc_getLP.sh index ac0a95d4..b1089d2b 100755 --- a/cpp/tests/TMCMC2dTest/tmcmc_getLP.sh +++ b/cpp/tests/TMCMC2dTest/tmcmc_getLP.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/cpp/tests/TMCMC2dTest/tmcmc_moveIntermediateFiles.sh b/cpp/tests/TMCMC2dTest/tmcmc_moveIntermediateFiles.sh index 5d957922..f7680011 100755 --- a/cpp/tests/TMCMC2dTest/tmcmc_moveIntermediateFiles.sh +++ b/cpp/tests/TMCMC2dTest/tmcmc_moveIntermediateFiles.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/doc/doxy/UQTkCppDoxyConfig b/doc/doxy/UQTkCppDoxyConfig index 0c7551fe..caafc3aa 100644 --- a/doc/doxy/UQTkCppDoxyConfig +++ b/doc/doxy/UQTkCppDoxyConfig @@ -23,7 +23,7 @@ PROJECT_NAME = "UQTk: Uncertainty Quantification Toolkit" # This could be handy for archiving the generated documentation or # if some version control system is used. -PROJECT_NUMBER = @UQTKVERSION@ +PROJECT_NUMBER = 3.1.5 # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. diff --git a/docs/html/Array1D_8h.html b/docs/html/Array1D_8h.html new file mode 100644 index 00000000..f78e17e1 --- /dev/null +++ b/docs/html/Array1D_8h.html @@ -0,0 +1,99 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Array1D.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
Array1D.h File Reference
+
+
+ +

1D Array class for any type T +More...

+
#include <string>
+#include <string.h>
+#include <iostream>
+#include <vector>
+#include <fstream>
+#include <iterator>
+#include <algorithm>
+#include <typeinfo>
+#include "error_handlers.h"
+
+

Go to the source code of this file.

+ + + + + + + + + +

+Classes

class  Array1D< T >
 Stores data of any type T in a 1D array. More...
 
class  Array1D< int >
 
class  Array1D< double >
 
+

Detailed Description

+

1D Array class for any type T

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/Array1D_8h_source.html b/docs/html/Array1D_8h_source.html new file mode 100644 index 00000000..cc5b9be5 --- /dev/null +++ b/docs/html/Array1D_8h_source.html @@ -0,0 +1,965 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Array1D.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
Array1D.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
30
+
31#ifndef ARRAY1D_H_SEEN
+
32#define ARRAY1D_H_SEEN
+
33
+
34#include <string>
+
35#include <string.h>
+
36#include <iostream>
+
37#include <vector>
+
38#include <fstream>
+
39#include <iterator>
+
40#include <algorithm>
+
41#include <typeinfo>
+
42
+
43#include "error_handlers.h"
+
44
+
45using namespace std;
+
46
+
47// template<typename T> T max_test(T a, T b) { return a > b ? a : b; }
+
48
+
59//column major for fortran blas
+
60template<typename T>
+
+
61class Array1D{
+
62private:
+
63
+
64public:
+
65 // These two quantities used to be private but making them public
+
66 // allows for easy access to python interface as a "list"
+
67 int xsize_; // public (used to be private) size of vector
+
68 vector<T> data_; // public (used to be private) copy of data vector
+
69
+
71 Array1D(): xsize_(0) {};
+
72
+
+
74 Array1D(const int& nx): xsize_(nx) {
+
75 data_.resize(xsize_);
+
76 }
+
+
77
+
+
79 Array1D(const int& nx, const T& t): xsize_(nx) {
+
80 data_.resize(xsize_, t);
+
81 }
+
+
82
+
+
84 Array1D& operator=(const Array1D &obj) {
+
85 xsize_ = obj.xsize_;
+
86 data_ = obj.data_;
+
87 return *this;
+
88 }
+
+
89
+
91 Array1D(const Array1D &obj): xsize_(obj.xsize_), data_(obj.data_) {};
+
92
+
94 ~Array1D() {data_.clear();}
+
95
+
+
97 void Clear() {
+
98 xsize_ = 0;
+
99 data_.clear();
+
100 }
+
+
101
+
103 int XSize() const {return xsize_;}
+
104
+
106 int Length() const {return xsize_;}
+
107
+
+
109 void Resize(const int& nx) {
+
110 xsize_ = nx;
+
111 data_.resize(xsize_);
+
112 }
+
+
113
+
+
116 void Resize(const int& nx, const T& t) {
+
117 data_.clear();
+
118 xsize_ = nx;
+
119 data_.resize(xsize_, t);
+
120 }
+
+
121
+
+
123 void SetValue(const T& t){
+
124 for(int i=0; i < data_.size(); i++){
+
125 data_[i] = t;
+
126 }
+
127 }
+
+
128
+
+
130 void PushBack(const T& t){
+
131 xsize_ += 1;
+
132 data_.push_back(t);
+
133 }
+
+
134
+
+
138 T* GetArrayPointer() {
+
139 return &(data_[0]);
+
140 }
+
+
141
+
+
145 const T* GetConstArrayPointer() const {
+
146 return &(data_[0]);
+
147 }
+
+
148
+
149 // allows access element by element, e.g. this(i) gives data_[i]
+
150 T& operator()(int ix) {return data_[ix];}
+
151 const T& operator()(int ix) const {return data_[ix];}
+
152
+
+
155 void insert(Array1D<T>& insarr,int ix){
+
156 /*if (ix<0 || ix>xsize_){
+
157 throw Tantrum("Array1D:insert():: insert index out of bounds.");
+
158 }*/
+
159 int addsize = insarr.Length();
+
160 xsize_+=addsize;
+
161 T* ptr=insarr.GetArrayPointer();
+
162 data_.insert(data_.begin()+ix,ptr,ptr+addsize);
+
163 }
+
+
164
+
+
167 void insert(const T& insval,int ix){
+
168 /*if (ix<0 || ix>xsize_)
+
169 throw Tantrum("Array1D:insert():: insert index out of bounds.");*/
+
170 xsize_+=1;
+
171 data_.insert(data_.begin()+ix,insval);
+
172 }
+
+
173
+
+
175 void erase(int ix){
+
176 /*if (ix<0 || ix>=xsize_)
+
177 throw Tantrum("Array1D:erase():: erase index out of bounds.");*/
+
178 xsize_-=1;
+
179 data_.erase(data_.begin()+ix);
+
180 }
+
+
181
+
+
183 void DumpBinary(FILE* f_out) const {
+
184 fwrite(&xsize_,sizeof(xsize_),1,f_out);
+
185 fwrite(this->GetConstArrayPointer(),sizeof(T),xsize_,f_out);
+
186 }
+
+
187
+
+
189 void ReadBinary(FILE* f_in){
+
190 fread(&xsize_,sizeof(xsize_),1,f_in);
+
191 data_.resize(xsize_);
+
192 fread(this->GetArrayPointer(),sizeof(T),xsize_,f_in);
+
193 }
+
+
194
+
195 /**********************************************************
+
196 // Methods for interfacing with python
+
197 **********************************************************/
+
198
+
199 // For calling [] in Python
+
200 T& operator[](int i) {return data_[i];}
+
201
+
202 // For calling shape in Python
+
+
203 vector<int> shape(){
+
204 vector<int> s (1,0);
+
205 s[0] = this -> XSize();
+
206 return s;
+
207 }
+
+
208
+
209 // For assigning a value to a specified index in the array
+
+
210 void assign(const int x,const T val){
+
211 data_[x] = val;
+
212 }
+
+
213
+
215 // cannot be read with numpy's fromfile after creation
+
+
216 void DumpBinary(char *filename){
+
217 FILE *f_out;
+
218 f_out = fopen(filename,"wb");
+
219 fwrite(&xsize_,sizeof(xsize_),1,f_out);
+
220 fwrite(this->GetConstArrayPointer(),sizeof(T),xsize_,f_out);
+
221 fclose(f_out);
+
222 }
+
+
223
+
224 // read binary file created with DumpBinary
+
225 // Cannot use numpy's from files
+
226 // only for use in c++
+
+
227 void ReadBinary(char *filename){
+
228 FILE *f_in;
+
229 f_in = fopen(filename,"rb");
+
230 fread(&xsize_,sizeof(xsize_),1,f_in);
+
231 data_.resize(xsize_);
+
232 fread(this->GetArrayPointer(),sizeof(T),xsize_,f_in);
+
233 fclose(f_in);
+
234 }
+
+
235
+
236 // Following two methods are not compatable with certain clang comilers
+
237 // creates binary file that can be read with numpy's fromfile
+
+
238 void DumpBinary4py(char *filename){
+
239 ofstream f_out;
+
240 f_out.open(filename, ios::out | ios::binary);
+
241 f_out.write((char*)this->GetArrayPointer(),sizeof(T[xsize_])); // convert array pointer to char string
+
242 f_out.close();
+
243 }
+
+
244
+
245 // can read in DumpBinary4py output, but needs size of vector
+
246 // fromfile can automatically detect size file, so, if need by, one can use numpy's fromfile to determine # of elements
+
+
247 void ReadBinary4py(char *filename, int n){
+
248 xsize_ = n;
+
249 ifstream f_in;
+
250 f_in.open(filename, ios::in | ios::binary);
+
251 f_in.read((char*)this->GetArrayPointer(),sizeof(T[xsize_])); // convert array pointer to char string
+
252 f_in.close();
+
253 }
+
+
254
+
255 // Set user-defined list to data_ vector
+
256 // This will work even for string type
+
+
257 void setArray(vector<T> inarray){
+
258 data_ = inarray;
+
259 xsize_ = inarray.size();
+
260 }
+
+
261
+
262 // Returns data_ vector as a list in python
+
263 // Also acts as a print to see individual elements
+
+
264 vector<T> flatten(){
+
265 return data_;
+
266 }
+
+
267
+
+
268 string type(){
+
269 return "string";
+
270 }
+
+
271};
+
+
272
+
273template<>
+
+
274class Array1D <int>{
+
275private:
+
276 int xsize_; // private size of vector
+
277public:
+
278 vector<int> data_; // private copy of data vector
+
279
+
281 Array1D(): xsize_(0) {};
+
282
+
+
284 Array1D(const int& nx): xsize_(nx) {
+
285 data_.resize(xsize_);
+
286 }
+
+
287
+
+
289 Array1D(const int& nx, const int& t): xsize_(nx) {
+
290 data_.resize(xsize_, t);
+
291 }
+
+
292
+
+
294 Array1D& operator=(const Array1D &obj) {
+
295 xsize_ = obj.xsize_;
+
296 data_ = obj.data_;
+
297 return *this;
+
298 }
+
+
299
+
301 Array1D(const Array1D &obj): xsize_(obj.xsize_), data_(obj.data_) {};
+
302
+
304 ~Array1D() {data_.clear();}
+
305
+
+
307 void Clear() {
+
308 xsize_ = 0;
+
309 data_.clear();
+
310 }
+
+
311
+
313 int XSize() const {return xsize_;}
+
314
+
316 int Length() const {return xsize_;}
+
317
+
+
319 void Resize(const int& nx) {
+
320 xsize_ = nx;
+
321 data_.resize(xsize_);
+
322 }
+
+
323
+
+
326 void Resize(const int& nx, const int& t) {
+
327 data_.clear();
+
328 xsize_ = nx;
+
329 data_.resize(xsize_, t);
+
330 }
+
+
331
+
+
333 void SetValue(const int& t){
+
334 for(int i=0; i < (int)data_.size(); i++){
+
335 data_[i] = t;
+
336 }
+
337 }
+
+
338
+
+
340 void PushBack(const int& t){
+
341 xsize_ += 1;
+
342 data_.push_back(t);
+
343 }
+
+
344
+
+
348 int* GetArrayPointer() {
+
349 return &(data_[0]);
+
350 }
+
+
351
+
+
355 const int* GetConstArrayPointer() const {
+
356 return &(data_[0]);
+
357 }
+
+
358
+
359 // allows access element by element, e.g. this(i) gives data_[i]
+
360 int& operator()(int ix) {return data_[ix];}
+
361 const int& operator()(int ix) const {return data_[ix];}
+
362
+
+
365 void insert(Array1D<int>& insarr,int ix){
+
366 /*if (ix<0 || ix>xsize_){
+
367 throw Tantrum("Array1D:insert():: insert index out of bounds.");
+
368 }*/
+
369 int addsize = insarr.Length();
+
370 xsize_+=addsize;
+
371 int* ptr=insarr.GetArrayPointer();
+
372 data_.insert(data_.begin()+ix,ptr,ptr+addsize);
+
373 }
+
+
374
+
+
377 void insert(const int& insval,int ix){
+
378 /*if (ix<0 || ix>xsize_)
+
379 throw Tantrum("Array1D:insert():: insert index out of bounds.");*/
+
380 xsize_+=1;
+
381 data_.insert(data_.begin()+ix,insval);
+
382 }
+
+
383
+
+
385 void erase(int ix){
+
386 /*if (ix<0 || ix>=xsize_)
+
387 throw Tantrum("Array1D:erase():: erase index out of bounds.");*/
+
388 xsize_-=1;
+
389 data_.erase(data_.begin()+ix);
+
390 }
+
+
391
+
+
393 void DumpBinary(FILE* f_out) const {
+
394 fwrite(&xsize_,sizeof(xsize_),1,f_out);
+
395 fwrite(this->GetConstArrayPointer(),sizeof(int),xsize_,f_out);
+
396 }
+
+
397
+
+
399 void ReadBinary(FILE* f_in){
+
400 fread(&xsize_,sizeof(xsize_),1,f_in);
+
401 data_.resize(xsize_);
+
402 fread(this->GetArrayPointer(),sizeof(int),xsize_,f_in);
+
403 }
+
+
404
+
405 /**********************************************************
+
406 // Methods for interfacing with python
+
407 **********************************************************/
+
408
+
409 // For calling [] in Python
+
410 int& operator[](int i) {return data_[i];}
+
411
+
412 // For calling shape in Python
+
+
413 vector<int> shape(){
+
414 vector<int> s (1,0);
+
415 s[0] = this -> XSize();
+
416 return s;
+
417 }
+
+
418
+
419 // For assigning a value to a specified index in the array
+
+
420 void assign(const int x,const int val){
+
421 data_[x] = val;
+
422 }
+
+
423
+
425 // cannot be read with numpy's fromfile after creation
+
+
426 void DumpBinary(char *filename){
+
427 FILE *f_out;
+
428 f_out = fopen(filename,"wb");
+
429 fwrite(&xsize_,sizeof(xsize_),1,f_out);
+
430 fwrite(this->GetConstArrayPointer(),sizeof(int),xsize_,f_out);
+
431 fclose(f_out);
+
432 }
+
+
433
+
434 // read binary file created with DumpBinary
+
435 // Cannot use numpy's from files
+
436 // only for use in c++
+
+
437 void ReadBinary(char *filename){
+
438 FILE *f_in;
+
439 f_in = fopen(filename,"rb");
+
440 fread(&xsize_,sizeof(xsize_),1,f_in);
+
441 data_.resize(xsize_);
+
442 fread(this->GetArrayPointer(),sizeof(int),xsize_,f_in);
+
443 fclose(f_in);
+
444 }
+
+
445
+
446 // creates binary file that can be read with numpy's fromfile
+
+
447 void DumpBinary4py(char *filename){
+
448 ofstream f_out;
+
449 f_out.open(filename, ios::out | ios::binary);
+
450 f_out.write((char*)this->GetArrayPointer(),xsize_*sizeof(int)); // convert array pointer to char string
+
451 f_out.close();
+
452 }
+
+
453
+
454 // can read in DumpBinary4py output, but needs size of vector
+
455 // fromfile can automatically detect size file, so, if need by, one can use numpy's fromfile to determine # of elements
+
+
456 void ReadBinary4py(char *filename, int n){
+
457 xsize_ = n;
+
458 ifstream f_in;
+
459 f_in.open(filename, ios::in | ios::binary);
+
460 f_in.read((char*)this->GetArrayPointer(),xsize_*sizeof(int)); // convert array pointer to char string
+
461 f_in.close();
+
462 }
+
+
463
+
464 // Set user-defined list to data_ vector
+
465 // This will work even for string type
+
+
466 void setArray(vector<int> inarray){
+
467 data_ = inarray;
+
468 xsize_ = inarray.size();
+
469 }
+
+
470
+
471 // // Sets user-defined 1d numpy array to data_ vector
+
+
472 void setnpintArray(vector<int> inarray, int n){
+
473 xsize_ = n;
+
474 data_.clear();
+
475 for(int i = 0; i < n; ++i){
+
476 data_.push_back(inarray[i]);
+
477 }
+
478 }
+
+
479 // This is not to be used for a string type
+
+
480 void getnpintArray(long * outarray){
+
481 // xsize_ = n;
+
482 // data_.assign(inarray,inarray+n);
+
483 copy(data_.begin(), data_.end(), outarray);
+
484 }
+
+
485
+
486 // Returns data_ vector as a list in python
+
487 // Also acts as a print to see individual elements
+
+
488 vector<int> flatten(){
+
489 return data_;
+
490 }
+
+
491
+
+
492 string type(){
+
493 return "int";
+
494 }
+
+
495
+
496};
+
+
497
+
498template<>
+
+
499class Array1D <double> {
+
500private:
+
501 int xsize_; // private size of vector
+
502public:
+
503 vector<double> data_; // private copy of data vector
+
504
+
505
+
507 Array1D(): xsize_(0) {};
+
508
+
+
510 Array1D(const int& nx): xsize_(nx) {
+
511 data_.resize(xsize_);
+
512 }
+
+
513
+
+
515 Array1D(const int& nx, const double& t): xsize_(nx) {
+
516 data_.resize(xsize_, t);
+
517 }
+
+
518
+
+
520 Array1D& operator=(const Array1D &obj) {
+
521 xsize_ = obj.xsize_;
+
522 data_ = obj.data_;
+
523 return *this;
+
524 }
+
+
525
+
527 Array1D(const Array1D &obj): xsize_(obj.xsize_), data_(obj.data_) {};
+
528
+
530 ~Array1D() {data_.clear();}
+
531
+
+
533 void Clear() {
+
534 xsize_ = 0;
+
535 data_.clear();
+
536 }
+
+
537
+
539 int XSize() const {return xsize_;}
+
540
+
542 int Length() const {return xsize_;}
+
543
+
+
545 void Resize(const int& nx) {
+
546 xsize_ = nx;
+
547 data_.resize(xsize_);
+
548 }
+
+
549
+
+
552 void Resize(const int& nx, const double& t) {
+
553 data_.clear();
+
554 xsize_ = nx;
+
555 data_.resize(xsize_, t);
+
556 }
+
+
557
+
+
559 void SetValue(const double& t){
+
560 for(int i=0; i < (int)data_.size(); i++){
+
561 data_[i] = t;
+
562 }
+
563 }
+
+
564
+
+
566 void PushBack(const double& t){
+
567 xsize_ += 1;
+
568 data_.push_back(t);
+
569 }
+
+
570
+
+
574 double* GetArrayPointer() {
+
575 return &(data_[0]);
+
576 }
+
+
577
+
+
581 const double* GetConstArrayPointer() const {
+
582 return &(data_[0]);
+
583 }
+
+
584
+
585 // allows access element by element, e.g. this(i) gives data_[i]
+
586 double& operator()(int ix) {return data_[ix];}
+
587 const double& operator()(int ix) const {return data_[ix];}
+
588
+
+
591 void insert(Array1D<double>& insarr,int ix){
+
592 /*if (ix<0 || ix>xsize_){
+
593 throw Tantrum("Array1D:insert():: insert index out of bounds.");
+
594 }*/
+
595 int addsize = insarr.Length();
+
596 xsize_+=addsize;
+
597 double* ptr=insarr.GetArrayPointer();
+
598 data_.insert(data_.begin()+ix,ptr,ptr+addsize);
+
599 }
+
+
600
+
+
603 void insert(const double& insval,int ix){
+
604 /*if (ix<0 || ix>xsize_)
+
605 throw Tantrum("Array1D:insert():: insert index out of bounds.");*/
+
606 xsize_+=1;
+
607 data_.insert(data_.begin()+ix,insval);
+
608 }
+
+
609
+
+
611 void erase(int ix){
+
612 /*if (ix<0 || ix>=xsize_)
+
613 throw Tantrum("Array1D:erase():: erase index out of bounds.");*/
+
614 xsize_-=1;
+
615 data_.erase(data_.begin()+ix);
+
616 }
+
+
617
+
+
619 void DumpBinary(FILE* f_out) const {
+
620 fwrite(&xsize_,sizeof(xsize_),1,f_out);
+
621 fwrite(this->GetConstArrayPointer(),sizeof(double),xsize_,f_out);
+
622 }
+
+
623
+
+
625 void ReadBinary(FILE* f_in){
+
626 fread(&xsize_,sizeof(xsize_),1,f_in);
+
627 data_.resize(xsize_);
+
628 fread(this->GetArrayPointer(),sizeof(double),xsize_,f_in);
+
629 }
+
+
630
+
631 /**********************************************************
+
632 // Methods for interfacing with python
+
633 **********************************************************/
+
634
+
635 // For calling [] in Python
+
636 double& operator[](int i) {return data_[i];}
+
637
+
638 // For calling shape in Python
+
+
639 vector<int> shape(){
+
640 vector<int> s (1,0);
+
641 s[0] = this -> XSize();
+
642 return s;
+
643 }
+
+
644
+
645 // For assigning a value to a specified index in the array
+
+
646 void assign(const int x,const double val){
+
647 data_[x] = val;
+
648 }
+
+
649
+
651 // cannot be read with numpy's fromfile after creation
+
+
652 void DumpBinary(char *filename){
+
653 FILE *f_out;
+
654 f_out = fopen(filename,"wb");
+
655 fwrite(&xsize_,sizeof(xsize_),1,f_out);
+
656 fwrite(this->GetConstArrayPointer(),sizeof(double),xsize_,f_out);
+
657 fclose(f_out);
+
658 }
+
+
659
+
660 // read binary file created with DumpBinary
+
661 // Cannot use numpy's from files
+
662 // only for use in c++
+
+
663 void ReadBinary(char *filename){
+
664 FILE *f_in;
+
665 f_in = fopen(filename,"rb");
+
666 fread(&xsize_,sizeof(xsize_),1,f_in);
+
667 data_.resize(xsize_);
+
668 fread(this->GetArrayPointer(),sizeof(double),xsize_,f_in);
+
669 fclose(f_in);
+
670 }
+
+
671
+
672 // creates binary file that can be read with numpy's fromfile
+
+
673 void DumpBinary4py(char *filename){
+
674 ofstream f_out;
+
675 f_out.open(filename, ios::out | ios::binary);
+
676 f_out.write((char*)this->GetArrayPointer(),xsize_*sizeof(double)); // convert array pointer to char string
+
677 f_out.close();
+
678 }
+
+
679
+
680 // can read in DumpBinary4py output, but needs size of vector
+
681 // fromfile can automatically detect size file, so, if need by, one can use numpy's fromfile to determine # of elements
+
+
682 void ReadBinary4py(char *filename, int n){
+
683 xsize_ = n;
+
684 ifstream f_in;
+
685 f_in.open(filename, ios::in | ios::binary);
+
686 f_in.read((char*)this->GetArrayPointer(),xsize_*sizeof(double)); // convert array pointer to char string
+
687 f_in.close();
+
688 }
+
+
689
+
690 // Set user-defined list to data_ vector
+
691 // This will work even for string type
+
+
692 void setArray(vector<double> inarray){
+
693 data_ = inarray;
+
694 xsize_ = inarray.size();
+
695 }
+
+
696
+
697 // Sets user-defined 1d numpy array to data_ vector
+
698 // This is not to be used for a string type
+
+
699 void setnpdblArray(vector<double> inarray, int n){
+
700 xsize_ = n;
+
701 data_.clear();
+
702 for(int i = 0; i < n; ++i){
+
703 data_.push_back(inarray[i]);
+
704 }
+
705 }
+
+
706 // Sets user-defined 1d numpy array to data_ vector
+
707 // This is not to be used for a string type
+
+
708 void getnpdblArray(double* outarray){
+
709 // xsize_ = n;
+
710 // data_.assign(inarray,inarray+n);
+
711 copy(data_.begin(), data_.end(), outarray);
+
712 }
+
+
713
+
714 // Returns data_ vector as a list in python
+
715 // Also acts as a print to see individual elements
+
+
716 vector<double> flatten(){
+
717 return data_;
+
718 }
+
+
719
+
+
720 string type(){
+
721 return "double";
+
722 }
+
+
723};
+
+
724
+
725#endif /* ARRAY1D_H_SEEN */
+
copy
Array1D< double > copy(Array1D< double > &in_array)
Returns a copy of 1D array.
Definition arraytools.cpp:1607
+
Array1D< double >::Array1D
Array1D()
Default constructor, which does not allocate any memory.
Definition Array1D.h:507
+
Array1D< double >::flatten
vector< double > flatten()
Definition Array1D.h:716
+
Array1D< double >::PushBack
void PushBack(const double &t)
Add element to the end of the vector.
Definition Array1D.h:566
+
Array1D< double >::ReadBinary
void ReadBinary(char *filename)
Definition Array1D.h:663
+
Array1D< double >::assign
void assign(const int x, const double val)
Definition Array1D.h:646
+
Array1D< double >::operator()
double & operator()(int ix)
Definition Array1D.h:586
+
Array1D< double >::ReadBinary4py
void ReadBinary4py(char *filename, int n)
Definition Array1D.h:682
+
Array1D< double >::Clear
void Clear()
Function to clear the memory.
Definition Array1D.h:533
+
Array1D< double >::operator()
const double & operator()(int ix) const
Definition Array1D.h:587
+
Array1D< double >::DumpBinary
void DumpBinary(char *filename)
Dump contents of the array to a file in binary format.
Definition Array1D.h:652
+
Array1D< double >::insert
void insert(const double &insval, int ix)
Insert a given value to the position ix.
Definition Array1D.h:603
+
Array1D< double >::XSize
int XSize() const
Returns size in the x-direction.
Definition Array1D.h:539
+
Array1D< double >::operator=
Array1D & operator=(const Array1D &obj)
Assignment operator copies the data structure by value.
Definition Array1D.h:520
+
Array1D< double >::SetValue
void SetValue(const double &t)
Set all values in the array to the given value.
Definition Array1D.h:559
+
Array1D< double >::Length
int Length() const
Returns length (i.e. size in the x-direction)
Definition Array1D.h:542
+
Array1D< double >::Resize
void Resize(const int &nx, const double &t)
Resizes the array and sets ALL entries to the specified value.
Definition Array1D.h:552
+
Array1D< double >::DumpBinary4py
void DumpBinary4py(char *filename)
Definition Array1D.h:673
+
Array1D< double >::GetArrayPointer
double * GetArrayPointer()
Return a pointer to the first element of the data in the vector so we can use it access the data in a...
Definition Array1D.h:574
+
Array1D< double >::Resize
void Resize(const int &nx)
Resizes the array.
Definition Array1D.h:545
+
Array1D< double >::GetConstArrayPointer
const double * GetConstArrayPointer() const
Return a const point to the first element of the data in the vector so we can use it access the data ...
Definition Array1D.h:581
+
Array1D< double >::getnpdblArray
void getnpdblArray(double *outarray)
Definition Array1D.h:708
+
Array1D< double >::Array1D
Array1D(const int &nx, const double &t)
Constructor that allocates and initializes the data to a value t.
Definition Array1D.h:515
+
Array1D< double >::xsize_
int xsize_
Definition Array1D.h:501
+
Array1D< double >::DumpBinary
void DumpBinary(FILE *f_out) const
Dump contents of the array to a file in binary format.
Definition Array1D.h:619
+
Array1D< double >::operator[]
double & operator[](int i)
Definition Array1D.h:636
+
Array1D< double >::setArray
void setArray(vector< double > inarray)
Definition Array1D.h:692
+
Array1D< double >::Array1D
Array1D(const int &nx)
Constructor that allocates the memory.
Definition Array1D.h:510
+
Array1D< double >::setnpdblArray
void setnpdblArray(vector< double > inarray, int n)
Definition Array1D.h:699
+
Array1D< double >::type
string type()
Definition Array1D.h:720
+
Array1D< double >::shape
vector< int > shape()
Definition Array1D.h:639
+
Array1D< double >::Array1D
Array1D(const Array1D &obj)
Copy constructor.
Definition Array1D.h:527
+
Array1D< double >::erase
void erase(int ix)
Erase the value from the position ix.
Definition Array1D.h:611
+
Array1D< double >::ReadBinary
void ReadBinary(FILE *f_in)
Read contents of the array from a file in binary format.
Definition Array1D.h:625
+
Array1D< double >::data_
vector< double > data_
Definition Array1D.h:503
+
Array1D< double >::~Array1D
~Array1D()
Destructor that frees up the memory.
Definition Array1D.h:530
+
Array1D< double >::insert
void insert(Array1D< double > &insarr, int ix)
Insert a given array to the position ix.
Definition Array1D.h:591
+
Array1D< int >::Array1D
Array1D(const int &nx, const int &t)
Constructor that allocates and initializes the data to a value t.
Definition Array1D.h:289
+
Array1D< int >::type
string type()
Definition Array1D.h:492
+
Array1D< int >::insert
void insert(const int &insval, int ix)
Insert a given value to the position ix.
Definition Array1D.h:377
+
Array1D< int >::Clear
void Clear()
Function to clear the memory.
Definition Array1D.h:307
+
Array1D< int >::erase
void erase(int ix)
Erase the value from the position ix.
Definition Array1D.h:385
+
Array1D< int >::data_
vector< int > data_
Definition Array1D.h:278
+
Array1D< int >::flatten
vector< int > flatten()
Definition Array1D.h:488
+
Array1D< int >::operator=
Array1D & operator=(const Array1D &obj)
Assignment operator copies the data structure by value.
Definition Array1D.h:294
+
Array1D< int >::DumpBinary
void DumpBinary(char *filename)
Dump contents of the array to a file in binary format.
Definition Array1D.h:426
+
Array1D< int >::Resize
void Resize(const int &nx)
Resizes the array.
Definition Array1D.h:319
+
Array1D< int >::DumpBinary4py
void DumpBinary4py(char *filename)
Definition Array1D.h:447
+
Array1D< int >::getnpintArray
void getnpintArray(long *outarray)
Definition Array1D.h:480
+
Array1D< int >::operator[]
int & operator[](int i)
Definition Array1D.h:410
+
Array1D< int >::Array1D
Array1D()
Default constructor, which does not allocate any memory.
Definition Array1D.h:281
+
Array1D< int >::Length
int Length() const
Returns length (i.e. size in the x-direction)
Definition Array1D.h:316
+
Array1D< int >::ReadBinary4py
void ReadBinary4py(char *filename, int n)
Definition Array1D.h:456
+
Array1D< int >::insert
void insert(Array1D< int > &insarr, int ix)
Insert a given array to the position ix.
Definition Array1D.h:365
+
Array1D< int >::SetValue
void SetValue(const int &t)
Set all values in the array to the given value.
Definition Array1D.h:333
+
Array1D< int >::setnpintArray
void setnpintArray(vector< int > inarray, int n)
Definition Array1D.h:472
+
Array1D< int >::ReadBinary
void ReadBinary(char *filename)
Definition Array1D.h:437
+
Array1D< int >::~Array1D
~Array1D()
Destructor that frees up the memory.
Definition Array1D.h:304
+
Array1D< int >::GetConstArrayPointer
const int * GetConstArrayPointer() const
Return a const point to the first element of the data in the vector so we can use it access the data ...
Definition Array1D.h:355
+
Array1D< int >::assign
void assign(const int x, const int val)
Definition Array1D.h:420
+
Array1D< int >::setArray
void setArray(vector< int > inarray)
Definition Array1D.h:466
+
Array1D< int >::PushBack
void PushBack(const int &t)
Add element to the end of the vector.
Definition Array1D.h:340
+
Array1D< int >::Array1D
Array1D(const Array1D &obj)
Copy constructor.
Definition Array1D.h:301
+
Array1D< int >::xsize_
int xsize_
Definition Array1D.h:276
+
Array1D< int >::Array1D
Array1D(const int &nx)
Constructor that allocates the memory.
Definition Array1D.h:284
+
Array1D< int >::ReadBinary
void ReadBinary(FILE *f_in)
Read contents of the array from a file in binary format.
Definition Array1D.h:399
+
Array1D< int >::Resize
void Resize(const int &nx, const int &t)
Resizes the array and sets ALL entries to the specified value.
Definition Array1D.h:326
+
Array1D< int >::XSize
int XSize() const
Returns size in the x-direction.
Definition Array1D.h:313
+
Array1D< int >::operator()
const int & operator()(int ix) const
Definition Array1D.h:361
+
Array1D< int >::operator()
int & operator()(int ix)
Definition Array1D.h:360
+
Array1D< int >::GetArrayPointer
int * GetArrayPointer()
Return a pointer to the first element of the data in the vector so we can use it access the data in a...
Definition Array1D.h:348
+
Array1D< int >::DumpBinary
void DumpBinary(FILE *f_out) const
Dump contents of the array to a file in binary format.
Definition Array1D.h:393
+
Array1D< int >::shape
vector< int > shape()
Definition Array1D.h:413
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array1D::ReadBinary
void ReadBinary(char *filename)
Definition Array1D.h:227
+
Array1D::operator()
const T & operator()(int ix) const
Definition Array1D.h:151
+
Array1D::setArray
void setArray(vector< T > inarray)
Definition Array1D.h:257
+
Array1D::operator()
T & operator()(int ix)
Definition Array1D.h:150
+
Array1D::shape
vector< int > shape()
Definition Array1D.h:203
+
Array1D::Array1D
Array1D(const int &nx)
Constructor that allocates the memory.
Definition Array1D.h:74
+
Array1D::GetConstArrayPointer
const T * GetConstArrayPointer() const
Return a const point to the first element of the data in the vector so we can use it access the data ...
Definition Array1D.h:145
+
Array1D::XSize
int XSize() const
Returns size in the x-direction.
Definition Array1D.h:103
+
Array1D::Array1D
Array1D(const Array1D &obj)
Copy constructor.
Definition Array1D.h:91
+
Array1D::~Array1D
~Array1D()
Destructor that frees up the memory.
Definition Array1D.h:94
+
Array1D::DumpBinary
void DumpBinary(FILE *f_out) const
Dump contents of the array to a file in binary format.
Definition Array1D.h:183
+
Array1D::data_
vector< T > data_
Definition Array1D.h:68
+
Array1D::PushBack
void PushBack(const T &t)
Add element to the end of the vector.
Definition Array1D.h:130
+
Array1D::SetValue
void SetValue(const T &t)
Set all values in the array to the given value.
Definition Array1D.h:123
+
Array1D::operator=
Array1D & operator=(const Array1D &obj)
Assignment operator copies the data structure by value.
Definition Array1D.h:84
+
Array1D::insert
void insert(const T &insval, int ix)
Insert a given value to the position ix.
Definition Array1D.h:167
+
Array1D::Clear
void Clear()
Function to clear the memory.
Definition Array1D.h:97
+
Array1D::Resize
void Resize(const int &nx, const T &t)
Resizes the array and sets ALL entries to the specified value.
Definition Array1D.h:116
+
Array1D::Array1D
Array1D(const int &nx, const T &t)
Constructor that allocates and initializes the data to a value t.
Definition Array1D.h:79
+
Array1D::Resize
void Resize(const int &nx)
Resizes the array.
Definition Array1D.h:109
+
Array1D::GetArrayPointer
T * GetArrayPointer()
Return a pointer to the first element of the data in the vector so we can use it access the data in a...
Definition Array1D.h:138
+
Array1D::type
string type()
Definition Array1D.h:268
+
Array1D::flatten
vector< T > flatten()
Definition Array1D.h:264
+
Array1D::ReadBinary
void ReadBinary(FILE *f_in)
Read contents of the array from a file in binary format.
Definition Array1D.h:189
+
Array1D::DumpBinary
void DumpBinary(char *filename)
Dump contents of the array to a file in binary format.
Definition Array1D.h:216
+
Array1D::assign
void assign(const int x, const T val)
Definition Array1D.h:210
+
Array1D::xsize_
int xsize_
Definition Array1D.h:67
+
Array1D::ReadBinary4py
void ReadBinary4py(char *filename, int n)
Definition Array1D.h:247
+
Array1D::Length
int Length() const
Returns length (i.e. size in the x-direction)
Definition Array1D.h:106
+
Array1D::operator[]
T & operator[](int i)
Definition Array1D.h:200
+
Array1D::DumpBinary4py
void DumpBinary4py(char *filename)
Definition Array1D.h:238
+
Array1D::Array1D
Array1D()
Default constructor, which does not allocate any memory.
Definition Array1D.h:71
+
Array1D::insert
void insert(Array1D< T > &insarr, int ix)
Insert a given array to the position ix.
Definition Array1D.h:155
+
Array1D::erase
void erase(int ix)
Erase the value from the position ix.
Definition Array1D.h:175
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/Array2D_8h.html b/docs/html/Array2D_8h.html new file mode 100644 index 00000000..f6a1c9a0 --- /dev/null +++ b/docs/html/Array2D_8h.html @@ -0,0 +1,95 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Array2D.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
Array2D.h File Reference
+
+
+ +

2D Array class for any type T +More...

+
#include <stddef.h>
+#include <cstdio>
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <iterator>
+#include <algorithm>
+#include <typeinfo>
+#include "Array1D.h"
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  Array2D< T >
 Stores data of any type T in a 2D array. More...
 
+

Detailed Description

+

2D Array class for any type T

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/Array2D_8h_source.html b/docs/html/Array2D_8h_source.html new file mode 100644 index 00000000..b72e476d --- /dev/null +++ b/docs/html/Array2D_8h_source.html @@ -0,0 +1,562 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Array2D.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
Array2D.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
30
+
31
+
32#ifndef ARRAY2D_H_SEEN
+
33#define ARRAY2D_H_SEEN
+
34
+
35#include <stddef.h>
+
36#include <cstdio>
+
37#include <vector>
+
38#include <iostream>
+
39#include <fstream>
+
40#include <iterator>
+
41#include <algorithm>
+
42#include <typeinfo>
+
43#include "Array1D.h"
+
44
+
45using namespace std;
+
46
+
57// COLUMN MAJOR FORMAT
+
58
+
59template<typename T>
+
+
60class Array2D{
+
61private:
+
62
+
63public:
+
64 // These two quantities used to be private but making them public
+
65 // allows for easy access to python interface as a "list"
+
66 int xsize_;
+
67 int ysize_;
+
68 vector<T> data_;
+
69 Array1D<T> arraycopy;
+
70 Array1D<T> rowvec;
+
71
+
73 Array2D(): xsize_(0), ysize_(0) {};
+
74
+
+
76 Array2D(const int& nx, const int& ny): xsize_(nx), ysize_(ny){
+
77 data_.resize(xsize_*ysize_);
+
78 }
+
+
79
+
+
81 Array2D(const int& nx, const int& ny, const T& t): xsize_(nx), ysize_(ny){
+
82 data_.resize(xsize_*ysize_ , t);
+
83 }
+
+
84
+
86 Array2D(const Array2D &obj): xsize_(obj.xsize_), ysize_(obj.ysize_), data_(obj.data_) {};
+
87
+
89 ~Array2D() {data_.clear();}
+
90
+
+
92 void Clear() {
+
93 xsize_ = 0;
+
94 ysize_ = 0;
+
95 data_.clear();
+
96 }
+
+
97
+
99 int XSize() const {return xsize_;}
+
101 int YSize() const {return ysize_;}
+
102
+
+
105 void Resize(const int& nx, const int& ny) {
+
106 xsize_ = nx;
+
107 ysize_ = ny;
+
108 data_.resize(xsize_*ysize_);
+
109 }
+
+
110
+
+
113 void Resize(const int& nx, const int& ny, const T& t) {
+
114 data_.clear();
+
115 xsize_ = nx;
+
116 ysize_ = ny;
+
117 data_.resize(xsize_*ysize_, t);
+
118 }
+
+
119
+
+
121 void SetValue(const T& t){
+
122 for(int i=0; i < data_.size(); i++){
+
123 data_[i] = t;
+
124 }
+
125 }
+
+
126
+
+
130 T* GetArrayPointer() {
+
131 return &(data_[0]);
+
132 }
+
+
133
+
+
137 const T* GetConstArrayPointer() const {
+
138 return &(data_[0]);
+
139 }
+
+
140
+
142 // values accessed in a row-major format
+
143 T& operator()(int ix,int iy) {return data_[ix + xsize_*iy];}
+
144 const T& operator()(int ix,int iy) const {return data_[ix + xsize_*iy];}
+
145
+
+
147 void insertRow(Array1D<T>& insarr,int ix){
+
148 /*if (ix<0 || ix>xsize_)
+
149 throw Tantrum("Array2D:insertRow():: insert index out of bounds.");
+
150 if ( insarr.Length() != ysize_ )
+
151 throw Tantrum("Array2D:insertRow():: insert row size does not match.");*/
+
152
+
153 vector<T> data_old;
+
154 data_old=data_;
+
155
+
156 xsize_ += 1; // new number of rows
+
157 data_.resize(xsize_*ysize_);
+
158
+
159 for(int iy=0;iy<ysize_;iy++){
+
160 for(int i=0; i < ix; i++)
+
161 data_[i+xsize_*iy] = data_old[i+(xsize_-1)*iy];
+
162 data_[ix+xsize_*iy]=insarr(iy);
+
163 for(int i=ix+1; i < xsize_; i++)
+
164 data_[i+xsize_*iy] = data_old[i-1+(xsize_-1)*iy];
+
165 }
+
166 }
+
+
167
+
+
169 void insertRow(Array2D<T>& insarr,int ix){
+
170 /*if (ix<0 || ix>xsize_)
+
171 throw Tantrum("Array2D:insertRow():: insert index out of bounds.");
+
172 if ( insarr.YSize() != ysize_ )
+
173 throw Tantrum("Array2D:insertRow():: insert row size does not match.");*/
+
174
+
175 vector<T> data_old;
+
176 data_old=data_;
+
177
+
178 int insx=insarr.XSize();
+
179
+
180 xsize_ += insx;
+
181 data_.resize(xsize_*ysize_);
+
182
+
183 for(int iy=0;iy<ysize_;iy++){
+
184 for(int i=0; i < ix; i++)
+
185 data_[i+xsize_*iy] = data_old[i+(xsize_-insx)*iy];
+
186 for(int i=ix; i < ix+insx; i++)
+
187 data_[i+xsize_*iy]=insarr(i-ix,iy);
+
188 for(int i=ix+insx; i < xsize_; i++)
+
189 data_[i+xsize_*iy] = data_old[i-insx+(xsize_-insx)*iy];
+
190 }
+
191 }
+
+
192
+
+
194 void eraseRow(int ix){
+
195 /*if (ix<0 || ix>=xsize_)
+
196 throw Tantrum("Array2D:eraseRow():: erase index out of bounds.");*/
+
197
+
198 vector<T> data_old;
+
199 data_old=data_;
+
200
+
201 xsize_-=1;
+
202 data_.resize(xsize_*ysize_);
+
203
+
204 for(int iy=0;iy<ysize_;iy++){
+
205 for(int i=0; i < ix; i++)
+
206 data_[i+xsize_*iy] = data_old[i+(xsize_+1)*iy];
+
207 for(int i=ix; i < xsize_; i++)
+
208 data_[i+xsize_*iy] = data_old[i+1+(xsize_+1)*iy];
+
209 }
+
210
+
211 //if (xsize_==0)
+
212 // printf("eraseRow(): WARNING: the xsize is zeroed!");
+
213
+
214 }
+
+
215
+
216 // /// \brief Insert array insarr as a column into position iy
+
+
217 void insertCol(Array1D<T>& insarr,int iy){
+
218 /*if (iy<0 || iy>ysize_)
+
219 throw Tantrum("Array2D:insertCol():: insert index out of bounds.");
+
220 if ( insarr.Length() != xsize_ )
+
221 throw Tantrum("Array2D:insertCol():: insert column size does not match.");*/
+
222
+
223
+
224 T* ptr=insarr.GetArrayPointer();
+
225 data_.insert(data_.begin()+xsize_*iy,ptr,ptr+xsize_);
+
226
+
227 ysize_+=1;
+
228
+
229 }
+
+
230
+
+
232 void insertCol(Array2D<T>& insarr,int iy){
+
233 /*if (iy<0 || iy>ysize_)
+
234 throw Tantrum("Array2D:insertCol():: insert index out of bounds.");
+
235 if ( insarr.XSize() != xsize_ )
+
236 throw Tantrum("Array2D:insertRow():: insert column size does not match.");*/
+
237
+
238 int insy=insarr.YSize();
+
239
+
240 T* ptr=insarr.GetArrayPointer();
+
241 data_.insert(data_.begin()+xsize_*iy,ptr,ptr+xsize_*insy);
+
242
+
243 ysize_+=insy;
+
244 }
+
+
245
+
+
247 void eraseCol(int iy){
+
248 /*if (iy<0 || iy>=ysize_)
+
249 throw Tantrum("Array2D:eraseCol():: erase index out of bounds.");*/
+
250
+
251 data_.erase(data_.begin()+xsize_*iy,data_.begin()+xsize_*(iy+1));
+
252
+
253 ysize_-=1;
+
254
+
255 //if (ysize_==0)
+
256 // printf("eraseCol(): WARNING: the ysize is zeroed!");
+
257
+
258 }
+
+
259
+
+
261 void DumpBinary(FILE* f_out) const {
+
262 fwrite(&xsize_,sizeof(xsize_),1,f_out);
+
263 fwrite(&ysize_,sizeof(ysize_),1,f_out);
+
264 fwrite(this->GetConstArrayPointer(),sizeof(T),xsize_*ysize_,f_out);
+
265 }
+
+
266
+
267
+
+
269 void ReadBinary(FILE* f_in){
+
270 fread(&xsize_,sizeof(xsize_),1,f_in);
+
271 fread(&ysize_,sizeof(ysize_),1,f_in);
+
272 data_.resize(xsize_*ysize_);
+
273 fread(this->GetArrayPointer(),sizeof(T),xsize_*ysize_,f_in);
+
274 }
+
+
275
+
276 /********************************************************
+
277 // Methods for interfacing with python
+
278 ********************************************************/
+
279
+
280 // assignment operator []
+
281 // allows for calling Array2D using [i][j] notation
+
282 // make more efficient by setting two vectors equal
+
+
283 Array1D<T>& operator[](int ix) {
+
284 // get the ith row
+
285 int stride = xsize_;
+
286 rowvec.Resize(ysize_);
+
287 for (int iy = 0; iy < ysize_; iy++){
+
288 rowvec(iy) = data_[ix + stride*iy];
+
289 }
+
290 return rowvec;
+
291 }
+
+
292
+
293 // For calling shape in Python
+
+
294 vector<int> shape(){
+
295 vector<int> s (2,0);
+
296 s[0] = this -> XSize();
+
297 s[1] = this -> YSize();
+
298 return s;
+
299 }
+
+
300
+
+
301 void getRow(int row){
+
302 arraycopy.Resize(ysize_,0);
+
303 int stride = xsize_;
+
304 for (int i = 0; i < ysize_; i++){
+
305 arraycopy[i] = data_[i*stride + row];
+
306 }
+
307 }
+
+
308
+
309 // read binary file created with DumpBinary
+
310 // Cannot use numpy's from files
+
311 // only for use in c++
+
+
312 void DumpBinary(char *filename){
+
313 FILE *f_out;
+
314 f_out = fopen(filename,"wb");
+
315 fwrite(&xsize_,sizeof(xsize_),1,f_out);
+
316 fwrite(&ysize_,sizeof(ysize_),1,f_out);
+
317 fwrite(this->GetConstArrayPointer(),sizeof(T),xsize_*ysize_,f_out);
+
318 fclose(f_out);
+
319 }
+
+
320
+
321 // Only for use if DumpBinary was used
+
322 // can only be read in c++
+
323 // can be opened with ReadBinary(FILE* file) above
+
+
324 void ReadBinary(char *filename){
+
325 FILE *f_in;
+
326 f_in = fopen(filename,"rb");
+
327 fread(&xsize_,sizeof(xsize_),1,f_in);
+
328 fread(&ysize_,sizeof(ysize_),1,f_in);
+
329 data_.resize(xsize_*ysize_);
+
330 fread(this->GetArrayPointer(),sizeof(T),xsize_*ysize_,f_in);
+
331 fclose(f_in);
+
332 }
+
+
333
+
334 // creates binary file that can be read with numpy's fromfile
+
+
335 void DumpBinary4py(char *filename){
+
336 ofstream f_out;
+
337 f_out.open(filename, ios::out | ios::binary);
+
338 f_out.write((char*)this->GetArrayPointer(),sizeof(T[xsize_*ysize_])); // convert array pointer to char string
+
339 f_out.close();
+
340 }
+
+
341
+
342 // can read in DumpBinary4py output, but needs size of vector
+
343 // fromfile can automatically detect size file, so, if need by, one can use numpy's fromfile to determine # of elements
+
+
344 void ReadBinary4py(char *filename, int n1, int n2){
+
345 xsize_ = n1;
+
346 ysize_ = n2;
+
347 ifstream f_in;
+
348 f_in.open(filename, ios::in | ios::binary);
+
349 f_in.read((char*)this->GetArrayPointer(),sizeof(T[xsize_*ysize_])); // convert array pointer to char string
+
350 f_in.close();
+
351 }
+
+
352
+
353 // Set user-defined list to data_ vector
+
354 // This will work even for string type
+
+
355 void setArray(vector<T> inarray){
+
356 data_ = inarray;
+
357 // xsize_ = inarray.size();
+
358 }
+
+
359
+
360 // Sets user-defined 2d numpy array to data_ vector
+
361 // This is not to be used for a string type
+
+
362 void setnpdblArray(double* inarray, int n1, int n2){
+
363 xsize_ = n1;
+
364 ysize_ = n2;
+
365 data_.assign(inarray,inarray+n1*n2);
+
366 }
+
+
367
+
368 // get numpy double array from data_ vector
+
+
369 void getnpdblArray(double* outarray){
+
370 copy(data_.begin(), data_.end(), outarray);
+
371 }
+
+
372
+
373 // Sets user-defined 2d numpy array to data_ vector
+
374 // This is not to be used for a string type
+
+
375 void setnpintArray(long* inarray, int n1, int n2){
+
376 xsize_ = n1;
+
377 ysize_ = n2;
+
378 data_.assign(inarray,inarray+n1*n2);
+
379 }
+
+
380
+
381 // get numpy double array from data_ vector
+
+
382 void getnpintArray(long* outarray){
+
383 copy(data_.begin(), data_.end(), outarray);
+
384 }
+
+
385
+
386 // Get the value at location x,y
+
+
387 T& at(int ix,int iy){
+
388 return data_[ix + xsize_*iy];
+
389 }
+
+
390
+
391 // Returns data_ vector as a list in python in row-major (?)
+
392 // Also acts as a print to see individual elements
+
+
393 vector<T> flatten(){
+
394 return data_;
+
395 }
+
+
396
+
+
397 string type(){
+
398 const char* s = typeid(data_[0]).name();
+
399 if (string(s) == string("Ss") ){
+
400 return "string";
+
401 }
+
402 else if (strcmp(s,"i") == 0){
+
403 return "int";
+
404 }
+
405 else {
+
406 return "double";
+
407 }
+
408 }
+
+
409
+
410 // For python, allows the user to assign a value to a specific index (x,y)
+
+
411 void assign(const int x,const int y,const T val){
+
412 data_[x + xsize_*y] = val;
+
413 }
+
+
414};
+
+
415
+
416#endif /* ARRAY2D_H_SEEN */
+
Array1D.h
1D Array class for any type T
+
copy
Array1D< double > copy(Array1D< double > &in_array)
Returns a copy of 1D array.
Definition arraytools.cpp:1607
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array1D::GetArrayPointer
T * GetArrayPointer()
Return a pointer to the first element of the data in the vector so we can use it access the data in a...
Definition Array1D.h:138
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
Array2D::Resize
void Resize(const int &nx, const int &ny)
Resizes the array.
Definition Array2D.h:105
+
Array2D::Array2D
Array2D(const int &nx, const int &ny)
Constructor that allocates the memory.
Definition Array2D.h:76
+
Array2D::ReadBinary4py
void ReadBinary4py(char *filename, int n1, int n2)
Definition Array2D.h:344
+
Array2D::getRow
void getRow(int row)
Definition Array2D.h:301
+
Array2D::insertRow
void insertRow(Array2D< T > &insarr, int ix)
Insert a 2d-array insarr into a row position ix.
Definition Array2D.h:169
+
Array2D::eraseRow
void eraseRow(int ix)
Erase the row ix.
Definition Array2D.h:194
+
Array2D::setArray
void setArray(vector< T > inarray)
Definition Array2D.h:355
+
Array2D::setnpintArray
void setnpintArray(long *inarray, int n1, int n2)
Definition Array2D.h:375
+
Array2D::~Array2D
~Array2D()
Destructor that frees up the memory.
Definition Array2D.h:89
+
Array2D::shape
vector< int > shape()
Definition Array2D.h:294
+
Array2D::operator()
T & operator()(int ix, int iy)
C-like () operator to access values in the 2D data array.
Definition Array2D.h:143
+
Array2D::insertRow
void insertRow(Array1D< T > &insarr, int ix)
Insert array insarr as a row into position ix.
Definition Array2D.h:147
+
Array2D::Array2D
Array2D(const Array2D &obj)
Copy constructor.
Definition Array2D.h:86
+
Array2D::ysize_
int ysize_
Definition Array2D.h:67
+
Array2D::operator()
const T & operator()(int ix, int iy) const
Definition Array2D.h:144
+
Array2D::setnpdblArray
void setnpdblArray(double *inarray, int n1, int n2)
Definition Array2D.h:362
+
Array2D::DumpBinary
void DumpBinary(char *filename)
Definition Array2D.h:312
+
Array2D::Array2D
Array2D(const int &nx, const int &ny, const T &t)
Constructor that allocates and initializes the data to a constant t.
Definition Array2D.h:81
+
Array2D::getnpdblArray
void getnpdblArray(double *outarray)
Definition Array2D.h:369
+
Array2D::Array2D
Array2D()
Default constructor, which does not allocate any memory.
Definition Array2D.h:73
+
Array2D::ReadBinary
void ReadBinary(FILE *f_in)
Read contents of the array from a file in binary format.
Definition Array2D.h:269
+
Array2D::xsize_
int xsize_
Definition Array2D.h:66
+
Array2D::data_
vector< T > data_
Definition Array2D.h:68
+
Array2D::insertCol
void insertCol(Array1D< T > &insarr, int iy)
Definition Array2D.h:217
+
Array2D::at
T & at(int ix, int iy)
Definition Array2D.h:387
+
Array2D::operator[]
Array1D< T > & operator[](int ix)
Definition Array2D.h:283
+
Array2D::GetConstArrayPointer
const T * GetConstArrayPointer() const
Return a cont point to the first element of the data in the vector so we can use it access the data i...
Definition Array2D.h:137
+
Array2D::YSize
int YSize() const
Returns size in the y-direction.
Definition Array2D.h:101
+
Array2D::arraycopy
Array1D< T > arraycopy
Definition Array2D.h:69
+
Array2D::ReadBinary
void ReadBinary(char *filename)
Definition Array2D.h:324
+
Array2D::insertCol
void insertCol(Array2D< T > &insarr, int iy)
Insert a 2d-array insarr into a column position iy.
Definition Array2D.h:232
+
Array2D::type
string type()
Definition Array2D.h:397
+
Array2D::assign
void assign(const int x, const int y, const T val)
Definition Array2D.h:411
+
Array2D::rowvec
Array1D< T > rowvec
Definition Array2D.h:70
+
Array2D::getnpintArray
void getnpintArray(long *outarray)
Definition Array2D.h:382
+
Array2D::DumpBinary
void DumpBinary(FILE *f_out) const
Dump contents of the array to a file in binary format.
Definition Array2D.h:261
+
Array2D::eraseCol
void eraseCol(int iy)
Erase the column iy.
Definition Array2D.h:247
+
Array2D::SetValue
void SetValue(const T &t)
Set all values in the array to the given value.
Definition Array2D.h:121
+
Array2D::Clear
void Clear()
Function to clear the memory.
Definition Array2D.h:92
+
Array2D::DumpBinary4py
void DumpBinary4py(char *filename)
Definition Array2D.h:335
+
Array2D::GetArrayPointer
T * GetArrayPointer()
Return a pointer to the first element of the data in the vector so we can use it access the data in a...
Definition Array2D.h:130
+
Array2D::XSize
int XSize() const
Returns size in the x-direction.
Definition Array2D.h:99
+
Array2D::flatten
vector< T > flatten()
Definition Array2D.h:393
+
Array2D::Resize
void Resize(const int &nx, const int &ny, const T &t)
Resizes the array and sets ALL entries to the specified value.
Definition Array2D.h:113
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/Array3D_8h.html b/docs/html/Array3D_8h.html new file mode 100644 index 00000000..25a3b224 --- /dev/null +++ b/docs/html/Array3D_8h.html @@ -0,0 +1,92 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Array3D.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
Array3D.h File Reference
+
+
+ +

3D Array class for any type T +More...

+
#include <stddef.h>
+#include <vector>
+#include <iostream>
+#include <fstream>
+#include <iterator>
+#include <algorithm>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  Array3D< T >
 Stores data of any type T in a 3D array. More...
 
+

Detailed Description

+

3D Array class for any type T

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/Array3D_8h_source.html b/docs/html/Array3D_8h_source.html new file mode 100644 index 00000000..12c78bc8 --- /dev/null +++ b/docs/html/Array3D_8h_source.html @@ -0,0 +1,273 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Array3D.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
Array3D.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
30
+
31
+
32#ifndef ARRAY3D_H_SEEN
+
33#define ARRAY3D_H_SEEN
+
34
+
35#include <stddef.h>
+
36#include <vector>
+
37#include <iostream>
+
38#include <fstream>
+
39#include <iterator>
+
40#include <algorithm>
+
41
+
42using namespace std;
+
43
+
55template <typename T>
+
+
56class Array3D {
+
57 public:
+
59 Array3D(): xsize_(0), ysize_(0), zsize_(0) {};
+
60
+
+
62 Array3D(const size_t& nx, const size_t& ny, const size_t& nz):
+
63 xsize_(nx), ysize_(ny), zsize_(nz) {
+
64 data_.resize(xsize_*ysize_*zsize_);
+
65 }
+
+
66
+
+
68 Array3D(const size_t& nx, const size_t& ny, const size_t& nz, const T& t):
+
69 xsize_(nx), ysize_(ny), zsize_(nz) {
+
70 data_.resize(xsize_*ysize_*zsize_ , t);
+
71 }
+
+
72
+
74 ~Array3D() {data_.clear();}
+
75
+
+
77 void Clear() {
+
78 xsize_ = 0;
+
79 ysize_ = 0;
+
80 zsize_ = 0;
+
81 data_.clear();
+
82 }
+
+
83
+
85 size_t XSize() const {return xsize_;}
+
87 size_t YSize() const {return ysize_;}
+
89 size_t ZSize() const {return zsize_;}
+
90
+
+
98 void Resize(const size_t& nx, const size_t& ny, const size_t& nz) {
+
99 xsize_ = nx;
+
100 ysize_ = ny;
+
101 zsize_ = nz;
+
102 data_.resize(xsize_*ysize_*zsize_);
+
103 }
+
+
104
+
+
110 void Resize(const size_t& nx, const size_t& ny, const size_t& nz, const T& t) {
+
111 data_.clear();
+
112 xsize_ = nx;
+
113 ysize_ = ny;
+
114 zsize_ = nz;
+
115 data_.resize(xsize_*ysize_*zsize_ , t);
+
116 }
+
+
117
+
+
119 void SetValue(const T& t){
+
120 for(size_t i=0; i < data_.size(); i++){
+
121 data_[i] = t;
+
122 }
+
123 }
+
+
124
+
+
128 T* GetArrayPointer() {
+
129 return &(data_[0]);
+
130 }
+
+
131
+
+
135 const T* GetConstArrayPointer() const {
+
136 return &(data_[0]);
+
137 }
+
+
138
+
144 T& operator()(size_t ix, size_t iy, size_t iz) {return data_[ix+xsize_*(iy+ysize_*iz)];}
+
145
+
151 const T& operator()(size_t ix, size_t iy, size_t iz) const {return data_[ix+xsize_*(iy+ysize_*iz)];}
+
152
+
+
154 void DumpBinary(FILE* f_out) const {
+
155 fwrite(&xsize_,sizeof(xsize_),1,f_out);
+
156 fwrite(&ysize_,sizeof(ysize_),1,f_out);
+
157 fwrite(&zsize_,sizeof(zsize_),1,f_out);
+
158 fwrite(this->GetConstArrayPointer(),sizeof(T),xsize_*ysize_*zsize_,f_out);
+
159 }
+
+
160
+
+
165 void DumpText(std::ofstream& f_out) const {
+
166 vector<double>::const_iterator it1;
+
167 vector<double>::const_iterator it2;
+
168 it2=data_.begin();
+
169
+
170 for (int iz=0;iz<zsize_;iz++) {
+
171 for (int iy=0;iy<ysize_;iy++) {
+
172 it1=it2;
+
173 advance(it2,xsize_);
+
174 std::copy(it1,it2,std::ostream_iterator<T>(f_out," "));
+
175 f_out << endl;
+
176 }
+
177 }
+
178
+
179 }
+
+
180
+
+
182 void ReadText(FILE* f_in){
+
183 fread(&xsize_,sizeof(xsize_),1,f_in);
+
184 fread(&ysize_,sizeof(ysize_),1,f_in);
+
185 fread(&zsize_,sizeof(zsize_),1,f_in);
+
186 data_.resize(xsize_*ysize_*zsize_);
+
187 fread(this->GetArrayPointer(),sizeof(T),xsize_*ysize_*zsize_,f_in);
+
188 }
+
+
189
+
+
192 void ReadBinary(std::ifstream& f_in){
+
193
+
194 typedef std::istream_iterator<T> istream_iterator;
+
195 std::copy(istream_iterator(f_in),istream_iterator(),data_.begin());
+
196 }
+
+
197
+
198
+
199 private:
+
200
+
203 Array3D(const Array3D &obj) {};
+
204
+
206 size_t xsize_;
+
208 size_t ysize_;
+
210 size_t zsize_;
+
211
+
217 vector<T> data_;
+
218};
+
+
219
+
220#endif /* ARRAY3D_H_SEEN */
+
Array3D
Stores data of any type T in a 3D array.
Definition Array3D.h:56
+
Array3D::SetValue
void SetValue(const T &t)
Set all values in the array to the given value.
Definition Array3D.h:119
+
Array3D::XSize
size_t XSize() const
Returns size in the x-direction.
Definition Array3D.h:85
+
Array3D::DumpBinary
void DumpBinary(FILE *f_out) const
Dump contents of the array to a file in binary format.
Definition Array3D.h:154
+
Array3D::data_
vector< T > data_
Data in the array with size = xsize_ * ysize_ * zsize_.
Definition Array3D.h:217
+
Array3D::operator()
T & operator()(size_t ix, size_t iy, size_t iz)
Fortran-like () operator to access values in the 3D data array.
Definition Array3D.h:144
+
Array3D::Array3D
Array3D()
Default constructor, which does not allocate any memory.
Definition Array3D.h:59
+
Array3D::ReadBinary
void ReadBinary(std::ifstream &f_in)
Read contents of the array from a file in text format Added by Maher Salloum.
Definition Array3D.h:192
+
Array3D::GetConstArrayPointer
const T * GetConstArrayPointer() const
Return a const pointer to the first element of the data in the vector so we can use it access the dat...
Definition Array3D.h:135
+
Array3D::~Array3D
~Array3D()
Destructor that frees up the memory.
Definition Array3D.h:74
+
Array3D::GetArrayPointer
T * GetArrayPointer()
Return a pointer to the first element of the data in the vector so we can use it access the data in a...
Definition Array3D.h:128
+
Array3D::Array3D
Array3D(const size_t &nx, const size_t &ny, const size_t &nz, const T &t)
Constructor that allocates and initializes the data.
Definition Array3D.h:68
+
Array3D::Clear
void Clear()
Function to clear the memory.
Definition Array3D.h:77
+
Array3D::DumpText
void DumpText(std::ofstream &f_out) const
Dump contents of the array to a file in text format Added by Maher Salloum When post-processing (in m...
Definition Array3D.h:165
+
Array3D::ysize_
size_t ysize_
Number of elements in the y-dimension.
Definition Array3D.h:208
+
Array3D::zsize_
size_t zsize_
Number of elements in the z-dimension.
Definition Array3D.h:210
+
Array3D::Array3D
Array3D(const size_t &nx, const size_t &ny, const size_t &nz)
Constructor that allocates the memory.
Definition Array3D.h:62
+
Array3D::ReadText
void ReadText(FILE *f_in)
Read contents of the array from a file in binary format.
Definition Array3D.h:182
+
Array3D::Resize
void Resize(const size_t &nx, const size_t &ny, const size_t &nz, const T &t)
Resizes the array and sets ALL entries to the specified value.
Definition Array3D.h:110
+
Array3D::ZSize
size_t ZSize() const
Returns size in the z-direction.
Definition Array3D.h:89
+
Array3D::Resize
void Resize(const size_t &nx, const size_t &ny, const size_t &nz)
Resizes the array.
Definition Array3D.h:98
+
Array3D::operator()
const T & operator()(size_t ix, size_t iy, size_t iz) const
Fortran-like () const operator to access values in the 3D data array.
Definition Array3D.h:151
+
Array3D::YSize
size_t YSize() const
Returns size in the y-direction.
Definition Array3D.h:87
+
Array3D::Array3D
Array3D(const Array3D &obj)
Copy constructor, which is made private so it would not be used inadvertently (until we define a prop...
Definition Array3D.h:203
+
Array3D::xsize_
size_t xsize_
Number of elements in the x-dimension.
Definition Array3D.h:206
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/DoxyMain_8dox.html b/docs/html/DoxyMain_8dox.html new file mode 100644 index 00000000..f92c79ff --- /dev/null +++ b/docs/html/DoxyMain_8dox.html @@ -0,0 +1,66 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: DoxyMain.dox File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
DoxyMain.dox File Reference
+
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/MyException_8h.html b/docs/html/MyException_8h.html new file mode 100644 index 00000000..42acd58b --- /dev/null +++ b/docs/html/MyException_8h.html @@ -0,0 +1,83 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: MyException.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
MyException.h File Reference
+
+
+
#include <iostream>
+#include <exception>
+#include <string.h>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  MyException
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/MyException_8h_source.html b/docs/html/MyException_8h_source.html new file mode 100644 index 00000000..03cc5a83 --- /dev/null +++ b/docs/html/MyException_8h_source.html @@ -0,0 +1,151 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: MyException.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
MyException.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
28// -*- C++ -*-
+
29
+
30#ifndef _MyException_
+
31#define _MyException_
+
32
+
33#include <iostream>
+
34#include <exception>
+
35#include <string.h>
+
36
+
+
40class MyException : public std::exception {
+
41public:
+
+
43 MyException(const char* errormessage) {
+
44 std::cerr << "ERROR: " << errormessage << "\n";
+
45 error_ = std::string("MyException: ") + errormessage;
+
46 }
+
+
47
+
+
49 MyException(const std::string& errormessage) {
+
50 std::cerr << "ERROR: " << errormessage << "\n";
+
51 error_ = std::string("MyException: ") + errormessage;
+
52 }
+
+
53
+
+
55 virtual ~MyException() throw() {
+
56 }
+
+
57
+
+
59 const char* what() const throw() {
+
60 try {
+
61 return error_.c_str();
+
62 } catch(...) {
+
63 ;
+
64 }
+
65 return error_.c_str();
+
66 }
+
+
67
+
68private:
+
69 std::string error_;
+
70};
+
+
71
+
72#endif // _MyException_
+
MyException
Definition MyException.h:40
+
MyException::MyException
MyException(const std::string &errormessage)
Construct an exception using a C++-style string.
Definition MyException.h:49
+
MyException::what
const char * what() const
What's going on?
Definition MyException.h:59
+
MyException::MyException
MyException(const char *errormessage)
Construct an exception using a C-style character string.
Definition MyException.h:43
+
MyException::error_
std::string error_
Definition MyException.h:69
+
MyException::~MyException
virtual ~MyException()
Destroy.
Definition MyException.h:55
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/Object_8h.html b/docs/html/Object_8h.html new file mode 100644 index 00000000..c8018240 --- /dev/null +++ b/docs/html/Object_8h.html @@ -0,0 +1,81 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Object.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
Object.h File Reference
+
+
+
#include "RefPtr.h"
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  Object
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/Object_8h_source.html b/docs/html/Object_8h_source.html new file mode 100644 index 00000000..61715b9a --- /dev/null +++ b/docs/html/Object_8h_source.html @@ -0,0 +1,154 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Object.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
Object.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
28// -*- C++ -*-
+
29
+
30#ifndef _base_class_Object_
+
31#define _base_class_Object_
+
32
+
33#include "RefPtr.h"
+
34
+
+
47class Object {
+
48 template <class T> friend class RefPtr;
+
49 template <class T> friend class ConstRefPtr;
+
50public:
+
+
52 Object() : refs_(0) {
+
53 }
+
+
54
+
+
56 virtual ~Object() {
+
57 }
+
+
58
+
+
60 long int reference_count() const {
+
61 return refs_;
+
62 }
+
+
63
+
64protected:
+
+
67 long int reference_grab() const {
+
68 return ++refs_;
+
69 }
+
+
70
+
+
71 long int reference_release() const {
+
72 return --refs_;
+
73 }
+
+
74
+
75private:
+
76 mutable long int refs_;
+
77};
+
+
78
+
79#endif //_utility_ref_Object_
+ +
Object
Definition Object.h:47
+
Object::reference_count
long int reference_count() const
Returns the number of references that are held to this object.
Definition Object.h:60
+
Object::refs_
long int refs_
Definition Object.h:76
+
Object::reference_grab
long int reference_grab() const
Definition Object.h:67
+
Object::Object
Object()
Construct a new reference counted object with a zero reference count.
Definition Object.h:52
+
Object::~Object
virtual ~Object()
Destroy this object.
Definition Object.h:56
+
Object::ConstRefPtr
friend class ConstRefPtr
Definition Object.h:49
+
Object::reference_release
long int reference_release() const
Definition Object.h:71
+
RefPtr
Definition RefPtr.h:46
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/PCBasis_8cpp.html b/docs/html/PCBasis_8cpp.html new file mode 100644 index 00000000..4579d16f --- /dev/null +++ b/docs/html/PCBasis_8cpp.html @@ -0,0 +1,88 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: PCBasis.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
PCBasis.cpp File Reference
+
+
+ +

Univariate PC class. +More...

+
#include "PCBasis.h"
+#include "error_handlers.h"
+#include "uqtkconfig.h"
+#include <math.h>
+#include "quad.h"
+#include "arrayio.h"
+#include "pcmaps.h"
+#include "combin.h"
+#include <iostream>
+#include <string.h>
+#include <stdio.h>
+#include <sstream>
+

Detailed Description

+

Univariate PC class.

+
Author
B. Debusschere, C. Safta, K. Sargsyan, K. Chowdhary 2007 -
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/PCBasis_8h.html b/docs/html/PCBasis_8h.html new file mode 100644 index 00000000..79c77ab4 --- /dev/null +++ b/docs/html/PCBasis_8h.html @@ -0,0 +1,93 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: PCBasis.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
PCBasis.h File Reference
+
+
+ +

Header file for the univariate PC class. +More...

+
#include <iostream>
+#include <string.h>
+#include "Array1D.h"
+#include "Array2D.h"
+#include "ftndefs.h"
+#include "dsfmt_add.h"
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  PCBasis
 Contains all basis type specific definitions and operations needed to generate a PCSet. More...
 
+

Detailed Description

+

Header file for the univariate PC class.

+
Author
B. Debusschere, C. Safta, K. Sargsyan, K. Chowdhary 2007 -
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/PCBasis_8h_source.html b/docs/html/PCBasis_8h_source.html new file mode 100644 index 00000000..b0351193 --- /dev/null +++ b/docs/html/PCBasis_8h_source.html @@ -0,0 +1,256 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: PCBasis.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
PCBasis.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
31
+
32#ifndef PCBASIS_H_SEEN
+
33#define PCBASIS_H_SEEN
+
34
+
35#include <iostream>
+
36#include <string.h>
+
37#include "Array1D.h"
+
38#include "Array2D.h"
+
39// #include "Array3D.h"
+
40#include "ftndefs.h"
+
41#include "dsfmt_add.h"
+
42
+
43
+
+
47class PCBasis {
+
48public:
+
60 PCBasis(const string type="LU", const double alpha=0.0, const double betta=1.0, const int maxord=10);
+
61
+
62
+
64 ~PCBasis() {};
+
65
+
74 void Init1dQuadPoints(int qdpts);
+
75
+
78 void Eval1dBasisAtQuadPoints();
+
79
+
84 void Eval1dBasisAtCustPoints(Array2D<double>& psi,int kord, const Array1D<double>& custPoints);
+
85
+
93 double EvalBasis(const double &xi, Array1D<double> &basisEvals) const;
+
98 double EvalBasis(const double &xi, const int kord, double *basisEvals) const;
+
99
+
102 void Eval1dNormSq_Exact(int kord);
+
103
+
104
+
105 /***************************************************
+
106 New derivative functionality
+
107 ***************************************************/
+
109 void EvalDerivBasis(const double& xi, Array1D<double>& basisDEvals);
+
110 void Eval1dDerivBasisAtCustPoints(Array2D<double>& dpsi,int kord, const Array1D<double>& custPoints);
+
111
+
112 void Eval2ndDerivBasis(const double& xi,Array1D<double>& ddP);
+
113 void Eval2ndDerivCustPoints(Array2D<double>& psi, int kord, Array1D<double>& custPoints);
+
114 /***************************************************
+
115 ***************************************************/
+
116
+
119 void Get1dNormsSq(Array1D<double>& psi1dSq) const {psi1dSq=psi1dSq_; return;}
+
120
+
123 void Get1dNormsSqExact(Array1D<double>& psi1dSqExact) const {psi1dSqExact=psi1dSqExact_; return;}
+
124
+
129 void GetRandSample(Array1D<double>& randSamples);
+
130
+
134 void GetRandSample(double* randSamples, const int& nSamp);
+
135
+
137 int GetSeed() const {return rSeed_;}
+
138
+
141 void SeedRandNumGen(const int& seed);
+
142
+
144 void GetQuadRule(Array2D<double>& qPoints, Array1D<double>& qWeights, Array2D<int>& qIndices);
+
145
+
148 void GetQuadPoints(Array2D<double>& quadPoints) const { quadPoints=quadPoints_; return;}
+
149
+
151 void GetQuadWeights(Array1D<double>& quadWeights) const { quadWeights=quadWeights_; return;}
+
152
+
154 void GetQuadIndices(Array2D<int>& quadIndices) const { quadIndices=quadIndices_; return;}
+
155
+
157 void GetBasisAtQuadPoints(Array2D<double>& psi1d) const { psi1d=psi1d_; return;}
+
158
+
160 string GetPCType() const {return type_;}
+
161
+
163 double GetAlpha() const {return alpha_;}
+
164
+
166 double GetBeta() const {return beta_;}
+
167
+
168private:
+
172 // PCBasis(): type_("NA") {};
+
173
+
179 PCBasis(const PCBasis &obj):type_(obj.type_) {};
+
180
+
181
+
184 void Eval1dNormSq(int kord);
+
185
+
186
+
188 double NormSq_Exact(int kord);
+
189
+
191 string type_;
+
192
+
194 Array2D<double> quadPoints_;
+
195
+
197 Array1D<double> quadWeights_;
+
198
+
200 Array2D<int> quadIndices_;
+
201
+
202
+
206 Array2D<double> psi1d_;
+
207
+
209 Array1D<double> psi1dSq_;
+
210
+
212 Array1D<double> psi1dSqExact_;
+
213
+
215 int maxord_;
+
216
+
218 int narg_;
+
219
+
221 double alpha_;
+
222
+
224 double beta_;
+
225
+
228 dsfmt_t rnstate_ ;
+
229
+
236 int rSeed_;
+
237
+
238};
+
+
239
+
240#endif /* PCBASIS_H_SEEN */
+
Array1D.h
1D Array class for any type T
+
Array2D.h
2D Array class for any type T
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
PCBasis
Contains all basis type specific definitions and operations needed to generate a PCSet.
Definition PCBasis.h:47
+
PCBasis::PCBasis
PCBasis(const string type="LU", const double alpha=0.0, const double betta=1.0, const int maxord=10)
Constructor: initializes the univariate basis type and order.
Definition PCBasis.cpp:48
+
PCBasis::quadPoints_
Array2D< double > quadPoints_
Array to store quadrature points.
Definition PCBasis.h:194
+
PCBasis::PCBasis
PCBasis(const PCBasis &obj)
Dummy default constructor, which should not be used as it is not well defined Therefore we make it pr...
Definition PCBasis.h:179
+
PCBasis::alpha_
double alpha_
Parameter alpha for PCs that require a parameter (LG,SW,JB)
Definition PCBasis.h:221
+
PCBasis::EvalBasis
double EvalBasis(const double &xi, Array1D< double > &basisEvals) const
Evaluate 1d basis functions for the given value of random variable xi. Return the value of the basis ...
Definition PCBasis.cpp:147
+
PCBasis::GetRandSample
void GetRandSample(Array1D< double > &randSamples)
Get samples of the random variables associated with the current PC basis functions and return them in...
Definition PCBasis.cpp:398
+
PCBasis::quadIndices_
Array2D< int > quadIndices_
Array to store quadrature point indexing; useful only for nested rules.
Definition PCBasis.h:200
+
PCBasis::beta_
double beta_
Parameter beta for PCs that require two parameters (SW,JB)
Definition PCBasis.h:224
+
PCBasis::GetBasisAtQuadPoints
void GetBasisAtQuadPoints(Array2D< double > &psi1d) const
Get the basis values at quadrature points in the passed Array2D array.
Definition PCBasis.h:157
+
PCBasis::GetSeed
int GetSeed() const
Get the random number generator seed.
Definition PCBasis.h:137
+
PCBasis::Get1dNormsSq
void Get1dNormsSq(Array1D< double > &psi1dSq) const
Get the norms-squared of the basis functions. Returns the values for each basis function in the passe...
Definition PCBasis.h:119
+
PCBasis::GetAlpha
double GetAlpha() const
Get the value of the parameter alpha.
Definition PCBasis.h:163
+
PCBasis::GetBeta
double GetBeta() const
Get the value of the parameter beta.
Definition PCBasis.h:166
+
PCBasis::psi1dSq_
Array1D< double > psi1dSq_
Array with the norms squared of the 1D basis functions for each order.
Definition PCBasis.h:209
+
PCBasis::GetQuadRule
void GetQuadRule(Array2D< double > &qPoints, Array1D< double > &qWeights, Array2D< int > &qIndices)
Get the quadrature integration information.
Definition PCBasis.cpp:458
+
PCBasis::maxord_
int maxord_
Maximal order of any dimension.
Definition PCBasis.h:215
+
PCBasis::~PCBasis
~PCBasis()
Destructor.
Definition PCBasis.h:64
+
PCBasis::Init1dQuadPoints
void Init1dQuadPoints(int qdpts)
Initialize the quadrature points and weights and store the information in arrays quadPoints_,...
Definition PCBasis.cpp:95
+
PCBasis::Eval1dNormSq
void Eval1dNormSq(int kord)
Evaluate the norms (squared) of the basis functions and stores in the private array psi1dSq_.
Definition PCBasis.cpp:480
+
PCBasis::EvalDerivBasis
void EvalDerivBasis(const double &xi, Array1D< double > &basisDEvals)
Evaluate derivative of 1d non-normalized Legendre basis.
Definition PCBasis.cpp:277
+
PCBasis::Eval2ndDerivBasis
void Eval2ndDerivBasis(const double &xi, Array1D< double > &ddP)
Definition PCBasis.cpp:338
+
PCBasis::GetQuadIndices
void GetQuadIndices(Array2D< int > &quadIndices) const
Get the quadrature points' indices in the passed Array1D array.
Definition PCBasis.h:154
+
PCBasis::psi1d_
Array2D< double > psi1d_
Array to store basis functions evaluated at quadrature points for each order: psi1d_(iqp,...
Definition PCBasis.h:206
+
PCBasis::GetQuadPoints
void GetQuadPoints(Array2D< double > &quadPoints) const
Get the quadrature points in the passed Array2D array.
Definition PCBasis.h:148
+
PCBasis::Eval1dNormSq_Exact
void Eval1dNormSq_Exact(int kord)
Evaluate the norms (squared) of the basis functions exactly and stores in the private array psi1dSqEx...
Definition PCBasis.cpp:497
+
PCBasis::NormSq_Exact
double NormSq_Exact(int kord)
Evaluate 1d norm of order kord exactly.
Definition PCBasis.cpp:510
+
PCBasis::Eval1dBasisAtCustPoints
void Eval1dBasisAtCustPoints(Array2D< double > &psi, int kord, const Array1D< double > &custPoints)
Evaluate polynomial 1d basis functions up to the order kord at custom points given by an array custPo...
Definition PCBasis.cpp:121
+
PCBasis::Eval1dDerivBasisAtCustPoints
void Eval1dDerivBasisAtCustPoints(Array2D< double > &dpsi, int kord, const Array1D< double > &custPoints)
Definition PCBasis.cpp:308
+
PCBasis::Get1dNormsSqExact
void Get1dNormsSqExact(Array1D< double > &psi1dSqExact) const
Get the analytic norms-squared of the basis functions. Returns the values for each basis function in ...
Definition PCBasis.h:123
+
PCBasis::GetPCType
string GetPCType() const
Get the PC type.
Definition PCBasis.h:160
+
PCBasis::type_
string type_
String indicator of type of basis functions used.
Definition PCBasis.h:191
+
PCBasis::narg_
int narg_
Number of parameters to specify the basis.
Definition PCBasis.h:218
+
PCBasis::SeedRandNumGen
void SeedRandNumGen(const int &seed)
Function to (re)seed the random number generator used to sample the Basis functions.
Definition PCBasis.cpp:468
+
PCBasis::rnstate_
dsfmt_t rnstate_
Random sequence state for dsfmt.
Definition PCBasis.h:228
+
PCBasis::Eval2ndDerivCustPoints
void Eval2ndDerivCustPoints(Array2D< double > &psi, int kord, Array1D< double > &custPoints)
Definition PCBasis.cpp:374
+
PCBasis::Eval1dBasisAtQuadPoints
void Eval1dBasisAtQuadPoints()
Evaluate polynomial 1d basis functions at quadrature points and store in the private variable psi1d_.
Definition PCBasis.cpp:109
+
PCBasis::GetQuadWeights
void GetQuadWeights(Array1D< double > &quadWeights) const
Get the quadrature weights in the passed Array1D array.
Definition PCBasis.h:151
+
PCBasis::psi1dSqExact_
Array1D< double > psi1dSqExact_
Array with the exact norms squared of the 1D basis functions for each order.
Definition PCBasis.h:212
+
PCBasis::quadWeights_
Array1D< double > quadWeights_
Array to store quadrature weights.
Definition PCBasis.h:197
+
PCBasis::rSeed_
int rSeed_
The seed used for the random number generators that sample the xi's in the basis functions.
Definition PCBasis.h:236
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/PCSet_8cpp.html b/docs/html/PCSet_8cpp.html new file mode 100644 index 00000000..19234e01 --- /dev/null +++ b/docs/html/PCSet_8cpp.html @@ -0,0 +1,108 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: PCSet.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Macros
+
PCSet.cpp File Reference
+
+
+ +

Multivariate PC class. +More...

+
#include "PCSet.h"
+#include "PCBasis.h"
+#include <math.h>
+#include "uqtkconfig.h"
+#include "depslatec.h"
+#include "quad.h"
+#include "multiindex.h"
+#include "minmax.h"
+#include "arraytools.h"
+
+ + + +

+Macros

#define DIV_USE_GMRES
 
+

Detailed Description

+

Multivariate PC class.

+
Author
B. Debusschere, C. Safta, K. Sargsyan, K. Chowdhary 2007 -
+

Macro Definition Documentation

+ +

◆ DIV_USE_GMRES

+ +
+
+ + + + +
#define DIV_USE_GMRES
+
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/PCSet_8h.html b/docs/html/PCSet_8h.html new file mode 100644 index 00000000..c9a29dd1 --- /dev/null +++ b/docs/html/PCSet_8h.html @@ -0,0 +1,131 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: PCSet.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes | +Enumerations
+
PCSet.h File Reference
+
+
+ +

Header file for the Multivariate PC class. +More...

+
#include <iostream>
+#include <sstream>
+#include <string.h>
+#include <stdio.h>
+#include <map>
+#include "Array1D.h"
+#include "Array2D.h"
+#include "error_handlers.h"
+#include "ftndefs.h"
+#include "quad.h"
+#include <cvode/cvode.h>
+#include <nvector/nvector_serial.h>
+#include <sunmatrix/sunmatrix_dense.h>
+#include <sunlinsol/sunlinsol_dense.h>
+#include <sundials/sundials_types.h>
+#include <sundials/sundials_context.h>
+#include <sundials/sundials_dense.h>
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  PCSet
 Defines and initializes PC basis function set and provides functions to manipulate PC expansions defined on this basis set. More...
 
+ + + +

+Enumerations

enum  LogCompMethod { TaylorSeries =0 +, Integration + }
 
+

Detailed Description

+

Header file for the Multivariate PC class.

+
Author
B. Debusschere, C. Safta, K. Sargsyan, K. Chowdhary 2007 -
+

Enumeration Type Documentation

+ +

◆ LogCompMethod

+ +
+
+ + + + +
enum LogCompMethod
+
+ + + +
Enumerator
TaylorSeries 
Integration 
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/PCSet_8h_source.html b/docs/html/PCSet_8h_source.html new file mode 100644 index 00000000..9ec4f6fa --- /dev/null +++ b/docs/html/PCSet_8h_source.html @@ -0,0 +1,702 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: PCSet.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
PCSet.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
31
+
32#ifndef PCSET_H_SEEN
+
33#define PCSET_H_SEEN
+
34
+
35#include <iostream>
+
36#include <sstream>
+
37#include <string.h>
+
38#include <stdio.h>
+
39#include <map>
+
40#include "Array1D.h"
+
41#include "Array2D.h"
+
42#include "error_handlers.h"
+
43#include "ftndefs.h"
+
44#include "quad.h"
+
45
+
46/* CVODE headers */
+
47#include <cvode/cvode.h> /* prototypes for CVODE fcts., consts. */
+
48// #include <cvode/cvode_direct.h> /* access to CVDls interface */
+
49#include <nvector/nvector_serial.h> /* serial N_Vector types, fcts., macros */
+
50#include <sunmatrix/sunmatrix_dense.h> /* access to dense SUNMatrix */
+
51#include <sunlinsol/sunlinsol_dense.h> /* access to dense SUNLinearSolver */
+
52// #include <cvode/cvode_dense.h> /* prototype for CVDense */
+
53#include <sundials/sundials_types.h> /* definition of type sunrealtype */
+
54#include <sundials/sundials_context.h> /* for SUNContext_Create */
+
55#include <sundials/sundials_dense.h> /* definitions DlsMat DENSE_ELEM */
+
56
+
57
+
58#include <iostream>
+
59#include <string.h>
+
60#include <stdio.h>
+
61#include <sstream>
+
62using namespace std; // needed for python string conversion
+
63
+
64class PCBasis;
+
65class Quad;
+
66
+
67typedef enum {TaylorSeries=0, Integration} LogCompMethod;
+
68
+
72
+
+
73class PCSet {
+
74public:
+
75
+
82 PCSet(const string sp_type, const int order, const int n_dim, const string pc_type,
+
83 const double alpha=0.0, const double betta=1.0);
+
84
+
85
+
95 PCSet(const string sp_type, const int order, const int n_dim, const string pc_type, const string pc_seq,
+
96 const double alpha=0.0, const double betta=1.0);
+
97
+
98
+
105 PCSet(const string sp_type, const Array1D<int>& maxOrders, const int n_dim, const string pc_type,
+
106 const double alpha=0.0, const double betta=1.0);
+
107
+
115 PCSet(const string sp_type, const Array2D<int>& customMultiIndex, const string pc_type,
+
116 const double alpha=0.0, const double betta=1.0);
+
117
+
119 ~PCSet();
+
120
+
124
+
127 void dPhi_alpha(Array1D<double>& x, Array1D<int>& alpha, Array1D<double>& grad);
+
130 void dPhi(Array1D<double>& x, Array2D<int>& mindex, Array1D<double>& grad, Array1D<double>& ck);
+
133 void dPhi(Array2D<double>& x, Array2D<int>& mindex, Array2D<double>& grad, Array1D<double>& ck);
+
134
+
137 void ddPhi_alpha(Array1D<double>& x, Array1D<int>& alpha, Array2D<double>& grad);
+
140 void ddPhi(Array1D<double>& x, Array2D<int>& mindex, Array2D<double>& grad, Array1D<double>& ck);
+
141
+
145
+
148 void SetQd1d(Array1D<double>& qdpts1d,Array1D<double>& wghts1d, int nqd);
+
149
+
161 void SetQuadRule(const string grid_type,const string fs_type,int param);
+
162
+
164 void SetQuadRule(Quad &quadRule);
+
165
+
169
+
171 void PrintMultiIndex() const;
+
172
+
174 void PrintMultiIndexNormSquared() const;
+
175
+
176
+
180
+
182 string GetPCType() const {return pcType_;}
+
183
+
185 double GetAlpha() const {return alpha_;}
+
186
+
188 double GetBeta() const {return beta_;}
+
189
+
191 void GetMultiIndex(Array2D<int> &mindex) const {mindex=multiIndex_;}
+
192
+
194 void GetMultiIndex(int *mindex) const;
+
195
+
198 void GetNormSq(Array1D<double>& normsq) const {normsq=psiSq_;}
+
199
+
201 int GetNumberPCTerms() const {return nPCTerms_;}
+
202
+
204 int GetNDim() const {return nDim_;}
+
205
+
207 int GetOrder() const {return order_;}
+
208
+
210 int GetNQuadPoints() const {return nQuadPoints_;}
+
211
+
213 void GetQuadPoints(Array2D<double>& quad) const {quad=quadPoints_;}
+
214
+
216 void GetQuadPointsWeights(Array2D<double>& quad, Array1D<double>& wghts) const { quad=quadPoints_; wghts=quadWeights_;}
+
217
+
219 void GetQuadPoints(double* quad) const {for(int i=0;i<nQuadPoints_;i++) for(int j=0;j<nDim_;j++) quad[i*nDim_+j]=quadPoints_(i,j);}
+
220
+
222 void GetQuadWeights(Array1D<double>& wghts) const {wghts=quadWeights_;}
+
223
+
225 void GetQuadWeights(double* wghts) const {for(int i=0;i<nQuadPoints_;i++) wghts[i]=quadWeights_(i);}
+
226
+
229 void GetPsi(Array2D<double>& psi) const {psi=psi_;}
+
230
+
233 void GetPsi(double* psi) const {for(int i=0;i<nQuadPoints_;i++) for(int j=0;j<nPCTerms_;j++) psi[i*nPCTerms_+j]=psi_(i,j);}
+
234
+
236 void GetPsiSq(Array1D<double>& psisq) const {psisq=psiSq_;}
+
237
+
239 void GetPsiSq(double* psisq) const {for(int i=0;i<nPCTerms_;i++) psisq[i]=psiSq_(i);}
+
240
+
242 double GetTaylorTolerance() const {return rTolTaylor_;}
+
243
+
245 void SetTaylorTolerance(const double& rTol) {rTolTaylor_ = rTol;}
+
246
+
248 int GetTaylorTermsMax() const {return maxTermTaylor_;}
+
249
+
251 void SetTaylorTermsMax(const int& maxTerm) {maxTermTaylor_ = maxTerm;}
+
252
+
257 void SetLogCompMethod(const LogCompMethod& logMethod) {logMethod_ = logMethod;}
+
258
+
260 double GetGMRESDivTolerance() const {return rTolGMRESDiv_;}
+
261
+
263 void SetGMRESDivTolerance(const double& rTol) {rTolGMRESDiv_ = rTol;}
+
264
+
265
+
269
+
276 void InitMeanStDv(const double& m, const double& s, double* p) const;
+
277
+
284 void InitMeanStDv(const double& m, const double& s, Array1D<double>& p) const;
+
285
+
289 void Copy(double* p1, const double* p2) const;
+
290
+
295 void Copy(Array1D<double>& p1, const Array1D<double>& p2) const;
+
296
+
299 void Add(const double* p1, const double* p2, double* p3) const;
+
300
+
304 void Add(const Array1D<double>& p1, const Array1D<double>& p2, Array1D<double>& p3) const;
+
305
+
308 void AddInPlace(double* p1, const double* p2) const;
+
309
+
313 void AddInPlace(Array1D<double>& p1, const Array1D<double>& p2) const;
+
314
+
317 void Multiply(const double* p1, const double& a, double* p2) const;
+
318
+
322 void Multiply(const Array1D<double>& p1, const double& a, Array1D<double>& p2) const;
+
323
+
326 void MultiplyInPlace(double* p1, const double& a) const;
+
327
+
331 void MultiplyInPlace(Array1D<double>& p1, const double& a) const;
+
332
+
335 void Subtract(const double* p1, const double* p2, double* p3) const;
+
336
+
340 void Subtract(const Array1D<double>& p1, const Array1D<double>& p2, Array1D<double>& p3) const;
+
341
+
344 void SubtractInPlace(double* p1, const double* p2) const;
+
345
+
349 void SubtractInPlace(Array1D<double>& p1, const Array1D<double>& p2) const;
+
350
+
353 void Prod(const double* p1, const double* p2, double* p3) const;
+
354
+
358 void Prod(const Array1D<double>& p1, const Array1D<double>& p2, Array1D<double>& p3) const;
+
359
+
362 void Prod3(const double* p1, const double* p2, const double* p3, double* p4) const;
+
363
+
367 void Prod3(const Array1D<double>& p1, const Array1D<double>& p2, const Array1D<double>& p3,
+
368 Array1D<double>& p4) const;
+
369
+
374 void Polyn(const double* polycf, int npoly, const double* p1, double* p2) const;
+
375
+
380 void Polyn(const Array1D<double>& polycf, const Array1D<double>& p1, Array1D<double>& p2) const;
+
381
+
392 void PolynMulti(const Array1D<double>& polycf, const Array2D<int>& mindex, const Array2D<double>& p1, Array1D<double>& p2) const;
+
393
+
409 void Exp(const double* p1, double* p2) const;
+
410
+
414 void Exp(const Array1D<double>& p1, Array1D<double>& p2) const;
+
415
+
420 void Log(const double* p1, double* p2) const;
+
421
+
425 void Log(const Array1D<double>& p1, Array1D<double>& p2) const;
+
426
+
431 void Log10(const double* p1, double* p2) const;
+
432
+
436 void Log10(const Array1D<double>& p1, Array1D<double>& p2) const;
+
437
+
443 void RPow(const double* p1, double* p2, const double& a) const;
+
444
+
448 void RPow(const Array1D<double>& p1, Array1D<double>& p2, const double& a) const;
+
449
+
452 void IPow(const double* p1, double* p2, const int& ia) const;
+
453
+
457 void IPow(const Array1D<double>& p1, Array1D<double>& p2, const int& ia) const;
+
458
+
462 void Inv(const double* p1, double* p2) const;
+
463
+
467 void Inv(const Array1D<double>& p1, Array1D<double>& p2) const;
+
468
+
481 void Div(const double* p1, const double* p2, double* p3) const;
+
482
+
486 void Div(const Array1D<double>& p1, const Array1D<double>& p2, Array1D<double>& p3) const;
+
487
+
491 double StDv(const double* p) const;
+
492
+
498 double StDv(const Array1D<double>& p) const;
+
499
+
503 double GetModesRMS(const double* p) const;
+
504
+
509 double GetModesRMS(const Array1D<double>& p) const;
+
510
+
516 void Derivative(const double* p1, double* p2) const;
+
517
+
523 void Derivative(const Array1D<double>& p1, Array1D<double>& p2) const;
+
524
+
526 int GetNumTripleProd() const;
+
528 void GetTripleProd(int *nTriple, int *iProd, int *jProd, double *Cijk) const;
+
530 void GetTripleProd(Array1D<int>& nTriple, Array1D<int>& iProd, Array1D<int>& jProd, Array1D<double>& Cijk) const;
+
532 int GetNumQuadProd() const;
+
534 void GetQuadProd(int *nQuad, int *iProd, int *jProd, int *kProd, double *Cijkl) const;
+
536 void GetQuadProd(Array1D<int> &nQuad, Array1D<int> &iProd, Array1D<int> &jProd, Array1D<int> &kProd,
+
537 Array1D<double> &Cijkl) const;
+
538
+
542
+
545 void SeedBasisRandNumGen(const int& seed) const;
+
546
+
552 void DrawSampleSet(const Array1D<double>& p, Array1D<double>& samples);
+
553
+
557 void DrawSampleSet(const double* p, double* samples, const int& nSamples);
+
558
+
561 void DrawSampleVar(Array2D<double>& samples) const;
+
562 void DrawSampleVar(double *samples, const int &nS, const int &nD) const;
+
563
+
567
+
575 double EvalPC(const Array1D<double>& p, Array1D<double>& randVarSamples);
+
576
+
584 double EvalPC(const double* p, const double* randVarSamples);
+
585
+
589 void EvalPCAtCustPoints(Array1D<double>& xch, Array2D<double>& custPoints,Array1D<double>& p);
+
590
+
593 void EvalBasisAtCustPts(const Array2D<double>& custPoints,Array2D<double>& psi);
+
594
+
595 void EvalBasisAtCustPts(const double* custPoints, const int npts, double* psi);
+
596 // void EvalBasisAtCustPts(const int npts, const int ndim, const int npc, const double *custPoints, double *psi);
+
597
+
601
+
608 void GalerkProjection(const Array1D<double>& fcn, Array1D<double>& ck);
+
609
+
615 void GalerkProjectionMC(const Array2D<double>& x, const Array1D<double>& fcn, Array1D<double>& ck);
+
616
+
620
+
624 int ComputeOrders(Array1D<int>& orders);
+
625
+
631 int ComputeEffDims(int *effdim);
+
632
+
638 int ComputeEffDims(Array1D<int> &effdim);
+
639
+
643 void EncodeMindex(Array1D< Array2D<int> >& sp_mindex);
+
644
+
648
+
651 double ComputeMean(const double *coef);
+
652
+
654 double ComputeMean(Array1D<double>& coef);
+
655
+
660 double ComputeVarFrac(const double *coef, double *varfrac);
+
661
+
666 double ComputeVarFrac(Array1D<double>& coef, Array1D<double>& varfrac);
+
667
+
670 void ComputeMainSens(Array1D<double>& coef, Array1D<double>& mainsens);
+
671
+
674 void ComputeTotSens(Array1D<double>& coef, Array1D<double>& totsens);
+
675
+
679 void ComputeJointSens(Array1D<double>& coef, Array2D<double>& jointsens);
+
680
+
681
+
685
+
688 void SetVerbosity(int verbosity) { uqtkverbose_ = verbosity; }
+
689
+
692 void EvalNormSq(Array1D<double>& normsq);
+
693 void EvalNormSq(double* normsq, const int npc);
+
694
+
698 void EvalNormSqExact(Array1D<double>& normsq);
+
699
+
701 bool IsInDomain(double x);
+
702
+
703
+
704
+
705 private:
+
709 PCSet(): order_(0), nDim_(0) {};
+
710
+
711
+
717 PCSet(const PCSet &obj):order_(obj.order_), nDim_(obj.nDim_) {};
+
718
+
720 void ComputeMaxOrdPerDim();
+
721
+
725 void Initialize(const string ordertype);
+
726
+
728 // void InitQuadrature();
+
729
+
731 void InitISP();
+
733 void InitNISP();
+
734
+
736 void EvalBasisProd3();
+
737
+
739 void EvalBasisProd4();
+
740
+
+
749 static void GMRESMatrixVectorProdWrapper(int* n, double* x, double* y, int* nelt,
+
750 int* ia, int* ja, double* a, int* obj) {
+
751 // Look up *obj in the map that relates integer indices to pointers to PCSet
+
752 OMap_t::iterator it = omap_->find(*obj);
+
753 if(it == omap_->end()) {
+
754 string err_message = (string) "GMRESMatrixVectorProdWrapper():"
+
755 + " the callback object is not a valid entry in the map";
+
756 throw Tantrum(err_message);
+
757 }
+
758 // Perform callback to the member function of the proper PCSet instance
+
759 it->second->GMRESMatrixVectorProd(x, a, y);
+
760
+
761 return;
+
762 }
+
+
763
+
+
772 static void GMRESPreCondWrapper(int* n, double* r, double* z, int* nelt,
+
773 int* ia, int* ja, double* a, int* obj,
+
774 double* rwork, int* iwork) { };
+
+
775
+
781 void GMRESMatrixVectorProd(const double* x, const double*a, double* y) const;
+
782
+
795 void LogTaylor(const double* p1, double* p2) const;
+
796
+
799 void LogInt(const double* p1, double* p2) const;
+
800
+
+
805 static int LogIntRhsWrapper(sunrealtype t, N_Vector y, N_Vector ydot, void *f_data)
+
806 {
+
807 double indxobj = ((double*) f_data)[0] ;
+
808
+
809 OMap_t::iterator it = omap_->find((int) indxobj);
+
810
+
811 if (it == omap_->end())
+
812 {
+
813 string err_message = (string) "LogIntRhsWrapper():"
+
814 + " the callback object is not a valid entry in the map";
+
815 throw Tantrum(err_message);
+
816 }
+
817
+
818 // Perform callback to the member function of the proper PCSet instance
+
819 it->second->LogIntRhs(t,y,ydot,f_data);
+
820
+
821 return ( 0 ) ;
+
822
+
823 }
+
+
824
+
826 int LogIntRhs(sunrealtype t, N_Vector y, N_Vector ydot, void *f_data) const;
+
827
+
830 int uqtkverbose_;
+
831
+
833 string spType_;
+
834
+
836 string pcType_;
+
837
+
839 string pcSeq_;
+
840
+
842 PCBasis* p_basis_;
+
843
+
845 int order_;
+
846
+
848 int maxorddim_;
+
849
+
851 Array1D<int> maxOrders_;
+
852
+
854 Array1D<int> maxOrdPerDim_;
+
855
+
857 const int nDim_;
+
858
+
860 int nQuadPoints_;
+
861
+
863 int nPCTerms_;
+
864
+
866 double rTolTaylor_;
+
867
+
869 int maxTermTaylor_;
+
870
+
872 double SMALL_;
+
873
+
875 double rTolGMRESDiv_;
+
876
+
880 Array2D<double> psi_;
+
881
+
884 Array1D<double> psiSq_;
+
885
+
887 Array2D<double> quadPoints_;
+
888
+
890 Array1D<double> quadWeights_;
+
891
+
893 Array2D<int> quadIndices_;
+
894
+
898 Array2D<int> multiIndex_;
+
899
+
902 Array1D<Array1D<int> > iProd2_;
+
903
+
906 Array1D<Array1D<int> > jProd2_;
+
907
+
910 Array1D<Array1D<double> > psiIJKProd2_;
+
911
+
914 Array1D<Array1D<int> > iProd3_;
+
915
+
918 Array1D<Array1D<int> > jProd3_;
+
919
+
922 Array1D<Array1D<int> > kProd3_;
+
923
+
926 Array1D<Array1D<double> > psiIJKLProd3_;
+
927
+
929 LogCompMethod logMethod_ ;
+
930
+
932 int CVmaxord_;
+
933
+
935 int CVmaxnumsteps_ ;
+
936
+
938 double CVinitstep_;
+
939
+
941 double CVmaxstep_;
+
942
+
944 double CVrelt_;
+
945
+
947 double CVabst_ ;
+
948
+
950 int Check_CVflag(void *flagvalue, const char *funcname, int opt) const;
+
951
+
953 int my_index_;
+
954
+
956 int narg_;
+
957
+
959 double alpha_;
+
961 double beta_;
+
962
+
964 typedef std::map<int, PCSet*> OMap_t;
+
966 static int next_index_;
+
968 static OMap_t *omap_;
+
969
+
970};
+
+
971
+
972#endif /* !PCSET_H_SEEN */
+
Array1D.h
1D Array class for any type T
+
Array2D.h
2D Array class for any type T
+
LogCompMethod
LogCompMethod
Definition PCSet.h:67
+
TaylorSeries
@ TaylorSeries
Definition PCSet.h:67
+
Integration
@ Integration
Definition PCSet.h:67
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
PCBasis
Contains all basis type specific definitions and operations needed to generate a PCSet.
Definition PCBasis.h:47
+
PCSet
Defines and initializes PC basis function set and provides functions to manipulate PC expansions defi...
Definition PCSet.h:73
+
PCSet::quadPoints_
Array2D< double > quadPoints_
Array to store quadrature points.
Definition PCSet.h:887
+
PCSet::maxOrders_
Array1D< int > maxOrders_
Array of maximum orders requested if custom(HDMR) ordering is requested.
Definition PCSet.h:851
+
PCSet::GetPsi
void GetPsi(Array2D< double > &psi) const
Get the values of the basis polynomials evaluated at the quadrature points.
Definition PCSet.h:229
+
PCSet::nQuadPoints_
int nQuadPoints_
Number of quadrature points used.
Definition PCSet.h:860
+
PCSet::GalerkProjection
void GalerkProjection(const Array1D< double > &fcn, Array1D< double > &ck)
Galerkin projection functionalities.
Definition PCSet.cpp:2584
+
PCSet::EvalNormSq
void EvalNormSq(Array1D< double > &normsq)
Evaluate norms-squared of all bases and return in the array normsq.
Definition PCSet.cpp:2962
+
PCSet::psi_
Array2D< double > psi_
Array to store basis functions evaluated at quadrature points for each order: psi_(iqp,...
Definition PCSet.h:880
+
PCSet::Prod
void Prod(const double *p1, const double *p2, double *p3) const
Multiply two PC expansions given by double* arguments p1 and p2, and return the result in p3.
Definition PCSet.cpp:1083
+
PCSet::psiIJKProd2_
Array1D< Array1D< double > > psiIJKProd2_
<\Psi_i \Psi_j \Psi_k> terms that are not zero, for all k
Definition PCSet.h:910
+
PCSet::SetGMRESDivTolerance
void SetGMRESDivTolerance(const double &rTol)
Set the relative tolerance for GMRES in Div routine.
Definition PCSet.h:263
+
PCSet::rTolGMRESDiv_
double rTolGMRESDiv_
GMRES tolerance in Div()
Definition PCSet.h:875
+
PCSet::GetPCType
string GetPCType() const
Get and set variables/arrays inline.
Definition PCSet.h:182
+
PCSet::GetQuadWeights
void GetQuadWeights(Array1D< double > &wghts) const
Get the quadrature weights.
Definition PCSet.h:222
+
PCSet::AddInPlace
void AddInPlace(double *p1, const double *p2) const
Add PC expansions given by double* argument p2 to p1 and return the result in p1.
Definition PCSet.cpp:947
+
PCSet::GetNormSq
void GetNormSq(Array1D< double > &normsq) const
Get the norm-squared.
Definition PCSet.h:198
+
PCSet::GetGMRESDivTolerance
double GetGMRESDivTolerance() const
Get relative tolerance for GMRES in Div routine.
Definition PCSet.h:260
+
PCSet::IsInDomain
bool IsInDomain(double x)
Check if the point x is in the PC domain.
Definition PCSet.cpp:3019
+
PCSet::Polyn
void Polyn(const double *polycf, int npoly, const double *p1, double *p2) const
Evaluates a polynomial of PC that is given in double* argument p1. Polynomial coefficients are given ...
Definition PCSet.cpp:1172
+
PCSet::EvalPCAtCustPoints
void EvalPCAtCustPoints(Array1D< double > &xch, Array2D< double > &custPoints, Array1D< double > &p)
Evaluate the given PC expansion at given set of points with given coefficient vector and return the v...
Definition PCSet.cpp:2453
+
PCSet::Prod3
void Prod3(const double *p1, const double *p2, const double *p3, double *p4) const
Multiply three PC expansions given by double* arguments p1, p2, and p3, and return the result in p4.
Definition PCSet.cpp:1127
+
PCSet::SeedBasisRandNumGen
void SeedBasisRandNumGen(const int &seed) const
Random sample generator functions.
Definition PCSet.cpp:2319
+
PCSet::GalerkProjectionMC
void GalerkProjectionMC(const Array2D< double > &x, const Array1D< double > &fcn, Array1D< double > &ck)
Galerkin Projection via Monte-Carlo integration.
Definition PCSet.cpp:2635
+
PCSet::GetPsiSq
void GetPsiSq(double *psisq) const
Get the basis polynomial norms-squared in a double* array psisq.
Definition PCSet.h:239
+
PCSet::PolynMulti
void PolynMulti(const Array1D< double > &polycf, const Array2D< int > &mindex, const Array2D< double > &p1, Array1D< double > &p2) const
Evaluates a multivariate polynomial of a set of PC inputs given by Array2D argument p1 (each column o...
Definition PCSet.cpp:1210
+
PCSet::EvalNormSqExact
void EvalNormSqExact(Array1D< double > &normsq)
Evaluate norms-squared analytically of all bases and return in the array normsq.
Definition PCSet.cpp:2999
+
PCSet::IPow
void IPow(const double *p1, double *p2, const int &ia) const
Evaluate power ia (an integer number) of PC expansion given by double* argument p1,...
Definition PCSet.cpp:1547
+
PCSet::GetModesRMS
double GetModesRMS(const double *p) const
Compute the rms average of the PC coefficients (i.e. the square root of the average of the square of ...
Definition PCSet.cpp:1910
+
PCSet::PCSet
PCSet()
Dummy default constructor, which should not be used as it is not well defined Therefore we make it pr...
Definition PCSet.h:709
+
PCSet::SMALL_
double SMALL_
Tolerance to avoid floating-point errors.
Definition PCSet.h:872
+
PCSet::rTolTaylor_
double rTolTaylor_
Relative tolerance for Taylor series approximations.
Definition PCSet.h:866
+
PCSet::GetBeta
double GetBeta() const
Get the value of the parameter beta.
Definition PCSet.h:188
+
PCSet::ComputeVarFrac
double ComputeVarFrac(const double *coef, double *varfrac)
Compute the variance fractions of each basis term given coefficients in double *coef; returns the var...
Definition PCSet.cpp:2832
+
PCSet::OMap_t
std::map< int, PCSet * > OMap_t
Definition of a map to connect integer indexes with pointers to this class.
Definition PCSet.h:964
+
PCSet::EvalBasisProd3
void EvalBasisProd3()
Evaluate the expectation of product of three basis functions.
Definition PCSet.cpp:450
+
PCSet::GetMultiIndex
void GetMultiIndex(Array2D< int > &mindex) const
Get the multiindex (return Array2D)
Definition PCSet.h:191
+
PCSet::narg_
int narg_
Number of free parameters to specify the basis.
Definition PCSet.h:956
+
PCSet::CVinitstep_
double CVinitstep_
CVODE parameter: initial step size.
Definition PCSet.h:938
+
PCSet::Check_CVflag
int Check_CVflag(void *flagvalue, const char *funcname, int opt) const
Check cvode return for errors.
Definition PCSet.cpp:2287
+
PCSet::SetQd1d
void SetQd1d(Array1D< double > &qdpts1d, Array1D< double > &wghts1d, int nqd)
Set the quadrature rule.
Definition PCSet.cpp:725
+
PCSet::Log
void Log(const double *p1, double *p2) const
Take the natural logarithm log() of the PC expansion given by double* argument p1,...
Definition PCSet.cpp:1427
+
PCSet::ComputeTotSens
void ComputeTotSens(Array1D< double > &coef, Array1D< double > &totsens)
Compute total effect sensitivity (Sobol) indices given coefficient array coeff; returns the indices i...
Definition PCSet.cpp:2911
+
PCSet::iProd2_
Array1D< Array1D< int > > iProd2_
i-indices of <\Psi_i \Psi_j \Psi_k> terms that are not zero, for all k
Definition PCSet.h:902
+
PCSet::jProd3_
Array1D< Array1D< int > > jProd3_
j-indices of <\Psi_i \Psi_j \Psi_k \Psi_l> terms that are not zero, for all l
Definition PCSet.h:918
+
PCSet::GetQuadProd
void GetQuadProd(int *nQuad, int *iProd, int *jProd, int *kProd, double *Cijkl) const
Returns quad products indices (int*‍/double* version)
Definition PCSet.cpp:686
+
PCSet::GetQuadWeights
void GetQuadWeights(double *wghts) const
Get the quadrature weights folded into a one-dimensional array wghts.
Definition PCSet.h:225
+
PCSet::GetPsi
void GetPsi(double *psi) const
Get the polynomials evaluated at the quadrature points folded into a one-dimensional array psi.
Definition PCSet.h:233
+
PCSet::Derivative
void Derivative(const double *p1, double *p2) const
Computes derivatives of univariate PC given by coefficients p1 returns coefficient vector of the deri...
Definition PCSet.cpp:2202
+
PCSet::SubtractInPlace
void SubtractInPlace(double *p1, const double *p2) const
Subtract PC expansion p2 from p1, and return the result in p1, with all arguments given as double*.
Definition PCSet.cpp:1057
+
PCSet::omap_
static OMap_t * omap_
Map to connect integer indexes with pointers to this class.
Definition PCSet.h:968
+
PCSet::jProd2_
Array1D< Array1D< int > > jProd2_
j-indices of <\Psi_i \Psi_j \Psi_k> terms that are not zero, for all k
Definition PCSet.h:906
+
PCSet::iProd3_
Array1D< Array1D< int > > iProd3_
i-indices of <\Psi_i \Psi_j \Psi_k \Psi_l> terms that are not zero, for all l
Definition PCSet.h:914
+
PCSet::InitNISP
void InitNISP()
Initialize variables that are needed only in non-intrusive computations.
Definition PCSet.cpp:420
+
PCSet::EvalBasisProd4
void EvalBasisProd4()
Evaluate the expectation of product of four basis functions.
Definition PCSet.cpp:580
+
PCSet::Subtract
void Subtract(const double *p1, const double *p2, double *p3) const
Subtract PC expansion p2 from p1, and return the result in p3, with all arguments given as double*.
Definition PCSet.cpp:1027
+
PCSet::order_
int order_
Order of the PC representation.
Definition PCSet.h:845
+
PCSet::Div
void Div(const double *p1, const double *p2, double *p3) const
Divide the PC expansion p1 by p2, and return the result in p3 (All arguments in double* format)
Definition PCSet.cpp:1695
+
PCSet::GetNQuadPoints
int GetNQuadPoints() const
Get the number of quadrature points.
Definition PCSet.h:210
+
PCSet::PrintMultiIndexNormSquared
void PrintMultiIndexNormSquared() const
For all terms, print their multi-index and norm^2 on the screen.
Definition PCSet.cpp:805
+
PCSet::beta_
double beta_
Parameter beta for PCs that require two parameters (SW,JB)
Definition PCSet.h:961
+
PCSet::maxOrdPerDim_
Array1D< int > maxOrdPerDim_
Array of maximum orders per dimension.
Definition PCSet.h:854
+
PCSet::Exp
void Exp(const double *p1, double *p2) const
Take the exp() of the PC expansion given by double* argument p1, and return the result in p2.
Definition PCSet.cpp:1299
+
PCSet::ComputeEffDims
int ComputeEffDims(int *effdim)
Computes the effective dimensionality of each basis term, i.e., the number of dimensions that enter w...
Definition PCSet.cpp:2711
+
PCSet::psiSq_
Array1D< double > psiSq_
Array with the norms squared of the basis functions, corresponding to each term in the PC expansion.
Definition PCSet.h:884
+
PCSet::SetVerbosity
void SetVerbosity(int verbosity)
Other.
Definition PCSet.h:688
+
PCSet::PrintMultiIndex
void PrintMultiIndex() const
Print information on the screen.
Definition PCSet.cpp:778
+
PCSet::Log10
void Log10(const double *p1, double *p2) const
Take the logarithm to base 10 of the PC expansion given by double* argument p1, and return the result...
Definition PCSet.cpp:1468
+
PCSet::quadIndices_
Array2D< int > quadIndices_
Array to store quadrature point indexing; useful for nested rules.
Definition PCSet.h:893
+
PCSet::CVmaxstep_
double CVmaxstep_
CVODE parameter: maximal step size.
Definition PCSet.h:941
+
PCSet::GetOrder
int GetOrder() const
Get the PC order.
Definition PCSet.h:207
+
PCSet::EvalPC
double EvalPC(const Array1D< double > &p, Array1D< double > &randVarSamples)
PC evaluation functionalities.
Definition PCSet.cpp:2409
+
PCSet::GetPsiSq
void GetPsiSq(Array1D< double > &psisq) const
Get the basis polynomial norms-squared in an array class object psisq.
Definition PCSet.h:236
+
PCSet::Initialize
void Initialize(const string ordertype)
Initialization of the appropriate variables.
Definition PCSet.cpp:165
+
PCSet::nPCTerms_
int nPCTerms_
Total number of terms in the PC expansions.
Definition PCSet.h:863
+
PCSet::pcType_
string pcType_
String indicator of PC type.
Definition PCSet.h:836
+
PCSet::GetNumTripleProd
int GetNumTripleProd() const
Returns number of triple products.
Definition PCSet.cpp:536
+
PCSet::ComputeMaxOrdPerDim
void ComputeMaxOrdPerDim()
Compute maximal order per dimension and fill in the array maxOrdPerDim_.
Definition PCSet.cpp:151
+
PCSet::MultiplyInPlace
void MultiplyInPlace(double *p1, const double &a) const
Multiply PC expansions given by double* argument p1 with scalar a and return the result in p1.
Definition PCSet.cpp:1002
+
PCSet::GetTaylorTolerance
double GetTaylorTolerance() const
Get relative tolerance for Taylor series approximations.
Definition PCSet.h:242
+
PCSet::EvalBasisAtCustPts
void EvalBasisAtCustPts(const Array2D< double > &custPoints, Array2D< double > &psi)
Evaluate Basis Functions at given points custPoints and return in the array psi.
Definition PCSet.cpp:2491
+
PCSet::dPhi
void dPhi(Array1D< double > &x, Array2D< int > &mindex, Array1D< double > &grad, Array1D< double > &ck)
Evaluate Gradient at a single d-dim point.
Definition PCSet.cpp:266
+
PCSet::ComputeJointSens
void ComputeJointSens(Array1D< double > &coef, Array2D< double > &jointsens)
Compute joint effect sensitivity (Sobol) indices given coefficient array coeff; returns the indices i...
Definition PCSet.cpp:2934
+
PCSet::GetTripleProd
void GetTripleProd(int *nTriple, int *iProd, int *jProd, double *Cijk) const
Returns triple products indices (int*‍/double* version)
Definition PCSet.cpp:544
+
PCSet::SetQuadRule
void SetQuadRule(const string grid_type, const string fs_type, int param)
Set the quadrature points by specifying a grid type, a full/sparse indicator, and an integer paramete...
Definition PCSet.cpp:742
+
PCSet::ComputeOrders
int ComputeOrders(Array1D< int > &orders)
Multiindex parsing functionalities.
Definition PCSet.cpp:2689
+
PCSet::ComputeMean
double ComputeMean(const double *coef)
Moment/sensitivity extraction given coefficients.
Definition PCSet.cpp:2794
+
PCSet::LogInt
void LogInt(const double *p1, double *p2) const
Computes natural logarithm by numerical integration: calculate p2=ln(p1) by integrating du=dx/x to ge...
Definition PCSet.cpp:2044
+
PCSet::kProd3_
Array1D< Array1D< int > > kProd3_
k-indices of <\Psi_i \Psi_j \Psi_k \Psi_l> terms that are not zero, for all l
Definition PCSet.h:922
+
PCSet::Inv
void Inv(const double *p1, double *p2) const
Evaluate the inverse of PC expansion given by double* argument p1, and return the result in p2....
Definition PCSet.cpp:1646
+
PCSet::uqtkverbose_
int uqtkverbose_
Verbosity level.
Definition PCSet.h:830
+
PCSet::my_index_
int my_index_
Index of this class.
Definition PCSet.h:953
+
PCSet::PCSet
PCSet(const PCSet &obj)
Dummy copy constructor, which should not be used as it is currently not well defined....
Definition PCSet.h:717
+
PCSet::GMRESMatrixVectorProd
void GMRESMatrixVectorProd(const double *x, const double *a, double *y) const
Actual C++ implementation of the matric vector multiplication for GMRES for the division operation.
Definition PCSet.cpp:1687
+
PCSet::GetQuadPointsWeights
void GetQuadPointsWeights(Array2D< double > &quad, Array1D< double > &wghts) const
Get the quadrature points and weights.
Definition PCSet.h:216
+
PCSet::ddPhi_alpha
void ddPhi_alpha(Array1D< double > &x, Array1D< int > &alpha, Array2D< double > &grad)
Evaluate Hessian at a single d-dim point and d-dim basis polynomial.
Definition PCSet.cpp:319
+
PCSet::Add
void Add(const double *p1, const double *p2, double *p3) const
Add two PC expansions given by double* arguments p1 and p2, and return the result in p3.
Definition PCSet.cpp:917
+
PCSet::LogIntRhsWrapper
static int LogIntRhsWrapper(sunrealtype t, N_Vector y, N_Vector ydot, void *f_data)
Wrapper for LogIntRhs. The first component of f_data pointer carries an integer handle identifying th...
Definition PCSet.h:805
+
PCSet::StDv
double StDv(const double *p) const
Returns the standard deviation of PC expansion p in a double* format.
Definition PCSet.cpp:1873
+
PCSet::CVmaxnumsteps_
int CVmaxnumsteps_
CVODE parameter: maximal number of steps.
Definition PCSet.h:935
+
PCSet::p_basis_
PCBasis * p_basis_
Pointer to the class that defines the basis type and functions.
Definition PCSet.h:842
+
PCSet::Copy
void Copy(double *p1, const double *p2) const
Copy PC expansion p2 into p1 (i.e. p1 = p2).
Definition PCSet.cpp:888
+
PCSet::quadWeights_
Array1D< double > quadWeights_
Array to store quadrature weights.
Definition PCSet.h:890
+
PCSet::maxTermTaylor_
int maxTermTaylor_
Max number of terms in Taylor series approximations.
Definition PCSet.h:869
+
PCSet::ComputeMainSens
void ComputeMainSens(Array1D< double > &coef, Array1D< double > &mainsens)
Compute main effect sensitivity (Sobol) indices given coefficient array coef; returns the indices in ...
Definition PCSet.cpp:2882
+
PCSet::DrawSampleSet
void DrawSampleSet(const Array1D< double > &p, Array1D< double > &samples)
Draw a set of samples from the PC expansion p, and return the result in the array samples....
Definition PCSet.cpp:2327
+
PCSet::~PCSet
~PCSet()
Destructor: cleans up all memory and destroys object.
Definition PCSet.cpp:127
+
PCSet::GetTaylorTermsMax
int GetTaylorTermsMax() const
Get maximum number of terms in Taylor series approximations.
Definition PCSet.h:248
+
PCSet::dPhi_alpha
void dPhi_alpha(Array1D< double > &x, Array1D< int > &alpha, Array1D< double > &grad)
Set Gradient and Hessian operators.
Definition PCSet.cpp:244
+
PCSet::RPow
void RPow(const double *p1, double *p2, const double &a) const
Evaluate power a (a real number) of PC expansion given by double* argument p1, and return the result ...
Definition PCSet.cpp:1505
+
PCSet::GetAlpha
double GetAlpha() const
Get the value of the parameter alpha.
Definition PCSet.h:185
+
PCSet::pcSeq_
string pcSeq_
String indicator of multiindex ordering.
Definition PCSet.h:839
+
PCSet::Multiply
void Multiply(const double *p1, const double &a, double *p2) const
Multiply PC expansion p1 with scalar a and return the result in p2. All PCEs are in double* format.
Definition PCSet.cpp:973
+
PCSet::psiIJKLProd3_
Array1D< Array1D< double > > psiIJKLProd3_
<\Psi_i \Psi_j \Psi_k \Psi_l> terms that are not zero, for all l
Definition PCSet.h:926
+
PCSet::logMethod_
LogCompMethod logMethod_
Flag for method to compute log: TaylorSeries or Integration.
Definition PCSet.h:929
+
PCSet::EncodeMindex
void EncodeMindex(Array1D< Array2D< int > > &sp_mindex)
Encode multiIndex into a 'sparse' format where the bases are ordered by their effective dimensionalit...
Definition PCSet.cpp:2745
+
PCSet::LogTaylor
void LogTaylor(const double *p1, double *p2) const
Computes natural logarithm using Taylor expansion: N p2 = ln(p1) = ln(p1Mean) + sum d n=1 n.
Definition PCSet.cpp:1936
+
PCSet::nDim_
const int nDim_
Number of stochastic dimensions (degrees of freedom) in the PC representation.
Definition PCSet.h:857
+
PCSet::GMRESPreCondWrapper
static void GMRESPreCondWrapper(int *n, double *r, double *z, int *nelt, int *ia, int *ja, double *a, int *obj, double *rwork, int *iwork)
Wrapper for preconditioner routine to be called by GMRES.
Definition PCSet.h:772
+
PCSet::CVrelt_
double CVrelt_
CVODE parameter: relative tolerance.
Definition PCSet.h:944
+
PCSet::SetLogCompMethod
void SetLogCompMethod(const LogCompMethod &logMethod)
Set method of computing the log function.
Definition PCSet.h:257
+
PCSet::DrawSampleVar
void DrawSampleVar(Array2D< double > &samples) const
Draw a set of samples of the underlying germ random variable.
Definition PCSet.cpp:2360
+
PCSet::LogIntRhs
int LogIntRhs(sunrealtype t, N_Vector y, N_Vector ydot, void *f_data) const
Evaluates rhs necessary to compute natural logarithm via integration.
Definition PCSet.cpp:2176
+
PCSet::GMRESMatrixVectorProdWrapper
static void GMRESMatrixVectorProdWrapper(int *n, double *x, double *y, int *nelt, int *ia, int *ja, double *a, int *obj)
Wrapper for Matrix-vector multiplication routine to be called by GMRES.
Definition PCSet.h:749
+
PCSet::SetTaylorTolerance
void SetTaylorTolerance(const double &rTol)
Set relative tolerance for Taylor series approximations.
Definition PCSet.h:245
+
PCSet::alpha_
double alpha_
Parameter alpha for PCs that require a parameter (LG,SW,JB)
Definition PCSet.h:959
+
PCSet::CVabst_
double CVabst_
CVODE parameter: absolute tolerance.
Definition PCSet.h:947
+
PCSet::ddPhi
void ddPhi(Array1D< double > &x, Array2D< int > &mindex, Array2D< double > &grad, Array1D< double > &ck)
Evaluate Gradient at a single d-dim point.
Definition PCSet.cpp:358
+
PCSet::CVmaxord_
int CVmaxord_
CVODE parameter: maximal order.
Definition PCSet.h:932
+
PCSet::SetTaylorTermsMax
void SetTaylorTermsMax(const int &maxTerm)
Set maximum number of terms in Taylor series approximations.
Definition PCSet.h:251
+
PCSet::spType_
string spType_
String indicator of ISP or NISP implementation type.
Definition PCSet.h:833
+
PCSet::GetNumberPCTerms
int GetNumberPCTerms() const
Get the number of terms in a PC expansion of this order and dimension.
Definition PCSet.h:201
+
PCSet::next_index_
static int next_index_
index of next object in map
Definition PCSet.h:966
+
PCSet::GetQuadPoints
void GetQuadPoints(double *quad) const
Get the quadrature points folded into a one-dimensional array quad.
Definition PCSet.h:219
+
PCSet::GetNDim
int GetNDim() const
Get the PC dimensionality.
Definition PCSet.h:204
+
PCSet::maxorddim_
int maxorddim_
Maximal order within all dimensions.
Definition PCSet.h:848
+
PCSet::InitMeanStDv
void InitMeanStDv(const double &m, const double &s, double *p) const
Intrusive arithmetics.
Definition PCSet.cpp:833
+
PCSet::InitISP
void InitISP()
Initialize quadrature for computing triple products(ISP) and orthogonal projection(NISP)
Definition PCSet.cpp:394
+
PCSet::multiIndex_
Array2D< int > multiIndex_
Array to store multi-index: multiIndex_(ipc,idim) contains the order of the basis function associated...
Definition PCSet.h:898
+
PCSet::GetQuadPoints
void GetQuadPoints(Array2D< double > &quad) const
Get the quadrature points.
Definition PCSet.h:213
+
PCSet::GetNumQuadProd
int GetNumQuadProd() const
Returns number of quad products.
Definition PCSet.cpp:677
+
Quad
Generates quadrature rules.
Definition quad.h:54
+
quad.h
Header file for the quadrature class.
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/RefPtr_8h.html b/docs/html/RefPtr_8h.html new file mode 100644 index 00000000..58c5be6a --- /dev/null +++ b/docs/html/RefPtr_8h.html @@ -0,0 +1,84 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: RefPtr.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
RefPtr.h File Reference
+
+
+
#include "MyException.h"
+#include <typeinfo>
+#include <unistd.h>
+#include <stddef.h>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  RefPtr< T >
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/RefPtr_8h_source.html b/docs/html/RefPtr_8h_source.html new file mode 100644 index 00000000..6e1f41fa --- /dev/null +++ b/docs/html/RefPtr_8h_source.html @@ -0,0 +1,327 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: RefPtr.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
RefPtr.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
28// -*- C++ -*-
+
29
+
30#ifndef _utility_ref_RefPtr_
+
31#define _utility_ref_RefPtr_
+
32
+
33#include "MyException.h"
+
34#include <typeinfo> // for dynamic_cast
+
35#include <unistd.h>
+
36#include <stddef.h>
+
37
+
45template <class T>
+
+
46class RefPtr {
+
47public:
+
49 typedef T Type;
+
50
+
52 RefPtr() : ptr_(NULL) {}
+
53
+
+
55 RefPtr(T* p) : ptr_(p) {
+
56 grab();
+
57 }
+
+
58
+
+
60 RefPtr(const RefPtr<T>& p) : ptr_(p.ptr_) {
+
61 grab();
+
62 }
+
+
63
+
66 template <class Other>
+
+
67 RefPtr(RefPtr<Other> p) : ptr_(static_cast<T*>(p.pointee())) {
+
68 grab();
+
69 }
+
+
70
+
+
72 ~RefPtr() {
+
73 release();
+
74 }
+
+
75
+
+
77 RefPtr<T>& operator=(T* p) {
+
78 if(p != ptr_) {
+
79 release(); // release the old pointer
+
80 ptr_ = p; // assign our value to this one
+
81 grab(); // grab this pointer
+
82 }
+
83 return *this;
+
84 }
+
+
85
+
+
87 RefPtr<T>& operator=(const RefPtr<T>& p) {
+
88 if(p.ptr_ != ptr_) {
+
89 release();
+
90 ptr_ = p.ptr_;
+
91 grab();
+
92 }
+
93 return *this;
+
94 }
+
+
95
+
99 template <class Other>
+
+
100 RefPtr<T>& cast(Other* p) {
+
101 if(p != ptr_) {
+
102 release();
+
103
+
104 //std::cout << "DEBUG: Dynamic cast from type " << typeid(p).name()
+
105 // << " to " << typeid(T).name() << std::endl;
+
106
+
107 ptr_ = dynamic_cast<T*>(p);
+
108 if(p != NULL && ptr_ == NULL) {
+
109 throw MyException
+
110 (std::string("RefPtr::cast(Other): Failed dynamic cast from ")
+
111 + std::string(typeid(Other).name()) + std::string(" to ") +
+
112 std::string(typeid(Type).name()));
+
113
+
114 }
+
115 grab();
+
116 }
+
117 return *this;
+
118 }
+
+
119
+
123 template <class Other>
+
+
124 RefPtr<T>& cast(RefPtr<Other> p) {
+
125 if(p.ptr_ != ptr_) {
+
126 release();
+
127
+
128 //std::cout << "DEBUG: Dynamic cast from type "
+
129 // << typeid(p.pointee()).name()
+
130 // << " to " << typeid(T).name() << std::endl;
+
131
+
132 ptr_ = dynamic_cast<T*>(p.pointee());
+
133 if(p != NULL && ptr_ == NULL) {
+
134 throw MyException
+
135 (std::string("RefPtr::cast(Other): Failed dynamic cast from ")
+
136 + std::string(typeid(Other).name()) + std::string(" to ") +
+
137 std::string(typeid(Type).name()));
+
138 }
+
139 grab();
+
140 }
+
141 return *this;
+
142 }
+
+
143
+
+
146 T* operator->() const {
+
147 if(ptr_ == NULL) {
+
148 std::cerr << "RefPtr<" << typeid(T).name()
+
149 << ">::operator->() const invoked on a null pointer\n";
+
150 throw MyException("RefPtr::operator->() const");
+
151 }
+
152 return ptr_;
+
153 }
+
+
154
+
+
157 T& operator*() const {
+
158 if(ptr_ == NULL) {
+
159 std::cerr << "RefPtr<" << typeid(T).name()
+
160 << ">::operator*() const invoked on a null pointer\n";
+
161 throw MyException("RefPtr::operator*() const");
+
162 }
+
163 return *ptr_;
+
164 }
+
+
165
+
+
167 T* pointee() {
+
168 return ptr_;
+
169 }
+
+
170
+
+
172 const T* pointee() const {
+
173 return ptr_;
+
174 }
+
+
175
+
+
177 bool operator==(const T* p) const {
+
178 return ptr_ == p;
+
179 }
+
+
180
+
+
182 bool operator==(const RefPtr<T>& p) const {
+
183 return ptr_ == p.pointee();
+
184 }
+
+
185
+
+
187 bool operator!=(const T* p) const {
+
188 return ptr_ != p;
+
189 }
+
+
190
+
+
192 bool operator!=(const RefPtr<T>& p) const {
+
193 return ptr_ != p.ptr_;
+
194 }
+
+
195
+
+
197 inline bool operator<(const RefPtr<T>& p) const {
+
198 return ptr_ < p.ptr_;
+
199 }
+
+
200
+
202 template <class Other>
+
+
203 bool operator<(const RefPtr<Other>& p) const {
+
204 return ptr_ < p.pointee();
+
205 }
+
+
206
+
207private:
+
208 T* ptr_;
+
209
+
+
211 inline void grab() {
+
212 if(ptr_ != NULL)
+
213 ptr_->reference_grab();
+
214 }
+
+
215
+
+
219 inline void release() {
+
220 if(ptr_ != NULL) {
+
221 if(ptr_->reference_release() == 0)
+
222 delete ptr_;
+
223 }
+
224 }
+
+
225};
+
+
226
+
227#endif //_utility_ref_RefPtr_
+ +
MyException
Definition MyException.h:40
+
RefPtr
Definition RefPtr.h:46
+
RefPtr::grab
void grab()
Grab a reference to the current pointee if it is not NULL.
Definition RefPtr.h:211
+
RefPtr::operator=
RefPtr< T > & operator=(const RefPtr< T > &p)
Assign the value of this RefPtr to the pointee of the given RefPtr.
Definition RefPtr.h:87
+
RefPtr::RefPtr
RefPtr(const RefPtr< T > &p)
Construct a new RefPtr and initialize to the given RefPtr pointee.
Definition RefPtr.h:60
+
RefPtr::operator<
bool operator<(const RefPtr< Other > &p) const
Convenience routine to sort pointer values in standard containers.
Definition RefPtr.h:203
+
RefPtr::ptr_
T * ptr_
Definition RefPtr.h:208
+
RefPtr::RefPtr
RefPtr()
Construct a new RefPtr and initialize the pointee to NULL.
Definition RefPtr.h:52
+
RefPtr::operator!=
bool operator!=(const RefPtr< T > &p) const
Test inequality.
Definition RefPtr.h:192
+
RefPtr::operator==
bool operator==(const RefPtr< T > &p) const
Compare the value of this pointee with the pointee of the given RefPtr.
Definition RefPtr.h:182
+
RefPtr::operator==
bool operator==(const T *p) const
Compare the pointee of this RefPtr with the given pointer.
Definition RefPtr.h:177
+
RefPtr::cast
RefPtr< T > & cast(Other *p)
Definition RefPtr.h:100
+
RefPtr::operator*
T & operator*() const
Definition RefPtr.h:157
+
RefPtr::operator->
T * operator->() const
Definition RefPtr.h:146
+
RefPtr::operator!=
bool operator!=(const T *p) const
Test inequality.
Definition RefPtr.h:187
+
RefPtr::pointee
const T * pointee() const
Return the pointee of this RefPtr in a const context.
Definition RefPtr.h:172
+
RefPtr::release
void release()
Definition RefPtr.h:219
+
RefPtr::~RefPtr
~RefPtr()
Destroy this RefPtr.
Definition RefPtr.h:72
+
RefPtr::RefPtr
RefPtr(T *p)
Construct a new RefPtr and initialize the pointee as given.
Definition RefPtr.h:55
+
RefPtr::pointee
T * pointee()
Return the pointee of this RefPtr.
Definition RefPtr.h:167
+
RefPtr::cast
RefPtr< T > & cast(RefPtr< Other > p)
Definition RefPtr.h:124
+
RefPtr::RefPtr
RefPtr(RefPtr< Other > p)
Definition RefPtr.h:67
+
RefPtr::operator=
RefPtr< T > & operator=(T *p)
Assign the value of this RefPtr to the given pointee.
Definition RefPtr.h:77
+
RefPtr::operator<
bool operator<(const RefPtr< T > &p) const
Convenience routine to sort pointer values in standard containers.
Definition RefPtr.h:197
+
RefPtr::Type
T Type
Make the typename that this pointer holds accessible to other objects.
Definition RefPtr.h:49
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLAttributeList_8cpp.html b/docs/html/XMLAttributeList_8cpp.html new file mode 100644 index 00000000..b5fe50d4 --- /dev/null +++ b/docs/html/XMLAttributeList_8cpp.html @@ -0,0 +1,190 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLAttributeList.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
XMLAttributeList.cpp File Reference
+
+
+
#include "XMLAttributeList.h"
+#include "MyException.h"
+#include <ctype.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+ + + + + + + + + +

+Functions

double to_double (const std::string &value)
 
int to_int (const std::string &value)
 
std::string to_string (int value)
 
std::string to_string (double value)
 
+

Function Documentation

+ +

◆ to_double()

+ +
+
+ + + + + +
+ + + + + + + +
double to_double (const std::string & value)
+ 		+inline
+
+ +
+
+ +

◆ to_int()

+ +
+
+ + + + + +
+ + + + + + + +
int to_int (const std::string & value)
+ 		+inline
+
+ +
+
+ +

◆ to_string() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
std::string to_string (double value)
+ 		+inline
+
+ +
+
+ +

◆ to_string() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
std::string to_string (int value)
+ 		+inline
+
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLAttributeList_8h.html b/docs/html/XMLAttributeList_8h.html new file mode 100644 index 00000000..00fe06e8 --- /dev/null +++ b/docs/html/XMLAttributeList_8h.html @@ -0,0 +1,82 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLAttributeList.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
XMLAttributeList.h File Reference
+
+
+
#include "Object.h"
+#include <map>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  XMLAttributeList
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLAttributeList_8h_source.html b/docs/html/XMLAttributeList_8h_source.html new file mode 100644 index 00000000..1eab6d6e --- /dev/null +++ b/docs/html/XMLAttributeList_8h_source.html @@ -0,0 +1,204 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLAttributeList.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
XMLAttributeList.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
28// -*- C++ -*-
+
29
+
30#ifndef _util_xml_class_XMLAttributeList_
+
31#define _util_xml_class_XMLAttributeList_
+
32
+
33#include "Object.h"
+
34#include <map>
+
35
+
+
57class XMLAttributeList : public Object {
+
58 template <class T> friend class RefPtr;
+
59 template <class T> friend class ConstRefPtr;
+
60public:
+
62 typedef std::map< std::string, std::string > Map_t;
+
63
+
65 typedef Map_t::iterator iterator;
+
66 typedef Map_t::const_iterator const_iterator;
+
67
+
69 XMLAttributeList();
+
70
+
71private:
+
73 XMLAttributeList(const XMLAttributeList&);
+
74
+
75public:
+
77 virtual ~XMLAttributeList();
+
78
+
79private:
+
82 XMLAttributeList& operator=(const XMLAttributeList&);
+
83
+
84public:
+
86 int size() const;
+
87
+
89 bool has(const std::string&) const;
+
90
+
93 const std::string& get(const std::string&) const;
+
94
+
97 std::string get(const std::string&, const std::string&) const;
+
98
+
102 int get_int(const std::string&) const;
+
103
+
107 int get_int(const std::string&, int) const;
+
108
+
112 double get_double(const std::string&) const;
+
113
+
117 double get_double(const std::string&, double) const;
+
118
+
124 bool get_bool(const std::string&) const;
+
125
+
129 bool get_bool(const std::string&, bool) const;
+
130
+
132 void set(const std::string&, const std::string&);
+
133
+
135 void set_int(const std::string&, int);
+
136
+
138 void set_double(const std::string&, double);
+
139
+
142 void set_bool(const std::string&, bool);
+
143
+
145 iterator begin();
+
146
+
148 iterator end();
+
149
+
151 const_iterator begin() const;
+
152
+
154 const_iterator end() const;
+
155
+
156private:
+
158 Map_t attribute_;
+
159
+
162 void make_lower_case(std::string&) const;
+
163
+
165 iterator get_location(const std::string&);
+
166
+
168 const_iterator get_location(const std::string&) const;
+
169
+
172 bool boolean_value(const std::string&, const char* where) const;
+
173};
+
+
174
+
175#endif // _util_xml_class_XMLAttributeList_
+ +
Object
Definition Object.h:47
+
RefPtr
Definition RefPtr.h:46
+
XMLAttributeList
Definition XMLAttributeList.h:57
+
XMLAttributeList::end
iterator end()
Get an iterator past the last element.
Definition XMLAttributeList.cpp:301
+
XMLAttributeList::set_double
void set_double(const std::string &, double)
Assign a numerical value to the given key.
Definition XMLAttributeList.cpp:266
+
XMLAttributeList::~XMLAttributeList
virtual ~XMLAttributeList()
Destroy this list.
Definition XMLAttributeList.cpp:92
+
XMLAttributeList::set
void set(const std::string &, const std::string &)
Assign a text attribute to the given key.
Definition XMLAttributeList.cpp:247
+
XMLAttributeList::XMLAttributeList
XMLAttributeList()
Construct a blank attribute list.
Definition XMLAttributeList.cpp:77
+
XMLAttributeList::size
int size() const
Get the number of attributes in the list.
Definition XMLAttributeList.cpp:106
+
XMLAttributeList::attribute_
Map_t attribute_
The attributes.
Definition XMLAttributeList.h:158
+
XMLAttributeList::const_iterator
Map_t::const_iterator const_iterator
Definition XMLAttributeList.h:66
+
XMLAttributeList::Map_t
std::map< std::string, std::string > Map_t
The container type used to hold the attributes.
Definition XMLAttributeList.h:62
+
XMLAttributeList::make_lower_case
void make_lower_case(std::string &) const
Definition XMLAttributeList.cpp:322
+
XMLAttributeList::operator=
XMLAttributeList & operator=(const XMLAttributeList &)
Definition XMLAttributeList.cpp:99
+
XMLAttributeList::iterator
Map_t::iterator iterator
The iterator type returned by this implementation.
Definition XMLAttributeList.h:65
+
XMLAttributeList::get_location
iterator get_location(const std::string &)
Get an iterator pointing to the location of the given string.
Definition XMLAttributeList.cpp:333
+
XMLAttributeList::get_double
double get_double(const std::string &) const
Definition XMLAttributeList.cpp:185
+
XMLAttributeList::boolean_value
bool boolean_value(const std::string &, const char *where) const
Definition XMLAttributeList.cpp:361
+
XMLAttributeList::begin
iterator begin()
Get an iterator to the first element.
Definition XMLAttributeList.cpp:294
+
XMLAttributeList::get_int
int get_int(const std::string &) const
Definition XMLAttributeList.cpp:145
+
XMLAttributeList::set_int
void set_int(const std::string &, int)
Assign an integer value to the given key.
Definition XMLAttributeList.cpp:257
+
XMLAttributeList::ConstRefPtr
friend class ConstRefPtr
Definition XMLAttributeList.h:59
+
XMLAttributeList::has
bool has(const std::string &) const
Return true if the given key is defined.
Definition XMLAttributeList.cpp:113
+
XMLAttributeList::get
const std::string & get(const std::string &) const
Definition XMLAttributeList.cpp:120
+
XMLAttributeList::get_bool
bool get_bool(const std::string &) const
Definition XMLAttributeList.cpp:224
+
XMLAttributeList::set_bool
void set_bool(const std::string &, bool)
Definition XMLAttributeList.cpp:282
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLElement_8cpp.html b/docs/html/XMLElement_8cpp.html new file mode 100644 index 00000000..5f1c3d2a --- /dev/null +++ b/docs/html/XMLElement_8cpp.html @@ -0,0 +1,73 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLElement.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
XMLElement.cpp File Reference
+
+
+
#include "XMLElement.h"
+#include "MyException.h"
+#include <algorithm>
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLElement_8h.html b/docs/html/XMLElement_8h.html new file mode 100644 index 00000000..cbac4272 --- /dev/null +++ b/docs/html/XMLElement_8h.html @@ -0,0 +1,84 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLElement.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
XMLElement.h File Reference
+
+
+
#include "Object.h"
+#include "XMLAttributeList.h"
+#include <vector>
+#include <set>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  XMLElement
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLElement_8h_source.html b/docs/html/XMLElement_8h_source.html new file mode 100644 index 00000000..b8b7b35c --- /dev/null +++ b/docs/html/XMLElement_8h_source.html @@ -0,0 +1,198 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLElement.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
XMLElement.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
28// -*- C++ -*-
+
29
+
30#ifndef _util_xml_class_XMLElement_
+
31#define _util_xml_class_XMLElement_
+
32
+
33#include "Object.h"
+
34#include "XMLAttributeList.h"
+
35#include <vector>
+
36#include <set>
+
37
+
+
58class XMLElement : public Object {
+
59 template <class T> friend class RefPtr;
+
60 template <class T> friend class ConstRefPtr;
+
61public:
+
63 XMLElement(const std::string&);
+
64
+
65private:
+
68 XMLElement(const XMLElement&);
+
69
+
70public:
+
72 virtual ~XMLElement();
+
73
+
74private:
+
77 XMLElement& operator=(const XMLElement&);
+
78
+
79public:
+
81 const std::string& label() const;
+
82
+
84 void set_label(const std::string&);
+
85
+
88 int count_attributes() const;
+
89
+
91 RefPtr<XMLAttributeList> attributes();
+
92
+
94 void set_attributes(RefPtr<XMLAttributeList>);
+
95
+
97 int count_children() const;
+
98
+
101 RefPtr<XMLElement> get_child(int);
+
102
+
109 RefPtr<XMLElement> get_child(const std::string&);
+
110
+
116 void add_child(RefPtr<XMLElement>);
+
117
+
119 void add_child_rpt(RefPtr<XMLElement>);
+
120
+
122 void clear_children();
+
123
+
126 int count_content() const;
+
127
+
130 const std::string& get_content_line(int);
+
131
+
133 void add_content_line(const std::string&);
+
134
+
136 void clear_content();
+
137
+
139 //typedef std::vector< RefPtr<XMLElement> >::iterator child_iterator;
+
140
+
141private:
+
143 std::string label_;
+
144
+
146 RefPtr<XMLAttributeList> attributes_;
+
147
+
149 std::vector< RefPtr<XMLElement> > children_;
+
150
+
152 std::vector<std::string> content_;
+
153
+
156 void recurse(RefPtr<XMLElement>, std::set< RefPtr<XMLElement> >);
+
157};
+
+
158
+
159#endif // _util_xml_class_XMLElement_
+ + +
Object
Definition Object.h:47
+
RefPtr
Definition RefPtr.h:46
+
XMLElement
Definition XMLElement.h:58
+
XMLElement::label_
std::string label_
The iterator type returned for list of children.
Definition XMLElement.h:143
+
XMLElement::get_child
RefPtr< XMLElement > get_child(int)
Definition XMLElement.cpp:111
+
XMLElement::count_children
int count_children() const
Utility function to check how many children this element has.
Definition XMLElement.cpp:104
+
XMLElement::attributes_
RefPtr< XMLAttributeList > attributes_
The list of attributes associated with this element.
Definition XMLElement.h:146
+
XMLElement::set_label
void set_label(const std::string &)
Assign a new label to this node.
Definition XMLElement.cpp:76
+
XMLElement::clear_content
void clear_content()
Clear all text content.
Definition XMLElement.cpp:227
+
XMLElement::content_
std::vector< std::string > content_
The list of content associated with this element.
Definition XMLElement.h:152
+
XMLElement::clear_children
void clear_children()
Erase all child elements from this node.
Definition XMLElement.cpp:196
+
XMLElement::children_
std::vector< RefPtr< XMLElement > > children_
The list of children associated with this element.
Definition XMLElement.h:149
+
XMLElement::~XMLElement
virtual ~XMLElement()
Destructor.
Definition XMLElement.cpp:56
+
XMLElement::add_child
void add_child(RefPtr< XMLElement >)
Definition XMLElement.cpp:145
+
XMLElement::add_content_line
void add_content_line(const std::string &)
Add a line of content.
Definition XMLElement.cpp:220
+
XMLElement::operator=
XMLElement & operator=(const XMLElement &)
Definition XMLElement.cpp:62
+
XMLElement::set_attributes
void set_attributes(RefPtr< XMLAttributeList >)
Assign an attribute list to this element.
Definition XMLElement.cpp:97
+
XMLElement::count_attributes
int count_attributes() const
Definition XMLElement.cpp:83
+
XMLElement::recurse
void recurse(RefPtr< XMLElement >, std::set< RefPtr< XMLElement > >)
Definition XMLElement.cpp:234
+
XMLElement::count_content
int count_content() const
Definition XMLElement.cpp:203
+
XMLElement::attributes
RefPtr< XMLAttributeList > attributes()
Get access to the attribute list.
Definition XMLElement.cpp:90
+
XMLElement::label
const std::string & label() const
Get the label of this node.
Definition XMLElement.cpp:69
+
XMLElement::ConstRefPtr
friend class ConstRefPtr
Definition XMLElement.h:60
+
XMLElement::add_child_rpt
void add_child_rpt(RefPtr< XMLElement >)
Same as add_child, but this allows for repeating children.
Definition XMLElement.cpp:172
+
XMLElement::get_content_line
const std::string & get_content_line(int)
Definition XMLElement.cpp:210
+
XMLElement::XMLElement
XMLElement(const std::string &)
Construct a new xml element object and give it a label.
Definition XMLElement.cpp:40
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLExpatParser_8cpp.html b/docs/html/XMLExpatParser_8cpp.html new file mode 100644 index 00000000..73948a54 --- /dev/null +++ b/docs/html/XMLExpatParser_8cpp.html @@ -0,0 +1,108 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLExpatParser.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
XMLExpatParser.cpp File Reference
+
+
+
#include "XMLExpatParser.h"
+#include "MyException.h"
+#include <cstdio>
+#include <iostream>
+
+ + + +

+Functions

std::string to_string (int value)
 
+

Function Documentation

+ +

◆ to_string()

+ +
+
+ + + + + +
+ + + + + + + +
std::string to_string (int value)
+ 		+inline
+
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLExpatParser_8h.html b/docs/html/XMLExpatParser_8h.html new file mode 100644 index 00000000..ac278cd9 --- /dev/null +++ b/docs/html/XMLExpatParser_8h.html @@ -0,0 +1,84 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLExpatParser.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
XMLExpatParser.h File Reference
+
+
+
#include "XMLParser.h"
+#include <iostream>
+#include <vector>
+#include <expat.h>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  XMLExpatParser
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLExpatParser_8h_source.html b/docs/html/XMLExpatParser_8h_source.html new file mode 100644 index 00000000..17c0eaa1 --- /dev/null +++ b/docs/html/XMLExpatParser_8h_source.html @@ -0,0 +1,170 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLExpatParser.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
XMLExpatParser.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
28// -*- C++ -*-
+
29
+
30#ifndef _util_xml_class_XMLExpatParser_
+
31#define _util_xml_class_XMLExpatParser_
+
32
+
33#include "XMLParser.h"
+
34#include <iostream>
+
35#include <vector>
+
36#include <expat.h>
+
37
+
+
48class XMLExpatParser : public XMLParser {
+
49 template <class T> friend class RefPtr;
+
50 template <class T> friend class ConstRefPtr;
+
51public:
+
53 XMLExpatParser();
+
54
+
55private:
+
58 XMLExpatParser(const XMLExpatParser&);
+
59
+
60public:
+
62 virtual ~XMLExpatParser() throw();
+
63
+
64private:
+
66 XMLExpatParser& operator=(const XMLExpatParser&);
+
67
+
68public:
+
70 RefPtr<XMLElement> parse(std::istream&);
+
71
+
72private:
+
74 XML_Parser parser_;
+
75
+
77 std::vector< RefPtr<XMLElement> > path_;
+
78
+
80 RefPtr<XMLElement> leaf_;
+
81
+
83 void do_start(const XML_Char*, const XML_Char**);
+
84
+
86 void do_end(const XML_Char*);
+
87
+
89 void do_character_data(const XML_Char*, int);
+
90
+
92 void init();
+
93
+
94public:
+
98 static void start_(void*, const XML_Char*, const XML_Char**);
+
99
+
103 static void end_(void*, const XML_Char*);
+
104
+
108 static void character_data_(void*, const XML_Char*, int);
+
109};
+
+
110
+
111#endif // _util_xml_class_XMLExpatParser_
+ +
RefPtr
Definition RefPtr.h:46
+
XMLElement
Definition XMLElement.h:58
+
XMLExpatParser
Definition XMLExpatParser.h:48
+
XMLExpatParser::init
void init()
Initialize the state of the parser.
Definition XMLExpatParser.cpp:191
+
XMLExpatParser::start_
static void start_(void *, const XML_Char *, const XML_Char **)
Definition XMLExpatParser.cpp:211
+
XMLExpatParser::parse
RefPtr< XMLElement > parse(std::istream &)
Parse the given input buffer and return a parse tree.
Definition XMLExpatParser.cpp:86
+
XMLExpatParser::end_
static void end_(void *, const XML_Char *)
Definition XMLExpatParser.cpp:221
+
XMLExpatParser::do_start
void do_start(const XML_Char *, const XML_Char **)
The method used to parse the start tag.
Definition XMLExpatParser.cpp:129
+
XMLExpatParser::do_end
void do_end(const XML_Char *)
The method used to parse the end tag.
Definition XMLExpatParser.cpp:152
+
XMLExpatParser::character_data_
static void character_data_(void *, const XML_Char *, int)
Definition XMLExpatParser.cpp:228
+
XMLExpatParser::parser_
XML_Parser parser_
The Expat parser.
Definition XMLExpatParser.h:74
+
XMLExpatParser::leaf_
RefPtr< XMLElement > leaf_
The current leaf of the parse tree.
Definition XMLExpatParser.h:80
+
XMLExpatParser::XMLExpatParser
XMLExpatParser()
Construct a new parser.
Definition XMLExpatParser.cpp:51
+
XMLExpatParser::ConstRefPtr
friend class ConstRefPtr
Definition XMLExpatParser.h:50
+
XMLExpatParser::path_
std::vector< RefPtr< XMLElement > > path_
The path that we have traversed so far in building the tree.
Definition XMLExpatParser.h:77
+
XMLExpatParser::do_character_data
void do_character_data(const XML_Char *, int)
The method used to parse character (content) data.
Definition XMLExpatParser.cpp:166
+
XMLExpatParser::~XMLExpatParser
virtual ~XMLExpatParser()
Destructor.
Definition XMLExpatParser.cpp:69
+
XMLParser
Definition XMLParser.h:42
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLParser_8cpp.html b/docs/html/XMLParser_8cpp.html new file mode 100644 index 00000000..a3b5c17d --- /dev/null +++ b/docs/html/XMLParser_8cpp.html @@ -0,0 +1,71 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLParser.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
XMLParser.cpp File Reference
+
+
+
#include "XMLParser.h"
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLParser_8h.html b/docs/html/XMLParser_8h.html new file mode 100644 index 00000000..fdb38e93 --- /dev/null +++ b/docs/html/XMLParser_8h.html @@ -0,0 +1,82 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLParser.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
XMLParser.h File Reference
+
+
+
#include "XMLElement.h"
+#include <iostream>
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  XMLParser
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLParser_8h_source.html b/docs/html/XMLParser_8h_source.html new file mode 100644 index 00000000..c4103bb1 --- /dev/null +++ b/docs/html/XMLParser_8h_source.html @@ -0,0 +1,127 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLParser.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
XMLParser.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
28// -*- C++ -*-
+
29
+
30#ifndef _util_xml_class_XMLParser_
+
31#define _util_xml_class_XMLParser_
+
32
+
33#include "XMLElement.h"
+
34#include <iostream>
+
35
+
+
42class XMLParser : virtual public Object {
+
43 template <class T> friend class RefPtr;
+
44 template <class T> friend class ConstRefPtr;
+
45public:
+
47 XMLParser();
+
48
+
50 virtual ~XMLParser();
+
51
+
53 virtual RefPtr<XMLElement> parse(std::istream&) = 0;
+
54};
+
+
55
+
56#endif // _util_xml_class_XMLParser_
+ +
Object
Definition Object.h:47
+
RefPtr
Definition RefPtr.h:46
+
XMLParser
Definition XMLParser.h:42
+
XMLParser::parse
virtual RefPtr< XMLElement > parse(std::istream &)=0
Parse the given input buffer and return the parse tree.
+
XMLParser::XMLParser
XMLParser()
Default constructor. Intended for derived classes.
Definition XMLParser.cpp:35
+
XMLParser::ConstRefPtr
friend class ConstRefPtr
Definition XMLParser.h:44
+
XMLParser::~XMLParser
virtual ~XMLParser()
Destructor.
Definition XMLParser.cpp:42
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLUtils_8cpp.html b/docs/html/XMLUtils_8cpp.html new file mode 100644 index 00000000..7a8b43e6 --- /dev/null +++ b/docs/html/XMLUtils_8cpp.html @@ -0,0 +1,109 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLUtils.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
XMLUtils.cpp File Reference
+
+
+
#include "XMLUtils.h"
+
+ + + + +

+Functions

void dump_xml_tree (RefPtr< XMLElement > tree, const std::string &indentation, std::ostream &outfile)
 Recursively dump XML tree to an output file or stream.
 
+

Function Documentation

+ +

◆ dump_xml_tree()

+ +
+
+ + + + + + + + + + + + + + + + +
void dump_xml_tree (RefPtr< XMLElement > tree,
const std::string & indentation,
std::ostream & outfile )
+
+ +

Recursively dump XML tree to an output file or stream.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLUtils_8h.html b/docs/html/XMLUtils_8h.html new file mode 100644 index 00000000..613f2cc8 --- /dev/null +++ b/docs/html/XMLUtils_8h.html @@ -0,0 +1,112 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLUtils.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
XMLUtils.h File Reference
+
+
+
#include "XMLExpatParser.h"
+#include <iostream>
+
+

Go to the source code of this file.

+ + + + + +

+Functions

void dump_xml_tree (RefPtr< XMLElement >, const std::string &, std::ostream &)
 Recursively dump XML tree to an output file or stream.
 
+

Function Documentation

+ +

◆ dump_xml_tree()

+ +
+
+ + + + + + + + + + + + + + + + +
void dump_xml_tree (RefPtr< XMLElement > tree,
const std::string & indentation,
std::ostream & outfile )
+
+ +

Recursively dump XML tree to an output file or stream.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/XMLUtils_8h_source.html b/docs/html/XMLUtils_8h_source.html new file mode 100644 index 00000000..388ce1a1 --- /dev/null +++ b/docs/html/XMLUtils_8h_source.html @@ -0,0 +1,104 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLUtils.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
XMLUtils.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
28#include "XMLExpatParser.h"
+
29#include <iostream>
+
30
+
32void dump_xml_tree(RefPtr<XMLElement> , const std::string& ,std::ostream& );
+ +
dump_xml_tree
void dump_xml_tree(RefPtr< XMLElement >, const std::string &, std::ostream &)
Recursively dump XML tree to an output file or stream.
Definition XMLUtils.cpp:33
+
RefPtr
Definition RefPtr.h:46
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/_formulas.aux b/docs/html/_formulas.aux new file mode 100644 index 00000000..cdbd6d3e --- /dev/null +++ b/docs/html/_formulas.aux @@ -0,0 +1,2 @@ +\relax +\gdef \@abspage@last{92} diff --git a/docs/html/_formulas.dvi b/docs/html/_formulas.dvi new file mode 100644 index 0000000000000000000000000000000000000000..cc643b747569683f8ff6938e6f7689f9f52e96e5 GIT binary patch literal 19788 zcmc&+dr(x@8Na*BLtZ}64aggO@!ae#F9C^yk(i*MV0@=7^3WAwDJ&6e4L&AyjNTir z+n^2UTsloA)=4L6rZ#_=jOkP^du7{dr|s03G}fA!Or~QZPGWq7e&@bea8r(FPwbt+ z!F$gxzwh-s-}jw!?pH>`{v+=ulrV6aK8a6R)3`px+39NQbfws>_B@NtX0h9g?Y3O& zAsAsm!zQ~%;bO1FZELJ+XlyUtk-Md?zPYirA*bPKM_Y%bt=)Moxvj3PvAx5wtFg4e zmS?dS<+r)A3ybnBMFmAgMQtu_z}U?&?7-b$!oMv42*X^PQSaR0Y)@(H?AVsFwY{!8 z#d^fB0q%#X_nmDVd}=X_N5cp1zUTKdLO2>QjbTQTA_lfR!oYv!pOE^N7KhC$ZRd@{ z%_H%ZU;Ln3e->Qd(r&YgS$)QZmn4UKBsDcH`$hdJe6pk4X7w7~QfoKI2}vpfEWn46 zPK}f4Q+=Kph*AdbUO~WCGK{p8H$9Ulmh#4-SgFk0DwPwVHsPT*JVOa}H*ZS&LPZ_X z8@8*giwJfQ9&BS?;IP4QLEYjej;|g{lvP zbA@jR9P@bo)H8%;ws+N0;v``@4tj=(i2Ba(2f+U`Fu~K}e{dKS)vY6O7u*9i`aB#2 zDSzQ$md#V*;QC??eQjB|^n$0VHsh%31tM4OFV>$@-<2*BZ*MP;GvveLkXpC4ba3JWbOJ=czH=H;wb%_~7 zGQ?uaaFdb@U46iWUb}l_Zrt^>wZ3hTEnPP2pKFvExPvSNXX6Po<84a9m{nmk*bQW` zObKN>Z|u42HOdtRI4MC5 z0ewlF%WS8FSkGpG3JBmPPeHBdBP)fl={E(XxVs$b>3?})ROx&ez$xP`2 z%mQ~(ZreGz?1Ap(pqsudmbL_xHd|#F)Y=nq+7@`u%{rmO!VAbGT7;OuoG!5F=BWwS$3F#DagMboC~U~XoJS^$y&7utTQDq6DU!% zW#WmNbmBpY%Cf9*`{QjaA8h!@)779*PC|9mdz*F2k=L*ChjyZF_pM67;5~bgVVWA5 z>CU%>;M2!g4{AU$3=H6de|_BpJ^&+Q{vM~QZH+R)Sjn6`3r}ImFHlk#(g5@hcXEAU zOCDD`gjT6ov`KP7ueRED%56e)-!7qPW1UweQO=Fu?<4e*of^Jt6*`;)wx7q?#N&)uf)J&l_DLCYeN#q-C-rnPk2?l! zur4&*mLaDzgSnpK!F)0jcobs4XEvN=3k8Hax-S?RyY{D})Y9yrwlP#0+iK4y`4`n8;{cpQ?Q{n5%8ZIm+ z$;l_FcPzw%o<(_6+{7Mczq%miE>(i&Tf(DW3y6Ee!(4KVR0l-*A6d}44M9x-> zhc<`8ZV!3w{eRM&lD(yS9D^AgANJEKG>2kY5Vl$H;a4qV6vrdNLyMzii=y&w_Q^Gq zbBeMJK@K7-E}9%G8eut42`?=xLI6TFk2bfZWu25XPo{0nQatTEyqAu4#B?vC7V%yi zp##DZ1f0uCsSFV}c^R$oAlhJiIYA~4M<;MD8?DU{vAk)~hhnMB{WWaw%ptU)XPALi z2R{5<2?T#9&~6^ zhH^ZVxj(0cQrm34lE~SY;=#>ZN(pWiZ>qi>(E9zOn24`aLM;0+)RIySgeF8|Y;Wff zAsH^igP#8~CFrq4E>VGpvf%raP_7KvB_6{=Tu6)BVwHTGkjIu|qJ4{weyQ>A<9N6i zHU^Aah~Lk%N0^@#{7S0mH`JrufiAh6i|&0aQOrOSODW5`z1v`^>BOs21?rpn4q&~I ziLv|wOQB#K9rZ+We9nKW#4J`A>A4H5Hv0;PZJZFf#{}EXjmrjwFMIBsUJs!X8JdhX z)L!y5_hyw3mO?Kc21GmKg)iS(eYy?4Fu|FCepmYV;qP7*!pdJ~wdO=KWV{@|z-p43 z6!&O`hT&(u2%4B7sV)P9gxJtzlC-(5T7W&+Bg3h0csd>r{@KnQ&I zkFc{+*;b$9z2>dlFG!GA;~{^9RxhMX^MrLguyrMJn{`AUzX}uhP{1CqaGbBQW$aBv zuvg>3Uc84AY%=B6;GtYnNDHMJhY;gauDv0`jEz<^gs%_Bc+q4Uk>EtXtCQ*O2qC27 zQ&wXO)INfXfHZ3{rTl=Bl$ENK+o93-m+9&WBAGdzPs6!KH2wSX(FCgFffEUfi8XkF zmi>W}pvtN?&@GW!p2S02PU{?uJ|pmP zpaKbiTuRA?73@1;nRbSU(2LgLN${wZk_2OUFiCK)$3#o3_OBrFb$A;K&b5rzVPDs3CBl)+zx|x<+xFCnBe@@;&8q&suhRX=l-eCvaZOn!c8qDcR6nfrk-y+E{^XJ zZb~qh=|y2UW0<5UBunBpVcI3|*H;KhPhDm~{d+A*{_Vmp@!n&XqowD;F2eQguYv_n zo%2+I8DI$no$HT!VS_r?Yn63`*TwRtXa5EZVyLY4tqUBe$PW7EhL{d%!sY#A1;1ie z-vS{T$I^a2CN~XKLuTBlRL#!vmRAqC%uk+%oDkYGVK8>pK%zgW{NVAo_sJCHIqouX7clW*(S}(?Q z{!d!zsPtk?XFeU*i!mR_(ZeqJfMt@f<1?3=$L!iSu8vgPO3Z+i^n;5&PVbhPh@blT z!3hq3-_&}OVV>CQ`$jSJA}_;Hu patch level 1 +L3 programming layer <2024-02-20> +(/usr/local/texlive/2024/texmf-dist/tex/latex/base/article.cls +Document Class: article 2023/05/17 v1.4n Standard LaTeX document class +(/usr/local/texlive/2024/texmf-dist/tex/latex/base/size10.clo +File: size10.clo 2023/05/17 v1.4n Standard LaTeX file (size option) +) +\c@part=\count188 +\c@section=\count189 +\c@subsection=\count190 +\c@subsubsection=\count191 +\c@paragraph=\count192 +\c@subparagraph=\count193 +\c@figure=\count194 +\c@table=\count195 +\abovecaptionskip=\skip48 +\belowcaptionskip=\skip49 +\bibindent=\dimen140 +) (/usr/local/texlive/2024/texmf-dist/tex/generic/iftex/iftex.sty +Package: iftex 2022/02/03 v1.0f TeX engine tests +) (/usr/local/texlive/2024/texmf-dist/tex/latex/base/ifthen.sty +Package: ifthen 2022/04/13 v1.1d Standard LaTeX ifthen package (DPC) +) (/usr/local/texlive/2024/texmf-dist/tex/latex/graphics/epsfig.sty +Package: epsfig 2017/06/25 v1.7b (e)psfig emulation (SPQR) +(/usr/local/texlive/2024/texmf-dist/tex/latex/graphics/graphicx.sty +Package: graphicx 2021/09/16 v1.2d Enhanced LaTeX Graphics (DPC,SPQR) +(/usr/local/texlive/2024/texmf-dist/tex/latex/graphics/keyval.sty +Package: keyval 2022/05/29 v1.15 key=value parser (DPC) +\KV@toks@=\toks17 +) (/usr/local/texlive/2024/texmf-dist/tex/latex/graphics/graphics.sty +Package: graphics 2022/03/10 v1.4e Standard LaTeX Graphics (DPC,SPQR) +(/usr/local/texlive/2024/texmf-dist/tex/latex/graphics/trig.sty +Package: trig 2021/08/11 v1.11 sin cos tan (DPC) +) (/usr/local/texlive/2024/texmf-dist/tex/latex/graphics-cfg/graphics.cfg +File: graphics.cfg 2016/06/04 v1.11 sample graphics configuration +) +Package graphics Info: Driver file: dvips.def on input line 107. +(/usr/local/texlive/2024/texmf-dist/tex/latex/graphics-def/dvips.def +File: dvips.def 2022/09/22 v3.1e Graphics/color driver for dvips +)) +\Gin@req@height=\dimen141 +\Gin@req@width=\dimen142 +) +\epsfxsize=\dimen143 +\epsfysize=\dimen144 +) (/usr/local/texlive/2024/texmf-dist/tex/latex/base/inputenc.sty +Package: inputenc 2021/02/14 v1.3d Input encoding file +\inpenc@prehook=\toks18 +\inpenc@posthook=\toks19 +) (/usr/local/texlive/2024/texmf-dist/tex/latex/xcolor/xcolor.sty +Package: xcolor 2023/11/15 v3.01 LaTeX color extensions (UK) +(/usr/local/texlive/2024/texmf-dist/tex/latex/graphics-cfg/color.cfg +File: color.cfg 2016/01/02 v1.6 sample color configuration +) +Package xcolor Info: Driver file: dvips.def on input line 274. +(/usr/local/texlive/2024/texmf-dist/tex/latex/graphics/mathcolor.ltx) +Package xcolor Info: Model `cmy' substituted by `cmy0' on input line 1350. +Package xcolor Info: Model `RGB' extended on input line 1366. +Package xcolor Info: Model `HTML' substituted by `rgb' on input line 1368. +Package xcolor Info: Model `Hsb' substituted by `hsb' on input line 1369. +Package xcolor Info: Model `tHsb' substituted by `hsb' on input line 1370. +Package xcolor Info: Model `HSB' substituted by `hsb' on input line 1371. +Package xcolor Info: Model `Gray' substituted by `gray' on input line 1372. +Package xcolor Info: Model `wave' substituted by `hsb' on input line 1373. +) +(/usr/local/texlive/2024/texmf-dist/tex/latex/newunicodechar/newunicodechar.sty +Package: newunicodechar 2018/04/08 v1.2 Defining Unicode characters +) (/usr/local/texlive/2024/texmf-dist/tex/latex/l3backend/l3backend-dvips.def +File: l3backend-dvips.def 2024-02-20 L3 backend support: dvips +\l__pdf_internal_box=\box51 +\g__pdf_backend_object_int=\count196 +\l__pdf_backend_content_box=\box52 +\l__pdf_backend_model_box=\box53 +\g__pdf_backend_annotation_int=\count197 +\g__pdf_backend_link_int=\count198 +\g__pdf_backend_link_sf_int=\count199 +) +No file _formulas.aux. +\openout1 = `_formulas.aux'. + +LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 30. +LaTeX Font Info: ... okay on input line 30. +LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 30. +LaTeX Font Info: ... okay on input line 30. +LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 30. +LaTeX Font Info: ... okay on input line 30. +LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 30. +LaTeX Font Info: ... okay on input line 30. +LaTeX Font Info: Checking defaults for TS1/cmr/m/n on input line 30. +LaTeX Font Info: ... okay on input line 30. +LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 30. +LaTeX Font Info: ... okay on input line 30. +LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 30. +LaTeX Font Info: ... okay on input line 30. +LaTeX Font Info: External font `cmex10' loaded for size +(Font) <7> on input line 31. +LaTeX Font Info: External font `cmex10' loaded for size +(Font) <5> on input line 31. +[1 + +] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] +[19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] +[35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50] +[51] [52] [53] [54] [55] [56] [57] [58] [59] [60] [61] [62] [63] [64] [65] [66] +[67] [68] [69] [70] [71] [72] [73] [74] [75] [76] [77] [78] [79] [80] [81] [82] +[83] [84] [85] [86] [87] [88] [89] [90] [91] +! Missing $ inserted. + + $ +l.312 + +I've inserted a begin-math/end-math symbol since I think +you left one out. Proceed, with fingers crossed. + +! Display math should end with $$. + + \tex_par:D +l.312 + +The `$' that I just saw supposedly matches a previous `$$'. +So I shall assume that you typed `$$' both times. + + +! LaTeX Error: Bad math environment delimiter. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H for immediate help. + ... + +l.313 \] + +Your command was ignored. +Type I to replace it with another command, +or to continue without it. + +[92] (./_formulas.aux) + *********** +LaTeX2e <2023-11-01> patch level 1 +L3 programming layer <2024-02-20> + *********** + ) +Here is how much of TeX's memory you used: + 1571 strings out of 474117 + 25794 string characters out of 5743709 + 1926184 words of memory out of 5000000 + 23965 multiletter control sequences out of 15000+600000 + 558996 words of font info for 39 fonts, out of 8000000 for 9000 + 1141 hyphenation exceptions out of 8191 + 72i,5n,79p,224b,103s stack positions out of 10000i,1000n,20000p,200000b,200000s + +Output written on _formulas.dvi (92 pages, 19788 bytes). diff --git a/docs/html/_formulas.tex b/docs/html/_formulas.tex new file mode 100644 index 00000000..9d270028 --- /dev/null +++ b/docs/html/_formulas.tex @@ -0,0 +1,316 @@ +\documentclass{article} +\usepackage{iftex} +\usepackage{ifthen} +\usepackage{epsfig} +\usepackage[utf8]{inputenc} +\usepackage{xcolor} +\ifPDFTeX +\usepackage{newunicodechar} + \makeatletter + \def\doxynewunicodechar#1#2{% + \@tempswafalse + \edef\nuc@tempa{\detokenize{#1}}% + \if\relax\nuc@tempa\relax + \nuc@emptyargerr + \else + \edef\@tempb{\expandafter\@car\nuc@tempa\@nil}% + \nuc@check + \if@tempswa + \@namedef{u8:\nuc@tempa}{#2}% + \fi + \fi + } + \makeatother + \doxynewunicodechar{⁻}{${}^{-}$}% Superscript minus + \doxynewunicodechar{²}{${}^{2}$}% Superscript two + \doxynewunicodechar{³}{${}^{3}$}% Superscript three + +\fi +\pagestyle{empty} +\begin{document} +$j+i\times ny$ +\pagebreak + +$ C=A\backslash B$ +\pagebreak + +$y=\alpha Ax$ +\pagebreak + +$\left[n\times m\right]$ +\pagebreak + +$m$ +\pagebreak + +$n$ +\pagebreak + +$y=\alpha A^Tx$ +\pagebreak + +$\left[m\times n\right]$ +\pagebreak + +$C=\alpha AB$ +\pagebreak + +$m\times m$ +\pagebreak + +$C=\alpha A^TB$ +\pagebreak + +$x_i=x_i+\alpha y_i^ip$ +\pagebreak + +$a^T B c$ +\pagebreak + +$A^T A$ +\pagebreak + +$\left[n\times k\right]$ +\pagebreak + +$\left[n\times n\right]$ +\pagebreak + +$A_{n+1,i}=A_{i,n+1}=x_i$ +\pagebreak + +$A_{n+1,n+1}=scal$ +\pagebreak + +$V^*$ +\pagebreak + +$A$ +\pagebreak + +$\alpha$ +\pagebreak + +$\beta$ +\pagebreak + +$y=f(\lambda;x)$ +\pagebreak + +$x\in\mathbf{R}^s$ +\pagebreak + +$\lambda\in\mathbf{R}^d$ +\pagebreak + +$r$ +\pagebreak + +$\lambda$ +\pagebreak + +$x$ +\pagebreak + +$r\times d$ +\pagebreak + +$n\times s$ +\pagebreak + +$r\times n$ +\pagebreak + +$y=f(\lambda;x)=\lambda x$ +\pagebreak + +$x\in\mathbf{R}^1$ +\pagebreak + +$\lambda\in\mathbf{R}^1$ +\pagebreak + +$y=f(\lambda;x)=\lambda_1 x+\lambda_2x^2$ +\pagebreak + +$\lambda\in\mathbf{R}^2$ +\pagebreak + +$y=f(\lambda;x)=e^{\lambda_1 +\lambda_2x}$ +\pagebreak + +$y=f(\lambda;x)=e^{\lambda_1 +\lambda_2x+\lambda_3x^2}$ +\pagebreak + +$\lambda\in\mathbf{R}^3$ +\pagebreak + +$y=f(\lambda;x)=\lambda$ +\pagebreak + +$y=f(\lambda;x)=\lambda_1+\lambda_2x$ +\pagebreak + +$y=f(\lambda;x)=\frac{x d_w}{A_w \lambda}+T_0$ +\pagebreak + +$d_w=0.1, A_w=0.04, T_0=273$ +\pagebreak + +$y=f(\lambda;x)=\frac{x Q}{A_w \lambda_1}+\lambda_2$ +\pagebreak + +$A_w=0.04, Q=20.0$ +\pagebreak + +$y=f(\lambda;x)=\lambda_1+\lambda_2 x+\lambda_3 x^2+ \lambda_4 (x+1)^{3.5}$ +\pagebreak + +$\lambda\in\mathbf{R}^4$ +\pagebreak + +$y=f(\lambda;x)=\lambda_2 e^{\lambda_1 x} - 2$ +\pagebreak + +$y=f(\lambda;x_i)=\lambda_i$ +\pagebreak + +$i=1,...,d$ +\pagebreak + +$x_i\in\mathbf{R}^1$ +\pagebreak + +$y=f(\lambda;x)=\sum_{\alpha\in{\cal S}} \lambda_\alpha \Psi_\alpha(x)$ +\pagebreak + +$\lambda\in\mathbf{R}^{|{\cal S}|}$ +\pagebreak + +${\cal S}$ +\pagebreak + +$z=(\lambda,x)$ +\pagebreak + +$y=f(\lambda;x)=\sum_{\alpha\in{\cal S}} c_\alpha \Psi_\alpha(\lambda,x)$ +\pagebreak + +$c_\alpha$ +\pagebreak + +$y=f(\lambda;x^{(i)})=\sum_{\alpha\in{\cal S}} c_{\alpha,i} \Psi_\alpha(\lambda)$ +\pagebreak + +$c_{\alpha,i}$ +\pagebreak + +$y=f(\lambda;x^{(i)})=\sum_{\alpha\in{\cal S}_i} c_{\alpha,i} \Psi_\alpha(\lambda)$ +\pagebreak + +$(-\infty,\infty)$ +\pagebreak + +$[-1,1]$ +\pagebreak + +$\xi=R^{-1}(u)\in\mathbf{R}^d$ +\pagebreak + +$u\in[0,1]^d$ +\pagebreak + +$d$ +\pagebreak + +$d\times M$ +\pagebreak + +$N\times d$ +\pagebreak + +$u=R(\xi)$ +\pagebreak + +$\xi$ +\pagebreak + +$M\times d$ +\pagebreak + +$\xi_d$ +\pagebreak + +$[0,1]^d$ +\pagebreak + +\[ +F(t,\theta) = \left < F(t,\theta) \right >_{\theta} + + \sum_{k=1}^{\infty} \sqrt{\lambda_k} f_k(t) \xi_k\] +\pagebreak + +$C$ +\pagebreak + +$t$ +\pagebreak + +$w$ +\pagebreak + +\[ \int C(s,t)f(t)dt=\lambda f(s) \rightarrow \sum w_j C(s_i,t_j) f_k(t_j) = \lambda_k f_k(s_i)\] +\pagebreak + +\[A g=\lambda g \] +\pagebreak + +$A=W K W$ +\pagebreak + +$g=Wf$ +\pagebreak + +$W$ +\pagebreak + +$W_{ii}=\sqrt{w_i}$ +\pagebreak + +$K_{ij}=Cov(t_i,t_j)$ +\pagebreak + +$\lambda_k$ +\pagebreak + +$f_k=W^{-1}g_k$ +\pagebreak + +$F(t,\theta_l)$ +\pagebreak + +$\xi_k$ +\pagebreak + +$F$ +\pagebreak + +$f_k$ +\pagebreak + +\[ \left.\xi_k\right\vert_{\theta_l}=\left _{\theta}, f_k(t) \right >_t/\sqrt{\lambda_k} \] +\pagebreak + +\[ +\left.\xi_k\right\vert_{\theta_l}=\sum_{i=1}^{N_p} w_i\left(F(t_i,\theta_l)-\left < + F(t_i,\theta) \right >_{\theta} \right) f_k(t_i)/\sqrt{\lambda_k} \] +\pagebreak + +\[ + F(t_i,\theta_l) = \left < F(t_i,\theta) \right >_{\theta} + + \sum_{k=1}^{nKL} \sqrt{\lambda_k} f_k(t_i) \left. \xi_k\right\vert_{\theta_l} + +\] +\pagebreak + +\end{document} diff --git a/docs/html/_formulas_dark.aux b/docs/html/_formulas_dark.aux new file mode 100644 index 00000000..cdbd6d3e --- /dev/null +++ b/docs/html/_formulas_dark.aux @@ -0,0 +1,2 @@ +\relax +\gdef \@abspage@last{92} diff --git a/docs/html/_formulas_dark.dvi b/docs/html/_formulas_dark.dvi new file mode 100644 index 0000000000000000000000000000000000000000..79d9bb6495c0dfc6569251c39b61267fa0963c1a GIT binary patch literal 19824 zcmc&+32YSC8J^wsfe#KFjE!%b%jdGYzOc;_48f3?+XM(lRpX1bvDdZN!A2zxAc`o= z#KX3R#+AlVl0s1{C~8_&G$L*Bcn7ai5~)>zrlB+`MQudE5fF~J|C`Hev#B3%U+G9j zX7=s)`~K_w|Nq{bdq%_lqwgn{GH{vxk&wE+c2lae-PO|WO0`*R`DUxtY_pZvta+Bh zFv5U_jdu;h#omhFQCn40+iKsLx4o*mv9`G;x8@Z`OPjf+)p;wWrK+X2wau}+)?R4M zH`|H}T3k6r#rfvq!s6oM78loN>|_|W@9|skFUv1vm|IcR&YjNI)Ry+P9jW!LRh_BU zqlTB^ewcdS*}}oMo`dmdc;DkI{=Q@J^O##v2w#1xv%R@Sd9p@PSujM?2*wq1 zh7xRD)MOqSfq@lpSDfQkHFBGjlSLN8)jqFr5;I4puO94SO8mnh7=PJT!7I zn9UKhd6Xa^ew{KuwtLHE7%zmBZe|@E$D7W~mLQcOi2D;Uxn7~fwQ96}c;>ZlRTBZ9 zgaFwUlU(g{K%il#_EPp^P9hiRqXqKca*(k_cri9?B^llu-KC0Cl`! z>g!^L6eE`MhEpe{4l$F6LmVE5sANhUI(i@ydTs8ZS@Cz$H~6+ews%-9zh9@!z-?qM zI0KW+bxLGnR5BXu8Zy}Nc(9{SQ-a+}WGM-FD5us@LK#DZG7%5uv`9)Q$%^bGOq6FS zp={-iU5~v+xxxS=C8!~wFNt%-Y@&o%&t@SM5Wr2r0n0Gc!zsb_6);&tDHRj(uP7l_ zCleIGBtMgh+wPWP$c#G;k4bDJB_`UGqDJ98K=-oWMy9D*c$8ryW&cK76wC34qjx0OO#3Pa%`V5I^!IBSo zw^D5a>yeU|11OQVWnogi^sK0|EGsr;_8W4w(22AUcV|B*oC^? z4=MzM_u?UjsjFqCIDah!pFhrePy>o#U;rQd(>orp0T>zk$9Pq2>lIO2$c#K2PhctM zCE>kRj*b z(M^43d4p^phwicbgmYP*jjc~AaKi;knmo~SO+2!O)j2j z(ymgn1YOs>YzZhO_tp4X=oGtc@*N^NW;{CScPY`q$UD>kXNA=;6!he+F?!HbvPQR0 z%9!VyGAduu)5(19IJCh!&~R&}oX+&;c}n^V$b!H;JXy``rzESf6LdZqYzrRjS+^;{ z##gb8ljpEei6;0f4@o8Dk^JNv$zBGvB}7Q62%?x3kNE79&w{uT&|!(!w0?z{DOb?i zEh2I@JaTj1q(shvA`iqGn1Xtsr(9A}QtBq_7Ukg~pZh8$?9#>B_LhDx5^%wBat%xzbk=4;%eT62ge-6N*-IH?SZ z@nn!QkCKPzEQpM)1P^U4h20+V+WUVEb4vD>;c@h5a(vkLR-ri*OM|e@f)Br89tm+g z3V3L7lx$H{-t#`bWODyXS%<)bNQ(=`$BIUn?@_`_ON-!uP|c&wZRy$XN}46p)}|d# zI`dA@k&c+*Wz-_xYb7*5IH-VgStyku;ubHXH6BDOY%eFs#NmJi&Sj;w86u81E%-#V z%dvkQ+dXvvZRi zCOzTif-*b;c}7YE$O?wVm?(co3#GQ%d?k^wFTsPG@1O*C6>nPoFrfAO=kX91#8E;l z+cDIV(mHTW@W#0A_5s3RxD*rmMM}`)h)kj!4`ty2N+?$bY!b`x5Es!3ZE;GzO&G_P zW1{_-j(n-b-xu(3&p#Y6ZXsbm&mLudQ21l1yw^~Tb_crTaxS`iS(2EECKfx(y1hG~ z>w4;hRF3+lz5`e{_HJsn9DJSy-| zmi(3yN*58z6?iC1cThqJ>wpA_C>)x^xfVO(#s%Kon{n|K;wNktzm1Mz({%+vzx!6p&^DjeZ6 z%z~c>EdI9vA;h~sgV1y)#?*6fk|1A=hkPNeUPzf{2^)Ec))mNXHWFF<8cg7y z2P|?W#`y|c#$HDRdo3R9=YB*9HkokO;h|i#jTTDP55dPL+&Uw|jEz<^gfEZ8deLMW zk?2IftCQ)T2qC2HCaXmY)INfXAZS+Nu`DxDVp*ZGY=B1JM^n@jL~`VGz5?eS(e&>d zkH&;L9%3S4F|i(#=uJvQl~rvBw?t}r2@maJTIXQ&8G#Qyds5ZPMizyqk?u-ls!6I> zltajB10Jg-uTj!LIU;~eO38*5>^otZHp)Y2MH}%LJimbwgONO##JM-&p7ydc8NgCLHYrayty(sN+V(VWRVEi^Dm>uvQ%AT>6U=mUTgn6mDuM zx!d_bFm-+9adCW?a9@JCOfL$<8N)b5Az2c)1y3)_0)Kslki6|W3*z5vPWG=Cc9Hi9 zy&SWD2zn9jG@Jkpp1b5(1!{mL5Ol78;`d)x=X$NOj_|rz-gMv(upoxYYTvrRfr{*) zuf7m7AWgWwf2817)aqLxMB`}M&)4LpfvU*NFDg{Ev%GotJ`^>1$0^%L1)-_l_c>6H zJf+5kSg(sDz-`4-`trb!Qwd4SkATj patch level 1 +L3 programming layer <2024-02-20> +(/usr/local/texlive/2024/texmf-dist/tex/latex/base/article.cls +Document Class: article 2023/05/17 v1.4n Standard LaTeX document class +(/usr/local/texlive/2024/texmf-dist/tex/latex/base/size10.clo +File: size10.clo 2023/05/17 v1.4n Standard LaTeX file (size option) +) +\c@part=\count188 +\c@section=\count189 +\c@subsection=\count190 +\c@subsubsection=\count191 +\c@paragraph=\count192 +\c@subparagraph=\count193 +\c@figure=\count194 +\c@table=\count195 +\abovecaptionskip=\skip48 +\belowcaptionskip=\skip49 +\bibindent=\dimen140 +) (/usr/local/texlive/2024/texmf-dist/tex/generic/iftex/iftex.sty +Package: iftex 2022/02/03 v1.0f TeX engine tests +) (/usr/local/texlive/2024/texmf-dist/tex/latex/base/ifthen.sty +Package: ifthen 2022/04/13 v1.1d Standard LaTeX ifthen package (DPC) +) (/usr/local/texlive/2024/texmf-dist/tex/latex/graphics/epsfig.sty +Package: epsfig 2017/06/25 v1.7b (e)psfig emulation (SPQR) +(/usr/local/texlive/2024/texmf-dist/tex/latex/graphics/graphicx.sty +Package: graphicx 2021/09/16 v1.2d Enhanced LaTeX Graphics (DPC,SPQR) +(/usr/local/texlive/2024/texmf-dist/tex/latex/graphics/keyval.sty +Package: keyval 2022/05/29 v1.15 key=value parser (DPC) +\KV@toks@=\toks17 +) (/usr/local/texlive/2024/texmf-dist/tex/latex/graphics/graphics.sty +Package: graphics 2022/03/10 v1.4e Standard LaTeX Graphics (DPC,SPQR) +(/usr/local/texlive/2024/texmf-dist/tex/latex/graphics/trig.sty +Package: trig 2021/08/11 v1.11 sin cos tan (DPC) +) (/usr/local/texlive/2024/texmf-dist/tex/latex/graphics-cfg/graphics.cfg +File: graphics.cfg 2016/06/04 v1.11 sample graphics configuration +) +Package graphics Info: Driver file: dvips.def on input line 107. +(/usr/local/texlive/2024/texmf-dist/tex/latex/graphics-def/dvips.def +File: dvips.def 2022/09/22 v3.1e Graphics/color driver for dvips +)) +\Gin@req@height=\dimen141 +\Gin@req@width=\dimen142 +) +\epsfxsize=\dimen143 +\epsfysize=\dimen144 +) (/usr/local/texlive/2024/texmf-dist/tex/latex/base/inputenc.sty +Package: inputenc 2021/02/14 v1.3d Input encoding file +\inpenc@prehook=\toks18 +\inpenc@posthook=\toks19 +) (/usr/local/texlive/2024/texmf-dist/tex/latex/xcolor/xcolor.sty +Package: xcolor 2023/11/15 v3.01 LaTeX color extensions (UK) +(/usr/local/texlive/2024/texmf-dist/tex/latex/graphics-cfg/color.cfg +File: color.cfg 2016/01/02 v1.6 sample color configuration +) +Package xcolor Info: Driver file: dvips.def on input line 274. +(/usr/local/texlive/2024/texmf-dist/tex/latex/graphics/mathcolor.ltx) +Package xcolor Info: Model `cmy' substituted by `cmy0' on input line 1350. +Package xcolor Info: Model `RGB' extended on input line 1366. +Package xcolor Info: Model `HTML' substituted by `rgb' on input line 1368. +Package xcolor Info: Model `Hsb' substituted by `hsb' on input line 1369. +Package xcolor Info: Model `tHsb' substituted by `hsb' on input line 1370. +Package xcolor Info: Model `HSB' substituted by `hsb' on input line 1371. +Package xcolor Info: Model `Gray' substituted by `gray' on input line 1372. +Package xcolor Info: Model `wave' substituted by `hsb' on input line 1373. +) +(/usr/local/texlive/2024/texmf-dist/tex/latex/newunicodechar/newunicodechar.sty +Package: newunicodechar 2018/04/08 v1.2 Defining Unicode characters +) (/usr/local/texlive/2024/texmf-dist/tex/latex/l3backend/l3backend-dvips.def +File: l3backend-dvips.def 2024-02-20 L3 backend support: dvips +\l__pdf_internal_box=\box51 +\g__pdf_backend_object_int=\count196 +\l__pdf_backend_content_box=\box52 +\l__pdf_backend_model_box=\box53 +\g__pdf_backend_annotation_int=\count197 +\g__pdf_backend_link_int=\count198 +\g__pdf_backend_link_sf_int=\count199 +) +No file _formulas_dark.aux. +\openout1 = `_formulas_dark.aux'. + +LaTeX Font Info: Checking defaults for OML/cmm/m/it on input line 32. +LaTeX Font Info: ... okay on input line 32. +LaTeX Font Info: Checking defaults for OMS/cmsy/m/n on input line 32. +LaTeX Font Info: ... okay on input line 32. +LaTeX Font Info: Checking defaults for OT1/cmr/m/n on input line 32. +LaTeX Font Info: ... okay on input line 32. +LaTeX Font Info: Checking defaults for T1/cmr/m/n on input line 32. +LaTeX Font Info: ... okay on input line 32. +LaTeX Font Info: Checking defaults for TS1/cmr/m/n on input line 32. +LaTeX Font Info: ... okay on input line 32. +LaTeX Font Info: Checking defaults for OMX/cmex/m/n on input line 32. +LaTeX Font Info: ... okay on input line 32. +LaTeX Font Info: Checking defaults for U/cmr/m/n on input line 32. +LaTeX Font Info: ... okay on input line 32. +LaTeX Font Info: External font `cmex10' loaded for size +(Font) <7> on input line 33. +LaTeX Font Info: External font `cmex10' loaded for size +(Font) <5> on input line 33. +[1 + +] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] +[19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] +[35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [45] [46] [47] [48] [49] [50] +[51] [52] [53] [54] [55] [56] [57] [58] [59] [60] [61] [62] [63] [64] [65] [66] +[67] [68] [69] [70] [71] [72] [73] [74] [75] [76] [77] [78] [79] [80] [81] [82] +[83] [84] [85] [86] [87] [88] [89] [90] [91] +! Missing $ inserted. + + $ +l.314 + +I've inserted a begin-math/end-math symbol since I think +you left one out. Proceed, with fingers crossed. + +! Display math should end with $$. + + \tex_par:D +l.314 + +The `$' that I just saw supposedly matches a previous `$$'. +So I shall assume that you typed `$$' both times. + + +! LaTeX Error: Bad math environment delimiter. + +See the LaTeX manual or LaTeX Companion for explanation. +Type H for immediate help. + ... + +l.315 \] + +Your command was ignored. +Type I to replace it with another command, +or to continue without it. + +[92] (./_formulas_dark.aux) + *********** +LaTeX2e <2023-11-01> patch level 1 +L3 programming layer <2024-02-20> + *********** + ) +Here is how much of TeX's memory you used: + 1570 strings out of 474117 + 25834 string characters out of 5743709 + 1926184 words of memory out of 5000000 + 23965 multiletter control sequences out of 15000+600000 + 558996 words of font info for 39 fonts, out of 8000000 for 9000 + 1141 hyphenation exceptions out of 8191 + 72i,5n,79p,229b,103s stack positions out of 10000i,1000n,20000p,200000b,200000s + +Output written on _formulas_dark.dvi (92 pages, 19824 bytes). diff --git a/docs/html/_formulas_dark.tex b/docs/html/_formulas_dark.tex new file mode 100644 index 00000000..b4cc445f --- /dev/null +++ b/docs/html/_formulas_dark.tex @@ -0,0 +1,318 @@ +\documentclass{article} +\usepackage{iftex} +\usepackage{ifthen} +\usepackage{epsfig} +\usepackage[utf8]{inputenc} +\usepackage{xcolor} +\color{white} +\pagecolor{black} +\ifPDFTeX +\usepackage{newunicodechar} + \makeatletter + \def\doxynewunicodechar#1#2{% + \@tempswafalse + \edef\nuc@tempa{\detokenize{#1}}% + \if\relax\nuc@tempa\relax + \nuc@emptyargerr + \else + \edef\@tempb{\expandafter\@car\nuc@tempa\@nil}% + \nuc@check + \if@tempswa + \@namedef{u8:\nuc@tempa}{#2}% + \fi + \fi + } + \makeatother + \doxynewunicodechar{⁻}{${}^{-}$}% Superscript minus + \doxynewunicodechar{²}{${}^{2}$}% Superscript two + \doxynewunicodechar{³}{${}^{3}$}% Superscript three + +\fi +\pagestyle{empty} +\begin{document} +$j+i\times ny$ +\pagebreak + +$ C=A\backslash B$ +\pagebreak + +$y=\alpha Ax$ +\pagebreak + +$\left[n\times m\right]$ +\pagebreak + +$m$ +\pagebreak + +$n$ +\pagebreak + +$y=\alpha A^Tx$ +\pagebreak + +$\left[m\times n\right]$ +\pagebreak + +$C=\alpha AB$ +\pagebreak + +$m\times m$ +\pagebreak + +$C=\alpha A^TB$ +\pagebreak + +$x_i=x_i+\alpha y_i^ip$ +\pagebreak + +$a^T B c$ +\pagebreak + +$A^T A$ +\pagebreak + +$\left[n\times k\right]$ +\pagebreak + +$\left[n\times n\right]$ +\pagebreak + +$A_{n+1,i}=A_{i,n+1}=x_i$ +\pagebreak + +$A_{n+1,n+1}=scal$ +\pagebreak + +$V^*$ +\pagebreak + +$A$ +\pagebreak + +$\alpha$ +\pagebreak + +$\beta$ +\pagebreak + +$y=f(\lambda;x)$ +\pagebreak + +$x\in\mathbf{R}^s$ +\pagebreak + +$\lambda\in\mathbf{R}^d$ +\pagebreak + +$r$ +\pagebreak + +$\lambda$ +\pagebreak + +$x$ +\pagebreak + +$r\times d$ +\pagebreak + +$n\times s$ +\pagebreak + +$r\times n$ +\pagebreak + +$y=f(\lambda;x)=\lambda x$ +\pagebreak + +$x\in\mathbf{R}^1$ +\pagebreak + +$\lambda\in\mathbf{R}^1$ +\pagebreak + +$y=f(\lambda;x)=\lambda_1 x+\lambda_2x^2$ +\pagebreak + +$\lambda\in\mathbf{R}^2$ +\pagebreak + +$y=f(\lambda;x)=e^{\lambda_1 +\lambda_2x}$ +\pagebreak + +$y=f(\lambda;x)=e^{\lambda_1 +\lambda_2x+\lambda_3x^2}$ +\pagebreak + +$\lambda\in\mathbf{R}^3$ +\pagebreak + +$y=f(\lambda;x)=\lambda$ +\pagebreak + +$y=f(\lambda;x)=\lambda_1+\lambda_2x$ +\pagebreak + +$y=f(\lambda;x)=\frac{x d_w}{A_w \lambda}+T_0$ +\pagebreak + +$d_w=0.1, A_w=0.04, T_0=273$ +\pagebreak + +$y=f(\lambda;x)=\frac{x Q}{A_w \lambda_1}+\lambda_2$ +\pagebreak + +$A_w=0.04, Q=20.0$ +\pagebreak + +$y=f(\lambda;x)=\lambda_1+\lambda_2 x+\lambda_3 x^2+ \lambda_4 (x+1)^{3.5}$ +\pagebreak + +$\lambda\in\mathbf{R}^4$ +\pagebreak + +$y=f(\lambda;x)=\lambda_2 e^{\lambda_1 x} - 2$ +\pagebreak + +$y=f(\lambda;x_i)=\lambda_i$ +\pagebreak + +$i=1,...,d$ +\pagebreak + +$x_i\in\mathbf{R}^1$ +\pagebreak + +$y=f(\lambda;x)=\sum_{\alpha\in{\cal S}} \lambda_\alpha \Psi_\alpha(x)$ +\pagebreak + +$\lambda\in\mathbf{R}^{|{\cal S}|}$ +\pagebreak + +${\cal S}$ +\pagebreak + +$z=(\lambda,x)$ +\pagebreak + +$y=f(\lambda;x)=\sum_{\alpha\in{\cal S}} c_\alpha \Psi_\alpha(\lambda,x)$ +\pagebreak + +$c_\alpha$ +\pagebreak + +$y=f(\lambda;x^{(i)})=\sum_{\alpha\in{\cal S}} c_{\alpha,i} \Psi_\alpha(\lambda)$ +\pagebreak + +$c_{\alpha,i}$ +\pagebreak + +$y=f(\lambda;x^{(i)})=\sum_{\alpha\in{\cal S}_i} c_{\alpha,i} \Psi_\alpha(\lambda)$ +\pagebreak + +$(-\infty,\infty)$ +\pagebreak + +$[-1,1]$ +\pagebreak + +$\xi=R^{-1}(u)\in\mathbf{R}^d$ +\pagebreak + +$u\in[0,1]^d$ +\pagebreak + +$d$ +\pagebreak + +$d\times M$ +\pagebreak + +$N\times d$ +\pagebreak + +$u=R(\xi)$ +\pagebreak + +$\xi$ +\pagebreak + +$M\times d$ +\pagebreak + +$\xi_d$ +\pagebreak + +$[0,1]^d$ +\pagebreak + +\[ +F(t,\theta) = \left < F(t,\theta) \right >_{\theta} + + \sum_{k=1}^{\infty} \sqrt{\lambda_k} f_k(t) \xi_k\] +\pagebreak + +$C$ +\pagebreak + +$t$ +\pagebreak + +$w$ +\pagebreak + +\[ \int C(s,t)f(t)dt=\lambda f(s) \rightarrow \sum w_j C(s_i,t_j) f_k(t_j) = \lambda_k f_k(s_i)\] +\pagebreak + +\[A g=\lambda g \] +\pagebreak + +$A=W K W$ +\pagebreak + +$g=Wf$ +\pagebreak + +$W$ +\pagebreak + +$W_{ii}=\sqrt{w_i}$ +\pagebreak + +$K_{ij}=Cov(t_i,t_j)$ +\pagebreak + +$\lambda_k$ +\pagebreak + +$f_k=W^{-1}g_k$ +\pagebreak + +$F(t,\theta_l)$ +\pagebreak + +$\xi_k$ +\pagebreak + +$F$ +\pagebreak + +$f_k$ +\pagebreak + +\[ \left.\xi_k\right\vert_{\theta_l}=\left _{\theta}, f_k(t) \right >_t/\sqrt{\lambda_k} \] +\pagebreak + +\[ +\left.\xi_k\right\vert_{\theta_l}=\sum_{i=1}^{N_p} w_i\left(F(t_i,\theta_l)-\left < + F(t_i,\theta) \right >_{\theta} \right) f_k(t_i)/\sqrt{\lambda_k} \] +\pagebreak + +\[ + F(t_i,\theta_l) = \left < F(t_i,\theta) \right >_{\theta} + + \sum_{k=1}^{nKL} \sqrt{\lambda_k} f_k(t_i) \left. \xi_k\right\vert_{\theta_l} + +\] +\pagebreak + +\end{document} diff --git a/docs/html/annotated.html b/docs/html/annotated.html new file mode 100644 index 00000000..4751bb54 --- /dev/null +++ b/docs/html/annotated.html @@ -0,0 +1,114 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Class List
+
+
+
Here are the classes, structs, unions and interfaces with brief descriptions:
+
[detail level 12]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
 CArray1DStores data of any type T in a 1D array
 CArray1D< double >
 CArray1D< int >
 CArray2DStores data of any type T in a 2D array
 CArray3DStores data of any type T in a 3D array
 Cbase
 CdataPosteriorInformation
 CDFI
 CDFIsurr
 CGprocClass for Gaussian processes
 CKLDecompUniComputes the Karhunen-Loeve decomposition of a univariate stochastic process
 CLik_ABCDerived class for ABC likelihood
 CLik_ABCmDerived class for ABC-mean likelihood
 CLik_ClassicalDerived class for classical likelihood
 CLik_EovDerived class for error-in-variable likelihood
 CLik_FullDerived class for full likelihood
 CLik_GausMargDerived class for gaussian-marginal likelihood
 CLik_GausMargDDerived class for gaussian-marginal likelihood with discrete parameter
 CLik_KohDerived class for Kennedy-O'Hagan likelihood
 CLik_MargDerived class for marginal likelihood
 CLik_MVNDerived class for mvn likelihood
 CLogPosteriorBase
 CLregClass for linear parameteric regression
 Cmain
 ▼CMCMCMarkov Chain Monte Carlo base class. Implemented the basic and most general MCMC algorithms
 Cchainstate
 CoutputInfo
 CMrvMultivariate RV parameterized by PC expansions
 CMyException
 CObject
 CparameterPosteriorInformation
 CPCBasisContains all basis type specific definitions and operations needed to generate a PCSet
 CPCregDerived class for PC regression
 CPCSetDefines and initializes PC basis function set and provides functions to manipulate PC expansions defined on this basis set
 CPLregDerived class for polynomial regression
 CPostPosterior evaluation with various likelihood and prior options
 ▼CQuadGenerates quadrature rules
 CQuadRuleRule structure that stores quadrature points, weights and indices
 CRBFregDerived class for RBF regression
 CRefPtr
 CXMLAttributeList
 CXMLElement
 CXMLExpatParser
 CXMLParser
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/arrayio_8cpp.html b/docs/html/arrayio_8cpp.html new file mode 100644 index 00000000..43cadaf8 --- /dev/null +++ b/docs/html/arrayio_8cpp.html @@ -0,0 +1,1021 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: arrayio.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
arrayio.cpp File Reference
+
+
+ +

Read/write capabilities from/to matrix or vector form arrays/files. +More...

+
#include "arrayio.h"
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
void read_datafile (Array2D< T > &data, const char *filename)
 Read a datafile from filename in a matrix form and store it in the 2d array data of typename T.
 
template void read_datafile (Array2D< double > &data, const char *filename)
 
template void read_datafile (Array2D< int > &data, const char *filename)
 
template<typename T >
void read_datafileVS (Array2D< T > &data, const char *filename)
 Read a datafile from filename in a matrix form and store it in the 2d array data if typename T.
 
template void read_datafileVS (Array2D< double > &data, const char *filename)
 
template void read_datafileVS (Array2D< int > &data, const char *filename)
 
template<typename T >
void read_datafileVS (Array1D< Array1D< T > > &data, const char *filename)
 
template void read_datafileVS (Array1D< Array1D< double > > &data, const char *filename)
 
template void read_datafileVS (Array1D< Array1D< int > > &data, const char *filename)
 
template<typename T >
void read_datafileVS (std::vector< T > &data, int &nrows, int &ncols, const char *filename)
 Read a datafile from filename in a matrix form and store it in a std::vector in column-major storage scheme.
 
template void read_datafileVS (std::vector< double > &data, int &nrows, int &ncols, const char *filename)
 
template void read_datafileVS (std::vector< int > &data, int &nrows, int &ncols, const char *filename)
 
template<typename T >
void read_datafile_1d (Array1D< T > &data, const char *filename)
 Read a data from filename in a vector form and store it in a 1d array data of typename T.
 
template void read_datafile_1d (Array1D< double > &data, const char *filename)
 
template void read_datafile_1d (Array1D< int > &data, const char *filename)
 
template<typename T >
void read_datafileVS (Array1D< T > &data, const char *filename)
 Read a datafile from filename in a vector form and store it in the 1d array data of typename T.
 
template void read_datafileVS (Array1D< double > &data, const char *filename)
 
template void read_datafileVS (Array1D< int > &data, const char *filename)
 
template<typename T >
void write_datafile_size (const Array2D< T > &data, const char *filename)
 Write to file filename the number of rows and number of columns on the first line, followed by the contents of a 2d array data of typename T in a matrix form.
 
template void write_datafile_size (const Array2D< double > &data, const char *filename)
 
template void write_datafile_size (const Array2D< int > &data, const char *filename)
 
template<typename T >
void write_datafile (const Array2D< T > &data, const char *filename)
 Write the contents of a 2d array data of typename T to file filename in a matrix form.
 
template void write_datafile (const Array2D< double > &data, const char *filename)
 
template void write_datafile (const Array2D< int > &data, const char *filename)
 
template<typename T >
void write_datafile (const Array2D< T > &data, const char *filename, const char *action)
 Write/append the contents of a 2d array data of typename T to file filename in a matrix form.
 
template void write_datafile (const Array2D< double > &data, const char *filename, const char *action)
 
template void write_datafile (const Array2D< int > &data, const char *filename, const char *action)
 
template<typename T >
void write_datafile (const std::vector< T > &data, const int &nrows, const int &ncols, const char *storage, const char *filename, const char *action)
 Write the contents of a vector of typename T to file filename in a matrix form.
 
template void write_datafile (const std::vector< double > &data, const int &nrows, const int &ncols, const char *storage, const char *filename, const char *action)
 
template void write_datafile (const std::vector< int > &data, const int &nrows, const int &ncols, const char *storage, const char *filename, const char *action)
 
template<typename T >
void write_datafile_1d (const Array1D< T > &data, const char *filename)
 Write the contents of a 1d array data of typename T to file filename in a vector form.
 
template void write_datafile_1d (const Array1D< double > &data, const char *filename)
 
template void write_datafile_1d (const Array1D< int > &data, const char *filename)
 
+

Detailed Description

+

Read/write capabilities from/to matrix or vector form arrays/files.

+

Function Documentation

+ +

◆ read_datafile() [1/3]

+ +
+
+ + + + + + + + + + + +
template void read_datafile (Array2D< double > & data,
const char * filename )
+
+ +
+
+ +

◆ read_datafile() [2/3]

+ +
+
+ + + + + + + + + + + +
template void read_datafile (Array2D< int > & data,
const char * filename )
+
+ +
+
+ +

◆ read_datafile() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void read_datafile (Array2D< T > & data,
const char * filename )
+
+ +

Read a datafile from filename in a matrix form and store it in the 2d array data of typename T.

+
Note
The array data needs to have the correct sizes
+ +
+
+ +

◆ read_datafile_1d() [1/3]

+ +
+
+ + + + + + + + + + + +
template void read_datafile_1d (Array1D< double > & data,
const char * filename )
+
+ +
+
+ +

◆ read_datafile_1d() [2/3]

+ +
+
+ + + + + + + + + + + +
template void read_datafile_1d (Array1D< int > & data,
const char * filename )
+
+ +
+
+ +

◆ read_datafile_1d() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void read_datafile_1d (Array1D< T > & data,
const char * filename )
+
+ +

Read a data from filename in a vector form and store it in a 1d array data of typename T.

+
Note
The array data needs to have the correct size
+ +
+
+ +

◆ read_datafileVS() [1/12]

+ +
+
+ + + + + + + + + + + +
template void read_datafileVS (Array1D< Array1D< double > > & data,
const char * filename )
+
+ +
+
+ +

◆ read_datafileVS() [2/12]

+ +
+
+ + + + + + + + + + + +
template void read_datafileVS (Array1D< Array1D< int > > & data,
const char * filename )
+
+ +
+
+ +

◆ read_datafileVS() [3/12]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void read_datafileVS (Array1D< Array1D< T > > & data,
const char * filename )
+
+ +
+
+ +

◆ read_datafileVS() [4/12]

+ +
+
+ + + + + + + + + + + +
template void read_datafileVS (Array1D< double > & data,
const char * filename )
+
+ +
+
+ +

◆ read_datafileVS() [5/12]

+ +
+
+ + + + + + + + + + + +
template void read_datafileVS (Array1D< int > & data,
const char * filename )
+
+ +
+
+ +

◆ read_datafileVS() [6/12]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void read_datafileVS (Array1D< T > & data,
const char * filename )
+
+ +

Read a datafile from filename in a vector form and store it in the 1d array data of typename T.

+
Note
The array data is resized to match the file contents
+
+This function makes two passes: the first pass figures the no. or rows and columns, then the data array is appropriately resized, and the filename is read during second pass
+ +
+
+ +

◆ read_datafileVS() [7/12]

+ +
+
+ + + + + + + + + + + +
template void read_datafileVS (Array2D< double > & data,
const char * filename )
+
+ +
+
+ +

◆ read_datafileVS() [8/12]

+ +
+
+ + + + + + + + + + + +
template void read_datafileVS (Array2D< int > & data,
const char * filename )
+
+ +
+
+ +

◆ read_datafileVS() [9/12]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void read_datafileVS (Array2D< T > & data,
const char * filename )
+
+ +

Read a datafile from filename in a matrix form and store it in the 2d array data if typename T.

+
Note
The array data is resized to match the file contents
+
+This function makes two passes: the first pass figures the no. or rows and columns, then the data array is appropriately resized, and the filename is read during second pass
+ +
+
+ +

◆ read_datafileVS() [10/12]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
template void read_datafileVS (std::vector< double > & data,
int & nrows,
int & ncols,
const char * filename )
+
+ +
+
+ +

◆ read_datafileVS() [11/12]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
template void read_datafileVS (std::vector< int > & data,
int & nrows,
int & ncols,
const char * filename )
+
+ +
+
+ +

◆ read_datafileVS() [12/12]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + +
void read_datafileVS (std::vector< T > & data,
int & nrows,
int & ncols,
const char * filename )
+
+ +

Read a datafile from filename in a matrix form and store it in a std::vector in column-major storage scheme.

+
Note
The vector is resized to match the file contents
+
+This function makes two passes: the first pass figures the no. or rows and columns, then the data vector is appropriately resized, and the filename is read during second pass
+ +
+
+ +

◆ write_datafile() [1/9]

+ +
+
+ + + + + + + + + + + +
template void write_datafile (const Array2D< double > & data,
const char * filename )
+
+ +
+
+ +

◆ write_datafile() [2/9]

+ +
+
+ + + + + + + + + + + + + + + + +
template void write_datafile (const Array2D< double > & data,
const char * filename,
const char * action )
+
+ +
+
+ +

◆ write_datafile() [3/9]

+ +
+
+ + + + + + + + + + + +
template void write_datafile (const Array2D< int > & data,
const char * filename )
+
+ +
+
+ +

◆ write_datafile() [4/9]

+ +
+
+ + + + + + + + + + + + + + + + +
template void write_datafile (const Array2D< int > & data,
const char * filename,
const char * action )
+
+ +
+
+ +

◆ write_datafile() [5/9]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void write_datafile (const Array2D< T > & data,
const char * filename )
+
+ +

Write the contents of a 2d array data of typename T to file filename in a matrix form.

+ +
+
+ +

◆ write_datafile() [6/9]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void write_datafile (const Array2D< T > & data,
const char * filename,
const char * action )
+
+ +

Write/append the contents of a 2d array data of typename T to file filename in a matrix form.

+ +
+
+ +

◆ write_datafile() [7/9]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
template void write_datafile (const std::vector< double > & data,
const int & nrows,
const int & ncols,
const char * storage,
const char * filename,
const char * action )
+
+ +
+
+ +

◆ write_datafile() [8/9]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
template void write_datafile (const std::vector< int > & data,
const int & nrows,
const int & ncols,
const char * storage,
const char * filename,
const char * action )
+
+ +
+
+ +

◆ write_datafile() [9/9]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void write_datafile (const std::vector< T > & data,
const int & nrows,
const int & ncols,
const char * storage,
const char * filename,
const char * action )
+
+ +

Write the contents of a vector of typename T to file filename in a matrix form.

+ +
+
+ +

◆ write_datafile_1d() [1/3]

+ +
+
+ + + + + + + + + + + +
template void write_datafile_1d (const Array1D< double > & data,
const char * filename )
+
+ +
+
+ +

◆ write_datafile_1d() [2/3]

+ +
+
+ + + + + + + + + + + +
template void write_datafile_1d (const Array1D< int > & data,
const char * filename )
+
+ +
+
+ +

◆ write_datafile_1d() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void write_datafile_1d (const Array1D< T > & data,
const char * filename )
+
+ +

Write the contents of a 1d array data of typename T to file filename in a vector form.

+ +
+
+ +

◆ write_datafile_size() [1/3]

+ +
+
+ + + + + + + + + + + +
template void write_datafile_size (const Array2D< double > & data,
const char * filename )
+
+ +
+
+ +

◆ write_datafile_size() [2/3]

+ +
+
+ + + + + + + + + + + +
template void write_datafile_size (const Array2D< int > & data,
const char * filename )
+
+ +
+
+ +

◆ write_datafile_size() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void write_datafile_size (const Array2D< T > & data,
const char * filename )
+
+ +

Write to file filename the number of rows and number of columns on the first line, followed by the contents of a 2d array data of typename T in a matrix form.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/arrayio_8h.html b/docs/html/arrayio_8h.html new file mode 100644 index 00000000..318b62ae --- /dev/null +++ b/docs/html/arrayio_8h.html @@ -0,0 +1,452 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: arrayio.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
arrayio.h File Reference
+
+
+ +

Header file for array read/write utilities. +More...

+
#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <stdlib.h>
+#include "Array1D.h"
+#include "Array2D.h"
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
void read_datafile (Array2D< T > &data, const char *filename)
 Read a datafile from filename in a matrix form and store it in the 2d array data of typename T.
 
template<typename T >
void read_datafileVS (Array2D< T > &data, const char *filename)
 Read a datafile from filename in a matrix form and store it in the 2d array data if typename T.
 
template<typename T >
void read_datafileVS (Array1D< Array1D< T > > &data, const char *filename)
 
template<typename T >
void read_datafileVS (std::vector< T > &data, int &nrows, int &ncols, const char *filename)
 Read a datafile from filename in a matrix form and store it in a std::vector in column-major storage scheme.
 
template<typename T >
void read_datafile_1d (Array1D< T > &data, const char *filename)
 Read a data from filename in a vector form and store it in a 1d array data of typename T.
 
template<typename T >
void read_datafileVS (Array1D< T > &data, const char *filename)
 Read a datafile from filename in a vector form and store it in the 1d array data of typename T.
 
template<typename T >
void write_datafile (const Array2D< T > &data, const char *filename, const char *action)
 Write/append the contents of a 2d array data of typename T to file filename in a matrix form.
 
template<typename T >
void write_datafile (const Array2D< T > &data, const char *filename)
 Write the contents of a 2d array data of typename T to file filename in a matrix form.
 
template<typename T >
void write_datafile (const std::vector< T > &data, const int &nrows, const int &ncols, const char *storage, const char *filename, const char *action)
 Write the contents of a vector of typename T to file filename in a matrix form.
 
template<typename T >
void write_datafile_size (const Array2D< T > &data, const char *filename)
 Write to file filename the number of rows and number of columns on the first line, followed by the contents of a 2d array data of typename T in a matrix form.
 
template<typename T >
void write_datafile_1d (const Array1D< T > &data, const char *filename)
 Write the contents of a 1d array data of typename T to file filename in a vector form.
 
+

Detailed Description

+

Header file for array read/write utilities.

+

Function Documentation

+ +

◆ read_datafile()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void read_datafile (Array2D< T > & data,
const char * filename )
+
+ +

Read a datafile from filename in a matrix form and store it in the 2d array data of typename T.

+
Note
The array data needs to have the correct sizes
+ +
+
+ +

◆ read_datafile_1d()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void read_datafile_1d (Array1D< T > & data,
const char * filename )
+
+ +

Read a data from filename in a vector form and store it in a 1d array data of typename T.

+
Note
The array data needs to have the correct size
+ +
+
+ +

◆ read_datafileVS() [1/4]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void read_datafileVS (Array1D< Array1D< T > > & data,
const char * filename )
+
+ +
+
+ +

◆ read_datafileVS() [2/4]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void read_datafileVS (Array1D< T > & data,
const char * filename )
+
+ +

Read a datafile from filename in a vector form and store it in the 1d array data of typename T.

+
Note
The array data is resized to match the file contents
+
+This function makes two passes: the first pass figures the no. or rows and columns, then the data array is appropriately resized, and the filename is read during second pass
+ +
+
+ +

◆ read_datafileVS() [3/4]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void read_datafileVS (Array2D< T > & data,
const char * filename )
+
+ +

Read a datafile from filename in a matrix form and store it in the 2d array data if typename T.

+
Note
The array data is resized to match the file contents
+
+This function makes two passes: the first pass figures the no. or rows and columns, then the data array is appropriately resized, and the filename is read during second pass
+ +
+
+ +

◆ read_datafileVS() [4/4]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + +
void read_datafileVS (std::vector< T > & data,
int & nrows,
int & ncols,
const char * filename )
+
+ +

Read a datafile from filename in a matrix form and store it in a std::vector in column-major storage scheme.

+
Note
The vector is resized to match the file contents
+
+This function makes two passes: the first pass figures the no. or rows and columns, then the data vector is appropriately resized, and the filename is read during second pass
+ +
+
+ +

◆ write_datafile() [1/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void write_datafile (const Array2D< T > & data,
const char * filename )
+
+ +

Write the contents of a 2d array data of typename T to file filename in a matrix form.

+ +
+
+ +

◆ write_datafile() [2/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void write_datafile (const Array2D< T > & data,
const char * filename,
const char * action )
+
+ +

Write/append the contents of a 2d array data of typename T to file filename in a matrix form.

+ +
+
+ +

◆ write_datafile() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void write_datafile (const std::vector< T > & data,
const int & nrows,
const int & ncols,
const char * storage,
const char * filename,
const char * action )
+
+ +

Write the contents of a vector of typename T to file filename in a matrix form.

+ +
+
+ +

◆ write_datafile_1d()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void write_datafile_1d (const Array1D< T > & data,
const char * filename )
+
+ +

Write the contents of a 1d array data of typename T to file filename in a vector form.

+ +
+
+ +

◆ write_datafile_size()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void write_datafile_size (const Array2D< T > & data,
const char * filename )
+
+ +

Write to file filename the number of rows and number of columns on the first line, followed by the contents of a 2d array data of typename T in a matrix form.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/arrayio_8h_source.html b/docs/html/arrayio_8h_source.html new file mode 100644 index 00000000..c8da3318 --- /dev/null +++ b/docs/html/arrayio_8h_source.html @@ -0,0 +1,150 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: arrayio.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
arrayio.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
30
+
31#ifndef ARRAYIO_H
+
32#define ARRAYIO_H
+
33
+
34#include <iostream>
+
35#include <fstream>
+
36#include <sstream>
+
37#include <stdlib.h>
+
38
+
39#include "Array1D.h"
+
40#include "Array2D.h"
+
41
+
42
+
46template <typename T> void read_datafile(Array2D<T> &data, const char *filename);
+
47
+
53template <typename T> void read_datafileVS(Array2D<T> &data, const char *filename);
+
54
+
55// Read a datafile from filename and store it in an 1d array of 1d arrays
+
56// array data of typename T
+
57template <typename T>
+
58void read_datafileVS(Array1D<Array1D<T> > &data, const char *filename);
+
59
+
65template <typename T> void read_datafileVS(std::vector<T> &data, int &nrows, int &ncols, const char *filename);
+
66
+
70template <typename T> void read_datafile_1d(Array1D<T>& data, const char* filename);
+
71
+
77template <typename T> void read_datafileVS(Array1D<T> &data, const char *filename);
+
78
+
81template <typename T>
+
82void write_datafile(const Array2D<T> &data, const char *filename, const char *action);
+
83
+
86template <typename T>
+
87void write_datafile(const Array2D<T> &data, const char *filename);
+
88
+
91template <typename T>
+
92void write_datafile(const std::vector<T> &data, const int &nrows, const int &ncols, const char *storage, const char *filename, const char *action);
+
93
+
97template <typename T>
+
98void write_datafile_size(const Array2D<T> &data, const char *filename);
+
99
+
102template <typename T> void write_datafile_1d(const Array1D<T>& data, const char* filename);
+
103
+
104#endif // ARRAYIO_H
+
Array1D.h
1D Array class for any type T
+
Array2D.h
2D Array class for any type T
+
read_datafile_1d
void read_datafile_1d(Array1D< T > &data, const char *filename)
Read a data from filename in a vector form and store it in a 1d array data of typename T.
Definition arrayio.cpp:355
+
read_datafile
void read_datafile(Array2D< T > &data, const char *filename)
Read a datafile from filename in a matrix form and store it in the 2d array data of typename T.
Definition arrayio.cpp:38
+
write_datafile
void write_datafile(const Array2D< T > &data, const char *filename, const char *action)
Write/append the contents of a 2d array data of typename T to file filename in a matrix form.
Definition arrayio.cpp:525
+
write_datafile_size
void write_datafile_size(const Array2D< T > &data, const char *filename)
Write to file filename the number of rows and number of columns on the first line,...
Definition arrayio.cpp:448
+
write_datafile_1d
void write_datafile_1d(const Array1D< T > &data, const char *filename)
Write the contents of a 1d array data of typename T to file filename in a vector form.
Definition arrayio.cpp:653
+
read_datafileVS
void read_datafileVS(Array2D< T > &data, const char *filename)
Read a datafile from filename in a matrix form and store it in the 2d array data if typename T.
Definition arrayio.cpp:94
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/arraytools_8cpp.html b/docs/html/arraytools_8cpp.html new file mode 100644 index 00000000..6b41e44f --- /dev/null +++ b/docs/html/arraytools_8cpp.html @@ -0,0 +1,4094 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: arraytools.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
arraytools.cpp File Reference
+
+
+ +

Tools to manipulate Array 1D and 2D objects. Some tools mimick MATLAB functionalities. +More...

+
#include "stdlib.h"
+#include "stdio.h"
+#include "math.h"
+#include "assert.h"
+#include <sstream>
+#include <fstream>
+#include <iomanip>
+#include "arraytools.h"
+#include "ftndefs.h"
+#include "gen_defs.h"
+#include "depblas.h"
+#include "deplapack.h"
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
void array1Dto2D (Array1D< T > &arr_1d, Array2D< T > &arr)
 Store a given 1d array in a 2d array with a single second dimension.
 
template void array1Dto2D (Array1D< double > &arr_1d, Array2D< double > &arr)
 
template void array1Dto2D (Array1D< int > &arr_1d, Array2D< int > &arr)
 
template<typename T >
void array2Dto1D (Array2D< T > &arr_2d, Array1D< T > &arr)
 Store a given 2d array with a single second dimension in a 1d array.
 
template void array2Dto1D (Array2D< double > &arr_2d, Array1D< double > &arr)
 
template void array2Dto1D (Array2D< int > &arr_2d, Array1D< int > &arr)
 
template<typename T >
void paste (Array1D< T > &arr1, Array1D< T > &arr2, Array2D< T > &arr)
 Paste two 1d arrays of same size into a single 2d array with second dimension equal to two.
 
template void paste (Array1D< double > &arr1, Array1D< double > &arr2, Array2D< double > &arr)
 
template void paste (Array1D< int > &arr1, Array1D< int > &arr2, Array2D< int > &arr)
 
template<typename T >
void generate_multigrid (Array2D< T > &multigrid, Array2D< T > &grid)
 Generates multigrid as a cartesian product of each column of grid.
 
template void generate_multigrid (Array2D< double > &multigrid, Array2D< double > &grid)
 
template void generate_multigrid (Array2D< int > &multigrid, Array2D< int > &grid)
 
void paste (Array2D< double > &x, Array2D< double > &y, Array2D< double > &xy)
 Paste two 2D arrays next to each other (horizontal stack)
 
void merge (Array2D< double > &x, Array2D< double > &y, Array2D< double > &xy)
 Merge 2d double arrays (vertical stack)
 
void merge (Array1D< double > &x, Array1D< double > &y, Array1D< double > &xy)
 Merge 1d double arrays.
 
void merge (Array1D< int > &x, Array1D< int > &y, Array1D< int > &xy)
 Merge 1d int arrays.
 
void append (Array1D< double > &x, Array1D< double > &y)
 Append array y to array x in place (double format)
 
void append (Array1D< int > &x, Array1D< int > &y)
 Append array y to array x in place (int format)
 
template<typename T >
void transpose (Array2D< T > &x, Array2D< T > &xt)
 Transpose a 2d double or int array x and return the result in xt.
 
template void transpose (Array2D< double > &x, Array2D< double > &xt)
 
template void transpose (Array2D< int > &x, Array2D< int > &xt)
 
void flatten (Array2D< double > &arr_2, Array1D< double > &arr_1)
 Unfold/flatten a 2d array into a 1d array (double format)
 
void fold_1dto2d_rowfirst (Array1D< double > &x1, Array2D< double > &x2)
 Fold a 1d array into a 2d array (double format), row first.
 
void fold_1dto2d_colfirst (Array1D< double > &x1, Array2D< double > &x2)
 Fold a 1d array into a 2d array (double format), column first.
 
void swap (Array1D< double > &arr, int i, int j)
 Swap i-th and j-th elements of the array arr.
 
void swap (Array2D< double > &arr, int i, int j)
 Swap i-th and j-th rows of the 2d array arr.
 
double access (int nx, int ny, Array1D< double > &arr_1, int i, int j)
 Access element $j+i\times ny$ from 1D array 'arr_1'.
 
double accessPythonHelper (int nx, int ny, Array1D< double > &arr_1, int i, int j)
 Function written exclusively for Pybind11 to be able to load in the function access.
 
template<typename T >
void getRow (Array2D< T > &arr2d, int k, Array1D< T > &arr1d)
 Retrieves row 'k' from 2D array 'arr2d' and returns it in 1D array 'arr1d'.
 
template void getRow (Array2D< double > &arr2d, int k, Array1D< double > &arr1d)
 
template void getRow (Array2D< int > &arr2d, int k, Array1D< int > &arr1d)
 
template<typename T >
void getCol (Array2D< T > &arr2d, int k, Array1D< T > &arr1d)
 Retrieves column 'k' from 2D array 'arr2d' and returns it in 1D array 'arr1d'.
 
template void getCol (Array2D< double > &arr2d, int k, Array1D< double > &arr1d)
 
template void getCol (Array2D< int > &arr2d, int k, Array1D< int > &arr1d)
 
template<typename T >
void addVal (int n, T *arr1d, T val)
 Adds 'val' to the first n elements of an array pointer (double or int)
 
template void addVal (int n, double *arr1d, double val)
 
template void addVal (int n, int *arr1d, int val)
 
template<typename T >
void addVal (Array1D< T > &arr1d, T val)
 Adds 'val' to all elements of 1D array arr1d (double or int)
 
template void addVal (Array1D< double > &arr1d, double val)
 
template void addVal (Array1D< int > &arr1d, int val)
 
template<typename T >
void addVal (Array2D< T > &arr2d, T val)
 Adds 'val' to all elements of 2D array arr2d (double or int)
 
template void addVal (Array2D< double > &arr2d, double val)
 
template void addVal (Array2D< int > &arr2d, int val)
 
template<typename T >
void subVector (Array1D< T > &vector, Array1D< int > &ind, Array1D< T > &subvector)
 Extracts from 'vector', elements corresponding to indices 'ind' and returns them in 'subvector' (double or int)
 
template void subVector (Array1D< double > &vector, Array1D< int > &ind, Array1D< double > &subvector)
 
template void subVector (Array1D< int > &vector, Array1D< int > &ind, Array1D< int > &subvector)
 
template<typename T >
void subMatrix_row (Array2D< T > &matrix, Array1D< int > &ind, Array2D< T > &submatrix)
 Extracts from 'matrix' rows corresponding to indices 'ind' and returns them in 'submatrix' (double or int)
 
template void subMatrix_row (Array2D< double > &matrix, Array1D< int > &ind, Array2D< double > &submatrix)
 
template void subMatrix_row (Array2D< int > &matrix, Array1D< int > &ind, Array2D< int > &submatrix)
 
template<typename T >
void subMatrix_col (Array2D< T > &matrix, Array1D< int > &ind, Array2D< T > &submatrix)
 Extracts from 'matrix' columns corresponding to indices 'ind' and returns them in 'submatrix' (double or int)
 
template void subMatrix_col (Array2D< double > &matrix, Array1D< int > &ind, Array2D< double > &submatrix)
 
template void subMatrix_col (Array2D< int > &matrix, Array1D< int > &ind, Array2D< int > &submatrix)
 
template<typename T >
void matPvec (Array2D< T > &matrix, const Array1D< T > &rc, T alpha, char *RC)
 Adds scaled row or column to all rows / columns of a matrix (double or int)
 
template void matPvec (Array2D< double > &matrix, const Array1D< double > &rc, double alpha, char *RC)
 
template void matPvec (Array2D< int > &matrix, const Array1D< int > &rc, int alpha, char *RC)
 
template<typename T >
T maxVal (const Array1D< T > &vector, int *indx)
 Returns maximum value in 'vector' and its location in *indx (double or int)
 
template double maxVal (const Array1D< double > &vector, int *indx)
 
template int maxVal (const Array1D< int > &vector, int *indx)
 
void setdiff (Array1D< int > &A, Array1D< int > &B, Array1D< int > &C)
 Returns $ C=A\backslash B$ (C=Elements of A that are not in B); C is sorted in ascending order.
 
void setdiff_s (Array1D< int > &A, Array1D< int > &B, Array1D< int > &C)
 Returns $ C=A\backslash B$ ( C=Elements of A that are not in B); C is sorted in ascending order.
 
void shell_sort (int *a, int n)
 Sorts integer array.
 
void shell_sort (Array1D< int > &array)
 Sorts integer array in ascending order.
 
void shell_sort (Array1D< double > &array)
 Sorts double array in ascending order.
 
void shell_sort_col (Array2D< double > &array, int col, Array1D< int > &newInd, Array1D< int > &oldInd)
 Sorts double array in ascending order according to a given column.
 
void shell_sort_all (Array2D< double > &array, Array1D< int > &newInd, Array1D< int > &oldInd)
 Sorts double array in ascending order according to first column, then second column breaks the tie, and so on.
 
void quicksort3 (Array1D< double > &arr, int l, int r)
 Quick-sort with 3-way partitioning of array between indices l and r.
 
void quicksort3 (Array2D< double > &arr, int l, int r, int col)
 Quick-sort with 3-way partitioning of 2d array between indices l and r, according to column col.
 
void quicksort3 (Array2D< double > &arr, int l, int r)
 Quick-sort with 3-way partitioning of 2d array between indices l and r, and sorting is done comparing rows (by first element, then by second, etc...)
 
void intersect (Array1D< int > &A, Array1D< int > &B, Array1D< int > &C, Array1D< int > &iA, Array1D< int > &iB)
 Finds common entries in 1D arrays 'A' and 'B' and returns them in 'C', sorted in ascending order. It also returns the original locations of these entries in 1D arrays 'iA' and 'iB', respectively.
 
void intersect (Array1D< int > &A, Array1D< int > &B, Array1D< int > &C)
 Find common entries in 1D arrays 'A' and 'B' and return them in 'C', sorted in ascending order.
 
template<typename T >
void find (Array1D< T > &theta, T lmbda, string type, Array1D< int > &indx)
 Return list of indices corresponding to elements of 1D array theta that are: larger ( type="gt" ), larger or equal ( type="ge" ), smaller ( type="lt" ), smaller or equal ( type="le" ) than lmbda.
 
template void find (Array1D< double > &theta, double lmbda, string type, Array1D< int > &indx)
 
template void find (Array1D< int > &theta, int lmbda, string type, Array1D< int > &indx)
 
void prodAlphaMatVec (Array2D< double > &A, Array1D< double > &x, double alpha, Array1D< double > &y)
 Returns $y=\alpha Ax$, where 'A' is a $\left[n\times m\right]$ 2D array, 'x' is 1D array of size $m$ and 'alpha' is a scalar. The 1D array 'y' has $n$ elements.
 
void prodAlphaMatTVec (Array2D< double > &A, Array1D< double > &x, double alpha, Array1D< double > &y)
 Returns $y=\alpha A^Tx$, where 'A' is a $\left[m\times n\right]$ 2D array, 'x' is 1D array of size $m$ and 'alpha' is a scalar. The 1D array 'y' has $n$ elements.
 
void prodAlphaMatMat (Array2D< double > &A, Array2D< double > &B, double alpha, Array2D< double > &C)
 Returns $C=\alpha AB$, where 'A' and 'B' are $\left[m\times n\right]$ 2D arrays and 'alpha' is a scalar. The 2D array 'C' has $m\times m$ elements.
 
void prodAlphaMatTMat (Array2D< double > &A, Array2D< double > &B, double alpha, Array2D< double > &C)
 Returns $C=\alpha A^TB$, where 'A' and 'B' are $\left[m\times n\right]$ 2D arrays and 'alpha' is a scalar. The 2D array 'C' has $m\times m$ elements.
 
void addVecAlphaVecPow (Array1D< double > &x, double alpha, Array1D< double > &y, int ip)
 Implements $x_i=x_i+\alpha y_i^ip$, where 'x' and 'y' are 1D arrays with $n$ elements.
 
double prod_vecTmatvec (Array1D< double > &a, Array2D< double > &B, Array1D< double > &c)
 Returns $a^T B c$.
 
Array2D< double > MatTMat (Array2D< double > &A)
 Returns $A^T A$, where 'A' is a $\left[n\times k\right]$ 2D array.
 
template<typename T >
void delRow (Array2D< T > &A, int irow)
 Deletes row 'irow' from 2D array 'A'.
 
template void delRow (Array2D< double > &A, int irow)
 
template void delRow (Array2D< int > &A, int irow)
 
template<typename T >
void delCol (Array2D< T > &A, int icol)
 Deletes column 'icol' from 2D array 'A'.
 
template void delCol (Array2D< double > &A, int icol)
 
template void delCol (Array2D< int > &A, int icol)
 
template<typename T >
void delCol (Array1D< T > &x, int icol)
 Deletes element 'icol' from 1D array 'A'.
 
template void delCol (Array1D< double > &x, int icol)
 
template void delCol (Array1D< int > &x, int icol)
 
void paddMatRow (Array2D< double > &A, Array1D< double > &x)
 Padds 2D array 'A' with the row 'x'.
 
void paddMatCol (Array2D< double > &A, Array1D< double > &x)
 Padds 2D array 'A' with the column 'x'.
 
void paddMatRow (Array2D< int > &A, Array1D< int > &x)
 Padds 2D array 'A' with the row 'x'.
 
void paddMatCol (Array2D< int > &A, Array1D< int > &x)
 Padds 2D array 'A' with the column 'x'.
 
void paddMatColScal (Array2D< double > &A, Array1D< double > &x, double scal)
 Padds square 2D array 'A' $\left[n\times n\right]$ with the elements of 'x' and 'scal' as follows: $A_{n+1,i}=A_{i,n+1}=x_i$ and $A_{n+1,n+1}=scal$.
 
bool is_equal (Array1D< int > &a, Array1D< int > &b)
 Checks if two 1d int arrays are equal.
 
bool is_equal (Array1D< double > &a, Array1D< double > &b)
 Checks if two 1d double arrays are equal.
 
bool is_less (Array1D< int > &a, Array1D< int > &b)
 Checks if one 1d int array is less than another (by first element, then by second, etc...)
 
bool is_less (Array1D< double > &a, Array1D< double > &b)
 Checks if one 1d double array is less than another (by first element, then by second, etc...)
 
int vecIsInArray (Array1D< int > &vec, Array2D< int > &array)
 Checks if vec matches with any of the rows of array Returns the row number, or -1 if vec is not equal to any of the rows of array.
 
double select_kth (int k, Array1D< double > &arr)
 Select the k-th smallest element of an array arr.
 
double logdeterm (Array2D< double > &mat)
 Log-determinant of a real symmetric positive-definite matrix.
 
double trace (Array2D< double > &mat)
 Trace of a matrix.
 
double evalLogMVN (Array1D< double > &x, Array1D< double > &mu, Array2D< double > &Sigma)
 Evaluates the natural logarithm of a multivariate normal distribution.
 
Array2D< double > diag (Array1D< double > &diagonal_array)
 Returns a diagonal matrix with a given diagonal.
 
Array1D< double > copy (Array1D< double > &in_array)
 Returns a copy of 1D array.
 
Array2D< double > copy (Array2D< double > &in_array)
 Return a copy of 2D Array.
 
Array2D< double > mtxdel (Array2D< double > &A, int index, int dim)
 Deletes matrix columns or rows. Index specifies which column or row and dim = 1 deletes column, dim = 0 deletes the row.
 
Array1D< double > add (Array1D< double > &x, Array1D< double > &y)
 Add two 1D Arrays and returns sum (must be of the same shape)
 
Array2D< double > add (Array2D< double > &x, Array2D< double > &y)
 Add two 2D Arrays and returns sum (must be of same shape)
 
void addinplace (Array2D< double > &x, Array2D< double > &y)
 Add two 2D Arrays in place. Summation is returned as x.
 
void addinplace (Array1D< double > &x, Array1D< double > &y)
 Add two 1D Arrays in place. Summation is returned as x.
 
Array1D< double > subtract (Array1D< double > &x, Array1D< double > &y)
 Returns subtraction of two 1D Arrays (must be of the same shape)
 
Array2D< double > subtract (Array2D< double > &x, Array2D< double > &y)
 Returns subtraction of two 2D Arrays (must be of the same shape)
 
void subtractinplace (Array2D< double > &x, Array2D< double > &y)
 Subtract two 2D Arrays in place. Difference is returned as x.
 
void subtractinplace (Array1D< double > &x, Array1D< double > &y)
 Subtract two 1D Arrays in place. Difference is returned as x.
 
Array1D< double > scale (Array1D< double > &x, double alpha)
 Returns 1D Arrays scaled by a double.
 
Array2D< double > scale (Array2D< double > &x, double alpha)
 Returns 2D Array scaled by a double.
 
void scaleinplace (Array1D< double > &x, double alpha)
 Multiply Array1D by double in place.
 
void scaleinplace (Array1D< int > &x, int alpha)
 Multiply Array1D by int in place.
 
void scaleinplace (Array2D< double > &x, double alpha)
 Multiply Array2D by double in place.
 
void scaleinplace (Array2D< int > &x, int alpha)
 Multiply Array2D by int in place.
 
Array2D< double > dotmult (Array2D< double > &A, Array2D< double > &B)
 Returns the elementwise multiplication of two 2D Arrays.
 
Array1D< double > dotmult (Array1D< double > &A, Array1D< double > &B)
 Returns the elementwise multiplication of two 1D Arrays.
 
Array2D< double > dotdivide (Array2D< double > &A, Array2D< double > &B)
 Returns the elementwise division of two 2D Arrays.
 
Array1D< double > dotdivide (Array1D< double > &A, Array1D< double > &B)
 Returns the elementwise division of two 1D Arrays.
 
double norm (Array1D< double > &x)
 Returns norm of 1D Array (Euclidean)
 
double dist_sq (Array1D< double > &x, Array1D< double > &y, Array1D< double > &w)
 Weighted vector distance-squared.
 
Array2D< double > Trans (Array2D< double > &A)
 Returns the transpose of a 2D Array.
 
double dot (Array1D< double > &v1, Array1D< double > &v2)
 Returns the dot product of two 1D Arrays (must be of the same length)
 
Array1D< double > dot (Array2D< double > &A, Array1D< double > &x)
 Returns the matrix vector product.
 
Array1D< double > dot (Array1D< double > &x, Array2D< double > &A)
 
Array2D< double > dot (Array2D< double > &A, Array2D< double > &B)
 Returns the matrix matrix product.
 
Array2D< double > dotT (Array2D< double > &A, Array2D< double > &B)
 Returns the matrix matrix^T product.
 
Array2D< double > INV (Array2D< double > &A)
 Returns the inverse of a square 2D Array.
 
Array2D< double > AinvH (Array2D< double > &A, Array2D< double > &H)
 Solves linear system AX=H, i.e. returns A^(-1)*H, where A is real, symmetric and positive definite.
 
Array1D< double > Ainvb (Array2D< double > &A, Array1D< double > &b)
 Solves linear system Ax=b, i.e. return A^(-1)*b where A is real, symmetric and positive definite.
 
void LSTSQ (Array2D< double > &A, Array1D< double > &b, Array1D< double > &x)
 Least squares solution for overdetermined system. Note that A must be "taller than wide". Solution is returned in x.
 
void QR (Array2D< double > &B, Array2D< double > &Q, Array2D< double > &R)
 Computes the QR factorization of a 2D Array (need not be square)
 
void SVD (Array2D< double > &A, Array2D< double > &U, Array1D< double > &S, Array2D< double > &VT)
 Computes the SVD calculation of a 2D Array (need not be square)
 
void printarray (Array1D< double > &x)
 Prints 1D double Array to screen (alternative to for loop using cout)
 
void printarray (Array1D< int > &x)
 Prints 1D int Array to screen (alternative to for loop using cout)
 
void printarray (Array2D< double > &x)
 Prints 2D double Array to screen (alternative to for loop using cout)
 
void printarray (Array2D< int > &x)
 Prints 2D int Array to screen (alternative to for loop using cout)
 
+

Detailed Description

+

Tools to manipulate Array 1D and 2D objects. Some tools mimick MATLAB functionalities.

+

Function Documentation

+ +

◆ access()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
double access (int nx,
int ny,
Array1D< double > & arr_1,
int i,
int j )
+
+ +

Access element $j+i\times ny$ from 1D array 'arr_1'.

+ +
+
+ +

◆ accessPythonHelper()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
double accessPythonHelper (int nx,
int ny,
Array1D< double > & arr_1,
int i,
int j )
+
+ +

Function written exclusively for Pybind11 to be able to load in the function access.

+ +
+
+ +

◆ add() [1/2]

+ +
+
+ + + + + + + + + + + +
Array1D< double > add (Array1D< double > & x,
Array1D< double > & y )
+
+ +

Add two 1D Arrays and returns sum (must be of the same shape)

+ +
+
+ +

◆ add() [2/2]

+ +
+
+ + + + + + + + + + + +
Array2D< double > add (Array2D< double > & x,
Array2D< double > & y )
+
+ +

Add two 2D Arrays and returns sum (must be of same shape)

+ +
+
+ +

◆ addinplace() [1/2]

+ +
+
+ + + + + + + + + + + +
void addinplace (Array1D< double > & x,
Array1D< double > & y )
+
+ +

Add two 1D Arrays in place. Summation is returned as x.

+ +
+
+ +

◆ addinplace() [2/2]

+ +
+
+ + + + + + + + + + + +
void addinplace (Array2D< double > & x,
Array2D< double > & y )
+
+ +

Add two 2D Arrays in place. Summation is returned as x.

+ +
+
+ +

◆ addVal() [1/9]

+ +
+
+ + + + + + + + + + + +
template void addVal (Array1D< double > & arr1d,
double val )
+
+ +
+
+ +

◆ addVal() [2/9]

+ +
+
+ + + + + + + + + + + +
template void addVal (Array1D< int > & arr1d,
int val )
+
+ +
+
+ +

◆ addVal() [3/9]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void addVal (Array1D< T > & arr1d,
T val )
+
+ +

Adds 'val' to all elements of 1D array arr1d (double or int)

+ +
+
+ +

◆ addVal() [4/9]

+ +
+
+ + + + + + + + + + + +
template void addVal (Array2D< double > & arr2d,
double val )
+
+ +
+
+ +

◆ addVal() [5/9]

+ +
+
+ + + + + + + + + + + +
template void addVal (Array2D< int > & arr2d,
int val )
+
+ +
+
+ +

◆ addVal() [6/9]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void addVal (Array2D< T > & arr2d,
T val )
+
+ +

Adds 'val' to all elements of 2D array arr2d (double or int)

+ +
+
+ +

◆ addVal() [7/9]

+ +
+
+ + + + + + + + + + + + + + + + +
template void addVal (int n,
double * arr1d,
double val )
+
+ +
+
+ +

◆ addVal() [8/9]

+ +
+
+ + + + + + + + + + + + + + + + +
template void addVal (int n,
int * arr1d,
int val )
+
+ +
+
+ +

◆ addVal() [9/9]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void addVal (int n,
T * arr1d,
T val )
+
+ +

Adds 'val' to the first n elements of an array pointer (double or int)

+ +
+
+ +

◆ addVecAlphaVecPow()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void addVecAlphaVecPow (Array1D< double > & x,
double alpha,
Array1D< double > & y,
int ip )
+
+ +

Implements $x_i=x_i+\alpha y_i^ip$, where 'x' and 'y' are 1D arrays with $n$ elements.

+ +
+
+ +

◆ Ainvb()

+ +
+
+ + + + + + + + + + + +
Array1D< double > Ainvb (Array2D< double > & A,
Array1D< double > & b )
+
+ +

Solves linear system Ax=b, i.e. return A^(-1)*b where A is real, symmetric and positive definite.

+ +
+
+ +

◆ AinvH()

+ +
+
+ + + + + + + + + + + +
Array2D< double > AinvH (Array2D< double > & A,
Array2D< double > & H )
+
+ +

Solves linear system AX=H, i.e. returns A^(-1)*H, where A is real, symmetric and positive definite.

+ +
+
+ +

◆ append() [1/2]

+ +
+
+ + + + + + + + + + + +
void append (Array1D< double > & x,
Array1D< double > & y )
+
+ +

Append array y to array x in place (double format)

+ +
+
+ +

◆ append() [2/2]

+ +
+
+ + + + + + + + + + + +
void append (Array1D< int > & x,
Array1D< int > & y )
+
+ +

Append array y to array x in place (int format)

+ +
+
+ +

◆ array1Dto2D() [1/3]

+ +
+
+ + + + + + + + + + + +
template void array1Dto2D (Array1D< double > & arr_1d,
Array2D< double > & arr )
+
+ +
+
+ +

◆ array1Dto2D() [2/3]

+ +
+
+ + + + + + + + + + + +
template void array1Dto2D (Array1D< int > & arr_1d,
Array2D< int > & arr )
+
+ +
+
+ +

◆ array1Dto2D() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void array1Dto2D (Array1D< T > & arr_1d,
Array2D< T > & arr )
+
+ +

Store a given 1d array in a 2d array with a single second dimension.

+ +
+
+ +

◆ array2Dto1D() [1/3]

+ +
+
+ + + + + + + + + + + +
template void array2Dto1D (Array2D< double > & arr_2d,
Array1D< double > & arr )
+
+ +
+
+ +

◆ array2Dto1D() [2/3]

+ +
+
+ + + + + + + + + + + +
template void array2Dto1D (Array2D< int > & arr_2d,
Array1D< int > & arr )
+
+ +
+
+ +

◆ array2Dto1D() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void array2Dto1D (Array2D< T > & arr_2d,
Array1D< T > & arr )
+
+ +

Store a given 2d array with a single second dimension in a 1d array.

+ +
+
+ +

◆ copy() [1/2]

+ +
+
+ + + + + + + +
Array1D< double > copy (Array1D< double > & in_array)
+
+ +

Returns a copy of 1D array.

+ +
+
+ +

◆ copy() [2/2]

+ +
+
+ + + + + + + +
Array2D< double > copy (Array2D< double > & in_array)
+
+ +

Return a copy of 2D Array.

+ +
+
+ +

◆ delCol() [1/6]

+ +
+
+ + + + + + + + + + + +
template void delCol (Array1D< double > & x,
int icol )
+
+ +
+
+ +

◆ delCol() [2/6]

+ +
+
+ + + + + + + + + + + +
template void delCol (Array1D< int > & x,
int icol )
+
+ +
+
+ +

◆ delCol() [3/6]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void delCol (Array1D< T > & x,
int icol )
+
+ +

Deletes element 'icol' from 1D array 'A'.

+
Todo
This should move to Array1D class
+ +
+
+ +

◆ delCol() [4/6]

+ +
+
+ + + + + + + + + + + +
template void delCol (Array2D< double > & A,
int icol )
+
+ +
+
+ +

◆ delCol() [5/6]

+ +
+
+ + + + + + + + + + + +
template void delCol (Array2D< int > & A,
int icol )
+
+ +
+
+ +

◆ delCol() [6/6]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void delCol (Array2D< T > & A,
int icol )
+
+ +

Deletes column 'icol' from 2D array 'A'.

+
Todo
This should move to Array2D class
+ +
+
+ +

◆ delRow() [1/3]

+ +
+
+ + + + + + + + + + + +
template void delRow (Array2D< double > & A,
int irow )
+
+ +
+
+ +

◆ delRow() [2/3]

+ +
+
+ + + + + + + + + + + +
template void delRow (Array2D< int > & A,
int irow )
+
+ +
+
+ +

◆ delRow() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void delRow (Array2D< T > & A,
int irow )
+
+ +

Deletes row 'irow' from 2D array 'A'.

+
Todo
This should move to Array2D class
+ +
+
+ +

◆ diag()

+ +
+
+ + + + + + + +
Array2D< double > diag (Array1D< double > & diagonal_array)
+
+ +

Returns a diagonal matrix with a given diagonal.

+ +
+
+ +

◆ dist_sq()

+ +
+
+ + + + + + + + + + + + + + + + +
double dist_sq (Array1D< double > & x,
Array1D< double > & y,
Array1D< double > & w )
+
+ +

Weighted vector distance-squared.

+ +
+
+ +

◆ dot() [1/4]

+ +
+
+ + + + + + + + + + + +
double dot (Array1D< double > & v1,
Array1D< double > & v2 )
+
+ +

Returns the dot product of two 1D Arrays (must be of the same length)

+ +
+
+ +

◆ dot() [2/4]

+ +
+
+ + + + + + + + + + + +
Array1D< double > dot (Array1D< double > & x,
Array2D< double > & A )
+
+ +
+
+ +

◆ dot() [3/4]

+ +
+
+ + + + + + + + + + + +
Array1D< double > dot (Array2D< double > & A,
Array1D< double > & x )
+
+ +

Returns the matrix vector product.

+ +
+
+ +

◆ dot() [4/4]

+ +
+
+ + + + + + + + + + + +
Array2D< double > dot (Array2D< double > & A,
Array2D< double > & B )
+
+ +

Returns the matrix matrix product.

+ +
+
+ +

◆ dotdivide() [1/2]

+ +
+
+ + + + + + + + + + + +
Array1D< double > dotdivide (Array1D< double > & A,
Array1D< double > & B )
+
+ +

Returns the elementwise division of two 1D Arrays.

+ +
+
+ +

◆ dotdivide() [2/2]

+ +
+
+ + + + + + + + + + + +
Array2D< double > dotdivide (Array2D< double > & A,
Array2D< double > & B )
+
+ +

Returns the elementwise division of two 2D Arrays.

+ +
+
+ +

◆ dotmult() [1/2]

+ +
+
+ + + + + + + + + + + +
Array1D< double > dotmult (Array1D< double > & A,
Array1D< double > & B )
+
+ +

Returns the elementwise multiplication of two 1D Arrays.

+ +
+
+ +

◆ dotmult() [2/2]

+ +
+
+ + + + + + + + + + + +
Array2D< double > dotmult (Array2D< double > & A,
Array2D< double > & B )
+
+ +

Returns the elementwise multiplication of two 2D Arrays.

+ +
+
+ +

◆ dotT()

+ +
+
+ + + + + + + + + + + +
Array2D< double > dotT (Array2D< double > & A,
Array2D< double > & B )
+
+ +

Returns the matrix matrix^T product.

+ +
+
+ +

◆ evalLogMVN()

+ +
+
+ + + + + + + + + + + + + + + + +
double evalLogMVN (Array1D< double > & x,
Array1D< double > & mu,
Array2D< double > & Sigma )
+
+ +

Evaluates the natural logarithm of a multivariate normal distribution.

+ +
+
+ +

◆ find() [1/3]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
template void find (Array1D< double > & theta,
double lmbda,
string type,
Array1D< int > & indx )
+
+ +
+
+ +

◆ find() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
template void find (Array1D< int > & theta,
int lmbda,
string type,
Array1D< int > & indx )
+
+ +
+
+ +

◆ find() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + +
void find (Array1D< T > & theta,
T lmbda,
string type,
Array1D< int > & indx )
+
+ +

Return list of indices corresponding to elements of 1D array theta that are: larger ( type="gt" ), larger or equal ( type="ge" ), smaller ( type="lt" ), smaller or equal ( type="le" ) than lmbda.

+ +
+
+ +

◆ flatten()

+ +
+
+ + + + + + + + + + + +
void flatten (Array2D< double > & arr_2,
Array1D< double > & arr_1 )
+
+ +

Unfold/flatten a 2d array into a 1d array (double format)

+ +
+
+ +

◆ fold_1dto2d_colfirst()

+ +
+
+ + + + + + + + + + + +
void fold_1dto2d_colfirst (Array1D< double > & x1,
Array2D< double > & x2 )
+
+ +

Fold a 1d array into a 2d array (double format), column first.

+
Note
The dimension of the 1d array needs to be equal to the product of the dimensions of the 2d array
+ +
+
+ +

◆ fold_1dto2d_rowfirst()

+ +
+
+ + + + + + + + + + + +
void fold_1dto2d_rowfirst (Array1D< double > & x1,
Array2D< double > & x2 )
+
+ +

Fold a 1d array into a 2d array (double format), row first.

+
Note
The dimension of the 1d array needs to be equal to the product of the dimensions of the 2d array
+ +
+
+ +

◆ generate_multigrid() [1/3]

+ +
+
+ + + + + + + + + + + +
template void generate_multigrid (Array2D< double > & multigrid,
Array2D< double > & grid )
+
+ +
+
+ +

◆ generate_multigrid() [2/3]

+ +
+
+ + + + + + + + + + + +
template void generate_multigrid (Array2D< int > & multigrid,
Array2D< int > & grid )
+
+ +
+
+ +

◆ generate_multigrid() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void generate_multigrid (Array2D< T > & multigrid,
Array2D< T > & grid )
+
+ +

Generates multigrid as a cartesian product of each column of grid.

+
Todo
Should ideally be written in a recursive manner, similar to computeMultiIndexTP() in tools/multiindex.cpp
+ +
+
+ +

◆ getCol() [1/3]

+ +
+
+ + + + + + + + + + + + + + + + +
template void getCol (Array2D< double > & arr2d,
int k,
Array1D< double > & arr1d )
+
+ +
+
+ +

◆ getCol() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + +
template void getCol (Array2D< int > & arr2d,
int k,
Array1D< int > & arr1d )
+
+ +
+
+ +

◆ getCol() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void getCol (Array2D< T > & arr2d,
int k,
Array1D< T > & arr1d )
+
+ +

Retrieves column 'k' from 2D array 'arr2d' and returns it in 1D array 'arr1d'.

+ +
+
+ +

◆ getRow() [1/3]

+ +
+
+ + + + + + + + + + + + + + + + +
template void getRow (Array2D< double > & arr2d,
int k,
Array1D< double > & arr1d )
+
+ +
+
+ +

◆ getRow() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + +
template void getRow (Array2D< int > & arr2d,
int k,
Array1D< int > & arr1d )
+
+ +
+
+ +

◆ getRow() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void getRow (Array2D< T > & arr2d,
int k,
Array1D< T > & arr1d )
+
+ +

Retrieves row 'k' from 2D array 'arr2d' and returns it in 1D array 'arr1d'.

+ +
+
+ +

◆ intersect() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void intersect (Array1D< int > & A,
Array1D< int > & B,
Array1D< int > & C )
+
+ +

Find common entries in 1D arrays 'A' and 'B' and return them in 'C', sorted in ascending order.

+
Note
Currently, duplicated entries in either 'A' and 'B' will be duplicated in 'C'
+ +
+
+ +

◆ intersect() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void intersect (Array1D< int > & A,
Array1D< int > & B,
Array1D< int > & C,
Array1D< int > & iA,
Array1D< int > & iB )
+
+ +

Finds common entries in 1D arrays 'A' and 'B' and returns them in 'C', sorted in ascending order. It also returns the original locations of these entries in 1D arrays 'iA' and 'iB', respectively.

+
Note
Currently, duplicated entries in either 'A' and 'B' will be duplicated in 'C'
+ +
+
+ +

◆ INV()

+ +
+
+ + + + + + + +
Array2D< double > INV (Array2D< double > & A)
+
+ +

Returns the inverse of a square 2D Array.

+ +
+
+ +

◆ is_equal() [1/2]

+ +
+
+ + + + + + + + + + + +
bool is_equal (Array1D< double > & a,
Array1D< double > & b )
+
+ +

Checks if two 1d double arrays are equal.

+ +
+
+ +

◆ is_equal() [2/2]

+ +
+
+ + + + + + + + + + + +
bool is_equal (Array1D< int > & a,
Array1D< int > & b )
+
+ +

Checks if two 1d int arrays are equal.

+ +
+
+ +

◆ is_less() [1/2]

+ +
+
+ + + + + + + + + + + +
bool is_less (Array1D< double > & a,
Array1D< double > & b )
+
+ +

Checks if one 1d double array is less than another (by first element, then by second, etc...)

+ +
+
+ +

◆ is_less() [2/2]

+ +
+
+ + + + + + + + + + + +
bool is_less (Array1D< int > & a,
Array1D< int > & b )
+
+ +

Checks if one 1d int array is less than another (by first element, then by second, etc...)

+ +
+
+ +

◆ logdeterm()

+ +
+
+ + + + + + + +
double logdeterm (Array2D< double > & mat)
+
+ +

Log-determinant of a real symmetric positive-definite matrix.

+
Todo
Check and catch the symmetric and positiv-definite conditions.
+ +
+
+ +

◆ LSTSQ()

+ +
+
+ + + + + + + + + + + + + + + + +
void LSTSQ (Array2D< double > & A,
Array1D< double > & b,
Array1D< double > & x )
+
+ +

Least squares solution for overdetermined system. Note that A must be "taller than wide". Solution is returned in x.

+ +
+
+ +

◆ matPvec() [1/3]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
template void matPvec (Array2D< double > & matrix,
const Array1D< double > & rc,
double alpha,
char * RC )
+
+ +
+
+ +

◆ matPvec() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
template void matPvec (Array2D< int > & matrix,
const Array1D< int > & rc,
int alpha,
char * RC )
+
+ +
+
+ +

◆ matPvec() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + +
void matPvec (Array2D< T > & matrix,
const Array1D< T > & rc,
T alpha,
char * RC )
+
+ +

Adds scaled row or column to all rows / columns of a matrix (double or int)

+
Note
RC is a character "R" or "C" for row or column, correspondingly
+ +
+
+ +

◆ MatTMat()

+ +
+
+ + + + + + + +
Array2D< double > MatTMat (Array2D< double > & A)
+
+ +

Returns $A^T A$, where 'A' is a $\left[n\times k\right]$ 2D array.

+ +
+
+ +

◆ maxVal() [1/3]

+ +
+
+ + + + + + + + + + + +
template double maxVal (const Array1D< double > & vector,
int * indx )
+
+ +
+
+ +

◆ maxVal() [2/3]

+ +
+
+ + + + + + + + + + + +
template int maxVal (const Array1D< int > & vector,
int * indx )
+
+ +
+
+ +

◆ maxVal() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
T maxVal (const Array1D< T > & vector,
int * indx )
+
+ +

Returns maximum value in 'vector' and its location in *indx (double or int)

+ +
+
+ +

◆ merge() [1/3]

+ +
+
+ + + + + + + + + + + + + + + + +
void merge (Array1D< double > & x,
Array1D< double > & y,
Array1D< double > & xy )
+
+ +

Merge 1d double arrays.

+ +
+
+ +

◆ merge() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + +
void merge (Array1D< int > & x,
Array1D< int > & y,
Array1D< int > & xy )
+
+ +

Merge 1d int arrays.

+ +
+
+ +

◆ merge() [3/3]

+ +
+
+ + + + + + + + + + + + + + + + +
void merge (Array2D< double > & x,
Array2D< double > & y,
Array2D< double > & xy )
+
+ +

Merge 2d double arrays (vertical stack)

+ +
+
+ +

◆ mtxdel()

+ +
+
+ + + + + + + + + + + + + + + + +
Array2D< double > mtxdel (Array2D< double > & A,
int index,
int dim )
+
+ +

Deletes matrix columns or rows. Index specifies which column or row and dim = 1 deletes column, dim = 0 deletes the row.

+ +
+
+ +

◆ norm()

+ +
+
+ + + + + + + +
double norm (Array1D< double > & x)
+
+ +

Returns norm of 1D Array (Euclidean)

+ +
+
+ +

◆ paddMatCol() [1/2]

+ +
+
+ + + + + + + + + + + +
void paddMatCol (Array2D< double > & A,
Array1D< double > & x )
+
+ +

Padds 2D array 'A' with the column 'x'.

+
Note
the number of elements in 'x' should be the same as the number of rows in 'A'
+ +
+
+ +

◆ paddMatCol() [2/2]

+ +
+
+ + + + + + + + + + + +
void paddMatCol (Array2D< int > & A,
Array1D< int > & x )
+
+ +

Padds 2D array 'A' with the column 'x'.

+
Note
the number of elements in 'x' should be the same as the number of rows in 'A'
+ +
+
+ +

◆ paddMatColScal()

+ +
+
+ + + + + + + + + + + + + + + + +
void paddMatColScal (Array2D< double > & A,
Array1D< double > & x,
double scal )
+
+ +

Padds square 2D array 'A' $\left[n\times n\right]$ with the elements of 'x' and 'scal' as follows: $A_{n+1,i}=A_{i,n+1}=x_i$ and $A_{n+1,n+1}=scal$.

+ +
+
+ +

◆ paddMatRow() [1/2]

+ +
+
+ + + + + + + + + + + +
void paddMatRow (Array2D< double > & A,
Array1D< double > & x )
+
+ +

Padds 2D array 'A' with the row 'x'.

+
Note
the number of elements in 'x' should be the same as the number of columns of 'A'
+ +
+
+ +

◆ paddMatRow() [2/2]

+ +
+
+ + + + + + + + + + + +
void paddMatRow (Array2D< int > & A,
Array1D< int > & x )
+
+ +

Padds 2D array 'A' with the row 'x'.

+
Note
the number of elements in 'x' should be the same as the number of columns of 'A'
+ +
+
+ +

◆ paste() [1/4]

+ +
+
+ + + + + + + + + + + + + + + + +
template void paste (Array1D< double > & arr1,
Array1D< double > & arr2,
Array2D< double > & arr )
+
+ +
+
+ +

◆ paste() [2/4]

+ +
+
+ + + + + + + + + + + + + + + + +
template void paste (Array1D< int > & arr1,
Array1D< int > & arr2,
Array2D< int > & arr )
+
+ +
+
+ +

◆ paste() [3/4]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void paste (Array1D< T > & arr1,
Array1D< T > & arr2,
Array2D< T > & arr )
+
+ +

Paste two 1d arrays of same size into a single 2d array with second dimension equal to two.

+ +
+
+ +

◆ paste() [4/4]

+ +
+
+ + + + + + + + + + + + + + + + +
void paste (Array2D< double > & x,
Array2D< double > & y,
Array2D< double > & xy )
+
+ +

Paste two 2D arrays next to each other (horizontal stack)

+ +
+
+ +

◆ printarray() [1/4]

+ +
+
+ + + + + + + +
void printarray (Array1D< double > & x)
+
+ +

Prints 1D double Array to screen (alternative to for loop using cout)

+ +
+
+ +

◆ printarray() [2/4]

+ +
+
+ + + + + + + +
void printarray (Array1D< int > & x)
+
+ +

Prints 1D int Array to screen (alternative to for loop using cout)

+ +
+
+ +

◆ printarray() [3/4]

+ +
+
+ + + + + + + +
void printarray (Array2D< double > & x)
+
+ +

Prints 2D double Array to screen (alternative to for loop using cout)

+ +
+
+ +

◆ printarray() [4/4]

+ +
+
+ + + + + + + +
void printarray (Array2D< int > & x)
+
+ +

Prints 2D int Array to screen (alternative to for loop using cout)

+ +
+
+ +

◆ prod_vecTmatvec()

+ +
+
+ + + + + + + + + + + + + + + + +
double prod_vecTmatvec (Array1D< double > & a,
Array2D< double > & B,
Array1D< double > & c )
+
+ +

Returns $a^T B c$.

+ +
+
+ +

◆ prodAlphaMatMat()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void prodAlphaMatMat (Array2D< double > & A,
Array2D< double > & B,
double alpha,
Array2D< double > & C )
+
+ +

Returns $C=\alpha AB$, where 'A' and 'B' are $\left[m\times n\right]$ 2D arrays and 'alpha' is a scalar. The 2D array 'C' has $m\times m$ elements.

+ +
+
+ +

◆ prodAlphaMatTMat()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void prodAlphaMatTMat (Array2D< double > & A,
Array2D< double > & B,
double alpha,
Array2D< double > & C )
+
+ +

Returns $C=\alpha A^TB$, where 'A' and 'B' are $\left[m\times n\right]$ 2D arrays and 'alpha' is a scalar. The 2D array 'C' has $m\times m$ elements.

+ +
+
+ +

◆ prodAlphaMatTVec()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void prodAlphaMatTVec (Array2D< double > & A,
Array1D< double > & x,
double alpha,
Array1D< double > & y )
+
+ +

Returns $y=\alpha A^Tx$, where 'A' is a $\left[m\times n\right]$ 2D array, 'x' is 1D array of size $m$ and 'alpha' is a scalar. The 1D array 'y' has $n$ elements.

+ +
+
+ +

◆ prodAlphaMatVec()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void prodAlphaMatVec (Array2D< double > & A,
Array1D< double > & x,
double alpha,
Array1D< double > & y )
+
+ +

Returns $y=\alpha Ax$, where 'A' is a $\left[n\times m\right]$ 2D array, 'x' is 1D array of size $m$ and 'alpha' is a scalar. The 1D array 'y' has $n$ elements.

+ +
+
+ +

◆ QR()

+ +
+
+ + + + + + + + + + + + + + + + +
void QR (Array2D< double > & B,
Array2D< double > & Q,
Array2D< double > & R )
+
+ +

Computes the QR factorization of a 2D Array (need not be square)

+ +
+
+ +

◆ quicksort3() [1/3]

+ +
+
+ + + + + + + + + + + + + + + + +
void quicksort3 (Array1D< double > & arr,
int l,
int r )
+
+ +

Quick-sort with 3-way partitioning of array between indices l and r.

+ +
+
+ +

◆ quicksort3() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + +
void quicksort3 (Array2D< double > & arr,
int l,
int r )
+
+ +

Quick-sort with 3-way partitioning of 2d array between indices l and r, and sorting is done comparing rows (by first element, then by second, etc...)

+ +
+
+ +

◆ quicksort3() [3/3]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void quicksort3 (Array2D< double > & arr,
int l,
int r,
int col )
+
+ +

Quick-sort with 3-way partitioning of 2d array between indices l and r, according to column col.

+ +
+
+ +

◆ scale() [1/2]

+ +
+
+ + + + + + + + + + + +
Array1D< double > scale (Array1D< double > & x,
double alpha )
+
+ +

Returns 1D Arrays scaled by a double.

+ +
+
+ +

◆ scale() [2/2]

+ +
+
+ + + + + + + + + + + +
Array2D< double > scale (Array2D< double > & x,
double alpha )
+
+ +

Returns 2D Array scaled by a double.

+ +
+
+ +

◆ scaleinplace() [1/4]

+ +
+
+ + + + + + + + + + + +
void scaleinplace (Array1D< double > & x,
double alpha )
+
+ +

Multiply Array1D by double in place.

+ +
+
+ +

◆ scaleinplace() [2/4]

+ +
+
+ + + + + + + + + + + +
void scaleinplace (Array1D< int > & x,
int alpha )
+
+ +

Multiply Array1D by int in place.

+ +
+
+ +

◆ scaleinplace() [3/4]

+ +
+
+ + + + + + + + + + + +
void scaleinplace (Array2D< double > & x,
double alpha )
+
+ +

Multiply Array2D by double in place.

+ +
+
+ +

◆ scaleinplace() [4/4]

+ +
+
+ + + + + + + + + + + +
void scaleinplace (Array2D< int > & x,
int alpha )
+
+ +

Multiply Array2D by int in place.

+ +
+
+ +

◆ select_kth()

+ +
+
+ + + + + + + + + + + +
double select_kth (int k,
Array1D< double > & arr )
+
+ +

Select the k-th smallest element of an array arr.

+ +
+
+ +

◆ setdiff()

+ +
+
+ + + + + + + + + + + + + + + + +
void setdiff (Array1D< int > & A,
Array1D< int > & B,
Array1D< int > & C )
+
+ +

Returns $ C=A\backslash B$ (C=Elements of A that are not in B); C is sorted in ascending order.

+ +
+
+ +

◆ setdiff_s()

+ +
+
+ + + + + + + + + + + + + + + + +
void setdiff_s (Array1D< int > & A,
Array1D< int > & B,
Array1D< int > & C )
+
+ +

Returns $ C=A\backslash B$ ( C=Elements of A that are not in B); C is sorted in ascending order.

+
Note
Assumes A is sorted and uses a faster algorithm than setdiff
+
Todo
In future, this should sort A too and replace setdiff
+
Note
B is sorted on output as well
+ +
+
+ +

◆ shell_sort() [1/3]

+ +
+
+ + + + + + + +
void shell_sort (Array1D< double > & array)
+
+ +

Sorts double array in ascending order.

+ +
+
+ +

◆ shell_sort() [2/3]

+ +
+
+ + + + + + + +
void shell_sort (Array1D< int > & array)
+
+ +

Sorts integer array in ascending order.

+ +
+
+ +

◆ shell_sort() [3/3]

+ +
+
+ + + + + + + + + + + +
void shell_sort (int * a,
int n )
+
+ +

Sorts integer array.

+ +
+
+ +

◆ shell_sort_all()

+ +
+
+ + + + + + + + + + + + + + + + +
void shell_sort_all (Array2D< double > & array,
Array1D< int > & newInd,
Array1D< int > & oldInd )
+
+ +

Sorts double array in ascending order according to first column, then second column breaks the tie, and so on.

+ +
+
+ +

◆ shell_sort_col()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void shell_sort_col (Array2D< double > & array,
int col,
Array1D< int > & newInd,
Array1D< int > & oldInd )
+
+ +

Sorts double array in ascending order according to a given column.

+ +
+
+ +

◆ subMatrix_col() [1/3]

+ +
+
+ + + + + + + + + + + + + + + + +
template void subMatrix_col (Array2D< double > & matrix,
Array1D< int > & ind,
Array2D< double > & submatrix )
+
+ +
+
+ +

◆ subMatrix_col() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + +
template void subMatrix_col (Array2D< int > & matrix,
Array1D< int > & ind,
Array2D< int > & submatrix )
+
+ +
+
+ +

◆ subMatrix_col() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void subMatrix_col (Array2D< T > & matrix,
Array1D< int > & ind,
Array2D< T > & submatrix )
+
+ +

Extracts from 'matrix' columns corresponding to indices 'ind' and returns them in 'submatrix' (double or int)

+ +
+
+ +

◆ subMatrix_row() [1/3]

+ +
+
+ + + + + + + + + + + + + + + + +
template void subMatrix_row (Array2D< double > & matrix,
Array1D< int > & ind,
Array2D< double > & submatrix )
+
+ +
+
+ +

◆ subMatrix_row() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + +
template void subMatrix_row (Array2D< int > & matrix,
Array1D< int > & ind,
Array2D< int > & submatrix )
+
+ +
+
+ +

◆ subMatrix_row() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void subMatrix_row (Array2D< T > & matrix,
Array1D< int > & ind,
Array2D< T > & submatrix )
+
+ +

Extracts from 'matrix' rows corresponding to indices 'ind' and returns them in 'submatrix' (double or int)

+ +
+
+ +

◆ subtract() [1/2]

+ +
+
+ + + + + + + + + + + +
Array1D< double > subtract (Array1D< double > & x,
Array1D< double > & y )
+
+ +

Returns subtraction of two 1D Arrays (must be of the same shape)

+ +
+
+ +

◆ subtract() [2/2]

+ +
+
+ + + + + + + + + + + +
Array2D< double > subtract (Array2D< double > & x,
Array2D< double > & y )
+
+ +

Returns subtraction of two 2D Arrays (must be of the same shape)

+ +
+
+ +

◆ subtractinplace() [1/2]

+ +
+
+ + + + + + + + + + + +
void subtractinplace (Array1D< double > & x,
Array1D< double > & y )
+
+ +

Subtract two 1D Arrays in place. Difference is returned as x.

+ +
+
+ +

◆ subtractinplace() [2/2]

+ +
+
+ + + + + + + + + + + +
void subtractinplace (Array2D< double > & x,
Array2D< double > & y )
+
+ +

Subtract two 2D Arrays in place. Difference is returned as x.

+ +
+
+ +

◆ subVector() [1/3]

+ +
+
+ + + + + + + + + + + + + + + + +
template void subVector (Array1D< double > & vector,
Array1D< int > & ind,
Array1D< double > & subvector )
+
+ +
+
+ +

◆ subVector() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + +
template void subVector (Array1D< int > & vector,
Array1D< int > & ind,
Array1D< int > & subvector )
+
+ +
+
+ +

◆ subVector() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void subVector (Array1D< T > & vector,
Array1D< int > & ind,
Array1D< T > & subvector )
+
+ +

Extracts from 'vector', elements corresponding to indices 'ind' and returns them in 'subvector' (double or int)

+ +
+
+ +

◆ SVD()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void SVD (Array2D< double > & A,
Array2D< double > & U,
Array1D< double > & S,
Array2D< double > & VT )
+
+ +

Computes the SVD calculation of a 2D Array (need not be square)

+ +
+
+ +

◆ swap() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void swap (Array1D< double > & arr,
int i,
int j )
+
+ +

Swap i-th and j-th elements of the array arr.

+ +
+
+ +

◆ swap() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void swap (Array2D< double > & arr,
int i,
int j )
+
+ +

Swap i-th and j-th rows of the 2d array arr.

+ +
+
+ +

◆ trace()

+ +
+
+ + + + + + + +
double trace (Array2D< double > & mat)
+
+ +

Trace of a matrix.

+ +
+
+ +

◆ Trans()

+ +
+
+ + + + + + + +
Array2D< double > Trans (Array2D< double > & A)
+
+ +

Returns the transpose of a 2D Array.

+ +
+
+ +

◆ transpose() [1/3]

+ +
+
+ + + + + + + + + + + +
template void transpose (Array2D< double > & x,
Array2D< double > & xt )
+
+ +
+
+ +

◆ transpose() [2/3]

+ +
+
+ + + + + + + + + + + +
template void transpose (Array2D< int > & x,
Array2D< int > & xt )
+
+ +
+
+ +

◆ transpose() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void transpose (Array2D< T > & x,
Array2D< T > & xt )
+
+ +

Transpose a 2d double or int array x and return the result in xt.

+ +
+
+ +

◆ vecIsInArray()

+ +
+
+ + + + + + + + + + + +
int vecIsInArray (Array1D< int > & vec,
Array2D< int > & array )
+
+ +

Checks if vec matches with any of the rows of array Returns the row number, or -1 if vec is not equal to any of the rows of array.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/arraytools_8h.html b/docs/html/arraytools_8h.html new file mode 100644 index 00000000..f8a53c51 --- /dev/null +++ b/docs/html/arraytools_8h.html @@ -0,0 +1,3083 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: arraytools.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
arraytools.h File Reference
+
+
+ +

Header file for array tools. +More...

+
#include <stdlib.h>
+#include "Array1D.h"
+#include "Array2D.h"
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
void array1Dto2D (Array1D< T > &arr_1d, Array2D< T > &arr)
 Store a given 1d array in a 2d array with a single second dimension.
 
template<typename T >
void array2Dto1D (Array2D< T > &arr_2d, Array1D< T > &arr)
 Store a given 2d array with a single second dimension in a 1d array.
 
template<typename T >
void paste (Array1D< T > &arr1, Array1D< T > &arr2, Array2D< T > &arr)
 Paste two 1d arrays of same size into a single 2d array with second dimension equal to two.
 
template<typename T >
void generate_multigrid (Array2D< T > &multigrid, Array2D< T > &grid)
 Generates multigrid as a cartesian product of each column of grid.
 
void paste (Array2D< double > &x, Array2D< double > &y, Array2D< double > &xy)
 Paste two 2D arrays next to each other (horizontal stack)
 
void merge (Array2D< double > &x, Array2D< double > &y, Array2D< double > &xy)
 Merge 2d double arrays (vertical stack)
 
void merge (Array1D< double > &x, Array1D< double > &y, Array1D< double > &xy)
 Merge 1d double arrays.
 
void merge (Array1D< int > &x, Array1D< int > &y, Array1D< int > &xy)
 Merge 1d int arrays.
 
void append (Array1D< double > &x, Array1D< double > &y)
 Append array y to array x in place (double format)
 
void append (Array1D< int > &x, Array1D< int > &y)
 Append array y to array x in place (int format)
 
template<typename T >
void transpose (Array2D< T > &x, Array2D< T > &xt)
 Transpose a 2d double or int array x and return the result in xt.
 
void flatten (Array2D< double > &arr_2, Array1D< double > &arr_1)
 Unfold/flatten a 2d array into a 1d array (double format)
 
void fold_1dto2d_rowfirst (Array1D< double > &x1, Array2D< double > &x2)
 Fold a 1d array into a 2d array (double format), row first.
 
void fold_1dto2d_colfirst (Array1D< double > &x1, Array2D< double > &x2)
 Fold a 1d array into a 2d array (double format), column first.
 
void swap (Array1D< double > &arr, int i, int j)
 Swap i-th and j-th elements of the array arr.
 
void swap (Array2D< double > &arr, int i, int j)
 Swap i-th and j-th rows of the 2d array arr.
 
double access (int nx, int ny, Array1D< double > &arr_1, int i, int j)
 Access element $j+i\times ny$ from 1D array 'arr_1'.
 
double accessPythonHelper (int nx, int ny, Array1D< double > &arr_1, int i, int j)
 Function written exclusively for Pybind11 to be able to load in the function access.
 
template<typename T >
void getRow (Array2D< T > &arr2d, int k, Array1D< T > &arr1d)
 Retrieves row 'k' from 2D array 'arr2d' and returns it in 1D array 'arr1d'.
 
template<typename T >
void getCol (Array2D< T > &arr2d, int k, Array1D< T > &arr1d)
 Retrieves column 'k' from 2D array 'arr2d' and returns it in 1D array 'arr1d'.
 
template<typename T >
void addVal (int n, T *arr1d, T val)
 Adds 'val' to the first n elements of an array pointer (double or int)
 
template<typename T >
void addVal (Array1D< T > &arr1d, T val)
 Adds 'val' to all elements of 1D array arr1d (double or int)
 
template<typename T >
void addVal (Array2D< T > &arr2d, T val)
 Adds 'val' to all elements of 2D array arr2d (double or int)
 
template<typename T >
void subVector (Array1D< T > &vector, Array1D< int > &ind, Array1D< T > &subvector)
 Extracts from 'vector', elements corresponding to indices 'ind' and returns them in 'subvector' (double or int)
 
template<typename T >
void subMatrix_row (Array2D< T > &matrix, Array1D< int > &ind, Array2D< T > &submatrix)
 Extracts from 'matrix' rows corresponding to indices 'ind' and returns them in 'submatrix' (double or int)
 
template<typename T >
void subMatrix_col (Array2D< T > &matrix, Array1D< int > &ind, Array2D< T > &submatrix)
 Extracts from 'matrix' columns corresponding to indices 'ind' and returns them in 'submatrix' (double or int)
 
template<typename T >
void matPvec (Array2D< T > &matrix, const Array1D< T > &rc, T alpha, char *RC)
 Adds scaled row or column to all rows / columns of a matrix (double or int)
 
template<typename T >
T maxVal (const Array1D< T > &vector, int *indx)
 Returns maximum value in 'vector' and its location in *indx (double or int)
 
void setdiff (Array1D< int > &A, Array1D< int > &B, Array1D< int > &C)
 Returns $ C=A\backslash B$ (C=Elements of A that are not in B); C is sorted in ascending order.
 
void setdiff_s (Array1D< int > &A, Array1D< int > &B, Array1D< int > &C)
 Returns $ C=A\backslash B$ ( C=Elements of A that are not in B); C is sorted in ascending order.
 
void shell_sort (int *a, int n)
 Sorts integer array.
 
void shell_sort (Array1D< int > &array)
 Sorts integer array in ascending order.
 
void shell_sort (Array1D< double > &array)
 Sorts double array in ascending order.
 
void shell_sort_col (Array2D< double > &array, int col, Array1D< int > &newInd, Array1D< int > &oldInd)
 Sorts double array in ascending order according to a given column.
 
void shell_sort_all (Array2D< double > &array, Array1D< int > &newInd, Array1D< int > &oldInd)
 Sorts double array in ascending order according to first column, then second column breaks the tie, and so on.
 
void quicksort3 (Array1D< double > &arr, int l, int r)
 Quick-sort with 3-way partitioning of array between indices l and r.
 
void quicksort3 (Array2D< double > &arr, int left, int right, int col)
 Quick-sort with 3-way partitioning of 2d array between indices l and r, according to column col.
 
void quicksort3 (Array2D< double > &arr, int left, int right)
 Quick-sort with 3-way partitioning of 2d array between indices l and r, and sorting is done comparing rows (by first element, then by second, etc...)
 
void intersect (Array1D< int > &A, Array1D< int > &B, Array1D< int > &C, Array1D< int > &iA, Array1D< int > &iB)
 Finds common entries in 1D arrays 'A' and 'B' and returns them in 'C', sorted in ascending order. It also returns the original locations of these entries in 1D arrays 'iA' and 'iB', respectively.
 
void intersect (Array1D< int > &A, Array1D< int > &B, Array1D< int > &C)
 Find common entries in 1D arrays 'A' and 'B' and return them in 'C', sorted in ascending order.
 
template<typename T >
void find (Array1D< T > &theta, T lmbda, string type, Array1D< int > &indx)
 Return list of indices corresponding to elements of 1D array theta that are: larger ( type="gt" ), larger or equal ( type="ge" ), smaller ( type="lt" ), smaller or equal ( type="le" ) than lmbda.
 
void prodAlphaMatVec (Array2D< double > &A, Array1D< double > &x, double alpha, Array1D< double > &y)
 Returns $y=\alpha Ax$, where 'A' is a $\left[n\times m\right]$ 2D array, 'x' is 1D array of size $m$ and 'alpha' is a scalar. The 1D array 'y' has $n$ elements.
 
void prodAlphaMatTVec (Array2D< double > &A, Array1D< double > &x, double alpha, Array1D< double > &y)
 Returns $y=\alpha A^Tx$, where 'A' is a $\left[m\times n\right]$ 2D array, 'x' is 1D array of size $m$ and 'alpha' is a scalar. The 1D array 'y' has $n$ elements.
 
void prodAlphaMatMat (Array2D< double > &A, Array2D< double > &B, double alpha, Array2D< double > &C)
 Returns $C=\alpha AB$, where 'A' and 'B' are $\left[m\times n\right]$ 2D arrays and 'alpha' is a scalar. The 2D array 'C' has $m\times m$ elements.
 
void prodAlphaMatTMat (Array2D< double > &A, Array2D< double > &B, double alpha, Array2D< double > &C)
 Returns $C=\alpha A^TB$, where 'A' and 'B' are $\left[m\times n\right]$ 2D arrays and 'alpha' is a scalar. The 2D array 'C' has $m\times m$ elements.
 
void addVecAlphaVecPow (Array1D< double > &x, double alpha, Array1D< double > &y, int ip)
 Implements $x_i=x_i+\alpha y_i^ip$, where 'x' and 'y' are 1D arrays with $n$ elements.
 
double prod_vecTmatvec (Array1D< double > &a, Array2D< double > &B, Array1D< double > &c)
 Returns $a^T B c$.
 
Array2D< double > MatTMat (Array2D< double > &A)
 Returns $A^T A$, where 'A' is a $\left[n\times k\right]$ 2D array.
 
template<typename T >
void delRow (Array2D< T > &A, int irow)
 Deletes row 'irow' from 2D array 'A'.
 
template<typename T >
void delCol (Array2D< T > &A, int icol)
 Deletes column 'icol' from 2D array 'A'.
 
template<typename T >
void delCol (Array1D< T > &x, int icol)
 Deletes element 'icol' from 1D array 'A'.
 
void paddMatRow (Array2D< double > &A, Array1D< double > &x)
 Padds 2D array 'A' with the row 'x'.
 
void paddMatCol (Array2D< double > &A, Array1D< double > &x)
 Padds 2D array 'A' with the column 'x'.
 
void paddMatRow (Array2D< int > &A, Array1D< int > &x)
 Padds 2D array 'A' with the row 'x'.
 
void paddMatCol (Array2D< int > &A, Array1D< int > &x)
 Padds 2D array 'A' with the column 'x'.
 
void paddMatColScal (Array2D< double > &A, Array1D< double > &x, double scal)
 Padds square 2D array 'A' $\left[n\times n\right]$ with the elements of 'x' and 'scal' as follows: $A_{n+1,i}=A_{i,n+1}=x_i$ and $A_{n+1,n+1}=scal$.
 
bool is_equal (Array1D< int > &a, Array1D< int > &b)
 Checks if two 1d int arrays are equal.
 
bool is_equal (Array1D< double > &a, Array1D< double > &b)
 Checks if two 1d double arrays are equal.
 
bool is_less (Array1D< int > &a, Array1D< int > &b)
 Checks if one 1d int array is less than another (by first element, then by second, etc...)
 
bool is_less (Array1D< double > &a, Array1D< double > &b)
 Checks if one 1d double array is less than another (by first element, then by second, etc...)
 
int vecIsInArray (Array1D< int > &vec, Array2D< int > &array)
 Checks if vec matches with any of the rows of array Returns the row number, or -1 if vec is not equal to any of the rows of array.
 
double select_kth (int k, Array1D< double > &arr)
 Select the k-th smallest element of an array arr.
 
double logdeterm (Array2D< double > &mat)
 Log-determinant of a real symmetric positive-definite matrix.
 
double trace (Array2D< double > &mat)
 Trace of a matrix.
 
double evalLogMVN (Array1D< double > &x, Array1D< double > &mu, Array2D< double > &Sigma)
 Evaluates the natural logarithm of a multivariate normal distribution.
 
Array2D< double > diag (Array1D< double > &diagonal_array)
 Returns a diagonal matrix with a given diagonal.
 
Array1D< double > copy (Array1D< double > &)
 Returns a copy of 1D array.
 
Array2D< double > copy (Array2D< double > &)
 Return a copy of 2D Array.
 
Array2D< double > mtxdel (Array2D< double > &, int index, int dim)
 Deletes matrix columns or rows. Index specifies which column or row and dim = 1 deletes column, dim = 0 deletes the row.
 
Array1D< double > add (Array1D< double > &, Array1D< double > &)
 Add two 1D Arrays and returns sum (must be of the same shape)
 
Array2D< double > add (Array2D< double > &, Array2D< double > &)
 Add two 2D Arrays and returns sum (must be of same shape)
 
void addinplace (Array2D< double > &x, Array2D< double > &y)
 Add two 2D Arrays in place. Summation is returned as x.
 
void addinplace (Array1D< double > &x, Array1D< double > &y)
 Add two 1D Arrays in place. Summation is returned as x.
 
Array1D< double > subtract (Array1D< double > &, Array1D< double > &)
 Returns subtraction of two 1D Arrays (must be of the same shape)
 
Array2D< double > subtract (Array2D< double > &, Array2D< double > &)
 Returns subtraction of two 2D Arrays (must be of the same shape)
 
void subtractinplace (Array2D< double > &x, Array2D< double > &y)
 Subtract two 2D Arrays in place. Difference is returned as x.
 
void subtractinplace (Array1D< double > &x, Array1D< double > &y)
 Subtract two 1D Arrays in place. Difference is returned as x.
 
Array1D< double > scale (Array1D< double > &, double)
 Returns 1D Arrays scaled by a double.
 
Array2D< double > scale (Array2D< double > &, double)
 Returns 2D Array scaled by a double.
 
void scaleinplace (Array1D< double > &, double)
 Multiply Array1D by double in place.
 
void scaleinplace (Array1D< int > &, int)
 Multiply Array1D by int in place.
 
void scaleinplace (Array2D< double > &, double)
 Multiply Array2D by double in place.
 
void scaleinplace (Array2D< int > &, int)
 Multiply Array2D by int in place.
 
Array2D< double > dotmult (Array2D< double > &A, Array2D< double > &B)
 Returns the elementwise multiplication of two 2D Arrays.
 
Array1D< double > dotmult (Array1D< double > &A, Array1D< double > &B)
 Returns the elementwise multiplication of two 1D Arrays.
 
Array2D< double > dotdivide (Array2D< double > &A, Array2D< double > &B)
 Returns the elementwise division of two 2D Arrays.
 
Array1D< double > dotdivide (Array1D< double > &A, Array1D< double > &B)
 Returns the elementwise division of two 1D Arrays.
 
double norm (Array1D< double > &)
 Returns norm of 1D Array (Euclidean)
 
double dist_sq (Array1D< double > &x, Array1D< double > &y, Array1D< double > &w)
 Weighted vector distance-squared.
 
Array2D< double > Trans (Array2D< double > &)
 Returns the transpose of a 2D Array.
 
double dot (Array1D< double > &, Array1D< double > &)
 Returns the dot product of two 1D Arrays (must be of the same length)
 
Array1D< double > dot (Array2D< double > &, Array1D< double > &)
 Returns the matrix vector product.
 
Array2D< double > dot (Array2D< double > &, Array2D< double > &)
 Returns the matrix matrix product.
 
Array2D< double > dotT (Array2D< double > &, Array2D< double > &)
 Returns the matrix matrix^T product.
 
Array2D< double > INV (Array2D< double > &A)
 Returns the inverse of a square 2D Array.
 
Array2D< double > AinvH (Array2D< double > &A, Array2D< double > &H)
 Solves linear system AX=H, i.e. returns A^(-1)*H, where A is real, symmetric and positive definite.
 
Array1D< double > Ainvb (Array2D< double > &A, Array1D< double > &b)
 Solves linear system Ax=b, i.e. return A^(-1)*b where A is real, symmetric and positive definite.
 
void LSTSQ (Array2D< double > &A, Array1D< double > &b, Array1D< double > &x)
 Least squares solution for overdetermined system. Note that A must be "taller than wide". Solution is returned in x.
 
void QR (Array2D< double > &B, Array2D< double > &Q, Array2D< double > &R)
 Computes the QR factorization of a 2D Array (need not be square)
 
void SVD (Array2D< double > &A, Array2D< double > &U, Array1D< double > &S, Array2D< double > &VT)
 Computes the SVD calculation of a 2D Array (need not be square)
 
void printarray (Array1D< double > &)
 Prints 1D double Array to screen (alternative to for loop using cout)
 
void printarray (Array1D< int > &)
 Prints 1D int Array to screen (alternative to for loop using cout)
 
void printarray (Array2D< double > &)
 Prints 2D double Array to screen (alternative to for loop using cout)
 
void printarray (Array2D< int > &)
 Prints 2D int Array to screen (alternative to for loop using cout)
 
+

Detailed Description

+

Header file for array tools.

+
Todo

Some functions are not optimal in terms of array access.

+

Some functions should be templated and or moved to array class

+
+

Function Documentation

+ +

◆ access()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
double access (int nx,
int ny,
Array1D< double > & arr_1,
int i,
int j )
+
+ +

Access element $j+i\times ny$ from 1D array 'arr_1'.

+ +
+
+ +

◆ accessPythonHelper()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
double accessPythonHelper (int nx,
int ny,
Array1D< double > & arr_1,
int i,
int j )
+
+ +

Function written exclusively for Pybind11 to be able to load in the function access.

+ +
+
+ +

◆ add() [1/2]

+ +
+
+ + + + + + + + + + + +
Array1D< double > add (Array1D< double > & x,
Array1D< double > & y )
+
+ +

Add two 1D Arrays and returns sum (must be of the same shape)

+ +
+
+ +

◆ add() [2/2]

+ +
+
+ + + + + + + + + + + +
Array2D< double > add (Array2D< double > & x,
Array2D< double > & y )
+
+ +

Add two 2D Arrays and returns sum (must be of same shape)

+ +
+
+ +

◆ addinplace() [1/2]

+ +
+
+ + + + + + + + + + + +
void addinplace (Array1D< double > & x,
Array1D< double > & y )
+
+ +

Add two 1D Arrays in place. Summation is returned as x.

+ +
+
+ +

◆ addinplace() [2/2]

+ +
+
+ + + + + + + + + + + +
void addinplace (Array2D< double > & x,
Array2D< double > & y )
+
+ +

Add two 2D Arrays in place. Summation is returned as x.

+ +
+
+ +

◆ addVal() [1/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void addVal (Array1D< T > & arr1d,
T val )
+
+ +

Adds 'val' to all elements of 1D array arr1d (double or int)

+ +
+
+ +

◆ addVal() [2/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void addVal (Array2D< T > & arr2d,
T val )
+
+ +

Adds 'val' to all elements of 2D array arr2d (double or int)

+ +
+
+ +

◆ addVal() [3/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void addVal (int n,
T * arr1d,
T val )
+
+ +

Adds 'val' to the first n elements of an array pointer (double or int)

+ +
+
+ +

◆ addVecAlphaVecPow()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void addVecAlphaVecPow (Array1D< double > & x,
double alpha,
Array1D< double > & y,
int ip )
+
+ +

Implements $x_i=x_i+\alpha y_i^ip$, where 'x' and 'y' are 1D arrays with $n$ elements.

+ +
+
+ +

◆ Ainvb()

+ +
+
+ + + + + + + + + + + +
Array1D< double > Ainvb (Array2D< double > & A,
Array1D< double > & b )
+
+ +

Solves linear system Ax=b, i.e. return A^(-1)*b where A is real, symmetric and positive definite.

+ +
+
+ +

◆ AinvH()

+ +
+
+ + + + + + + + + + + +
Array2D< double > AinvH (Array2D< double > & A,
Array2D< double > & H )
+
+ +

Solves linear system AX=H, i.e. returns A^(-1)*H, where A is real, symmetric and positive definite.

+ +
+
+ +

◆ append() [1/2]

+ +
+
+ + + + + + + + + + + +
void append (Array1D< double > & x,
Array1D< double > & y )
+
+ +

Append array y to array x in place (double format)

+ +
+
+ +

◆ append() [2/2]

+ +
+
+ + + + + + + + + + + +
void append (Array1D< int > & x,
Array1D< int > & y )
+
+ +

Append array y to array x in place (int format)

+ +
+
+ +

◆ array1Dto2D()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void array1Dto2D (Array1D< T > & arr_1d,
Array2D< T > & arr )
+
+ +

Store a given 1d array in a 2d array with a single second dimension.

+ +
+
+ +

◆ array2Dto1D()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void array2Dto1D (Array2D< T > & arr_2d,
Array1D< T > & arr )
+
+ +

Store a given 2d array with a single second dimension in a 1d array.

+ +
+
+ +

◆ copy() [1/2]

+ +
+
+ + + + + + + +
Array1D< double > copy (Array1D< double > & in_array)
+
+ +

Returns a copy of 1D array.

+ +
+
+ +

◆ copy() [2/2]

+ +
+
+ + + + + + + +
Array2D< double > copy (Array2D< double > & in_array)
+
+ +

Return a copy of 2D Array.

+ +
+
+ +

◆ delCol() [1/2]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void delCol (Array1D< T > & x,
int icol )
+
+ +

Deletes element 'icol' from 1D array 'A'.

+
Todo
This should move to Array1D class
+ +
+
+ +

◆ delCol() [2/2]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void delCol (Array2D< T > & A,
int icol )
+
+ +

Deletes column 'icol' from 2D array 'A'.

+
Todo
This should move to Array2D class
+ +
+
+ +

◆ delRow()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void delRow (Array2D< T > & A,
int irow )
+
+ +

Deletes row 'irow' from 2D array 'A'.

+
Todo
This should move to Array2D class
+ +
+
+ +

◆ diag()

+ +
+
+ + + + + + + +
Array2D< double > diag (Array1D< double > & diagonal_array)
+
+ +

Returns a diagonal matrix with a given diagonal.

+ +
+
+ +

◆ dist_sq()

+ +
+
+ + + + + + + + + + + + + + + + +
double dist_sq (Array1D< double > & x,
Array1D< double > & y,
Array1D< double > & w )
+
+ +

Weighted vector distance-squared.

+ +
+
+ +

◆ dot() [1/3]

+ +
+
+ + + + + + + + + + + +
double dot (Array1D< double > & v1,
Array1D< double > & v2 )
+
+ +

Returns the dot product of two 1D Arrays (must be of the same length)

+ +
+
+ +

◆ dot() [2/3]

+ +
+
+ + + + + + + + + + + +
Array1D< double > dot (Array2D< double > & A,
Array1D< double > & x )
+
+ +

Returns the matrix vector product.

+ +
+
+ +

◆ dot() [3/3]

+ +
+
+ + + + + + + + + + + +
Array2D< double > dot (Array2D< double > & A,
Array2D< double > & B )
+
+ +

Returns the matrix matrix product.

+ +
+
+ +

◆ dotdivide() [1/2]

+ +
+
+ + + + + + + + + + + +
Array1D< double > dotdivide (Array1D< double > & A,
Array1D< double > & B )
+
+ +

Returns the elementwise division of two 1D Arrays.

+ +
+
+ +

◆ dotdivide() [2/2]

+ +
+
+ + + + + + + + + + + +
Array2D< double > dotdivide (Array2D< double > & A,
Array2D< double > & B )
+
+ +

Returns the elementwise division of two 2D Arrays.

+ +
+
+ +

◆ dotmult() [1/2]

+ +
+
+ + + + + + + + + + + +
Array1D< double > dotmult (Array1D< double > & A,
Array1D< double > & B )
+
+ +

Returns the elementwise multiplication of two 1D Arrays.

+ +
+
+ +

◆ dotmult() [2/2]

+ +
+
+ + + + + + + + + + + +
Array2D< double > dotmult (Array2D< double > & A,
Array2D< double > & B )
+
+ +

Returns the elementwise multiplication of two 2D Arrays.

+ +
+
+ +

◆ dotT()

+ +
+
+ + + + + + + + + + + +
Array2D< double > dotT (Array2D< double > & A,
Array2D< double > & B )
+
+ +

Returns the matrix matrix^T product.

+ +
+
+ +

◆ evalLogMVN()

+ +
+
+ + + + + + + + + + + + + + + + +
double evalLogMVN (Array1D< double > & x,
Array1D< double > & mu,
Array2D< double > & Sigma )
+
+ +

Evaluates the natural logarithm of a multivariate normal distribution.

+ +
+
+ +

◆ find()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + +
void find (Array1D< T > & theta,
T lmbda,
string type,
Array1D< int > & indx )
+
+ +

Return list of indices corresponding to elements of 1D array theta that are: larger ( type="gt" ), larger or equal ( type="ge" ), smaller ( type="lt" ), smaller or equal ( type="le" ) than lmbda.

+ +
+
+ +

◆ flatten()

+ +
+
+ + + + + + + + + + + +
void flatten (Array2D< double > & arr_2,
Array1D< double > & arr_1 )
+
+ +

Unfold/flatten a 2d array into a 1d array (double format)

+ +
+
+ +

◆ fold_1dto2d_colfirst()

+ +
+
+ + + + + + + + + + + +
void fold_1dto2d_colfirst (Array1D< double > & x1,
Array2D< double > & x2 )
+
+ +

Fold a 1d array into a 2d array (double format), column first.

+
Note
The dimension of the 1d array needs to be equal to the product of the dimensions of the 2d array
+ +
+
+ +

◆ fold_1dto2d_rowfirst()

+ +
+
+ + + + + + + + + + + +
void fold_1dto2d_rowfirst (Array1D< double > & x1,
Array2D< double > & x2 )
+
+ +

Fold a 1d array into a 2d array (double format), row first.

+
Note
The dimension of the 1d array needs to be equal to the product of the dimensions of the 2d array
+ +
+
+ +

◆ generate_multigrid()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void generate_multigrid (Array2D< T > & multigrid,
Array2D< T > & grid )
+
+ +

Generates multigrid as a cartesian product of each column of grid.

+
Todo
Should ideally be written in a recursive manner, similar to computeMultiIndexTP() in tools/multiindex.cpp
+ +
+
+ +

◆ getCol()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void getCol (Array2D< T > & arr2d,
int k,
Array1D< T > & arr1d )
+
+ +

Retrieves column 'k' from 2D array 'arr2d' and returns it in 1D array 'arr1d'.

+ +
+
+ +

◆ getRow()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void getRow (Array2D< T > & arr2d,
int k,
Array1D< T > & arr1d )
+
+ +

Retrieves row 'k' from 2D array 'arr2d' and returns it in 1D array 'arr1d'.

+ +
+
+ +

◆ intersect() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void intersect (Array1D< int > & A,
Array1D< int > & B,
Array1D< int > & C )
+
+ +

Find common entries in 1D arrays 'A' and 'B' and return them in 'C', sorted in ascending order.

+
Note
Currently, duplicated entries in either 'A' and 'B' will be duplicated in 'C'
+ +
+
+ +

◆ intersect() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void intersect (Array1D< int > & A,
Array1D< int > & B,
Array1D< int > & C,
Array1D< int > & iA,
Array1D< int > & iB )
+
+ +

Finds common entries in 1D arrays 'A' and 'B' and returns them in 'C', sorted in ascending order. It also returns the original locations of these entries in 1D arrays 'iA' and 'iB', respectively.

+
Note
Currently, duplicated entries in either 'A' and 'B' will be duplicated in 'C'
+ +
+
+ +

◆ INV()

+ +
+
+ + + + + + + +
Array2D< double > INV (Array2D< double > & A)
+
+ +

Returns the inverse of a square 2D Array.

+ +
+
+ +

◆ is_equal() [1/2]

+ +
+
+ + + + + + + + + + + +
bool is_equal (Array1D< double > & a,
Array1D< double > & b )
+
+ +

Checks if two 1d double arrays are equal.

+ +
+
+ +

◆ is_equal() [2/2]

+ +
+
+ + + + + + + + + + + +
bool is_equal (Array1D< int > & a,
Array1D< int > & b )
+
+ +

Checks if two 1d int arrays are equal.

+ +
+
+ +

◆ is_less() [1/2]

+ +
+
+ + + + + + + + + + + +
bool is_less (Array1D< double > & a,
Array1D< double > & b )
+
+ +

Checks if one 1d double array is less than another (by first element, then by second, etc...)

+ +
+
+ +

◆ is_less() [2/2]

+ +
+
+ + + + + + + + + + + +
bool is_less (Array1D< int > & a,
Array1D< int > & b )
+
+ +

Checks if one 1d int array is less than another (by first element, then by second, etc...)

+ +
+
+ +

◆ logdeterm()

+ +
+
+ + + + + + + +
double logdeterm (Array2D< double > & mat)
+
+ +

Log-determinant of a real symmetric positive-definite matrix.

+
Todo
Check and catch the symmetric and positiv-definite conditions.
+ +
+
+ +

◆ LSTSQ()

+ +
+
+ + + + + + + + + + + + + + + + +
void LSTSQ (Array2D< double > & A,
Array1D< double > & b,
Array1D< double > & x )
+
+ +

Least squares solution for overdetermined system. Note that A must be "taller than wide". Solution is returned in x.

+ +
+
+ +

◆ matPvec()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + +
void matPvec (Array2D< T > & matrix,
const Array1D< T > & rc,
T alpha,
char * RC )
+
+ +

Adds scaled row or column to all rows / columns of a matrix (double or int)

+
Note
RC is a character "R" or "C" for row or column, correspondingly
+ +
+
+ +

◆ MatTMat()

+ +
+
+ + + + + + + +
Array2D< double > MatTMat (Array2D< double > & A)
+
+ +

Returns $A^T A$, where 'A' is a $\left[n\times k\right]$ 2D array.

+ +
+
+ +

◆ maxVal()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
T maxVal (const Array1D< T > & vector,
int * indx )
+
+ +

Returns maximum value in 'vector' and its location in *indx (double or int)

+ +
+
+ +

◆ merge() [1/3]

+ +
+
+ + + + + + + + + + + + + + + + +
void merge (Array1D< double > & x,
Array1D< double > & y,
Array1D< double > & xy )
+
+ +

Merge 1d double arrays.

+ +
+
+ +

◆ merge() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + +
void merge (Array1D< int > & x,
Array1D< int > & y,
Array1D< int > & xy )
+
+ +

Merge 1d int arrays.

+ +
+
+ +

◆ merge() [3/3]

+ +
+
+ + + + + + + + + + + + + + + + +
void merge (Array2D< double > & x,
Array2D< double > & y,
Array2D< double > & xy )
+
+ +

Merge 2d double arrays (vertical stack)

+ +
+
+ +

◆ mtxdel()

+ +
+
+ + + + + + + + + + + + + + + + +
Array2D< double > mtxdel (Array2D< double > & A,
int index,
int dim )
+
+ +

Deletes matrix columns or rows. Index specifies which column or row and dim = 1 deletes column, dim = 0 deletes the row.

+ +
+
+ +

◆ norm()

+ +
+
+ + + + + + + +
double norm (Array1D< double > & x)
+
+ +

Returns norm of 1D Array (Euclidean)

+ +
+
+ +

◆ paddMatCol() [1/2]

+ +
+
+ + + + + + + + + + + +
void paddMatCol (Array2D< double > & A,
Array1D< double > & x )
+
+ +

Padds 2D array 'A' with the column 'x'.

+
Note
the number of elements in 'x' should be the same as the number of rows in 'A'
+ +
+
+ +

◆ paddMatCol() [2/2]

+ +
+
+ + + + + + + + + + + +
void paddMatCol (Array2D< int > & A,
Array1D< int > & x )
+
+ +

Padds 2D array 'A' with the column 'x'.

+
Note
the number of elements in 'x' should be the same as the number of rows in 'A'
+ +
+
+ +

◆ paddMatColScal()

+ +
+
+ + + + + + + + + + + + + + + + +
void paddMatColScal (Array2D< double > & A,
Array1D< double > & x,
double scal )
+
+ +

Padds square 2D array 'A' $\left[n\times n\right]$ with the elements of 'x' and 'scal' as follows: $A_{n+1,i}=A_{i,n+1}=x_i$ and $A_{n+1,n+1}=scal$.

+ +
+
+ +

◆ paddMatRow() [1/2]

+ +
+
+ + + + + + + + + + + +
void paddMatRow (Array2D< double > & A,
Array1D< double > & x )
+
+ +

Padds 2D array 'A' with the row 'x'.

+
Note
the number of elements in 'x' should be the same as the number of columns of 'A'
+ +
+
+ +

◆ paddMatRow() [2/2]

+ +
+
+ + + + + + + + + + + +
void paddMatRow (Array2D< int > & A,
Array1D< int > & x )
+
+ +

Padds 2D array 'A' with the row 'x'.

+
Note
the number of elements in 'x' should be the same as the number of columns of 'A'
+ +
+
+ +

◆ paste() [1/2]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void paste (Array1D< T > & arr1,
Array1D< T > & arr2,
Array2D< T > & arr )
+
+ +

Paste two 1d arrays of same size into a single 2d array with second dimension equal to two.

+ +
+
+ +

◆ paste() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void paste (Array2D< double > & x,
Array2D< double > & y,
Array2D< double > & xy )
+
+ +

Paste two 2D arrays next to each other (horizontal stack)

+ +
+
+ +

◆ printarray() [1/4]

+ +
+
+ + + + + + + +
void printarray (Array1D< double > & x)
+
+ +

Prints 1D double Array to screen (alternative to for loop using cout)

+ +
+
+ +

◆ printarray() [2/4]

+ +
+
+ + + + + + + +
void printarray (Array1D< int > & x)
+
+ +

Prints 1D int Array to screen (alternative to for loop using cout)

+ +
+
+ +

◆ printarray() [3/4]

+ +
+
+ + + + + + + +
void printarray (Array2D< double > & x)
+
+ +

Prints 2D double Array to screen (alternative to for loop using cout)

+ +
+
+ +

◆ printarray() [4/4]

+ +
+
+ + + + + + + +
void printarray (Array2D< int > & x)
+
+ +

Prints 2D int Array to screen (alternative to for loop using cout)

+ +
+
+ +

◆ prod_vecTmatvec()

+ +
+
+ + + + + + + + + + + + + + + + +
double prod_vecTmatvec (Array1D< double > & a,
Array2D< double > & B,
Array1D< double > & c )
+
+ +

Returns $a^T B c$.

+ +
+
+ +

◆ prodAlphaMatMat()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void prodAlphaMatMat (Array2D< double > & A,
Array2D< double > & B,
double alpha,
Array2D< double > & C )
+
+ +

Returns $C=\alpha AB$, where 'A' and 'B' are $\left[m\times n\right]$ 2D arrays and 'alpha' is a scalar. The 2D array 'C' has $m\times m$ elements.

+ +
+
+ +

◆ prodAlphaMatTMat()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void prodAlphaMatTMat (Array2D< double > & A,
Array2D< double > & B,
double alpha,
Array2D< double > & C )
+
+ +

Returns $C=\alpha A^TB$, where 'A' and 'B' are $\left[m\times n\right]$ 2D arrays and 'alpha' is a scalar. The 2D array 'C' has $m\times m$ elements.

+ +
+
+ +

◆ prodAlphaMatTVec()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void prodAlphaMatTVec (Array2D< double > & A,
Array1D< double > & x,
double alpha,
Array1D< double > & y )
+
+ +

Returns $y=\alpha A^Tx$, where 'A' is a $\left[m\times n\right]$ 2D array, 'x' is 1D array of size $m$ and 'alpha' is a scalar. The 1D array 'y' has $n$ elements.

+ +
+
+ +

◆ prodAlphaMatVec()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void prodAlphaMatVec (Array2D< double > & A,
Array1D< double > & x,
double alpha,
Array1D< double > & y )
+
+ +

Returns $y=\alpha Ax$, where 'A' is a $\left[n\times m\right]$ 2D array, 'x' is 1D array of size $m$ and 'alpha' is a scalar. The 1D array 'y' has $n$ elements.

+ +
+
+ +

◆ QR()

+ +
+
+ + + + + + + + + + + + + + + + +
void QR (Array2D< double > & B,
Array2D< double > & Q,
Array2D< double > & R )
+
+ +

Computes the QR factorization of a 2D Array (need not be square)

+ +
+
+ +

◆ quicksort3() [1/3]

+ +
+
+ + + + + + + + + + + + + + + + +
void quicksort3 (Array1D< double > & arr,
int l,
int r )
+
+ +

Quick-sort with 3-way partitioning of array between indices l and r.

+ +
+
+ +

◆ quicksort3() [2/3]

+ +
+
+ + + + + + + + + + + + + + + + +
void quicksort3 (Array2D< double > & arr,
int left,
int right )
+
+ +

Quick-sort with 3-way partitioning of 2d array between indices l and r, and sorting is done comparing rows (by first element, then by second, etc...)

+ +
+
+ +

◆ quicksort3() [3/3]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void quicksort3 (Array2D< double > & arr,
int left,
int right,
int col )
+
+ +

Quick-sort with 3-way partitioning of 2d array between indices l and r, according to column col.

+ +
+
+ +

◆ scale() [1/2]

+ +
+
+ + + + + + + + + + + +
Array1D< double > scale (Array1D< double > & x,
double alpha )
+
+ +

Returns 1D Arrays scaled by a double.

+ +
+
+ +

◆ scale() [2/2]

+ +
+
+ + + + + + + + + + + +
Array2D< double > scale (Array2D< double > & x,
double alpha )
+
+ +

Returns 2D Array scaled by a double.

+ +
+
+ +

◆ scaleinplace() [1/4]

+ +
+
+ + + + + + + + + + + +
void scaleinplace (Array1D< double > & x,
double alpha )
+
+ +

Multiply Array1D by double in place.

+ +
+
+ +

◆ scaleinplace() [2/4]

+ +
+
+ + + + + + + + + + + +
void scaleinplace (Array1D< int > & x,
int alpha )
+
+ +

Multiply Array1D by int in place.

+ +
+
+ +

◆ scaleinplace() [3/4]

+ +
+
+ + + + + + + + + + + +
void scaleinplace (Array2D< double > & x,
double alpha )
+
+ +

Multiply Array2D by double in place.

+ +
+
+ +

◆ scaleinplace() [4/4]

+ +
+
+ + + + + + + + + + + +
void scaleinplace (Array2D< int > & x,
int alpha )
+
+ +

Multiply Array2D by int in place.

+ +
+
+ +

◆ select_kth()

+ +
+
+ + + + + + + + + + + +
double select_kth (int k,
Array1D< double > & arr )
+
+ +

Select the k-th smallest element of an array arr.

+ +
+
+ +

◆ setdiff()

+ +
+
+ + + + + + + + + + + + + + + + +
void setdiff (Array1D< int > & A,
Array1D< int > & B,
Array1D< int > & C )
+
+ +

Returns $ C=A\backslash B$ (C=Elements of A that are not in B); C is sorted in ascending order.

+ +
+
+ +

◆ setdiff_s()

+ +
+
+ + + + + + + + + + + + + + + + +
void setdiff_s (Array1D< int > & A,
Array1D< int > & B,
Array1D< int > & C )
+
+ +

Returns $ C=A\backslash B$ ( C=Elements of A that are not in B); C is sorted in ascending order.

+
Note
Assumes A is sorted and uses a faster algorithm than setdiff
+
Todo
In future, this should sort A too and replace setdiff
+
Note
B is sorted on output as well
+ +
+
+ +

◆ shell_sort() [1/3]

+ +
+
+ + + + + + + +
void shell_sort (Array1D< double > & array)
+
+ +

Sorts double array in ascending order.

+ +
+
+ +

◆ shell_sort() [2/3]

+ +
+
+ + + + + + + +
void shell_sort (Array1D< int > & array)
+
+ +

Sorts integer array in ascending order.

+ +
+
+ +

◆ shell_sort() [3/3]

+ +
+
+ + + + + + + + + + + +
void shell_sort (int * a,
int n )
+
+ +

Sorts integer array.

+ +
+
+ +

◆ shell_sort_all()

+ +
+
+ + + + + + + + + + + + + + + + +
void shell_sort_all (Array2D< double > & array,
Array1D< int > & newInd,
Array1D< int > & oldInd )
+
+ +

Sorts double array in ascending order according to first column, then second column breaks the tie, and so on.

+ +
+
+ +

◆ shell_sort_col()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void shell_sort_col (Array2D< double > & array,
int col,
Array1D< int > & newInd,
Array1D< int > & oldInd )
+
+ +

Sorts double array in ascending order according to a given column.

+ +
+
+ +

◆ subMatrix_col()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void subMatrix_col (Array2D< T > & matrix,
Array1D< int > & ind,
Array2D< T > & submatrix )
+
+ +

Extracts from 'matrix' columns corresponding to indices 'ind' and returns them in 'submatrix' (double or int)

+ +
+
+ +

◆ subMatrix_row()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void subMatrix_row (Array2D< T > & matrix,
Array1D< int > & ind,
Array2D< T > & submatrix )
+
+ +

Extracts from 'matrix' rows corresponding to indices 'ind' and returns them in 'submatrix' (double or int)

+ +
+
+ +

◆ subtract() [1/2]

+ +
+
+ + + + + + + + + + + +
Array1D< double > subtract (Array1D< double > & x,
Array1D< double > & y )
+
+ +

Returns subtraction of two 1D Arrays (must be of the same shape)

+ +
+
+ +

◆ subtract() [2/2]

+ +
+
+ + + + + + + + + + + +
Array2D< double > subtract (Array2D< double > & x,
Array2D< double > & y )
+
+ +

Returns subtraction of two 2D Arrays (must be of the same shape)

+ +
+
+ +

◆ subtractinplace() [1/2]

+ +
+
+ + + + + + + + + + + +
void subtractinplace (Array1D< double > & x,
Array1D< double > & y )
+
+ +

Subtract two 1D Arrays in place. Difference is returned as x.

+ +
+
+ +

◆ subtractinplace() [2/2]

+ +
+
+ + + + + + + + + + + +
void subtractinplace (Array2D< double > & x,
Array2D< double > & y )
+
+ +

Subtract two 2D Arrays in place. Difference is returned as x.

+ +
+
+ +

◆ subVector()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + +
void subVector (Array1D< T > & vector,
Array1D< int > & ind,
Array1D< T > & subvector )
+
+ +

Extracts from 'vector', elements corresponding to indices 'ind' and returns them in 'subvector' (double or int)

+ +
+
+ +

◆ SVD()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void SVD (Array2D< double > & A,
Array2D< double > & U,
Array1D< double > & S,
Array2D< double > & VT )
+
+ +

Computes the SVD calculation of a 2D Array (need not be square)

+ +
+
+ +

◆ swap() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void swap (Array1D< double > & arr,
int i,
int j )
+
+ +

Swap i-th and j-th elements of the array arr.

+ +
+
+ +

◆ swap() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void swap (Array2D< double > & arr,
int i,
int j )
+
+ +

Swap i-th and j-th rows of the 2d array arr.

+ +
+
+ +

◆ trace()

+ +
+
+ + + + + + + +
double trace (Array2D< double > & mat)
+
+ +

Trace of a matrix.

+ +
+
+ +

◆ Trans()

+ +
+
+ + + + + + + +
Array2D< double > Trans (Array2D< double > & A)
+
+ +

Returns the transpose of a 2D Array.

+ +
+
+ +

◆ transpose()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + +
void transpose (Array2D< T > & x,
Array2D< T > & xt )
+
+ +

Transpose a 2d double or int array x and return the result in xt.

+ +
+
+ +

◆ vecIsInArray()

+ +
+
+ + + + + + + + + + + +
int vecIsInArray (Array1D< int > & vec,
Array2D< int > & array )
+
+ +

Checks if vec matches with any of the rows of array Returns the row number, or -1 if vec is not equal to any of the rows of array.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/arraytools_8h_source.html b/docs/html/arraytools_8h_source.html new file mode 100644 index 00000000..ebedb20d --- /dev/null +++ b/docs/html/arraytools_8h_source.html @@ -0,0 +1,372 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: arraytools.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
arraytools.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
32
+
33#ifndef ARRAYTOOLS_H
+
34#define ARRAYTOOLS_H
+
35
+
36#include <stdlib.h>
+
37#include "Array1D.h"
+
38#include "Array2D.h"
+
39
+
41template <typename T> void array1Dto2D(Array1D<T>& arr_1d,Array2D<T>& arr);
+
42
+
44template <typename T> void array2Dto1D(Array2D<T>& arr_2d,Array1D<T>& arr);
+
45
+
47template <typename T> void paste(Array1D<T>& arr1,Array1D<T>& arr2,Array2D<T>& arr);
+
48
+
51template <typename T> void generate_multigrid(Array2D<T>& multigrid,Array2D<T>& grid);
+
52
+
54void paste(Array2D<double>& x, Array2D<double>& y, Array2D<double>& xy);
+
55
+
57void merge(Array2D<double>& x, Array2D<double>& y, Array2D<double>& xy);
+
59void merge(Array1D<double>& x, Array1D<double>& y, Array1D<double>& xy);
+
61void merge(Array1D<int>& x, Array1D<int>& y, Array1D<int>& xy);
+
62
+
64void append(Array1D<double>& x, Array1D<double>& y);
+
66void append(Array1D<int>& x, Array1D<int>& y);
+
67
+
69template <typename T> void transpose(Array2D<T> &x, Array2D<T> &xt);
+
70
+
72void flatten(Array2D<double>& arr_2, Array1D<double>& arr_1);
+
73
+
77void fold_1dto2d_rowfirst(Array1D<double>& x1, Array2D<double>& x2);
+
78
+
82void fold_1dto2d_colfirst(Array1D<double>& x1, Array2D<double>& x2);
+
83
+
85void swap(Array1D<double>& arr,int i,int j);
+
86
+
88void swap(Array2D<double>& arr,int i,int j);
+
89
+
91double access(int nx, int ny, Array1D<double>& arr_1, int i, int j);
+
92
+
94double accessPythonHelper(int nx, int ny, Array1D<double>& arr_1, int i, int j);
+
95
+
97template <typename T> void getRow(Array2D<T> &arr2d, int k, Array1D<T> &arr1d);
+
98
+
100template <typename T> void getCol(Array2D<T> &arr2d, int k, Array1D<T> &arr1d);
+
101
+
103template <typename T> void addVal(int n, T *arr1d, T val) ;
+
104
+
106template <typename T> void addVal(Array1D<T> &arr1d, T val) ;
+
107
+
109template <typename T> void addVal(Array2D<T> &arr2d, T val) ;
+
110
+
112template <typename T> void subVector(Array1D<T> &vector, Array1D<int> &ind, Array1D<T> &subvector);
+
113
+
115template <typename T> void subMatrix_row(Array2D<T> &matrix, Array1D<int> &ind, Array2D<T> &submatrix);
+
116
+
118template <typename T> void subMatrix_col(Array2D<T> &matrix, Array1D<int> &ind, Array2D<T> &submatrix);
+
119
+
122template <typename T> void matPvec(Array2D<T> &matrix, const Array1D<T> &rc, T alpha, char *RC);
+
123
+
125template <typename T> T maxVal(const Array1D<T>& vector, int *indx) ;
+
126
+
128void setdiff(Array1D<int> &A, Array1D<int> &B, Array1D<int> &C) ;
+
129
+
134void setdiff_s(Array1D<int> &A, Array1D<int> &B, Array1D<int> &C) ;
+
135
+
137void shell_sort (int *a, int n) ;
+
139void shell_sort(Array1D<int>& array);
+
141void shell_sort(Array1D<double>& array);
+
143void shell_sort_col(Array2D<double>& array,int col,Array1D<int>& newInd, Array1D<int>& oldInd);
+
145void shell_sort_all(Array2D<double>& array,Array1D<int>& newInd, Array1D<int>& oldInd);
+
147void quicksort3(Array1D<double>& arr, int l, int r);
+
149void quicksort3(Array2D<double>& arr,int left, int right,int col);
+
151void quicksort3(Array2D<double>& arr,int left, int right);
+
152
+
156void intersect(Array1D<int> &A, Array1D<int> &B, Array1D<int> &C, Array1D<int> &iA,Array1D<int> &iB) ;
+
159void intersect(Array1D<int> &A, Array1D<int> &B, Array1D<int> &C) ;
+
160
+
163template <typename T> void find(Array1D<T> &theta, T lmbda, string type, Array1D<int> &indx) ;
+
164
+
167void prodAlphaMatVec (Array2D<double>& A, Array1D<double>& x, double alpha, Array1D<double>& y) ;
+
170void prodAlphaMatTVec(Array2D<double>& A, Array1D<double>& x, double alpha, Array1D<double>& y) ;
+
173void prodAlphaMatMat(Array2D<double>& A, Array2D<double>& B, double alpha, Array2D<double>& C);
+
176void prodAlphaMatTMat(Array2D<double>& A, Array2D<double>& B, double alpha, Array2D<double>& C) ;
+
178void addVecAlphaVecPow(Array1D<double>& x, double alpha, Array1D<double>& y, int ip) ;
+
180double prod_vecTmatvec(Array1D<double>& a, Array2D<double>& B, Array1D<double>& c);
+
182Array2D<double> MatTMat(Array2D<double>& A) ;
+
183
+
184
+
187template <typename T> void delRow(Array2D<T>& A, int irow) ;
+
188
+
191template <typename T> void delCol(Array2D<T> &A, int icol) ;
+
192
+
195template <typename T> void delCol(Array1D<T> &x, int icol) ;
+
196
+
199void paddMatRow(Array2D<double>& A, Array1D<double>& x) ;
+
202void paddMatCol(Array2D<double>& A, Array1D<double>& x) ;
+
205void paddMatRow(Array2D<int>& A, Array1D<int>& x) ;
+
208void paddMatCol(Array2D<int>& A, Array1D<int>& x) ;
+
211void paddMatColScal(Array2D<double>& A, Array1D<double>& x, double scal) ;
+
212
+
214bool is_equal(Array1D<int>& a, Array1D<int>& b);
+
216bool is_equal(Array1D<double>& a, Array1D<double>& b);
+
218bool is_less(Array1D<int>& a, Array1D<int>& b);
+
220bool is_less(Array1D<double>& a, Array1D<double>& b);
+
221
+
224int vecIsInArray(Array1D<int>& vec, Array2D<int>& array);
+
225
+
227double select_kth(int k, Array1D<double>& arr);
+
228
+
231double logdeterm(Array2D<double>& mat);
+
232
+
234double trace(Array2D<double>& mat);
+
235
+
237double evalLogMVN(Array1D<double>& x,Array1D<double>& mu,Array2D<double>& Sigma);
+
238
+
240Array2D<double> diag(Array1D<double>& diagonal_array);
+
241/**********************************************************
+
242NEW ROUTINES - Kenny
+
243***********************************************************/
+
244
+
246Array1D<double> copy(Array1D<double>&);
+
247
+
249Array2D<double> copy(Array2D<double>&);
+
250
+
252Array2D<double> mtxdel(Array2D<double>&, int index, int dim);
+
253
+
255Array1D<double> add(Array1D<double>&, Array1D<double>&);
+
256
+
258Array2D<double> add(Array2D<double>&, Array2D<double>&);
+
259
+
261void addinplace(Array2D<double>& x, Array2D<double>& y);
+
262
+
264void addinplace(Array1D<double>& x, Array1D<double>& y);
+
265
+
267Array1D<double> subtract(Array1D<double>&, Array1D<double>&);
+
268
+
270Array2D<double> subtract(Array2D<double>&, Array2D<double>&);
+
271
+
273void subtractinplace(Array2D<double>& x, Array2D<double>& y);
+
274
+
276void subtractinplace(Array1D<double>& x, Array1D<double>& y);
+
277
+
279Array1D<double> scale(Array1D<double>&, double);
+
280
+
282Array2D<double> scale(Array2D<double>&, double);
+
283
+
285void scaleinplace(Array1D<double>&, double);
+
286
+
288void scaleinplace(Array1D<int>&, int);
+
289
+
291void scaleinplace(Array2D<double>&, double);
+
292
+
294void scaleinplace(Array2D<int>&, int);
+
295
+
297Array2D<double> dotmult(Array2D<double>&A,Array2D<double>&B );
+
298
+
300Array1D<double> dotmult(Array1D<double>&A,Array1D<double>&B );
+
301
+
303Array2D<double> dotdivide(Array2D<double>&A,Array2D<double>&B );
+
304
+
306Array1D<double> dotdivide(Array1D<double>&A,Array1D<double>&B );
+
307
+
309double norm(Array1D<double>&);
+
310
+
312double dist_sq(Array1D<double>& x, Array1D<double>& y, Array1D<double>& w);
+
313
+
315Array2D<double> Trans(Array2D<double>&);
+
316
+
318double dot(Array1D<double>&, Array1D<double>&);
+
319
+
321Array1D<double> dot(Array2D<double>&, Array1D<double>&);
+
322
+
324Array2D<double> dot(Array2D<double>&, Array2D<double>&);
+
325
+
327Array2D<double> dotT(Array2D<double>&, Array2D<double>&);
+
328
+
330Array2D<double> INV(Array2D<double> &A);
+
331
+
333Array2D<double> AinvH(Array2D<double> &A,Array2D<double> &H);
+
334
+
336Array1D<double> Ainvb(Array2D<double> &A,Array1D<double> &b);
+
337
+
339void LSTSQ(Array2D<double> &A, Array1D<double> &b, Array1D<double> &x);
+
340
+
342void QR(Array2D<double>&B,Array2D<double>&Q,Array2D<double>&R);
+
343
+
345void SVD(Array2D<double>&A,Array2D<double>&U,Array1D<double>&S,Array2D<double>&VT);
+
346
+
348void printarray(Array1D<double>&);
+
349
+
351void printarray(Array1D<int>&);
+
352
+
354void printarray(Array2D<double>&);
+
355
+
357void printarray(Array2D<int>&);
+
358
+
359
+
360//---------------------------------------------------------------------------------------
+
361#endif // ARRAYTOOLS_H
+
Array1D.h
1D Array class for any type T
+
Array2D.h
2D Array class for any type T
+
prodAlphaMatMat
void prodAlphaMatMat(Array2D< double > &A, Array2D< double > &B, double alpha, Array2D< double > &C)
Returns , where 'A' and 'B' are 2D arrays and 'alpha' is a scalar. The 2D array 'C' has elements.
Definition arraytools.cpp:1025
+
QR
void QR(Array2D< double > &B, Array2D< double > &Q, Array2D< double > &R)
Computes the QR factorization of a 2D Array (need not be square)
Definition arraytools.cpp:2230
+
MatTMat
Array2D< double > MatTMat(Array2D< double > &A)
Returns , where 'A' is a 2D array.
Definition arraytools.cpp:1118
+
Trans
Array2D< double > Trans(Array2D< double > &)
Returns the transpose of a 2D Array.
Definition arraytools.cpp:2011
+
merge
void merge(Array2D< double > &x, Array2D< double > &y, Array2D< double > &xy)
Merge 2d double arrays (vertical stack)
Definition arraytools.cpp:179
+
mtxdel
Array2D< double > mtxdel(Array2D< double > &, int index, int dim)
Deletes matrix columns or rows. Index specifies which column or row and dim = 1 deletes column,...
Definition arraytools.cpp:1624
+
dotdivide
Array2D< double > dotdivide(Array2D< double > &A, Array2D< double > &B)
Returns the elementwise division of two 2D Arrays.
Definition arraytools.cpp:1948
+
AinvH
Array2D< double > AinvH(Array2D< double > &A, Array2D< double > &H)
Solves linear system AX=H, i.e. returns A^(-1)*H, where A is real, symmetric and positive definite.
Definition arraytools.cpp:2162
+
accessPythonHelper
double accessPythonHelper(int nx, int ny, Array1D< double > &arr_1, int i, int j)
Function written exclusively for Pybind11 to be able to load in the function access.
Definition arraytools.cpp:390
+
array1Dto2D
void array1Dto2D(Array1D< T > &arr_1d, Array2D< T > &arr)
Store a given 1d array in a 2d array with a single second dimension.
Definition arraytools.cpp:50
+
dotT
Array2D< double > dotT(Array2D< double > &, Array2D< double > &)
Returns the matrix matrix^T product.
Definition arraytools.cpp:2107
+
swap
void swap(Array1D< double > &arr, int i, int j)
Swap i-th and j-th elements of the array arr.
Definition arraytools.cpp:357
+
LSTSQ
void LSTSQ(Array2D< double > &A, Array1D< double > &b, Array1D< double > &x)
Least squares solution for overdetermined system. Note that A must be "taller than wide"....
Definition arraytools.cpp:2198
+
paddMatColScal
void paddMatColScal(Array2D< double > &A, Array1D< double > &x, double scal)
Padds square 2D array 'A' with the elements of 'x' and 'scal' as follows: and .
Definition arraytools.cpp:1316
+
paste
void paste(Array1D< T > &arr1, Array1D< T > &arr2, Array2D< T > &arr)
Paste two 1d arrays of same size into a single 2d array with second dimension equal to two.
Definition arraytools.cpp:86
+
find
void find(Array1D< T > &theta, T lmbda, string type, Array1D< int > &indx)
Return list of indices corresponding to elements of 1D array theta that are: larger ( type="gt" ),...
Definition arraytools.cpp:928
+
SVD
void SVD(Array2D< double > &A, Array2D< double > &U, Array1D< double > &S, Array2D< double > &VT)
Computes the SVD calculation of a 2D Array (need not be square)
Definition arraytools.cpp:2292
+
setdiff_s
void setdiff_s(Array1D< int > &A, Array1D< int > &B, Array1D< int > &C)
Returns ( C=Elements of A that are not in B); C is sorted in ascending order.
Definition arraytools.cpp:613
+
setdiff
void setdiff(Array1D< int > &A, Array1D< int > &B, Array1D< int > &C)
Returns (C=Elements of A that are not in B); C is sorted in ascending order.
Definition arraytools.cpp:593
+
delCol
void delCol(Array2D< T > &A, int icol)
Deletes column 'icol' from 2D array 'A'.
Definition arraytools.cpp:1167
+
logdeterm
double logdeterm(Array2D< double > &mat)
Log-determinant of a real symmetric positive-definite matrix.
Definition arraytools.cpp:1494
+
matPvec
void matPvec(Array2D< T > &matrix, const Array1D< T > &rc, T alpha, char *RC)
Adds scaled row or column to all rows / columns of a matrix (double or int)
Definition arraytools.cpp:530
+
fold_1dto2d_rowfirst
void fold_1dto2d_rowfirst(Array1D< double > &x1, Array2D< double > &x2)
Fold a 1d array into a 2d array (double format), row first.
Definition arraytools.cpp:318
+
vecIsInArray
int vecIsInArray(Array1D< int > &vec, Array2D< int > &array)
Checks if vec matches with any of the rows of array Returns the row number, or -1 if vec is not equal...
Definition arraytools.cpp:1428
+
dist_sq
double dist_sq(Array1D< double > &x, Array1D< double > &y, Array1D< double > &w)
Weighted vector distance-squared.
Definition arraytools.cpp:1997
+
printarray
void printarray(Array1D< double > &)
Prints 1D double Array to screen (alternative to for loop using cout)
Definition arraytools.cpp:2323
+
is_less
bool is_less(Array1D< int > &a, Array1D< int > &b)
Checks if one 1d int array is less than another (by first element, then by second,...
Definition arraytools.cpp:1380
+
paddMatCol
void paddMatCol(Array2D< double > &A, Array1D< double > &x)
Padds 2D array 'A' with the column 'x'.
Definition arraytools.cpp:1241
+
delRow
void delRow(Array2D< T > &A, int irow)
Deletes row 'irow' from 2D array 'A'.
Definition arraytools.cpp:1138
+
norm
double norm(Array1D< double > &)
Returns norm of 1D Array (Euclidean)
Definition arraytools.cpp:1990
+
diag
Array2D< double > diag(Array1D< double > &diagonal_array)
Returns a diagonal matrix with a given diagonal.
Definition arraytools.cpp:1590
+
getCol
void getCol(Array2D< T > &arr2d, int k, Array1D< T > &arr1d)
Retrieves column 'k' from 2D array 'arr2d' and returns it in 1D array 'arr1d'.
Definition arraytools.cpp:412
+
shell_sort_all
void shell_sort_all(Array2D< double > &array, Array1D< int > &newInd, Array1D< int > &oldInd)
Sorts double array in ascending order according to first column, then second column breaks the tie,...
Definition arraytools.cpp:734
+
prodAlphaMatTMat
void prodAlphaMatTMat(Array2D< double > &A, Array2D< double > &B, double alpha, Array2D< double > &C)
Returns , where 'A' and 'B' are 2D arrays and 'alpha' is a scalar. The 2D array 'C' has elements.
Definition arraytools.cpp:1059
+
add
Array1D< double > add(Array1D< double > &, Array1D< double > &)
Add two 1D Arrays and returns sum (must be of the same shape)
Definition arraytools.cpp:1656
+
copy
Array1D< double > copy(Array1D< double > &)
Returns a copy of 1D array.
Definition arraytools.cpp:1607
+
prod_vecTmatvec
double prod_vecTmatvec(Array1D< double > &a, Array2D< double > &B, Array1D< double > &c)
Returns .
Definition arraytools.cpp:1106
+
quicksort3
void quicksort3(Array1D< double > &arr, int l, int r)
Quick-sort with 3-way partitioning of array between indices l and r.
Definition arraytools.cpp:780
+
subMatrix_col
void subMatrix_col(Array2D< T > &matrix, Array1D< int > &ind, Array2D< T > &submatrix)
Extracts from 'matrix' columns corresponding to indices 'ind' and returns them in 'submatrix' (double...
Definition arraytools.cpp:505
+
paddMatRow
void paddMatRow(Array2D< double > &A, Array1D< double > &x)
Padds 2D array 'A' with the row 'x'.
Definition arraytools.cpp:1217
+
getRow
void getRow(Array2D< T > &arr2d, int k, Array1D< T > &arr1d)
Retrieves row 'k' from 2D array 'arr2d' and returns it in 1D array 'arr1d'.
Definition arraytools.cpp:397
+
intersect
void intersect(Array1D< int > &A, Array1D< int > &B, Array1D< int > &C, Array1D< int > &iA, Array1D< int > &iB)
Finds common entries in 1D arrays 'A' and 'B' and returns them in 'C', sorted in ascending order....
Definition arraytools.cpp:862
+
array2Dto1D
void array2Dto1D(Array2D< T > &arr_2d, Array1D< T > &arr)
Store a given 2d array with a single second dimension in a 1d array.
Definition arraytools.cpp:65
+
prodAlphaMatTVec
void prodAlphaMatTVec(Array2D< double > &A, Array1D< double > &x, double alpha, Array1D< double > &y)
Returns , where 'A' is a 2D array, 'x' is 1D array of size and 'alpha' is a scalar....
Definition arraytools.cpp:994
+
addinplace
void addinplace(Array2D< double > &x, Array2D< double > &y)
Add two 2D Arrays in place. Summation is returned as x.
Definition arraytools.cpp:1702
+
trace
double trace(Array2D< double > &mat)
Trace of a matrix.
Definition arraytools.cpp:1536
+
fold_1dto2d_colfirst
void fold_1dto2d_colfirst(Array1D< double > &x1, Array2D< double > &x2)
Fold a 1d array into a 2d array (double format), column first.
Definition arraytools.cpp:337
+
subtractinplace
void subtractinplace(Array2D< double > &x, Array2D< double > &y)
Subtract two 2D Arrays in place. Difference is returned as x.
Definition arraytools.cpp:1789
+
shell_sort_col
void shell_sort_col(Array2D< double > &array, int col, Array1D< int > &newInd, Array1D< int > &oldInd)
Sorts double array in ascending order according to a given column.
Definition arraytools.cpp:699
+
dotmult
Array2D< double > dotmult(Array2D< double > &A, Array2D< double > &B)
Returns the elementwise multiplication of two 2D Arrays.
Definition arraytools.cpp:1906
+
subVector
void subVector(Array1D< T > &vector, Array1D< int > &ind, Array1D< T > &subvector)
Extracts from 'vector', elements corresponding to indices 'ind' and returns them in 'subvector' (doub...
Definition arraytools.cpp:457
+
shell_sort
void shell_sort(int *a, int n)
Sorts integer array.
Definition arraytools.cpp:634
+
addVal
void addVal(int n, T *arr1d, T val)
Adds 'val' to the first n elements of an array pointer (double or int)
Definition arraytools.cpp:425
+
access
double access(int nx, int ny, Array1D< double > &arr_1, int i, int j)
Access element from 1D array 'arr_1'.
Definition arraytools.cpp:382
+
maxVal
T maxVal(const Array1D< T > &vector, int *indx)
Returns maximum value in 'vector' and its location in *indx (double or int)
Definition arraytools.cpp:576
+
scale
Array1D< double > scale(Array1D< double > &, double)
Returns 1D Arrays scaled by a double.
Definition arraytools.cpp:1831
+
scaleinplace
void scaleinplace(Array1D< double > &, double)
Multiply Array1D by double in place.
Definition arraytools.cpp:1859
+
Ainvb
Array1D< double > Ainvb(Array2D< double > &A, Array1D< double > &b)
Solves linear system Ax=b, i.e. return A^(-1)*b where A is real, symmetric and positive definite.
Definition arraytools.cpp:2180
+
subtract
Array1D< double > subtract(Array1D< double > &, Array1D< double > &)
Returns subtraction of two 1D Arrays (must be of the same shape)
Definition arraytools.cpp:1745
+
is_equal
bool is_equal(Array1D< int > &a, Array1D< int > &b)
Checks if two 1d int arrays are equal.
Definition arraytools.cpp:1342
+
append
void append(Array1D< double > &x, Array1D< double > &y)
Append array y to array x in place (double format)
Definition arraytools.cpp:248
+
evalLogMVN
double evalLogMVN(Array1D< double > &x, Array1D< double > &mu, Array2D< double > &Sigma)
Evaluates the natural logarithm of a multivariate normal distribution.
Definition arraytools.cpp:1548
+
subMatrix_row
void subMatrix_row(Array2D< T > &matrix, Array1D< int > &ind, Array2D< T > &submatrix)
Extracts from 'matrix' rows corresponding to indices 'ind' and returns them in 'submatrix' (double or...
Definition arraytools.cpp:481
+
prodAlphaMatVec
void prodAlphaMatVec(Array2D< double > &A, Array1D< double > &x, double alpha, Array1D< double > &y)
Returns , where 'A' is a 2D array, 'x' is 1D array of size and 'alpha' is a scalar....
Definition arraytools.cpp:962
+
select_kth
double select_kth(int k, Array1D< double > &arr)
Select the k-th smallest element of an array arr.
Definition arraytools.cpp:1452
+
INV
Array2D< double > INV(Array2D< double > &A)
Returns the inverse of a square 2D Array.
Definition arraytools.cpp:2132
+
addVecAlphaVecPow
void addVecAlphaVecPow(Array1D< double > &x, double alpha, Array1D< double > &y, int ip)
Implements , where 'x' and 'y' are 1D arrays with elements.
Definition arraytools.cpp:1093
+
flatten
void flatten(Array2D< double > &arr_2, Array1D< double > &arr_1)
Unfold/flatten a 2d array into a 1d array (double format)
Definition arraytools.cpp:299
+
transpose
void transpose(Array2D< T > &x, Array2D< T > &xt)
Transpose a 2d double or int array x and return the result in xt.
Definition arraytools.cpp:279
+
dot
double dot(Array1D< double > &, Array1D< double > &)
Returns the dot product of two 1D Arrays (must be of the same length)
Definition arraytools.cpp:2027
+
generate_multigrid
void generate_multigrid(Array2D< T > &multigrid, Array2D< T > &grid)
Generates multigrid as a cartesian product of each column of grid.
Definition arraytools.cpp:106
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
x1
static double x1[]
Definition gkpclib.cpp:36
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/bc_s.png b/docs/html/bc_s.png new file mode 100644 index 0000000000000000000000000000000000000000..224b29aa9847d5a4b3902efd602b7ddf7d33e6c2 GIT binary patch literal 676 zcmV;V0$crwP)y__>=_9%My z{n931IS})GlGUF8K#6VIbs%684A^L3@%PlP2>_sk`UWPq@f;rU*V%rPy_ekbhXT&s z(GN{DxFv}*vZp`F>S!r||M`I*nOwwKX+BC~3P5N3-)Y{65c;ywYiAh-1*hZcToLHK ztpl1xomJ+Yb}K(cfbJr2=GNOnT!UFA7Vy~fBz8?J>XHsbZoDad^8PxfSa0GDgENZS zuLCEqzb*xWX2CG*b&5IiO#NzrW*;`VC9455M`o1NBh+(k8~`XCEEoC1Ybwf;vr4K3 zg|EB<07?SOqHp9DhLpS&bzgo70I+ghB_#)K7H%AMU3v}xuyQq9&Bm~++VYhF09a+U zl7>n7Jjm$K#b*FONz~fj;I->Bf;ule1prFN9FovcDGBkpg>)O*-}eLnC{6oZHZ$o% zXKW$;0_{8hxHQ>l;_*HATI(`7t#^{$(zLe}h*mqwOc*nRY9=?Sx4OOeVIfI|0V(V2 zBrW#G7Ss9wvzr@>H*`r>zE z+e8bOBgqIgldUJlG(YUDviMB`9+DH8n-s9SXRLyJHO1!=wY^79WYZMTa(wiZ!zP66 zA~!21vmF3H2{ngD;+`6j#~6j;$*f*G_2ZD1E;9(yaw7d-QnSCpK(cR1zU3qU0000< KMNUMnLSTYoA~SLT literal 0 HcmV?d00001 diff --git a/docs/html/bc_sd.png b/docs/html/bc_sd.png new file mode 100644 index 0000000000000000000000000000000000000000..31ca888dc71049713b35c351933a8d0f36180bf1 GIT binary patch literal 635 zcmV->0)+jEP)Jwi0r1~gdSq#w{Bu1q z`craw(p2!hu$4C_$Oc3X(sI6e=9QSTwPt{G) z=htT&^~&c~L2~e{r5_5SYe7#Is-$ln>~Kd%$F#tC65?{LvQ}8O`A~RBB0N~`2M+waajO;5>3B&-viHGJeEK2TQOiPRa zfDKyqwMc4wfaEh4jt>H`nW_Zidwk@Bowp`}(VUaj-pSI(-1L>FJVsX}Yl9~JsqgsZ zUD9(rMwf23Gez6KPa|wwInZodP-2}9@fK0Ga_9{8SOjU&4l`pH4@qlQp83>>HT$xW zER^U>)MyV%t(Lu=`d=Y?{k1@}&r7ZGkFQ%z%N+sE9BtYjovzxyxCPxN6&@wLK{soQ zSmkj$aLI}miuE^p@~4}mg9OjDfGEkgY4~^XzLRUBB*O{+&vq<3v(E%+k_i%=`~j%{ Vj14gnt9}3g002ovPDHLkV1n!oC4m3{ literal 0 HcmV?d00001 diff --git a/docs/html/bcs_8cpp.html b/docs/html/bcs_8cpp.html new file mode 100644 index 00000000..4846f167 --- /dev/null +++ b/docs/html/bcs_8cpp.html @@ -0,0 +1,280 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: bcs.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
bcs.cpp File Reference
+
+
+ +

Implementation of Bayesian compressive sensing algorithm. +More...

+
#include "stdlib.h"
+#include "stdio.h"
+#include "math.h"
+#include "assert.h"
+#include <sstream>
+#include <fstream>
+#include "bcs.h"
+#include "tools.h"
+#include "ftndefs.h"
+#include "deplapack.h"
+#include "arrayio.h"
+#include "arraytools.h"
+
+ + + + + + + +

+Functions

void WBCS (Array2D< double > &PHI, Array1D< double > &y, Array1D< double > &sigma2, double eta, Array1D< double > &lambda_init, int adaptive, int optimal, double scale, int verbose, Array1D< double > &weights, Array1D< int > &used, Array1D< double > &errbars, Array1D< double > &basis, Array1D< double > &alpha, Array2D< double > &Sig)
 The implementation of the Bayesian Compressive Sensing algorithm using Laplace Priors.
 
void BCS (Array2D< double > &PHI, Array1D< double > &y, double &sigma2, double eta, Array1D< double > &lambda_init, int adaptive, int optimal, double scale, int verbose, Array1D< double > &weights, Array1D< int > &used, Array1D< double > &errbars, Array1D< double > &basis, Array1D< double > &alpha, double &lambda)
 Essentially same functionality as WBCS, but slightly altered I/O.
 
+

Detailed Description

+

Implementation of Bayesian compressive sensing algorithm.

+

Function Documentation

+ +

◆ BCS()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void BCS (Array2D< double > & PHI,
Array1D< double > & y,
double & sigma2,
double eta,
Array1D< double > & lambda_init,
int adaptive,
int optimal,
double scale,
int verbose,
Array1D< double > & weights,
Array1D< int > & used,
Array1D< double > & errbars,
Array1D< double > & basis,
Array1D< double > & alpha,
double & lambda )
+
+ +

Essentially same functionality as WBCS, but slightly altered I/O.

+
Note
Kept for backward compatibility with PyUQTk and BCS tests
+ +
+
+ +

◆ WBCS()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void WBCS (Array2D< double > & PHI,
Array1D< double > & y,
Array1D< double > & sigma2,
double eta,
Array1D< double > & lambda_init,
int adaptive,
int optimal,
double scale,
int verbose,
Array1D< double > & weights,
Array1D< int > & used,
Array1D< double > & errbars,
Array1D< double > & basis,
Array1D< double > & alpha,
Array2D< double > & Sig )
+
+ +

The implementation of the Bayesian Compressive Sensing algorithm using Laplace Priors.

+

Implements weighted version of the original Bayesian Compressive Sensing algorithm.

+
Note
This function has been written relying on the algorithm and MATLAB code presented in http://ivpl.eecs.northwestern.edu/research/projects/bayesian-compressive-sensing-using-laplace-priors and references therein
+
Todo
The array manipulations are not optimized - perhaps they need to be reconsidered using, say, fortran matrix-vector manipulation routines
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/bcs_8h.html b/docs/html/bcs_8h.html new file mode 100644 index 00000000..397f6bc4 --- /dev/null +++ b/docs/html/bcs_8h.html @@ -0,0 +1,315 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: bcs.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Macros | +Functions
+
bcs.h File Reference
+
+
+ +

Header for the implementations of Bayesian compressive sensing algorithm. +More...

+
#include "Array1D.h"
+#include "Array2D.h"
+
+

Go to the source code of this file.

+ + + + +

+Macros

#define MAX_IT   1000
 
+ + + + + + + +

+Functions

void WBCS (Array2D< double > &PHI, Array1D< double > &y, Array1D< double > &sigma2, double eta, Array1D< double > &lambda_init, int adaptive, int optimal, double scale, int verbose, Array1D< double > &weights, Array1D< int > &used, Array1D< double > &errbars, Array1D< double > &basis, Array1D< double > &alpha, Array2D< double > &Sig)
 Implements weighted version of the original Bayesian Compressive Sensing algorithm.
 
void BCS (Array2D< double > &PHI, Array1D< double > &y, double &sigma2, double eta, Array1D< double > &lambda_init, int adaptive, int optimal, double scale, int verbose, Array1D< double > &weights, Array1D< int > &used, Array1D< double > &errbars, Array1D< double > &basis, Array1D< double > &alpha, double &lambda)
 Essentially same functionality as WBCS, but slightly altered I/O.
 
+

Detailed Description

+

Header for the implementations of Bayesian compressive sensing algorithm.

+

Macro Definition Documentation

+ +

◆ MAX_IT

+ +
+
+ + + + +
#define MAX_IT   1000
+
+ +
+
+

Function Documentation

+ +

◆ BCS()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void BCS (Array2D< double > & PHI,
Array1D< double > & y,
double & sigma2,
double eta,
Array1D< double > & lambda_init,
int adaptive,
int optimal,
double scale,
int verbose,
Array1D< double > & weights,
Array1D< int > & used,
Array1D< double > & errbars,
Array1D< double > & basis,
Array1D< double > & alpha,
double & lambda )
+
+ +

Essentially same functionality as WBCS, but slightly altered I/O.

+
Note
Kept for backward compatibility with PyUQTk and BCS tests
+ +
+
+ +

◆ WBCS()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void WBCS (Array2D< double > & PHI,
Array1D< double > & y,
Array1D< double > & sigma2,
double eta,
Array1D< double > & lambda_init,
int adaptive,
int optimal,
double scale,
int verbose,
Array1D< double > & weights,
Array1D< int > & used,
Array1D< double > & errbars,
Array1D< double > & basis,
Array1D< double > & alpha,
Array2D< double > & Sig )
+
+ +

Implements weighted version of the original Bayesian Compressive Sensing algorithm.

+
Note
This function has been written relying on the algorithm and MATLAB code presented in http://ivpl.eecs.northwestern.edu/research/projects/bayesian-compressive-sensing-using-laplace-priors and references therein
+
Todo
The array manipulations are not optimized - perhaps they need to be reconsidered using, say, fortran matrix-vector manipulation routines
+
Parameters
+ + + + + + + + + + + + + + + + +
[in]PHI: design matrix
[in]y: data vector
[in,out]sigma2: initial noise variance (usually var(y)/1e2) : re-estimated on output
[in]eta: stopping criterion (usually 1e-5)
[in]lambda_init: regularization weight vector, if empty array, it automatically computes the optimal, uniform weights
[in]adaptive: generate basis for adaptive CS (usually 0)
[in]optimal: use the rigorous implementation of adaptive CS (usually 1)
[in]scale: diagonal loading parameter (usually 0.1)
[in]verbose: verbosity flag
[out]weights: sparse weights
[out]used: the positions of sparse weights
[out]errbars: one standard deviation around the sparse weights
[out]basis: if adaptive==1, then this is the next projection vector, see [Ji:2008]
[out]alpha: estimated sparse hyperparameters (1/gamma), see [Babacan:2010]
[out]Sig: covariance matrix of the weights
+
+
+

Implements weighted version of the original Bayesian Compressive Sensing algorithm.

+
Note
This function has been written relying on the algorithm and MATLAB code presented in http://ivpl.eecs.northwestern.edu/research/projects/bayesian-compressive-sensing-using-laplace-priors and references therein
+
Todo
The array manipulations are not optimized - perhaps they need to be reconsidered using, say, fortran matrix-vector manipulation routines
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/bcs_8h_source.html b/docs/html/bcs_8h_source.html new file mode 100644 index 00000000..f44d4128 --- /dev/null +++ b/docs/html/bcs_8h_source.html @@ -0,0 +1,142 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: bcs.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
bcs.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
30
+
31#ifndef BCS_H
+
32#define BCS_H
+
33
+
34#include "Array1D.h"
+
35#include "Array2D.h"
+
36
+
37
+
38#define MAX_IT 1000
+
39
+
40
+
41
+
64void WBCS(Array2D<double> &PHI, Array1D<double> &y, Array1D<double> &sigma2,
+
65 double eta, Array1D<double> &lambda_init,
+
66 int adaptive, int optimal, double scale, int verbose,
+
67 Array1D<double> &weights, Array1D<int> &used,
+
68 Array1D<double> &errbars, Array1D<double> &basis,
+
69 Array1D<double> &alpha, Array2D<double> &Sig);
+
70
+
71
+
72
+
75void BCS(Array2D<double> &PHI, Array1D<double> &y, double &sigma2,
+
76 double eta, Array1D<double> &lambda_init,
+
77 int adaptive, int optimal, double scale, int verbose,
+
78 Array1D<double> &weights, Array1D<int> &used,
+
79 Array1D<double> &errbars, Array1D<double> &basis,
+
80 Array1D<double> &alpha, double &lambda) ;
+
81
+
84// void BCS(Array2D<double> &PHI, Array1D<double> &y, Array1D<double> &sigma2,
+
85// double eta, Array1D<double> &lambda_init,
+
86// int adaptive, int optimal, double scale, int verbose,
+
87// Array1D<double> &weights, Array1D<int> &used,
+
88// Array1D<double> &errbars, Array1D<double> &basis,
+
89// Array1D<double> &alpha, Array1D<double> &lambda) ;
+
90
+
91
+
92
+
93#endif // BCS_H
+
Array1D.h
1D Array class for any type T
+
Array2D.h
2D Array class for any type T
+
scale
Array1D< double > scale(Array1D< double > &x, double alpha)
Returns 1D Arrays scaled by a double.
Definition arraytools.cpp:1831
+
BCS
void BCS(Array2D< double > &PHI, Array1D< double > &y, double &sigma2, double eta, Array1D< double > &lambda_init, int adaptive, int optimal, double scale, int verbose, Array1D< double > &weights, Array1D< int > &used, Array1D< double > &errbars, Array1D< double > &basis, Array1D< double > &alpha, double &lambda)
Essentially same functionality as WBCS, but slightly altered I/O.
Definition bcs.cpp:514
+
WBCS
void WBCS(Array2D< double > &PHI, Array1D< double > &y, Array1D< double > &sigma2, double eta, Array1D< double > &lambda_init, int adaptive, int optimal, double scale, int verbose, Array1D< double > &weights, Array1D< int > &used, Array1D< double > &errbars, Array1D< double > &basis, Array1D< double > &alpha, Array2D< double > &Sig)
Implements weighted version of the original Bayesian Compressive Sensing algorithm.
Definition bcs.cpp:93
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/citelist.html b/docs/html/citelist.html new file mode 100644 index 00000000..e938cd86 --- /dev/null +++ b/docs/html/citelist.html @@ -0,0 +1,71 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Bibliography + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Bibliography
+
+
+
+
+
+
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classArray1D-members.html b/docs/html/classArray1D-members.html new file mode 100644 index 00000000..d229bf0b --- /dev/null +++ b/docs/html/classArray1D-members.html @@ -0,0 +1,103 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Array1D< T > Member List
+
+
+ +

This is the complete list of members for Array1D< T >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Array1D()Array1D< T >inline
Array1D(const int &nx)Array1D< T >inline
Array1D(const int &nx, const T &t)Array1D< T >inline
Array1D(const Array1D &obj)Array1D< T >inline
assign(const int x, const T val)Array1D< T >inline
Clear()Array1D< T >inline
data_Array1D< T >
DumpBinary(FILE *f_out) constArray1D< T >inline
DumpBinary(char *filename)Array1D< T >inline
DumpBinary4py(char *filename)Array1D< T >inline
erase(int ix)Array1D< T >inline
flatten()Array1D< T >inline
GetArrayPointer()Array1D< T >inline
GetConstArrayPointer() constArray1D< T >inline
insert(Array1D< T > &insarr, int ix)Array1D< T >inline
insert(const T &insval, int ix)Array1D< T >inline
Length() constArray1D< T >inline
operator()(int ix)Array1D< T >inline
operator()(int ix) constArray1D< T >inline
operator=(const Array1D &obj)Array1D< T >inline
operator[](int i)Array1D< T >inline
PushBack(const T &t)Array1D< T >inline
ReadBinary(FILE *f_in)Array1D< T >inline
ReadBinary(char *filename)Array1D< T >inline
ReadBinary4py(char *filename, int n)Array1D< T >inline
Resize(const int &nx)Array1D< T >inline
Resize(const int &nx, const T &t)Array1D< T >inline
setArray(vector< T > inarray)Array1D< T >inline
SetValue(const T &t)Array1D< T >inline
shape()Array1D< T >inline
type()Array1D< T >inline
XSize() constArray1D< T >inline
xsize_Array1D< T >
~Array1D()Array1D< T >inline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classArray1D.html b/docs/html/classArray1D.html new file mode 100644 index 00000000..a6101adf --- /dev/null +++ b/docs/html/classArray1D.html @@ -0,0 +1,1149 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Array1D< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Public Attributes | +List of all members
+
Array1D< T > Class Template Reference
+
+
+ +

Stores data of any type T in a 1D array. + More...

+ +

#include <Array1D.h>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Array1D ()
 Default constructor, which does not allocate any memory.
 
 Array1D (const int &nx)
 Constructor that allocates the memory.
 
 Array1D (const int &nx, const T &t)
 Constructor that allocates and initializes the data to a value t.
 
Array1D & operator= (const Array1D &obj)
 Assignment operator copies the data structure by value.
 
 Array1D (const Array1D &obj)
 Copy constructor.
 
 ~Array1D ()
 Destructor that frees up the memory.
 
void Clear ()
 Function to clear the memory.
 
int XSize () const
 Returns size in the x-direction.
 
int Length () const
 Returns length (i.e. size in the x-direction)
 
void Resize (const int &nx)
 Resizes the array.
 
void Resize (const int &nx, const T &t)
 Resizes the array and sets ALL entries to the specified value.
 
void SetValue (const T &t)
 Set all values in the array to the given value.
 
void PushBack (const T &t)
 Add element to the end of the vector.
 
T * GetArrayPointer ()
 Return a pointer to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).
 
const T * GetConstArrayPointer () const
 Return a const point to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).
 
T & operator() (int ix)
 
const T & operator() (int ix) const
 
void insert (Array1D< T > &insarr, int ix)
 Insert a given array to the position ix.
 
void insert (const T &insval, int ix)
 Insert a given value to the position ix.
 
void erase (int ix)
 Erase the value from the position ix.
 
void DumpBinary (FILE *f_out) const
 Dump contents of the array to a file in binary format.
 
void ReadBinary (FILE *f_in)
 Read contents of the array from a file in binary format.
 
T & operator[] (int i)
 
vector< int > shape ()
 
void assign (const int x, const T val)
 
void DumpBinary (char *filename)
 Dump contents of the array to a file in binary format.
 
void ReadBinary (char *filename)
 
void DumpBinary4py (char *filename)
 
void ReadBinary4py (char *filename, int n)
 
void setArray (vector< T > inarray)
 
vector< T > flatten ()
 
string type ()
 
+ + + + + +

+Public Attributes

int xsize_
 
vector< T > data_
 
+

Detailed Description

+
template<typename T>
+class Array1D< T >

Stores data of any type T in a 1D array.

+

This class also provides a Fortran-like access operator () as well as a function to access the data in the array through a pointer that can be passed to F77 or C routines.

Author
Bert Debusschere bjdeb.nosp@m.us@s.nosp@m.andia.nosp@m..gov
+
Date
Apr 2005 - Nov 2007
+
Note
Inspired by Helgi Adalsteinsson's Array class implementation
+
Todo
double check copy constructor
+

Constructor & Destructor Documentation

+ +

◆ Array1D() [1/4]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
Array1D< T >::Array1D ()
+ 		+inline
+
+ +

Default constructor, which does not allocate any memory.

+ +
+
+ +

◆ Array1D() [2/4]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
Array1D< T >::Array1D (const int & nx)
+ 		+inline
+
+ +

Constructor that allocates the memory.

+ +
+
+ +

◆ Array1D() [3/4]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
Array1D< T >::Array1D (const int & nx,
const T & t )
+ 		+inline
+
+ +

Constructor that allocates and initializes the data to a value t.

+ +
+
+ +

◆ Array1D() [4/4]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
Array1D< T >::Array1D (const Array1D< T > & obj)
+ 		+inline
+
+ +

Copy constructor.

+ +
+
+ +

◆ ~Array1D()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
Array1D< T >::~Array1D ()
+ 		+inline
+
+ +

Destructor that frees up the memory.

+ +
+
+

Member Function Documentation

+ +

◆ assign()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
void Array1D< T >::assign (const int x,
const T val )
+ 		+inline
+
+ +
+
+ +

◆ Clear()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array1D< T >::Clear ()
+ 		+inline
+
+ +

Function to clear the memory.

+ +
+
+ +

◆ DumpBinary() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array1D< T >::DumpBinary (char * filename)
+ 		+inline
+
+ +

Dump contents of the array to a file in binary format.

+ +
+
+ +

◆ DumpBinary() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array1D< T >::DumpBinary (FILE * f_out) const
+ 		+inline
+
+ +

Dump contents of the array to a file in binary format.

+ +
+
+ +

◆ DumpBinary4py()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array1D< T >::DumpBinary4py (char * filename)
+ 		+inline
+
+ +
+
+ +

◆ erase()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array1D< T >::erase (int ix)
+ 		+inline
+
+ +

Erase the value from the position ix.

+ +
+
+ +

◆ flatten()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
vector< T > Array1D< T >::flatten ()
+ 		+inline
+
+ +
+
+ +

◆ GetArrayPointer()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T * Array1D< T >::GetArrayPointer ()
+ 		+inline
+
+ +

Return a pointer to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).

+ +
+
+ +

◆ GetConstArrayPointer()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
const T * Array1D< T >::GetConstArrayPointer () const
+ 		+inline
+
+ +

Return a const point to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).

+ +
+
+ +

◆ insert() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
void Array1D< T >::insert (Array1D< T > & insarr,
int ix )
+ 		+inline
+
+ +

Insert a given array to the position ix.

+
Note
ix=0 means insert at the beginning, ix=xsize_ means insert at the end
+ +
+
+ +

◆ insert() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
void Array1D< T >::insert (const T & insval,
int ix )
+ 		+inline
+
+ +

Insert a given value to the position ix.

+
Note
ix=0 means insert at the beginning, ix=xsize_ means insert at the end
+ +
+
+ +

◆ Length()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
int Array1D< T >::Length () const
+ 		+inline
+
+ +

Returns length (i.e. size in the x-direction)

+ +
+
+ +

◆ operator()() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T & Array1D< T >::operator() (int ix)
+ 		+inline
+
+ +
+
+ +

◆ operator()() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
const T & Array1D< T >::operator() (int ix) const
+ 		+inline
+
+ +
+
+ +

◆ operator=()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
Array1D & Array1D< T >::operator= (const Array1D< T > & obj)
+ 		+inline
+
+ +

Assignment operator copies the data structure by value.

+ +
+
+ +

◆ operator[]()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T & Array1D< T >::operator[] (int i)
+ 		+inline
+
+ +
+
+ +

◆ PushBack()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array1D< T >::PushBack (const T & t)
+ 		+inline
+
+ +

Add element to the end of the vector.

+ +
+
+ +

◆ ReadBinary() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array1D< T >::ReadBinary (char * filename)
+ 		+inline
+
+ +
+
+ +

◆ ReadBinary() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array1D< T >::ReadBinary (FILE * f_in)
+ 		+inline
+
+ +

Read contents of the array from a file in binary format.

+ +
+
+ +

◆ ReadBinary4py()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
void Array1D< T >::ReadBinary4py (char * filename,
int n )
+ 		+inline
+
+ +
+
+ +

◆ Resize() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array1D< T >::Resize (const int & nx)
+ 		+inline
+
+ +

Resizes the array.

+ +
+
+ +

◆ Resize() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
void Array1D< T >::Resize (const int & nx,
const T & t )
+ 		+inline
+
+ +

Resizes the array and sets ALL entries to the specified value.

+
Warning
All original data will get lost if this function is used!
+ +
+
+ +

◆ setArray()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array1D< T >::setArray (vector< T > inarray)
+ 		+inline
+
+ +
+
+ +

◆ SetValue()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array1D< T >::SetValue (const T & t)
+ 		+inline
+
+ +

Set all values in the array to the given value.

+ +
+
+ +

◆ shape()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
vector< int > Array1D< T >::shape ()
+ 		+inline
+
+ +
+
+ +

◆ type()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
string Array1D< T >::type ()
+ 		+inline
+
+ +
+
+ +

◆ XSize()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
int Array1D< T >::XSize () const
+ 		+inline
+
+ +

Returns size in the x-direction.

+ +
+
+

Member Data Documentation

+ +

◆ data_

+ +
+
+
+template<typename T >
+ + + + +
vector<T> Array1D< T >::data_
+
+ +
+
+ +

◆ xsize_

+ +
+
+
+template<typename T >
+ + + + +
int Array1D< T >::xsize_
+
+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classArray1D_3_01double_01_4-members.html b/docs/html/classArray1D_3_01double_01_4-members.html new file mode 100644 index 00000000..20fe2d0f --- /dev/null +++ b/docs/html/classArray1D_3_01double_01_4-members.html @@ -0,0 +1,105 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Array1D< double > Member List
+
+
+ +

This is the complete list of members for Array1D< double >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Array1D()Array1D< double >inline
Array1D(const int &nx)Array1D< double >inline
Array1D(const int &nx, const double &t)Array1D< double >inline
Array1D(const Array1D &obj)Array1D< double >inline
assign(const int x, const double val)Array1D< double >inline
Clear()Array1D< double >inline
data_Array1D< double >
DumpBinary(FILE *f_out) constArray1D< double >inline
DumpBinary(char *filename)Array1D< double >inline
DumpBinary4py(char *filename)Array1D< double >inline
erase(int ix)Array1D< double >inline
flatten()Array1D< double >inline
GetArrayPointer()Array1D< double >inline
GetConstArrayPointer() constArray1D< double >inline
getnpdblArray(double *outarray)Array1D< double >inline
insert(Array1D< double > &insarr, int ix)Array1D< double >inline
insert(const double &insval, int ix)Array1D< double >inline
Length() constArray1D< double >inline
operator()(int ix)Array1D< double >inline
operator()(int ix) constArray1D< double >inline
operator=(const Array1D &obj)Array1D< double >inline
operator[](int i)Array1D< double >inline
PushBack(const double &t)Array1D< double >inline
ReadBinary(FILE *f_in)Array1D< double >inline
ReadBinary(char *filename)Array1D< double >inline
ReadBinary4py(char *filename, int n)Array1D< double >inline
Resize(const int &nx)Array1D< double >inline
Resize(const int &nx, const double &t)Array1D< double >inline
setArray(vector< double > inarray)Array1D< double >inline
setnpdblArray(vector< double > inarray, int n)Array1D< double >inline
SetValue(const double &t)Array1D< double >inline
shape()Array1D< double >inline
type()Array1D< double >inline
XSize() constArray1D< double >inline
xsize_Array1D< double >private
~Array1D()Array1D< double >inline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classArray1D_3_01double_01_4.html b/docs/html/classArray1D_3_01double_01_4.html new file mode 100644 index 00000000..810bb16e --- /dev/null +++ b/docs/html/classArray1D_3_01double_01_4.html @@ -0,0 +1,1141 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Array1D< double > Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Public Attributes | +Private Attributes | +List of all members
+
Array1D< double > Class Reference
+
+
+ +

#include <Array1D.h>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Array1D ()
 Default constructor, which does not allocate any memory.
 
 Array1D (const int &nx)
 Constructor that allocates the memory.
 
 Array1D (const int &nx, const double &t)
 Constructor that allocates and initializes the data to a value t.
 
Array1D & operator= (const Array1D &obj)
 Assignment operator copies the data structure by value.
 
 Array1D (const Array1D &obj)
 Copy constructor.
 
 ~Array1D ()
 Destructor that frees up the memory.
 
void Clear ()
 Function to clear the memory.
 
int XSize () const
 Returns size in the x-direction.
 
int Length () const
 Returns length (i.e. size in the x-direction)
 
void Resize (const int &nx)
 Resizes the array.
 
void Resize (const int &nx, const double &t)
 Resizes the array and sets ALL entries to the specified value.
 
void SetValue (const double &t)
 Set all values in the array to the given value.
 
void PushBack (const double &t)
 Add element to the end of the vector.
 
double * GetArrayPointer ()
 Return a pointer to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).
 
const double * GetConstArrayPointer () const
 Return a const point to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).
 
double & operator() (int ix)
 
const double & operator() (int ix) const
 
void insert (Array1D< double > &insarr, int ix)
 Insert a given array to the position ix.
 
void insert (const double &insval, int ix)
 Insert a given value to the position ix.
 
void erase (int ix)
 Erase the value from the position ix.
 
void DumpBinary (FILE *f_out) const
 Dump contents of the array to a file in binary format.
 
void ReadBinary (FILE *f_in)
 Read contents of the array from a file in binary format.
 
double & operator[] (int i)
 
vector< int > shape ()
 
void assign (const int x, const double val)
 
void DumpBinary (char *filename)
 Dump contents of the array to a file in binary format.
 
void ReadBinary (char *filename)
 
void DumpBinary4py (char *filename)
 
void ReadBinary4py (char *filename, int n)
 
void setArray (vector< double > inarray)
 
void setnpdblArray (vector< double > inarray, int n)
 
void getnpdblArray (double *outarray)
 
vector< double > flatten ()
 
string type ()
 
+ + + +

+Public Attributes

vector< double > data_
 
+ + + +

+Private Attributes

int xsize_
 
+

Constructor & Destructor Documentation

+ +

◆ Array1D() [1/4]

+ +
+
+ + + + + +
+ + + + + + + +
Array1D< double >::Array1D ()
+ 		+inline
+
+ +

Default constructor, which does not allocate any memory.

+ +
+
+ +

◆ Array1D() [2/4]

+ +
+
+ + + + + +
+ + + + + + + +
Array1D< double >::Array1D (const int & nx)
+ 		+inline
+
+ +

Constructor that allocates the memory.

+ +
+
+ +

◆ Array1D() [3/4]

+ +
+
+ + + + + +
+ + + + + + + + + + + +
Array1D< double >::Array1D (const int & nx,
const double & t )
+ 		+inline
+
+ +

Constructor that allocates and initializes the data to a value t.

+ +
+
+ +

◆ Array1D() [4/4]

+ +
+
+ + + + + +
+ + + + + + + +
Array1D< double >::Array1D (const Array1D< double > & obj)
+ 		+inline
+
+ +

Copy constructor.

+ +
+
+ +

◆ ~Array1D()

+ +
+
+ + + + + +
+ + + + + + + +
Array1D< double >::~Array1D ()
+ 		+inline
+
+ +

Destructor that frees up the memory.

+ +
+
+

Member Function Documentation

+ +

◆ assign()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Array1D< double >::assign (const int x,
const double val )
+ 		+inline
+
+ +
+
+ +

◆ Clear()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< double >::Clear ()
+ 		+inline
+
+ +

Function to clear the memory.

+ +
+
+ +

◆ DumpBinary() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< double >::DumpBinary (char * filename)
+ 		+inline
+
+ +

Dump contents of the array to a file in binary format.

+ +
+
+ +

◆ DumpBinary() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< double >::DumpBinary (FILE * f_out) const
+ 		+inline
+
+ +

Dump contents of the array to a file in binary format.

+ +
+
+ +

◆ DumpBinary4py()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< double >::DumpBinary4py (char * filename)
+ 		+inline
+
+ +
+
+ +

◆ erase()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< double >::erase (int ix)
+ 		+inline
+
+ +

Erase the value from the position ix.

+ +
+
+ +

◆ flatten()

+ +
+
+ + + + + +
+ + + + + + + +
vector< double > Array1D< double >::flatten ()
+ 		+inline
+
+ +
+
+ +

◆ GetArrayPointer()

+ +
+
+ + + + + +
+ + + + + + + +
double * Array1D< double >::GetArrayPointer ()
+ 		+inline
+
+ +

Return a pointer to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).

+ +
+
+ +

◆ GetConstArrayPointer()

+ +
+
+ + + + + +
+ + + + + + + +
const double * Array1D< double >::GetConstArrayPointer () const
+ 		+inline
+
+ +

Return a const point to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).

+ +
+
+ +

◆ getnpdblArray()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< double >::getnpdblArray (double * outarray)
+ 		+inline
+
+ +
+
+ +

◆ insert() [1/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Array1D< double >::insert (Array1D< double > & insarr,
int ix )
+ 		+inline
+
+ +

Insert a given array to the position ix.

+
Note
ix=0 means insert at the beginning, ix=xsize_ means insert at the end
+ +
+
+ +

◆ insert() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Array1D< double >::insert (const double & insval,
int ix )
+ 		+inline
+
+ +

Insert a given value to the position ix.

+
Note
ix=0 means insert at the beginning, ix=xsize_ means insert at the end
+ +
+
+ +

◆ Length()

+ +
+
+ + + + + +
+ + + + + + + +
int Array1D< double >::Length () const
+ 		+inline
+
+ +

Returns length (i.e. size in the x-direction)

+ +
+
+ +

◆ operator()() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
double & Array1D< double >::operator() (int ix)
+ 		+inline
+
+ +
+
+ +

◆ operator()() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
const double & Array1D< double >::operator() (int ix) const
+ 		+inline
+
+ +
+
+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + +
Array1D & Array1D< double >::operator= (const Array1D< double > & obj)
+ 		+inline
+
+ +

Assignment operator copies the data structure by value.

+ +
+
+ +

◆ operator[]()

+ +
+
+ + + + + +
+ + + + + + + +
double & Array1D< double >::operator[] (int i)
+ 		+inline
+
+ +
+
+ +

◆ PushBack()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< double >::PushBack (const double & t)
+ 		+inline
+
+ +

Add element to the end of the vector.

+ +
+
+ +

◆ ReadBinary() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< double >::ReadBinary (char * filename)
+ 		+inline
+
+ +
+
+ +

◆ ReadBinary() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< double >::ReadBinary (FILE * f_in)
+ 		+inline
+
+ +

Read contents of the array from a file in binary format.

+ +
+
+ +

◆ ReadBinary4py()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Array1D< double >::ReadBinary4py (char * filename,
int n )
+ 		+inline
+
+ +
+
+ +

◆ Resize() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< double >::Resize (const int & nx)
+ 		+inline
+
+ +

Resizes the array.

+ +
+
+ +

◆ Resize() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Array1D< double >::Resize (const int & nx,
const double & t )
+ 		+inline
+
+ +

Resizes the array and sets ALL entries to the specified value.

+
Warning
All original data will get lost if this function is used!
+ +
+
+ +

◆ setArray()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< double >::setArray (vector< double > inarray)
+ 		+inline
+
+ +
+
+ +

◆ setnpdblArray()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Array1D< double >::setnpdblArray (vector< double > inarray,
int n )
+ 		+inline
+
+ +
+
+ +

◆ SetValue()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< double >::SetValue (const double & t)
+ 		+inline
+
+ +

Set all values in the array to the given value.

+ +
+
+ +

◆ shape()

+ +
+
+ + + + + +
+ + + + + + + +
vector< int > Array1D< double >::shape ()
+ 		+inline
+
+ +
+
+ +

◆ type()

+ +
+
+ + + + + +
+ + + + + + + +
string Array1D< double >::type ()
+ 		+inline
+
+ +
+
+ +

◆ XSize()

+ +
+
+ + + + + +
+ + + + + + + +
int Array1D< double >::XSize () const
+ 		+inline
+
+ +

Returns size in the x-direction.

+ +
+
+

Member Data Documentation

+ +

◆ data_

+ +
+
+ + + + +
vector<double> Array1D< double >::data_
+
+ +
+
+ +

◆ xsize_

+ +
+
+ + + + + +
+ + + + +
int Array1D< double >::xsize_
+ 		+private
+
+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classArray1D_3_01int_01_4-members.html b/docs/html/classArray1D_3_01int_01_4-members.html new file mode 100644 index 00000000..0188cb5f --- /dev/null +++ b/docs/html/classArray1D_3_01int_01_4-members.html @@ -0,0 +1,105 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Array1D< int > Member List
+
+
+ +

This is the complete list of members for Array1D< int >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Array1D()Array1D< int >inline
Array1D(const int &nx)Array1D< int >inline
Array1D(const int &nx, const int &t)Array1D< int >inline
Array1D(const Array1D &obj)Array1D< int >inline
assign(const int x, const int val)Array1D< int >inline
Clear()Array1D< int >inline
data_Array1D< int >
DumpBinary(FILE *f_out) constArray1D< int >inline
DumpBinary(char *filename)Array1D< int >inline
DumpBinary4py(char *filename)Array1D< int >inline
erase(int ix)Array1D< int >inline
flatten()Array1D< int >inline
GetArrayPointer()Array1D< int >inline
GetConstArrayPointer() constArray1D< int >inline
getnpintArray(long *outarray)Array1D< int >inline
insert(Array1D< int > &insarr, int ix)Array1D< int >inline
insert(const int &insval, int ix)Array1D< int >inline
Length() constArray1D< int >inline
operator()(int ix)Array1D< int >inline
operator()(int ix) constArray1D< int >inline
operator=(const Array1D &obj)Array1D< int >inline
operator[](int i)Array1D< int >inline
PushBack(const int &t)Array1D< int >inline
ReadBinary(FILE *f_in)Array1D< int >inline
ReadBinary(char *filename)Array1D< int >inline
ReadBinary4py(char *filename, int n)Array1D< int >inline
Resize(const int &nx)Array1D< int >inline
Resize(const int &nx, const int &t)Array1D< int >inline
setArray(vector< int > inarray)Array1D< int >inline
setnpintArray(vector< int > inarray, int n)Array1D< int >inline
SetValue(const int &t)Array1D< int >inline
shape()Array1D< int >inline
type()Array1D< int >inline
XSize() constArray1D< int >inline
xsize_Array1D< int >private
~Array1D()Array1D< int >inline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classArray1D_3_01int_01_4.html b/docs/html/classArray1D_3_01int_01_4.html new file mode 100644 index 00000000..a4ec493e --- /dev/null +++ b/docs/html/classArray1D_3_01int_01_4.html @@ -0,0 +1,1141 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Array1D< int > Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Public Attributes | +Private Attributes | +List of all members
+
Array1D< int > Class Reference
+
+
+ +

#include <Array1D.h>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Array1D ()
 Default constructor, which does not allocate any memory.
 
 Array1D (const int &nx)
 Constructor that allocates the memory.
 
 Array1D (const int &nx, const int &t)
 Constructor that allocates and initializes the data to a value t.
 
Array1D & operator= (const Array1D &obj)
 Assignment operator copies the data structure by value.
 
 Array1D (const Array1D &obj)
 Copy constructor.
 
 ~Array1D ()
 Destructor that frees up the memory.
 
void Clear ()
 Function to clear the memory.
 
int XSize () const
 Returns size in the x-direction.
 
int Length () const
 Returns length (i.e. size in the x-direction)
 
void Resize (const int &nx)
 Resizes the array.
 
void Resize (const int &nx, const int &t)
 Resizes the array and sets ALL entries to the specified value.
 
void SetValue (const int &t)
 Set all values in the array to the given value.
 
void PushBack (const int &t)
 Add element to the end of the vector.
 
int * GetArrayPointer ()
 Return a pointer to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).
 
const int * GetConstArrayPointer () const
 Return a const point to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).
 
int & operator() (int ix)
 
const int & operator() (int ix) const
 
void insert (Array1D< int > &insarr, int ix)
 Insert a given array to the position ix.
 
void insert (const int &insval, int ix)
 Insert a given value to the position ix.
 
void erase (int ix)
 Erase the value from the position ix.
 
void DumpBinary (FILE *f_out) const
 Dump contents of the array to a file in binary format.
 
void ReadBinary (FILE *f_in)
 Read contents of the array from a file in binary format.
 
int & operator[] (int i)
 
vector< int > shape ()
 
void assign (const int x, const int val)
 
void DumpBinary (char *filename)
 Dump contents of the array to a file in binary format.
 
void ReadBinary (char *filename)
 
void DumpBinary4py (char *filename)
 
void ReadBinary4py (char *filename, int n)
 
void setArray (vector< int > inarray)
 
void setnpintArray (vector< int > inarray, int n)
 
void getnpintArray (long *outarray)
 
vector< int > flatten ()
 
string type ()
 
+ + + +

+Public Attributes

vector< int > data_
 
+ + + +

+Private Attributes

int xsize_
 
+

Constructor & Destructor Documentation

+ +

◆ Array1D() [1/4]

+ +
+
+ + + + + +
+ + + + + + + +
Array1D< int >::Array1D ()
+ 		+inline
+
+ +

Default constructor, which does not allocate any memory.

+ +
+
+ +

◆ Array1D() [2/4]

+ +
+
+ + + + + +
+ + + + + + + +
Array1D< int >::Array1D (const int & nx)
+ 		+inline
+
+ +

Constructor that allocates the memory.

+ +
+
+ +

◆ Array1D() [3/4]

+ +
+
+ + + + + +
+ + + + + + + + + + + +
Array1D< int >::Array1D (const int & nx,
const int & t )
+ 		+inline
+
+ +

Constructor that allocates and initializes the data to a value t.

+ +
+
+ +

◆ Array1D() [4/4]

+ +
+
+ + + + + +
+ + + + + + + +
Array1D< int >::Array1D (const Array1D< int > & obj)
+ 		+inline
+
+ +

Copy constructor.

+ +
+
+ +

◆ ~Array1D()

+ +
+
+ + + + + +
+ + + + + + + +
Array1D< int >::~Array1D ()
+ 		+inline
+
+ +

Destructor that frees up the memory.

+ +
+
+

Member Function Documentation

+ +

◆ assign()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Array1D< int >::assign (const int x,
const int val )
+ 		+inline
+
+ +
+
+ +

◆ Clear()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< int >::Clear ()
+ 		+inline
+
+ +

Function to clear the memory.

+ +
+
+ +

◆ DumpBinary() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< int >::DumpBinary (char * filename)
+ 		+inline
+
+ +

Dump contents of the array to a file in binary format.

+ +
+
+ +

◆ DumpBinary() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< int >::DumpBinary (FILE * f_out) const
+ 		+inline
+
+ +

Dump contents of the array to a file in binary format.

+ +
+
+ +

◆ DumpBinary4py()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< int >::DumpBinary4py (char * filename)
+ 		+inline
+
+ +
+
+ +

◆ erase()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< int >::erase (int ix)
+ 		+inline
+
+ +

Erase the value from the position ix.

+ +
+
+ +

◆ flatten()

+ +
+
+ + + + + +
+ + + + + + + +
vector< int > Array1D< int >::flatten ()
+ 		+inline
+
+ +
+
+ +

◆ GetArrayPointer()

+ +
+
+ + + + + +
+ + + + + + + +
int * Array1D< int >::GetArrayPointer ()
+ 		+inline
+
+ +

Return a pointer to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).

+ +
+
+ +

◆ GetConstArrayPointer()

+ +
+
+ + + + + +
+ + + + + + + +
const int * Array1D< int >::GetConstArrayPointer () const
+ 		+inline
+
+ +

Return a const point to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).

+ +
+
+ +

◆ getnpintArray()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< int >::getnpintArray (long * outarray)
+ 		+inline
+
+ +
+
+ +

◆ insert() [1/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Array1D< int >::insert (Array1D< int > & insarr,
int ix )
+ 		+inline
+
+ +

Insert a given array to the position ix.

+
Note
ix=0 means insert at the beginning, ix=xsize_ means insert at the end
+ +
+
+ +

◆ insert() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Array1D< int >::insert (const int & insval,
int ix )
+ 		+inline
+
+ +

Insert a given value to the position ix.

+
Note
ix=0 means insert at the beginning, ix=xsize_ means insert at the end
+ +
+
+ +

◆ Length()

+ +
+
+ + + + + +
+ + + + + + + +
int Array1D< int >::Length () const
+ 		+inline
+
+ +

Returns length (i.e. size in the x-direction)

+ +
+
+ +

◆ operator()() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
int & Array1D< int >::operator() (int ix)
+ 		+inline
+
+ +
+
+ +

◆ operator()() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
const int & Array1D< int >::operator() (int ix) const
+ 		+inline
+
+ +
+
+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + +
Array1D & Array1D< int >::operator= (const Array1D< int > & obj)
+ 		+inline
+
+ +

Assignment operator copies the data structure by value.

+ +
+
+ +

◆ operator[]()

+ +
+
+ + + + + +
+ + + + + + + +
int & Array1D< int >::operator[] (int i)
+ 		+inline
+
+ +
+
+ +

◆ PushBack()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< int >::PushBack (const int & t)
+ 		+inline
+
+ +

Add element to the end of the vector.

+ +
+
+ +

◆ ReadBinary() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< int >::ReadBinary (char * filename)
+ 		+inline
+
+ +
+
+ +

◆ ReadBinary() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< int >::ReadBinary (FILE * f_in)
+ 		+inline
+
+ +

Read contents of the array from a file in binary format.

+ +
+
+ +

◆ ReadBinary4py()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Array1D< int >::ReadBinary4py (char * filename,
int n )
+ 		+inline
+
+ +
+
+ +

◆ Resize() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< int >::Resize (const int & nx)
+ 		+inline
+
+ +

Resizes the array.

+ +
+
+ +

◆ Resize() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Array1D< int >::Resize (const int & nx,
const int & t )
+ 		+inline
+
+ +

Resizes the array and sets ALL entries to the specified value.

+
Warning
All original data will get lost if this function is used!
+ +
+
+ +

◆ setArray()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< int >::setArray (vector< int > inarray)
+ 		+inline
+
+ +
+
+ +

◆ setnpintArray()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Array1D< int >::setnpintArray (vector< int > inarray,
int n )
+ 		+inline
+
+ +
+
+ +

◆ SetValue()

+ +
+
+ + + + + +
+ + + + + + + +
void Array1D< int >::SetValue (const int & t)
+ 		+inline
+
+ +

Set all values in the array to the given value.

+ +
+
+ +

◆ shape()

+ +
+
+ + + + + +
+ + + + + + + +
vector< int > Array1D< int >::shape ()
+ 		+inline
+
+ +
+
+ +

◆ type()

+ +
+
+ + + + + +
+ + + + + + + +
string Array1D< int >::type ()
+ 		+inline
+
+ +
+
+ +

◆ XSize()

+ +
+
+ + + + + +
+ + + + + + + +
int Array1D< int >::XSize () const
+ 		+inline
+
+ +

Returns size in the x-direction.

+ +
+
+

Member Data Documentation

+ +

◆ data_

+ +
+
+ + + + +
vector<int> Array1D< int >::data_
+
+ +
+
+ +

◆ xsize_

+ +
+
+ + + + + +
+ + + + +
int Array1D< int >::xsize_
+ 		+private
+
+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classArray2D-members.html b/docs/html/classArray2D-members.html new file mode 100644 index 00000000..fd4276a1 --- /dev/null +++ b/docs/html/classArray2D-members.html @@ -0,0 +1,113 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Array2D< T > Member List
+
+
+ +

This is the complete list of members for Array2D< T >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Array2D()Array2D< T >inline
Array2D(const int &nx, const int &ny)Array2D< T >inline
Array2D(const int &nx, const int &ny, const T &t)Array2D< T >inline
Array2D(const Array2D &obj)Array2D< T >inline
arraycopyArray2D< T >
assign(const int x, const int y, const T val)Array2D< T >inline
at(int ix, int iy)Array2D< T >inline
Clear()Array2D< T >inline
data_Array2D< T >
DumpBinary(FILE *f_out) constArray2D< T >inline
DumpBinary(char *filename)Array2D< T >inline
DumpBinary4py(char *filename)Array2D< T >inline
eraseCol(int iy)Array2D< T >inline
eraseRow(int ix)Array2D< T >inline
flatten()Array2D< T >inline
GetArrayPointer()Array2D< T >inline
GetConstArrayPointer() constArray2D< T >inline
getnpdblArray(double *outarray)Array2D< T >inline
getnpintArray(long *outarray)Array2D< T >inline
getRow(int row)Array2D< T >inline
insertCol(Array1D< T > &insarr, int iy)Array2D< T >inline
insertCol(Array2D< T > &insarr, int iy)Array2D< T >inline
insertRow(Array1D< T > &insarr, int ix)Array2D< T >inline
insertRow(Array2D< T > &insarr, int ix)Array2D< T >inline
operator()(int ix, int iy)Array2D< T >inline
operator()(int ix, int iy) constArray2D< T >inline
operator[](int ix)Array2D< T >inline
ReadBinary(FILE *f_in)Array2D< T >inline
ReadBinary(char *filename)Array2D< T >inline
ReadBinary4py(char *filename, int n1, int n2)Array2D< T >inline
Resize(const int &nx, const int &ny)Array2D< T >inline
Resize(const int &nx, const int &ny, const T &t)Array2D< T >inline
rowvecArray2D< T >
setArray(vector< T > inarray)Array2D< T >inline
setnpdblArray(double *inarray, int n1, int n2)Array2D< T >inline
setnpintArray(long *inarray, int n1, int n2)Array2D< T >inline
SetValue(const T &t)Array2D< T >inline
shape()Array2D< T >inline
type()Array2D< T >inline
XSize() constArray2D< T >inline
xsize_Array2D< T >
YSize() constArray2D< T >inline
ysize_Array2D< T >
~Array2D()Array2D< T >inline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classArray2D.html b/docs/html/classArray2D.html new file mode 100644 index 00000000..a2f8690a --- /dev/null +++ b/docs/html/classArray2D.html @@ -0,0 +1,1471 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Array2D< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Public Attributes | +List of all members
+
Array2D< T > Class Template Reference
+
+
+ +

Stores data of any type T in a 2D array. + More...

+ +

#include <Array2D.h>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Array2D ()
 Default constructor, which does not allocate any memory.
 
 Array2D (const int &nx, const int &ny)
 Constructor that allocates the memory.
 
 Array2D (const int &nx, const int &ny, const T &t)
 Constructor that allocates and initializes the data to a constant t.
 
 Array2D (const Array2D &obj)
 Copy constructor.
 
 ~Array2D ()
 Destructor that frees up the memory.
 
void Clear ()
 Function to clear the memory.
 
int XSize () const
 Returns size in the x-direction.
 
int YSize () const
 Returns size in the y-direction.
 
void Resize (const int &nx, const int &ny)
 Resizes the array.
 
void Resize (const int &nx, const int &ny, const T &t)
 Resizes the array and sets ALL entries to the specified value.
 
void SetValue (const T &t)
 Set all values in the array to the given value.
 
T * GetArrayPointer ()
 Return a pointer to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).
 
const T * GetConstArrayPointer () const
 Return a cont point to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).
 
T & operator() (int ix, int iy)
 C-like () operator to access values in the 2D data array.
 
const T & operator() (int ix, int iy) const
 
void insertRow (Array1D< T > &insarr, int ix)
 Insert array insarr as a row into position ix.
 
void insertRow (Array2D< T > &insarr, int ix)
 Insert a 2d-array insarr into a row position ix.
 
void eraseRow (int ix)
 Erase the row ix.
 
void insertCol (Array1D< T > &insarr, int iy)
 
void insertCol (Array2D< T > &insarr, int iy)
 Insert a 2d-array insarr into a column position iy.
 
void eraseCol (int iy)
 Erase the column iy.
 
void DumpBinary (FILE *f_out) const
 Dump contents of the array to a file in binary format.
 
void ReadBinary (FILE *f_in)
 Read contents of the array from a file in binary format.
 
Array1D< T > & operator[] (int ix)
 
vector< int > shape ()
 
void getRow (int row)
 
void DumpBinary (char *filename)
 
void ReadBinary (char *filename)
 
void DumpBinary4py (char *filename)
 
void ReadBinary4py (char *filename, int n1, int n2)
 
void setArray (vector< T > inarray)
 
void setnpdblArray (double *inarray, int n1, int n2)
 
void getnpdblArray (double *outarray)
 
void setnpintArray (long *inarray, int n1, int n2)
 
void getnpintArray (long *outarray)
 
T & at (int ix, int iy)
 
vector< T > flatten ()
 
string type ()
 
void assign (const int x, const int y, const T val)
 
+ + + + + + + + + + + +

+Public Attributes

int xsize_
 
int ysize_
 
vector< T > data_
 
Array1D< T > arraycopy
 
Array1D< T > rowvec
 
+

Detailed Description

+
template<typename T>
+class Array2D< T >

Stores data of any type T in a 2D array.

+

This class also provides a Fortran-like access operator () as well as a function to access the data in the array through a pointer that can be passed to F77 or C routines.

Author
Bert Debusschere bjdeb.nosp@m.us@s.nosp@m.andia.nosp@m..gov
+
Date
Jan 2005
+
Note
Inspired by Helgi Adalsteinsson's Array class implementation
+
Todo
Define copy constructor
+

Constructor & Destructor Documentation

+ +

◆ Array2D() [1/4]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
Array2D< T >::Array2D ()
+ 		+inline
+
+ +

Default constructor, which does not allocate any memory.

+ +
+
+ +

◆ Array2D() [2/4]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
Array2D< T >::Array2D (const int & nx,
const int & ny )
+ 		+inline
+
+ +

Constructor that allocates the memory.

+ +
+
+ +

◆ Array2D() [3/4]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + +
Array2D< T >::Array2D (const int & nx,
const int & ny,
const T & t )
+ 		+inline
+
+ +

Constructor that allocates and initializes the data to a constant t.

+ +
+
+ +

◆ Array2D() [4/4]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
Array2D< T >::Array2D (const Array2D< T > & obj)
+ 		+inline
+
+ +

Copy constructor.

+ +
+
+ +

◆ ~Array2D()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
Array2D< T >::~Array2D ()
+ 		+inline
+
+ +

Destructor that frees up the memory.

+ +
+
+

Member Function Documentation

+ +

◆ assign()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Array2D< T >::assign (const int x,
const int y,
const T val )
+ 		+inline
+
+ +
+
+ +

◆ at()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
T & Array2D< T >::at (int ix,
int iy )
+ 		+inline
+
+ +
+
+ +

◆ Clear()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::Clear ()
+ 		+inline
+
+ +

Function to clear the memory.

+ +
+
+ +

◆ DumpBinary() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::DumpBinary (char * filename)
+ 		+inline
+
+ +
+
+ +

◆ DumpBinary() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::DumpBinary (FILE * f_out) const
+ 		+inline
+
+ +

Dump contents of the array to a file in binary format.

+ +
+
+ +

◆ DumpBinary4py()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::DumpBinary4py (char * filename)
+ 		+inline
+
+ +
+
+ +

◆ eraseCol()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::eraseCol (int iy)
+ 		+inline
+
+ +

Erase the column iy.

+ +
+
+ +

◆ eraseRow()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::eraseRow (int ix)
+ 		+inline
+
+ +

Erase the row ix.

+ +
+
+ +

◆ flatten()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
vector< T > Array2D< T >::flatten ()
+ 		+inline
+
+ +
+
+ +

◆ GetArrayPointer()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T * Array2D< T >::GetArrayPointer ()
+ 		+inline
+
+ +

Return a pointer to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).

+ +
+
+ +

◆ GetConstArrayPointer()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
const T * Array2D< T >::GetConstArrayPointer () const
+ 		+inline
+
+ +

Return a cont point to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).

+ +
+
+ +

◆ getnpdblArray()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::getnpdblArray (double * outarray)
+ 		+inline
+
+ +
+
+ +

◆ getnpintArray()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::getnpintArray (long * outarray)
+ 		+inline
+
+ +
+
+ +

◆ getRow()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::getRow (int row)
+ 		+inline
+
+ +
+
+ +

◆ insertCol() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
void Array2D< T >::insertCol (Array1D< T > & insarr,
int iy )
+ 		+inline
+
+ +
+
+ +

◆ insertCol() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
void Array2D< T >::insertCol (Array2D< T > & insarr,
int iy )
+ 		+inline
+
+ +

Insert a 2d-array insarr into a column position iy.

+ +
+
+ +

◆ insertRow() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
void Array2D< T >::insertRow (Array1D< T > & insarr,
int ix )
+ 		+inline
+
+ +

Insert array insarr as a row into position ix.

+ +
+
+ +

◆ insertRow() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
void Array2D< T >::insertRow (Array2D< T > & insarr,
int ix )
+ 		+inline
+
+ +

Insert a 2d-array insarr into a row position ix.

+ +
+
+ +

◆ operator()() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
T & Array2D< T >::operator() (int ix,
int iy )
+ 		+inline
+
+ +

C-like () operator to access values in the 2D data array.

+ +
+
+ +

◆ operator()() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
const T & Array2D< T >::operator() (int ix,
int iy ) const
+ 		+inline
+
+ +
+
+ +

◆ operator[]()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
Array1D< T > & Array2D< T >::operator[] (int ix)
+ 		+inline
+
+ +
+
+ +

◆ ReadBinary() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::ReadBinary (char * filename)
+ 		+inline
+
+ +
+
+ +

◆ ReadBinary() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::ReadBinary (FILE * f_in)
+ 		+inline
+
+ +

Read contents of the array from a file in binary format.

+ +
+
+ +

◆ ReadBinary4py()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Array2D< T >::ReadBinary4py (char * filename,
int n1,
int n2 )
+ 		+inline
+
+ +
+
+ +

◆ Resize() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + +
void Array2D< T >::Resize (const int & nx,
const int & ny )
+ 		+inline
+
+ +

Resizes the array.

+
Warning
In its current implementation, most of the original data
+ +
+
+ +

◆ Resize() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Array2D< T >::Resize (const int & nx,
const int & ny,
const T & t )
+ 		+inline
+
+ +

Resizes the array and sets ALL entries to the specified value.

+
Warning
All original data will get lost if this function is used!
+ +
+
+ +

◆ setArray()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::setArray (vector< T > inarray)
+ 		+inline
+
+ +
+
+ +

◆ setnpdblArray()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Array2D< T >::setnpdblArray (double * inarray,
int n1,
int n2 )
+ 		+inline
+
+ +
+
+ +

◆ setnpintArray()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Array2D< T >::setnpintArray (long * inarray,
int n1,
int n2 )
+ 		+inline
+
+ +
+
+ +

◆ SetValue()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array2D< T >::SetValue (const T & t)
+ 		+inline
+
+ +

Set all values in the array to the given value.

+ +
+
+ +

◆ shape()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
vector< int > Array2D< T >::shape ()
+ 		+inline
+
+ +
+
+ +

◆ type()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
string Array2D< T >::type ()
+ 		+inline
+
+ +
+
+ +

◆ XSize()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
int Array2D< T >::XSize () const
+ 		+inline
+
+ +

Returns size in the x-direction.

+ +
+
+ +

◆ YSize()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
int Array2D< T >::YSize () const
+ 		+inline
+
+ +

Returns size in the y-direction.

+ +
+
+

Member Data Documentation

+ +

◆ arraycopy

+ +
+
+
+template<typename T >
+ + + + +
Array1D<T> Array2D< T >::arraycopy
+
+ +
+
+ +

◆ data_

+ +
+
+
+template<typename T >
+ + + + +
vector<T> Array2D< T >::data_
+
+ +
+
+ +

◆ rowvec

+ +
+
+
+template<typename T >
+ + + + +
Array1D<T> Array2D< T >::rowvec
+
+ +
+
+ +

◆ xsize_

+ +
+
+
+template<typename T >
+ + + + +
int Array2D< T >::xsize_
+
+ +
+
+ +

◆ ysize_

+ +
+
+
+template<typename T >
+ + + + +
int Array2D< T >::ysize_
+
+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classArray3D-members.html b/docs/html/classArray3D-members.html new file mode 100644 index 00000000..72204be2 --- /dev/null +++ b/docs/html/classArray3D-members.html @@ -0,0 +1,93 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Array3D< T > Member List
+
+
+ +

This is the complete list of members for Array3D< T >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + +
Array3D()Array3D< T >inline
Array3D(const size_t &nx, const size_t &ny, const size_t &nz)Array3D< T >inline
Array3D(const size_t &nx, const size_t &ny, const size_t &nz, const T &t)Array3D< T >inline
Array3D(const Array3D &obj)Array3D< T >inlineprivate
Clear()Array3D< T >inline
data_Array3D< T >private
DumpBinary(FILE *f_out) constArray3D< T >inline
DumpText(std::ofstream &f_out) constArray3D< T >inline
GetArrayPointer()Array3D< T >inline
GetConstArrayPointer() constArray3D< T >inline
operator()(size_t ix, size_t iy, size_t iz)Array3D< T >inline
operator()(size_t ix, size_t iy, size_t iz) constArray3D< T >inline
ReadBinary(std::ifstream &f_in)Array3D< T >inline
ReadText(FILE *f_in)Array3D< T >inline
Resize(const size_t &nx, const size_t &ny, const size_t &nz)Array3D< T >inline
Resize(const size_t &nx, const size_t &ny, const size_t &nz, const T &t)Array3D< T >inline
SetValue(const T &t)Array3D< T >inline
XSize() constArray3D< T >inline
xsize_Array3D< T >private
YSize() constArray3D< T >inline
ysize_Array3D< T >private
ZSize() constArray3D< T >inline
zsize_Array3D< T >private
~Array3D()Array3D< T >inline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classArray3D.html b/docs/html/classArray3D.html new file mode 100644 index 00000000..173dd9e3 --- /dev/null +++ b/docs/html/classArray3D.html @@ -0,0 +1,928 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Array3D< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Member Functions | +Private Attributes | +List of all members
+
Array3D< T > Class Template Reference
+
+
+ +

Stores data of any type T in a 3D array. + More...

+ +

#include <Array3D.h>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Array3D ()
 Default constructor, which does not allocate any memory.
 
 Array3D (const size_t &nx, const size_t &ny, const size_t &nz)
 Constructor that allocates the memory.
 
 Array3D (const size_t &nx, const size_t &ny, const size_t &nz, const T &t)
 Constructor that allocates and initializes the data.
 
 ~Array3D ()
 Destructor that frees up the memory.
 
void Clear ()
 Function to clear the memory.
 
size_t XSize () const
 Returns size in the x-direction.
 
size_t YSize () const
 Returns size in the y-direction.
 
size_t ZSize () const
 Returns size in the z-direction.
 
void Resize (const size_t &nx, const size_t &ny, const size_t &nz)
 Resizes the array.
 
void Resize (const size_t &nx, const size_t &ny, const size_t &nz, const T &t)
 Resizes the array and sets ALL entries to the specified value.
 
void SetValue (const T &t)
 Set all values in the array to the given value.
 
T * GetArrayPointer ()
 Return a pointer to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).
 
const T * GetConstArrayPointer () const
 Return a const pointer to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).
 
T & operator() (size_t ix, size_t iy, size_t iz)
 Fortran-like () operator to access values in the 3D data array.
 
const T & operator() (size_t ix, size_t iy, size_t iz) const
 Fortran-like () const operator to access values in the 3D data array.
 
void DumpBinary (FILE *f_out) const
 Dump contents of the array to a file in binary format.
 
void DumpText (std::ofstream &f_out) const
 Dump contents of the array to a file in text format Added by Maher Salloum When post-processing (in matlab for example), one has to transpose each 2-D sub-matrix imported from the text file.
 
void ReadText (FILE *f_in)
 Read contents of the array from a file in binary format.
 
void ReadBinary (std::ifstream &f_in)
 Read contents of the array from a file in text format Added by Maher Salloum.
 
+ + + + +

+Private Member Functions

 Array3D (const Array3D &obj)
 Copy constructor, which is made private so it would not be used inadvertently (until we define a proper copy constructor)
 
+ + + + + + + + + + + + + +

+Private Attributes

size_t xsize_
 Number of elements in the x-dimension.
 
size_t ysize_
 Number of elements in the y-dimension.
 
size_t zsize_
 Number of elements in the z-dimension.
 
vector< T > data_
 Data in the array with size = xsize_ * ysize_ * zsize_.
 
+

Detailed Description

+
template<typename T>
+class Array3D< T >

Stores data of any type T in a 3D array.

+

This class also provides a Fortran-like access operator () as well as a function to access the data in the array through a pointer that can be passed to F77 or C routines.

Author
Bert Debusschere bjdeb.nosp@m.us@s.nosp@m.andia.nosp@m..gov
+
Date
Jan 2005
+
Note
Inspired by Helgi Adalsteinsson's Array class implementation
+
Todo

Define copy constructor

+

Several functions, e.g. insert/erase columns/rows, available in Array1D and Array2D, are missing.

+
+

Constructor & Destructor Documentation

+ +

◆ Array3D() [1/4]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
Array3D< T >::Array3D ()
+ 		+inline
+
+ +

Default constructor, which does not allocate any memory.

+ +
+
+ +

◆ Array3D() [2/4]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + +
Array3D< T >::Array3D (const size_t & nx,
const size_t & ny,
const size_t & nz )
+ 		+inline
+
+ +

Constructor that allocates the memory.

+ +
+
+ +

◆ Array3D() [3/4]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + +
Array3D< T >::Array3D (const size_t & nx,
const size_t & ny,
const size_t & nz,
const T & t )
+ 		+inline
+
+ +

Constructor that allocates and initializes the data.

+ +
+
+ +

◆ ~Array3D()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
Array3D< T >::~Array3D ()
+ 		+inline
+
+ +

Destructor that frees up the memory.

+ +
+
+ +

◆ Array3D() [4/4]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
Array3D< T >::Array3D (const Array3D< T > & obj)
+ 		+inlineprivate
+
+ +

Copy constructor, which is made private so it would not be used inadvertently (until we define a proper copy constructor)

+ +
+
+

Member Function Documentation

+ +

◆ Clear()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array3D< T >::Clear ()
+ 		+inline
+
+ +

Function to clear the memory.

+ +
+
+ +

◆ DumpBinary()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array3D< T >::DumpBinary (FILE * f_out) const
+ 		+inline
+
+ +

Dump contents of the array to a file in binary format.

+ +
+
+ +

◆ DumpText()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array3D< T >::DumpText (std::ofstream & f_out) const
+ 		+inline
+
+ +

Dump contents of the array to a file in text format Added by Maher Salloum When post-processing (in matlab for example), one has to transpose each 2-D sub-matrix imported from the text file.

+ +
+
+ +

◆ GetArrayPointer()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
T * Array3D< T >::GetArrayPointer ()
+ 		+inline
+
+ +

Return a pointer to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).

+ +
+
+ +

◆ GetConstArrayPointer()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
const T * Array3D< T >::GetConstArrayPointer () const
+ 		+inline
+
+ +

Return a const pointer to the first element of the data in the vector so we can use it access the data in array format (e.g. for passing it to a Fortran program).

+ +
+
+ +

◆ operator()() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + +
T & Array3D< T >::operator() (size_t ix,
size_t iy,
size_t iz )
+ 		+inline
+
+ +

Fortran-like () operator to access values in the 3D data array.

+

If "my_data" is an object of type Array3D, then its array values can be accessed as my_data(ix,iy,iz), where ix, iy, iz are the indices in the x, y, and z dimensions respectively.

+ +
+
+ +

◆ operator()() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + +
const T & Array3D< T >::operator() (size_t ix,
size_t iy,
size_t iz ) const
+ 		+inline
+
+ +

Fortran-like () const operator to access values in the 3D data array.

+

If "my_data" is an object of type Array3D, then its array values can be accessed as my_data(ix,iy,iz), where ix, iy, iz are the indices in the x, y, and z dimensions respectively.

+ +
+
+ +

◆ ReadBinary()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array3D< T >::ReadBinary (std::ifstream & f_in)
+ 		+inline
+
+ +

Read contents of the array from a file in text format Added by Maher Salloum.

+ +
+
+ +

◆ ReadText()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array3D< T >::ReadText (FILE * f_in)
+ 		+inline
+
+ +

Read contents of the array from a file in binary format.

+ +
+
+ +

◆ Resize() [1/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Array3D< T >::Resize (const size_t & nx,
const size_t & ny,
const size_t & nz )
+ 		+inline
+
+ +

Resizes the array.

+
Warning
In its current implementation, most of the original data will get lost if the xsize or ysize changes as this changes the indexing for all entries.
+
Todo
Write a better implementation that preserves the original data by copying it to a temporary array and putting the elements back where they were before. This would bring this resize() command more closely in line with vector::resize() function in the original vector class.
+ +
+
+ +

◆ Resize() [2/2]

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + +
void Array3D< T >::Resize (const size_t & nx,
const size_t & ny,
const size_t & nz,
const T & t )
+ 		+inline
+
+ +

Resizes the array and sets ALL entries to the specified value.

+
Warning
All original data will get lost if this function is used!
+
Todo
Write an implementation that is more closely follows the resize command in the vector class, which keeps the original elements and only initializes the new elements.
+ +
+
+ +

◆ SetValue()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
void Array3D< T >::SetValue (const T & t)
+ 		+inline
+
+ +

Set all values in the array to the given value.

+ +
+
+ +

◆ XSize()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
size_t Array3D< T >::XSize () const
+ 		+inline
+
+ +

Returns size in the x-direction.

+ +
+
+ +

◆ YSize()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
size_t Array3D< T >::YSize () const
+ 		+inline
+
+ +

Returns size in the y-direction.

+ +
+
+ +

◆ ZSize()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
size_t Array3D< T >::ZSize () const
+ 		+inline
+
+ +

Returns size in the z-direction.

+ +
+
+

Member Data Documentation

+ +

◆ data_

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
vector<T> Array3D< T >::data_
+ 		+private
+
+ +

Data in the array with size = xsize_ * ysize_ * zsize_.

+

The data is stored with the fastest running index in the x-dimension then the y-dimension and the slowest one in the z-dimension. The indices in every dimension run from 0 to their respective "size-1"

+ +
+
+ +

◆ xsize_

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
size_t Array3D< T >::xsize_
+ 		+private
+
+ +

Number of elements in the x-dimension.

+ +
+
+ +

◆ ysize_

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
size_t Array3D< T >::ysize_
+ 		+private
+
+ +

Number of elements in the y-dimension.

+ +
+
+ +

◆ zsize_

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + +
size_t Array3D< T >::zsize_
+ 		+private
+
+ +

Number of elements in the z-dimension.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classDFI-members.html b/docs/html/classDFI-members.html new file mode 100644 index 00000000..31dc08af --- /dev/null +++ b/docs/html/classDFI-members.html @@ -0,0 +1,99 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
DFI Member List
+
+
+ +

This is the complete list of members for DFI, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
buildKDE(Array1D< int > KDEdim)DFI
buildSurrogateModel()DFI
dataChainAcceptanceRatioDFIprivate
dataChainNumSamplesDFIprivate
dataChainNumSamples_burninDFIprivate
dataChainPropCov_facDFIprivate
dataChainPropCov_initDFIprivate
dataChainPropCovMatrixDFIprivate
dataInference()DFI
dataPosteriorModeDFIprivate
dataPostInfoDFIprivate
dataRefit()DFI
dataScaleDFIprivate
defineConstraints(dataPosteriorInformation &dataPostInfo)DFIinlineprivate
defineData(dataPosteriorInformation &dataPostInfo)DFIinlineprivate
DFI()DFI
DFI(string inputfile)DFI
errorOptChainNumSamplesDFIprivate
genSamples(Array2D< double > &pdf)DFI
loadSurrogateModel()DFI
logFileDFIprivate
logFileNameDFIprivate
noisyDataDFIprivate
paramPostInfoDFIprivate
runModel(Array1D< double > &modelDataY, Array1D< double > &modelDataX, Array1D< double > &parameters, Array1D< double > &hyperparameters)DFIinlineprivate
seedDFIprivate
specifyNominalParams(dataPosteriorInformation &dataPostInfo)DFIinlineprivate
targetDataChainAcceptanceRatioDFIprivate
testSurrogateModel()DFI
~DFI()DFI
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classDFI.html b/docs/html/classDFI.html new file mode 100644 index 00000000..92ec2648 --- /dev/null +++ b/docs/html/classDFI.html @@ -0,0 +1,793 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: DFI Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Member Functions | +Private Attributes | +List of all members
+
DFI Class Reference
+
+
+ +

#include <dfi.h>

+ + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 DFI ()
 
 DFI (string inputfile)
 
 ~DFI ()
 
void dataInference ()
 
void dataRefit ()
 
void buildKDE (Array1D< int > KDEdim)
 
void genSamples (Array2D< double > &pdf)
 
void buildSurrogateModel ()
 
void loadSurrogateModel ()
 
void testSurrogateModel ()
 
+ + + + + + + + + +

+Private Member Functions

void defineData (dataPosteriorInformation &dataPostInfo)
 
void defineConstraints (dataPosteriorInformation &dataPostInfo)
 
void specifyNominalParams (dataPosteriorInformation &dataPostInfo)
 
void runModel (Array1D< double > &modelDataY, Array1D< double > &modelDataX, Array1D< double > &parameters, Array1D< double > &hyperparameters)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Attributes

int seed
 
dataPosteriorInformation dataPostInfo
 
parameterPosteriorInformation paramPostInfo
 
stringstream logFileName
 
ofstream logFile
 
Array1D< double > noisyData
 
double dataScale
 
int dataChainNumSamples
 
int dataChainNumSamples_burnin
 
double errorOptChainNumSamples
 
double targetDataChainAcceptanceRatio
 
double dataChainAcceptanceRatio
 
double dataPosteriorMode
 
double dataChainPropCov_init
 
double dataChainPropCov_fac
 
Array2D< double > dataChainPropCovMatrix
 
+

Constructor & Destructor Documentation

+ +

◆ DFI() [1/2]

+ +
+
+ + + + + + + +
DFI::DFI ()
+
+

set data dimension

+

set the seed

+ +
+
+ +

◆ DFI() [2/2]

+ +
+
+ + + + + + + +
DFI::DFI (string inputfile)
+
+

set data dimension

+

set data dimension

+

set the seed

+ +
+
+ +

◆ ~DFI()

+ +
+
+ + + + + + + +
DFI::~DFI ()
+
+ +
+
+

Member Function Documentation

+ +

◆ buildKDE()

+ +
+
+ + + + + + + +
void DFI::buildKDE (Array1D< int > KDEdim)
+
+ +
+
+ +

◆ buildSurrogateModel()

+ +
+
+ + + + + + + +
void DFI::buildSurrogateModel ()
+
+ +
+
+ +

◆ dataInference()

+ +
+
+ + + + + + + +
void DFI::dataInference ()
+
+

redefine initial MCMC proposal distribution covariance matrix to adjust the acceptance ratio

+ +
+
+ +

◆ dataRefit()

+ +
+
+ + + + + + + +
void DFI::dataRefit ()
+
+

set data dimension (as read from data chain file)

+ +
+
+ +

◆ defineConstraints()

+ +
+
+ + + + + +
+ + + + + + + +
void DFI::defineConstraints (dataPosteriorInformation & dataPostInfo)
+ 		+inlineprivate
+
+ +
+
+ +

◆ defineData()

+ +
+
+ + + + + +
+ + + + + + + +
void DFI::defineData (dataPosteriorInformation & dataPostInfo)
+ 		+inlineprivate
+
+ +
+
+ +

◆ genSamples()

+ +
+
+ + + + + + + +
void DFI::genSamples (Array2D< double > & pdf)
+
+ +
+
+ +

◆ loadSurrogateModel()

+ +
+
+ + + + + + + +
void DFI::loadSurrogateModel ()
+
+ +
+
+ +

◆ runModel()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + +
void DFI::runModel (Array1D< double > & modelDataY,
Array1D< double > & modelDataX,
Array1D< double > & parameters,
Array1D< double > & hyperparameters )
+ 		+inlineprivate
+
+ +
+
+ +

◆ specifyNominalParams()

+ +
+
+ + + + + +
+ + + + + + + +
void DFI::specifyNominalParams (dataPosteriorInformation & dataPostInfo)
+ 		+inlineprivate
+
+ +
+
+ +

◆ testSurrogateModel()

+ +
+
+ + + + + + + +
void DFI::testSurrogateModel ()
+
+ +
+
+

Member Data Documentation

+ +

◆ dataChainAcceptanceRatio

+ +
+
+ + + + + +
+ + + + +
double DFI::dataChainAcceptanceRatio
+ 		+private
+
+ +
+
+ +

◆ dataChainNumSamples

+ +
+
+ + + + + +
+ + + + +
int DFI::dataChainNumSamples
+ 		+private
+
+ +
+
+ +

◆ dataChainNumSamples_burnin

+ +
+
+ + + + + +
+ + + + +
int DFI::dataChainNumSamples_burnin
+ 		+private
+
+ +
+
+ +

◆ dataChainPropCov_fac

+ +
+
+ + + + + +
+ + + + +
double DFI::dataChainPropCov_fac
+ 		+private
+
+ +
+
+ +

◆ dataChainPropCov_init

+ +
+
+ + + + + +
+ + + + +
double DFI::dataChainPropCov_init
+ 		+private
+
+ +
+
+ +

◆ dataChainPropCovMatrix

+ +
+
+ + + + + +
+ + + + +
Array2D<double> DFI::dataChainPropCovMatrix
+ 		+private
+
+ +
+
+ +

◆ dataPosteriorMode

+ +
+
+ + + + + +
+ + + + +
double DFI::dataPosteriorMode
+ 		+private
+
+ +
+
+ +

◆ dataPostInfo

+ +
+
+ + + + + +
+ + + + +
dataPosteriorInformation DFI::dataPostInfo
+ 		+private
+
+ +
+
+ +

◆ dataScale

+ +
+
+ + + + + +
+ + + + +
double DFI::dataScale
+ 		+private
+
+ +
+
+ +

◆ errorOptChainNumSamples

+ +
+
+ + + + + +
+ + + + +
double DFI::errorOptChainNumSamples
+ 		+private
+
+ +
+
+ +

◆ logFile

+ +
+
+ + + + + +
+ + + + +
ofstream DFI::logFile
+ 		+private
+
+ +
+
+ +

◆ logFileName

+ +
+
+ + + + + +
+ + + + +
stringstream DFI::logFileName
+ 		+private
+
+ +
+
+ +

◆ noisyData

+ +
+
+ + + + + +
+ + + + +
Array1D<double> DFI::noisyData
+ 		+private
+
+ +
+
+ +

◆ paramPostInfo

+ +
+
+ + + + + +
+ + + + +
parameterPosteriorInformation DFI::paramPostInfo
+ 		+private
+
+ +
+
+ +

◆ seed

+ +
+
+ + + + + +
+ + + + +
int DFI::seed
+ 		+private
+
+ +
+
+ +

◆ targetDataChainAcceptanceRatio

+ +
+
+ + + + + +
+ + + + +
double DFI::targetDataChainAcceptanceRatio
+ 		+private
+
+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classDFIsurr-members.html b/docs/html/classDFIsurr-members.html new file mode 100644 index 00000000..7b3359f7 --- /dev/null +++ b/docs/html/classDFIsurr-members.html @@ -0,0 +1,78 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
DFIsurr Member List
+
+
+ +

This is the complete list of members for DFIsurr, including all inherited members.

+ + + + + + + + + + +
evaluateSurr(Array1D< double > &modelOutput, Array1D< double > &params)DFIsurr
numPCETermsDFIsurr
PCEcoefficientsDFIsurr
PCEdimDFIsurr
psiPCEDFIsurr
surrDefinedDFIsurr
surrHiDFIsurr
surrLoDFIsurr
surrModelDFIsurr
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classDFIsurr.html b/docs/html/classDFIsurr.html new file mode 100644 index 00000000..7fb39def --- /dev/null +++ b/docs/html/classDFIsurr.html @@ -0,0 +1,236 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: DFIsurr Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Public Attributes | +List of all members
+
DFIsurr Class Reference
+
+
+ +

#include <dfi.h>

+ + + + +

+Public Member Functions

void evaluateSurr (Array1D< double > &modelOutput, Array1D< double > &params)
 
+ + + + + + + + + + + + + + + + + +

+Public Attributes

int PCEdim
 
Array1D< double > surrLo
 
Array1D< double > surrHi
 
bool surrDefined
 
PCSet * surrModel
 
int numPCETerms
 
Array2D< double > PCEcoefficients
 
Array2D< double > psiPCE
 
+

Member Function Documentation

+ +

◆ evaluateSurr()

+ +
+
+ + + + + + + + + + + +
void DFIsurr::evaluateSurr (Array1D< double > & modelOutput,
Array1D< double > & params )
+
+ +
+
+

Member Data Documentation

+ +

◆ numPCETerms

+ +
+
+ + + + +
int DFIsurr::numPCETerms
+
+ +
+
+ +

◆ PCEcoefficients

+ +
+
+ + + + +
Array2D<double> DFIsurr::PCEcoefficients
+
+ +
+
+ +

◆ PCEdim

+ +
+
+ + + + +
int DFIsurr::PCEdim
+
+ +
+
+ +

◆ psiPCE

+ +
+
+ + + + +
Array2D<double> DFIsurr::psiPCE
+
+ +
+
+ +

◆ surrDefined

+ +
+
+ + + + +
bool DFIsurr::surrDefined
+
+ +
+
+ +

◆ surrHi

+ +
+
+ + + + +
Array1D<double> DFIsurr::surrHi
+
+ +
+
+ +

◆ surrLo

+ +
+
+ + + + +
Array1D<double> DFIsurr::surrLo
+
+ +
+
+ +

◆ surrModel

+ +
+
+ + + + +
PCSet* DFIsurr::surrModel
+
+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classGproc-members.html b/docs/html/classGproc-members.html new file mode 100644 index 00000000..50a89169 --- /dev/null +++ b/docs/html/classGproc-members.html @@ -0,0 +1,126 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Gproc Member List
+
+
+ +

This is the complete list of members for Gproc, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
A_Gprocprivate
Ainv_Gprocprivate
Ainvd_Gprocprivate
AinvH_Gprocprivate
AinvyHbhat_Gprocprivate
al_Gprocprivate
be_Gprocprivate
bhat_Gprocprivate
BuildGP()Gproc
BuildGP_inv()Gproc
computeDataCov_(Array2D< double > &xdata, Array1D< double > &param, Array2D< double > &A)Gprocprivate
cov_Gprocprivate
covariance(Array1D< double > &x1, Array1D< double > &x2, Array1D< double > &param)Gprocprivate
covType_Gprocprivate
dataVar_Gprocprivate
EvalGP(Array2D< double > &xgrid, string msc, Array1D< double > &mst)Gproc
EvalGP_inv(Array2D< double > &xgrid, string msc, Array1D< double > &mst)Gproc
findBestCorrParam()Gproc
getA(Array2D< double > &acor)Gprocinline
getAl() constGprocinline
getBe() constGprocinline
getCov(Array2D< double > &cov)Gprocinline
getNdim() constGprocinline
getNPC() constGprocinline
getNpt() constGprocinline
getParam(Array1D< double > &param)Gprocinline
getSig2hat() constGprocinline
getSttPars(Array1D< double > &sttmat)Gproc
getVar(Array1D< double > &var)Gprocinline
getVst(Array2D< double > &vst)Gprocinline
getXYCov(Array2D< double > &xgrid, Array2D< double > &xycov)Gproc
Gproc(const string covtype, PCSet *PCModel, Array1D< double > &param)Gproc
H_Gprocprivate
Hbhat_Gprocprivate
Ht_Gprocprivate
HtAinvd_Gprocprivate
HtAinvH_Gprocprivate
mst_Gprocprivate
ndim_Gprocprivate
npc_Gprocprivate
npt_Gprocprivate
param_Gprocprivate
PCModel_Gprocprivate
setCorrParam(Array1D< double > param)Gprocinline
SetupData(Array2D< double > &xdata, Array1D< double > &ydata, Array1D< double > &datavar)Gproc
SetupPrior()Gproc
sig2hat_Gprocprivate
var_Gprocprivate
Vinv_Gprocprivate
Vinvz_Gprocprivate
Vst_Gprocprivate
Vstinv_Gprocprivate
xdata_Gprocprivate
ydata_Gprocprivate
yHbhat_Gprocprivate
z_Gprocprivate
~Gproc()Gprocinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classGproc.html b/docs/html/classGproc.html new file mode 100644 index 00000000..d5846d2b --- /dev/null +++ b/docs/html/classGproc.html @@ -0,0 +1,1652 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Gproc Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Member Functions | +Private Attributes | +List of all members
+
Gproc Class Reference
+
+
+ +

Class for Gaussian processes. + More...

+ +

#include <gproc.h>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Gproc (const string covtype, PCSet *PCModel, Array1D< double > &param)
 Constructor: initialize with covariance type, trend function basis and roughness parameter vector.
 
 ~Gproc ()
 Destructor: cleans up all memory and destroys object.
 
void SetupPrior ()
 Setup the prior.
 
void SetupData (Array2D< double > &xdata, Array1D< double > &ydata, Array1D< double > &datavar)
 Setup the data.
 
void setCorrParam (Array1D< double > param)
 Set the roughness parameter vector.
 
void BuildGP ()
 Build Gaussian Process regressor, i.e. compute internally all necessary matrices and vectors that describe the posterior GP.
 
void BuildGP_inv ()
 Build Gaussian Process regressor, i.e. compute internally all necessary matrices and vectors that describe the posterior GP.
 
void EvalGP (Array2D< double > &xgrid, string msc, Array1D< double > &mst)
 Evaluate the Gaussian Process at a given grid msc controls whether only mean will be computed, or standard devation and covariance as well.
 
void EvalGP_inv (Array2D< double > &xgrid, string msc, Array1D< double > &mst)
 Evaluate the Gaussian Process at a given grid msc controls whether only mean will be computed, or standard devation and covariance as well.
 
int getNpt () const
 Get the number of data points.
 
int getNdim () const
 Get the dimensionality.
 
int getNPC () const
 Get the number of basis terms in the trend.
 
double getAl () const
 Get alpha parameter.
 
double getBe () const
 Get beta parameter.
 
double getSig2hat () const
 Get Sigma-hat-squared, i.e. the posterior variance factor.
 
void getVst (Array2D< double > &vst)
 Get $V^*$, an auxiliary matrix.
 
void getA (Array2D< double > &acor)
 Get the correlation matrix $A$.
 
void getParam (Array1D< double > &param)
 Get the roughness parameters.
 
void getCov (Array2D< double > &cov)
 Get the posterior covariance matrix.
 
void getVar (Array1D< double > &var)
 Get the posterior variance vector.
 
void getXYCov (Array2D< double > &xgrid, Array2D< double > &xycov)
 Get the covariance in a different format, with the x,x' values.
 
void getSttPars (Array1D< double > &sttmat)
 Get the Student-t parameters.
 
void findBestCorrParam ()
 Function to find the best values for roughness parameters.
 
+ + + + + + + +

+Private Member Functions

double covariance (Array1D< double > &x1, Array1D< double > &x2, Array1D< double > &param)
 Prior covariance function.
 
void computeDataCov_ (Array2D< double > &xdata, Array1D< double > &param, Array2D< double > &A)
 Compute the data covariance $A$.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Attributes

Array2D< double > xdata_
 xdata array
 
Array1D< double > ydata_
 ydata array
 
Array1D< double > dataVar_
 Data noise 'nugget'.
 
int npc_
 Number of bases in the mean trend.
 
Array2D< double > Vinv_
 Inverse of the mean trend coefficient prior covariance.
 
Array1D< double > z_
 Prior mean of the mean trend.
 
double al_
 Prior parameter $\alpha$.
 
double be_
 Prior parameter $\beta$.
 
double sig2hat_
 Posterior variance factor.
 
int npt_
 Number of data points.
 
int ndim_
 Dimensionality.
 
string covType_
 Covariance type, only 'SqExp' implemented so far.
 
PCSet * PCModel_
 Basis set for the trend function.
 
Array1D< double > mst_
 Mean of the Student-t posterior.
 
Array1D< double > var_
 Variance of the Student-t posterior.
 
Array2D< double > cov_
 Covariance of the Student-t posterior.
 
Array1D< double > param_
 Roughness parameter vector.
 
Array2D< double > H_
 Auxiliary matrices or vectors, see the UQTk Manual.
 
Array2D< double > Ht_
 
Array2D< double > A_
 
Array2D< double > Ainv_
 
Array1D< double > Ainvd_
 
Array1D< double > Vinvz_
 
Array1D< double > HtAinvd_
 
Array2D< double > AinvH_
 
Array2D< double > HtAinvH_
 
Array2D< double > Vst_
 
Array1D< double > bhat_
 
Array1D< double > Hbhat_
 
Array1D< double > yHbhat_
 
Array1D< double > AinvyHbhat_
 
Array2D< double > Vstinv_
 
+

Detailed Description

+

Class for Gaussian processes.

+

Constructor & Destructor Documentation

+ +

◆ Gproc()

+ +
+
+ + + + + + + + + + + + + + + + +
Gproc::Gproc (const string covtype,
PCSet * PCModel,
Array1D< double > & param )
+
+ +

Constructor: initialize with covariance type, trend function basis and roughness parameter vector.

+ +
+
+ +

◆ ~Gproc()

+ +
+
+ + + + + +
+ + + + + + + +
Gproc::~Gproc ()
+ 		+inline
+
+ +

Destructor: cleans up all memory and destroys object.

+ +
+
+

Member Function Documentation

+ +

◆ BuildGP()

+ +
+
+ + + + + + + +
void Gproc::BuildGP ()
+
+ +

Build Gaussian Process regressor, i.e. compute internally all necessary matrices and vectors that describe the posterior GP.

+ +
+
+ +

◆ BuildGP_inv()

+ +
+
+ + + + + + + +
void Gproc::BuildGP_inv ()
+
+ +

Build Gaussian Process regressor, i.e. compute internally all necessary matrices and vectors that describe the posterior GP.

+
Note
This is an older implementation with explicit inversion of measurement matrix
+
Todo
Need formal timing analysis to understand in which situations this version is preferred
+ +
+
+ +

◆ computeDataCov_()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Gproc::computeDataCov_ (Array2D< double > & xdata,
Array1D< double > & param,
Array2D< double > & A )
+ 		+private
+
+ +

Compute the data covariance $A$.

+ +
+
+ +

◆ covariance()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
double Gproc::covariance (Array1D< double > & x1,
Array1D< double > & x2,
Array1D< double > & param )
+ 		+private
+
+ +

Prior covariance function.

+
Todo
put an 'if' check for covtype_
+ +
+
+ +

◆ EvalGP()

+ +
+
+ + + + + + + + + + + + + + + + +
void Gproc::EvalGP (Array2D< double > & xgrid,
string msc,
Array1D< double > & mst )
+
+ +

Evaluate the Gaussian Process at a given grid msc controls whether only mean will be computed, or standard devation and covariance as well.

+ +
+
+ +

◆ EvalGP_inv()

+ +
+
+ + + + + + + + + + + + + + + + +
void Gproc::EvalGP_inv (Array2D< double > & xgrid,
string msc,
Array1D< double > & mst )
+
+ +

Evaluate the Gaussian Process at a given grid msc controls whether only mean will be computed, or standard devation and covariance as well.

+
Note
This is an older implementation with explicit inversion of measurement matrix
+
Todo
Need formal timing analysis to understand in which situations this version is preferred
+ +
+
+ +

◆ findBestCorrParam()

+ +
+
+ + + + + + + +
void Gproc::findBestCorrParam ()
+
+ +

Function to find the best values for roughness parameters.

+ +
+
+ +

◆ getA()

+ +
+
+ + + + + +
+ + + + + + + +
void Gproc::getA (Array2D< double > & acor)
+ 		+inline
+
+ +

Get the correlation matrix $A$.

+ +
+
+ +

◆ getAl()

+ +
+
+ + + + + +
+ + + + + + + +
double Gproc::getAl () const
+ 		+inline
+
+ +

Get alpha parameter.

+ +
+
+ +

◆ getBe()

+ +
+
+ + + + + +
+ + + + + + + +
double Gproc::getBe () const
+ 		+inline
+
+ +

Get beta parameter.

+ +
+
+ +

◆ getCov()

+ +
+
+ + + + + +
+ + + + + + + +
void Gproc::getCov (Array2D< double > & cov)
+ 		+inline
+
+ +

Get the posterior covariance matrix.

+ +
+
+ +

◆ getNdim()

+ +
+
+ + + + + +
+ + + + + + + +
int Gproc::getNdim () const
+ 		+inline
+
+ +

Get the dimensionality.

+ +
+
+ +

◆ getNPC()

+ +
+
+ + + + + +
+ + + + + + + +
int Gproc::getNPC () const
+ 		+inline
+
+ +

Get the number of basis terms in the trend.

+ +
+
+ +

◆ getNpt()

+ +
+
+ + + + + +
+ + + + + + + +
int Gproc::getNpt () const
+ 		+inline
+
+ +

Get the number of data points.

+ +
+
+ +

◆ getParam()

+ +
+
+ + + + + +
+ + + + + + + +
void Gproc::getParam (Array1D< double > & param)
+ 		+inline
+
+ +

Get the roughness parameters.

+ +
+
+ +

◆ getSig2hat()

+ +
+
+ + + + + +
+ + + + + + + +
double Gproc::getSig2hat () const
+ 		+inline
+
+ +

Get Sigma-hat-squared, i.e. the posterior variance factor.

+ +
+
+ +

◆ getSttPars()

+ +
+
+ + + + + + + +
void Gproc::getSttPars (Array1D< double > & sttmat)
+
+ +

Get the Student-t parameters.

+
Todo
check that full cov_ already defined(i.e. msc) not just diagonal
+ +
+
+ +

◆ getVar()

+ +
+
+ + + + + +
+ + + + + + + +
void Gproc::getVar (Array1D< double > & var)
+ 		+inline
+
+ +

Get the posterior variance vector.

+ +
+
+ +

◆ getVst()

+ +
+
+ + + + + +
+ + + + + + + +
void Gproc::getVst (Array2D< double > & vst)
+ 		+inline
+
+ +

Get $V^*$, an auxiliary matrix.

+ +
+
+ +

◆ getXYCov()

+ +
+
+ + + + + + + + + + + +
void Gproc::getXYCov (Array2D< double > & xgrid,
Array2D< double > & xycov )
+
+ +

Get the covariance in a different format, with the x,x' values.

+
Todo
check that full cov_ already defined(i.e. msc) not just diagonal
+ +
+
+ +

◆ setCorrParam()

+ +
+
+ + + + + +
+ + + + + + + +
void Gproc::setCorrParam (Array1D< double > param)
+ 		+inline
+
+ +

Set the roughness parameter vector.

+ +
+
+ +

◆ SetupData()

+ +
+
+ + + + + + + + + + + + + + + + +
void Gproc::SetupData (Array2D< double > & xdata,
Array1D< double > & ydata,
Array1D< double > & datavar )
+
+ +

Setup the data.

+ +
+
+ +

◆ SetupPrior()

+ +
+
+ + + + + + + +
void Gproc::SetupPrior ()
+
+ +

Setup the prior.

+ +
+
+

Member Data Documentation

+ +

◆ A_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Gproc::A_
+ 		+private
+
+ +
+
+ +

◆ Ainv_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Gproc::Ainv_
+ 		+private
+
+ +
+
+ +

◆ Ainvd_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::Ainvd_
+ 		+private
+
+ +
+
+ +

◆ AinvH_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Gproc::AinvH_
+ 		+private
+
+ +
+
+ +

◆ AinvyHbhat_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::AinvyHbhat_
+ 		+private
+
+ +
+
+ +

◆ al_

+ +
+
+ + + + + +
+ + + + +
double Gproc::al_
+ 		+private
+
+ +

Prior parameter $\alpha$.

+ +
+
+ +

◆ be_

+ +
+
+ + + + + +
+ + + + +
double Gproc::be_
+ 		+private
+
+ +

Prior parameter $\beta$.

+ +
+
+ +

◆ bhat_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::bhat_
+ 		+private
+
+ +
+
+ +

◆ cov_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Gproc::cov_
+ 		+private
+
+ +

Covariance of the Student-t posterior.

+ +
+
+ +

◆ covType_

+ +
+
+ + + + + +
+ + + + +
string Gproc::covType_
+ 		+private
+
+ +

Covariance type, only 'SqExp' implemented so far.

+ +
+
+ +

◆ dataVar_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::dataVar_
+ 		+private
+
+ +

Data noise 'nugget'.

+ +
+
+ +

◆ H_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Gproc::H_
+ 		+private
+
+ +

Auxiliary matrices or vectors, see the UQTk Manual.

+ +
+
+ +

◆ Hbhat_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::Hbhat_
+ 		+private
+
+ +
+
+ +

◆ Ht_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Gproc::Ht_
+ 		+private
+
+ +
+
+ +

◆ HtAinvd_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::HtAinvd_
+ 		+private
+
+ +
+
+ +

◆ HtAinvH_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Gproc::HtAinvH_
+ 		+private
+
+ +
+
+ +

◆ mst_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::mst_
+ 		+private
+
+ +

Mean of the Student-t posterior.

+ +
+
+ +

◆ ndim_

+ +
+
+ + + + + +
+ + + + +
int Gproc::ndim_
+ 		+private
+
+ +

Dimensionality.

+ +
+
+ +

◆ npc_

+ +
+
+ + + + + +
+ + + + +
int Gproc::npc_
+ 		+private
+
+ +

Number of bases in the mean trend.

+ +
+
+ +

◆ npt_

+ +
+
+ + + + + +
+ + + + +
int Gproc::npt_
+ 		+private
+
+ +

Number of data points.

+ +
+
+ +

◆ param_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::param_
+ 		+private
+
+ +

Roughness parameter vector.

+ +
+
+ +

◆ PCModel_

+ +
+
+ + + + + +
+ + + + +
PCSet* Gproc::PCModel_
+ 		+private
+
+ +

Basis set for the trend function.

+ +
+
+ +

◆ sig2hat_

+ +
+
+ + + + + +
+ + + + +
double Gproc::sig2hat_
+ 		+private
+
+ +

Posterior variance factor.

+ +
+
+ +

◆ var_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::var_
+ 		+private
+
+ +

Variance of the Student-t posterior.

+ +
+
+ +

◆ Vinv_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Gproc::Vinv_
+ 		+private
+
+ +

Inverse of the mean trend coefficient prior covariance.

+ +
+
+ +

◆ Vinvz_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::Vinvz_
+ 		+private
+
+ +
+
+ +

◆ Vst_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Gproc::Vst_
+ 		+private
+
+ +
+
+ +

◆ Vstinv_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Gproc::Vstinv_
+ 		+private
+
+ +
+
+ +

◆ xdata_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Gproc::xdata_
+ 		+private
+
+ +

xdata array

+ +
+
+ +

◆ ydata_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::ydata_
+ 		+private
+
+ +

ydata array

+ +
+
+ +

◆ yHbhat_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::yHbhat_
+ 		+private
+
+ +
+
+ +

◆ z_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Gproc::z_
+ 		+private
+
+ +

Prior mean of the mean trend.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classKLDecompUni-members.html b/docs/html/classKLDecompUni-members.html new file mode 100644 index 00000000..46efd75e --- /dev/null +++ b/docs/html/classKLDecompUni-members.html @@ -0,0 +1,101 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
KLDecompUni Member List
+
+
+ +

This is the complete list of members for KLDecompUni, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
absTol_KLDecompUniprivate
decompose(const Array2D< double > &corr, const int &nKL)KLDecompUni
decompose(const double *corr, const int &nKL)KLDecompUni
decomposed_KLDecompUniprivate
eig_info_KLDecompUniprivate
eig_values_KLDecompUniprivate
eigenvalues() constKLDecompUni
eigenvalues(const int nEIG, double *eigs) constKLDecompUni
eigRange_KLDecompUniprivate
ifail_KLDecompUniprivate
il_KLDecompUniprivate
Init()KLDecompUni
iu_KLDecompUniprivate
jobz_KLDecompUniprivate
KL_modes_KLDecompUniprivate
KLDecompUni(const Array1D< double > &tSamples)KLDecompUni
KLDecompUni()KLDecompUni
KLDecompUni(const KLDecompUni &)KLDecompUniinlineprivate
KLmodes() constKLDecompUni
KLmodes(const int npts, const int nKL, double *klModes) constKLDecompUni
KLproject(const Array2D< double > &realiz, Array2D< double > &xi)KLDecompUni
meanRealiz(const Array2D< double > &realiz, Array1D< double > &mean_realiz)KLDecompUni
SetWeights(const Array1D< double > &weights)KLDecompUni
SetWeights(const double *weights, const int npts)KLDecompUni
truncRealiz(const Array1D< double > &meanrea, const Array2D< double > &xi, const int &nKL, Array2D< double > &trunc_realiz)KLDecompUni
uplo_KLDecompUniprivate
vl_KLDecompUniprivate
vu_KLDecompUniprivate
w_KLDecompUniprivate
wh_KLDecompUniprivate
whcwh_KLDecompUniprivate
~KLDecompUni()KLDecompUniinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classKLDecompUni.html b/docs/html/classKLDecompUni.html new file mode 100644 index 00000000..e04de8fd --- /dev/null +++ b/docs/html/classKLDecompUni.html @@ -0,0 +1,966 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: KLDecompUni Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Member Functions | +Private Attributes | +List of all members
+
KLDecompUni Class Reference
+
+
+ +

Computes the Karhunen-Loeve decomposition of a univariate stochastic process. + More...

+ +

#include <kle.h>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 KLDecompUni (const Array1D< double > &tSamples)
 Constructor that takes the autocorrelation matrix "corr" ( $C$) of the process we are studying as well as the array "tsamples" ( $t$) with the points in time where snapshots of the system were taken.
 
 KLDecompUni ()
 
 ~KLDecompUni ()
 Destructor.
 
void Init ()
 
void SetWeights (const Array1D< double > &weights)
 Set weights for computing the integral needed for Nystrom's method for solving the Fredholm integral equation.
 
void SetWeights (const double *weights, const int npts)
 Set weights for computing the integral needed for Nystrom's method for solving the Fredholm integral equation.
 
int decompose (const Array2D< double > &corr, const int &nKL)
 Perform KL decomposition into nKL modes and return actual number of modes that were obtained.
 
int decompose (const double *corr, const int &nKL)
 Perform KL decomposition into nKL modes and return actual number of modes that were obtained.
 
void KLproject (const Array2D< double > &realiz, Array2D< double > &xi)
 Project realizations $F(t,\theta_l)$ to the KL modes and store them in xi ( $\xi_k$)
 
const Array1D< double > & eigenvalues () const
 Get eigenvalues in descending order.
 
void eigenvalues (const int nEIG, double *eigs) const
 
const Array2D< double > & KLmodes () const
 Get associated KL modes.
 
void KLmodes (const int npts, const int nKL, double *klModes) const
 Get associated KL modes.
 
void meanRealiz (const Array2D< double > &realiz, Array1D< double > &mean_realiz)
 Calculate (in meanRealiz) the mean realizations.
 
void truncRealiz (const Array1D< double > &meanrea, const Array2D< double > &xi, const int &nKL, Array2D< double > &trunc_realiz)
 Returns the truncated KL sum.
 
+ + + + +

+Private Member Functions

 KLDecompUni (const KLDecompUni &)
 Dummy default constructor, which should not be used as it is not well defined.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Attributes

bool decomposed_
 Flag to determine whether KL decomposition has taken place (and consequently that the interal data structures contain meaningful eigenvalues and vectors ... )
 
Array2D< double > whcwh_
 Matrix to hold the upper triangular part of the matrix to get eigenvalues of.
 
Array1D< double > w_
 Array to hold weights for Nystrom's method for Fredholm integral equation solution.
 
Array1D< double > wh_
 Array to hold square roots of weights.
 
char jobz_
 Option to determine what to compute (eigenvalues and eigenvectors)
 
char eigRange_
 Option to set the type of range for eigenvalues.
 
char uplo_
 Option to indicate how matrix is stored.
 
double vl_
 Lower bound for range of eigenvalues.
 
double vu_
 Upper bound for range of eigenvalues.
 
int il_
 Lower index of range of eigenvalues requested.
 
int iu_
 Upper index of range of eigenvalues requested.
 
double absTol_
 Absolute tolerance for convergence.
 
Array1D< double > eig_values_
 Array to store eigenvalues.
 
Array2D< double > KL_modes_
 Matrix to store KL modes.
 
int eig_info_
 info on success of the eigenvector solutions
 
Array1D< int > ifail_
 Array to store indices of eigenvectors that failed to converge.
 
+

Detailed Description

+

Computes the Karhunen-Loeve decomposition of a univariate stochastic process.

+

+\[ +F(t,\theta) = \left < F(t,\theta) \right >_{\theta} + + \sum_{k=1}^{\infty} \sqrt{\lambda_k} f_k(t) \xi_k\] +

+

Constructor & Destructor Documentation

+ +

◆ KLDecompUni() [1/3]

+ +
+
+ + + + + + + +
KLDecompUni::KLDecompUni (const Array1D< double > & tSamples)
+
+ +

Constructor that takes the autocorrelation matrix "corr" ( $C$) of the process we are studying as well as the array "tsamples" ( $t$) with the points in time where snapshots of the system were taken.

+

Constructs weights ( $w$) needed for the Nystrom method to solve the Fredholm integral equation

+\[ \int C(s,t)f(t)dt=\lambda f(s) \rightarrow \sum w_j C(s_i,t_j) f_k(t_j) = \lambda_k f_k(s_i)\] +

+ +
+
+ +

◆ KLDecompUni() [2/3]

+ +
+
+ + + + + + + +
KLDecompUni::KLDecompUni ()
+
+ +
+
+ +

◆ ~KLDecompUni()

+ +
+
+ + + + + +
+ + + + + + + +
KLDecompUni::~KLDecompUni ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+ +

◆ KLDecompUni() [3/3]

+ +
+
+ + + + + +
+ + + + + + + +
KLDecompUni::KLDecompUni (const KLDecompUni & )
+ 		+inlineprivate
+
+ +

Dummy default constructor, which should not be used as it is not well defined.

+

Dummy copy constructor, which should not be used as it is currently not well defined

+ +
+
+

Member Function Documentation

+ +

◆ decompose() [1/2]

+ +
+
+ + + + + + + + + + + +
int KLDecompUni::decompose (const Array2D< double > & corr,
const int & nKL )
+
+ +

Perform KL decomposition into nKL modes and return actual number of modes that were obtained.

+

Further manipulation of the discretized Fredholm equation leads to the eigenvalue problem

+\[A g=\lambda g \] +

+

where $A=W K W$ and $g=Wf$, with $W$ being the diagonal matrix, $W_{ii}=\sqrt{w_i}$ and $K_{ij}=Cov(t_i,t_j)$. Solutions consist of pairs of eigenvalues $\lambda_k$ and KL modes $f_k=W^{-1}g_k$.

+ +
+
+ +

◆ decompose() [2/2]

+ +
+
+ + + + + + + + + + + +
int KLDecompUni::decompose (const double * corr,
const int & nKL )
+
+ +

Perform KL decomposition into nKL modes and return actual number of modes that were obtained.

+

Further manipulation of the discretized Fredholm equation leads to the eigenvalue problem

+\[A g=\lambda g \] +

+

where $A=W K W$ and $g=Wf$, with $W$ being the diagonal matrix, $W_{ii}=\sqrt{w_i}$ and $K_{ij}=Cov(t_i,t_j)$. Solutions consist of pairs of eigenvalues $\lambda_k$ and KL modes $f_k=W^{-1}g_k$.

+ +
+
+ +

◆ eigenvalues() [1/2]

+ +
+
+ + + + + + + +
const Array1D< double > & KLDecompUni::eigenvalues () const
+
+ +

Get eigenvalues in descending order.

+ +
+
+ +

◆ eigenvalues() [2/2]

+ +
+
+ + + + + + + + + + + +
void KLDecompUni::eigenvalues (const int nEIG,
double * eigs ) const
+
+ +
+
+ +

◆ Init()

+ +
+
+ + + + + + + +
void KLDecompUni::Init ()
+
+ +
+
+ +

◆ KLmodes() [1/2]

+ +
+
+ + + + + + + +
const Array2D< double > & KLDecompUni::KLmodes () const
+
+ +

Get associated KL modes.

+ +
+
+ +

◆ KLmodes() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void KLDecompUni::KLmodes (const int npts,
const int nKL,
double * klModes ) const
+
+ +

Get associated KL modes.

+ +
+
+ +

◆ KLproject()

+ +
+
+ + + + + + + + + + + +
void KLDecompUni::KLproject (const Array2D< double > & realiz,
Array2D< double > & xi )
+
+ +

Project realizations $F(t,\theta_l)$ to the KL modes and store them in xi ( $\xi_k$)

+

Samples of random variables $\xi_k$ are obtained by projecting realizations of the random process $F$ on the eigenmodes $f_k$

+\[ \left.\xi_k\right\vert_{\theta_l}=\left <F(t,\theta_l)-\left < + F(t,\theta) \right >_{\theta}, f_k(t) \right >_t/\sqrt{\lambda_k} \] +

+

... or numerically

+\[ +\left.\xi_k\right\vert_{\theta_l}=\sum_{i=1}^{N_p} w_i\left(F(t_i,\theta_l)-\left < + F(t_i,\theta) \right >_{\theta} \right) f_k(t_i)/\sqrt{\lambda_k} \] +

+ +
+
+ +

◆ meanRealiz()

+ +
+
+ + + + + + + + + + + +
void KLDecompUni::meanRealiz (const Array2D< double > & realiz,
Array1D< double > & mean_realiz )
+
+ +

Calculate (in meanRealiz) the mean realizations.

+ +
+
+ +

◆ SetWeights() [1/2]

+ +
+
+ + + + + + + +
void KLDecompUni::SetWeights (const Array1D< double > & weights)
+
+ +

Set weights for computing the integral needed for Nystrom's method for solving the Fredholm integral equation.

+ +
+
+ +

◆ SetWeights() [2/2]

+ +
+
+ + + + + + + + + + + +
void KLDecompUni::SetWeights (const double * weights,
const int npts )
+
+ +

Set weights for computing the integral needed for Nystrom's method for solving the Fredholm integral equation.

+ +
+
+ +

◆ truncRealiz()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void KLDecompUni::truncRealiz (const Array1D< double > & meanrea,
const Array2D< double > & xi,
const int & nKL,
Array2D< double > & trunc_realiz )
+
+ +

Returns the truncated KL sum.

+

+\[ + F(t_i,\theta_l) = \left < F(t_i,\theta) \right >_{\theta} + + \sum_{k=1}^{nKL} \sqrt{\lambda_k} f_k(t_i) \left. \xi_k\right\vert_{\theta_l} + +\] +

+ +
+
+

Member Data Documentation

+ +

◆ absTol_

+ +
+
+ + + + + +
+ + + + +
double KLDecompUni::absTol_
+ 		+private
+
+ +

Absolute tolerance for convergence.

+ +
+
+ +

◆ decomposed_

+ +
+
+ + + + + +
+ + + + +
bool KLDecompUni::decomposed_
+ 		+private
+
+ +

Flag to determine whether KL decomposition has taken place (and consequently that the interal data structures contain meaningful eigenvalues and vectors ... )

+ +
+
+ +

◆ eig_info_

+ +
+
+ + + + + +
+ + + + +
int KLDecompUni::eig_info_
+ 		+private
+
+ +

info on success of the eigenvector solutions

+ +
+
+ +

◆ eig_values_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> KLDecompUni::eig_values_
+ 		+private
+
+ +

Array to store eigenvalues.

+ +
+
+ +

◆ eigRange_

+ +
+
+ + + + + +
+ + + + +
char KLDecompUni::eigRange_
+ 		+private
+
+ +

Option to set the type of range for eigenvalues.

+ +
+
+ +

◆ ifail_

+ +
+
+ + + + + +
+ + + + +
Array1D<int> KLDecompUni::ifail_
+ 		+private
+
+ +

Array to store indices of eigenvectors that failed to converge.

+ +
+
+ +

◆ il_

+ +
+
+ + + + + +
+ + + + +
int KLDecompUni::il_
+ 		+private
+
+ +

Lower index of range of eigenvalues requested.

+ +
+
+ +

◆ iu_

+ +
+
+ + + + + +
+ + + + +
int KLDecompUni::iu_
+ 		+private
+
+ +

Upper index of range of eigenvalues requested.

+ +
+
+ +

◆ jobz_

+ +
+
+ + + + + +
+ + + + +
char KLDecompUni::jobz_
+ 		+private
+
+ +

Option to determine what to compute (eigenvalues and eigenvectors)

+ +
+
+ +

◆ KL_modes_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> KLDecompUni::KL_modes_
+ 		+private
+
+ +

Matrix to store KL modes.

+ +
+
+ +

◆ uplo_

+ +
+
+ + + + + +
+ + + + +
char KLDecompUni::uplo_
+ 		+private
+
+ +

Option to indicate how matrix is stored.

+ +
+
+ +

◆ vl_

+ +
+
+ + + + + +
+ + + + +
double KLDecompUni::vl_
+ 		+private
+
+ +

Lower bound for range of eigenvalues.

+ +
+
+ +

◆ vu_

+ +
+
+ + + + + +
+ + + + +
double KLDecompUni::vu_
+ 		+private
+
+ +

Upper bound for range of eigenvalues.

+ +
+
+ +

◆ w_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> KLDecompUni::w_
+ 		+private
+
+ +

Array to hold weights for Nystrom's method for Fredholm integral equation solution.

+ +
+
+ +

◆ wh_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> KLDecompUni::wh_
+ 		+private
+
+ +

Array to hold square roots of weights.

+ +
+
+ +

◆ whcwh_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> KLDecompUni::whcwh_
+ 		+private
+
+ +

Matrix to hold the upper triangular part of the matrix to get eigenvalues of.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__ABC-members.html b/docs/html/classLik__ABC-members.html new file mode 100644 index 00000000..1ae1fd3c --- /dev/null +++ b/docs/html/classLik__ABC-members.html @@ -0,0 +1,118 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Lik_ABC Member List
+
+
+ +

This is the complete list of members for Lik_ABC, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
abceps_Lik_ABCprivate
chDim_Postprotected
dataNoiseLogFlag_Postprotected
dataNoiseSig_Postprotected
dataSigma(double m_last)Post
evalLogLik(Array1D< double > &m)Lik_ABCvirtual
evalLogPrior(Array1D< double > &m)Post
extraInferredParams_Postprotected
fixIndNom_Postprotected
forwardFcns_Postprotected
funcinfo_Postprotected
getChainDim()Post
getParamPCcf(Array1D< double > &m)Post
inferDataNoise()Post
inferDataNoise_Postprotected
inferLogDataNoise()Post
Lik_ABC(double eps)Lik_ABCinline
lower_Postprotected
momForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momForwardFcn(Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momParam(Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)Post
Mrv_Postprotected
ncat_Postprotected
nData_Postprotected
nEachs_Postprotected
pdfType_Postprotected
pDim_Postprotected
Post()Post
priora_Postprotected
priorb_Postprotected
priorType_Postprotected
rndInd_Postprotected
rvpcType_Postprotected
samForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)Post
samParam(Array1D< double > &m, int ns)Post
setData(Array2D< double > &xdata, Array2D< double > &ydata)Post
setData(Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)Post
setDataNoise(Array1D< double > &sigma)Post
setModel(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)Post
setModelRVinput(int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)Post
setPrior(string priorType, double priora, double priorb)Post
upper_Postprotected
verbosity_Postprivate
xData_Postprotected
xDim_Postprotected
yData_Postprotected
yDatam_Postprotected
~Lik_ABC()Lik_ABCinline
~Post()Postinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__ABC.html b/docs/html/classLik__ABC.html new file mode 100644 index 00000000..6d72e164 --- /dev/null +++ b/docs/html/classLik__ABC.html @@ -0,0 +1,355 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Lik_ABC Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
Lik_ABC Class Reference
+
+
+ +

Derived class for ABC likelihood. + More...

+ +

#include <post.h>

+
+Inheritance diagram for Lik_ABC:
+
+
+ + +Post + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Lik_ABC (double eps)
 Constructor given ABC epsilon.
 
 ~Lik_ABC ()
 Destructor.
 
double evalLogLik (Array1D< double > &m)
 Evaluate log-likelihood.
 
- Public Member Functions inherited from Post
 Post ()
 Constructor.
 
 ~Post ()
 Destructor.
 
void setData (Array2D< double > &xdata, Array2D< double > &ydata)
 Set the x- and y-data.
 
void setData (Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)
 Set the x- and y-data, for the case when each datapoint have different number of measurements.
 
void setDataNoise (Array1D< double > &sigma)
 Set the magnitude of data noise.
 
void inferDataNoise ()
 Indicate inference of data noise stdev.
 
void inferLogDataNoise ()
 Indicate inference of log of data noise stdev.
 
Array1D< double > dataSigma (double m_last)
 Get data noise, whether inferred or fixed.
 
void setModel (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)
 Set a pointer to the forward model f(p,x)
 
void setModelRVinput (int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)
 Set model input parameters' randomization scheme.
 
int getChainDim ()
 Get the dimensionailty of the posterior function.
 
void setPrior (string priorType, double priora, double priorb)
 Set the prior type and its parameters.
 
double evalLogPrior (Array1D< double > &m)
 Evaluate log-prior.
 
Array2D< double > getParamPCcf (Array1D< double > &m)
 Extract parameter PC coefficients from a posterior input.
 
Array2D< double > samParam (Array1D< double > &m, int ns)
 Sample model parameters given posterior input.
 
void momParam (Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)
 Get moments of parameters given posterior input.
 
Array2D< double > samForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)
 Sample forward function at a given grid for given posterior input.
 
void momForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of forward function at a given grid for given posterior input.
 
void momForwardFcn (Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of composite forward function at a given grid for given posterior input.
 
+ + + + +

+Private Attributes

double abceps_
 ABC epsilon.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Post
Array2D< double > xData_
 xdata
 
Array1D< Array1D< double > > yData_
 ydata
 
Array1D< double > yDatam_
 ydata averaged per measurement
 
int nData_
 Number of data points.
 
Array1D< int > nEachs_
 Number of samples at each input.
 
int xDim_
 Dimensionality of x-space.
 
int pDim_
 Dimensionality of parameter space (p-space)
 
int chDim_
 Dimensionality of posterior input.
 
bool inferDataNoise_
 Flag for data noise inference.
 
bool dataNoiseLogFlag_
 Flag to check if data noise logarithm is used.
 
Array1D< double > dataNoiseSig_
 Data noise stdev.
 
Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFcns_
 Pointer to the forward function f(p,x)
 
void * funcinfo_
 Auxiliary information for function evaluation.
 
int extraInferredParams_
 Number of extra inferred parameters, such as data noise or Koh variance.
 
int ncat_
 Number of categories.
 
Mrv * Mrv_
 Pointer to a multivariate PC RV object.
 
Array1D< int > rndInd_
 Indices of randomized inputs.
 
Array2D< double > fixIndNom_
 Indices and nominal values for fixed inputs.
 
Array1D< double > lower_
 Lower and upper bounds on parameters.
 
Array1D< double > upper_
 
string pdfType_
 Input parameter PDF type.
 
string rvpcType_
 PC type parameter for the r.v.
 
string priorType_
 Prior type.
 
double priora_
 Prior parameter #1.
 
double priorb_
 Prior parameter #2.
 
+

Detailed Description

+

Derived class for ABC likelihood.

+

Constructor & Destructor Documentation

+ +

◆ Lik_ABC()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_ABC::Lik_ABC (double eps)
+ 		+inline
+
+ +

Constructor given ABC epsilon.

+ +
+
+ +

◆ ~Lik_ABC()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_ABC::~Lik_ABC ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ evalLogLik()

+ +
+
+ + + + + +
+ + + + + + + +
double Lik_ABC::evalLogLik (Array1D< double > & m)
+ 		+virtual
+
+ +

Evaluate log-likelihood.

+ +

Reimplemented from Post.

+ +
+
+

Member Data Documentation

+ +

◆ abceps_

+ +
+
+ + + + + +
+ + + + +
double Lik_ABC::abceps_
+ 		+private
+
+ +

ABC epsilon.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__ABC.png b/docs/html/classLik__ABC.png new file mode 100644 index 0000000000000000000000000000000000000000..e5e68f4b2c32aa393441ab02d2c7ded95d69a7a7 GIT binary patch literal 358 zcmeAS@N?(olHy`uVBq!ia0vp^wm=-f!3-qlUh9nqQqloFA+G=b{|7Q(y!l$%e`vXd zfo6fk^fNCWJa_;UH$5A+1SrQ@666=m0OW&#In(SbK*5imE{-7;jBn>&>}yfram~*c zzWo3HBU#Z_t4B+oCT`j-!PoR~O3-2JkkHExo<=9P%yz%lz9c(ee%H6VuXe-+Mf{$f zV|OFEVcEnbk3ZhI%9kGZR`>HB*)w-;Uo19fwaD66u5#NfpVQOr=hbbivcwoF5*Qmy zoWE`AdExxcTkgW~H|wv}++q+&1L9ODe)|5Fl2WEZTAJs-y|MAv3x3yVf3$pcBQIpx z?e@*9H{ZLL+tB?s>He*_Z_#yI{x&ri-C1xq>f#yinaba8^Jl#AJNupI^seCb-yZ)r vGv>a$`Sf2?&sep8@7B#g&og+s`njxgN@xNA+YhZO literal 0 HcmV?d00001 diff --git a/docs/html/classLik__ABCm-members.html b/docs/html/classLik__ABCm-members.html new file mode 100644 index 00000000..c10fbbca --- /dev/null +++ b/docs/html/classLik__ABCm-members.html @@ -0,0 +1,118 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Lik_ABCm Member List
+
+
+ +

This is the complete list of members for Lik_ABCm, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
abceps_Lik_ABCmprivate
chDim_Postprotected
dataNoiseLogFlag_Postprotected
dataNoiseSig_Postprotected
dataSigma(double m_last)Post
evalLogLik(Array1D< double > &m)Lik_ABCmvirtual
evalLogPrior(Array1D< double > &m)Post
extraInferredParams_Postprotected
fixIndNom_Postprotected
forwardFcns_Postprotected
funcinfo_Postprotected
getChainDim()Post
getParamPCcf(Array1D< double > &m)Post
inferDataNoise()Post
inferDataNoise_Postprotected
inferLogDataNoise()Post
Lik_ABCm(double eps)Lik_ABCminline
lower_Postprotected
momForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momForwardFcn(Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momParam(Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)Post
Mrv_Postprotected
ncat_Postprotected
nData_Postprotected
nEachs_Postprotected
pdfType_Postprotected
pDim_Postprotected
Post()Post
priora_Postprotected
priorb_Postprotected
priorType_Postprotected
rndInd_Postprotected
rvpcType_Postprotected
samForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)Post
samParam(Array1D< double > &m, int ns)Post
setData(Array2D< double > &xdata, Array2D< double > &ydata)Post
setData(Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)Post
setDataNoise(Array1D< double > &sigma)Post
setModel(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)Post
setModelRVinput(int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)Post
setPrior(string priorType, double priora, double priorb)Post
upper_Postprotected
verbosity_Postprivate
xData_Postprotected
xDim_Postprotected
yData_Postprotected
yDatam_Postprotected
~Lik_ABCm()Lik_ABCminline
~Post()Postinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__ABCm.html b/docs/html/classLik__ABCm.html new file mode 100644 index 00000000..fa4ad9dd --- /dev/null +++ b/docs/html/classLik__ABCm.html @@ -0,0 +1,355 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Lik_ABCm Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
Lik_ABCm Class Reference
+
+
+ +

Derived class for ABC-mean likelihood. + More...

+ +

#include <post.h>

+
+Inheritance diagram for Lik_ABCm:
+
+
+ + +Post + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Lik_ABCm (double eps)
 Constructor given ABC epsilon.
 
 ~Lik_ABCm ()
 Destructor.
 
double evalLogLik (Array1D< double > &m)
 Evaluate log-likelihood.
 
- Public Member Functions inherited from Post
 Post ()
 Constructor.
 
 ~Post ()
 Destructor.
 
void setData (Array2D< double > &xdata, Array2D< double > &ydata)
 Set the x- and y-data.
 
void setData (Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)
 Set the x- and y-data, for the case when each datapoint have different number of measurements.
 
void setDataNoise (Array1D< double > &sigma)
 Set the magnitude of data noise.
 
void inferDataNoise ()
 Indicate inference of data noise stdev.
 
void inferLogDataNoise ()
 Indicate inference of log of data noise stdev.
 
Array1D< double > dataSigma (double m_last)
 Get data noise, whether inferred or fixed.
 
void setModel (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)
 Set a pointer to the forward model f(p,x)
 
void setModelRVinput (int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)
 Set model input parameters' randomization scheme.
 
int getChainDim ()
 Get the dimensionailty of the posterior function.
 
void setPrior (string priorType, double priora, double priorb)
 Set the prior type and its parameters.
 
double evalLogPrior (Array1D< double > &m)
 Evaluate log-prior.
 
Array2D< double > getParamPCcf (Array1D< double > &m)
 Extract parameter PC coefficients from a posterior input.
 
Array2D< double > samParam (Array1D< double > &m, int ns)
 Sample model parameters given posterior input.
 
void momParam (Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)
 Get moments of parameters given posterior input.
 
Array2D< double > samForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)
 Sample forward function at a given grid for given posterior input.
 
void momForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of forward function at a given grid for given posterior input.
 
void momForwardFcn (Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of composite forward function at a given grid for given posterior input.
 
+ + + + +

+Private Attributes

double abceps_
 ABC epsilon.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Post
Array2D< double > xData_
 xdata
 
Array1D< Array1D< double > > yData_
 ydata
 
Array1D< double > yDatam_
 ydata averaged per measurement
 
int nData_
 Number of data points.
 
Array1D< int > nEachs_
 Number of samples at each input.
 
int xDim_
 Dimensionality of x-space.
 
int pDim_
 Dimensionality of parameter space (p-space)
 
int chDim_
 Dimensionality of posterior input.
 
bool inferDataNoise_
 Flag for data noise inference.
 
bool dataNoiseLogFlag_
 Flag to check if data noise logarithm is used.
 
Array1D< double > dataNoiseSig_
 Data noise stdev.
 
Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFcns_
 Pointer to the forward function f(p,x)
 
void * funcinfo_
 Auxiliary information for function evaluation.
 
int extraInferredParams_
 Number of extra inferred parameters, such as data noise or Koh variance.
 
int ncat_
 Number of categories.
 
Mrv * Mrv_
 Pointer to a multivariate PC RV object.
 
Array1D< int > rndInd_
 Indices of randomized inputs.
 
Array2D< double > fixIndNom_
 Indices and nominal values for fixed inputs.
 
Array1D< double > lower_
 Lower and upper bounds on parameters.
 
Array1D< double > upper_
 
string pdfType_
 Input parameter PDF type.
 
string rvpcType_
 PC type parameter for the r.v.
 
string priorType_
 Prior type.
 
double priora_
 Prior parameter #1.
 
double priorb_
 Prior parameter #2.
 
+

Detailed Description

+

Derived class for ABC-mean likelihood.

+

Constructor & Destructor Documentation

+ +

◆ Lik_ABCm()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_ABCm::Lik_ABCm (double eps)
+ 		+inline
+
+ +

Constructor given ABC epsilon.

+ +
+
+ +

◆ ~Lik_ABCm()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_ABCm::~Lik_ABCm ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ evalLogLik()

+ +
+
+ + + + + +
+ + + + + + + +
double Lik_ABCm::evalLogLik (Array1D< double > & m)
+ 		+virtual
+
+ +

Evaluate log-likelihood.

+ +

Reimplemented from Post.

+ +
+
+

Member Data Documentation

+ +

◆ abceps_

+ +
+
+ + + + + +
+ + + + +
double Lik_ABCm::abceps_
+ 		+private
+
+ +

ABC epsilon.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__ABCm.png b/docs/html/classLik__ABCm.png new file mode 100644 index 0000000000000000000000000000000000000000..f1eb558ef1560df20dab7ae54387166139e47781 GIT binary patch literal 401 zcmV;C0dD?@P)vTJr#LVva2S`&=-}Ys|Ns9r%~qrU000SeQchC<|NsC0|NsC0Hv*f~0003T zNkl{#&9-7>394n}&3s|3#bI#*ICdttRLy~@; zne_RPY_?lRpYd)RU`kP+y;I+}%qE$QByZ`@&B?qU)X8jvn!vmrRLi`c8#77AO6@z6 zyd?gbBmSu`Fhgp>w&Lrl?Rw@_(ct|h+;3pUW@DmIG z_z4C8{QO%crIf~lBuS$QMw0wg=KQ+4dwW}tdL*gYu1s@Onp;QRovm&)_Noh0Pi_52 z%Vk=nE#hR>>*}Q*(^OoUG9{)OqxKnldpoEOV+U0h=M{5XHp5uYWA@_98T*^ZP%qDo v&q&hyJTc`pB1zvQUKEn#=jWJ|QX0-5W?wppxrMum00000NkvXXu0mjfnXR`& literal 0 HcmV?d00001 diff --git a/docs/html/classLik__Classical-members.html b/docs/html/classLik__Classical-members.html new file mode 100644 index 00000000..1cd3aa1b --- /dev/null +++ b/docs/html/classLik__Classical-members.html @@ -0,0 +1,117 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Lik_Classical Member List
+
+
+ +

This is the complete list of members for Lik_Classical, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
chDim_Postprotected
dataNoiseLogFlag_Postprotected
dataNoiseSig_Postprotected
dataSigma(double m_last)Post
evalLogLik(Array1D< double > &m)Lik_Classicalvirtual
evalLogPrior(Array1D< double > &m)Post
extraInferredParams_Postprotected
fixIndNom_Postprotected
forwardFcns_Postprotected
funcinfo_Postprotected
getChainDim()Post
getParamPCcf(Array1D< double > &m)Post
inferDataNoise()Post
inferDataNoise_Postprotected
inferLogDataNoise()Post
Lik_Classical()Lik_Classicalinline
lower_Postprotected
momForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momForwardFcn(Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momParam(Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)Post
Mrv_Postprotected
ncat_Postprotected
nData_Postprotected
nEachs_Postprotected
pdfType_Postprotected
pDim_Postprotected
Post()Post
priora_Postprotected
priorb_Postprotected
priorType_Postprotected
rndInd_Postprotected
rvpcType_Postprotected
samForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)Post
samParam(Array1D< double > &m, int ns)Post
setData(Array2D< double > &xdata, Array2D< double > &ydata)Post
setData(Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)Post
setDataNoise(Array1D< double > &sigma)Post
setModel(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)Post
setModelRVinput(int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)Post
setPrior(string priorType, double priora, double priorb)Post
upper_Postprotected
verbosity_Postprivate
xData_Postprotected
xDim_Postprotected
yData_Postprotected
yDatam_Postprotected
~Lik_Classical()Lik_Classicalinline
~Post()Postinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__Classical.html b/docs/html/classLik__Classical.html new file mode 100644 index 00000000..468ca98e --- /dev/null +++ b/docs/html/classLik__Classical.html @@ -0,0 +1,323 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Lik_Classical Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +List of all members
+
Lik_Classical Class Reference
+
+
+ +

Derived class for classical likelihood. + More...

+ +

#include <post.h>

+
+Inheritance diagram for Lik_Classical:
+
+
+ + +Post + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Lik_Classical ()
 Constructor.
 
 ~Lik_Classical ()
 Destructor.
 
double evalLogLik (Array1D< double > &m)
 Evaluate log-likelihood.
 
- Public Member Functions inherited from Post
 Post ()
 Constructor.
 
 ~Post ()
 Destructor.
 
void setData (Array2D< double > &xdata, Array2D< double > &ydata)
 Set the x- and y-data.
 
void setData (Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)
 Set the x- and y-data, for the case when each datapoint have different number of measurements.
 
void setDataNoise (Array1D< double > &sigma)
 Set the magnitude of data noise.
 
void inferDataNoise ()
 Indicate inference of data noise stdev.
 
void inferLogDataNoise ()
 Indicate inference of log of data noise stdev.
 
Array1D< double > dataSigma (double m_last)
 Get data noise, whether inferred or fixed.
 
void setModel (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)
 Set a pointer to the forward model f(p,x)
 
void setModelRVinput (int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)
 Set model input parameters' randomization scheme.
 
int getChainDim ()
 Get the dimensionailty of the posterior function.
 
void setPrior (string priorType, double priora, double priorb)
 Set the prior type and its parameters.
 
double evalLogPrior (Array1D< double > &m)
 Evaluate log-prior.
 
Array2D< double > getParamPCcf (Array1D< double > &m)
 Extract parameter PC coefficients from a posterior input.
 
Array2D< double > samParam (Array1D< double > &m, int ns)
 Sample model parameters given posterior input.
 
void momParam (Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)
 Get moments of parameters given posterior input.
 
Array2D< double > samForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)
 Sample forward function at a given grid for given posterior input.
 
void momForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of forward function at a given grid for given posterior input.
 
void momForwardFcn (Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of composite forward function at a given grid for given posterior input.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Post
Array2D< double > xData_
 xdata
 
Array1D< Array1D< double > > yData_
 ydata
 
Array1D< double > yDatam_
 ydata averaged per measurement
 
int nData_
 Number of data points.
 
Array1D< int > nEachs_
 Number of samples at each input.
 
int xDim_
 Dimensionality of x-space.
 
int pDim_
 Dimensionality of parameter space (p-space)
 
int chDim_
 Dimensionality of posterior input.
 
bool inferDataNoise_
 Flag for data noise inference.
 
bool dataNoiseLogFlag_
 Flag to check if data noise logarithm is used.
 
Array1D< double > dataNoiseSig_
 Data noise stdev.
 
Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFcns_
 Pointer to the forward function f(p,x)
 
void * funcinfo_
 Auxiliary information for function evaluation.
 
int extraInferredParams_
 Number of extra inferred parameters, such as data noise or Koh variance.
 
int ncat_
 Number of categories.
 
Mrv * Mrv_
 Pointer to a multivariate PC RV object.
 
Array1D< int > rndInd_
 Indices of randomized inputs.
 
Array2D< double > fixIndNom_
 Indices and nominal values for fixed inputs.
 
Array1D< double > lower_
 Lower and upper bounds on parameters.
 
Array1D< double > upper_
 
string pdfType_
 Input parameter PDF type.
 
string rvpcType_
 PC type parameter for the r.v.
 
string priorType_
 Prior type.
 
double priora_
 Prior parameter #1.
 
double priorb_
 Prior parameter #2.
 
+

Detailed Description

+

Derived class for classical likelihood.

+

Constructor & Destructor Documentation

+ +

◆ Lik_Classical()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_Classical::Lik_Classical ()
+ 		+inline
+
+ +

Constructor.

+ +
+
+ +

◆ ~Lik_Classical()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_Classical::~Lik_Classical ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ evalLogLik()

+ +
+
+ + + + + +
+ + + + + + + +
double Lik_Classical::evalLogLik (Array1D< double > & m)
+ 		+virtual
+
+ +

Evaluate log-likelihood.

+ +

Reimplemented from Post.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__Classical.png b/docs/html/classLik__Classical.png new file mode 100644 index 0000000000000000000000000000000000000000..d61006933784d5731addee901a1cf1ef1a49412e GIT binary patch literal 405 zcmeAS@N?(olHy`uVBq!ia0vp^VL%+f!3-p~Tr9c)q@)9ULR|m<{|{uoc=NTi|Il&^ z1I+@7>1SR%c<=xyZhAIs2~du+B*-tA0mugfbEer>7#J88JY5_^Dj46+ec0Ecz|(SD z(eU#>{~B#Akt4Rrr{c`6`?7~k={E|i^Y+sG=`F-ip}nEL^Xgaj1)Z0H_L^@{?olrD zugYcr$!t(4Kl`K_!-Jsjd)G$T3u~FpHeh_6>eOBO`Pz({kVDrP4zxb<;dnDWDcI{| ztddgs){c%J*?eV@%L<++#9xuT<9S1Wb;|)Zvki@+6Qvq?a}xeDhJ{{@U!?MK?SVRm z=-qj9zwW*ETP1gn8^2Gxt?jJ!=ej38@esekYY?HFKId~?>C#-cv&-5dCeJ+j?(&p3 zi(cz(DBJJ5tt>6`w#>YQ{_WRi6xeLMTa)KBebvnW+~1D8jSabU%sT(H+Ab~A(%t{G x^?J1y=6pFU|Gq9~(i7pMoMJbcLPJZh^ZU(o|GTW#ArlyY44$rjF6*2UngB;mwsimi literal 0 HcmV?d00001 diff --git a/docs/html/classLik__Eov-members.html b/docs/html/classLik__Eov-members.html new file mode 100644 index 00000000..74b9c6c4 --- /dev/null +++ b/docs/html/classLik__Eov-members.html @@ -0,0 +1,117 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Lik_Eov Member List
+
+
+ +

This is the complete list of members for Lik_Eov, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
chDim_Postprotected
dataNoiseLogFlag_Postprotected
dataNoiseSig_Postprotected
dataSigma(double m_last)Post
evalLogLik(Array1D< double > &m)Lik_Eovvirtual
evalLogPrior(Array1D< double > &m)Post
extraInferredParams_Postprotected
fixIndNom_Postprotected
forwardFcns_Postprotected
funcinfo_Postprotected
getChainDim()Post
getParamPCcf(Array1D< double > &m)Post
inferDataNoise()Post
inferDataNoise_Postprotected
inferLogDataNoise()Post
Lik_Eov()Lik_Eovinline
lower_Postprotected
momForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momForwardFcn(Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momParam(Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)Post
Mrv_Postprotected
ncat_Postprotected
nData_Postprotected
nEachs_Postprotected
pdfType_Postprotected
pDim_Postprotected
Post()Post
priora_Postprotected
priorb_Postprotected
priorType_Postprotected
rndInd_Postprotected
rvpcType_Postprotected
samForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)Post
samParam(Array1D< double > &m, int ns)Post
setData(Array2D< double > &xdata, Array2D< double > &ydata)Post
setData(Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)Post
setDataNoise(Array1D< double > &sigma)Post
setModel(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)Post
setModelRVinput(int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)Post
setPrior(string priorType, double priora, double priorb)Post
upper_Postprotected
verbosity_Postprivate
xData_Postprotected
xDim_Postprotected
yData_Postprotected
yDatam_Postprotected
~Lik_Eov()Lik_Eovinline
~Post()Postinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__Eov.html b/docs/html/classLik__Eov.html new file mode 100644 index 00000000..8d4ff87a --- /dev/null +++ b/docs/html/classLik__Eov.html @@ -0,0 +1,324 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Lik_Eov Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +List of all members
+
Lik_Eov Class Reference
+
+
+ +

Derived class for error-in-variable likelihood. + More...

+ +

#include <post.h>

+
+Inheritance diagram for Lik_Eov:
+
+
+ + +Post + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Lik_Eov ()
 Constructor.
 
 ~Lik_Eov ()
 Destructor.
 
double evalLogLik (Array1D< double > &m)
 Evaluate log-likelihood.
 
- Public Member Functions inherited from Post
 Post ()
 Constructor.
 
 ~Post ()
 Destructor.
 
void setData (Array2D< double > &xdata, Array2D< double > &ydata)
 Set the x- and y-data.
 
void setData (Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)
 Set the x- and y-data, for the case when each datapoint have different number of measurements.
 
void setDataNoise (Array1D< double > &sigma)
 Set the magnitude of data noise.
 
void inferDataNoise ()
 Indicate inference of data noise stdev.
 
void inferLogDataNoise ()
 Indicate inference of log of data noise stdev.
 
Array1D< double > dataSigma (double m_last)
 Get data noise, whether inferred or fixed.
 
void setModel (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)
 Set a pointer to the forward model f(p,x)
 
void setModelRVinput (int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)
 Set model input parameters' randomization scheme.
 
int getChainDim ()
 Get the dimensionailty of the posterior function.
 
void setPrior (string priorType, double priora, double priorb)
 Set the prior type and its parameters.
 
double evalLogPrior (Array1D< double > &m)
 Evaluate log-prior.
 
Array2D< double > getParamPCcf (Array1D< double > &m)
 Extract parameter PC coefficients from a posterior input.
 
Array2D< double > samParam (Array1D< double > &m, int ns)
 Sample model parameters given posterior input.
 
void momParam (Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)
 Get moments of parameters given posterior input.
 
Array2D< double > samForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)
 Sample forward function at a given grid for given posterior input.
 
void momForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of forward function at a given grid for given posterior input.
 
void momForwardFcn (Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of composite forward function at a given grid for given posterior input.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Post
Array2D< double > xData_
 xdata
 
Array1D< Array1D< double > > yData_
 ydata
 
Array1D< double > yDatam_
 ydata averaged per measurement
 
int nData_
 Number of data points.
 
Array1D< int > nEachs_
 Number of samples at each input.
 
int xDim_
 Dimensionality of x-space.
 
int pDim_
 Dimensionality of parameter space (p-space)
 
int chDim_
 Dimensionality of posterior input.
 
bool inferDataNoise_
 Flag for data noise inference.
 
bool dataNoiseLogFlag_
 Flag to check if data noise logarithm is used.
 
Array1D< double > dataNoiseSig_
 Data noise stdev.
 
Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFcns_
 Pointer to the forward function f(p,x)
 
void * funcinfo_
 Auxiliary information for function evaluation.
 
int extraInferredParams_
 Number of extra inferred parameters, such as data noise or Koh variance.
 
int ncat_
 Number of categories.
 
Mrv * Mrv_
 Pointer to a multivariate PC RV object.
 
Array1D< int > rndInd_
 Indices of randomized inputs.
 
Array2D< double > fixIndNom_
 Indices and nominal values for fixed inputs.
 
Array1D< double > lower_
 Lower and upper bounds on parameters.
 
Array1D< double > upper_
 
string pdfType_
 Input parameter PDF type.
 
string rvpcType_
 PC type parameter for the r.v.
 
string priorType_
 Prior type.
 
double priora_
 Prior parameter #1.
 
double priorb_
 Prior parameter #2.
 
+

Detailed Description

+

Derived class for error-in-variable likelihood.

+

Constructor & Destructor Documentation

+ +

◆ Lik_Eov()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_Eov::Lik_Eov ()
+ 		+inline
+
+ +

Constructor.

+ +
+
+ +

◆ ~Lik_Eov()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_Eov::~Lik_Eov ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ evalLogLik()

+ +
+
+ + + + + +
+ + + + + + + +
double Lik_Eov::evalLogLik (Array1D< double > & m)
+ 		+virtual
+
+ +

Evaluate log-likelihood.

+

Get the default quadrature points

+ +

Reimplemented from Post.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__Eov.png b/docs/html/classLik__Eov.png new file mode 100644 index 0000000000000000000000000000000000000000..f1b81bd38bf716e9d5abbefa8572c6fef490e81e GIT binary patch literal 356 zcmeAS@N?(olHy`uVBq!ia0vp^mOvc9!3-p)*y^eRDd_;85ZC|z{{xvX-h3_XKeXJ! zK(jz%`k5CG9y|bwo1P6@0+iz{3GxeO0P?}WoN4wIpx}E?7srqa#|7TY0BiBg1C=;+au;Zqb5+S?kXnYx!pM`9xXq`{gf|{+Rc2^}gAY sOpeUlIoHwCDsi5_=c|wUm(S=NV%}z@|B|EF8x)QVp00i_>zopr0QWJY%m4rY literal 0 HcmV?d00001 diff --git a/docs/html/classLik__Full-members.html b/docs/html/classLik__Full-members.html new file mode 100644 index 00000000..5bf14dad --- /dev/null +++ b/docs/html/classLik__Full-members.html @@ -0,0 +1,119 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Lik_Full Member List
+
+
+ +

This is the complete list of members for Lik_Full, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bdw_Lik_Fullprivate
chDim_Postprotected
dataNoiseLogFlag_Postprotected
dataNoiseSig_Postprotected
dataSigma(double m_last)Post
evalLogLik(Array1D< double > &m)Lik_Fullvirtual
evalLogPrior(Array1D< double > &m)Post
extraInferredParams_Postprotected
fixIndNom_Postprotected
forwardFcns_Postprotected
funcinfo_Postprotected
getChainDim()Post
getParamPCcf(Array1D< double > &m)Post
inferDataNoise()Post
inferDataNoise_Postprotected
inferLogDataNoise()Post
Lik_Full(double bdw, int nsam)Lik_Fullinline
lower_Postprotected
momForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momForwardFcn(Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momParam(Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)Post
Mrv_Postprotected
ncat_Postprotected
nData_Postprotected
nEachs_Postprotected
nsam_Lik_Fullprivate
pdfType_Postprotected
pDim_Postprotected
Post()Post
priora_Postprotected
priorb_Postprotected
priorType_Postprotected
rndInd_Postprotected
rvpcType_Postprotected
samForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)Post
samParam(Array1D< double > &m, int ns)Post
setData(Array2D< double > &xdata, Array2D< double > &ydata)Post
setData(Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)Post
setDataNoise(Array1D< double > &sigma)Post
setModel(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)Post
setModelRVinput(int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)Post
setPrior(string priorType, double priora, double priorb)Post
upper_Postprotected
verbosity_Postprivate
xData_Postprotected
xDim_Postprotected
yData_Postprotected
yDatam_Postprotected
~Lik_Full()Lik_Fullinline
~Post()Postinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__Full.html b/docs/html/classLik__Full.html new file mode 100644 index 00000000..0a856d5d --- /dev/null +++ b/docs/html/classLik__Full.html @@ -0,0 +1,386 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Lik_Full Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
Lik_Full Class Reference
+
+
+ +

Derived class for full likelihood. + More...

+ +

#include <post.h>

+
+Inheritance diagram for Lik_Full:
+
+
+ + +Post + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Lik_Full (double bdw, int nsam)
 Constructor given KDE bandwidth and sample size.
 
 ~Lik_Full ()
 Destructor.
 
double evalLogLik (Array1D< double > &m)
 Evaluate log-likelihood.
 
- Public Member Functions inherited from Post
 Post ()
 Constructor.
 
 ~Post ()
 Destructor.
 
void setData (Array2D< double > &xdata, Array2D< double > &ydata)
 Set the x- and y-data.
 
void setData (Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)
 Set the x- and y-data, for the case when each datapoint have different number of measurements.
 
void setDataNoise (Array1D< double > &sigma)
 Set the magnitude of data noise.
 
void inferDataNoise ()
 Indicate inference of data noise stdev.
 
void inferLogDataNoise ()
 Indicate inference of log of data noise stdev.
 
Array1D< double > dataSigma (double m_last)
 Get data noise, whether inferred or fixed.
 
void setModel (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)
 Set a pointer to the forward model f(p,x)
 
void setModelRVinput (int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)
 Set model input parameters' randomization scheme.
 
int getChainDim ()
 Get the dimensionailty of the posterior function.
 
void setPrior (string priorType, double priora, double priorb)
 Set the prior type and its parameters.
 
double evalLogPrior (Array1D< double > &m)
 Evaluate log-prior.
 
Array2D< double > getParamPCcf (Array1D< double > &m)
 Extract parameter PC coefficients from a posterior input.
 
Array2D< double > samParam (Array1D< double > &m, int ns)
 Sample model parameters given posterior input.
 
void momParam (Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)
 Get moments of parameters given posterior input.
 
Array2D< double > samForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)
 Sample forward function at a given grid for given posterior input.
 
void momForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of forward function at a given grid for given posterior input.
 
void momForwardFcn (Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of composite forward function at a given grid for given posterior input.
 
+ + + + + + + +

+Private Attributes

double bdw_
 KDE bandwidth.
 
int nsam_
 KDE sample size.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Post
Array2D< double > xData_
 xdata
 
Array1D< Array1D< double > > yData_
 ydata
 
Array1D< double > yDatam_
 ydata averaged per measurement
 
int nData_
 Number of data points.
 
Array1D< int > nEachs_
 Number of samples at each input.
 
int xDim_
 Dimensionality of x-space.
 
int pDim_
 Dimensionality of parameter space (p-space)
 
int chDim_
 Dimensionality of posterior input.
 
bool inferDataNoise_
 Flag for data noise inference.
 
bool dataNoiseLogFlag_
 Flag to check if data noise logarithm is used.
 
Array1D< double > dataNoiseSig_
 Data noise stdev.
 
Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFcns_
 Pointer to the forward function f(p,x)
 
void * funcinfo_
 Auxiliary information for function evaluation.
 
int extraInferredParams_
 Number of extra inferred parameters, such as data noise or Koh variance.
 
int ncat_
 Number of categories.
 
Mrv * Mrv_
 Pointer to a multivariate PC RV object.
 
Array1D< int > rndInd_
 Indices of randomized inputs.
 
Array2D< double > fixIndNom_
 Indices and nominal values for fixed inputs.
 
Array1D< double > lower_
 Lower and upper bounds on parameters.
 
Array1D< double > upper_
 
string pdfType_
 Input parameter PDF type.
 
string rvpcType_
 PC type parameter for the r.v.
 
string priorType_
 Prior type.
 
double priora_
 Prior parameter #1.
 
double priorb_
 Prior parameter #2.
 
+

Detailed Description

+

Derived class for full likelihood.

+

Constructor & Destructor Documentation

+ +

◆ Lik_Full()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
Lik_Full::Lik_Full (double bdw,
int nsam )
+ 		+inline
+
+ +

Constructor given KDE bandwidth and sample size.

+ +
+
+ +

◆ ~Lik_Full()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_Full::~Lik_Full ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ evalLogLik()

+ +
+
+ + + + + +
+ + + + + + + +
double Lik_Full::evalLogLik (Array1D< double > & m)
+ 		+virtual
+
+ +

Evaluate log-likelihood.

+ +

Reimplemented from Post.

+ +
+
+

Member Data Documentation

+ +

◆ bdw_

+ +
+
+ + + + + +
+ + + + +
double Lik_Full::bdw_
+ 		+private
+
+ +

KDE bandwidth.

+ +
+
+ +

◆ nsam_

+ +
+
+ + + + + +
+ + + + +
int Lik_Full::nsam_
+ 		+private
+
+ +

KDE sample size.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__Full.png b/docs/html/classLik__Full.png new file mode 100644 index 0000000000000000000000000000000000000000..759368113cc202cd197e7be41109fc92f5e27f8b GIT binary patch literal 344 zcmeAS@N?(olHy`uVBq!ia0vp^7C;=p!3-p;|GP;8Dd_;85ZC|z{{xvX-h3_XKeXJ! zK(jz%`k5CG9y|bwo1P6@0+iz{3GxeO0P?}WoN4wIpx|Rq7srqa# + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Lik_GausMarg Member List
+
+
+ +

This is the complete list of members for Lik_GausMarg, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
chDim_Postprotected
dataNoiseLogFlag_Postprotected
dataNoiseSig_Postprotected
dataSigma(double m_last)Post
evalLogLik(Array1D< double > &m)Lik_GausMargvirtual
evalLogPrior(Array1D< double > &m)Post
extraInferredParams_Postprotected
fixIndNom_Postprotected
forwardFcns_Postprotected
funcinfo_Postprotected
getChainDim()Post
getParamPCcf(Array1D< double > &m)Post
inferDataNoise()Post
inferDataNoise_Postprotected
inferLogDataNoise()Post
Lik_GausMarg()Lik_GausMarginline
lower_Postprotected
momForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momForwardFcn(Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momParam(Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)Post
Mrv_Postprotected
ncat_Postprotected
nData_Postprotected
nEachs_Postprotected
pdfType_Postprotected
pDim_Postprotected
Post()Post
priora_Postprotected
priorb_Postprotected
priorType_Postprotected
rndInd_Postprotected
rvpcType_Postprotected
samForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)Post
samParam(Array1D< double > &m, int ns)Post
setData(Array2D< double > &xdata, Array2D< double > &ydata)Post
setData(Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)Post
setDataNoise(Array1D< double > &sigma)Post
setModel(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)Post
setModelRVinput(int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)Post
setPrior(string priorType, double priora, double priorb)Post
upper_Postprotected
verbosity_Postprivate
xData_Postprotected
xDim_Postprotected
yData_Postprotected
yDatam_Postprotected
~Lik_GausMarg()Lik_GausMarginline
~Post()Postinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__GausMarg.html b/docs/html/classLik__GausMarg.html new file mode 100644 index 00000000..cd8646a9 --- /dev/null +++ b/docs/html/classLik__GausMarg.html @@ -0,0 +1,323 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Lik_GausMarg Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +List of all members
+
Lik_GausMarg Class Reference
+
+
+ +

Derived class for gaussian-marginal likelihood. + More...

+ +

#include <post.h>

+
+Inheritance diagram for Lik_GausMarg:
+
+
+ + +Post + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Lik_GausMarg ()
 Constructor.
 
 ~Lik_GausMarg ()
 Destructor.
 
double evalLogLik (Array1D< double > &m)
 Evaluate log-likelihood.
 
- Public Member Functions inherited from Post
 Post ()
 Constructor.
 
 ~Post ()
 Destructor.
 
void setData (Array2D< double > &xdata, Array2D< double > &ydata)
 Set the x- and y-data.
 
void setData (Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)
 Set the x- and y-data, for the case when each datapoint have different number of measurements.
 
void setDataNoise (Array1D< double > &sigma)
 Set the magnitude of data noise.
 
void inferDataNoise ()
 Indicate inference of data noise stdev.
 
void inferLogDataNoise ()
 Indicate inference of log of data noise stdev.
 
Array1D< double > dataSigma (double m_last)
 Get data noise, whether inferred or fixed.
 
void setModel (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)
 Set a pointer to the forward model f(p,x)
 
void setModelRVinput (int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)
 Set model input parameters' randomization scheme.
 
int getChainDim ()
 Get the dimensionailty of the posterior function.
 
void setPrior (string priorType, double priora, double priorb)
 Set the prior type and its parameters.
 
double evalLogPrior (Array1D< double > &m)
 Evaluate log-prior.
 
Array2D< double > getParamPCcf (Array1D< double > &m)
 Extract parameter PC coefficients from a posterior input.
 
Array2D< double > samParam (Array1D< double > &m, int ns)
 Sample model parameters given posterior input.
 
void momParam (Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)
 Get moments of parameters given posterior input.
 
Array2D< double > samForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)
 Sample forward function at a given grid for given posterior input.
 
void momForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of forward function at a given grid for given posterior input.
 
void momForwardFcn (Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of composite forward function at a given grid for given posterior input.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Post
Array2D< double > xData_
 xdata
 
Array1D< Array1D< double > > yData_
 ydata
 
Array1D< double > yDatam_
 ydata averaged per measurement
 
int nData_
 Number of data points.
 
Array1D< int > nEachs_
 Number of samples at each input.
 
int xDim_
 Dimensionality of x-space.
 
int pDim_
 Dimensionality of parameter space (p-space)
 
int chDim_
 Dimensionality of posterior input.
 
bool inferDataNoise_
 Flag for data noise inference.
 
bool dataNoiseLogFlag_
 Flag to check if data noise logarithm is used.
 
Array1D< double > dataNoiseSig_
 Data noise stdev.
 
Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFcns_
 Pointer to the forward function f(p,x)
 
void * funcinfo_
 Auxiliary information for function evaluation.
 
int extraInferredParams_
 Number of extra inferred parameters, such as data noise or Koh variance.
 
int ncat_
 Number of categories.
 
Mrv * Mrv_
 Pointer to a multivariate PC RV object.
 
Array1D< int > rndInd_
 Indices of randomized inputs.
 
Array2D< double > fixIndNom_
 Indices and nominal values for fixed inputs.
 
Array1D< double > lower_
 Lower and upper bounds on parameters.
 
Array1D< double > upper_
 
string pdfType_
 Input parameter PDF type.
 
string rvpcType_
 PC type parameter for the r.v.
 
string priorType_
 Prior type.
 
double priora_
 Prior parameter #1.
 
double priorb_
 Prior parameter #2.
 
+

Detailed Description

+

Derived class for gaussian-marginal likelihood.

+

Constructor & Destructor Documentation

+ +

◆ Lik_GausMarg()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_GausMarg::Lik_GausMarg ()
+ 		+inline
+
+ +

Constructor.

+ +
+
+ +

◆ ~Lik_GausMarg()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_GausMarg::~Lik_GausMarg ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ evalLogLik()

+ +
+
+ + + + + +
+ + + + + + + +
double Lik_GausMarg::evalLogLik (Array1D< double > & m)
+ 		+virtual
+
+ +

Evaluate log-likelihood.

+ +

Reimplemented from Post.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__GausMarg.png b/docs/html/classLik__GausMarg.png new file mode 100644 index 0000000000000000000000000000000000000000..9319989e8be19c0e3f3cb6bc735678cae6ab63d0 GIT binary patch literal 462 zcmV;<0WtoGP)vTJr#LVva2S`&=-}Ys|Ns9r%~qrU000SeQchC<|NsC0|NsC0Hv*f~00045 zNkl(}Nu>Yr}TUjKOS zhefD6XB$ZJ4e`w(NrTXnq`}AQbI#cf0Jy^o0Q~UPzh16>U;Ve;)9 z02qWG01QG800yB40E5s2fI;X1z~F!BQ%cDXBuVlj^pa%oTl)St#aq^2l1`}ec80V5 z@bG$NykFv);jQe?Vr@k<+R)BRBFpRRXzGV-+G+9jzxL#29Kvn^O#N8vkl3WJ;-1c~ zy6gHDWXiG?&~IPSADgpJdz`EKBx&Zt(vA(SH;3LI!q&@!z7;j&*Bt1pXD?Z4QWbpC&lu~lz3v=a8AwIBpUH||907*qoM6N<$ Ef@6l}Jpcdz literal 0 HcmV?d00001 diff --git a/docs/html/classLik__GausMargD-members.html b/docs/html/classLik__GausMargD-members.html new file mode 100644 index 00000000..81b63b45 --- /dev/null +++ b/docs/html/classLik__GausMargD-members.html @@ -0,0 +1,117 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Lik_GausMargD Member List
+
+
+ +

This is the complete list of members for Lik_GausMargD, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
chDim_Postprotected
dataNoiseLogFlag_Postprotected
dataNoiseSig_Postprotected
dataSigma(double m_last)Post
evalLogLik(Array1D< double > &m)Lik_GausMargDvirtual
evalLogPrior(Array1D< double > &m)Post
extraInferredParams_Postprotected
fixIndNom_Postprotected
forwardFcns_Postprotected
funcinfo_Postprotected
getChainDim()Post
getParamPCcf(Array1D< double > &m)Post
inferDataNoise()Post
inferDataNoise_Postprotected
inferLogDataNoise()Post
Lik_GausMargD()Lik_GausMargDinline
lower_Postprotected
momForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momForwardFcn(Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momParam(Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)Post
Mrv_Postprotected
ncat_Postprotected
nData_Postprotected
nEachs_Postprotected
pdfType_Postprotected
pDim_Postprotected
Post()Post
priora_Postprotected
priorb_Postprotected
priorType_Postprotected
rndInd_Postprotected
rvpcType_Postprotected
samForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)Post
samParam(Array1D< double > &m, int ns)Post
setData(Array2D< double > &xdata, Array2D< double > &ydata)Post
setData(Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)Post
setDataNoise(Array1D< double > &sigma)Post
setModel(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)Post
setModelRVinput(int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)Post
setPrior(string priorType, double priora, double priorb)Post
upper_Postprotected
verbosity_Postprivate
xData_Postprotected
xDim_Postprotected
yData_Postprotected
yDatam_Postprotected
~Lik_GausMargD()Lik_GausMargDinline
~Post()Postinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__GausMargD.html b/docs/html/classLik__GausMargD.html new file mode 100644 index 00000000..4145a17a --- /dev/null +++ b/docs/html/classLik__GausMargD.html @@ -0,0 +1,322 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Lik_GausMargD Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +List of all members
+
Lik_GausMargD Class Reference
+
+
+ +

Derived class for gaussian-marginal likelihood with discrete parameter. + More...

+ +

#include <post.h>

+
+Inheritance diagram for Lik_GausMargD:
+
+
+ + +Post + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Lik_GausMargD ()
 Constructor.
 
 ~Lik_GausMargD ()
 Destructor.
 
double evalLogLik (Array1D< double > &m)
 Evaluate log-likelihood.
 
- Public Member Functions inherited from Post
 Post ()
 Constructor.
 
 ~Post ()
 Destructor.
 
void setData (Array2D< double > &xdata, Array2D< double > &ydata)
 Set the x- and y-data.
 
void setData (Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)
 Set the x- and y-data, for the case when each datapoint have different number of measurements.
 
void setDataNoise (Array1D< double > &sigma)
 Set the magnitude of data noise.
 
void inferDataNoise ()
 Indicate inference of data noise stdev.
 
void inferLogDataNoise ()
 Indicate inference of log of data noise stdev.
 
Array1D< double > dataSigma (double m_last)
 Get data noise, whether inferred or fixed.
 
void setModel (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)
 Set a pointer to the forward model f(p,x)
 
void setModelRVinput (int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)
 Set model input parameters' randomization scheme.
 
int getChainDim ()
 Get the dimensionailty of the posterior function.
 
void setPrior (string priorType, double priora, double priorb)
 Set the prior type and its parameters.
 
double evalLogPrior (Array1D< double > &m)
 Evaluate log-prior.
 
Array2D< double > getParamPCcf (Array1D< double > &m)
 Extract parameter PC coefficients from a posterior input.
 
Array2D< double > samParam (Array1D< double > &m, int ns)
 Sample model parameters given posterior input.
 
void momParam (Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)
 Get moments of parameters given posterior input.
 
Array2D< double > samForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)
 Sample forward function at a given grid for given posterior input.
 
void momForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of forward function at a given grid for given posterior input.
 
void momForwardFcn (Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of composite forward function at a given grid for given posterior input.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Post
Array2D< double > xData_
 xdata
 
Array1D< Array1D< double > > yData_
 ydata
 
Array1D< double > yDatam_
 ydata averaged per measurement
 
int nData_
 Number of data points.
 
Array1D< int > nEachs_
 Number of samples at each input.
 
int xDim_
 Dimensionality of x-space.
 
int pDim_
 Dimensionality of parameter space (p-space)
 
int chDim_
 Dimensionality of posterior input.
 
bool inferDataNoise_
 Flag for data noise inference.
 
bool dataNoiseLogFlag_
 Flag to check if data noise logarithm is used.
 
Array1D< double > dataNoiseSig_
 Data noise stdev.
 
Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFcns_
 Pointer to the forward function f(p,x)
 
void * funcinfo_
 Auxiliary information for function evaluation.
 
int extraInferredParams_
 Number of extra inferred parameters, such as data noise or Koh variance.
 
int ncat_
 Number of categories.
 
Mrv * Mrv_
 Pointer to a multivariate PC RV object.
 
Array1D< int > rndInd_
 Indices of randomized inputs.
 
Array2D< double > fixIndNom_
 Indices and nominal values for fixed inputs.
 
Array1D< double > lower_
 Lower and upper bounds on parameters.
 
Array1D< double > upper_
 
string pdfType_
 Input parameter PDF type.
 
string rvpcType_
 PC type parameter for the r.v.
 
string priorType_
 Prior type.
 
double priora_
 Prior parameter #1.
 
double priorb_
 Prior parameter #2.
 
+

Detailed Description

+

Derived class for gaussian-marginal likelihood with discrete parameter.

+

Constructor & Destructor Documentation

+ +

◆ Lik_GausMargD()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_GausMargD::Lik_GausMargD ()
+ 		+inline
+
+ +

Constructor.

+ +
+
+ +

◆ ~Lik_GausMargD()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_GausMargD::~Lik_GausMargD ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ evalLogLik()

+ +
+
+ + + + + +
+ + + + + + + +
double Lik_GausMargD::evalLogLik (Array1D< double > & m)
+ 		+virtual
+
+ +

Evaluate log-likelihood.

+ +

Reimplemented from Post.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__GausMargD.png b/docs/html/classLik__GausMargD.png new file mode 100644 index 0000000000000000000000000000000000000000..e2630d0bbc1a3ec2b930939b47f33bee8840c3a4 GIT binary patch literal 478 zcmeAS@N?(olHy`uVBq!ia0vp^=|CL7!3-pgAI!c7q@)9ULR|m<{|{uoc=NTi|Il&^ z1I+@7>1SR%c<=xyZhAIs2~du+B*-tA0mugfbEer>7#J8cJzX3_Dj46+eSPkg0S}A0 zH0Rsj_8%8ckD0y7=$DXe=(-sUtyMY4FYNCyJjSXp=}E~Q=SgM%?EP=>O*;Fys7b|L z!e;RfW83t|+g2+ksIcF#-My-6!V}|fe>LZI)@sk&o3Cwi`Pa3oXK($t24>#tYgL*5 z;lKH$Esy0UZTalv-(z@=oncK4Ljq&B&HVFH7nRP3Z+6*o>hrG3Vt$4{4b=<>`mo}C z?i`9b433kQJ(ly_wE0f(JgbjpI+IKk=E~Ra>%TeodC}E>@7zk-cAi|kvnb}gN0rL- zliqc;$L{LcUsHQ`BKT=Im%i`Woig{&I8Od$U|aplEM#TbycCT})35&?oZP1OJ|^hr zjVC+5t<_y(H{HfD==kR4;-Rfm?rlFt)J)ER2M%%#ajPMi@>3pe~kadLTkTks!RdK1cRrmpUXO@ GgeCw5MdOqJ literal 0 HcmV?d00001 diff --git a/docs/html/classLik__Koh-members.html b/docs/html/classLik__Koh-members.html new file mode 100644 index 00000000..79398b22 --- /dev/null +++ b/docs/html/classLik__Koh-members.html @@ -0,0 +1,118 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Lik_Koh Member List
+
+
+ +

This is the complete list of members for Lik_Koh, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
chDim_Postprotected
corLength_Lik_Kohprivate
dataNoiseLogFlag_Postprotected
dataNoiseSig_Postprotected
dataSigma(double m_last)Post
evalLogLik(Array1D< double > &m)Lik_Kohvirtual
evalLogPrior(Array1D< double > &m)Post
extraInferredParams_Postprotected
fixIndNom_Postprotected
forwardFcns_Postprotected
funcinfo_Postprotected
getChainDim()Post
getParamPCcf(Array1D< double > &m)Post
inferDataNoise()Post
inferDataNoise_Postprotected
inferLogDataNoise()Post
Lik_Koh(double corLength)Lik_Kohinline
lower_Postprotected
momForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momForwardFcn(Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momParam(Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)Post
Mrv_Postprotected
ncat_Postprotected
nData_Postprotected
nEachs_Postprotected
pdfType_Postprotected
pDim_Postprotected
Post()Post
priora_Postprotected
priorb_Postprotected
priorType_Postprotected
rndInd_Postprotected
rvpcType_Postprotected
samForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)Post
samParam(Array1D< double > &m, int ns)Post
setData(Array2D< double > &xdata, Array2D< double > &ydata)Post
setData(Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)Post
setDataNoise(Array1D< double > &sigma)Post
setModel(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)Post
setModelRVinput(int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)Post
setPrior(string priorType, double priora, double priorb)Post
upper_Postprotected
verbosity_Postprivate
xData_Postprotected
xDim_Postprotected
yData_Postprotected
yDatam_Postprotected
~Lik_Koh()Lik_Kohinline
~Post()Postinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__Koh.html b/docs/html/classLik__Koh.html new file mode 100644 index 00000000..54f01e11 --- /dev/null +++ b/docs/html/classLik__Koh.html @@ -0,0 +1,352 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Lik_Koh Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
Lik_Koh Class Reference
+
+
+ +

Derived class for Kennedy-O'Hagan likelihood. + More...

+ +

#include <post.h>

+
+Inheritance diagram for Lik_Koh:
+
+
+ + +Post + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Lik_Koh (double corLength)
 Constructor given correlation length.
 
 ~Lik_Koh ()
 Destructor.
 
double evalLogLik (Array1D< double > &m)
 Evaluate log-likelihood.
 
- Public Member Functions inherited from Post
 Post ()
 Constructor.
 
 ~Post ()
 Destructor.
 
void setData (Array2D< double > &xdata, Array2D< double > &ydata)
 Set the x- and y-data.
 
void setData (Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)
 Set the x- and y-data, for the case when each datapoint have different number of measurements.
 
void setDataNoise (Array1D< double > &sigma)
 Set the magnitude of data noise.
 
void inferDataNoise ()
 Indicate inference of data noise stdev.
 
void inferLogDataNoise ()
 Indicate inference of log of data noise stdev.
 
Array1D< double > dataSigma (double m_last)
 Get data noise, whether inferred or fixed.
 
void setModel (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)
 Set a pointer to the forward model f(p,x)
 
void setModelRVinput (int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)
 Set model input parameters' randomization scheme.
 
int getChainDim ()
 Get the dimensionailty of the posterior function.
 
void setPrior (string priorType, double priora, double priorb)
 Set the prior type and its parameters.
 
double evalLogPrior (Array1D< double > &m)
 Evaluate log-prior.
 
Array2D< double > getParamPCcf (Array1D< double > &m)
 Extract parameter PC coefficients from a posterior input.
 
Array2D< double > samParam (Array1D< double > &m, int ns)
 Sample model parameters given posterior input.
 
void momParam (Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)
 Get moments of parameters given posterior input.
 
Array2D< double > samForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)
 Sample forward function at a given grid for given posterior input.
 
void momForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of forward function at a given grid for given posterior input.
 
void momForwardFcn (Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of composite forward function at a given grid for given posterior input.
 
+ + + +

+Private Attributes

double corLength_
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Post
Array2D< double > xData_
 xdata
 
Array1D< Array1D< double > > yData_
 ydata
 
Array1D< double > yDatam_
 ydata averaged per measurement
 
int nData_
 Number of data points.
 
Array1D< int > nEachs_
 Number of samples at each input.
 
int xDim_
 Dimensionality of x-space.
 
int pDim_
 Dimensionality of parameter space (p-space)
 
int chDim_
 Dimensionality of posterior input.
 
bool inferDataNoise_
 Flag for data noise inference.
 
bool dataNoiseLogFlag_
 Flag to check if data noise logarithm is used.
 
Array1D< double > dataNoiseSig_
 Data noise stdev.
 
Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFcns_
 Pointer to the forward function f(p,x)
 
void * funcinfo_
 Auxiliary information for function evaluation.
 
int extraInferredParams_
 Number of extra inferred parameters, such as data noise or Koh variance.
 
int ncat_
 Number of categories.
 
Mrv * Mrv_
 Pointer to a multivariate PC RV object.
 
Array1D< int > rndInd_
 Indices of randomized inputs.
 
Array2D< double > fixIndNom_
 Indices and nominal values for fixed inputs.
 
Array1D< double > lower_
 Lower and upper bounds on parameters.
 
Array1D< double > upper_
 
string pdfType_
 Input parameter PDF type.
 
string rvpcType_
 PC type parameter for the r.v.
 
string priorType_
 Prior type.
 
double priora_
 Prior parameter #1.
 
double priorb_
 Prior parameter #2.
 
+

Detailed Description

+

Derived class for Kennedy-O'Hagan likelihood.

+

Constructor & Destructor Documentation

+ +

◆ Lik_Koh()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_Koh::Lik_Koh (double corLength)
+ 		+inline
+
+ +

Constructor given correlation length.

+ +
+
+ +

◆ ~Lik_Koh()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_Koh::~Lik_Koh ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ evalLogLik()

+ +
+
+ + + + + +
+ + + + + + + +
double Lik_Koh::evalLogLik (Array1D< double > & m)
+ 		+virtual
+
+ +

Evaluate log-likelihood.

+ +

Reimplemented from Post.

+ +
+
+

Member Data Documentation

+ +

◆ corLength_

+ +
+
+ + + + + +
+ + + + +
double Lik_Koh::corLength_
+ 		+private
+
+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__Koh.png b/docs/html/classLik__Koh.png new file mode 100644 index 0000000000000000000000000000000000000000..758fbe4122c26fe04f61996891633fd8e6394579 GIT binary patch literal 362 zcmeAS@N?(olHy`uVBq!ia0vp^mOvc9!3-p)*y^eRDd_;85ZC|z{{xvX-h3_XKeXJ! zK(jz%`k5CG9y|bwo1P6@0+iz{3GxeO0P?}WoN4wIpx{?e7srqa#_pJH&T95sC8||thFCx+ z_U5QG={KO{E}Rj{B|G<(T=&UxFjn zzrAT + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Lik_MVN Member List
+
+
+ +

This is the complete list of members for Lik_MVN, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
chDim_Postprotected
dataNoiseLogFlag_Postprotected
dataNoiseSig_Postprotected
dataSigma(double m_last)Post
evalLogLik(Array1D< double > &m)Lik_MVNvirtual
evalLogPrior(Array1D< double > &m)Post
extraInferredParams_Postprotected
fixIndNom_Postprotected
forwardFcns_Postprotected
funcinfo_Postprotected
getChainDim()Post
getParamPCcf(Array1D< double > &m)Post
inferDataNoise()Post
inferDataNoise_Postprotected
inferLogDataNoise()Post
Lik_MVN(double nugget)Lik_MVNinline
lower_Postprotected
momForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momForwardFcn(Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momParam(Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)Post
Mrv_Postprotected
ncat_Postprotected
nData_Postprotected
nEachs_Postprotected
nugget_Lik_MVNprivate
pdfType_Postprotected
pDim_Postprotected
Post()Post
priora_Postprotected
priorb_Postprotected
priorType_Postprotected
rndInd_Postprotected
rvpcType_Postprotected
samForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)Post
samParam(Array1D< double > &m, int ns)Post
setData(Array2D< double > &xdata, Array2D< double > &ydata)Post
setData(Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)Post
setDataNoise(Array1D< double > &sigma)Post
setModel(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)Post
setModelRVinput(int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)Post
setPrior(string priorType, double priora, double priorb)Post
upper_Postprotected
verbosity_Postprivate
xData_Postprotected
xDim_Postprotected
yData_Postprotected
yDatam_Postprotected
~Lik_MVN()Lik_MVNinline
~Post()Postinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__MVN.html b/docs/html/classLik__MVN.html new file mode 100644 index 00000000..d0dac443 --- /dev/null +++ b/docs/html/classLik__MVN.html @@ -0,0 +1,355 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Lik_MVN Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
Lik_MVN Class Reference
+
+
+ +

Derived class for mvn likelihood. + More...

+ +

#include <post.h>

+
+Inheritance diagram for Lik_MVN:
+
+
+ + +Post + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Lik_MVN (double nugget)
 Constructor given fiagonal nugget.
 
 ~Lik_MVN ()
 Destructor.
 
double evalLogLik (Array1D< double > &m)
 Evaluate log-likelihood.
 
- Public Member Functions inherited from Post
 Post ()
 Constructor.
 
 ~Post ()
 Destructor.
 
void setData (Array2D< double > &xdata, Array2D< double > &ydata)
 Set the x- and y-data.
 
void setData (Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)
 Set the x- and y-data, for the case when each datapoint have different number of measurements.
 
void setDataNoise (Array1D< double > &sigma)
 Set the magnitude of data noise.
 
void inferDataNoise ()
 Indicate inference of data noise stdev.
 
void inferLogDataNoise ()
 Indicate inference of log of data noise stdev.
 
Array1D< double > dataSigma (double m_last)
 Get data noise, whether inferred or fixed.
 
void setModel (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)
 Set a pointer to the forward model f(p,x)
 
void setModelRVinput (int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)
 Set model input parameters' randomization scheme.
 
int getChainDim ()
 Get the dimensionailty of the posterior function.
 
void setPrior (string priorType, double priora, double priorb)
 Set the prior type and its parameters.
 
double evalLogPrior (Array1D< double > &m)
 Evaluate log-prior.
 
Array2D< double > getParamPCcf (Array1D< double > &m)
 Extract parameter PC coefficients from a posterior input.
 
Array2D< double > samParam (Array1D< double > &m, int ns)
 Sample model parameters given posterior input.
 
void momParam (Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)
 Get moments of parameters given posterior input.
 
Array2D< double > samForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)
 Sample forward function at a given grid for given posterior input.
 
void momForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of forward function at a given grid for given posterior input.
 
void momForwardFcn (Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of composite forward function at a given grid for given posterior input.
 
+ + + + +

+Private Attributes

double nugget_
 Nugget size.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Post
Array2D< double > xData_
 xdata
 
Array1D< Array1D< double > > yData_
 ydata
 
Array1D< double > yDatam_
 ydata averaged per measurement
 
int nData_
 Number of data points.
 
Array1D< int > nEachs_
 Number of samples at each input.
 
int xDim_
 Dimensionality of x-space.
 
int pDim_
 Dimensionality of parameter space (p-space)
 
int chDim_
 Dimensionality of posterior input.
 
bool inferDataNoise_
 Flag for data noise inference.
 
bool dataNoiseLogFlag_
 Flag to check if data noise logarithm is used.
 
Array1D< double > dataNoiseSig_
 Data noise stdev.
 
Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFcns_
 Pointer to the forward function f(p,x)
 
void * funcinfo_
 Auxiliary information for function evaluation.
 
int extraInferredParams_
 Number of extra inferred parameters, such as data noise or Koh variance.
 
int ncat_
 Number of categories.
 
Mrv * Mrv_
 Pointer to a multivariate PC RV object.
 
Array1D< int > rndInd_
 Indices of randomized inputs.
 
Array2D< double > fixIndNom_
 Indices and nominal values for fixed inputs.
 
Array1D< double > lower_
 Lower and upper bounds on parameters.
 
Array1D< double > upper_
 
string pdfType_
 Input parameter PDF type.
 
string rvpcType_
 PC type parameter for the r.v.
 
string priorType_
 Prior type.
 
double priora_
 Prior parameter #1.
 
double priorb_
 Prior parameter #2.
 
+

Detailed Description

+

Derived class for mvn likelihood.

+

Constructor & Destructor Documentation

+ +

◆ Lik_MVN()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_MVN::Lik_MVN (double nugget)
+ 		+inline
+
+ +

Constructor given fiagonal nugget.

+ +
+
+ +

◆ ~Lik_MVN()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_MVN::~Lik_MVN ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ evalLogLik()

+ +
+
+ + + + + +
+ + + + + + + +
double Lik_MVN::evalLogLik (Array1D< double > & m)
+ 		+virtual
+
+ +

Evaluate log-likelihood.

+ +

Reimplemented from Post.

+ +
+
+

Member Data Documentation

+ +

◆ nugget_

+ +
+
+ + + + + +
+ + + + +
double Lik_MVN::nugget_
+ 		+private
+
+ +

Nugget size.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__MVN.png b/docs/html/classLik__MVN.png new file mode 100644 index 0000000000000000000000000000000000000000..2681fb64878724a7b535c0fe975a3d399aa7a5e7 GIT binary patch literal 355 zcmeAS@N?(olHy`uVBq!ia0vp^4nQ2h!3-qlB{r7>Dd_;85ZC|z{{xvX-h3_XKeXJ! zK(jz%`k5CG9y|bwo1P6@0+iz{3GxeO0P?}WoN4wIpx`@C7srqa#tX$-=GbB{M_Hat{V^lp#unud!_$_nB_>zZeM zb1=E$>2f9gGp|&^B`4-2ZnX!M+_nWDc&{ASs8@{bSYcgjY&n53EzOyMVcJdx2Az#e z*HcB-94O!GYrw4kgPYIdK?5`2AIXM}49*1|Cn{wE9Cnu`Rj&A4Wx%v6u;N61xr2;v z!bdBWV%ZaPVxO>zs+=M0{%elF{r5}E*bsgVc( literal 0 HcmV?d00001 diff --git a/docs/html/classLik__Marg-members.html b/docs/html/classLik__Marg-members.html new file mode 100644 index 00000000..50e083f0 --- /dev/null +++ b/docs/html/classLik__Marg-members.html @@ -0,0 +1,119 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Lik_Marg Member List
+
+
+ +

This is the complete list of members for Lik_Marg, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bdw_Lik_Margprivate
chDim_Postprotected
dataNoiseLogFlag_Postprotected
dataNoiseSig_Postprotected
dataSigma(double m_last)Post
evalLogLik(Array1D< double > &m)Lik_Margvirtual
evalLogPrior(Array1D< double > &m)Post
extraInferredParams_Postprotected
fixIndNom_Postprotected
forwardFcns_Postprotected
funcinfo_Postprotected
getChainDim()Post
getParamPCcf(Array1D< double > &m)Post
inferDataNoise()Post
inferDataNoise_Postprotected
inferLogDataNoise()Post
Lik_Marg(double bdw, int nsam)Lik_Marginline
lower_Postprotected
momForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momForwardFcn(Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momParam(Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)Post
Mrv_Postprotected
ncat_Postprotected
nData_Postprotected
nEachs_Postprotected
nsam_Lik_Margprivate
pdfType_Postprotected
pDim_Postprotected
Post()Post
priora_Postprotected
priorb_Postprotected
priorType_Postprotected
rndInd_Postprotected
rvpcType_Postprotected
samForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)Post
samParam(Array1D< double > &m, int ns)Post
setData(Array2D< double > &xdata, Array2D< double > &ydata)Post
setData(Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)Post
setDataNoise(Array1D< double > &sigma)Post
setModel(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)Post
setModelRVinput(int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)Post
setPrior(string priorType, double priora, double priorb)Post
upper_Postprotected
verbosity_Postprivate
xData_Postprotected
xDim_Postprotected
yData_Postprotected
yDatam_Postprotected
~Lik_Marg()Lik_Marginline
~Post()Postinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__Marg.html b/docs/html/classLik__Marg.html new file mode 100644 index 00000000..d1087009 --- /dev/null +++ b/docs/html/classLik__Marg.html @@ -0,0 +1,386 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Lik_Marg Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
Lik_Marg Class Reference
+
+
+ +

Derived class for marginal likelihood. + More...

+ +

#include <post.h>

+
+Inheritance diagram for Lik_Marg:
+
+
+ + +Post + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Lik_Marg (double bdw, int nsam)
 Constructor given KDE bandwidth and sample size.
 
 ~Lik_Marg ()
 Destructor.
 
double evalLogLik (Array1D< double > &m)
 Evaluate log-likelihood.
 
- Public Member Functions inherited from Post
 Post ()
 Constructor.
 
 ~Post ()
 Destructor.
 
void setData (Array2D< double > &xdata, Array2D< double > &ydata)
 Set the x- and y-data.
 
void setData (Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)
 Set the x- and y-data, for the case when each datapoint have different number of measurements.
 
void setDataNoise (Array1D< double > &sigma)
 Set the magnitude of data noise.
 
void inferDataNoise ()
 Indicate inference of data noise stdev.
 
void inferLogDataNoise ()
 Indicate inference of log of data noise stdev.
 
Array1D< double > dataSigma (double m_last)
 Get data noise, whether inferred or fixed.
 
void setModel (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)
 Set a pointer to the forward model f(p,x)
 
void setModelRVinput (int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)
 Set model input parameters' randomization scheme.
 
int getChainDim ()
 Get the dimensionailty of the posterior function.
 
void setPrior (string priorType, double priora, double priorb)
 Set the prior type and its parameters.
 
double evalLogPrior (Array1D< double > &m)
 Evaluate log-prior.
 
Array2D< double > getParamPCcf (Array1D< double > &m)
 Extract parameter PC coefficients from a posterior input.
 
Array2D< double > samParam (Array1D< double > &m, int ns)
 Sample model parameters given posterior input.
 
void momParam (Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)
 Get moments of parameters given posterior input.
 
Array2D< double > samForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)
 Sample forward function at a given grid for given posterior input.
 
void momForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of forward function at a given grid for given posterior input.
 
void momForwardFcn (Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of composite forward function at a given grid for given posterior input.
 
+ + + + + + + +

+Private Attributes

double bdw_
 KDE bandwidth.
 
int nsam_
 KDE sample size.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Post
Array2D< double > xData_
 xdata
 
Array1D< Array1D< double > > yData_
 ydata
 
Array1D< double > yDatam_
 ydata averaged per measurement
 
int nData_
 Number of data points.
 
Array1D< int > nEachs_
 Number of samples at each input.
 
int xDim_
 Dimensionality of x-space.
 
int pDim_
 Dimensionality of parameter space (p-space)
 
int chDim_
 Dimensionality of posterior input.
 
bool inferDataNoise_
 Flag for data noise inference.
 
bool dataNoiseLogFlag_
 Flag to check if data noise logarithm is used.
 
Array1D< double > dataNoiseSig_
 Data noise stdev.
 
Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFcns_
 Pointer to the forward function f(p,x)
 
void * funcinfo_
 Auxiliary information for function evaluation.
 
int extraInferredParams_
 Number of extra inferred parameters, such as data noise or Koh variance.
 
int ncat_
 Number of categories.
 
Mrv * Mrv_
 Pointer to a multivariate PC RV object.
 
Array1D< int > rndInd_
 Indices of randomized inputs.
 
Array2D< double > fixIndNom_
 Indices and nominal values for fixed inputs.
 
Array1D< double > lower_
 Lower and upper bounds on parameters.
 
Array1D< double > upper_
 
string pdfType_
 Input parameter PDF type.
 
string rvpcType_
 PC type parameter for the r.v.
 
string priorType_
 Prior type.
 
double priora_
 Prior parameter #1.
 
double priorb_
 Prior parameter #2.
 
+

Detailed Description

+

Derived class for marginal likelihood.

+

Constructor & Destructor Documentation

+ +

◆ Lik_Marg()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
Lik_Marg::Lik_Marg (double bdw,
int nsam )
+ 		+inline
+
+ +

Constructor given KDE bandwidth and sample size.

+ +
+
+ +

◆ ~Lik_Marg()

+ +
+
+ + + + + +
+ + + + + + + +
Lik_Marg::~Lik_Marg ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ evalLogLik()

+ +
+
+ + + + + +
+ + + + + + + +
double Lik_Marg::evalLogLik (Array1D< double > & m)
+ 		+virtual
+
+ +

Evaluate log-likelihood.

+ +

Reimplemented from Post.

+ +
+
+

Member Data Documentation

+ +

◆ bdw_

+ +
+
+ + + + + +
+ + + + +
double Lik_Marg::bdw_
+ 		+private
+
+ +

KDE bandwidth.

+ +
+
+ +

◆ nsam_

+ +
+
+ + + + + +
+ + + + +
int Lik_Marg::nsam_
+ 		+private
+
+ +

KDE sample size.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLik__Marg.png b/docs/html/classLik__Marg.png new file mode 100644 index 0000000000000000000000000000000000000000..124077ca480b79958e09c6b2eae575cfe72b137b GIT binary patch literal 382 zcmeAS@N?(olHy`uVBq!ia0vp^jzAp1!3-n|7r*cXQqloFA+G=b{|7Q(y!l$%e`vXd zfo6fk^fNCWJa_;UH$5A+1SrQ@666=m0OW&#In(Sb3=E8%o-U3d6^w7^-tKEQ;Bh(L z*YfQD{tE84W1J6z_V7=ArKPT+{ro}qjr1u&UK}E!R~a%bOi%m?zMA&-UqP0{-HNn` z;F;eY!_0ZQkLZS8?d!G+IlNeFRpLsew2A=N?21e5*C*tPZCkm@?8)@0ZRY~KGzA$R zOyOj3YT>;s657J6?-(FxUUO9E(gZe!(xr;LnG6ln;te}GS{f##G?TE8V9uU&HbjYT%wdGr{yAGa-B z`zTjnl5M$F + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
LogPosteriorBase Member List
+
+
+ +

This is the complete list of members for LogPosteriorBase, including all inherited members.

+ + + +
eval(Array1D< double > &)LogPosteriorBaseinlinevirtual
~LogPosteriorBase()LogPosteriorBaseinlinevirtual
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLogPosteriorBase.html b/docs/html/classLogPosteriorBase.html new file mode 100644 index 00000000..3ef23808 --- /dev/null +++ b/docs/html/classLogPosteriorBase.html @@ -0,0 +1,134 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: LogPosteriorBase Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +List of all members
+
LogPosteriorBase Class Reference
+
+
+ +

#include <mcmc.h>

+ + + + + + +

+Public Member Functions

virtual double eval (Array1D< double > &)
 
virtual ~LogPosteriorBase ()
 
+

Constructor & Destructor Documentation

+ +

◆ ~LogPosteriorBase()

+ +
+
+ + + + + +
+ + + + + + + +
virtual LogPosteriorBase::~LogPosteriorBase ()
+ 		+inlinevirtual
+
+ +
+
+

Member Function Documentation

+ +

◆ eval()

+ +
+
+ + + + + +
+ + + + + + + +
virtual double LogPosteriorBase::eval (Array1D< double > & )
+ 		+inlinevirtual
+
+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLreg-members.html b/docs/html/classLreg-members.html new file mode 100644 index 00000000..5b4e2f2a --- /dev/null +++ b/docs/html/classLreg-members.html @@ -0,0 +1,121 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Lreg Member List
+
+
+ +

This is the complete list of members for Lreg, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
A_Lregprotected
A_inv_Lregprotected
BCS_BuildRegr(Array1D< int > &selected, double eta)Lreg
bdata_Lregprotected
coef_Lregprotected
coef_cov_Lregprotected
coef_erb_Lregprotected
computeErrorMetrics(string method)Lreg
computeRVE(Array2D< double > &xval, Array1D< double > &yval, Array1D< double > &yval_regr)Lreg
dataSetFlag_Lregprivate
diagP_Lregprotected
diagPFlag_Lregprotected
EvalBases(Array2D< double > &xx, Array2D< double > &bb)Lreginlinevirtual
EvalRegr(Array2D< double > &xcheck, Array1D< double > &ycheck, Array1D< double > &yvar, Array2D< double > &ycov)Lreg
GetCoef(Array1D< double > &coef)Lreginline
GetCoefCov(Array2D< double > &coef_cov)Lreginline
getDiagP()Lreg
GetMindex(Array2D< int > &mindex)Lreginlinevirtual
GetNbas() constLreginline
GetNdim() constLreginline
GetNpt() constLreginline
getResid()Lreg
GetSigma2() constLreginline
Hty_Lregprotected
InitRegr()Lreg
Lreg()Lreginline
LSQ_BuildRegr()Lreg
LSQ_computeBestLambda()Lreg
LSQ_computeBestLambdas()Lreg
LSQ_computeGCV()Lregprivate
LSQ_computeLOO()Lregprivate
nbas_Lregprotected
ndim_Lregprotected
npt_Lregprotected
Proj(Array1D< double > &array, Array1D< double > &proj_array)Lreg
regMode_Lregprivate
resid_Lregprotected
residFlag_Lregprotected
SetCenters(Array2D< double > &centers)Lreginlinevirtual
SetMindex(Array2D< int > &mindex)Lreginlinevirtual
SetParamsRBF()Lreginlinevirtual
SetRegMode(string regmode)Lreginline
SetRegWeights(Array1D< double > &weights)Lreg
SetupData(Array2D< double > &xdata, Array1D< double > &ydata)Lreg
SetupData(Array2D< double > &xdata, Array2D< double > &ydata)Lreg
SetWidths(Array1D< double > &widths)Lreginlinevirtual
sigma2_Lregprotected
StripBases(Array1D< int > &used)Lreginlinevirtual
weights_Lregprotected
xdata_Lregprotected
ydata_Lregprotected
~Lreg()Lreginline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLreg.html b/docs/html/classLreg.html new file mode 100644 index 00000000..39024361 --- /dev/null +++ b/docs/html/classLreg.html @@ -0,0 +1,1535 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Lreg Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Protected Attributes | +Private Member Functions | +Private Attributes | +List of all members
+
Lreg Class Reference
+
+
+ +

Class for linear parameteric regression. + More...

+ +

#include <lreg.h>

+
+Inheritance diagram for Lreg:
+
+
+ + +PCreg +PLreg +RBFreg + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Lreg ()
 Constructor.
 
 ~Lreg ()
 Destrcutor.
 
virtual void SetMindex (Array2D< int > &mindex)
 Set multiindex.
 
virtual void GetMindex (Array2D< int > &mindex)
 Get multiindex.
 
virtual void SetCenters (Array2D< double > &centers)
 Set centers (for RBF)
 
virtual void SetWidths (Array1D< double > &widths)
 Set widths (for RBF)
 
virtual void SetParamsRBF ()
 Set parameters (for RBF)
 
virtual void EvalBases (Array2D< double > &xx, Array2D< double > &bb)
 Evaluate bases.
 
virtual void StripBases (Array1D< int > &used)
 Strip bases.
 
void InitRegr ()
 Initialize.
 
void SetupData (Array2D< double > &xdata, Array1D< double > &ydata)
 Setup data (1d ydata)
 
void SetupData (Array2D< double > &xdata, Array2D< double > &ydata)
 Setup data (2d ydata)
 
void SetRegMode (string regmode)
 Set the regression mode.
 
void SetRegWeights (Array1D< double > &weights)
 Set weights.
 
void BCS_BuildRegr (Array1D< int > &selected, double eta)
 Build BCS regression.
 
void LSQ_BuildRegr ()
 Build LSQ regression.
 
void EvalRegr (Array2D< double > &xcheck, Array1D< double > &ycheck, Array1D< double > &yvar, Array2D< double > &ycov)
 Evaluate the regression expansion.
 
int GetNpt () const
 Get the number of points.
 
int GetNdim () const
 Get dimensionality.
 
int GetNbas () const
 Get the number of bases.
 
double GetSigma2 () const
 Get the variance of the data.
 
void GetCoefCov (Array2D< double > &coef_cov)
 Get coefficient covariance.
 
void GetCoef (Array1D< double > &coef)
 Get coefficients.
 
void Proj (Array1D< double > &array, Array1D< double > &proj_array)
 Project.
 
Array1D< double > LSQ_computeBestLambdas ()
 Compute the best values for regulariation parameter vector lambda, for LSQ.
 
double LSQ_computeBestLambda ()
 Compute the best value for regulariation parameter lambda, for LSQ.
 
void getResid ()
 Compute the residual vector, if not already computed.
 
void getDiagP ()
 Compute the diagonal of projection matrix, if not already computed.
 
Array1D< double > computeErrorMetrics (string method)
 Compote error according to a selected metrics.
 
double computeRVE (Array2D< double > &xval, Array1D< double > &yval, Array1D< double > &yval_regr)
 Compute validation error.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

Array2D< double > xdata_
 xdata array
 
Array1D< double > ydata_
 ydata array
 
int npt_
 Number of samples.
 
int nbas_
 Number of bases.
 
int ndim_
 Dimensionality.
 
Array1D< double > sigma2_
 Variance.
 
Array1D< double > weights_
 Weights.
 
Array1D< double > resid_
 Residuals.
 
bool residFlag_
 Flag to indicate whether residual is computed.
 
Array1D< double > diagP_
 Diagonal of projection matrix.
 
bool diagPFlag_
 Flag to indicate whether diagonal of projetion matrix is computed.
 
Array2D< double > bdata_
 Auxiliary matrix or vector; see UQTk Manual.
 
Array2D< double > A_
 
Array2D< double > A_inv_
 
Array2D< double > coef_cov_
 
Array1D< double > Hty_
 
Array1D< double > coef_
 
Array1D< double > coef_erb_
 
+ + + + + + + +

+Private Member Functions

double LSQ_computeLOO ()
 Compute Leave-one-out error for LSQ.
 
double LSQ_computeGCV ()
 COmpute generalized-cross-validation error for LSQ.
 
+ + + + + + + +

+Private Attributes

bool dataSetFlag_
 Flag to indicate whether data has been set or not.
 
string regMode_
 Regression mode (m, ms, msc for mean-only, mean+variance, mean+covariance)
 
+

Detailed Description

+

Class for linear parameteric regression.

+

Constructor & Destructor Documentation

+ +

◆ Lreg()

+ +
+
+ + + + + +
+ + + + + + + +
Lreg::Lreg ()
+ 		+inline
+
+ +

Constructor.

+ +
+
+ +

◆ ~Lreg()

+ +
+
+ + + + + +
+ + + + + + + +
Lreg::~Lreg ()
+ 		+inline
+
+ +

Destrcutor.

+ +
+
+

Member Function Documentation

+ +

◆ BCS_BuildRegr()

+ +
+
+ + + + + + + + + + + +
void Lreg::BCS_BuildRegr (Array1D< int > & selected,
double eta )
+
+ +

Build BCS regression.

+ +
+
+ +

◆ computeErrorMetrics()

+ +
+
+ + + + + + + +
Array1D< double > Lreg::computeErrorMetrics (string method)
+
+ +

Compote error according to a selected metrics.

+ +
+
+ +

◆ computeRVE()

+ +
+
+ + + + + + + + + + + + + + + + +
double Lreg::computeRVE (Array2D< double > & xval,
Array1D< double > & yval,
Array1D< double > & yval_regr )
+
+ +

Compute validation error.

+ +
+
+ +

◆ EvalBases()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
virtual void Lreg::EvalBases (Array2D< double > & xx,
Array2D< double > & bb )
+ 		+inlinevirtual
+
+ +

Evaluate bases.

+ +

Reimplemented in PCreg, PLreg, and RBFreg.

+ +
+
+ +

◆ EvalRegr()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void Lreg::EvalRegr (Array2D< double > & xcheck,
Array1D< double > & ycheck,
Array1D< double > & yvar,
Array2D< double > & ycov )
+
+ +

Evaluate the regression expansion.

+ +
+
+ +

◆ GetCoef()

+ +
+
+ + + + + +
+ + + + + + + +
void Lreg::GetCoef (Array1D< double > & coef)
+ 		+inline
+
+ +

Get coefficients.

+ +
+
+ +

◆ GetCoefCov()

+ +
+
+ + + + + +
+ + + + + + + +
void Lreg::GetCoefCov (Array2D< double > & coef_cov)
+ 		+inline
+
+ +

Get coefficient covariance.

+ +
+
+ +

◆ getDiagP()

+ +
+
+ + + + + + + +
void Lreg::getDiagP ()
+
+ +

Compute the diagonal of projection matrix, if not already computed.

+ +
+
+ +

◆ GetMindex()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void Lreg::GetMindex (Array2D< int > & mindex)
+ 		+inlinevirtual
+
+ +

Get multiindex.

+ +

Reimplemented in PCreg, and PLreg.

+ +
+
+ +

◆ GetNbas()

+ +
+
+ + + + + +
+ + + + + + + +
int Lreg::GetNbas () const
+ 		+inline
+
+ +

Get the number of bases.

+ +
+
+ +

◆ GetNdim()

+ +
+
+ + + + + +
+ + + + + + + +
int Lreg::GetNdim () const
+ 		+inline
+
+ +

Get dimensionality.

+ +
+
+ +

◆ GetNpt()

+ +
+
+ + + + + +
+ + + + + + + +
int Lreg::GetNpt () const
+ 		+inline
+
+ +

Get the number of points.

+ +
+
+ +

◆ getResid()

+ +
+
+ + + + + + + +
void Lreg::getResid ()
+
+ +

Compute the residual vector, if not already computed.

+ +
+
+ +

◆ GetSigma2()

+ +
+
+ + + + + +
+ + + + + + + +
double Lreg::GetSigma2 () const
+ 		+inline
+
+ +

Get the variance of the data.

+ +
+
+ +

◆ InitRegr()

+ +
+
+ + + + + + + +
void Lreg::InitRegr ()
+
+ +

Initialize.

+ +
+
+ +

◆ LSQ_BuildRegr()

+ +
+
+ + + + + + + +
void Lreg::LSQ_BuildRegr ()
+
+ +

Build LSQ regression.

+ +
+
+ +

◆ LSQ_computeBestLambda()

+ +
+
+ + + + + + + +
double Lreg::LSQ_computeBestLambda ()
+
+ +

Compute the best value for regulariation parameter lambda, for LSQ.

+ +
+
+ +

◆ LSQ_computeBestLambdas()

+ +
+
+ + + + + + + +
Array1D< double > Lreg::LSQ_computeBestLambdas ()
+
+ +

Compute the best values for regulariation parameter vector lambda, for LSQ.

+ +
+
+ +

◆ LSQ_computeGCV()

+ +
+
+ + + + + +
+ + + + + + + +
double Lreg::LSQ_computeGCV ()
+ 		+private
+
+ +

COmpute generalized-cross-validation error for LSQ.

+ +
+
+ +

◆ LSQ_computeLOO()

+ +
+
+ + + + + +
+ + + + + + + +
double Lreg::LSQ_computeLOO ()
+ 		+private
+
+ +

Compute Leave-one-out error for LSQ.

+ +
+
+ +

◆ Proj()

+ +
+
+ + + + + + + + + + + +
void Lreg::Proj (Array1D< double > & array,
Array1D< double > & proj_array )
+
+ +

Project.

+ +
+
+ +

◆ SetCenters()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void Lreg::SetCenters (Array2D< double > & centers)
+ 		+inlinevirtual
+
+ +

Set centers (for RBF)

+ +

Reimplemented in RBFreg.

+ +
+
+ +

◆ SetMindex()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void Lreg::SetMindex (Array2D< int > & mindex)
+ 		+inlinevirtual
+
+ +

Set multiindex.

+ +

Reimplemented in PCreg, and PLreg.

+ +
+
+ +

◆ SetParamsRBF()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void Lreg::SetParamsRBF ()
+ 		+inlinevirtual
+
+ +

Set parameters (for RBF)

+ +
+
+ +

◆ SetRegMode()

+ +
+
+ + + + + +
+ + + + + + + +
void Lreg::SetRegMode (string regmode)
+ 		+inline
+
+ +

Set the regression mode.

+ +
+
+ +

◆ SetRegWeights()

+ +
+
+ + + + + + + +
void Lreg::SetRegWeights (Array1D< double > & weights)
+
+ +

Set weights.

+ +
+
+ +

◆ SetupData() [1/2]

+ +
+
+ + + + + + + + + + + +
void Lreg::SetupData (Array2D< double > & xdata,
Array1D< double > & ydata )
+
+ +

Setup data (1d ydata)

+ +
+
+ +

◆ SetupData() [2/2]

+ +
+
+ + + + + + + + + + + +
void Lreg::SetupData (Array2D< double > & xdata,
Array2D< double > & ydata )
+
+ +

Setup data (2d ydata)

+ +
+
+ +

◆ SetWidths()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void Lreg::SetWidths (Array1D< double > & widths)
+ 		+inlinevirtual
+
+ +

Set widths (for RBF)

+ +

Reimplemented in RBFreg.

+ +
+
+ +

◆ StripBases()

+ +
+
+ + + + + +
+ + + + + + + +
virtual void Lreg::StripBases (Array1D< int > & used)
+ 		+inlinevirtual
+
+ +

Strip bases.

+ +

Reimplemented in PCreg, PLreg, and RBFreg.

+ +
+
+

Member Data Documentation

+ +

◆ A_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Lreg::A_
+ 		+protected
+
+ +
+
+ +

◆ A_inv_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Lreg::A_inv_
+ 		+protected
+
+ +
+
+ +

◆ bdata_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Lreg::bdata_
+ 		+protected
+
+ +

Auxiliary matrix or vector; see UQTk Manual.

+ +
+
+ +

◆ coef_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Lreg::coef_
+ 		+protected
+
+ +
+
+ +

◆ coef_cov_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Lreg::coef_cov_
+ 		+protected
+
+ +
+
+ +

◆ coef_erb_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Lreg::coef_erb_
+ 		+protected
+
+ +
+
+ +

◆ dataSetFlag_

+ +
+
+ + + + + +
+ + + + +
bool Lreg::dataSetFlag_
+ 		+private
+
+ +

Flag to indicate whether data has been set or not.

+ +
+
+ +

◆ diagP_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Lreg::diagP_
+ 		+protected
+
+ +

Diagonal of projection matrix.

+ +
+
+ +

◆ diagPFlag_

+ +
+
+ + + + + +
+ + + + +
bool Lreg::diagPFlag_
+ 		+protected
+
+ +

Flag to indicate whether diagonal of projetion matrix is computed.

+ +
+
+ +

◆ Hty_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Lreg::Hty_
+ 		+protected
+
+ +
+
+ +

◆ nbas_

+ +
+
+ + + + + +
+ + + + +
int Lreg::nbas_
+ 		+protected
+
+ +

Number of bases.

+ +
+
+ +

◆ ndim_

+ +
+
+ + + + + +
+ + + + +
int Lreg::ndim_
+ 		+protected
+
+ +

Dimensionality.

+ +
+
+ +

◆ npt_

+ +
+
+ + + + + +
+ + + + +
int Lreg::npt_
+ 		+protected
+
+ +

Number of samples.

+ +
+
+ +

◆ regMode_

+ +
+
+ + + + + +
+ + + + +
string Lreg::regMode_
+ 		+private
+
+ +

Regression mode (m, ms, msc for mean-only, mean+variance, mean+covariance)

+ +
+
+ +

◆ resid_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Lreg::resid_
+ 		+protected
+
+ +

Residuals.

+ +
+
+ +

◆ residFlag_

+ +
+
+ + + + + +
+ + + + +
bool Lreg::residFlag_
+ 		+protected
+
+ +

Flag to indicate whether residual is computed.

+ +
+
+ +

◆ sigma2_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Lreg::sigma2_
+ 		+protected
+
+ +

Variance.

+ +
+
+ +

◆ weights_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Lreg::weights_
+ 		+protected
+
+ +

Weights.

+ +
+
+ +

◆ xdata_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Lreg::xdata_
+ 		+protected
+
+ +

xdata array

+ +
+
+ +

◆ ydata_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Lreg::ydata_
+ 		+protected
+
+ +

ydata array

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classLreg.png b/docs/html/classLreg.png new file mode 100644 index 0000000000000000000000000000000000000000..ca12276e9c7da821a121b4a2e99f2d5c4a80d3f0 GIT binary patch literal 620 zcmeAS@N?(olHy`uVBq!ia0vp^JApWWgBeH`S*WN0Dd_;85ZC|z{{xvX-h3_XKeXJ! zK(jz%`k5CG9y|bwo1P6@0+iz{3GxeO0P?}WoN4wI1_s9Oo-U3d6^w7^UYxYbK!DX+ zJ@m?-|Kjni;mT^lSF+<~@o#3MvH!)F4&VN zx#;|KzQ}nAEA}2ev*yr@XU$)B&b&D*`f|@r-L!8dAj1;*3UrufFP}0=zTvYGBhSeV z&n}y+`nBPi_(#X9$4&e9vOdT-B=aBwfe#!t@x45q@x_C;s=uQgW-xyde8!-6Nalbm zCi9<}!t*)OK9ptnqGP{rdhujKn zAH>DP-S+f>zC)uxc_dN z_s{EZP4chpKC@bLtDXM!J!@`me73r!?C(9h{N;Pr{9OH0Xv6tEMQg8{U)xi2x+`zx z(l-Y6l2&I|f8A%de(9An^UWp8=bP_dy8HZU&Ct)k>*}iK)>fb1b^mVl>0hO*m+#oO zaQ3rFU%2GU1|M5zVwp&Husj23&3>2;OXk;vd$@?2>`h5JLUiY literal 0 HcmV?d00001 diff --git a/docs/html/classMCMC-members.html b/docs/html/classMCMC-members.html new file mode 100644 index 00000000..75744bf4 --- /dev/null +++ b/docs/html/classMCMC-members.html @@ -0,0 +1,173 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
MCMC Member List
+
+
+ +

This is the complete list of members for MCMC, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
accRatio_MCMCprivate
addCurrentState()MCMCprotected
appendMAP()MCMC
chainDim_MCMCprivate
chaindimInit_MCMCprivate
chcovMCMCprivate
currState_MCMCprivate
evalLogPosterior(Array1D< double > &m)MCMC
fcnAccept_MCMCprivate
fcnAcceptFlag_MCMCprivate
fcnReject_MCMCprivate
fcnRejectFlag_MCMCprivate
FLAGMCMCprivate
fullChain_MCMCprivate
getAcceptRatio(double *accrat)MCMC
getAcceptRatio()MCMC
GetChainDim() constMCMC
getChainPropCov(Array2D< double > &propcov)MCMC
getCurrentStatePost()MCMC
getCurrentStateState(Array1D< double > &state)MCMC
getDimInit()MCMC
getFcnAccept(void(*fcnAccept)(void *))MCMC
getFcnAcceptInit()MCMC
getFcnReject(void(*fcnReject)(void *))MCMC
getFcnRejectInit()MCMC
getFileFreq()MCMC
getFilename()MCMC
getFullChain(Array1D< chainstate > &readchain)MCMC
getFullChainSize()MCMC
getLastWrite()MCMC
getLower(int i)MCMC
getLowerFlag(int i)MCMC
getMode(Array1D< double > &MAPparams)MCMC
getModeStatePost()MCMC
getModeStateState(Array1D< double > &state)MCMC
getNamesPrepended()MCMC
getNSubSteps()MCMCinlinevirtual
getOutputInit()MCMC
getOutputType()MCMC
getPostInfo(void *post)MCMC
getPropCovInit()MCMC
getSamples(int burnin, int every, Array2D< double > &samples)MCMC
getSamples(Array2D< double > &samples)MCMC
getScreenFreq()MCMC
getSeed()MCMC
getUpper(int i)MCMC
getUpperFlag(int i)MCMC
getWriteFlag()MCMC
inDomain(Array1D< double > &m)MCMC
initChainPropCov(Array2D< double > &propcov)MCMC
initChainPropCovDiag(Array1D< double > &sig)MCMC
L_MCMCprivate
lastwrite_MCMCprivate
logPosterior_MCMCprivate
Lower_MCMCprivate
lower_flag_MCMCprivate
MCMC(double(*logposterior)(Array1D< double > &, void *), void *postinfo)MCMC
MCMC(LogPosteriorBase &L)MCMC
MCMC()MCMC
methodInit_MCMCprivate
modeState_MCMCprivate
namesPrependMCMCprivate
namesPrepended()MCMC
newMode_MCMCprivate
newModeFound()MCMC
outputinfo_MCMCprivate
outputInit_MCMCprivate
parseBinChain(string filename, Array1D< chainstate > &readchain)MCMC
postInfo_MCMCprivate
probOldNew(Array1D< double > &a, Array1D< double > &b)MCMCinlineprivatevirtual
propcovInit_MCMCprivate
RandomStateMCMCprotected
resetChainFilename(string filename)MCMC
resetChainState()MCMC
runAcceptFcn()MCMC
runChain(int ncalls, Array1D< double > &chstart)=0MCMCpure virtual
runChain(int ncalls)=0MCMCpure virtual
runOptim(Array1D< double > &start)MCMCvirtual
runRejectFcn()MCMC
seed_MCMCprivate
setAcceptRatio(double d)MCMCprotected
setChainDim(int chdim)MCMC
setCurrentStateAlfa(double newAlfa)MCMC
setCurrentStatePost(double newPost)MCMC
setCurrentStateState(Array1D< double > &newState)MCMC
setCurrentStateStep(int i)MCMC
setDefaultDomain()MCMC
setFcnAccept(void(*fcnAccept)(void *))MCMC
setFcnReject(void(*fcnReject)(void *))MCMC
setLastWrite(int i)MCMCprotected
setLower(double lower, int i)MCMC
setNewMode(bool value)MCMC
setOutputInfo(string outtype, string file, int freq_file, int freq_screen)MCMC
setPostInfo(void *postinfo)MCMC
setSeed(int seed)MCMC
setUpper(double upper, int i)MCMC
setWriteFlag(int I)MCMC
updateMode()MCMCprotected
Upper_MCMCprivate
upper_flag_MCMCprivate
WRITE_FLAGMCMCprivate
writeChainBin(string filename)MCMC
writeChainTxt(string filename)MCMC
writeFullChainTxt(string filename, Array1D< chainstate > fullchain)MCMC
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classMCMC.html b/docs/html/classMCMC.html new file mode 100644 index 00000000..37d9313b --- /dev/null +++ b/docs/html/classMCMC.html @@ -0,0 +1,2593 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: MCMC Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Classes | +Public Member Functions | +Protected Member Functions | +Protected Attributes | +Private Member Functions | +Private Attributes | +List of all members
+
MCMC Class Referenceabstract
+
+
+ +

Markov Chain Monte Carlo base class. Implemented the basic and most general MCMC algorithms. + More...

+ +

#include <mcmc.h>

+ + + + + + +

+Classes

struct  chainstate
 
struct  outputInfo
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 MCMC (double(*logposterior)(Array1D< double > &, void *), void *postinfo)
 Constructor when given a pointer to a logPosterior function and a pointer to additional information (e.g. data)
 
 MCMC (LogPosteriorBase &L)
 Constructor when given a LogPosterior Base class object.
 
 MCMC ()
 Dummy Constructor, used for TMCMC.
 
void setWriteFlag (int I)
 Set the write flag function given an integer.
 
void setFcnAccept (void(*fcnAccept)(void *))
 Set the accept and reject functions.
 
void setFcnReject (void(*fcnReject)(void *))
 
void setChainDim (int chdim)
 Set the dimensions of the chain given an integer.
 
void initChainPropCov (Array2D< double > &propcov)
 Initialize proposal covariance matrix given as a 2d-array For aMCMC, this matrix is used only before adaptivity starts.
 
void initChainPropCovDiag (Array1D< double > &sig)
 Initialize proposal covariance matrix given its 1d-array diagonal For aMCMC, this matrix is used only before adaptivity starts.
 
void setOutputInfo (string outtype, string file, int freq_file, int freq_screen)
 Set output specification struct, type('txt' or 'bin'), filename, frequency of outputs to the file and to screen.
 
void namesPrepended ()
 Set the indicator to confirm that the names of parameters are prepended in the output file.
 
void setSeed (int seed)
 Set random generation seed.
 
void setLower (double lower, int i)
 Set lower bound at the index of i.
 
void setUpper (double upper, int i)
 Set upper bound at the index of i.
 
void setDefaultDomain ()
 Set default unbounded domain.
 
void setPostInfo (void *postinfo)
 Set the Posterior Info pointer.
 
void getChainPropCov (Array2D< double > &propcov)
 Returns proposal covariance matrix.
 
string getFilename ()
 Get the name of the chain file.
 
int getWriteFlag ()
 Get the value of the write flag as an integer.
 
void getSamples (int burnin, int every, Array2D< double > &samples)
 Get samples of the chain with burnin and thining.
 
void getSamples (Array2D< double > &samples)
 Get all samples of the chain.
 
void getFcnAccept (void(*fcnAccept)(void *))
 Get the accept and reject functions given a pointer.
 
void getFcnReject (void(*fcnReject)(void *))
 
string getOutputType ()
 Get the output file type as a string.
 
int getFileFreq ()
 Get the frequency of output to file.
 
int getScreenFreq ()
 Get the frequency of output to the screen.
 
bool getNamesPrepended ()
 Get if the names are prepended.
 
int getSeed ()
 Get the seed used for random generation.
 
double getLower (int i)
 Get the lower bounds based on an index i.
 
double getUpper (int i)
 Get the upper bounds based on an index i.
 
bool getDimInit ()
 Get if the Chain Dimensions are initialized.
 
void getPostInfo (void *post)
 Get post info pointer.
 
bool getPropCovInit ()
 Get if the Prop Cov has been initialized.
 
bool getOutputInit ()
 Get if the output info has been initialized.
 
int getLastWrite ()
 Get last write.
 
bool getFcnAcceptInit ()
 Get if the accept and reject functions are initialized.
 
bool getFcnRejectInit ()
 
virtual int getNSubSteps ()
 Get function for number of sub steps.
 
int getLowerFlag (int i)
 Get function for the lower and upper Flag at index i.
 
int getUpperFlag (int i)
 
void getAcceptRatio (double *accrat)
 Get the chain's acceptance ratio.
 
double getAcceptRatio ()
 Get the chain's acceptance ratio as a double.
 
int GetChainDim () const
 Get the MCMC chain dimensionality.
 
void resetChainState ()
 Reset the chain state.
 
void resetChainFilename (string filename)
 Reset to a new chain file.
 
void parseBinChain (string filename, Array1D< chainstate > &readchain)
 An auxiliary function to parse the binary file and produce an array of chain-states.
 
void writeFullChainTxt (string filename, Array1D< chainstate > fullchain)
 Write an array of chain-states to a file.
 
void getFullChain (Array1D< chainstate > &readchain)
 Get full chain as an array of chain-states.
 
void appendMAP ()
 Append MAP state to the end.
 
double getMode (Array1D< double > &MAPparams)
 Get MAP parameters.
 
int getFullChainSize ()
 Get the full chain size.
 
void setCurrentStateStep (int i)
 Function to set the step of the current state.
 
void getCurrentStateState (Array1D< double > &state)
 Function to get the state of the current state.
 
double getCurrentStatePost ()
 Function to get the post of the current state.
 
void setCurrentStateState (Array1D< double > &newState)
 Function to set the current state's state.
 
void setCurrentStatePost (double newPost)
 Function to set the current state's post.
 
void setCurrentStateAlfa (double newAlfa)
 Function to set the current state's alfa.
 
double getModeStatePost ()
 Function to get the mode state's post.
 
void getModeStateState (Array1D< double > &state)
 Function to get the mode state's state.
 
virtual void runOptim (Array1D< double > &start)
 The optimization routine.
 
virtual void runChain (int ncalls, Array1D< double > &chstart)=0
 The actual function that generates MCMC.
 
virtual void runChain (int ncalls)=0
 Start an MCMC chain with trivial initial condition.
 
void runAcceptFcn ()
 Function to run the accept function.
 
void runRejectFcn ()
 Function to run the reject function.
 
bool newModeFound ()
 Check to see if a new mode was found during last call to runChain.
 
double evalLogPosterior (Array1D< double > &m)
 Function to evaluate the log-posterior.
 
bool inDomain (Array1D< double > &m)
 Check if a point is in the domain.
 
void writeChainTxt (string filename)
 Write the full chain as a text.
 
void writeChainBin (string filename)
 Write the full chain as a binary file.
 
void setNewMode (bool value)
 Function to set a new mode value.
 
+ + + + + + + + + + + + + +

+Protected Member Functions

void setAcceptRatio (double d)
 Set the acceptance ratio.
 
void addCurrentState ()
 Function to add the current chain state to the full chain.
 
void updateMode ()
 Function to update the Chain mode.
 
void setLastWrite (int i)
 Set last write.
 
+ + + +

+Protected Attributes

dsfmt_t RandomState
 
+ + + +

+Private Member Functions

virtual double probOldNew (Array1D< double > &a, Array1D< double > &b)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Attributes

int WRITE_FLAG
 
int FLAG
 
LogPosteriorBase * L_
 
struct MCMC::outputInfo outputinfo_
 
int chainDim_
 
double(* logPosterior_ )(Array1D< double > &, void *) = NULL
 
void(* fcnAccept_ )(void *) = NULL
 
void(* fcnReject_ )(void *) = NULL
 
void * postInfo_ = NULL
 
Array2D< double > chcov
 
int seed_
 
chainstate currState_
 
chainstate modeState_
 
Array1D< chainstate > fullChain_
 
int lastwrite_
 
bool namesPrepend = false
 
bool newMode_ = false
 
double accRatio_ = -1.0
 
bool chaindimInit_ = false
 
bool propcovInit_ = false
 
bool methodInit_ = false
 
bool outputInit_ = false
 
bool fcnAcceptFlag_ = false
 
bool fcnRejectFlag_ = false
 
Array1D< double > Lower_
 Lower bounds.
 
Array1D< double > Upper_
 Upper bounds.
 
Array1D< int > lower_flag_
 Lower bound existence flags.
 
Array1D< int > upper_flag_
 Upper bound existence flags.
 
+

Detailed Description

+

Markov Chain Monte Carlo base class. Implemented the basic and most general MCMC algorithms.

+

Constructor & Destructor Documentation

+ +

◆ MCMC() [1/3]

+ +
+
+ + + + + + + + + + + +
MCMC::MCMC (double(* logposterior )(Array1D< double > &, void *),
void * postinfo )
+
+ +

Constructor when given a pointer to a logPosterior function and a pointer to additional information (e.g. data)

+
Note
Constructor using the pointer to the logPosterior and to the posterior information
+ +
+
+ +

◆ MCMC() [2/3]

+ +
+
+ + + + + + + +
MCMC::MCMC (LogPosteriorBase & L)
+
+ +

Constructor when given a LogPosterior Base class object.

+
Note
Constructor using a LogPosteriorBase class object
+ +
+
+ +

◆ MCMC() [3/3]

+ +
+
+ + + + + + + +
MCMC::MCMC ()
+
+ +

Dummy Constructor, used for TMCMC.

+
Note
Dummy Constructor for TMCMC
+ +
+
+

Member Function Documentation

+ +

◆ addCurrentState()

+ +
+
+ + + + + +
+ + + + + + + +
void MCMC::addCurrentState ()
+ 		+protected
+
+ +

Function to add the current chain state to the full chain.

+ +
+
+ +

◆ appendMAP()

+ +
+
+ + + + + + + +
void MCMC::appendMAP ()
+
+ +

Append MAP state to the end.

+ +
+
+ +

◆ evalLogPosterior()

+ +
+
+ + + + + + + +
double MCMC::evalLogPosterior (Array1D< double > & m)
+
+ +

Function to evaluate the log-posterior.

+ +
+
+ +

◆ getAcceptRatio() [1/2]

+ +
+
+ + + + + + + +
double MCMC::getAcceptRatio ()
+
+ +

Get the chain's acceptance ratio as a double.

+ +
+
+ +

◆ getAcceptRatio() [2/2]

+ +
+
+ + + + + + + +
void MCMC::getAcceptRatio (double * accrat)
+
+ +

Get the chain's acceptance ratio.

+ +
+
+ +

◆ GetChainDim()

+ +
+
+ + + + + + + +
int MCMC::GetChainDim () const
+
+ +

Get the MCMC chain dimensionality.

+ +
+
+ +

◆ getChainPropCov()

+ +
+
+ + + + + + + +
void MCMC::getChainPropCov (Array2D< double > & propcov)
+
+ +

Returns proposal covariance matrix.

+
Note
Get the proposal covariance matrix given a 2d-array
+ +
+
+ +

◆ getCurrentStatePost()

+ +
+
+ + + + + + + +
double MCMC::getCurrentStatePost ()
+
+ +

Function to get the post of the current state.

+ +
+
+ +

◆ getCurrentStateState()

+ +
+
+ + + + + + + +
void MCMC::getCurrentStateState (Array1D< double > & state)
+
+ +

Function to get the state of the current state.

+ +
+
+ +

◆ getDimInit()

+ +
+
+ + + + + + + +
bool MCMC::getDimInit ()
+
+ +

Get if the Chain Dimensions are initialized.

+ +
+
+ +

◆ getFcnAccept()

+ +
+
+ + + + + + + +
void MCMC::getFcnAccept (void(* fcnAccept )(void *))
+
+ +

Get the accept and reject functions given a pointer.

+ +
+
+ +

◆ getFcnAcceptInit()

+ +
+
+ + + + + + + +
bool MCMC::getFcnAcceptInit ()
+
+ +

Get if the accept and reject functions are initialized.

+ +
+
+ +

◆ getFcnReject()

+ +
+
+ + + + + + + +
void MCMC::getFcnReject (void(* fcnReject )(void *))
+
+ +
+
+ +

◆ getFcnRejectInit()

+ +
+
+ + + + + + + +
bool MCMC::getFcnRejectInit ()
+
+ +
+
+ +

◆ getFileFreq()

+ +
+
+ + + + + + + +
int MCMC::getFileFreq ()
+
+ +

Get the frequency of output to file.

+ +
+
+ +

◆ getFilename()

+ +
+
+ + + + + + + +
string MCMC::getFilename ()
+
+ +

Get the name of the chain file.

+ +
+
+ +

◆ getFullChain()

+ +
+
+ + + + + + + +
void MCMC::getFullChain (Array1D< chainstate > & readchain)
+
+ +

Get full chain as an array of chain-states.

+ +
+
+ +

◆ getFullChainSize()

+ +
+
+ + + + + + + +
int MCMC::getFullChainSize ()
+
+ +

Get the full chain size.

+ +
+
+ +

◆ getLastWrite()

+ +
+
+ + + + + + + +
int MCMC::getLastWrite ()
+
+ +

Get last write.

+ +
+
+ +

◆ getLower()

+ +
+
+ + + + + + + +
double MCMC::getLower (int i)
+
+ +

Get the lower bounds based on an index i.

+ +
+
+ +

◆ getLowerFlag()

+ +
+
+ + + + + + + +
int MCMC::getLowerFlag (int i)
+
+ +

Get function for the lower and upper Flag at index i.

+ +
+
+ +

◆ getMode()

+ +
+
+ + + + + + + +
double MCMC::getMode (Array1D< double > & MAPparams)
+
+ +

Get MAP parameters.

+ +
+
+ +

◆ getModeStatePost()

+ +
+
+ + + + + + + +
double MCMC::getModeStatePost ()
+
+ +

Function to get the mode state's post.

+ +
+
+ +

◆ getModeStateState()

+ +
+
+ + + + + + + +
void MCMC::getModeStateState (Array1D< double > & state)
+
+ +

Function to get the mode state's state.

+ +
+
+ +

◆ getNamesPrepended()

+ +
+
+ + + + + + + +
bool MCMC::getNamesPrepended ()
+
+ +

Get if the names are prepended.

+ +
+
+ +

◆ getNSubSteps()

+ +
+
+ + + + + +
+ + + + + + + +
virtual int MCMC::getNSubSteps ()
+ 		+inlinevirtual
+
+ +

Get function for number of sub steps.

+ +
+
+ +

◆ getOutputInit()

+ +
+
+ + + + + + + +
bool MCMC::getOutputInit ()
+
+ +

Get if the output info has been initialized.

+ +
+
+ +

◆ getOutputType()

+ +
+
+ + + + + + + +
string MCMC::getOutputType ()
+
+ +

Get the output file type as a string.

+ +
+
+ +

◆ getPostInfo()

+ +
+
+ + + + + + + +
void MCMC::getPostInfo (void * post)
+
+ +

Get post info pointer.

+ +
+
+ +

◆ getPropCovInit()

+ +
+
+ + + + + + + +
bool MCMC::getPropCovInit ()
+
+ +

Get if the Prop Cov has been initialized.

+ +
+
+ +

◆ getSamples() [1/2]

+ +
+
+ + + + + + + +
void MCMC::getSamples (Array2D< double > & samples)
+
+ +

Get all samples of the chain.

+ +
+
+ +

◆ getSamples() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void MCMC::getSamples (int burnin,
int every,
Array2D< double > & samples )
+
+ +

Get samples of the chain with burnin and thining.

+ +
+
+ +

◆ getScreenFreq()

+ +
+
+ + + + + + + +
int MCMC::getScreenFreq ()
+
+ +

Get the frequency of output to the screen.

+ +
+
+ +

◆ getSeed()

+ +
+
+ + + + + + + +
int MCMC::getSeed ()
+
+ +

Get the seed used for random generation.

+ +
+
+ +

◆ getUpper()

+ +
+
+ + + + + + + +
double MCMC::getUpper (int i)
+
+ +

Get the upper bounds based on an index i.

+ +
+
+ +

◆ getUpperFlag()

+ +
+
+ + + + + + + +
int MCMC::getUpperFlag (int i)
+
+ +
+
+ +

◆ getWriteFlag()

+ +
+
+ + + + + + + +
int MCMC::getWriteFlag ()
+
+ +

Get the value of the write flag as an integer.

+ +
+
+ +

◆ inDomain()

+ +
+
+ + + + + + + +
bool MCMC::inDomain (Array1D< double > & m)
+
+ +

Check if a point is in the domain.

+ +
+
+ +

◆ initChainPropCov()

+ +
+
+ + + + + + + +
void MCMC::initChainPropCov (Array2D< double > & propcov)
+
+ +

Initialize proposal covariance matrix given as a 2d-array For aMCMC, this matrix is used only before adaptivity starts.

+
Note
Function that initialize the proposal covariance matrix given as a 2d-array
+ +
+
+ +

◆ initChainPropCovDiag()

+ +
+
+ + + + + + + +
void MCMC::initChainPropCovDiag (Array1D< double > & sig)
+
+ +

Initialize proposal covariance matrix given its 1d-array diagonal For aMCMC, this matrix is used only before adaptivity starts.

+
Note
Function that initialize the proposal covariance matrix given as a 1d-array
+ +
+
+ +

◆ namesPrepended()

+ +
+
+ + + + + + + +
void MCMC::namesPrepended ()
+
+ +

Set the indicator to confirm that the names of parameters are prepended in the output file.

+
Note
Function that sets whether the parameter names will be prepended in the output file
+ +
+
+ +

◆ newModeFound()

+ +
+
+ + + + + + + +
bool MCMC::newModeFound ()
+
+ +

Check to see if a new mode was found during last call to runChain.

+ +
+
+ +

◆ parseBinChain()

+ +
+
+ + + + + + + + + + + +
void MCMC::parseBinChain (string filename,
Array1D< chainstate > & readchain )
+
+ +

An auxiliary function to parse the binary file and produce an array of chain-states.

+ +
+
+ +

◆ probOldNew()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
virtual double MCMC::probOldNew (Array1D< double > & a,
Array1D< double > & b )
+ 		+inlineprivatevirtual
+
+ +
+
+ +

◆ resetChainFilename()

+ +
+
+ + + + + + + +
void MCMC::resetChainFilename (string filename)
+
+ +

Reset to a new chain file.

+ +
+
+ +

◆ resetChainState()

+ +
+
+ + + + + + + +
void MCMC::resetChainState ()
+
+ +

Reset the chain state.

+ +
+
+ +

◆ runAcceptFcn()

+ +
+
+ + + + + + + +
void MCMC::runAcceptFcn ()
+
+ +

Function to run the accept function.

+ +
+
+ +

◆ runChain() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
virtual void MCMC::runChain (int ncalls)
+ 		+pure virtual
+
+ +

Start an MCMC chain with trivial initial condition.

+ +
+
+ +

◆ runChain() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + +
virtual void MCMC::runChain (int ncalls,
Array1D< double > & chstart )
+ 		+pure virtual
+
+ +

The actual function that generates MCMC.

+ +
+
+ +

◆ runOptim()

+ +
+
+ + + + + +
+ + + + + + + +
void MCMC::runOptim (Array1D< double > & start)
+ 		+virtual
+
+ +

The optimization routine.

+ +
+
+ +

◆ runRejectFcn()

+ +
+
+ + + + + + + +
void MCMC::runRejectFcn ()
+
+ +

Function to run the reject function.

+ +
+
+ +

◆ setAcceptRatio()

+ +
+
+ + + + + +
+ + + + + + + +
void MCMC::setAcceptRatio (double d)
+ 		+protected
+
+ +

Set the acceptance ratio.

+ +
+
+ +

◆ setChainDim()

+ +
+
+ + + + + + + +
void MCMC::setChainDim (int chdim)
+
+ +

Set the dimensions of the chain given an integer.

+
Note
Function that sets the number of dimensions for the MCMC object
+ +
+
+ +

◆ setCurrentStateAlfa()

+ +
+
+ + + + + + + +
void MCMC::setCurrentStateAlfa (double newAlfa)
+
+ +

Function to set the current state's alfa.

+ +
+
+ +

◆ setCurrentStatePost()

+ +
+
+ + + + + + + +
void MCMC::setCurrentStatePost (double newPost)
+
+ +

Function to set the current state's post.

+ +
+
+ +

◆ setCurrentStateState()

+ +
+
+ + + + + + + +
void MCMC::setCurrentStateState (Array1D< double > & newState)
+
+ +

Function to set the current state's state.

+ +
+
+ +

◆ setCurrentStateStep()

+ +
+
+ + + + + + + +
void MCMC::setCurrentStateStep (int i)
+
+ +

Function to set the step of the current state.

+ +
+
+ +

◆ setDefaultDomain()

+ +
+
+ + + + + + + +
void MCMC::setDefaultDomain ()
+
+ +

Set default unbounded domain.

+
Note
Sets the default domain for the MCMC object
+ +
+
+ +

◆ setFcnAccept()

+ +
+
+ + + + + + + +
void MCMC::setFcnAccept (void(* fcnAccept )(void *))
+
+ +

Set the accept and reject functions.

+
Note
Function that sets the accept function for the MCMC object
+ +
+
+ +

◆ setFcnReject()

+ +
+
+ + + + + + + +
void MCMC::setFcnReject (void(* fcnReject )(void *))
+
+
Note
Function that sets the reject function for the MCMC object
+ +
+
+ +

◆ setLastWrite()

+ +
+
+ + + + + +
+ + + + + + + +
void MCMC::setLastWrite (int i)
+ 		+protected
+
+ +

Set last write.

+ +
+
+ +

◆ setLower()

+ +
+
+ + + + + + + + + + + +
void MCMC::setLower (double lower,
int i )
+
+ +

Set lower bound at the index of i.

+
Note
Sets the lower limit at index i
+ +
+
+ +

◆ setNewMode()

+ +
+
+ + + + + + + +
void MCMC::setNewMode (bool value)
+
+ +

Function to set a new mode value.

+ +
+
+ +

◆ setOutputInfo()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void MCMC::setOutputInfo (string outtype,
string file,
int freq_file,
int freq_screen )
+
+ +

Set output specification struct, type('txt' or 'bin'), filename, frequency of outputs to the file and to screen.

+
Note
Function that sets the output information for the MCMC object
+ +
+
+ +

◆ setPostInfo()

+ +
+
+ + + + + + + +
void MCMC::setPostInfo (void * postinfo)
+
+ +

Set the Posterior Info pointer.

+ +
+
+ +

◆ setSeed()

+ +
+
+ + + + + + + +
void MCMC::setSeed (int seed)
+
+ +

Set random generation seed.

+
Note
Function that sets the seed for random generation
+ +
+
+ +

◆ setUpper()

+ +
+
+ + + + + + + + + + + +
void MCMC::setUpper (double upper,
int i )
+
+ +

Set upper bound at the index of i.

+
Note
Sets the upper limit at index i
+ +
+
+ +

◆ setWriteFlag()

+ +
+
+ + + + + + + +
void MCMC::setWriteFlag (int I)
+
+ +

Set the write flag function given an integer.

+
Note
Function that sets the Write Flag of the MCMC object
+ +
+
+ +

◆ updateMode()

+ +
+
+ + + + + +
+ + + + + + + +
void MCMC::updateMode ()
+ 		+protected
+
+ +

Function to update the Chain mode.

+ +
+
+ +

◆ writeChainBin()

+ +
+
+ + + + + + + +
void MCMC::writeChainBin (string filename)
+
+ +

Write the full chain as a binary file.

+ +
+
+ +

◆ writeChainTxt()

+ +
+
+ + + + + + + +
void MCMC::writeChainTxt (string filename)
+
+ +

Write the full chain as a text.

+ +
+
+ +

◆ writeFullChainTxt()

+ +
+
+ + + + + + + + + + + +
void MCMC::writeFullChainTxt (string filename,
Array1D< chainstate > fullchain )
+
+ +

Write an array of chain-states to a file.

+ +
+
+

Member Data Documentation

+ +

◆ accRatio_

+ +
+
+ + + + + +
+ + + + +
double MCMC::accRatio_ = -1.0
+ 		+private
+
+ +
+
+ +

◆ chainDim_

+ +
+
+ + + + + +
+ + + + +
int MCMC::chainDim_
+ 		+private
+
+ +
+
+ +

◆ chaindimInit_

+ +
+
+ + + + + +
+ + + + +
bool MCMC::chaindimInit_ = false
+ 		+private
+
+ +
+
+ +

◆ chcov

+ +
+
+ + + + + +
+ + + + +
Array2D<double> MCMC::chcov
+ 		+private
+
+ +
+
+ +

◆ currState_

+ +
+
+ + + + + +
+ + + + +
chainstate MCMC::currState_
+ 		+private
+
+ +
+
+ +

◆ fcnAccept_

+ +
+
+ + + + + +
+ + + + +
void(* MCMC::fcnAccept_) (void *) = NULL
+ 		+private
+
+ +
+
+ +

◆ fcnAcceptFlag_

+ +
+
+ + + + + +
+ + + + +
bool MCMC::fcnAcceptFlag_ = false
+ 		+private
+
+ +
+
+ +

◆ fcnReject_

+ +
+
+ + + + + +
+ + + + +
void(* MCMC::fcnReject_) (void *) = NULL
+ 		+private
+
+ +
+
+ +

◆ fcnRejectFlag_

+ +
+
+ + + + + +
+ + + + +
bool MCMC::fcnRejectFlag_ = false
+ 		+private
+
+ +
+
+ +

◆ FLAG

+ +
+
+ + + + + +
+ + + + +
int MCMC::FLAG
+ 		+private
+
+ +
+
+ +

◆ fullChain_

+ +
+
+ + + + + +
+ + + + +
Array1D<chainstate> MCMC::fullChain_
+ 		+private
+
+ +
+
+ +

◆ L_

+ +
+
+ + + + + +
+ + + + +
LogPosteriorBase* MCMC::L_
+ 		+private
+
+ +
+
+ +

◆ lastwrite_

+ +
+
+ + + + + +
+ + + + +
int MCMC::lastwrite_
+ 		+private
+
+ +
+
+ +

◆ logPosterior_

+ +
+
+ + + + + +
+ + + + +
double(* MCMC::logPosterior_) (Array1D< double > &, void *) = NULL
+ 		+private
+
+ +
+
+ +

◆ Lower_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> MCMC::Lower_
+ 		+private
+
+ +

Lower bounds.

+ +
+
+ +

◆ lower_flag_

+ +
+
+ + + + + +
+ + + + +
Array1D<int> MCMC::lower_flag_
+ 		+private
+
+ +

Lower bound existence flags.

+ +
+
+ +

◆ methodInit_

+ +
+
+ + + + + +
+ + + + +
bool MCMC::methodInit_ = false
+ 		+private
+
+ +
+
+ +

◆ modeState_

+ +
+
+ + + + + +
+ + + + +
chainstate MCMC::modeState_
+ 		+private
+
+ +
+
+ +

◆ namesPrepend

+ +
+
+ + + + + +
+ + + + +
bool MCMC::namesPrepend = false
+ 		+private
+
+ +
+
+ +

◆ newMode_

+ +
+
+ + + + + +
+ + + + +
bool MCMC::newMode_ = false
+ 		+private
+
+ +
+
+ +

◆ outputinfo_

+ +
+
+ + + + + +
+ + + + +
struct MCMC::outputInfo MCMC::outputinfo_
+ 		+private
+
+ +
+
+ +

◆ outputInit_

+ +
+
+ + + + + +
+ + + + +
bool MCMC::outputInit_ = false
+ 		+private
+
+ +
+
+ +

◆ postInfo_

+ +
+
+ + + + + +
+ + + + +
void* MCMC::postInfo_ = NULL
+ 		+private
+
+ +
+
+ +

◆ propcovInit_

+ +
+
+ + + + + +
+ + + + +
bool MCMC::propcovInit_ = false
+ 		+private
+
+ +
+
+ +

◆ RandomState

+ +
+
+ + + + + +
+ + + + +
dsfmt_t MCMC::RandomState
+ 		+protected
+
+ +
+
+ +

◆ seed_

+ +
+
+ + + + + +
+ + + + +
int MCMC::seed_
+ 		+private
+
+ +
+
+ +

◆ Upper_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> MCMC::Upper_
+ 		+private
+
+ +

Upper bounds.

+ +
+
+ +

◆ upper_flag_

+ +
+
+ + + + + +
+ + + + +
Array1D<int> MCMC::upper_flag_
+ 		+private
+
+ +

Upper bound existence flags.

+ +
+
+ +

◆ WRITE_FLAG

+ +
+
+ + + + + +
+ + + + +
int MCMC::WRITE_FLAG
+ 		+private
+
+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classMrv-members.html b/docs/html/classMrv-members.html new file mode 100644 index 00000000..0cdc9a49 --- /dev/null +++ b/docs/html/classMrv-members.html @@ -0,0 +1,93 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Mrv Member List
+
+
+ +

This is the complete list of members for Mrv, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + +
computeMoments(Array2D< double > &funcCf, Array1D< double > &fcnMean, Array1D< double > &fcnStd, bool covFlag, Array2D< double > &fcnCov)Mrv
evalMultiPC(Array2D< double > &xiSam, Array2D< double > &multiPCcf)Mrv
getBounds(Array1D< double > &lower, Array1D< double > &upper)Mrv
getMultiPCcf(Array1D< double > &rvParams)Mrv
getPCTermId(Array1D< int > &pctermid)Mrvinline
getPDim()Mrvinline
mcParam(Array2D< double > &multiPCcf, int nsam)Mrv
Mrv(int ndim, string pdfType, Array1D< int > rndInd, int order, string pctype)Mrv
nDim_Mrvprivate
nPC_Mrvprivate
order_Mrvprivate
Parametrize()Mrv
paramId_Mrvprivate
pcModel_Mrvprivate
pctermId_Mrvprivate
pcType_Mrvprivate
pdfType_Mrvprivate
pDim_Mrvprivate
propMC(Array2D< double >(*forwardFcn)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array2D< double > &fixindnom, void *funcinfo, Array2D< double > &multiPCcf, Array2D< double > &x, int nsam)Mrv
propNISP(Array2D< double >(*forwardFcn)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array2D< double > &fixindnom, void *funcinfo, Array2D< double > &multiPCcf, Array2D< double > &x)Mrv
quadParam(Array2D< double > &multiPCcf)Mrv
rDim_Mrvprivate
rndInd_Mrvprivate
~Mrv()Mrvinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classMrv.html b/docs/html/classMrv.html new file mode 100644 index 00000000..36dc2f73 --- /dev/null +++ b/docs/html/classMrv.html @@ -0,0 +1,792 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Mrv Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
Mrv Class Reference
+
+
+ +

multivariate RV parameterized by PC expansions + More...

+ +

#include <mrv.h>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Mrv (int ndim, string pdfType, Array1D< int > rndInd, int order, string pctype)
 Constructor with dimensionality, pdftype, randomized parameter indices, order, and pctype.
 
 ~Mrv ()
 Destructor.
 
int Parametrize ()
 Parameterization bookkeeping (i.e. alpha corresponds to certain parameter lambda and certain PC term)
 
void getBounds (Array1D< double > &lower, Array1D< double > &upper)
 Get bounds on parameters.
 
int getPDim ()
 Get dimensionailty of parameterization.
 
Array2D< double > getMultiPCcf (Array1D< double > &rvParams)
 Given parameters of representation, fold them in a 2d-array of PC coefficients for convenience.
 
Array2D< double > evalMultiPC (Array2D< double > &xiSam, Array2D< double > &multiPCcf)
 Evaluate at multivariate PC at given germ samples for given coefficient matrix.
 
Array2D< double > mcParam (Array2D< double > &multiPCcf, int nsam)
 Random-sample all parameters given coefficient matrix.
 
Array2D< double > quadParam (Array2D< double > &multiPCcf)
 Quadrature-sample all parameters given coefficient matrix.
 
Array2D< double > propNISP (Array2D< double >(*forwardFcn)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array2D< double > &fixindnom, void *funcinfo, Array2D< double > &multiPCcf, Array2D< double > &x)
 Propagate the multivariate RV with given coefficeints through a given function at given values x.
 
Array2D< double > propMC (Array2D< double >(*forwardFcn)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array2D< double > &fixindnom, void *funcinfo, Array2D< double > &multiPCcf, Array2D< double > &x, int nsam)
 Sample values of a given function given input coefficeint matrix.
 
void computeMoments (Array2D< double > &funcCf, Array1D< double > &fcnMean, Array1D< double > &fcnStd, bool covFlag, Array2D< double > &fcnCov)
 Compute moments given coefficent matrix.
 
void getPCTermId (Array1D< int > &pctermid)
 Get PC term ID.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Attributes

Array1D< int > rndInd_
 Randomized parameters indices.
 
Array1D< int > paramId_
 For a given parameterization, id the corresponding physical parameter lambda.
 
Array1D< int > pctermId_
 For a given parameterization, id the PC term/order for the corresponding parameter representation.
 
string pdfType_
 PDF type ('pct', 'pci' or 'full')
 
string pcType_
 PC type (see pce library for options)
 
int pDim_
 Number of parameters in alpha parameterization.
 
int rDim_
 Number of randomized parameters.
 
int nDim_
 Number of physical parameters lambda.
 
int order_
 Order of function PC representation.
 
int nPC_
 Number of PC parameters for each independent component.
 
PCSet * pcModel_
 Pointer to the corresponding PC object.
 
+

Detailed Description

+

multivariate RV parameterized by PC expansions

+

Constructor & Destructor Documentation

+ +

◆ Mrv()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
Mrv::Mrv (int ndim,
string pdfType,
Array1D< int > rndInd,
int order,
string pctype )
+
+ +

Constructor with dimensionality, pdftype, randomized parameter indices, order, and pctype.

+ +
+
+ +

◆ ~Mrv()

+ +
+
+ + + + + +
+ + + + + + + +
Mrv::~Mrv ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ computeMoments()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void Mrv::computeMoments (Array2D< double > & funcCf,
Array1D< double > & fcnMean,
Array1D< double > & fcnStd,
bool covFlag,
Array2D< double > & fcnCov )
+
+ +

Compute moments given coefficent matrix.

+ +
+
+ +

◆ evalMultiPC()

+ +
+
+ + + + + + + + + + + +
Array2D< double > Mrv::evalMultiPC (Array2D< double > & xiSam,
Array2D< double > & multiPCcf )
+
+ +

Evaluate at multivariate PC at given germ samples for given coefficient matrix.

+ +
+
+ +

◆ getBounds()

+ +
+
+ + + + + + + + + + + +
void Mrv::getBounds (Array1D< double > & lower,
Array1D< double > & upper )
+
+ +

Get bounds on parameters.

+
Note
Useful when some parameters forced to be positive to make use of invariance
+ +
+
+ +

◆ getMultiPCcf()

+ +
+
+ + + + + + + +
Array2D< double > Mrv::getMultiPCcf (Array1D< double > & rvParams)
+
+ +

Given parameters of representation, fold them in a 2d-array of PC coefficients for convenience.

+ +
+
+ +

◆ getPCTermId()

+ +
+
+ + + + + +
+ + + + + + + +
void Mrv::getPCTermId (Array1D< int > & pctermid)
+ 		+inline
+
+ +

Get PC term ID.

+ +
+
+ +

◆ getPDim()

+ +
+
+ + + + + +
+ + + + + + + +
int Mrv::getPDim ()
+ 		+inline
+
+ +

Get dimensionailty of parameterization.

+ +
+
+ +

◆ mcParam()

+ +
+
+ + + + + + + + + + + +
Array2D< double > Mrv::mcParam (Array2D< double > & multiPCcf,
int nsam )
+
+ +

Random-sample all parameters given coefficient matrix.

+ +
+
+ +

◆ Parametrize()

+ +
+
+ + + + + + + +
int Mrv::Parametrize ()
+
+ +

Parameterization bookkeeping (i.e. alpha corresponds to certain parameter lambda and certain PC term)

+ +
+
+ +

◆ propMC()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Mrv::propMC (Array2D< double >(* forwardFcn )(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *),
Array2D< double > & fixindnom,
void * funcinfo,
Array2D< double > & multiPCcf,
Array2D< double > & x,
int nsam )
+
+ +

Sample values of a given function given input coefficeint matrix.

+ +
+
+ +

◆ propNISP()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Mrv::propNISP (Array2D< double >(* forwardFcn )(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *),
Array2D< double > & fixindnom,
void * funcinfo,
Array2D< double > & multiPCcf,
Array2D< double > & x )
+
+ +

Propagate the multivariate RV with given coefficeints through a given function at given values x.

+ +
+
+ +

◆ quadParam()

+ +
+
+ + + + + + + +
Array2D< double > Mrv::quadParam (Array2D< double > & multiPCcf)
+
+ +

Quadrature-sample all parameters given coefficient matrix.

+ +
+
+

Member Data Documentation

+ +

◆ nDim_

+ +
+
+ + + + + +
+ + + + +
int Mrv::nDim_
+ 		+private
+
+ +

Number of physical parameters lambda.

+ +
+
+ +

◆ nPC_

+ +
+
+ + + + + +
+ + + + +
int Mrv::nPC_
+ 		+private
+
+ +

Number of PC parameters for each independent component.

+ +
+
+ +

◆ order_

+ +
+
+ + + + + +
+ + + + +
int Mrv::order_
+ 		+private
+
+ +

Order of function PC representation.

+ +
+
+ +

◆ paramId_

+ +
+
+ + + + + +
+ + + + +
Array1D<int> Mrv::paramId_
+ 		+private
+
+ +

For a given parameterization, id the corresponding physical parameter lambda.

+ +
+
+ +

◆ pcModel_

+ +
+
+ + + + + +
+ + + + +
PCSet* Mrv::pcModel_
+ 		+private
+
+ +

Pointer to the corresponding PC object.

+ +
+
+ +

◆ pctermId_

+ +
+
+ + + + + +
+ + + + +
Array1D<int> Mrv::pctermId_
+ 		+private
+
+ +

For a given parameterization, id the PC term/order for the corresponding parameter representation.

+ +
+
+ +

◆ pcType_

+ +
+
+ + + + + +
+ + + + +
string Mrv::pcType_
+ 		+private
+
+ +

PC type (see pce library for options)

+ +
+
+ +

◆ pdfType_

+ +
+
+ + + + + +
+ + + + +
string Mrv::pdfType_
+ 		+private
+
+ +

PDF type ('pct', 'pci' or 'full')

+ +
+
+ +

◆ pDim_

+ +
+
+ + + + + +
+ + + + +
int Mrv::pDim_
+ 		+private
+
+ +

Number of parameters in alpha parameterization.

+ +
+
+ +

◆ rDim_

+ +
+
+ + + + + +
+ + + + +
int Mrv::rDim_
+ 		+private
+
+ +

Number of randomized parameters.

+ +
+
+ +

◆ rndInd_

+ +
+
+ + + + + +
+ + + + +
Array1D<int> Mrv::rndInd_
+ 		+private
+
+ +

Randomized parameters indices.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classMyException-members.html b/docs/html/classMyException-members.html new file mode 100644 index 00000000..0eaf2542 --- /dev/null +++ b/docs/html/classMyException-members.html @@ -0,0 +1,74 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
MyException Member List
+
+
+ +

This is the complete list of members for MyException, including all inherited members.

+ + + + + + +
error_MyExceptionprivate
MyException(const char *errormessage)MyExceptioninline
MyException(const std::string &errormessage)MyExceptioninline
what() constMyExceptioninline
~MyException()MyExceptioninlinevirtual
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classMyException.html b/docs/html/classMyException.html new file mode 100644 index 00000000..1de85721 --- /dev/null +++ b/docs/html/classMyException.html @@ -0,0 +1,244 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: MyException Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
MyException Class Reference
+
+
+ +

#include <MyException.h>

+
+Inheritance diagram for MyException:
+
+
+ +
+ + + + + + + + + + + + + + +

+Public Member Functions

 MyException (const char *errormessage)
 Construct an exception using a C-style character string.
 
 MyException (const std::string &errormessage)
 Construct an exception using a C++-style string.
 
virtual ~MyException () throw ()
 Destroy.
 
const char * what () const throw ()
 What's going on?
 
+ + + +

+Private Attributes

std::string error_
 
+

Detailed Description

+

Just an example exception - feel free to override this.

+

Constructor & Destructor Documentation

+ +

◆ MyException() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
MyException::MyException (const char * errormessage)
+ 		+inline
+
+ +

Construct an exception using a C-style character string.

+ +
+
+ +

◆ MyException() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
MyException::MyException (const std::string & errormessage)
+ 		+inline
+
+ +

Construct an exception using a C++-style string.

+ +
+
+ +

◆ ~MyException()

+ +
+
+ + + + + +
+ + + + + + + + + + +
virtual MyException::~MyException ()
throw ( )
+ 		+inlinevirtual
+
+ +

Destroy.

+ +
+
+

Member Function Documentation

+ +

◆ what()

+ +
+
+ + + + + +
+ + + + + + + + + + +
const char * MyException::what () const
throw ( )
+ 		+inline
+
+ +

What's going on?

+

This function is not permitted to throw exceptions.

+ +
+
+

Member Data Documentation

+ +

◆ error_

+ +
+
+ + + + + +
+ + + + +
std::string MyException::error_
+ 		+private
+
+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classMyException.png b/docs/html/classMyException.png new file mode 100644 index 0000000000000000000000000000000000000000..860a43f9db565477f05a08be8a534dcf5b0eb4cc GIT binary patch literal 474 zcmV<00VV#4P)vTJr#LVva2S`&=-}Ys|Ns9r%~qrU000SeQchC<|NsC0|NsC0Hv*f~0004H zNklYynz~@m*UkGDXh~KsfUuUSqhRISLb`b z1SZJ~E$|~?0GJ>Vkzs8jA~Q4#yls=nv%ro!hdd4Zgt;9#bM%CrB z=c>kia2&$5FS^1Hwkw)oRn69I;eJ39-2Z932ma_MxBfO&wXm-Q1Hc6R0e~xL8`omf QuK)l507*qoM6N<$f(NeKu>b%7 literal 0 HcmV?d00001 diff --git a/docs/html/classObject-members.html b/docs/html/classObject-members.html new file mode 100644 index 00000000..737e8cc1 --- /dev/null +++ b/docs/html/classObject-members.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Object Member List
+
+
+ +

This is the complete list of members for Object, including all inherited members.

+ + + + + + + + + +
ConstRefPtr classObjectfriend
Object()Objectinline
reference_count() constObjectinline
reference_grab() constObjectinlineprotected
reference_release() constObjectinlineprotected
RefPtr classObjectfriend
refs_Objectmutableprivate
~Object()Objectinlinevirtual
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classObject.html b/docs/html/classObject.html new file mode 100644 index 00000000..f26fffb5 --- /dev/null +++ b/docs/html/classObject.html @@ -0,0 +1,333 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Object Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Protected Member Functions | +Private Attributes | +Friends | +List of all members
+
Object Class Reference
+
+
+ +

#include <Object.h>

+
+Inheritance diagram for Object:
+
+
+ + +XMLAttributeList +XMLElement +XMLParser +XMLExpatParser + +
+ + + + + + + + + + + +

+Public Member Functions

 Object ()
 Construct a new reference counted object with a zero reference count.
 
virtual ~Object ()
 Destroy this object.
 
long int reference_count () const
 Returns the number of references that are held to this object.
 
+ + + + + +

+Protected Member Functions

long int reference_grab () const
 
long int reference_release () const
 
+ + + +

+Private Attributes

long int refs_
 
+ + + + + + + +

+Friends

template<class T >
class RefPtr
 
template<class T >
class ConstRefPtr
 
+

Detailed Description

+

Base class for reference counted objects.

+

Part of the Particle Simulation Toolkit (pst)

+

The "friend" classes "RefPtr" and "ConstRefPtr" take care of the reference counting and garbage collection. This means that it should be safe to create an array of reference counted objects, as long as you do not assign a reference counted pointer to any at the entries in the array at any time.

+

Constructor & Destructor Documentation

+ +

◆ Object()

+ +
+
+ + + + + +
+ + + + + + + +
Object::Object ()
+ 		+inline
+
+ +

Construct a new reference counted object with a zero reference count.

+ +
+
+ +

◆ ~Object()

+ +
+
+ + + + + +
+ + + + + + + +
virtual Object::~Object ()
+ 		+inlinevirtual
+
+ +

Destroy this object.

+ +
+
+

Member Function Documentation

+ +

◆ reference_count()

+ +
+
+ + + + + +
+ + + + + + + +
long int Object::reference_count () const
+ 		+inline
+
+ +

Returns the number of references that are held to this object.

+ +
+
+ +

◆ reference_grab()

+ +
+
+ + + + + +
+ + + + + + + +
long int Object::reference_grab () const
+ 		+inlineprotected
+
+

Enables the friends of the class to increment and decrement the reference count.

+ +
+
+ +

◆ reference_release()

+ +
+
+ + + + + +
+ + + + + + + +
long int Object::reference_release () const
+ 		+inlineprotected
+
+ +
+
+

Friends And Related Symbol Documentation

+ +

◆ ConstRefPtr

+ +
+
+
+template<class T >
+ + + + + +
+ + + + +
friend class ConstRefPtr
+ 		+friend
+
+ +
+
+ +

◆ RefPtr

+ +
+
+
+template<class T >
+ + + + + +
+ + + + +
friend class RefPtr
+ 		+friend
+
+ +
+
+

Member Data Documentation

+ +

◆ refs_

+ +
+
+ + + + + +
+ + + + +
long int Object::refs_
+ 		+mutableprivate
+
+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classObject.png b/docs/html/classObject.png new file mode 100644 index 0000000000000000000000000000000000000000..406ca03d2b71e2964fa6a36624a13baf57329423 GIT binary patch literal 1349 zcmeAS@N?(olHy`uVBq!ia0y~yV2l8=J2;qu zI(w>C*1!MV{YA!(j$aJku}_=b#&DA-Q*Cm1gZ+ZnyWWK}#I)%tJu;8TadBZ1lNOxV zaMaC3C1InWASX!Zbgi#^-{njfliLfIgZPJ)N>^_`%48xF`02#uchh!neyrL4zI~;v z;KpX4zRjUY>^m=SvvP5HleAIrVovF?eFCq87&bi1-uSpGZ6m|_AM<;1^ITotBm>Ro zeQac^6S{6A1G~kNlo>x3-+5?ZCAYpuoKMy6K&pkBnbNDbtLr!2=;)}`5lfh#FH`&c zYLc>&(FULhi;kI+5@UC7hsOb+kkF19H`cx0CC`|^VD^%c=fKVgodZ9=>^;jgr|&4! zobzW_16jRCnU*B1W#Ej^abObTp3rcV3Ft=*Zj3|D{qKKM8GeY?Pqr5C$ih^CUq8@d zy`@t=S=MSUtvR!Fk(lQ%-me0xFU|jihICI|a(QEfr`LfbRZT`9hea-Fccs1AtY^D- z_sfN5@7!SWt$l~^BI&x<9h0^^3T@w>bf0zFlKz!O-~Kf;Y6jR&$jjN5T&?`==by6z z+v68VZB)tqJoQF-<9?&x6K}Xb;(5OP?kD^2)z0l^$@1dzH2V&3%=!J1>2;&@o@7_jT)H$=!dMR$E#f+n4|KXK|@jO!9YT`$Zv% zVe-zCq-Gt>)-%gLx-I#R=x;~O8+DDVj+tGI+uNdIDigVr@Hak#MKvdjf)~TsD|Etcxs>JC(Tne zcKua)@{_)}Y_9MOQgfds=xH^5e^=JVNhMZd+Mb*dYgAMdHcpz-aMUY^2_{e=9POoP zzep-cbLpRs{e4^s3}Igw*dD~_h&`zJbuW$4?|2g9x#!QWrZJv7mc$seA*_K#M@)gS zn-!Q28HF}PP??)BJ;>|loPAS*?ARU{i2xH5%$;zDPZzm;_V>m>^W6{CJc1 zB>(!E8@p#WdKRjNO){HNEo+p$QU9nPQ+|DN_KU*Xx=G8A$gT^iU8a3~?Z)m!fgg*H z^@XcFzFfY-Xxl#{-}yhIW6M6yI{jwyjh$V6yVcsmO}D+>@T%@-Pwbj?**VH(S0dMz zU7q?JCWl7mdKI;Vst0GtY4IsgCw literal 0 HcmV?d00001 diff --git a/docs/html/classPCBasis-members.html b/docs/html/classPCBasis-members.html new file mode 100644 index 00000000..740b59d8 --- /dev/null +++ b/docs/html/classPCBasis-members.html @@ -0,0 +1,111 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
PCBasis Member List
+
+
+ +

This is the complete list of members for PCBasis, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
alpha_PCBasisprivate
beta_PCBasisprivate
Eval1dBasisAtCustPoints(Array2D< double > &psi, int kord, const Array1D< double > &custPoints)PCBasis
Eval1dBasisAtQuadPoints()PCBasis
Eval1dDerivBasisAtCustPoints(Array2D< double > &dpsi, int kord, const Array1D< double > &custPoints)PCBasis
Eval1dNormSq(int kord)PCBasisprivate
Eval1dNormSq_Exact(int kord)PCBasis
Eval2ndDerivBasis(const double &xi, Array1D< double > &ddP)PCBasis
Eval2ndDerivCustPoints(Array2D< double > &psi, int kord, Array1D< double > &custPoints)PCBasis
EvalBasis(const double &xi, Array1D< double > &basisEvals) constPCBasis
EvalBasis(const double &xi, const int kord, double *basisEvals) constPCBasis
EvalDerivBasis(const double &xi, Array1D< double > &basisDEvals)PCBasis
Get1dNormsSq(Array1D< double > &psi1dSq) constPCBasisinline
Get1dNormsSqExact(Array1D< double > &psi1dSqExact) constPCBasisinline
GetAlpha() constPCBasisinline
GetBasisAtQuadPoints(Array2D< double > &psi1d) constPCBasisinline
GetBeta() constPCBasisinline
GetPCType() constPCBasisinline
GetQuadIndices(Array2D< int > &quadIndices) constPCBasisinline
GetQuadPoints(Array2D< double > &quadPoints) constPCBasisinline
GetQuadRule(Array2D< double > &qPoints, Array1D< double > &qWeights, Array2D< int > &qIndices)PCBasis
GetQuadWeights(Array1D< double > &quadWeights) constPCBasisinline
GetRandSample(Array1D< double > &randSamples)PCBasis
GetRandSample(double *randSamples, const int &nSamp)PCBasis
GetSeed() constPCBasisinline
Init1dQuadPoints(int qdpts)PCBasis
maxord_PCBasisprivate
narg_PCBasisprivate
NormSq_Exact(int kord)PCBasisprivate
PCBasis(const string type="LU", const double alpha=0.0, const double betta=1.0, const int maxord=10)PCBasis
PCBasis(const PCBasis &obj)PCBasisinlineprivate
psi1d_PCBasisprivate
psi1dSq_PCBasisprivate
psi1dSqExact_PCBasisprivate
quadIndices_PCBasisprivate
quadPoints_PCBasisprivate
quadWeights_PCBasisprivate
rnstate_PCBasisprivate
rSeed_PCBasisprivate
SeedRandNumGen(const int &seed)PCBasis
type_PCBasisprivate
~PCBasis()PCBasisinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classPCBasis.html b/docs/html/classPCBasis.html new file mode 100644 index 00000000..29fc0eb6 --- /dev/null +++ b/docs/html/classPCBasis.html @@ -0,0 +1,1280 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: PCBasis Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Member Functions | +Private Attributes | +List of all members
+
PCBasis Class Reference
+
+
+ +

Contains all basis type specific definitions and operations needed to generate a PCSet. + More...

+ +

#include <PCBasis.h>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 PCBasis (const string type="LU", const double alpha=0.0, const double betta=1.0, const int maxord=10)
 Constructor: initializes the univariate basis type and order.
 
 ~PCBasis ()
 Destructor.
 
void Init1dQuadPoints (int qdpts)
 Initialize the quadrature points and weights and store the information in arrays quadPoints_, quadWeights_,quadIndices_.
 
void Eval1dBasisAtQuadPoints ()
 Evaluate polynomial 1d basis functions at quadrature points and store in the private variable psi1d_.
 
void Eval1dBasisAtCustPoints (Array2D< double > &psi, int kord, const Array1D< double > &custPoints)
 Evaluate polynomial 1d basis functions up to the order kord at custom points given by an array custPoints Returns the evaluations in the first argument psi, where the number of rows are the number of points, and columns correspond to successive orders.
 
double EvalBasis (const double &xi, Array1D< double > &basisEvals) const
 Evaluate 1d basis functions for the given value of random variable xi. Return the value of the basis functions for all orders in the passed Array1D array (indexed by their order), also returns the highest-order value.
 
double EvalBasis (const double &xi, const int kord, double *basisEvals) const
 Evaluate 1d basis functions for the given value of random variable xi. Return the value of the basis functions for all orders in the passed double * array (indexed by their order), also returns the highest-order value.
 
void Eval1dNormSq_Exact (int kord)
 Evaluate the norms (squared) of the basis functions exactly and stores in the private array psi1dSqExact_.
 
void EvalDerivBasis (const double &xi, Array1D< double > &basisDEvals)
 Evaluate derivative of 1d non-normalized Legendre basis.
 
void Eval1dDerivBasisAtCustPoints (Array2D< double > &dpsi, int kord, const Array1D< double > &custPoints)
 
void Eval2ndDerivBasis (const double &xi, Array1D< double > &ddP)
 
void Eval2ndDerivCustPoints (Array2D< double > &psi, int kord, Array1D< double > &custPoints)
 
void Get1dNormsSq (Array1D< double > &psi1dSq) const
 Get the norms-squared of the basis functions. Returns the values for each basis function in the passed Array1D array.
 
void Get1dNormsSqExact (Array1D< double > &psi1dSqExact) const
 Get the analytic norms-squared of the basis functions. Returns the values for each basis function in the passed Array1D array.
 
void GetRandSample (Array1D< double > &randSamples)
 Get samples of the random variables associated with the current PC basis functions and return them in the 1D array randSamples. Take as many samples as the length of the array randSamples.
 
void GetRandSample (double *randSamples, const int &nSamp)
 Get nSamp samples of the random variables associated with the current PC basis functions and return them in the double* randSamples.
 
int GetSeed () const
 Get the random number generator seed.
 
void SeedRandNumGen (const int &seed)
 Function to (re)seed the random number generator used to sample the Basis functions.
 
void GetQuadRule (Array2D< double > &qPoints, Array1D< double > &qWeights, Array2D< int > &qIndices)
 Get the quadrature integration information.
 
void GetQuadPoints (Array2D< double > &quadPoints) const
 Get the quadrature points in the passed Array2D array.
 
void GetQuadWeights (Array1D< double > &quadWeights) const
 Get the quadrature weights in the passed Array1D array.
 
void GetQuadIndices (Array2D< int > &quadIndices) const
 Get the quadrature points' indices in the passed Array1D array.
 
void GetBasisAtQuadPoints (Array2D< double > &psi1d) const
 Get the basis values at quadrature points in the passed Array2D array.
 
string GetPCType () const
 Get the PC type.
 
double GetAlpha () const
 Get the value of the parameter alpha.
 
double GetBeta () const
 Get the value of the parameter beta.
 
+ + + + + + + + + + +

+Private Member Functions

 PCBasis (const PCBasis &obj)
 Dummy default constructor, which should not be used as it is not well defined Therefore we make it private so it is not accessible.
 
void Eval1dNormSq (int kord)
 Evaluate the norms (squared) of the basis functions and stores in the private array psi1dSq_.
 
double NormSq_Exact (int kord)
 Evaluate 1d norm of order kord exactly.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Attributes

string type_
 String indicator of type of basis functions used.
 
Array2D< double > quadPoints_
 Array to store quadrature points.
 
Array1D< double > quadWeights_
 Array to store quadrature weights.
 
Array2D< int > quadIndices_
 Array to store quadrature point indexing; useful only for nested rules.
 
Array2D< double > psi1d_
 Array to store basis functions evaluated at quadrature points for each order: psi1d_(iqp,iord) contains the value of the polynomial chaos basis of order iord at the location of quadrature point iqp.
 
Array1D< double > psi1dSq_
 Array with the norms squared of the 1D basis functions for each order.
 
Array1D< double > psi1dSqExact_
 Array with the exact norms squared of the 1D basis functions for each order.
 
int maxord_
 Maximal order of any dimension.
 
int narg_
 Number of parameters to specify the basis.
 
double alpha_
 Parameter alpha for PCs that require a parameter (LG,SW,JB)
 
double beta_
 Parameter beta for PCs that require two parameters (SW,JB)
 
dsfmt_t rnstate_
 Random sequence state for dsfmt.
 
int rSeed_
 The seed used for the random number generators that sample the xi's in the basis functions.
 
+

Detailed Description

+

Contains all basis type specific definitions and operations needed to generate a PCSet.

+

Constructor & Destructor Documentation

+ +

◆ PCBasis() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
PCBasis::PCBasis (const string type = "LU",
const double alpha = 0.0,
const double betta = 1.0,
const int maxord = 10 )
+
+ +

Constructor: initializes the univariate basis type and order.

+

Currently, the only valid types are Hermite-Gaussian, denoted with "HG", Legendre-Uniform, denoted with "LU", or Laguerre-Gamma, denoted with "LG". (Where the shape parameter for the Gamma distribution is alpha + 1 = 2)

Todo
At some point, the basis selection should probably be implemented in a more elegant way using base and inherited classes. For the time being, Hermite-Gaussian or Legendre-Uniform will probably be the most commonly used cases. The parameters alpha and betta are relevant only for LG, SW and JB chaoses
+
Note
Maxord specifies the maximal order up to which the computations are performed
+ +
+
+ +

◆ ~PCBasis()

+ +
+
+ + + + + +
+ + + + + + + +
PCBasis::~PCBasis ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+ +

◆ PCBasis() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
PCBasis::PCBasis (const PCBasis & obj)
+ 		+inlineprivate
+
+ +

Dummy default constructor, which should not be used as it is not well defined Therefore we make it private so it is not accessible.

+
Note
All parameters are intialized to dummy values.
+

Dummy copy constructor, which should not be used as it is currently not well defined. Therefore we make it private so it is not accessible.

Note
I am not sure actually whether the initialization performed below is legal as it requires access to private data members of the class that is passed in.
+ +
+
+

Member Function Documentation

+ +

◆ Eval1dBasisAtCustPoints()

+ +
+
+ + + + + + + + + + + + + + + + +
void PCBasis::Eval1dBasisAtCustPoints (Array2D< double > & psi,
int kord,
const Array1D< double > & custPoints )
+
+ +

Evaluate polynomial 1d basis functions up to the order kord at custom points given by an array custPoints Returns the evaluations in the first argument psi, where the number of rows are the number of points, and columns correspond to successive orders.

+ +
+
+ +

◆ Eval1dBasisAtQuadPoints()

+ +
+
+ + + + + + + +
void PCBasis::Eval1dBasisAtQuadPoints ()
+
+ +

Evaluate polynomial 1d basis functions at quadrature points and store in the private variable psi1d_.

+ +
+
+ +

◆ Eval1dDerivBasisAtCustPoints()

+ +
+
+ + + + + + + + + + + + + + + + +
void PCBasis::Eval1dDerivBasisAtCustPoints (Array2D< double > & dpsi,
int kord,
const Array1D< double > & custPoints )
+
+ +
+
+ +

◆ Eval1dNormSq()

+ +
+
+ + + + + +
+ + + + + + + +
void PCBasis::Eval1dNormSq (int kord)
+ 		+private
+
+ +

Evaluate the norms (squared) of the basis functions and stores in the private array psi1dSq_.

+ +
+
+ +

◆ Eval1dNormSq_Exact()

+ +
+
+ + + + + + + +
void PCBasis::Eval1dNormSq_Exact (int kord)
+
+ +

Evaluate the norms (squared) of the basis functions exactly and stores in the private array psi1dSqExact_.

+ +
+
+ +

◆ Eval2ndDerivBasis()

+ +
+
+ + + + + + + + + + + +
void PCBasis::Eval2ndDerivBasis (const double & xi,
Array1D< double > & ddP )
+
+ +
+
+ +

◆ Eval2ndDerivCustPoints()

+ +
+
+ + + + + + + + + + + + + + + + +
void PCBasis::Eval2ndDerivCustPoints (Array2D< double > & psi,
int kord,
Array1D< double > & custPoints )
+
+ +
+
+ +

◆ EvalBasis() [1/2]

+ +
+
+ + + + + + + + + + + +
double PCBasis::EvalBasis (const double & xi,
Array1D< double > & basisEvals ) const
+
+ +

Evaluate 1d basis functions for the given value of random variable xi. Return the value of the basis functions for all orders in the passed Array1D array (indexed by their order), also returns the highest-order value.

+
Note
For custom 'pdf' option, a file containing the polynomial recursion coefficients, called 'ab.dat', is required.
+
Todo
Import the recursion coefficients in a more friendly fashion.
+ +
+
+ +

◆ EvalBasis() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
double PCBasis::EvalBasis (const double & xi,
const int kord,
double * basisEvals ) const
+
+ +

Evaluate 1d basis functions for the given value of random variable xi. Return the value of the basis functions for all orders in the passed double * array (indexed by their order), also returns the highest-order value.

+ +
+
+ +

◆ EvalDerivBasis()

+ +
+
+ + + + + + + + + + + +
void PCBasis::EvalDerivBasis (const double & xi,
Array1D< double > & basisDEvals )
+
+ +

Evaluate derivative of 1d non-normalized Legendre basis.

+ +
+
+ +

◆ Get1dNormsSq()

+ +
+
+ + + + + +
+ + + + + + + +
void PCBasis::Get1dNormsSq (Array1D< double > & psi1dSq) const
+ 		+inline
+
+ +

Get the norms-squared of the basis functions. Returns the values for each basis function in the passed Array1D array.

+ +
+
+ +

◆ Get1dNormsSqExact()

+ +
+
+ + + + + +
+ + + + + + + +
void PCBasis::Get1dNormsSqExact (Array1D< double > & psi1dSqExact) const
+ 		+inline
+
+ +

Get the analytic norms-squared of the basis functions. Returns the values for each basis function in the passed Array1D array.

+ +
+
+ +

◆ GetAlpha()

+ +
+
+ + + + + +
+ + + + + + + +
double PCBasis::GetAlpha () const
+ 		+inline
+
+ +

Get the value of the parameter alpha.

+ +
+
+ +

◆ GetBasisAtQuadPoints()

+ +
+
+ + + + + +
+ + + + + + + +
void PCBasis::GetBasisAtQuadPoints (Array2D< double > & psi1d) const
+ 		+inline
+
+ +

Get the basis values at quadrature points in the passed Array2D array.

+ +
+
+ +

◆ GetBeta()

+ +
+
+ + + + + +
+ + + + + + + +
double PCBasis::GetBeta () const
+ 		+inline
+
+ +

Get the value of the parameter beta.

+ +
+
+ +

◆ GetPCType()

+ +
+
+ + + + + +
+ + + + + + + +
string PCBasis::GetPCType () const
+ 		+inline
+
+ +

Get the PC type.

+ +
+
+ +

◆ GetQuadIndices()

+ +
+
+ + + + + +
+ + + + + + + +
void PCBasis::GetQuadIndices (Array2D< int > & quadIndices) const
+ 		+inline
+
+ +

Get the quadrature points' indices in the passed Array1D array.

+ +
+
+ +

◆ GetQuadPoints()

+ +
+
+ + + + + +
+ + + + + + + +
void PCBasis::GetQuadPoints (Array2D< double > & quadPoints) const
+ 		+inline
+
+ +

Get the quadrature points in the passed Array2D array.

+
Note
Although quadPoints is a 2D array, its second dimension is equal to 1
+ +
+
+ +

◆ GetQuadRule()

+ +
+
+ + + + + + + + + + + + + + + + +
void PCBasis::GetQuadRule (Array2D< double > & qPoints,
Array1D< double > & qWeights,
Array2D< int > & qIndices )
+
+ +

Get the quadrature integration information.

+ +
+
+ +

◆ GetQuadWeights()

+ +
+
+ + + + + +
+ + + + + + + +
void PCBasis::GetQuadWeights (Array1D< double > & quadWeights) const
+ 		+inline
+
+ +

Get the quadrature weights in the passed Array1D array.

+ +
+
+ +

◆ GetRandSample() [1/2]

+ +
+
+ + + + + + + +
void PCBasis::GetRandSample (Array1D< double > & randSamples)
+
+ +

Get samples of the random variables associated with the current PC basis functions and return them in the 1D array randSamples. Take as many samples as the length of the array randSamples.

+
Note
This function does NOT reset the random number seed before sampling
+ +
+
+ +

◆ GetRandSample() [2/2]

+ +
+
+ + + + + + + + + + + +
void PCBasis::GetRandSample (double * randSamples,
const int & nSamp )
+
+ +

Get nSamp samples of the random variables associated with the current PC basis functions and return them in the double* randSamples.

+
Note
This function does NOT reset the random number seed before sampling
+ +
+
+ +

◆ GetSeed()

+ +
+
+ + + + + +
+ + + + + + + +
int PCBasis::GetSeed () const
+ 		+inline
+
+ +

Get the random number generator seed.

+ +
+
+ +

◆ Init1dQuadPoints()

+ +
+
+ + + + + + + +
void PCBasis::Init1dQuadPoints (int qdpts)
+
+ +

Initialize the quadrature points and weights and store the information in arrays quadPoints_, quadWeights_,quadIndices_.

+
Note
Uses an arbitrary number of quad. points.
+
+The default implementation relies on N_q=2*p+1 quadrature points, where p is the maximal order and N_q is the number of quadrature points
+
Todo
Come up with a smarter way to pick the number of quadrature points
+
Note
Quadrature points are set according to the basis function type
+
+quadPoints is a 2D array but its second dimension is equal to 1.
+ +
+
+ +

◆ NormSq_Exact()

+ +
+
+ + + + + +
+ + + + + + + +
double PCBasis::NormSq_Exact (int kord)
+ 		+private
+
+ +

Evaluate 1d norm of order kord exactly.

+ +
+
+ +

◆ SeedRandNumGen()

+ +
+
+ + + + + + + +
void PCBasis::SeedRandNumGen (const int & seed)
+
+ +

Function to (re)seed the random number generator used to sample the Basis functions.

+ +
+
+

Member Data Documentation

+ +

◆ alpha_

+ +
+
+ + + + + +
+ + + + +
double PCBasis::alpha_
+ 		+private
+
+ +

Parameter alpha for PCs that require a parameter (LG,SW,JB)

+ +
+
+ +

◆ beta_

+ +
+
+ + + + + +
+ + + + +
double PCBasis::beta_
+ 		+private
+
+ +

Parameter beta for PCs that require two parameters (SW,JB)

+ +
+
+ +

◆ maxord_

+ +
+
+ + + + + +
+ + + + +
int PCBasis::maxord_
+ 		+private
+
+ +

Maximal order of any dimension.

+ +
+
+ +

◆ narg_

+ +
+
+ + + + + +
+ + + + +
int PCBasis::narg_
+ 		+private
+
+ +

Number of parameters to specify the basis.

+ +
+
+ +

◆ psi1d_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> PCBasis::psi1d_
+ 		+private
+
+ +

Array to store basis functions evaluated at quadrature points for each order: psi1d_(iqp,iord) contains the value of the polynomial chaos basis of order iord at the location of quadrature point iqp.

+ +
+
+ +

◆ psi1dSq_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> PCBasis::psi1dSq_
+ 		+private
+
+ +

Array with the norms squared of the 1D basis functions for each order.

+ +
+
+ +

◆ psi1dSqExact_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> PCBasis::psi1dSqExact_
+ 		+private
+
+ +

Array with the exact norms squared of the 1D basis functions for each order.

+ +
+
+ +

◆ quadIndices_

+ +
+
+ + + + + +
+ + + + +
Array2D<int> PCBasis::quadIndices_
+ 		+private
+
+ +

Array to store quadrature point indexing; useful only for nested rules.

+ +
+
+ +

◆ quadPoints_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> PCBasis::quadPoints_
+ 		+private
+
+ +

Array to store quadrature points.

+ +
+
+ +

◆ quadWeights_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> PCBasis::quadWeights_
+ 		+private
+
+ +

Array to store quadrature weights.

+ +
+
+ +

◆ rnstate_

+ +
+
+ + + + + +
+ + + + +
dsfmt_t PCBasis::rnstate_
+ 		+private
+
+ +

Random sequence state for dsfmt.

+
Todo
need more functionalities to get/set this variable from user
+ +
+
+ +

◆ rSeed_

+ +
+
+ + + + + +
+ + + + +
int PCBasis::rSeed_
+ 		+private
+
+ +

The seed used for the random number generators that sample the xi's in the basis functions.

+

This seed is set to 1 during the class construction and can be reset with the SeedRandNumGen function

See also
SeedRandNumGen
+ +
+
+ +

◆ type_

+ +
+
+ + + + + +
+ + + + +
string PCBasis::type_
+ 		+private
+
+ +

String indicator of type of basis functions used.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classPCSet-members.html b/docs/html/classPCSet-members.html new file mode 100644 index 00000000..b5c3c194 --- /dev/null +++ b/docs/html/classPCSet-members.html @@ -0,0 +1,246 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
PCSet Member List
+
+
+ +

This is the complete list of members for PCSet, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Add(const double *p1, const double *p2, double *p3) constPCSet
Add(const Array1D< double > &p1, const Array1D< double > &p2, Array1D< double > &p3) constPCSet
AddInPlace(double *p1, const double *p2) constPCSet
AddInPlace(Array1D< double > &p1, const Array1D< double > &p2) constPCSet
alpha_PCSetprivate
beta_PCSetprivate
Check_CVflag(void *flagvalue, const char *funcname, int opt) constPCSetprivate
ComputeEffDims(int *effdim)PCSet
ComputeEffDims(Array1D< int > &effdim)PCSet
ComputeJointSens(Array1D< double > &coef, Array2D< double > &jointsens)PCSet
ComputeMainSens(Array1D< double > &coef, Array1D< double > &mainsens)PCSet
ComputeMaxOrdPerDim()PCSetprivate
ComputeMean(const double *coef)PCSet
ComputeMean(Array1D< double > &coef)PCSet
ComputeOrders(Array1D< int > &orders)PCSet
ComputeTotSens(Array1D< double > &coef, Array1D< double > &totsens)PCSet
ComputeVarFrac(const double *coef, double *varfrac)PCSet
ComputeVarFrac(Array1D< double > &coef, Array1D< double > &varfrac)PCSet
Copy(double *p1, const double *p2) constPCSet
Copy(Array1D< double > &p1, const Array1D< double > &p2) constPCSet
CVabst_PCSetprivate
CVinitstep_PCSetprivate
CVmaxnumsteps_PCSetprivate
CVmaxord_PCSetprivate
CVmaxstep_PCSetprivate
CVrelt_PCSetprivate
ddPhi(Array1D< double > &x, Array2D< int > &mindex, Array2D< double > &grad, Array1D< double > &ck)PCSet
ddPhi_alpha(Array1D< double > &x, Array1D< int > &alpha, Array2D< double > &grad)PCSet
Derivative(const double *p1, double *p2) constPCSet
Derivative(const Array1D< double > &p1, Array1D< double > &p2) constPCSet
Div(const double *p1, const double *p2, double *p3) constPCSet
Div(const Array1D< double > &p1, const Array1D< double > &p2, Array1D< double > &p3) constPCSet
dPhi(Array1D< double > &x, Array2D< int > &mindex, Array1D< double > &grad, Array1D< double > &ck)PCSet
dPhi(Array2D< double > &x, Array2D< int > &mindex, Array2D< double > &grad, Array1D< double > &ck)PCSet
dPhi_alpha(Array1D< double > &x, Array1D< int > &alpha, Array1D< double > &grad)PCSet
DrawSampleSet(const Array1D< double > &p, Array1D< double > &samples)PCSet
DrawSampleSet(const double *p, double *samples, const int &nSamples)PCSet
DrawSampleVar(Array2D< double > &samples) constPCSet
DrawSampleVar(double *samples, const int &nS, const int &nD) constPCSet
EncodeMindex(Array1D< Array2D< int > > &sp_mindex)PCSet
EvalBasisAtCustPts(const Array2D< double > &custPoints, Array2D< double > &psi)PCSet
EvalBasisAtCustPts(const double *custPoints, const int npts, double *psi)PCSet
EvalBasisProd3()PCSetprivate
EvalBasisProd4()PCSetprivate
EvalNormSq(Array1D< double > &normsq)PCSet
EvalNormSq(double *normsq, const int npc)PCSet
EvalNormSqExact(Array1D< double > &normsq)PCSet
EvalPC(const Array1D< double > &p, Array1D< double > &randVarSamples)PCSet
EvalPC(const double *p, const double *randVarSamples)PCSet
EvalPCAtCustPoints(Array1D< double > &xch, Array2D< double > &custPoints, Array1D< double > &p)PCSet
Exp(const double *p1, double *p2) constPCSet
Exp(const Array1D< double > &p1, Array1D< double > &p2) constPCSet
GalerkProjection(const Array1D< double > &fcn, Array1D< double > &ck)PCSet
GalerkProjectionMC(const Array2D< double > &x, const Array1D< double > &fcn, Array1D< double > &ck)PCSet
GetAlpha() constPCSetinline
GetBeta() constPCSetinline
GetGMRESDivTolerance() constPCSetinline
GetModesRMS(const double *p) constPCSet
GetModesRMS(const Array1D< double > &p) constPCSet
GetMultiIndex(Array2D< int > &mindex) constPCSetinline
GetMultiIndex(int *mindex) constPCSet
GetNDim() constPCSetinline
GetNormSq(Array1D< double > &normsq) constPCSetinline
GetNQuadPoints() constPCSetinline
GetNumberPCTerms() constPCSetinline
GetNumQuadProd() constPCSet
GetNumTripleProd() constPCSet
GetOrder() constPCSetinline
GetPCType() constPCSetinline
GetPsi(Array2D< double > &psi) constPCSetinline
GetPsi(double *psi) constPCSetinline
GetPsiSq(Array1D< double > &psisq) constPCSetinline
GetPsiSq(double *psisq) constPCSetinline
GetQuadPoints(Array2D< double > &quad) constPCSetinline
GetQuadPoints(double *quad) constPCSetinline
GetQuadPointsWeights(Array2D< double > &quad, Array1D< double > &wghts) constPCSetinline
GetQuadProd(int *nQuad, int *iProd, int *jProd, int *kProd, double *Cijkl) constPCSet
GetQuadProd(Array1D< int > &nQuad, Array1D< int > &iProd, Array1D< int > &jProd, Array1D< int > &kProd, Array1D< double > &Cijkl) constPCSet
GetQuadWeights(Array1D< double > &wghts) constPCSetinline
GetQuadWeights(double *wghts) constPCSetinline
GetTaylorTermsMax() constPCSetinline
GetTaylorTolerance() constPCSetinline
GetTripleProd(int *nTriple, int *iProd, int *jProd, double *Cijk) constPCSet
GetTripleProd(Array1D< int > &nTriple, Array1D< int > &iProd, Array1D< int > &jProd, Array1D< double > &Cijk) constPCSet
GMRESMatrixVectorProd(const double *x, const double *a, double *y) constPCSetprivate
GMRESMatrixVectorProdWrapper(int *n, double *x, double *y, int *nelt, int *ia, int *ja, double *a, int *obj)PCSetinlineprivatestatic
GMRESPreCondWrapper(int *n, double *r, double *z, int *nelt, int *ia, int *ja, double *a, int *obj, double *rwork, int *iwork)PCSetinlineprivatestatic
Initialize(const string ordertype)PCSetprivate
InitISP()PCSetprivate
InitMeanStDv(const double &m, const double &s, double *p) constPCSet
InitMeanStDv(const double &m, const double &s, Array1D< double > &p) constPCSet
InitNISP()PCSetprivate
Inv(const double *p1, double *p2) constPCSet
Inv(const Array1D< double > &p1, Array1D< double > &p2) constPCSet
IPow(const double *p1, double *p2, const int &ia) constPCSet
IPow(const Array1D< double > &p1, Array1D< double > &p2, const int &ia) constPCSet
iProd2_PCSetprivate
iProd3_PCSetprivate
IsInDomain(double x)PCSet
jProd2_PCSetprivate
jProd3_PCSetprivate
kProd3_PCSetprivate
Log(const double *p1, double *p2) constPCSet
Log(const Array1D< double > &p1, Array1D< double > &p2) constPCSet
Log10(const double *p1, double *p2) constPCSet
Log10(const Array1D< double > &p1, Array1D< double > &p2) constPCSet
LogInt(const double *p1, double *p2) constPCSetprivate
LogIntRhs(sunrealtype t, N_Vector y, N_Vector ydot, void *f_data) constPCSetprivate
LogIntRhsWrapper(sunrealtype t, N_Vector y, N_Vector ydot, void *f_data)PCSetinlineprivatestatic
logMethod_PCSetprivate
LogTaylor(const double *p1, double *p2) constPCSetprivate
maxorddim_PCSetprivate
maxOrders_PCSetprivate
maxOrdPerDim_PCSetprivate
maxTermTaylor_PCSetprivate
multiIndex_PCSetprivate
Multiply(const double *p1, const double &a, double *p2) constPCSet
Multiply(const Array1D< double > &p1, const double &a, Array1D< double > &p2) constPCSet
MultiplyInPlace(double *p1, const double &a) constPCSet
MultiplyInPlace(Array1D< double > &p1, const double &a) constPCSet
my_index_PCSetprivate
narg_PCSetprivate
nDim_PCSetprivate
next_index_PCSetprivatestatic
nPCTerms_PCSetprivate
nQuadPoints_PCSetprivate
omap_PCSetprivatestatic
OMap_t typedefPCSetprivate
order_PCSetprivate
p_basis_PCSetprivate
pcSeq_PCSetprivate
PCSet(const string sp_type, const int order, const int n_dim, const string pc_type, const double alpha=0.0, const double betta=1.0)PCSet
PCSet(const string sp_type, const int order, const int n_dim, const string pc_type, const string pc_seq, const double alpha=0.0, const double betta=1.0)PCSet
PCSet(const string sp_type, const Array1D< int > &maxOrders, const int n_dim, const string pc_type, const double alpha=0.0, const double betta=1.0)PCSet
PCSet(const string sp_type, const Array2D< int > &customMultiIndex, const string pc_type, const double alpha=0.0, const double betta=1.0)PCSet
PCSet()PCSetinlineprivate
PCSet(const PCSet &obj)PCSetinlineprivate
pcType_PCSetprivate
Polyn(const double *polycf, int npoly, const double *p1, double *p2) constPCSet
Polyn(const Array1D< double > &polycf, const Array1D< double > &p1, Array1D< double > &p2) constPCSet
PolynMulti(const Array1D< double > &polycf, const Array2D< int > &mindex, const Array2D< double > &p1, Array1D< double > &p2) constPCSet
PrintMultiIndex() constPCSet
PrintMultiIndexNormSquared() constPCSet
Prod(const double *p1, const double *p2, double *p3) constPCSet
Prod(const Array1D< double > &p1, const Array1D< double > &p2, Array1D< double > &p3) constPCSet
Prod3(const double *p1, const double *p2, const double *p3, double *p4) constPCSet
Prod3(const Array1D< double > &p1, const Array1D< double > &p2, const Array1D< double > &p3, Array1D< double > &p4) constPCSet
psi_PCSetprivate
psiIJKLProd3_PCSetprivate
psiIJKProd2_PCSetprivate
psiSq_PCSetprivate
quadIndices_PCSetprivate
quadPoints_PCSetprivate
quadWeights_PCSetprivate
RPow(const double *p1, double *p2, const double &a) constPCSet
RPow(const Array1D< double > &p1, Array1D< double > &p2, const double &a) constPCSet
rTolGMRESDiv_PCSetprivate
rTolTaylor_PCSetprivate
SeedBasisRandNumGen(const int &seed) constPCSet
SetGMRESDivTolerance(const double &rTol)PCSetinline
SetLogCompMethod(const LogCompMethod &logMethod)PCSetinline
SetQd1d(Array1D< double > &qdpts1d, Array1D< double > &wghts1d, int nqd)PCSet
SetQuadRule(const string grid_type, const string fs_type, int param)PCSet
SetQuadRule(Quad &quadRule)PCSet
SetTaylorTermsMax(const int &maxTerm)PCSetinline
SetTaylorTolerance(const double &rTol)PCSetinline
SetVerbosity(int verbosity)PCSetinline
SMALL_PCSetprivate
spType_PCSetprivate
StDv(const double *p) constPCSet
StDv(const Array1D< double > &p) constPCSet
Subtract(const double *p1, const double *p2, double *p3) constPCSet
Subtract(const Array1D< double > &p1, const Array1D< double > &p2, Array1D< double > &p3) constPCSet
SubtractInPlace(double *p1, const double *p2) constPCSet
SubtractInPlace(Array1D< double > &p1, const Array1D< double > &p2) constPCSet
uqtkverbose_PCSetprivate
~PCSet()PCSet
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classPCSet.html b/docs/html/classPCSet.html new file mode 100644 index 00000000..9ab7dff0 --- /dev/null +++ b/docs/html/classPCSet.html @@ -0,0 +1,5421 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: PCSet Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Types | +Private Member Functions | +Static Private Member Functions | +Private Attributes | +Static Private Attributes | +List of all members
+
PCSet Class Reference
+
+
+ +

Defines and initializes PC basis function set and provides functions to manipulate PC expansions defined on this basis set. + More...

+ +

#include <PCSet.h>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 PCSet (const string sp_type, const int order, const int n_dim, const string pc_type, const double alpha=0.0, const double betta=1.0)
 Constructor: initializes the PC basis set for the order, number of dimensions and type that are passed in.
 
 PCSet (const string sp_type, const int order, const int n_dim, const string pc_type, const string pc_seq, const double alpha=0.0, const double betta=1.0)
 Constructor: initializes the PC basis set for the order, number of dimensions and type that are passed in. It also customizes the multiindex sequence ( lexicographical-lex, colexicographical-colex, reverse lexicographical-revlex, and reverse clexicographical-revcolex).
 
 PCSet (const string sp_type, const Array1D< int > &maxOrders, const int n_dim, const string pc_type, const double alpha=0.0, const double betta=1.0)
 Constructor: initializes the PC basis set ordered in an HDMR fashion given order per each HDMR rank (univariate, bivariate, etc...)
 
 PCSet (const string sp_type, const Array2D< int > &customMultiIndex, const string pc_type, const double alpha=0.0, const double betta=1.0)
 Constructor: initializes the PC basis set for a given custom multiIndex.
 
 ~PCSet ()
 Destructor: cleans up all memory and destroys object.
 
void dPhi_alpha (Array1D< double > &x, Array1D< int > &alpha, Array1D< double > &grad)
 Set Gradient and Hessian operators.
 
void dPhi (Array1D< double > &x, Array2D< int > &mindex, Array1D< double > &grad, Array1D< double > &ck)
 Evaluate Gradient at a single d-dim point.
 
void dPhi (Array2D< double > &x, Array2D< int > &mindex, Array2D< double > &grad, Array1D< double > &ck)
 Evaluate Gradient at a multiple d-dim x points.
 
void ddPhi_alpha (Array1D< double > &x, Array1D< int > &alpha, Array2D< double > &grad)
 Evaluate Hessian at a single d-dim point and d-dim basis polynomial.
 
void ddPhi (Array1D< double > &x, Array2D< int > &mindex, Array2D< double > &grad, Array1D< double > &ck)
 Evaluate Gradient at a single d-dim point.
 
void SetQd1d (Array1D< double > &qdpts1d, Array1D< double > &wghts1d, int nqd)
 Set the quadrature rule.
 
void SetQuadRule (const string grid_type, const string fs_type, int param)
 Set the quadrature points by specifying a grid type, a full/sparse indicator, and an integer parameter.
 
void SetQuadRule (Quad &quadRule)
 Set a custom quadrature rule by pointing to the corresponding object.
 
void PrintMultiIndex () const
 Print information on the screen.
 
void PrintMultiIndexNormSquared () const
 For all terms, print their multi-index and norm^2 on the screen.
 
string GetPCType () const
 Get and set variables/arrays inline.
 
double GetAlpha () const
 Get the value of the parameter alpha.
 
double GetBeta () const
 Get the value of the parameter beta.
 
void GetMultiIndex (Array2D< int > &mindex) const
 Get the multiindex (return Array2D)
 
void GetMultiIndex (int *mindex) const
 Get the multiindex (return double *)
 
void GetNormSq (Array1D< double > &normsq) const
 Get the norm-squared.
 
int GetNumberPCTerms () const
 Get the number of terms in a PC expansion of this order and dimension.
 
int GetNDim () const
 Get the PC dimensionality.
 
int GetOrder () const
 Get the PC order.
 
int GetNQuadPoints () const
 Get the number of quadrature points.
 
void GetQuadPoints (Array2D< double > &quad) const
 Get the quadrature points.
 
void GetQuadPointsWeights (Array2D< double > &quad, Array1D< double > &wghts) const
 Get the quadrature points and weights.
 
void GetQuadPoints (double *quad) const
 Get the quadrature points folded into a one-dimensional array quad.
 
void GetQuadWeights (Array1D< double > &wghts) const
 Get the quadrature weights.
 
void GetQuadWeights (double *wghts) const
 Get the quadrature weights folded into a one-dimensional array wghts.
 
void GetPsi (Array2D< double > &psi) const
 Get the values of the basis polynomials evaluated at the quadrature points.
 
void GetPsi (double *psi) const
 Get the polynomials evaluated at the quadrature points folded into a one-dimensional array psi.
 
void GetPsiSq (Array1D< double > &psisq) const
 Get the basis polynomial norms-squared in an array class object psisq.
 
void GetPsiSq (double *psisq) const
 Get the basis polynomial norms-squared in a double* array psisq.
 
double GetTaylorTolerance () const
 Get relative tolerance for Taylor series approximations.
 
void SetTaylorTolerance (const double &rTol)
 Set relative tolerance for Taylor series approximations.
 
int GetTaylorTermsMax () const
 Get maximum number of terms in Taylor series approximations.
 
void SetTaylorTermsMax (const int &maxTerm)
 Set maximum number of terms in Taylor series approximations.
 
void SetLogCompMethod (const LogCompMethod &logMethod)
 Set method of computing the log function.
 
double GetGMRESDivTolerance () const
 Get relative tolerance for GMRES in Div routine.
 
void SetGMRESDivTolerance (const double &rTol)
 Set the relative tolerance for GMRES in Div routine.
 
void InitMeanStDv (const double &m, const double &s, double *p) const
 Intrusive arithmetics.
 
void InitMeanStDv (const double &m, const double &s, Array1D< double > &p) const
 Initializes a PC expansion p in Array1D<double> format to have the same distribution as the underlying PC germ, but with a specified mean m and standard deviation s.
 
void Copy (double *p1, const double *p2) const
 Copy PC expansion p2 into p1 (i.e. p1 = p2).
 
void Copy (Array1D< double > &p1, const Array1D< double > &p2) const
 Copy PC expansion p2 into p1 (i.e. p1 = p2).
 
void Add (const double *p1, const double *p2, double *p3) const
 Add two PC expansions given by double* arguments p1 and p2, and return the result in p3.
 
void Add (const Array1D< double > &p1, const Array1D< double > &p2, Array1D< double > &p3) const
 Add two PC expansions given by Array1D arguments p1 and p2, and return the result in p3.
 
void AddInPlace (double *p1, const double *p2) const
 Add PC expansions given by double* argument p2 to p1 and return the result in p1.
 
void AddInPlace (Array1D< double > &p1, const Array1D< double > &p2) const
 Add PC expansions given by Array1D argument p2 to p1 and return the result in p1.
 
void Multiply (const double *p1, const double &a, double *p2) const
 Multiply PC expansion p1 with scalar a and return the result in p2. All PCEs are in double* format.
 
void Multiply (const Array1D< double > &p1, const double &a, Array1D< double > &p2) const
 Multiply PC expansion p1 with scalar a and return the result in p2. All PCEs are in Array1D format.
 
void MultiplyInPlace (double *p1, const double &a) const
 Multiply PC expansions given by double* argument p1 with scalar a and return the result in p1.
 
void MultiplyInPlace (Array1D< double > &p1, const double &a) const
 Multiply PC expansions given by Array1D argument p1 with scalar a and return the result in p1.
 
void Subtract (const double *p1, const double *p2, double *p3) const
 Subtract PC expansion p2 from p1, and return the result in p3, with all arguments given as double*.
 
void Subtract (const Array1D< double > &p1, const Array1D< double > &p2, Array1D< double > &p3) const
 Subtract PC expansion p2 from p1, and return the result in p3, with all arguments given as Array1D structures.
 
void SubtractInPlace (double *p1, const double *p2) const
 Subtract PC expansion p2 from p1, and return the result in p1, with all arguments given as double*.
 
void SubtractInPlace (Array1D< double > &p1, const Array1D< double > &p2) const
 Subtract PC expansion p2 from p1, and return the result in p1, with all arguments given as Array1D structures.
 
void Prod (const double *p1, const double *p2, double *p3) const
 Multiply two PC expansions given by double* arguments p1 and p2, and return the result in p3.
 
void Prod (const Array1D< double > &p1, const Array1D< double > &p2, Array1D< double > &p3) const
 Multipy two PC expansions given by Array1D arguments p1 and p2, and return the result in p3.
 
void Prod3 (const double *p1, const double *p2, const double *p3, double *p4) const
 Multiply three PC expansions given by double* arguments p1, p2, and p3, and return the result in p4.
 
void Prod3 (const Array1D< double > &p1, const Array1D< double > &p2, const Array1D< double > &p3, Array1D< double > &p4) const
 Multipy three PC expansions given by Array1D arguments p1, p2, and p3, and return the result in p4.
 
void Polyn (const double *polycf, int npoly, const double *p1, double *p2) const
 Evaluates a polynomial of PC that is given in double* argument p1. Polynomial coefficients are given in double* argument polycf of size npoly. The output PC is contained in double* argument p2.
 
void Polyn (const Array1D< double > &polycf, const Array1D< double > &p1, Array1D< double > &p2) const
 Evaluates a polynomial of PC that is given by Array1D argument p1. Polynomial coefficients are given in the Array1D argument polycf. The output PC is contained in Array1D argument p2.
 
void PolynMulti (const Array1D< double > &polycf, const Array2D< int > &mindex, const Array2D< double > &p1, Array1D< double > &p2) const
 Evaluates a multivariate polynomial of a set of PC inputs given by Array2D argument p1 (each column of p1 is a PC input). Polynomial coefficients are given in Array1D argument polycf. Multiindex set for the multivariate polynomial is given in Array2D argument mindex. The output PC is contained in Array1D argument p2.
 
void Exp (const double *p1, double *p2) const
 Take the exp() of the PC expansion given by double* argument p1, and return the result in p2.
 
void Exp (const Array1D< double > &p1, Array1D< double > &p2) const
 Take the exp() of the PC expansion given by Array1D argument p1, and return the result in p2.
 
void Log (const double *p1, double *p2) const
 Take the natural logarithm log() of the PC expansion given by double* argument p1, and return the result in p2. The logarithm is evaluated either via Taylor series or via integration depending on the value of parameter logMethod_.
 
void Log (const Array1D< double > &p1, Array1D< double > &p2) const
 Take the natural logarithm, log(), of the PC expansion given by Array1D argument p1, and return the result in Array1D argument p2.
 
void Log10 (const double *p1, double *p2) const
 Take the logarithm to base 10 of the PC expansion given by double* argument p1, and return the result in p2.
 
void Log10 (const Array1D< double > &p1, Array1D< double > &p2) const
 Take the logarithm to base 10 of the PC expansion given by Array1D argument p1, and return the result in Array1D argument p2.
 
void RPow (const double *p1, double *p2, const double &a) const
 Evaluate power a (a real number) of PC expansion given by double* argument p1, and return the result in p2. The power is computed as p1^a = exp(a*log(p1)), where log(p1) is evaluated either via Taylor series or via integration depending on the value of parameter logMethod_.
 
void RPow (const Array1D< double > &p1, Array1D< double > &p2, const double &a) const
 Evaluate power a (a real number) of PC expansion given by Array1D argument p1, and return the result in Array1D argument p2.
 
void IPow (const double *p1, double *p2, const int &ia) const
 Evaluate power ia (an integer number) of PC expansion given by double* argument p1, and return the result in p2.
 
void IPow (const Array1D< double > &p1, Array1D< double > &p2, const int &ia) const
 Evaluate power ia (an integer number) of PC expansion given by Array1D argument p1, and return the result in Array1D argument p2.
 
void Inv (const double *p1, double *p2) const
 Evaluate the inverse of PC expansion given by double* argument p1, and return the result in p2. The inverse is computed using the division function.
 
void Inv (const Array1D< double > &p1, Array1D< double > &p2) const
 Evaluate the inverse of PC expansion given by Array1D argument p1, and return the result in Array1D argument p2.
 
void Div (const double *p1, const double *p2, double *p3) const
 Divide the PC expansion p1 by p2, and return the result in p3 (All arguments in double* format)
 
void Div (const Array1D< double > &p1, const Array1D< double > &p2, Array1D< double > &p3) const
 Divide the PC expansion p1 by p2, and return the result in p3 (All arguments in Array1D<double> format)
 
double StDv (const double *p) const
 Returns the standard deviation of PC expansion p in a double* format.
 
double StDv (const Array1D< double > &p) const
 Returns the standard deviation of PC expansion p (Argument in Array1D<double> format)
 
double GetModesRMS (const double *p) const
 Compute the rms average of the PC coefficients (i.e. the square root of the average of the square of the PC coefficients, not taking into account any basis functions). (Arguments in double* format)
 
double GetModesRMS (const Array1D< double > &p) const
 Compute the rms average of the PC coefficients (i.e. the square root of the average of the square of the PC coefficients, not taking into account any basis functions). (Arguments in Array1D<double> format)
 
void Derivative (const double *p1, double *p2) const
 Computes derivatives of univariate PC given by coefficients p1 returns coefficient vector of the derivative in p2.
 
void Derivative (const Array1D< double > &p1, Array1D< double > &p2) const
 Computes derivatives of univariate PC given by coefficients p1 returns coefficient vector of the derivative in p2.
 
int GetNumTripleProd () const
 Returns number of triple products.
 
void GetTripleProd (int *nTriple, int *iProd, int *jProd, double *Cijk) const
 Returns triple products indices (int*‍/double* version)
 
void GetTripleProd (Array1D< int > &nTriple, Array1D< int > &iProd, Array1D< int > &jProd, Array1D< double > &Cijk) const
 Returns triple products indices (Array version)
 
int GetNumQuadProd () const
 Returns number of quad products.
 
void GetQuadProd (int *nQuad, int *iProd, int *jProd, int *kProd, double *Cijkl) const
 Returns quad products indices (int*‍/double* version)
 
void GetQuadProd (Array1D< int > &nQuad, Array1D< int > &iProd, Array1D< int > &jProd, Array1D< int > &kProd, Array1D< double > &Cijkl) const
 Returns quad products indices (Array version)
 
void SeedBasisRandNumGen (const int &seed) const
 Random sample generator functions.
 
void DrawSampleSet (const Array1D< double > &p, Array1D< double > &samples)
 Draw a set of samples from the PC expansion p, and return the result in the array samples. All arguments are in Array1D<double> format The number of samples requested is assumed to be the size of the samples array.
 
void DrawSampleSet (const double *p, double *samples, const int &nSamples)
 Draw a set of samples from the PC expansion given in double* argument p, and return the result in double* array samples. The number of samples requested is the argument nSamples.
 
void DrawSampleVar (Array2D< double > &samples) const
 Draw a set of samples of the underlying germ random variable.
 
void DrawSampleVar (double *samples, const int &nS, const int &nD) const
 
double EvalPC (const Array1D< double > &p, Array1D< double > &randVarSamples)
 PC evaluation functionalities.
 
double EvalPC (const double *p, const double *randVarSamples)
 Evaluate the given PC expansion p, at the specified values of the random variables, randVarSamples. All arguments in const double* format.
 
void EvalPCAtCustPoints (Array1D< double > &xch, Array2D< double > &custPoints, Array1D< double > &p)
 Evaluate the given PC expansion at given set of points with given coefficient vector and return the values in an 1D Array in the first argument.
 
void EvalBasisAtCustPts (const Array2D< double > &custPoints, Array2D< double > &psi)
 Evaluate Basis Functions at given points custPoints and return in the array psi.
 
void EvalBasisAtCustPts (const double *custPoints, const int npts, double *psi)
 
void GalerkProjection (const Array1D< double > &fcn, Array1D< double > &ck)
 Galerkin projection functionalities.
 
void GalerkProjectionMC (const Array2D< double > &x, const Array1D< double > &fcn, Array1D< double > &ck)
 Galerkin Projection via Monte-Carlo integration.
 
int ComputeOrders (Array1D< int > &orders)
 Multiindex parsing functionalities.
 
int ComputeEffDims (int *effdim)
 Computes the effective dimensionality of each basis term, i.e., the number of dimensions that enter with a non-zero degree. also returns the maximal dimensionality among all basis terms.
 
int ComputeEffDims (Array1D< int > &effdim)
 Computes the effective dimensionality of each basis term, i.e., the number of dimensions that enter with a non-zero degree. also returns the maximal dimensionality among all basis terms.
 
void EncodeMindex (Array1D< Array2D< int > > &sp_mindex)
 Encode multiIndex into a 'sparse' format where the bases are ordered by their effective dimensionality. The i-th element in sp_mindex stores all the bases that have effective dimensionality equal to i. Also, only non-zero components are stored.
 
double ComputeMean (const double *coef)
 Moment/sensitivity extraction given coefficients.
 
double ComputeMean (Array1D< double > &coef)
 Compute the mean of the PC given coefficient array coef(seeking the zero-th order multiindex)
 
double ComputeVarFrac (const double *coef, double *varfrac)
 Compute the variance fractions of each basis term given coefficients in double *coef; returns the variance fractions in the double *varfrac.
 
double ComputeVarFrac (Array1D< double > &coef, Array1D< double > &varfrac)
 Compute the variance fractions of each basis term given coefficient array coef; returns the variance fractions in the array varfrac.
 
void ComputeMainSens (Array1D< double > &coef, Array1D< double > &mainsens)
 Compute main effect sensitivity (Sobol) indices given coefficient array coef; returns the indices in the array mainsens.
 
void ComputeTotSens (Array1D< double > &coef, Array1D< double > &totsens)
 Compute total effect sensitivity (Sobol) indices given coefficient array coeff; returns the indices in the array totsens.
 
void ComputeJointSens (Array1D< double > &coef, Array2D< double > &jointsens)
 Compute joint effect sensitivity (Sobol) indices given coefficient array coeff; returns the indices in the array jointsens.
 
void SetVerbosity (int verbosity)
 Other.
 
void EvalNormSq (Array1D< double > &normsq)
 Evaluate norms-squared of all bases and return in the array normsq.
 
void EvalNormSq (double *normsq, const int npc)
 
void EvalNormSqExact (Array1D< double > &normsq)
 Evaluate norms-squared analytically of all bases and return in the array normsq.
 
bool IsInDomain (double x)
 Check if the point x is in the PC domain.
 
+ + + + +

+Private Types

typedef std::map< int, PCSet * > OMap_t
 Definition of a map to connect integer indexes with pointers to this class.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Member Functions

 PCSet ()
 Dummy default constructor, which should not be used as it is not well defined Therefore we make it private so it is not accessible.
 
 PCSet (const PCSet &obj)
 Dummy copy constructor, which should not be used as it is currently not well defined. Therefore we make it private so it is not accessible.
 
void ComputeMaxOrdPerDim ()
 Compute maximal order per dimension and fill in the array maxOrdPerDim_.
 
void Initialize (const string ordertype)
 Initialization of the appropriate variables.
 
void InitISP ()
 Initialize quadrature for computing triple products(ISP) and orthogonal projection(NISP)
 
void InitNISP ()
 Initialize variables that are needed only in non-intrusive computations.
 
void EvalBasisProd3 ()
 Evaluate the expectation of product of three basis functions.
 
void EvalBasisProd4 ()
 Evaluate the expectation of product of four basis functions.
 
void GMRESMatrixVectorProd (const double *x, const double *a, double *y) const
 Actual C++ implementation of the matric vector multiplication for GMRES for the division operation.
 
void LogTaylor (const double *p1, double *p2) const
 Computes natural logarithm using Taylor expansion: N p2 = ln(p1) = ln(p1Mean) + sum d n=1 n.
 
void LogInt (const double *p1, double *p2) const
 Computes natural logarithm by numerical integration: calculate p2=ln(p1) by integrating du=dx/x to get ln(x)
 
int LogIntRhs (sunrealtype t, N_Vector y, N_Vector ydot, void *f_data) const
 Evaluates rhs necessary to compute natural logarithm via integration.
 
int Check_CVflag (void *flagvalue, const char *funcname, int opt) const
 Check cvode return for errors.
 
+ + + + + + + + + + +

+Static Private Member Functions

static void GMRESMatrixVectorProdWrapper (int *n, double *x, double *y, int *nelt, int *ia, int *ja, double *a, int *obj)
 Wrapper for Matrix-vector multiplication routine to be called by GMRES.
 
static void GMRESPreCondWrapper (int *n, double *r, double *z, int *nelt, int *ia, int *ja, double *a, int *obj, double *rwork, int *iwork)
 Wrapper for preconditioner routine to be called by GMRES.
 
static int LogIntRhsWrapper (sunrealtype t, N_Vector y, N_Vector ydot, void *f_data)
 Wrapper for LogIntRhs. The first component of f_data pointer carries an integer handle identifying the appropriate PC object.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Attributes

int uqtkverbose_
 Verbosity level.
 
string spType_
 String indicator of ISP or NISP implementation type.
 
string pcType_
 String indicator of PC type.
 
string pcSeq_
 String indicator of multiindex ordering.
 
PCBasis * p_basis_
 Pointer to the class that defines the basis type and functions.
 
int order_
 Order of the PC representation.
 
int maxorddim_
 Maximal order within all dimensions.
 
Array1D< int > maxOrders_
 Array of maximum orders requested if custom(HDMR) ordering is requested.
 
Array1D< int > maxOrdPerDim_
 Array of maximum orders per dimension.
 
const int nDim_
 Number of stochastic dimensions (degrees of freedom) in the PC representation.
 
int nQuadPoints_
 Number of quadrature points used.
 
int nPCTerms_
 Total number of terms in the PC expansions.
 
double rTolTaylor_
 Relative tolerance for Taylor series approximations.
 
int maxTermTaylor_
 Max number of terms in Taylor series approximations.
 
double SMALL_
 Tolerance to avoid floating-point errors.
 
double rTolGMRESDiv_
 GMRES tolerance in Div()
 
Array2D< double > psi_
 Array to store basis functions evaluated at quadrature points for each order: psi_(iqp,ipc) contains the value of the polynomial chaos ipc-th basis at the location of quadrature point iqp.
 
Array1D< double > psiSq_
 Array with the norms squared of the basis functions, corresponding to each term in the PC expansion.
 
Array2D< double > quadPoints_
 Array to store quadrature points.
 
Array1D< double > quadWeights_
 Array to store quadrature weights.
 
Array2D< int > quadIndices_
 Array to store quadrature point indexing; useful for nested rules.
 
Array2D< int > multiIndex_
 Array to store multi-index: multiIndex_(ipc,idim) contains the order of the basis function associated with dimension idim, for the ipc-th term in the PC expansion.
 
Array1D< Array1D< int > > iProd2_
 i-indices of <\Psi_i \Psi_j \Psi_k> terms that are not zero, for all k
 
Array1D< Array1D< int > > jProd2_
 j-indices of <\Psi_i \Psi_j \Psi_k> terms that are not zero, for all k
 
Array1D< Array1D< double > > psiIJKProd2_
 <\Psi_i \Psi_j \Psi_k> terms that are not zero, for all k
 
Array1D< Array1D< int > > iProd3_
 i-indices of <\Psi_i \Psi_j \Psi_k \Psi_l> terms that are not zero, for all l
 
Array1D< Array1D< int > > jProd3_
 j-indices of <\Psi_i \Psi_j \Psi_k \Psi_l> terms that are not zero, for all l
 
Array1D< Array1D< int > > kProd3_
 k-indices of <\Psi_i \Psi_j \Psi_k \Psi_l> terms that are not zero, for all l
 
Array1D< Array1D< double > > psiIJKLProd3_
 <\Psi_i \Psi_j \Psi_k \Psi_l> terms that are not zero, for all l
 
LogCompMethod logMethod_
 Flag for method to compute log: TaylorSeries or Integration.
 
int CVmaxord_
 CVODE parameter: maximal order.
 
int CVmaxnumsteps_
 CVODE parameter: maximal number of steps.
 
double CVinitstep_
 CVODE parameter: initial step size.
 
double CVmaxstep_
 CVODE parameter: maximal step size.
 
double CVrelt_
 CVODE parameter: relative tolerance.
 
double CVabst_
 CVODE parameter: absolute tolerance.
 
int my_index_
 Index of this class.
 
int narg_
 Number of free parameters to specify the basis.
 
double alpha_
 Parameter alpha for PCs that require a parameter (LG,SW,JB)
 
double beta_
 Parameter beta for PCs that require two parameters (SW,JB)
 
+ + + + + + + +

+Static Private Attributes

static int next_index_ = 0
 index of next object in map
 
static OMap_t * omap_ = NULL
 Map to connect integer indexes with pointers to this class.
 
+

Detailed Description

+

Defines and initializes PC basis function set and provides functions to manipulate PC expansions defined on this basis set.

+

Member Typedef Documentation

+ +

◆ OMap_t

+ +
+
+ + + + + +
+ + + + +
std::map<int, PCSet*> PCSet::OMap_t
+ 		+private
+
+ +

Definition of a map to connect integer indexes with pointers to this class.

+ +
+
+

Constructor & Destructor Documentation

+ +

◆ PCSet() [1/6]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
PCSet::PCSet (const string sp_type,
const int order,
const int n_dim,
const string pc_type,
const double alpha = 0.0,
const double betta = 1.0 )
+
+ +

Constructor: initializes the PC basis set for the order, number of dimensions and type that are passed in.

+

Implementation type sp_type has three options "ISP" (intrusive methods), "NISP" (non-intrusive), or "NISPnoq" (non-intrusive without quadrature initialization)

Note
alpha and betta are parameters only relevant for LG, JB or SW chaoses
+ +
+
+ +

◆ PCSet() [2/6]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
PCSet::PCSet (const string sp_type,
const int order,
const int n_dim,
const string pc_type,
const string pc_seq,
const double alpha = 0.0,
const double betta = 1.0 )
+
+ +

Constructor: initializes the PC basis set for the order, number of dimensions and type that are passed in. It also customizes the multiindex sequence ( lexicographical-lex, colexicographical-colex, reverse lexicographical-revlex, and reverse clexicographical-revcolex).

+

Implementation type sp_type has three options "ISP" (intrusive methods), "NISP" (non-intrusive), or "NISPnoq" (non-intrusive without quadrature initialization)

Note
alpha and betta are parameters only relevant for LG, JB or SW chaoses
+ +
+
+ +

◆ PCSet() [3/6]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
PCSet::PCSet (const string sp_type,
const Array1D< int > & maxOrders,
const int n_dim,
const string pc_type,
const double alpha = 0.0,
const double betta = 1.0 )
+
+ +

Constructor: initializes the PC basis set ordered in an HDMR fashion given order per each HDMR rank (univariate, bivariate, etc...)

+

Implementation type sp_type has three options "ISP" (intrusive methods), "NISP" (non-intrusive), or "NISPnoq" (non-intrusive without quadrature initialization)

Note
alpha and betta are parameters only relevant for LG, JB or SW chaoses
+ +
+
+ +

◆ PCSet() [4/6]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
PCSet::PCSet (const string sp_type,
const Array2D< int > & customMultiIndex,
const string pc_type,
const double alpha = 0.0,
const double betta = 1.0 )
+
+ +

Constructor: initializes the PC basis set for a given custom multiIndex.

+

Implementation type sp_type has three options "ISP" (intrusive methods), "NISP" (non-intrusive), or "NISPnoq" (non-intrusive without quadrature initialization)

Note
alpha and betta are parameters only relevant for LG, JB or SW chaoses
+ +
+
+ +

◆ ~PCSet()

+ +
+
+ + + + + + + +
PCSet::~PCSet ()
+
+ +

Destructor: cleans up all memory and destroys object.

+ +
+
+ +

◆ PCSet() [5/6]

+ +
+
+ + + + + +
+ + + + + + + +
PCSet::PCSet ()
+ 		+inlineprivate
+
+ +

Dummy default constructor, which should not be used as it is not well defined Therefore we make it private so it is not accessible.

+
Note
All parameters are intialized to dummy values.
+ +
+
+ +

◆ PCSet() [6/6]

+ +
+
+ + + + + +
+ + + + + + + +
PCSet::PCSet (const PCSet & obj)
+ 		+inlineprivate
+
+ +

Dummy copy constructor, which should not be used as it is currently not well defined. Therefore we make it private so it is not accessible.

+
Note
I am not sure actually whether the initialization performed below is legal as it requires access to private data members of the class that is passed in.
+ +
+
+

Member Function Documentation

+ +

◆ Add() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::Add (const Array1D< double > & p1,
const Array1D< double > & p2,
Array1D< double > & p3 ) const
+
+ +

Add two PC expansions given by Array1D arguments p1 and p2, and return the result in p3.

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ Add() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::Add (const double * p1,
const double * p2,
double * p3 ) const
+
+ +

Add two PC expansions given by double* arguments p1 and p2, and return the result in p3.

+ +
+
+ +

◆ AddInPlace() [1/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::AddInPlace (Array1D< double > & p1,
const Array1D< double > & p2 ) const
+
+ +

Add PC expansions given by Array1D argument p2 to p1 and return the result in p1.

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ AddInPlace() [2/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::AddInPlace (double * p1,
const double * p2 ) const
+
+ +

Add PC expansions given by double* argument p2 to p1 and return the result in p1.

+ +
+
+ +

◆ Check_CVflag()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
int PCSet::Check_CVflag (void * flagvalue,
const char * funcname,
int opt ) const
+ 		+private
+
+ +

Check cvode return for errors.

+ +
+
+ +

◆ ComputeEffDims() [1/2]

+ +
+
+ + + + + + + +
int PCSet::ComputeEffDims (Array1D< int > & effdim)
+
+ +

Computes the effective dimensionality of each basis term, i.e., the number of dimensions that enter with a non-zero degree. also returns the maximal dimensionality among all basis terms.

+
Note
This is not the classical effective dimensionality, since all dimensions can still be involved.
+ +
+
+ +

◆ ComputeEffDims() [2/2]

+ +
+
+ + + + + + + +
int PCSet::ComputeEffDims (int * effdim)
+
+ +

Computes the effective dimensionality of each basis term, i.e., the number of dimensions that enter with a non-zero degree. also returns the maximal dimensionality among all basis terms.

+
Note
This is not the classical effective dimensionality, since all dimensions can still be involved.
+ +
+
+ +

◆ ComputeJointSens()

+ +
+
+ + + + + + + + + + + +
void PCSet::ComputeJointSens (Array1D< double > & coef,
Array2D< double > & jointsens )
+
+ +

Compute joint effect sensitivity (Sobol) indices given coefficient array coeff; returns the indices in the array jointsens.

+
Note
jointsens will be populated as a strictly upper-diagonal matrix
+
Todo
There is no double* version of this function
+ +
+
+ +

◆ ComputeMainSens()

+ +
+
+ + + + + + + + + + + +
void PCSet::ComputeMainSens (Array1D< double > & coef,
Array1D< double > & mainsens )
+
+ +

Compute main effect sensitivity (Sobol) indices given coefficient array coef; returns the indices in the array mainsens.

+
Todo
There is no double* version of this function
+ +
+
+ +

◆ ComputeMaxOrdPerDim()

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::ComputeMaxOrdPerDim ()
+ 		+private
+
+ +

Compute maximal order per dimension and fill in the array maxOrdPerDim_.

+ +
+
+ +

◆ ComputeMean() [1/2]

+ +
+
+ + + + + + + +
double PCSet::ComputeMean (Array1D< double > & coef)
+
+ +

Compute the mean of the PC given coefficient array coef(seeking the zero-th order multiindex)

+ +
+
+ +

◆ ComputeMean() [2/2]

+ +
+
+ + + + + + + +
double PCSet::ComputeMean (const double * coef)
+
+ +

Moment/sensitivity extraction given coefficients.

+

Compute the mean of the PC given coefficients in double *coef (seeking the zero-th order multiindex)

+ +
+
+ +

◆ ComputeOrders()

+ +
+
+ + + + + + + +
int PCSet::ComputeOrders (Array1D< int > & orders)
+
+ +

Multiindex parsing functionalities.

+

Computes the order of each basis term and return it in the array orders, also returns the maximal order

Todo
There is no double* version of this function
+ +
+
+ +

◆ ComputeTotSens()

+ +
+
+ + + + + + + + + + + +
void PCSet::ComputeTotSens (Array1D< double > & coef,
Array1D< double > & totsens )
+
+ +

Compute total effect sensitivity (Sobol) indices given coefficient array coeff; returns the indices in the array totsens.

+
Todo
There is no double* version of this function
+ +
+
+ +

◆ ComputeVarFrac() [1/2]

+ +
+
+ + + + + + + + + + + +
double PCSet::ComputeVarFrac (Array1D< double > & coef,
Array1D< double > & varfrac )
+
+ +

Compute the variance fractions of each basis term given coefficient array coef; returns the variance fractions in the array varfrac.

+
Note
Also returns the variance
+
+The value for the zeroth order term has a special meaning: it is equal to mean^2/variance or (mean/std)^2.
+ +
+
+ +

◆ ComputeVarFrac() [2/2]

+ +
+
+ + + + + + + + + + + +
double PCSet::ComputeVarFrac (const double * coef,
double * varfrac )
+
+ +

Compute the variance fractions of each basis term given coefficients in double *coef; returns the variance fractions in the double *varfrac.

+
Note
Also returns the variance
+
+The value for the zeroth order term has a special meaning: it is equal to mean^2/variance or (mean/std)^2.
+ +
+
+ +

◆ Copy() [1/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::Copy (Array1D< double > & p1,
const Array1D< double > & p2 ) const
+
+ +

Copy PC expansion p2 into p1 (i.e. p1 = p2).

+

All arguments in Array format

Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ Copy() [2/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::Copy (double * p1,
const double * p2 ) const
+
+ +

Copy PC expansion p2 into p1 (i.e. p1 = p2).

+

All arguments in double* format.

+ +
+
+ +

◆ ddPhi()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void PCSet::ddPhi (Array1D< double > & x,
Array2D< int > & mindex,
Array2D< double > & grad,
Array1D< double > & ck )
+
+ +

Evaluate Gradient at a single d-dim point.

+

for a PCSet object

+ +
+
+ +

◆ ddPhi_alpha()

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::ddPhi_alpha (Array1D< double > & x,
Array1D< int > & alpha,
Array2D< double > & grad )
+
+ +

Evaluate Hessian at a single d-dim point and d-dim basis polynomial.

+ +
+
+ +

◆ Derivative() [1/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::Derivative (const Array1D< double > & p1,
Array1D< double > & p2 ) const
+
+ +

Computes derivatives of univariate PC given by coefficients p1 returns coefficient vector of the derivative in p2.

+
Note
Makes use of intrusive computations on recursive formulae for derivatives
+
Todo

Supports LU and HG bases only

+

Supports only for 1d PCs

+
+ +
+
+ +

◆ Derivative() [2/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::Derivative (const double * p1,
double * p2 ) const
+
+ +

Computes derivatives of univariate PC given by coefficients p1 returns coefficient vector of the derivative in p2.

+
Note
Makes use of intrusive computations on recursive formulae for derivatives
+
Todo

Supports LU and HG bases only

+

Supports only for 1d PCs

+
+ +
+
+ +

◆ Div() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::Div (const Array1D< double > & p1,
const Array1D< double > & p2,
Array1D< double > & p3 ) const
+
+ +

Divide the PC expansion p1 by p2, and return the result in p3 (All arguments in Array1D<double> format)

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ Div() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::Div (const double * p1,
const double * p2,
double * p3 ) const
+
+ +

Divide the PC expansion p1 by p2, and return the result in p3 (All arguments in double* format)

+

The "division" p3 = p1/p2 is performed by solving the system of equations p2*p3 = p1 for the unknown p3.

Note
When GMRES is used to solve this system of equations (based on a preprocessor flag in the source code for this routine), a relative tolerance criterium is used that is set by default to 1.e-8, and can be changed with SetGMRESDivTolerance().
+
Todo
Remove duplication of data and parameters that was required for enforcing imposed "const" constraints on some of the arguments and the class data members when they are being passed to fortran.
+ +
+
+ +

◆ dPhi() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void PCSet::dPhi (Array1D< double > & x,
Array2D< int > & mindex,
Array1D< double > & grad,
Array1D< double > & ck )
+
+ +

Evaluate Gradient at a single d-dim point.

+

for a PCSet object

+ +
+
+ +

◆ dPhi() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void PCSet::dPhi (Array2D< double > & x,
Array2D< int > & mindex,
Array2D< double > & grad,
Array1D< double > & ck )
+
+ +

Evaluate Gradient at a multiple d-dim x points.

+

for a PCSet object

+ +
+
+ +

◆ dPhi_alpha()

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::dPhi_alpha (Array1D< double > & x,
Array1D< int > & alpha,
Array1D< double > & grad )
+
+ +

Set Gradient and Hessian operators.

+

Evaluate Gradient at a single d-dim point and d-dim basis polynomial

+ +
+
+ +

◆ DrawSampleSet() [1/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::DrawSampleSet (const Array1D< double > & p,
Array1D< double > & samples )
+
+ +

Draw a set of samples from the PC expansion p, and return the result in the array samples. All arguments are in Array1D<double> format The number of samples requested is assumed to be the size of the samples array.

+
Note
The size of the array p that is passed in needs to equal the number of PC terms
+ +
+
+ +

◆ DrawSampleSet() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::DrawSampleSet (const double * p,
double * samples,
const int & nSamples )
+
+ +

Draw a set of samples from the PC expansion given in double* argument p, and return the result in double* array samples. The number of samples requested is the argument nSamples.

+ +
+
+ +

◆ DrawSampleVar() [1/2]

+ +
+
+ + + + + + + +
void PCSet::DrawSampleVar (Array2D< double > & samples) const
+
+ +

Draw a set of samples of the underlying germ random variable.

+
Todo
There is no double* version of this function
+ +
+
+ +

◆ DrawSampleVar() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::DrawSampleVar (double * samples,
const int & nS,
const int & nD ) const
+
+ +
+
+ +

◆ EncodeMindex()

+ +
+
+ + + + + + + +
void PCSet::EncodeMindex (Array1D< Array2D< int > > & sp_mindex)
+
+ +

Encode multiIndex into a 'sparse' format where the bases are ordered by their effective dimensionality. The i-th element in sp_mindex stores all the bases that have effective dimensionality equal to i. Also, only non-zero components are stored.

+
Todo
There is no double* version of this function
+ +
+
+ +

◆ EvalBasisAtCustPts() [1/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::EvalBasisAtCustPts (const Array2D< double > & custPoints,
Array2D< double > & psi )
+
+ +

Evaluate Basis Functions at given points custPoints and return in the array psi.

+
Todo
There is no double* version of this function
+ +
+
+ +

◆ EvalBasisAtCustPts() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::EvalBasisAtCustPts (const double * custPoints,
const int npts,
double * psi )
+
+ +
+
+ +

◆ EvalBasisProd3()

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::EvalBasisProd3 ()
+ 		+private
+
+ +

Evaluate the expectation of product of three basis functions.

+ +
+
+ +

◆ EvalBasisProd4()

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::EvalBasisProd4 ()
+ 		+private
+
+ +

Evaluate the expectation of product of four basis functions.

+ +
+
+ +

◆ EvalNormSq() [1/2]

+ +
+
+ + + + + + + +
void PCSet::EvalNormSq (Array1D< double > & normsq)
+
+ +

Evaluate norms-squared of all bases and return in the array normsq.

+
Todo
There is no double* version of this function
+ +
+
+ +

◆ EvalNormSq() [2/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::EvalNormSq (double * normsq,
const int npc )
+
+ +
+
+ +

◆ EvalNormSqExact()

+ +
+
+ + + + + + + +
void PCSet::EvalNormSqExact (Array1D< double > & normsq)
+
+ +

Evaluate norms-squared analytically of all bases and return in the array normsq.

+
Todo
There is no double* version of this function
+
Note
Custom PCs do not have this capability
+ +
+
+ +

◆ EvalPC() [1/2]

+ +
+
+ + + + + + + + + + + +
double PCSet::EvalPC (const Array1D< double > & p,
Array1D< double > & randVarSamples )
+
+ +

PC evaluation functionalities.

+

Evaluate the given PC expansion p, at the specified values of the random variables, randVarSamples. All arguments in const Array1D<double> format

Note
The number of elements in p needs to match the number of terms in the PC expansions in this PCSet.
+
+The number of elements in randVarSamples needs to match the number of dimensions in the PC expansion.
+ +
+
+ +

◆ EvalPC() [2/2]

+ +
+
+ + + + + + + + + + + +
double PCSet::EvalPC (const double * p,
const double * randVarSamples )
+
+ +

Evaluate the given PC expansion p, at the specified values of the random variables, randVarSamples. All arguments in const double* format.

+
Note
The number of elements in p is assumed to match the number of terms in the PC expansions in this PCSet.
+
+The number of elements in randVarSamples is assumed to match the number of dimensions in the PC expansion.
+ +
+
+ +

◆ EvalPCAtCustPoints()

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::EvalPCAtCustPoints (Array1D< double > & xch,
Array2D< double > & custPoints,
Array1D< double > & p )
+
+ +

Evaluate the given PC expansion at given set of points with given coefficient vector and return the values in an 1D Array in the first argument.

+
Todo
There is no double* version of this function
+ +
+
+ +

◆ Exp() [1/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::Exp (const Array1D< double > & p1,
Array1D< double > & p2 ) const
+
+ +

Take the exp() of the PC expansion given by Array1D argument p1, and return the result in p2.

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ Exp() [2/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::Exp (const double * p1,
double * p2 ) const
+
+ +

Take the exp() of the PC expansion given by double* argument p1, and return the result in p2.

+

Relies on Taylor series expansion: exp(x) = 1 + x + x^2/2! + x^3/3! + ... However, for efficiency and to avoid overflow, the terms are computed as d_i = d_{i-1}*x/i. Also, to reduce the number of terms needed in the series, we subtract the mean out of a random variable u as u = u_0 + (u-u_0) and exp(u) = exp(u_0)*exp(u-u_0), where exp(u_0) can be computed with the regular exp(double& ) function

Note
The Taylor series is truncated after a tolerance criterium is achieved on the relative error defined as the max absolute value of the PC coefficients in the last added term, divided by the mean of exp(p1). The tolerance is set to 1.e-6 by default and can be changed with SetTaylorTolerance().
+
+The maximum number of terms in the Taylor series is set by default to 500 and can be changed with SetTaylorTermsMax()
+ +
+
+ +

◆ GalerkProjection()

+ +
+
+ + + + + + + + + + + +
void PCSet::GalerkProjection (const Array1D< double > & fcn,
Array1D< double > & ck )
+
+ +

Galerkin projection functionalities.

+

Performs (NISP) Galerkin projection, given function evaluations at quadrature points Returns in the coefficient vector in the second argument

Note
User should make sure that the function HAS BEEN evaluated at the correct quadrature points by first extracting the quadrature points and evaluating the function externally
+
Todo

Overload this with forward function pointers

+

There is no double* version of this function

+
+ +
+
+ +

◆ GalerkProjectionMC()

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::GalerkProjectionMC (const Array2D< double > & x,
const Array1D< double > & fcn,
Array1D< double > & ck )
+
+ +

Galerkin Projection via Monte-Carlo integration.

+
Note
User should make sure that the function HAS BEEN evaluated at the correct sampling points by first sampling the proper PC germ distribution and evaluating the function externally
+
Todo

Overload this with forward function pointers

+

There is no double* version of this function

+
+ +
+
+ +

◆ GetAlpha()

+ +
+
+ + + + + +
+ + + + + + + +
double PCSet::GetAlpha () const
+ 		+inline
+
+ +

Get the value of the parameter alpha.

+ +
+
+ +

◆ GetBeta()

+ +
+
+ + + + + +
+ + + + + + + +
double PCSet::GetBeta () const
+ 		+inline
+
+ +

Get the value of the parameter beta.

+ +
+
+ +

◆ GetGMRESDivTolerance()

+ +
+
+ + + + + +
+ + + + + + + +
double PCSet::GetGMRESDivTolerance () const
+ 		+inline
+
+ +

Get relative tolerance for GMRES in Div routine.

+ +
+
+ +

◆ GetModesRMS() [1/2]

+ +
+
+ + + + + + + +
double PCSet::GetModesRMS (const Array1D< double > & p) const
+
+ +

Compute the rms average of the PC coefficients (i.e. the square root of the average of the square of the PC coefficients, not taking into account any basis functions). (Arguments in Array1D<double> format)

+
Note
Requires the size of the array that is passed in to equal the number of PC terms
+ +
+
+ +

◆ GetModesRMS() [2/2]

+ +
+
+ + + + + + + +
double PCSet::GetModesRMS (const double * p) const
+
+ +

Compute the rms average of the PC coefficients (i.e. the square root of the average of the square of the PC coefficients, not taking into account any basis functions). (Arguments in double* format)

+ +
+
+ +

◆ GetMultiIndex() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::GetMultiIndex (Array2D< int > & mindex) const
+ 		+inline
+
+ +

Get the multiindex (return Array2D)

+ +
+
+ +

◆ GetMultiIndex() [2/2]

+ +
+
+ + + + + + + +
void PCSet::GetMultiIndex (int * mindex) const
+
+ +

Get the multiindex (return double *)

+ +
+
+ +

◆ GetNDim()

+ +
+
+ + + + + +
+ + + + + + + +
int PCSet::GetNDim () const
+ 		+inline
+
+ +

Get the PC dimensionality.

+ +
+
+ +

◆ GetNormSq()

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::GetNormSq (Array1D< double > & normsq) const
+ 		+inline
+
+ +

Get the norm-squared.

+
Todo
this seems like a duplication, see below GetPsiSq()
+ +
+
+ +

◆ GetNQuadPoints()

+ +
+
+ + + + + +
+ + + + + + + +
int PCSet::GetNQuadPoints () const
+ 		+inline
+
+ +

Get the number of quadrature points.

+ +
+
+ +

◆ GetNumberPCTerms()

+ +
+
+ + + + + +
+ + + + + + + +
int PCSet::GetNumberPCTerms () const
+ 		+inline
+
+ +

Get the number of terms in a PC expansion of this order and dimension.

+ +
+
+ +

◆ GetNumQuadProd()

+ +
+
+ + + + + + + +
int PCSet::GetNumQuadProd () const
+
+ +

Returns number of quad products.

+ +
+
+ +

◆ GetNumTripleProd()

+ +
+
+ + + + + + + +
int PCSet::GetNumTripleProd () const
+
+ +

Returns number of triple products.

+ +
+
+ +

◆ GetOrder()

+ +
+
+ + + + + +
+ + + + + + + +
int PCSet::GetOrder () const
+ 		+inline
+
+ +

Get the PC order.

+ +
+
+ +

◆ GetPCType()

+ +
+
+ + + + + +
+ + + + + + + +
string PCSet::GetPCType () const
+ 		+inline
+
+ +

Get and set variables/arrays inline.

+

Get the PC type

+ +
+
+ +

◆ GetPsi() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::GetPsi (Array2D< double > & psi) const
+ 		+inline
+
+ +

Get the values of the basis polynomials evaluated at the quadrature points.

+ +
+
+ +

◆ GetPsi() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::GetPsi (double * psi) const
+ 		+inline
+
+ +

Get the polynomials evaluated at the quadrature points folded into a one-dimensional array psi.

+ +
+
+ +

◆ GetPsiSq() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::GetPsiSq (Array1D< double > & psisq) const
+ 		+inline
+
+ +

Get the basis polynomial norms-squared in an array class object psisq.

+ +
+
+ +

◆ GetPsiSq() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::GetPsiSq (double * psisq) const
+ 		+inline
+
+ +

Get the basis polynomial norms-squared in a double* array psisq.

+ +
+
+ +

◆ GetQuadPoints() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::GetQuadPoints (Array2D< double > & quad) const
+ 		+inline
+
+ +

Get the quadrature points.

+ +
+
+ +

◆ GetQuadPoints() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::GetQuadPoints (double * quad) const
+ 		+inline
+
+ +

Get the quadrature points folded into a one-dimensional array quad.

+ +
+
+ +

◆ GetQuadPointsWeights()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void PCSet::GetQuadPointsWeights (Array2D< double > & quad,
Array1D< double > & wghts ) const
+ 		+inline
+
+ +

Get the quadrature points and weights.

+ +
+
+ +

◆ GetQuadProd() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void PCSet::GetQuadProd (Array1D< int > & nQuad,
Array1D< int > & iProd,
Array1D< int > & jProd,
Array1D< int > & kProd,
Array1D< double > & Cijkl ) const
+
+ +

Returns quad products indices (Array version)

+ +
+
+ +

◆ GetQuadProd() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void PCSet::GetQuadProd (int * nQuad,
int * iProd,
int * jProd,
int * kProd,
double * Cijkl ) const
+
+ +

Returns quad products indices (int*‍/double* version)

+ +
+
+ +

◆ GetQuadWeights() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::GetQuadWeights (Array1D< double > & wghts) const
+ 		+inline
+
+ +

Get the quadrature weights.

+ +
+
+ +

◆ GetQuadWeights() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::GetQuadWeights (double * wghts) const
+ 		+inline
+
+ +

Get the quadrature weights folded into a one-dimensional array wghts.

+ +
+
+ +

◆ GetTaylorTermsMax()

+ +
+
+ + + + + +
+ + + + + + + +
int PCSet::GetTaylorTermsMax () const
+ 		+inline
+
+ +

Get maximum number of terms in Taylor series approximations.

+ +
+
+ +

◆ GetTaylorTolerance()

+ +
+
+ + + + + +
+ + + + + + + +
double PCSet::GetTaylorTolerance () const
+ 		+inline
+
+ +

Get relative tolerance for Taylor series approximations.

+ +
+
+ +

◆ GetTripleProd() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void PCSet::GetTripleProd (Array1D< int > & nTriple,
Array1D< int > & iProd,
Array1D< int > & jProd,
Array1D< double > & Cijk ) const
+
+ +

Returns triple products indices (Array version)

+ +
+
+ +

◆ GetTripleProd() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void PCSet::GetTripleProd (int * nTriple,
int * iProd,
int * jProd,
double * Cijk ) const
+
+ +

Returns triple products indices (int*‍/double* version)

+ +
+
+ +

◆ GMRESMatrixVectorProd()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void PCSet::GMRESMatrixVectorProd (const double * x,
const double * a,
double * y ) const
+ 		+private
+
+ +

Actual C++ implementation of the matric vector multiplication for GMRES for the division operation.

+

Given the structure of the problem, this boils down to the product between two PC variables.

+ +
+
+ +

◆ GMRESMatrixVectorProdWrapper()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
static void PCSet::GMRESMatrixVectorProdWrapper (int * n,
double * x,
double * y,
int * nelt,
int * ia,
int * ja,
double * a,
int * obj )
+ 		+inlinestaticprivate
+
+ +

Wrapper for Matrix-vector multiplication routine to be called by GMRES.

+

As GMRES is a Fortran77 routine, this routine is defined as a static function. One of the function arguments (obj) was originally isym, a flag for matrix symmetry, but has been repurposed to carry an integer handle to identify this object.

Note
The matrix vector product here comes down to a product between two PC expansions.
+ +
+
+ +

◆ GMRESPreCondWrapper()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
static void PCSet::GMRESPreCondWrapper (int * n,
double * r,
double * z,
int * nelt,
int * ia,
int * ja,
double * a,
int * obj,
double * rwork,
int * iwork )
+ 		+inlinestaticprivate
+
+ +

Wrapper for preconditioner routine to be called by GMRES.

+

As GMRES is a Fortran77 routine, this routine is defined as a static function. One of the function arguments (obj) was originally isym, a flag for matrix symmetry, but has been repurposed to carry an integer handle to identify this object.

Note
Since we currently do not use preconditioning, this routine does nothing. It is a place holder for future use.
+ +
+
+ +

◆ Initialize()

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::Initialize (const string ordertype)
+ 		+private
+
+ +

Initialization of the appropriate variables.

+
Note
Intrusive implementation only works with TotalOrder multiindes
+
Todo
Test and allow intrusive implementation with customized multiindices
+ +
+
+ +

◆ InitISP()

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::InitISP ()
+ 		+private
+
+ +

Initialize quadrature for computing triple products(ISP) and orthogonal projection(NISP)

+

Initialize variables that are needed only in intrusive computations

+ +
+
+ +

◆ InitMeanStDv() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::InitMeanStDv (const double & m,
const double & s,
Array1D< double > & p ) const
+
+ +

Initializes a PC expansion p in Array1D<double> format to have the same distribution as the underlying PC germ, but with a specified mean m and standard deviation s.

+
Note
This assumes that the zeroth order term is the first one in the multi-index - this assumption does not hold in general
+
+This function only holds for expansions with one stochastic dimension
+
+All existing coefficient values in p will be overwritten
+
Todo
Make this function work for general multi-indices, and for any number of stochastic dimensions
+ +
+
+ +

◆ InitMeanStDv() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::InitMeanStDv (const double & m,
const double & s,
double * p ) const
+
+ +

Intrusive arithmetics.

+

Initializes a PC expansion p in a double* format to have the same distribution as the underlying PC germ, but with a specified mean m and standard deviation s

Note
This assumes that the zeroth order term is the first one in the multi-index - this assumption does not hold in general
+
+This function only holds for expansions with one stochastic dimension
+
+All existing coefficient values in p will be overwritten
+
Todo
Make this function work for general multi-indices, and for any number of stochastic dimensions
+ +
+
+ +

◆ InitNISP()

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::InitNISP ()
+ 		+private
+
+ +

Initialize variables that are needed only in non-intrusive computations.

+ +
+
+ +

◆ Inv() [1/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::Inv (const Array1D< double > & p1,
Array1D< double > & p2 ) const
+
+ +

Evaluate the inverse of PC expansion given by Array1D argument p1, and return the result in Array1D argument p2.

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ Inv() [2/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::Inv (const double * p1,
double * p2 ) const
+
+ +

Evaluate the inverse of PC expansion given by double* argument p1, and return the result in p2. The inverse is computed using the division function.

+ +
+
+ +

◆ IPow() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::IPow (const Array1D< double > & p1,
Array1D< double > & p2,
const int & ia ) const
+
+ +

Evaluate power ia (an integer number) of PC expansion given by Array1D argument p1, and return the result in Array1D argument p2.

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ IPow() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::IPow (const double * p1,
double * p2,
const int & ia ) const
+
+ +

Evaluate power ia (an integer number) of PC expansion given by double* argument p1, and return the result in p2.

+ +
+
+ +

◆ IsInDomain()

+ +
+
+ + + + + + + +
bool PCSet::IsInDomain (double x)
+
+ +

Check if the point x is in the PC domain.

+ +
+
+ +

◆ Log() [1/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::Log (const Array1D< double > & p1,
Array1D< double > & p2 ) const
+
+ +

Take the natural logarithm, log(), of the PC expansion given by Array1D argument p1, and return the result in Array1D argument p2.

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ Log() [2/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::Log (const double * p1,
double * p2 ) const
+
+ +

Take the natural logarithm log() of the PC expansion given by double* argument p1, and return the result in p2. The logarithm is evaluated either via Taylor series or via integration depending on the value of parameter logMethod_.

+ +
+
+ +

◆ Log10() [1/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::Log10 (const Array1D< double > & p1,
Array1D< double > & p2 ) const
+
+ +

Take the logarithm to base 10 of the PC expansion given by Array1D argument p1, and return the result in Array1D argument p2.

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ Log10() [2/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::Log10 (const double * p1,
double * p2 ) const
+
+ +

Take the logarithm to base 10 of the PC expansion given by double* argument p1, and return the result in p2.

+

First use Log() to compute the natural logarithm and then divide it by log(10)

+ +
+
+ +

◆ LogInt()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void PCSet::LogInt (const double * p1,
double * p2 ) const
+ 		+private
+
+ +

Computes natural logarithm by numerical integration: calculate p2=ln(p1) by integrating du=dx/x to get ln(x)

+ +
+
+ +

◆ LogIntRhs()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + +
int PCSet::LogIntRhs (sunrealtype t,
N_Vector y,
N_Vector ydot,
void * f_data ) const
+ 		+private
+
+ +

Evaluates rhs necessary to compute natural logarithm via integration.

+ +
+
+ +

◆ LogIntRhsWrapper()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + +
static int PCSet::LogIntRhsWrapper (sunrealtype t,
N_Vector y,
N_Vector ydot,
void * f_data )
+ 		+inlinestaticprivate
+
+ +

Wrapper for LogIntRhs. The first component of f_data pointer carries an integer handle identifying the appropriate PC object.

+
Todo
Why is this function a static int instead of static void? Should there be a return statement at the end?
+ +
+
+ +

◆ LogTaylor()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void PCSet::LogTaylor (const double * p1,
double * p2 ) const
+ 		+private
+
+ +

Computes natural logarithm using Taylor expansion: N p2 = ln(p1) = ln(p1Mean) + sum d n=1 n.

+

(n+1) (-1) n p1 where d = -— *x , and x = ---— - 1 n n p1Mean

+
Note
See Exp notes for info related to tolerance and maximum number of terms criteria for truncating the Taylor series
+ +
+
+ +

◆ Multiply() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::Multiply (const Array1D< double > & p1,
const double & a,
Array1D< double > & p2 ) const
+
+ +

Multiply PC expansion p1 with scalar a and return the result in p2. All PCEs are in Array1D format.

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ Multiply() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::Multiply (const double * p1,
const double & a,
double * p2 ) const
+
+ +

Multiply PC expansion p1 with scalar a and return the result in p2. All PCEs are in double* format.

+ +
+
+ +

◆ MultiplyInPlace() [1/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::MultiplyInPlace (Array1D< double > & p1,
const double & a ) const
+
+ +

Multiply PC expansions given by Array1D argument p1 with scalar a and return the result in p1.

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ MultiplyInPlace() [2/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::MultiplyInPlace (double * p1,
const double & a ) const
+
+ +

Multiply PC expansions given by double* argument p1 with scalar a and return the result in p1.

+ +
+
+ +

◆ Polyn() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::Polyn (const Array1D< double > & polycf,
const Array1D< double > & p1,
Array1D< double > & p2 ) const
+
+ +

Evaluates a polynomial of PC that is given by Array1D argument p1. Polynomial coefficients are given in the Array1D argument polycf. The output PC is contained in Array1D argument p2.

+
Note
Requires the size of array p1 to equal the number of PC terms
+ +
+
+ +

◆ Polyn() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void PCSet::Polyn (const double * polycf,
int npoly,
const double * p1,
double * p2 ) const
+
+ +

Evaluates a polynomial of PC that is given in double* argument p1. Polynomial coefficients are given in double* argument polycf of size npoly. The output PC is contained in double* argument p2.

+
Note
Recursive algorithm is implemented.
+ +
+
+ +

◆ PolynMulti()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void PCSet::PolynMulti (const Array1D< double > & polycf,
const Array2D< int > & mindex,
const Array2D< double > & p1,
Array1D< double > & p2 ) const
+
+ +

Evaluates a multivariate polynomial of a set of PC inputs given by Array2D argument p1 (each column of p1 is a PC input). Polynomial coefficients are given in Array1D argument polycf. Multiindex set for the multivariate polynomial is given in Array2D argument mindex. The output PC is contained in Array1D argument p2.

+
Note
Requires the size of the array polycf to equal the first dimension of argument mindex
+
+Requires the size of the array p1 to equal (the number of PC terms) X (second dimension of argument mindex)
+
+Uses a recursive algorithm
+
+Out of convenience, this function so far is implemented for Array classes, not double* arrays.
+
Todo
A double* version should be added.
+ +
+
+ +

◆ PrintMultiIndex()

+ +
+
+ + + + + + + +
void PCSet::PrintMultiIndex () const
+
+ +

Print information on the screen.

+

Print the multi-indices for all terms on the screen

+ +
+
+ +

◆ PrintMultiIndexNormSquared()

+ +
+
+ + + + + + + +
void PCSet::PrintMultiIndexNormSquared () const
+
+ +

For all terms, print their multi-index and norm^2 on the screen.

+ +
+
+ +

◆ Prod() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::Prod (const Array1D< double > & p1,
const Array1D< double > & p2,
Array1D< double > & p3 ) const
+
+ +

Multipy two PC expansions given by Array1D arguments p1 and p2, and return the result in p3.

+
Note
Requires the size of the input arrays to equal the number of PC terms
+ +
+
+ +

◆ Prod() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::Prod (const double * p1,
const double * p2,
double * p3 ) const
+
+ +

Multiply two PC expansions given by double* arguments p1 and p2, and return the result in p3.

+ +
+
+ +

◆ Prod3() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void PCSet::Prod3 (const Array1D< double > & p1,
const Array1D< double > & p2,
const Array1D< double > & p3,
Array1D< double > & p4 ) const
+
+ +

Multipy three PC expansions given by Array1D arguments p1, p2, and p3, and return the result in p4.

+
Note
Requires the size of the input arrays to equal the number of PC terms
+ +
+
+ +

◆ Prod3() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void PCSet::Prod3 (const double * p1,
const double * p2,
const double * p3,
double * p4 ) const
+
+ +

Multiply three PC expansions given by double* arguments p1, p2, and p3, and return the result in p4.

+ +
+
+ +

◆ RPow() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::RPow (const Array1D< double > & p1,
Array1D< double > & p2,
const double & a ) const
+
+ +

Evaluate power a (a real number) of PC expansion given by Array1D argument p1, and return the result in Array1D argument p2.

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ RPow() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::RPow (const double * p1,
double * p2,
const double & a ) const
+
+ +

Evaluate power a (a real number) of PC expansion given by double* argument p1, and return the result in p2. The power is computed as p1^a = exp(a*log(p1)), where log(p1) is evaluated either via Taylor series or via integration depending on the value of parameter logMethod_.

+ +
+
+ +

◆ SeedBasisRandNumGen()

+ +
+
+ + + + + + + +
void PCSet::SeedBasisRandNumGen (const int & seed) const
+
+ +

Random sample generator functions.

+

Reseed the random number generator used for the sampling of the PC variables and expansions

+ +
+
+ +

◆ SetGMRESDivTolerance()

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::SetGMRESDivTolerance (const double & rTol)
+ 		+inline
+
+ +

Set the relative tolerance for GMRES in Div routine.

+ +
+
+ +

◆ SetLogCompMethod()

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::SetLogCompMethod (const LogCompMethod & logMethod)
+ 		+inline
+
+ +

Set method of computing the log function.

+

Use the argument TaylorSeries to select the Taylor series approach or Integration to select the integration method.

+ +
+
+ +

◆ SetQd1d()

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::SetQd1d (Array1D< double > & qdpts1d,
Array1D< double > & wghts1d,
int nqd )
+
+ +

Set the quadrature rule.

+

Obtain 1d quadrature points and weights

Note
This is used in triple or quadruple product computation for which the default quadrature is not enough
+ +
+
+ +

◆ SetQuadRule() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::SetQuadRule (const string grid_type,
const string fs_type,
int param )
+
+ +

Set the quadrature points by specifying a grid type, a full/sparse indicator, and an integer parameter.

+

Full/sparse switch fs_type can be either 'full' or 'sparse' The parameter param is the number of points per dimension for full quadrature, and the level for sparse quadrature Options for grid_type are, besides the standard PC types, 'CC' (Clenshaw-Curtis), 'CCO' (Clenshaw-Curtis open), 'NC' (Newton-Cotes), 'NCO' (Newton-Cotes open), where open means that endpoints are expluded

Note
'NC', 'NCO' quadratures are the same as uniformly spaced grids
+
Todo
Need to improve it
+ +
+
+ +

◆ SetQuadRule() [2/2]

+ +
+
+ + + + + + + +
void PCSet::SetQuadRule (Quad & quadRule)
+
+ +

Set a custom quadrature rule by pointing to the corresponding object.

+ +
+
+ +

◆ SetTaylorTermsMax()

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::SetTaylorTermsMax (const int & maxTerm)
+ 		+inline
+
+ +

Set maximum number of terms in Taylor series approximations.

+ +
+
+ +

◆ SetTaylorTolerance()

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::SetTaylorTolerance (const double & rTol)
+ 		+inline
+
+ +

Set relative tolerance for Taylor series approximations.

+ +
+
+ +

◆ SetVerbosity()

+ +
+
+ + + + + +
+ + + + + + + +
void PCSet::SetVerbosity (int verbosity)
+ 		+inline
+
+ +

Other.

+

Set the verbosity level

Note
Currently, the values of 0, 1 and 2 are implemented
+ +
+
+ +

◆ StDv() [1/2]

+ +
+
+ + + + + + + +
double PCSet::StDv (const Array1D< double > & p) const
+
+ +

Returns the standard deviation of PC expansion p (Argument in Array1D<double> format)

+
Note
This assumes that the zeroth order term is the first one in the multi-index - this assumption does not hold in general
+
Todo
Lift the assumption by looking for the constant term in the multiindex
+
Note
For a more general implementation, see ComputeVarFrac()
+ +
+
+ +

◆ StDv() [2/2]

+ +
+
+ + + + + + + +
double PCSet::StDv (const double * p) const
+
+ +

Returns the standard deviation of PC expansion p in a double* format.

+
Note
This assumes that the zeroth order term is the first one in the multi-index - this assumption does not hold in general
+
Todo
Lift the assumption by looking for the constant term in the multiindex
+ +
+
+ +

◆ Subtract() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::Subtract (const Array1D< double > & p1,
const Array1D< double > & p2,
Array1D< double > & p3 ) const
+
+ +

Subtract PC expansion p2 from p1, and return the result in p3, with all arguments given as Array1D structures.

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ Subtract() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void PCSet::Subtract (const double * p1,
const double * p2,
double * p3 ) const
+
+ +

Subtract PC expansion p2 from p1, and return the result in p3, with all arguments given as double*.

+ +
+
+ +

◆ SubtractInPlace() [1/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::SubtractInPlace (Array1D< double > & p1,
const Array1D< double > & p2 ) const
+
+ +

Subtract PC expansion p2 from p1, and return the result in p1, with all arguments given as Array1D structures.

+
Note
Requires the size of the arrays that are passed in to equal the number of PC terms
+ +
+
+ +

◆ SubtractInPlace() [2/2]

+ +
+
+ + + + + + + + + + + +
void PCSet::SubtractInPlace (double * p1,
const double * p2 ) const
+
+ +

Subtract PC expansion p2 from p1, and return the result in p1, with all arguments given as double*.

+ +
+
+

Member Data Documentation

+ +

◆ alpha_

+ +
+
+ + + + + +
+ + + + +
double PCSet::alpha_
+ 		+private
+
+ +

Parameter alpha for PCs that require a parameter (LG,SW,JB)

+ +
+
+ +

◆ beta_

+ +
+
+ + + + + +
+ + + + +
double PCSet::beta_
+ 		+private
+
+ +

Parameter beta for PCs that require two parameters (SW,JB)

+ +
+
+ +

◆ CVabst_

+ +
+
+ + + + + +
+ + + + +
double PCSet::CVabst_
+ 		+private
+
+ +

CVODE parameter: absolute tolerance.

+ +
+
+ +

◆ CVinitstep_

+ +
+
+ + + + + +
+ + + + +
double PCSet::CVinitstep_
+ 		+private
+
+ +

CVODE parameter: initial step size.

+ +
+
+ +

◆ CVmaxnumsteps_

+ +
+
+ + + + + +
+ + + + +
int PCSet::CVmaxnumsteps_
+ 		+private
+
+ +

CVODE parameter: maximal number of steps.

+ +
+
+ +

◆ CVmaxord_

+ +
+
+ + + + + +
+ + + + +
int PCSet::CVmaxord_
+ 		+private
+
+ +

CVODE parameter: maximal order.

+ +
+
+ +

◆ CVmaxstep_

+ +
+
+ + + + + +
+ + + + +
double PCSet::CVmaxstep_
+ 		+private
+
+ +

CVODE parameter: maximal step size.

+ +
+
+ +

◆ CVrelt_

+ +
+
+ + + + + +
+ + + + +
double PCSet::CVrelt_
+ 		+private
+
+ +

CVODE parameter: relative tolerance.

+ +
+
+ +

◆ iProd2_

+ +
+
+ + + + + +
+ + + + +
Array1D<Array1D<int> > PCSet::iProd2_
+ 		+private
+
+ +

i-indices of <\Psi_i \Psi_j \Psi_k> terms that are not zero, for all k

+
Note
Stored as a vector over k, with each element being a vector of i-indices itself
+ +
+
+ +

◆ iProd3_

+ +
+
+ + + + + +
+ + + + +
Array1D<Array1D<int> > PCSet::iProd3_
+ 		+private
+
+ +

i-indices of <\Psi_i \Psi_j \Psi_k \Psi_l> terms that are not zero, for all l

+
Note
Stored as a vector over l, with each element being a vector of i-indices itself
+ +
+
+ +

◆ jProd2_

+ +
+
+ + + + + +
+ + + + +
Array1D<Array1D<int> > PCSet::jProd2_
+ 		+private
+
+ +

j-indices of <\Psi_i \Psi_j \Psi_k> terms that are not zero, for all k

+
Note
Stored as a vector over k, with each element being a vector of j-indices itself
+ +
+
+ +

◆ jProd3_

+ +
+
+ + + + + +
+ + + + +
Array1D<Array1D<int> > PCSet::jProd3_
+ 		+private
+
+ +

j-indices of <\Psi_i \Psi_j \Psi_k \Psi_l> terms that are not zero, for all l

+
Note
Stored as a vector over l, with each element being a vector of j-indices itself
+ +
+
+ +

◆ kProd3_

+ +
+
+ + + + + +
+ + + + +
Array1D<Array1D<int> > PCSet::kProd3_
+ 		+private
+
+ +

k-indices of <\Psi_i \Psi_j \Psi_k \Psi_l> terms that are not zero, for all l

+
Note
Stored as a vector over l, with each element being a vector of k-indices itself
+ +
+
+ +

◆ logMethod_

+ +
+
+ + + + + +
+ + + + +
LogCompMethod PCSet::logMethod_
+ 		+private
+
+ +

Flag for method to compute log: TaylorSeries or Integration.

+ +
+
+ +

◆ maxorddim_

+ +
+
+ + + + + +
+ + + + +
int PCSet::maxorddim_
+ 		+private
+
+ +

Maximal order within all dimensions.

+ +
+
+ +

◆ maxOrders_

+ +
+
+ + + + + +
+ + + + +
Array1D<int> PCSet::maxOrders_
+ 		+private
+
+ +

Array of maximum orders requested if custom(HDMR) ordering is requested.

+ +
+
+ +

◆ maxOrdPerDim_

+ +
+
+ + + + + +
+ + + + +
Array1D<int> PCSet::maxOrdPerDim_
+ 		+private
+
+ +

Array of maximum orders per dimension.

+ +
+
+ +

◆ maxTermTaylor_

+ +
+
+ + + + + +
+ + + + +
int PCSet::maxTermTaylor_
+ 		+private
+
+ +

Max number of terms in Taylor series approximations.

+ +
+
+ +

◆ multiIndex_

+ +
+
+ + + + + +
+ + + + +
Array2D<int> PCSet::multiIndex_
+ 		+private
+
+ +

Array to store multi-index: multiIndex_(ipc,idim) contains the order of the basis function associated with dimension idim, for the ipc-th term in the PC expansion.

+ +
+
+ +

◆ my_index_

+ +
+
+ + + + + +
+ + + + +
int PCSet::my_index_
+ 		+private
+
+ +

Index of this class.

+ +
+
+ +

◆ narg_

+ +
+
+ + + + + +
+ + + + +
int PCSet::narg_
+ 		+private
+
+ +

Number of free parameters to specify the basis.

+ +
+
+ +

◆ nDim_

+ +
+
+ + + + + +
+ + + + +
const int PCSet::nDim_
+ 		+private
+
+ +

Number of stochastic dimensions (degrees of freedom) in the PC representation.

+ +
+
+ +

◆ next_index_

+ +
+
+ + + + + +
+ + + + +
int PCSet::next_index_ = 0
+ 		+staticprivate
+
+ +

index of next object in map

+ +
+
+ +

◆ nPCTerms_

+ +
+
+ + + + + +
+ + + + +
int PCSet::nPCTerms_
+ 		+private
+
+ +

Total number of terms in the PC expansions.

+ +
+
+ +

◆ nQuadPoints_

+ +
+
+ + + + + +
+ + + + +
int PCSet::nQuadPoints_
+ 		+private
+
+ +

Number of quadrature points used.

+ +
+
+ +

◆ omap_

+ +
+
+ + + + + +
+ + + + +
PCSet::OMap_t * PCSet::omap_ = NULL
+ 		+staticprivate
+
+ +

Map to connect integer indexes with pointers to this class.

+ +
+
+ +

◆ order_

+ +
+
+ + + + + +
+ + + + +
int PCSet::order_
+ 		+private
+
+ +

Order of the PC representation.

+ +
+
+ +

◆ p_basis_

+ +
+
+ + + + + +
+ + + + +
PCBasis* PCSet::p_basis_
+ 		+private
+
+ +

Pointer to the class that defines the basis type and functions.

+ +
+
+ +

◆ pcSeq_

+ +
+
+ + + + + +
+ + + + +
string PCSet::pcSeq_
+ 		+private
+
+ +

String indicator of multiindex ordering.

+ +
+
+ +

◆ pcType_

+ +
+
+ + + + + +
+ + + + +
string PCSet::pcType_
+ 		+private
+
+ +

String indicator of PC type.

+ +
+
+ +

◆ psi_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> PCSet::psi_
+ 		+private
+
+ +

Array to store basis functions evaluated at quadrature points for each order: psi_(iqp,ipc) contains the value of the polynomial chaos ipc-th basis at the location of quadrature point iqp.

+ +
+
+ +

◆ psiIJKLProd3_

+ +
+
+ + + + + +
+ + + + +
Array1D<Array1D<double> > PCSet::psiIJKLProd3_
+ 		+private
+
+ +

<\Psi_i \Psi_j \Psi_k \Psi_l> terms that are not zero, for all l

+
Note
Stored as a vector over l, with each element being a vector of <\Psi_i \Psi_j \Psi_k \Psi_l> values
+ +
+
+ +

◆ psiIJKProd2_

+ +
+
+ + + + + +
+ + + + +
Array1D<Array1D<double> > PCSet::psiIJKProd2_
+ 		+private
+
+ +

<\Psi_i \Psi_j \Psi_k> terms that are not zero, for all k

+
Note
Stored as a vector over k, with each element being a vector of <\Psi_i \Psi_j \Psi_k> values
+ +
+
+ +

◆ psiSq_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> PCSet::psiSq_
+ 		+private
+
+ +

Array with the norms squared of the basis functions, corresponding to each term in the PC expansion.

+ +
+
+ +

◆ quadIndices_

+ +
+
+ + + + + +
+ + + + +
Array2D<int> PCSet::quadIndices_
+ 		+private
+
+ +

Array to store quadrature point indexing; useful for nested rules.

+ +
+
+ +

◆ quadPoints_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> PCSet::quadPoints_
+ 		+private
+
+ +

Array to store quadrature points.

+ +
+
+ +

◆ quadWeights_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> PCSet::quadWeights_
+ 		+private
+
+ +

Array to store quadrature weights.

+ +
+
+ +

◆ rTolGMRESDiv_

+ +
+
+ + + + + +
+ + + + +
double PCSet::rTolGMRESDiv_
+ 		+private
+
+ +

GMRES tolerance in Div()

+ +
+
+ +

◆ rTolTaylor_

+ +
+
+ + + + + +
+ + + + +
double PCSet::rTolTaylor_
+ 		+private
+
+ +

Relative tolerance for Taylor series approximations.

+ +
+
+ +

◆ SMALL_

+ +
+
+ + + + + +
+ + + + +
double PCSet::SMALL_
+ 		+private
+
+ +

Tolerance to avoid floating-point errors.

+ +
+
+ +

◆ spType_

+ +
+
+ + + + + +
+ + + + +
string PCSet::spType_
+ 		+private
+
+ +

String indicator of ISP or NISP implementation type.

+ +
+
+ +

◆ uqtkverbose_

+ +
+
+ + + + + +
+ + + + +
int PCSet::uqtkverbose_
+ 		+private
+
+ +

Verbosity level.

+
Note
Currently the values of 0, 1 or 2 are implemented.
+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classPCreg-members.html b/docs/html/classPCreg-members.html new file mode 100644 index 00000000..e8be6e73 --- /dev/null +++ b/docs/html/classPCreg-members.html @@ -0,0 +1,126 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
PCreg Member List
+
+
+ +

This is the complete list of members for PCreg, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
A_Lregprotected
A_inv_Lregprotected
BCS_BuildRegr(Array1D< int > &selected, double eta)Lreg
bdata_Lregprotected
coef_Lregprotected
coef_cov_Lregprotected
coef_erb_Lregprotected
computeErrorMetrics(string method)Lreg
computeRVE(Array2D< double > &xval, Array1D< double > &yval, Array1D< double > &yval_regr)Lreg
dataSetFlag_Lregprivate
diagP_Lregprotected
diagPFlag_Lregprotected
EvalBases(Array2D< double > &xx, Array2D< double > &bb)PCregvirtual
EvalRegr(Array2D< double > &xcheck, Array1D< double > &ycheck, Array1D< double > &yvar, Array2D< double > &ycov)Lreg
GetCoef(Array1D< double > &coef)Lreginline
GetCoefCov(Array2D< double > &coef_cov)Lreginline
getDiagP()Lreg
GetMindex(Array2D< int > &mindex)PCreginlinevirtual
GetNbas() constLreginline
GetNdim() constLreginline
GetNpt() constLreginline
getResid()Lreg
GetSigma2() constLreginline
Hty_Lregprotected
InitRegr()Lreg
Lreg()Lreginline
LSQ_BuildRegr()Lreg
LSQ_computeBestLambda()Lreg
LSQ_computeBestLambdas()Lreg
LSQ_computeGCV()Lregprivate
LSQ_computeLOO()Lregprivate
mindex_PCregprivate
nbas_Lregprotected
ndim_Lregprotected
npt_Lregprotected
PCreg(string strpar, int order, int dim)PCreg
PCreg(string strpar, Array2D< int > &mindex)PCreg
pctype_PCregprivate
Proj(Array1D< double > &array, Array1D< double > &proj_array)Lreg
regMode_Lregprivate
resid_Lregprotected
residFlag_Lregprotected
SetCenters(Array2D< double > &centers)Lreginlinevirtual
SetMindex(Array2D< int > &mindex)PCreginlinevirtual
SetParamsRBF()Lreginlinevirtual
SetRegMode(string regmode)Lreginline
SetRegWeights(Array1D< double > &weights)Lreg
SetupData(Array2D< double > &xdata, Array1D< double > &ydata)Lreg
SetupData(Array2D< double > &xdata, Array2D< double > &ydata)Lreg
SetWidths(Array1D< double > &widths)Lreginlinevirtual
sigma2_Lregprotected
StripBases(Array1D< int > &used)PCregvirtual
weights_Lregprotected
xdata_Lregprotected
ydata_Lregprotected
~Lreg()Lreginline
~PCreg()PCreginline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classPCreg.html b/docs/html/classPCreg.html new file mode 100644 index 00000000..37954016 --- /dev/null +++ b/docs/html/classPCreg.html @@ -0,0 +1,501 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: PCreg Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
PCreg Class Reference
+
+
+ +

Derived class for PC regression. + More...

+ +

#include <lreg.h>

+
+Inheritance diagram for PCreg:
+
+
+ + +Lreg + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 PCreg (string strpar, int order, int dim)
 Constructors:
 
 PCreg (string strpar, Array2D< int > &mindex)
 
 ~PCreg ()
 Destructor.
 
void EvalBases (Array2D< double > &xx, Array2D< double > &bb)
 Evaluate the bases.
 
void StripBases (Array1D< int > &used)
 Strip the bases.
 
void SetMindex (Array2D< int > &mindex)
 Set multiindex.
 
void GetMindex (Array2D< int > &mindex)
 Get multiindex.
 
- Public Member Functions inherited from Lreg
 Lreg ()
 Constructor.
 
 ~Lreg ()
 Destrcutor.
 
virtual void SetCenters (Array2D< double > &centers)
 Set centers (for RBF)
 
virtual void SetWidths (Array1D< double > &widths)
 Set widths (for RBF)
 
virtual void SetParamsRBF ()
 Set parameters (for RBF)
 
void InitRegr ()
 Initialize.
 
void SetupData (Array2D< double > &xdata, Array1D< double > &ydata)
 Setup data (1d ydata)
 
void SetupData (Array2D< double > &xdata, Array2D< double > &ydata)
 Setup data (2d ydata)
 
void SetRegMode (string regmode)
 Set the regression mode.
 
void SetRegWeights (Array1D< double > &weights)
 Set weights.
 
void BCS_BuildRegr (Array1D< int > &selected, double eta)
 Build BCS regression.
 
void LSQ_BuildRegr ()
 Build LSQ regression.
 
void EvalRegr (Array2D< double > &xcheck, Array1D< double > &ycheck, Array1D< double > &yvar, Array2D< double > &ycov)
 Evaluate the regression expansion.
 
int GetNpt () const
 Get the number of points.
 
int GetNdim () const
 Get dimensionality.
 
int GetNbas () const
 Get the number of bases.
 
double GetSigma2 () const
 Get the variance of the data.
 
void GetCoefCov (Array2D< double > &coef_cov)
 Get coefficient covariance.
 
void GetCoef (Array1D< double > &coef)
 Get coefficients.
 
void Proj (Array1D< double > &array, Array1D< double > &proj_array)
 Project.
 
Array1D< double > LSQ_computeBestLambdas ()
 Compute the best values for regulariation parameter vector lambda, for LSQ.
 
double LSQ_computeBestLambda ()
 Compute the best value for regulariation parameter lambda, for LSQ.
 
void getResid ()
 Compute the residual vector, if not already computed.
 
void getDiagP ()
 Compute the diagonal of projection matrix, if not already computed.
 
Array1D< double > computeErrorMetrics (string method)
 Compote error according to a selected metrics.
 
double computeRVE (Array2D< double > &xval, Array1D< double > &yval, Array1D< double > &yval_regr)
 Compute validation error.
 
+ + + + + + + +

+Private Attributes

Array2D< int > mindex_
 Multiindex.
 
string pctype_
 PC type.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Lreg
Array2D< double > xdata_
 xdata array
 
Array1D< double > ydata_
 ydata array
 
int npt_
 Number of samples.
 
int nbas_
 Number of bases.
 
int ndim_
 Dimensionality.
 
Array1D< double > sigma2_
 Variance.
 
Array1D< double > weights_
 Weights.
 
Array1D< double > resid_
 Residuals.
 
bool residFlag_
 Flag to indicate whether residual is computed.
 
Array1D< double > diagP_
 Diagonal of projection matrix.
 
bool diagPFlag_
 Flag to indicate whether diagonal of projetion matrix is computed.
 
Array2D< double > bdata_
 Auxiliary matrix or vector; see UQTk Manual.
 
Array2D< double > A_
 
Array2D< double > A_inv_
 
Array2D< double > coef_cov_
 
Array1D< double > Hty_
 
Array1D< double > coef_
 
Array1D< double > coef_erb_
 
+

Detailed Description

+

Derived class for PC regression.

+

Constructor & Destructor Documentation

+ +

◆ PCreg() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + +
PCreg::PCreg (string strpar,
int order,
int dim )
+
+ +

Constructors:

+ +
+
+ +

◆ PCreg() [2/2]

+ +
+
+ + + + + + + + + + + +
PCreg::PCreg (string strpar,
Array2D< int > & mindex )
+
+ +
+
+ +

◆ ~PCreg()

+ +
+
+ + + + + +
+ + + + + + + +
PCreg::~PCreg ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ EvalBases()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void PCreg::EvalBases (Array2D< double > & xx,
Array2D< double > & bb )
+ 		+virtual
+
+ +

Evaluate the bases.

+ +

Reimplemented from Lreg.

+ +
+
+ +

◆ GetMindex()

+ +
+
+ + + + + +
+ + + + + + + +
void PCreg::GetMindex (Array2D< int > & mindex)
+ 		+inlinevirtual
+
+ +

Get multiindex.

+ +

Reimplemented from Lreg.

+ +
+
+ +

◆ SetMindex()

+ +
+
+ + + + + +
+ + + + + + + +
void PCreg::SetMindex (Array2D< int > & mindex)
+ 		+inlinevirtual
+
+ +

Set multiindex.

+ +

Reimplemented from Lreg.

+ +
+
+ +

◆ StripBases()

+ +
+
+ + + + + +
+ + + + + + + +
void PCreg::StripBases (Array1D< int > & used)
+ 		+virtual
+
+ +

Strip the bases.

+ +

Reimplemented from Lreg.

+ +
+
+

Member Data Documentation

+ +

◆ mindex_

+ +
+
+ + + + + +
+ + + + +
Array2D<int> PCreg::mindex_
+ 		+private
+
+ +

Multiindex.

+ +
+
+ +

◆ pctype_

+ +
+
+ + + + + +
+ + + + +
string PCreg::pctype_
+ 		+private
+
+ +

PC type.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classPCreg.png b/docs/html/classPCreg.png new file mode 100644 index 0000000000000000000000000000000000000000..ee81af94d267fe2329a7856a9245432b34953766 GIT binary patch literal 353 zcmeAS@N?(olHy`uVBq!ia0vp^20$FZ!3-obG}zt)Dd_;85ZC|z{{xvX-h3_XKeXJ! zK(jz%`k5CG9y|bwo1P6@0+iz{3GxeO0P?}WoN4wIpx_%%7srqa# zIqU!bM@uJ|mdKI;Vst03Z&X8vp + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
PLreg Member List
+
+
+ +

This is the complete list of members for PLreg, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
A_Lregprotected
A_inv_Lregprotected
BCS_BuildRegr(Array1D< int > &selected, double eta)Lreg
bdata_Lregprotected
coef_Lregprotected
coef_cov_Lregprotected
coef_erb_Lregprotected
computeErrorMetrics(string method)Lreg
computeRVE(Array2D< double > &xval, Array1D< double > &yval, Array1D< double > &yval_regr)Lreg
dataSetFlag_Lregprivate
diagP_Lregprotected
diagPFlag_Lregprotected
EvalBases(Array2D< double > &xx, Array2D< double > &bb)PLregvirtual
EvalRegr(Array2D< double > &xcheck, Array1D< double > &ycheck, Array1D< double > &yvar, Array2D< double > &ycov)Lreg
GetCoef(Array1D< double > &coef)Lreginline
GetCoefCov(Array2D< double > &coef_cov)Lreginline
getDiagP()Lreg
GetMindex(Array2D< int > &mindex)PLreginlinevirtual
GetNbas() constLreginline
GetNdim() constLreginline
GetNpt() constLreginline
getResid()Lreg
GetSigma2() constLreginline
Hty_Lregprotected
InitRegr()Lreg
Lreg()Lreginline
LSQ_BuildRegr()Lreg
LSQ_computeBestLambda()Lreg
LSQ_computeBestLambdas()Lreg
LSQ_computeGCV()Lregprivate
LSQ_computeLOO()Lregprivate
mindex_PLregprivate
nbas_Lregprotected
ndim_Lregprotected
npt_Lregprotected
PLreg(int order, int dim)PLreg
PLreg(Array2D< int > &mindex)PLreg
Proj(Array1D< double > &array, Array1D< double > &proj_array)Lreg
regMode_Lregprivate
resid_Lregprotected
residFlag_Lregprotected
SetCenters(Array2D< double > &centers)Lreginlinevirtual
SetMindex(Array2D< int > &mindex)PLreginlinevirtual
SetParamsRBF()Lreginlinevirtual
SetRegMode(string regmode)Lreginline
SetRegWeights(Array1D< double > &weights)Lreg
SetupData(Array2D< double > &xdata, Array1D< double > &ydata)Lreg
SetupData(Array2D< double > &xdata, Array2D< double > &ydata)Lreg
SetWidths(Array1D< double > &widths)Lreginlinevirtual
sigma2_Lregprotected
StripBases(Array1D< int > &used)PLregvirtual
weights_Lregprotected
xdata_Lregprotected
ydata_Lregprotected
~Lreg()Lreginline
~PLreg()PLreginline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classPLreg.html b/docs/html/classPLreg.html new file mode 100644 index 00000000..1a8753fc --- /dev/null +++ b/docs/html/classPLreg.html @@ -0,0 +1,465 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: PLreg Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
PLreg Class Reference
+
+
+ +

Derived class for polynomial regression. + More...

+ +

#include <lreg.h>

+
+Inheritance diagram for PLreg:
+
+
+ + +Lreg + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 PLreg (int order, int dim)
 Constructors:
 
 PLreg (Array2D< int > &mindex)
 
 ~PLreg ()
 Destructor.
 
void EvalBases (Array2D< double > &xx, Array2D< double > &bb)
 Evaluate the bases.
 
void StripBases (Array1D< int > &used)
 Strip the bases.
 
void SetMindex (Array2D< int > &mindex)
 Set multiindex.
 
void GetMindex (Array2D< int > &mindex)
 Get multiindex.
 
- Public Member Functions inherited from Lreg
 Lreg ()
 Constructor.
 
 ~Lreg ()
 Destrcutor.
 
virtual void SetCenters (Array2D< double > &centers)
 Set centers (for RBF)
 
virtual void SetWidths (Array1D< double > &widths)
 Set widths (for RBF)
 
virtual void SetParamsRBF ()
 Set parameters (for RBF)
 
void InitRegr ()
 Initialize.
 
void SetupData (Array2D< double > &xdata, Array1D< double > &ydata)
 Setup data (1d ydata)
 
void SetupData (Array2D< double > &xdata, Array2D< double > &ydata)
 Setup data (2d ydata)
 
void SetRegMode (string regmode)
 Set the regression mode.
 
void SetRegWeights (Array1D< double > &weights)
 Set weights.
 
void BCS_BuildRegr (Array1D< int > &selected, double eta)
 Build BCS regression.
 
void LSQ_BuildRegr ()
 Build LSQ regression.
 
void EvalRegr (Array2D< double > &xcheck, Array1D< double > &ycheck, Array1D< double > &yvar, Array2D< double > &ycov)
 Evaluate the regression expansion.
 
int GetNpt () const
 Get the number of points.
 
int GetNdim () const
 Get dimensionality.
 
int GetNbas () const
 Get the number of bases.
 
double GetSigma2 () const
 Get the variance of the data.
 
void GetCoefCov (Array2D< double > &coef_cov)
 Get coefficient covariance.
 
void GetCoef (Array1D< double > &coef)
 Get coefficients.
 
void Proj (Array1D< double > &array, Array1D< double > &proj_array)
 Project.
 
Array1D< double > LSQ_computeBestLambdas ()
 Compute the best values for regulariation parameter vector lambda, for LSQ.
 
double LSQ_computeBestLambda ()
 Compute the best value for regulariation parameter lambda, for LSQ.
 
void getResid ()
 Compute the residual vector, if not already computed.
 
void getDiagP ()
 Compute the diagonal of projection matrix, if not already computed.
 
Array1D< double > computeErrorMetrics (string method)
 Compote error according to a selected metrics.
 
double computeRVE (Array2D< double > &xval, Array1D< double > &yval, Array1D< double > &yval_regr)
 Compute validation error.
 
+ + + + +

+Private Attributes

Array2D< int > mindex_
 Multiindex.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Lreg
Array2D< double > xdata_
 xdata array
 
Array1D< double > ydata_
 ydata array
 
int npt_
 Number of samples.
 
int nbas_
 Number of bases.
 
int ndim_
 Dimensionality.
 
Array1D< double > sigma2_
 Variance.
 
Array1D< double > weights_
 Weights.
 
Array1D< double > resid_
 Residuals.
 
bool residFlag_
 Flag to indicate whether residual is computed.
 
Array1D< double > diagP_
 Diagonal of projection matrix.
 
bool diagPFlag_
 Flag to indicate whether diagonal of projetion matrix is computed.
 
Array2D< double > bdata_
 Auxiliary matrix or vector; see UQTk Manual.
 
Array2D< double > A_
 
Array2D< double > A_inv_
 
Array2D< double > coef_cov_
 
Array1D< double > Hty_
 
Array1D< double > coef_
 
Array1D< double > coef_erb_
 
+

Detailed Description

+

Derived class for polynomial regression.

+

Constructor & Destructor Documentation

+ +

◆ PLreg() [1/2]

+ +
+
+ + + + + + + + + + + +
PLreg::PLreg (int order,
int dim )
+
+ +

Constructors:

+ +
+
+ +

◆ PLreg() [2/2]

+ +
+
+ + + + + + + +
PLreg::PLreg (Array2D< int > & mindex)
+
+ +
+
+ +

◆ ~PLreg()

+ +
+
+ + + + + +
+ + + + + + + +
PLreg::~PLreg ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ EvalBases()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void PLreg::EvalBases (Array2D< double > & xx,
Array2D< double > & bb )
+ 		+virtual
+
+ +

Evaluate the bases.

+ +

Reimplemented from Lreg.

+ +
+
+ +

◆ GetMindex()

+ +
+
+ + + + + +
+ + + + + + + +
void PLreg::GetMindex (Array2D< int > & mindex)
+ 		+inlinevirtual
+
+ +

Get multiindex.

+ +

Reimplemented from Lreg.

+ +
+
+ +

◆ SetMindex()

+ +
+
+ + + + + +
+ + + + + + + +
void PLreg::SetMindex (Array2D< int > & mindex)
+ 		+inlinevirtual
+
+ +

Set multiindex.

+ +

Reimplemented from Lreg.

+ +
+
+ +

◆ StripBases()

+ +
+
+ + + + + +
+ + + + + + + +
void PLreg::StripBases (Array1D< int > & used)
+ 		+virtual
+
+ +

Strip the bases.

+ +

Reimplemented from Lreg.

+ +
+
+

Member Data Documentation

+ +

◆ mindex_

+ +
+
+ + + + + +
+ + + + +
Array2D<int> PLreg::mindex_
+ 		+private
+
+ +

Multiindex.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classPLreg.png b/docs/html/classPLreg.png new file mode 100644 index 0000000000000000000000000000000000000000..ec90604a1c21c38e40800b1ab604a19f5c27ae9f GIT binary patch literal 344 zcmeAS@N?(olHy`uVBq!ia0vp^dO#e&!3-n={kLxcQqloFA+G=b{|7Q(y!l$%e`vXd zfo6fk^fNCWJa_;UH$5A+1SrQ@666=m0OW&#In(SbK*7hJE{-7;jBn?9_Z?B-aXFo; zx$5`)3XThR1Kay0&*lV(>Cbp^Q!{{%q5Qi=!K9u|y?H8@PxMQywKwnaJ%4)2wz^xX z^M5b9y#7~B)juac;cNM+20r%HoB_9G}7y~!td4pO71SNf1T + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Post Member List
+
+
+ +

This is the complete list of members for Post, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
chDim_Postprotected
dataNoiseLogFlag_Postprotected
dataNoiseSig_Postprotected
dataSigma(double m_last)Post
evalLogLik(Array1D< double > &m)Postinlinevirtual
evalLogPrior(Array1D< double > &m)Post
extraInferredParams_Postprotected
fixIndNom_Postprotected
forwardFcns_Postprotected
funcinfo_Postprotected
getChainDim()Post
getParamPCcf(Array1D< double > &m)Post
inferDataNoise()Post
inferDataNoise_Postprotected
inferLogDataNoise()Post
lower_Postprotected
momForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momForwardFcn(Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)Post
momParam(Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)Post
Mrv_Postprotected
ncat_Postprotected
nData_Postprotected
nEachs_Postprotected
pdfType_Postprotected
pDim_Postprotected
Post()Post
priora_Postprotected
priorb_Postprotected
priorType_Postprotected
rndInd_Postprotected
rvpcType_Postprotected
samForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)Post
samParam(Array1D< double > &m, int ns)Post
setData(Array2D< double > &xdata, Array2D< double > &ydata)Post
setData(Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)Post
setDataNoise(Array1D< double > &sigma)Post
setModel(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)Post
setModelRVinput(int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)Post
setPrior(string priorType, double priora, double priorb)Post
upper_Postprotected
verbosity_Postprivate
xData_Postprotected
xDim_Postprotected
yData_Postprotected
yDatam_Postprotected
~Post()Postinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classPost.html b/docs/html/classPost.html new file mode 100644 index 00000000..dc5618b7 --- /dev/null +++ b/docs/html/classPost.html @@ -0,0 +1,1405 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Post Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Protected Attributes | +Private Attributes | +List of all members
+
Post Class Reference
+
+
+ +

posterior evaluation with various likelihood and prior options + More...

+ +

#include <post.h>

+
+Inheritance diagram for Post:
+
+
+ + +Lik_ABC +Lik_ABCm +Lik_Classical +Lik_Eov +Lik_Full +Lik_GausMarg +Lik_GausMargD +Lik_Koh +Lik_MVN +Lik_Marg + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Post ()
 Constructor.
 
 ~Post ()
 Destructor.
 
void setData (Array2D< double > &xdata, Array2D< double > &ydata)
 Set the x- and y-data.
 
void setData (Array2D< double > &xdata, Array1D< Array1D< double > > &ydata)
 Set the x- and y-data, for the case when each datapoint have different number of measurements.
 
void setDataNoise (Array1D< double > &sigma)
 Set the magnitude of data noise.
 
void inferDataNoise ()
 Indicate inference of data noise stdev.
 
void inferLogDataNoise ()
 Indicate inference of log of data noise stdev.
 
Array1D< double > dataSigma (double m_last)
 Get data noise, whether inferred or fixed.
 
void setModel (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)
 Set a pointer to the forward model f(p,x)
 
void setModelRVinput (int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)
 Set model input parameters' randomization scheme.
 
int getChainDim ()
 Get the dimensionailty of the posterior function.
 
void setPrior (string priorType, double priora, double priorb)
 Set the prior type and its parameters.
 
double evalLogPrior (Array1D< double > &m)
 Evaluate log-prior.
 
Array2D< double > getParamPCcf (Array1D< double > &m)
 Extract parameter PC coefficients from a posterior input.
 
Array2D< double > samParam (Array1D< double > &m, int ns)
 Sample model parameters given posterior input.
 
void momParam (Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)
 Get moments of parameters given posterior input.
 
Array2D< double > samForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)
 Sample forward function at a given grid for given posterior input.
 
void momForwardFcn (Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of forward function at a given grid for given posterior input.
 
void momForwardFcn (Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
 Get moments of composite forward function at a given grid for given posterior input.
 
virtual double evalLogLik (Array1D< double > &m)
 Dummy evaluation of log-likelihood.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Protected Attributes

Array2D< double > xData_
 xdata
 
Array1D< Array1D< double > > yData_
 ydata
 
Array1D< double > yDatam_
 ydata averaged per measurement
 
int nData_
 Number of data points.
 
Array1D< int > nEachs_
 Number of samples at each input.
 
int xDim_
 Dimensionality of x-space.
 
int pDim_
 Dimensionality of parameter space (p-space)
 
int chDim_
 Dimensionality of posterior input.
 
bool inferDataNoise_
 Flag for data noise inference.
 
bool dataNoiseLogFlag_
 Flag to check if data noise logarithm is used.
 
Array1D< double > dataNoiseSig_
 Data noise stdev.
 
Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFcns_
 Pointer to the forward function f(p,x)
 
void * funcinfo_
 Auxiliary information for function evaluation.
 
int extraInferredParams_
 Number of extra inferred parameters, such as data noise or Koh variance.
 
int ncat_
 Number of categories.
 
Mrv * Mrv_
 Pointer to a multivariate PC RV object.
 
Array1D< int > rndInd_
 Indices of randomized inputs.
 
Array2D< double > fixIndNom_
 Indices and nominal values for fixed inputs.
 
Array1D< double > lower_
 Lower and upper bounds on parameters.
 
Array1D< double > upper_
 
string pdfType_
 Input parameter PDF type.
 
string rvpcType_
 PC type parameter for the r.v.
 
string priorType_
 Prior type.
 
double priora_
 Prior parameter #1.
 
double priorb_
 Prior parameter #2.
 
+ + + + +

+Private Attributes

int verbosity_
 Verbosity level.
 
+

Detailed Description

+

posterior evaluation with various likelihood and prior options

+

Constructor & Destructor Documentation

+ +

◆ Post()

+ +
+
+ + + + + + + +
Post::Post ()
+
+ +

Constructor.

+ +
+
+ +

◆ ~Post()

+ +
+
+ + + + + +
+ + + + + + + +
Post::~Post ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ dataSigma()

+ +
+
+ + + + + + + +
Array1D< double > Post::dataSigma (double m_last)
+
+ +

Get data noise, whether inferred or fixed.

+ +
+
+ +

◆ evalLogLik()

+ +
+
+ + + + + +
+ + + + + + + +
virtual double Post::evalLogLik (Array1D< double > & m)
+ 		+inlinevirtual
+
+ +

Dummy evaluation of log-likelihood.

+ +

Reimplemented in Lik_ABC, Lik_ABCm, Lik_Classical, Lik_Eov, Lik_Full, Lik_GausMarg, Lik_GausMargD, Lik_Koh, Lik_Marg, and Lik_MVN.

+ +
+
+ +

◆ evalLogPrior()

+ +
+
+ + + + + + + +
double Post::evalLogPrior (Array1D< double > & m)
+
+ +

Evaluate log-prior.

+ +
+
+ +

◆ getChainDim()

+ +
+
+ + + + + + + +
int Post::getChainDim ()
+
+ +

Get the dimensionailty of the posterior function.

+ +
+
+ +

◆ getParamPCcf()

+ +
+
+ + + + + + + +
Array2D< double > Post::getParamPCcf (Array1D< double > & m)
+
+ +

Extract parameter PC coefficients from a posterior input.

+ +
+
+ +

◆ inferDataNoise()

+ +
+
+ + + + + + + +
void Post::inferDataNoise ()
+
+ +

Indicate inference of data noise stdev.

+ +
+
+ +

◆ inferLogDataNoise()

+ +
+
+ + + + + + + +
void Post::inferLogDataNoise ()
+
+ +

Indicate inference of log of data noise stdev.

+ +
+
+ +

◆ momForwardFcn() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void Post::momForwardFcn (Array1D< double > & m,
Array2D< double > & xgrid,
Array1D< double > & fcnMean,
Array1D< double > & fcnVar,
bool covflag,
Array2D< double > & fcnCov )
+
+ +

Get moments of composite forward function at a given grid for given posterior input.

+ +
+
+ +

◆ momForwardFcn() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void Post::momForwardFcn (Array2D< double >(* forwardFunc )(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *),
Array1D< double > & m,
Array2D< double > & xgrid,
Array1D< double > & fcnMean,
Array1D< double > & fcnVar,
bool covflag,
Array2D< double > & fcnCov )
+
+ +

Get moments of forward function at a given grid for given posterior input.

+ +
+
+ +

◆ momParam()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void Post::momParam (Array1D< double > & m,
Array1D< double > & parMean,
Array1D< double > & parVar,
bool covFlag,
Array2D< double > & parCov )
+
+ +

Get moments of parameters given posterior input.

+ +
+
+ +

◆ samForwardFcn()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Post::samForwardFcn (Array2D< double >(* forwardFunc )(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *),
Array1D< double > & m,
Array2D< double > & xgrid,
int ns )
+
+ +

Sample forward function at a given grid for given posterior input.

+ +
+
+ +

◆ samParam()

+ +
+
+ + + + + + + + + + + +
Array2D< double > Post::samParam (Array1D< double > & m,
int ns )
+
+ +

Sample model parameters given posterior input.

+ +
+
+ +

◆ setData() [1/2]

+ +
+
+ + + + + + + + + + + +
void Post::setData (Array2D< double > & xdata,
Array1D< Array1D< double > > & ydata )
+
+ +

Set the x- and y-data, for the case when each datapoint have different number of measurements.

+ +
+
+ +

◆ setData() [2/2]

+ +
+
+ + + + + + + + + + + +
void Post::setData (Array2D< double > & xdata,
Array2D< double > & ydata )
+
+ +

Set the x- and y-data.

+ +
+
+ +

◆ setDataNoise()

+ +
+
+ + + + + + + +
void Post::setDataNoise (Array1D< double > & sigma)
+
+ +

Set the magnitude of data noise.

+ +
+
+ +

◆ setModel()

+ +
+
+ + + + + + + + + + + + + + + + +
void Post::setModel (Array1D< Array2D< double >(* forwardFuncs )(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) >,
Array2D< double > & fixindnom,
void * funcInfo )
+
+ +

Set a pointer to the forward model f(p,x)

+ +
+
+ +

◆ setModelRVinput()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void Post::setModelRVinput (int pdim,
int order,
Array1D< int > & rndInd,
string pdfType,
string pcType )
+
+ +

Set model input parameters' randomization scheme.

+ +
+
+ +

◆ setPrior()

+ +
+
+ + + + + + + + + + + + + + + + +
void Post::setPrior (string priorType,
double priora,
double priorb )
+
+ +

Set the prior type and its parameters.

+ +
+
+

Member Data Documentation

+ +

◆ chDim_

+ +
+
+ + + + + +
+ + + + +
int Post::chDim_
+ 		+protected
+
+ +

Dimensionality of posterior input.

+ +
+
+ +

◆ dataNoiseLogFlag_

+ +
+
+ + + + + +
+ + + + +
bool Post::dataNoiseLogFlag_
+ 		+protected
+
+ +

Flag to check if data noise logarithm is used.

+ +
+
+ +

◆ dataNoiseSig_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Post::dataNoiseSig_
+ 		+protected
+
+ +

Data noise stdev.

+ +
+
+ +

◆ extraInferredParams_

+ +
+
+ + + + + +
+ + + + +
int Post::extraInferredParams_
+ 		+protected
+
+ +

Number of extra inferred parameters, such as data noise or Koh variance.

+ +
+
+ +

◆ fixIndNom_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Post::fixIndNom_
+ 		+protected
+
+ +

Indices and nominal values for fixed inputs.

+ +
+
+ +

◆ forwardFcns_

+ +
+
+ + + + + +
+ + + + +
Array1D< Array2D<double>(*)(Array2D<double>&, Array2D<double>&, Array2D<double>&, void *) > Post::forwardFcns_
+ 		+protected
+
+ +

Pointer to the forward function f(p,x)

+ +
+
+ +

◆ funcinfo_

+ +
+
+ + + + + +
+ + + + +
void* Post::funcinfo_
+ 		+protected
+
+ +

Auxiliary information for function evaluation.

+ +
+
+ +

◆ inferDataNoise_

+ +
+
+ + + + + +
+ + + + +
bool Post::inferDataNoise_
+ 		+protected
+
+ +

Flag for data noise inference.

+ +
+
+ +

◆ lower_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Post::lower_
+ 		+protected
+
+ +

Lower and upper bounds on parameters.

+ +
+
+ +

◆ Mrv_

+ +
+
+ + + + + +
+ + + + +
Mrv* Post::Mrv_
+ 		+protected
+
+ +

Pointer to a multivariate PC RV object.

+ +
+
+ +

◆ ncat_

+ +
+
+ + + + + +
+ + + + +
int Post::ncat_
+ 		+protected
+
+ +

Number of categories.

+ +
+
+ +

◆ nData_

+ +
+
+ + + + + +
+ + + + +
int Post::nData_
+ 		+protected
+
+ +

Number of data points.

+ +
+
+ +

◆ nEachs_

+ +
+
+ + + + + +
+ + + + +
Array1D<int> Post::nEachs_
+ 		+protected
+
+ +

Number of samples at each input.

+ +
+
+ +

◆ pdfType_

+ +
+
+ + + + + +
+ + + + +
string Post::pdfType_
+ 		+protected
+
+ +

Input parameter PDF type.

+ +
+
+ +

◆ pDim_

+ +
+
+ + + + + +
+ + + + +
int Post::pDim_
+ 		+protected
+
+ +

Dimensionality of parameter space (p-space)

+ +
+
+ +

◆ priora_

+ +
+
+ + + + + +
+ + + + +
double Post::priora_
+ 		+protected
+
+ +

Prior parameter #1.

+ +
+
+ +

◆ priorb_

+ +
+
+ + + + + +
+ + + + +
double Post::priorb_
+ 		+protected
+
+ +

Prior parameter #2.

+ +
+
+ +

◆ priorType_

+ +
+
+ + + + + +
+ + + + +
string Post::priorType_
+ 		+protected
+
+ +

Prior type.

+ +
+
+ +

◆ rndInd_

+ +
+
+ + + + + +
+ + + + +
Array1D<int> Post::rndInd_
+ 		+protected
+
+ +

Indices of randomized inputs.

+ +
+
+ +

◆ rvpcType_

+ +
+
+ + + + + +
+ + + + +
string Post::rvpcType_
+ 		+protected
+
+ +

PC type parameter for the r.v.

+ +
+
+ +

◆ upper_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Post::upper_
+ 		+protected
+
+ +
+
+ +

◆ verbosity_

+ +
+
+ + + + + +
+ + + + +
int Post::verbosity_
+ 		+private
+
+ +

Verbosity level.

+ +
+
+ +

◆ xData_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> Post::xData_
+ 		+protected
+
+ +

xdata

+ +
+
+ +

◆ xDim_

+ +
+
+ + + + + +
+ + + + +
int Post::xDim_
+ 		+protected
+
+ +

Dimensionality of x-space.

+ +
+
+ +

◆ yData_

+ +
+
+ + + + + +
+ + + + +
Array1D<Array1D<double> > Post::yData_
+ 		+protected
+
+ +

ydata

+ +
+
+ +

◆ yDatam_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Post::yDatam_
+ 		+protected
+
+ +

ydata averaged per measurement

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classPost.png b/docs/html/classPost.png new file mode 100644 index 0000000000000000000000000000000000000000..9f9c60a125ca90897889249a6f02b918c6268dde GIT binary patch literal 2638 zcmcguX;hO}8vcNaKm+I*P!@p^BQ=ODvR0z8mF*)0G;Aqr0uBfviVDaQLhNW5pg;*| z7@>qpP>cb>0m7mZOaLp3v_Td@0Yd|Ff*>G7l#mICJ*Uo$GxMYK{kivh-*et`pZh$| z``(P>p04U@dTIawsDo}!X!$w>0E%uZO7fk}*5P{jqJP}O$5|$m$+s_Nmf~}HHytct zu{yNw7vtmO^0;k}A48r~jYE5S1M>fk&t9?Uu{`z!bo$CCQQ_q?anALlTF%egt1i7- z^Mdc8U2k-=uZT0K%|>o7Rt=>q$^RpJCSKul<_6*tdLDF%gG&lFu1Lc}zoKd&VcW{wMu z%hujG66e1wq`68=VuoP`Iu}FkFZ@W7d1HTI zm*c;z&|Q|LbXEIl1{TLqvT1%+HD!5Q$X7~5Xd;3|7+F3ybyb+S=dP-9Y}0xBTy>UK z2U#6?8a{Z=yiYM$n&W&C6zJdHF`#)WNk5MfI+dZT99xK^#(l|$C^?vw7o1iZkEy;7 znD+czQa%B2oz56{Sh>EU!$_7T_%@NUS-pvyZo5Kw+PQTNF*!l)oQjxBcC}^qG%e9N zLE!N1fT5#9Czid%krLSfuKDt;I>#JyHeqiJeBLGCu>YBUUT1!w2MaD)ZC>5qb_pfP zYeyHiSnVQeZUCmygwa8Z2o@oaAIn0H^^oA4Ta&QUr|ZS*^HO_(wk7AfaJ^1^rqXno`}IDP4?L?r?N$D zS0@S>@q<{x2#1#P0KKXO89!(748EYZI&Jrjky$7*OT15(gW^U!$5LPCM5n9gACfN4 zWGJ-vS&~r{P#}WHtK9$-L3yqqxkL2A9azU zf7L%`&)`rb{f32$GEHzeYFIXth+_9dEz?ViSN4(As?UU_bmC&0R;djS5cenOl4@;U zW^HFt*(p-j*e)Ww^Z@A`RI81z#&E^nBx}*s(b64Nl zB5XDz-ggY%`FZ3aOi;M~tJgKgn2_k(h&SPqxbmJ0cYB(PG;$jrCd*muU|wEQTAil( zQxlkCy?n-n`nOrcezXk)YrzNXbWK3oyU#K1u+$@e2%~En1HU$$#V6ayjHq>eb!oCU z6GoGJ(lkbjBV^MVG4Q!BUbS;sC*{}jyqDf(k(6=?zP9ozU~OxBYo_Y2Jtu6qqB9Zg zCk;+%^E$8iLc+Hcxh)!nS^c8I?hZtmXcCUBMqoxbFGZwUEn1nW1jTj{Fx9GS>RCGd zM5&oA{_$(NPpp48l3?iGqVMS+&@v$^$FO=<{2WqiGsmpJj zA=Fi}tLW%54Gqq!aSwo3-`^anqsmH+Pgjaue-Xx8`GcZb^P!16-xU^}$Mf)@j{5en zNo3b96tzV3f0{W=?7Gc&+@U${ovzTs;g4Ap^~U6Frr)vV>u*}GJwMi$R+e^!@dNX+ z_DwiZ$84g(@a{zuFr{B@e{UlhHD;R6AXs7B8!7c~U>gE9H*1IBp_TG54GRo9rY#l* z{y3VNtq?Q^*qPNSvhP(;0-wj?iSL59k0KRAY;A-uSLTtRq i)(0*yy8a&c8NoK)`(l?%>>c^b4*;D#ovOaZe)|s{&#Ec_ literal 0 HcmV?d00001 diff --git a/docs/html/classQuad-members.html b/docs/html/classQuad-members.html new file mode 100644 index 00000000..ccb6b348 --- /dev/null +++ b/docs/html/classQuad-members.html @@ -0,0 +1,134 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
Quad Member List
+
+
+ +

This is the complete list of members for Quad, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
aa_Quadprivate
AddTwoRules(QuadRule *rule1, QuadRule *rule2, QuadRule *rule_sum)Quadprivate
alpha_Quadprivate
alphas_Quadprivate
bb_Quadprivate
beta_Quadprivate
betas_Quadprivate
compressRule(QuadRule *rule)Quadprivate
create1DRule(string gridtype, Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)Quadprivate
create1DRule_CC(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)Quadprivate
create1DRule_CCO(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)Quadprivate
create1DRule_GP3(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)Quadprivate
create1DRule_HG(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr)Quadprivate
create1DRule_JB(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)Quadprivate
create1DRule_LG(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr)Quadprivate
create1DRule_LU(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)Quadprivate
create1DRule_NC(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)Quadprivate
create1DRule_NCO(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)Quadprivate
create1DRule_pdf(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)Quadprivate
create1DRule_SW(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr)Quadprivate
fs_type_Quadprivate
GetDomain(Array1D< double > &aa, Array1D< double > &bb) constQuadinline
GetDomain(Array1D< double > &aa) constQuadinline
getMultiIndexLevel(Array2D< int > &multiIndexLevel, int level, int ndim)Quadprivate
GetNQ()Quadinline
GetQdpts(Array2D< double > &q)Quadinline
GetRule(Array2D< double > &q, Array1D< double > &w)Quad
GetRule(Array2D< double > &q, Array1D< double > &w, Array2D< int > &ind)Quadinline
GetWghts(Array1D< double > &w)Quadinline
grid_type_Quadprivate
grid_types_Quadprivate
growth_rule_Quadprivate
growth_rules_Quadprivate
init()Quad
maxlevel_Quadprivate
MultiplyManyRules(int nrules, QuadRule *rules, QuadRule *rule_prod)Quadprivate
MultiplyManyRules_(int nrules, QuadRule *rules, QuadRule *rule_prod)Quadprivate
MultiplyTwoRules(QuadRule *rule1, QuadRule *rule2, QuadRule *rule_prod)Quadprivate
ndim_Quadprivate
nextLevel()Quad
nlevel_Quadprivate
npts_1_allQuadprivate
npts_allQuadprivate
param_Quadprivate
qr_1_allQuadprivate
qr_allQuadprivate
Quad(char *grid_type, char *fs_type, int ndim, int param, double alpha=0.0, double betta=1.0)Quad
Quad(Array1D< string > &grid_types, char *fs_type, Array1D< int > &param, Array1D< double > &alphas, Array1D< double > &bettas)Quad
Quad()Quadinline
Quad(const Quad &)Quadinlineprivate
quadverbose_Quadprivate
rule_Quadprivate
SetAlpha(double alpha)Quadinline
SetBeta(double betta)Quadinline
SetDomain(Array1D< double > &aa, Array1D< double > &bb)Quad
SetDomain(Array1D< double > &aa)Quad
SetLevel(int param)Quadinline
SetQdpts(Array2D< double > &q)Quadinline
SetRule(Array2D< double > &q, Array1D< double > &w)Quad
SetRule(Array2D< double > &q, Array1D< double > &w, Array2D< int > &ind)Quadinline
SetRule()Quad
SetVerbosity(int verbosity)Quadinline
SetWghts(Array1D< double > &w)Quadinline
SubtractTwoRules(QuadRule *rule1, QuadRule *rule2, QuadRule *rule_sum)Quadprivate
~Quad()Quadinline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classQuad.html b/docs/html/classQuad.html new file mode 100644 index 00000000..c87bc265 --- /dev/null +++ b/docs/html/classQuad.html @@ -0,0 +1,2248 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Quad Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Classes | +Public Member Functions | +Private Member Functions | +Private Attributes | +List of all members
+
Quad Class Reference
+
+
+ +

Generates quadrature rules. + More...

+ +

#include <quad.h>

+ + + + + +

+Classes

struct  QuadRule
 Rule structure that stores quadrature points, weights and indices. More...
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 Quad (char *grid_type, char *fs_type, int ndim, int param, double alpha=0.0, double betta=1.0)
 Constructor: initializes the rule type, sparseness type, dimensionality, level or ppd parameter, and two optional parameters for quadrature rule.
 
 Quad (Array1D< string > &grid_types, char *fs_type, Array1D< int > &param, Array1D< double > &alphas, Array1D< double > &bettas)
 Constructor, overloaded for dimension-unisotropy: initializes the dimension-specific rule types, sparseness type, dimension-specific ppd or level, and two optional parameters for quadrature rule per each dimension.
 
 Quad ()
 Constructor: empty.
 
 ~Quad ()
 Destructor.
 
void init ()
 Initialization function.
 
void SetAlpha (double alpha)
 Set the parameter alpha.
 
void SetBeta (double betta)
 Set the parameter beta.
 
void SetDomain (Array1D< double > &aa, Array1D< double > &bb)
 Set the domain endpoints (for compact support domains)
 
void SetDomain (Array1D< double > &aa)
 Set the domain endpoint (for semi-infinite domains)
 
void GetDomain (Array1D< double > &aa, Array1D< double > &bb) const
 Get the domain endpoints (for compact support domains)
 
void GetDomain (Array1D< double > &aa) const
 Get the domain endpoint (for semi-infinite domains)
 
void SetRule (Array2D< double > &q, Array1D< double > &w)
 Set the rule externally (only quadrature points and weights)
 
void SetRule (Array2D< double > &q, Array1D< double > &w, Array2D< int > &ind)
 Set the rule externally (quadrature points, weights and indices) Dummy function for backward compatibility.
 
void SetRule ()
 Set the rule externally (quadrature points, weights, indices, and the level)
 
void GetRule (Array2D< double > &q, Array1D< double > &w)
 Get the quadrature rule.
 
void GetRule (Array2D< double > &q, Array1D< double > &w, Array2D< int > &ind)
 Get the quadrature rule with indexing Dummy function for backward compatibility.
 
void SetQdpts (Array2D< double > &q)
 Externally set quadrature points.
 
void SetWghts (Array1D< double > &w)
 Externally set the weights.
 
void GetQdpts (Array2D< double > &q)
 Externally set the indices.
 
void GetWghts (Array1D< double > &w)
 Get the weights.
 
void SetLevel (int param)
 Get the indices.
 
void nextLevel ()
 Compute the indices of the next-level points.
 
int GetNQ ()
 Get the number of quadrature points.
 
void SetVerbosity (int verbosity)
 Set the verbosity level.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Member Functions

 Quad (const Quad &)
 Dummy copy constructor, which should not be used as it is currently not well defined.
 
void MultiplyTwoRules (QuadRule *rule1, QuadRule *rule2, QuadRule *rule_prod)
 Multiply two rules (full tensor product)
 
void MultiplyManyRules (int nrules, QuadRule *rules, QuadRule *rule_prod)
 Multiply many rules (full tensor product)
 
void MultiplyManyRules_ (int nrules, QuadRule *rules, QuadRule *rule_prod)
 
void AddTwoRules (QuadRule *rule1, QuadRule *rule2, QuadRule *rule_sum)
 Add two rules.
 
void SubtractTwoRules (QuadRule *rule1, QuadRule *rule2, QuadRule *rule_sum)
 Subtract two rules.
 
void create1DRule (string gridtype, Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
 Compute 1D rules.
 
void create1DRule_CC (Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
 Clenshaw-Curtis (includes the endpoints)
 
void create1DRule_LU (Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
 Legendre-Uniform.
 
void create1DRule_HG (Array1D< double > &qdpts, Array1D< double > &wghts, int ngr)
 Gauss-Hermite.
 
void create1DRule_NC (Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
 Newton-Cotes (i.e. equispaced, includes the endpoints)
 
void create1DRule_NCO (Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
 Newton-Cotes open (i.e. excludes the endpoints)
 
void create1DRule_CCO (Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
 Clenshaw-Curtis open (i.e. excludes the endpoints)
 
void create1DRule_JB (Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
 Jacobi-Beta.
 
void create1DRule_LG (Array1D< double > &qdpts, Array1D< double > &wghts, int ngr)
 Gamma-Laguerre.
 
void create1DRule_SW (Array1D< double > &qdpts, Array1D< double > &wghts, int ngr)
 Stieltjes-Wigert.
 
void create1DRule_pdf (Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
 Custom rule given the recursive coefficients of the corresponding orthogonal polynomials.
 
void create1DRule_GP3 (Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
 Gauss-Patterson starting with Legendre-Uniform 3.
 
void getMultiIndexLevel (Array2D< int > &multiIndexLevel, int level, int ndim)
 Auxilliary function: get the level of the multi-index.
 
void compressRule (QuadRule *rule)
 Compress the rule, i.e. merge repeating points.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Attributes

Array1D< double > aa_
 The left endpoints of the domain.
 
Array1D< double > bb_
 the right endpoints of the domain
 
int quadverbose_
 Verbosity level.
 
double alpha_
 The first parameter of the rule, if any.
 
double beta_
 The second parameter of the rule, if any.
 
Array1D< double > alphas_
 The first parameter of the rule, if any.
 
Array1D< double > betas_
 The second parameter of the rule, if any.
 
QuadRule rule_
 The quadrature rule structure.
 
int ndim_
 The dimensionality.
 
int nlevel_
 The current level, working variable for hierarchical construction.
 
int maxlevel_
 The level for sparse rules, or the number of grid points per dim for full product rules.
 
Array1D< int > param_
 
Array2D< int > npts_all
 Working arrays.
 
Array2D< int > npts_1_all
 
Array2D< QuadRule > qr_all
 
Array2D< QuadRule > qr_1_all
 
int growth_rule_
 Growth rule: exponential(0) or linear(1)
 
Array1D< int > growth_rules_
 Growth rules: exponential(0) or linear(1)
 
string grid_type_
 Grid type: 'CC','CCO','NC','NCO','LU', 'HG', 'JB', 'LG', 'SW', 'pdf', or 'GP3'.
 
Array1D< string > grid_types_
 Vector of grid types: 'CC','CCO','NC','NCO','LU', 'HG', 'JB', 'LG', 'SW', 'pdf', or 'GP3'.
 
string fs_type_
 Sparseness type (full or sparse)
 
+

Detailed Description

+

Generates quadrature rules.

+
Note
Besides quadrature rules corresponding to PC bases (i.e. LU, HG, LG, SW, JB), Clenshaw-Curtis(CC) and Newton-Cotes(NC) as well as their Open (with no endpoints) versions (CCO, NCO) are implemented. Also, Gauss-Patterson (GP3) and custom (pdf) rules are added.
+

Constructor & Destructor Documentation

+ +

◆ Quad() [1/4]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Quad::Quad (char * grid_type,
char * fs_type,
int ndim,
int param,
double alpha = 0.0,
double betta = 1.0 )
+
+ +

Constructor: initializes the rule type, sparseness type, dimensionality, level or ppd parameter, and two optional parameters for quadrature rule.

+
Note
Options for the arguments are: grid_type : LU, HG, LG, SW, JB, CC, CCO, NC, NCO, GP3, pdf fs_type : full, sparse ndim : integer dimensionality param : integer points-per-dimension (if full), or level (if sparse) alpha : parameter #1 for the corresponding PC type (e.g. LG requires one parameter) betta : parameter #2 for the corresponding PC type (e.g. JB requires two parameters)
+ +
+
+ +

◆ Quad() [2/4]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
Quad::Quad (Array1D< string > & grid_types,
char * fs_type,
Array1D< int > & param,
Array1D< double > & alphas,
Array1D< double > & bettas )
+
+ +

Constructor, overloaded for dimension-unisotropy: initializes the dimension-specific rule types, sparseness type, dimension-specific ppd or level, and two optional parameters for quadrature rule per each dimension.

+
Note
Options for the arguments are: grid_types : array with entry options LU, HG, LG, SW, JB, CC, CCO, NC, NCO, GP3, pdf fs_type : full, sparse param : integer array for points-per-dimension (if full), or an array with first element indicating the level (if sparse) alpha : array of parameters #1 for the corresponding PC type (e.g. LG requires one parameter) bettas : array of parameters #2 for the corresponding PC type (e.g. JB requires two parameters)
+ +
+
+ +

◆ Quad() [3/4]

+ +
+
+ + + + + +
+ + + + + + + +
Quad::Quad ()
+ 		+inline
+
+ +

Constructor: empty.

+ +
+
+ +

◆ ~Quad()

+ +
+
+ + + + + +
+ + + + + + + +
Quad::~Quad ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+ +

◆ Quad() [4/4]

+ +
+
+ + + + + +
+ + + + + + + +
Quad::Quad (const Quad & )
+ 		+inlineprivate
+
+ +

Dummy copy constructor, which should not be used as it is currently not well defined.

+ +
+
+

Member Function Documentation

+ +

◆ AddTwoRules()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Quad::AddTwoRules (QuadRule * rule1,
QuadRule * rule2,
QuadRule * rule_sum )
+ 		+private
+
+ +

Add two rules.

+ +
+
+ +

◆ compressRule()

+ +
+
+ + + + + +
+ + + + + + + +
void Quad::compressRule (QuadRule * rule)
+ 		+private
+
+ +

Compress the rule, i.e. merge repeating points.

+ +
+
+ +

◆ create1DRule()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void Quad::create1DRule (string gridtype,
Array1D< double > & qdpts,
Array1D< double > & wghts,
int ngr,
double a,
double b )
+ 		+private
+
+ +

Compute 1D rules.

+ +
+
+ +

◆ create1DRule_CC()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void Quad::create1DRule_CC (Array1D< double > & qdpts,
Array1D< double > & wghts,
int ngr,
double a,
double b )
+ 		+private
+
+ +

Clenshaw-Curtis (includes the endpoints)

+
Note
Heavily adopted from http://people.sc.fsu.edu/~jburkardt/cpp_src/sparse_grid_cc/sparse_grid_cc.html (distributed under LGPL)
+ +
+
+ +

◆ create1DRule_CCO()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void Quad::create1DRule_CCO (Array1D< double > & qdpts,
Array1D< double > & wghts,
int ngr,
double a,
double b )
+ 		+private
+
+ +

Clenshaw-Curtis open (i.e. excludes the endpoints)

+
Note
Heavily adopted from http://people.sc.fsu.edu/~jburkardt/cpp_src/sparse_grid_cc/sparse_grid_cc.html (distributed under LGPL)
+ +
+
+ +

◆ create1DRule_GP3()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void Quad::create1DRule_GP3 (Array1D< double > & qdpts,
Array1D< double > & wghts,
int ngr,
double a,
double b )
+ 		+private
+
+ +

Gauss-Patterson starting with Legendre-Uniform 3.

+
Note
Hardwired reading of quadrature points and weights
+ +
+
+ +

◆ create1DRule_HG()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Quad::create1DRule_HG (Array1D< double > & qdpts,
Array1D< double > & wghts,
int ngr )
+ 		+private
+
+ +

Gauss-Hermite.

+ +
+
+ +

◆ create1DRule_JB()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void Quad::create1DRule_JB (Array1D< double > & qdpts,
Array1D< double > & wghts,
int ngr,
double a,
double b )
+ 		+private
+
+ +

Jacobi-Beta.

+ +
+
+ +

◆ create1DRule_LG()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Quad::create1DRule_LG (Array1D< double > & qdpts,
Array1D< double > & wghts,
int ngr )
+ 		+private
+
+ +

Gamma-Laguerre.

+ +
+
+ +

◆ create1DRule_LU()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void Quad::create1DRule_LU (Array1D< double > & qdpts,
Array1D< double > & wghts,
int ngr,
double a,
double b )
+ 		+private
+
+ +

Legendre-Uniform.

+ +
+
+ +

◆ create1DRule_NC()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void Quad::create1DRule_NC (Array1D< double > & qdpts,
Array1D< double > & wghts,
int ngr,
double a,
double b )
+ 		+private
+
+ +

Newton-Cotes (i.e. equispaced, includes the endpoints)

+ +
+
+ +

◆ create1DRule_NCO()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void Quad::create1DRule_NCO (Array1D< double > & qdpts,
Array1D< double > & wghts,
int ngr,
double a,
double b )
+ 		+private
+
+ +

Newton-Cotes open (i.e. excludes the endpoints)

+ +
+
+ +

◆ create1DRule_pdf()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void Quad::create1DRule_pdf (Array1D< double > & qdpts,
Array1D< double > & wghts,
int ngr,
double a,
double b )
+ 		+private
+
+ +

Custom rule given the recursive coefficients of the corresponding orthogonal polynomials.

+
Todo
Recursive coefficients are given in a file 'ab.dat'; will need to make this more friendly
+ +
+
+ +

◆ create1DRule_SW()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Quad::create1DRule_SW (Array1D< double > & qdpts,
Array1D< double > & wghts,
int ngr )
+ 		+private
+
+ +

Stieltjes-Wigert.

+ +
+
+ +

◆ GetDomain() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
void Quad::GetDomain (Array1D< double > & aa) const
+ 		+inline
+
+ +

Get the domain endpoint (for semi-infinite domains)

+ +
+
+ +

◆ GetDomain() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void Quad::GetDomain (Array1D< double > & aa,
Array1D< double > & bb ) const
+ 		+inline
+
+ +

Get the domain endpoints (for compact support domains)

+ +
+
+ +

◆ getMultiIndexLevel()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Quad::getMultiIndexLevel (Array2D< int > & multiIndexLevel,
int level,
int ndim )
+ 		+private
+
+ +

Auxilliary function: get the level of the multi-index.

+ +
+
+ +

◆ GetNQ()

+ +
+
+ + + + + +
+ + + + + + + +
int Quad::GetNQ ()
+ 		+inline
+
+ +

Get the number of quadrature points.

+ +
+
+ +

◆ GetQdpts()

+ +
+
+ + + + + +
+ + + + + + + +
void Quad::GetQdpts (Array2D< double > & q)
+ 		+inline
+
+ +

Externally set the indices.

+

Get quadrature points

+ +
+
+ +

◆ GetRule() [1/2]

+ +
+
+ + + + + + + + + + + +
void Quad::GetRule (Array2D< double > & q,
Array1D< double > & w )
+
+ +

Get the quadrature rule.

+ +
+
+ +

◆ GetRule() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Quad::GetRule (Array2D< double > & q,
Array1D< double > & w,
Array2D< int > & ind )
+ 		+inline
+
+ +

Get the quadrature rule with indexing Dummy function for backward compatibility.

+ +
+
+ +

◆ GetWghts()

+ +
+
+ + + + + +
+ + + + + + + +
void Quad::GetWghts (Array1D< double > & w)
+ 		+inline
+
+ +

Get the weights.

+ +
+
+ +

◆ init()

+ +
+
+ + + + + + + +
void Quad::init ()
+
+ +

Initialization function.

+ +
+
+ +

◆ MultiplyManyRules()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Quad::MultiplyManyRules (int nrules,
QuadRule * rules,
QuadRule * rule_prod )
+ 		+private
+
+ +

Multiply many rules (full tensor product)

+ +
+
+ +

◆ MultiplyManyRules_()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Quad::MultiplyManyRules_ (int nrules,
QuadRule * rules,
QuadRule * rule_prod )
+ 		+private
+
+ +
+
+ +

◆ MultiplyTwoRules()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Quad::MultiplyTwoRules (QuadRule * rule1,
QuadRule * rule2,
QuadRule * rule_prod )
+ 		+private
+
+ +

Multiply two rules (full tensor product)

+ +
+
+ +

◆ nextLevel()

+ +
+
+ + + + + + + +
void Quad::nextLevel ()
+
+ +

Compute the indices of the next-level points.

+ +
+
+ +

◆ SetAlpha()

+ +
+
+ + + + + +
+ + + + + + + +
void Quad::SetAlpha (double alpha)
+ 		+inline
+
+ +

Set the parameter alpha.

+ +
+
+ +

◆ SetBeta()

+ +
+
+ + + + + +
+ + + + + + + +
void Quad::SetBeta (double betta)
+ 		+inline
+
+ +

Set the parameter beta.

+ +
+
+ +

◆ SetDomain() [1/2]

+ +
+
+ + + + + + + +
void Quad::SetDomain (Array1D< double > & aa)
+
+ +

Set the domain endpoint (for semi-infinite domains)

+ +
+
+ +

◆ SetDomain() [2/2]

+ +
+
+ + + + + + + + + + + +
void Quad::SetDomain (Array1D< double > & aa,
Array1D< double > & bb )
+
+ +

Set the domain endpoints (for compact support domains)

+ +
+
+ +

◆ SetLevel()

+ +
+
+ + + + + +
+ + + + + + + +
void Quad::SetLevel (int param)
+ 		+inline
+
+ +

Get the indices.

+

Set the level parameter

+ +
+
+ +

◆ SetQdpts()

+ +
+
+ + + + + +
+ + + + + + + +
void Quad::SetQdpts (Array2D< double > & q)
+ 		+inline
+
+ +

Externally set quadrature points.

+ +
+
+ +

◆ SetRule() [1/3]

+ +
+
+ + + + + + + +
void Quad::SetRule ()
+
+ +

Set the rule externally (quadrature points, weights, indices, and the level)

+

Set the rule (the function that builds quadrature points/weights/indices)

+ +
+
+ +

◆ SetRule() [2/3]

+ +
+
+ + + + + + + + + + + +
void Quad::SetRule (Array2D< double > & q,
Array1D< double > & w )
+
+ +

Set the rule externally (only quadrature points and weights)

+ +
+
+ +

◆ SetRule() [3/3]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Quad::SetRule (Array2D< double > & q,
Array1D< double > & w,
Array2D< int > & ind )
+ 		+inline
+
+ +

Set the rule externally (quadrature points, weights and indices) Dummy function for backward compatibility.

+ +
+
+ +

◆ SetVerbosity()

+ +
+
+ + + + + +
+ + + + + + + +
void Quad::SetVerbosity (int verbosity)
+ 		+inline
+
+ +

Set the verbosity level.

+
Note
Currently, the values of 0, 1 and 2 are implemented
+ +
+
+ +

◆ SetWghts()

+ +
+
+ + + + + +
+ + + + + + + +
void Quad::SetWghts (Array1D< double > & w)
+ 		+inline
+
+ +

Externally set the weights.

+ +
+
+ +

◆ SubtractTwoRules()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void Quad::SubtractTwoRules (QuadRule * rule1,
QuadRule * rule2,
QuadRule * rule_sum )
+ 		+private
+
+ +

Subtract two rules.

+ +
+
+

Member Data Documentation

+ +

◆ aa_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Quad::aa_
+ 		+private
+
+ +

The left endpoints of the domain.

+ +
+
+ +

◆ alpha_

+ +
+
+ + + + + +
+ + + + +
double Quad::alpha_
+ 		+private
+
+ +

The first parameter of the rule, if any.

+ +
+
+ +

◆ alphas_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Quad::alphas_
+ 		+private
+
+ +

The first parameter of the rule, if any.

+ +
+
+ +

◆ bb_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Quad::bb_
+ 		+private
+
+ +

the right endpoints of the domain

+ +
+
+ +

◆ beta_

+ +
+
+ + + + + +
+ + + + +
double Quad::beta_
+ 		+private
+
+ +

The second parameter of the rule, if any.

+ +
+
+ +

◆ betas_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> Quad::betas_
+ 		+private
+
+ +

The second parameter of the rule, if any.

+ +
+
+ +

◆ fs_type_

+ +
+
+ + + + + +
+ + + + +
string Quad::fs_type_
+ 		+private
+
+ +

Sparseness type (full or sparse)

+ +
+
+ +

◆ grid_type_

+ +
+
+ + + + + +
+ + + + +
string Quad::grid_type_
+ 		+private
+
+ +

Grid type: 'CC','CCO','NC','NCO','LU', 'HG', 'JB', 'LG', 'SW', 'pdf', or 'GP3'.

+ +
+
+ +

◆ grid_types_

+ +
+
+ + + + + +
+ + + + +
Array1D<string> Quad::grid_types_
+ 		+private
+
+ +

Vector of grid types: 'CC','CCO','NC','NCO','LU', 'HG', 'JB', 'LG', 'SW', 'pdf', or 'GP3'.

+ +
+
+ +

◆ growth_rule_

+ +
+
+ + + + + +
+ + + + +
int Quad::growth_rule_
+ 		+private
+
+ +

Growth rule: exponential(0) or linear(1)

+ +
+
+ +

◆ growth_rules_

+ +
+
+ + + + + +
+ + + + +
Array1D<int> Quad::growth_rules_
+ 		+private
+
+ +

Growth rules: exponential(0) or linear(1)

+ +
+
+ +

◆ maxlevel_

+ +
+
+ + + + + +
+ + + + +
int Quad::maxlevel_
+ 		+private
+
+ +

The level for sparse rules, or the number of grid points per dim for full product rules.

+ +
+
+ +

◆ ndim_

+ +
+
+ + + + + +
+ + + + +
int Quad::ndim_
+ 		+private
+
+ +

The dimensionality.

+ +
+
+ +

◆ nlevel_

+ +
+
+ + + + + +
+ + + + +
int Quad::nlevel_
+ 		+private
+
+ +

The current level, working variable for hierarchical construction.

+ +
+
+ +

◆ npts_1_all

+ +
+
+ + + + + +
+ + + + +
Array2D<int> Quad::npts_1_all
+ 		+private
+
+ +
+
+ +

◆ npts_all

+ +
+
+ + + + + +
+ + + + +
Array2D<int> Quad::npts_all
+ 		+private
+
+ +

Working arrays.

+ +
+
+ +

◆ param_

+ +
+
+ + + + + +
+ + + + +
Array1D<int> Quad::param_
+ 		+private
+
+ +
+
+ +

◆ qr_1_all

+ +
+
+ + + + + +
+ + + + +
Array2D<QuadRule> Quad::qr_1_all
+ 		+private
+
+ +
+
+ +

◆ qr_all

+ +
+
+ + + + + +
+ + + + +
Array2D<QuadRule> Quad::qr_all
+ 		+private
+
+ +
+
+ +

◆ quadverbose_

+ +
+
+ + + + + +
+ + + + +
int Quad::quadverbose_
+ 		+private
+
+ +

Verbosity level.

+
Note
Currently the values of 0, 1 or 2 are implemented.
+ +
+
+ +

◆ rule_

+ +
+
+ + + + + +
+ + + + +
QuadRule Quad::rule_
+ 		+private
+
+ +

The quadrature rule structure.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classRBFreg-members.html b/docs/html/classRBFreg-members.html new file mode 100644 index 00000000..7c8b6de3 --- /dev/null +++ b/docs/html/classRBFreg-members.html @@ -0,0 +1,125 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
RBFreg Member List
+
+
+ +

This is the complete list of members for RBFreg, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
A_Lregprotected
A_inv_Lregprotected
BCS_BuildRegr(Array1D< int > &selected, double eta)Lreg
bdata_Lregprotected
centers_RBFregprivate
coef_Lregprotected
coef_cov_Lregprotected
coef_erb_Lregprotected
computeErrorMetrics(string method)Lreg
computeRVE(Array2D< double > &xval, Array1D< double > &yval, Array1D< double > &yval_regr)Lreg
dataSetFlag_Lregprivate
diagP_Lregprotected
diagPFlag_Lregprotected
EvalBases(Array2D< double > &xx, Array2D< double > &bb)RBFregvirtual
EvalRegr(Array2D< double > &xcheck, Array1D< double > &ycheck, Array1D< double > &yvar, Array2D< double > &ycov)Lreg
GetCoef(Array1D< double > &coef)Lreginline
GetCoefCov(Array2D< double > &coef_cov)Lreginline
getDiagP()Lreg
GetMindex(Array2D< int > &mindex)Lreginlinevirtual
GetNbas() constLreginline
GetNdim() constLreginline
GetNpt() constLreginline
getResid()Lreg
GetSigma2() constLreginline
Hty_Lregprotected
InitRegr()Lreg
Lreg()Lreginline
LSQ_BuildRegr()Lreg
LSQ_computeBestLambda()Lreg
LSQ_computeBestLambdas()Lreg
LSQ_computeGCV()Lregprivate
LSQ_computeLOO()Lregprivate
nbas_Lregprotected
ndim_Lregprotected
npt_Lregprotected
Proj(Array1D< double > &array, Array1D< double > &proj_array)Lreg
RBFreg(Array2D< double > &centers, Array1D< double > &widths)RBFreg
regMode_Lregprivate
resid_Lregprotected
residFlag_Lregprotected
SetCenters(Array2D< double > &centers)RBFregvirtual
SetMindex(Array2D< int > &mindex)Lreginlinevirtual
SetParamsRBF()Lreginlinevirtual
SetRegMode(string regmode)Lreginline
SetRegWeights(Array1D< double > &weights)Lreg
SetupData(Array2D< double > &xdata, Array1D< double > &ydata)Lreg
SetupData(Array2D< double > &xdata, Array2D< double > &ydata)Lreg
SetWidths(Array1D< double > &widths)RBFregvirtual
sigma2_Lregprotected
StripBases(Array1D< int > &used)RBFregvirtual
weights_Lregprotected
widths_RBFregprivate
xdata_Lregprotected
ydata_Lregprotected
~Lreg()Lreginline
~RBFreg()RBFreginline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classRBFreg.html b/docs/html/classRBFreg.html new file mode 100644 index 00000000..3855cda5 --- /dev/null +++ b/docs/html/classRBFreg.html @@ -0,0 +1,473 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: RBFreg Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Attributes | +List of all members
+
RBFreg Class Reference
+
+
+ +

Derived class for RBF regression. + More...

+ +

#include <lreg.h>

+
+Inheritance diagram for RBFreg:
+
+
+ + +Lreg + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 RBFreg (Array2D< double > &centers, Array1D< double > &widths)
 Constructor:
 
 ~RBFreg ()
 Destructor.
 
void SetCenters (Array2D< double > &centers)
 Set centers.
 
void SetWidths (Array1D< double > &widths)
 Set widths.
 
void EvalBases (Array2D< double > &xx, Array2D< double > &bb)
 Evaluate the bases.
 
void StripBases (Array1D< int > &used)
 Strip the bases.
 
- Public Member Functions inherited from Lreg
 Lreg ()
 Constructor.
 
 ~Lreg ()
 Destrcutor.
 
virtual void SetMindex (Array2D< int > &mindex)
 Set multiindex.
 
virtual void GetMindex (Array2D< int > &mindex)
 Get multiindex.
 
virtual void SetParamsRBF ()
 Set parameters (for RBF)
 
void InitRegr ()
 Initialize.
 
void SetupData (Array2D< double > &xdata, Array1D< double > &ydata)
 Setup data (1d ydata)
 
void SetupData (Array2D< double > &xdata, Array2D< double > &ydata)
 Setup data (2d ydata)
 
void SetRegMode (string regmode)
 Set the regression mode.
 
void SetRegWeights (Array1D< double > &weights)
 Set weights.
 
void BCS_BuildRegr (Array1D< int > &selected, double eta)
 Build BCS regression.
 
void LSQ_BuildRegr ()
 Build LSQ regression.
 
void EvalRegr (Array2D< double > &xcheck, Array1D< double > &ycheck, Array1D< double > &yvar, Array2D< double > &ycov)
 Evaluate the regression expansion.
 
int GetNpt () const
 Get the number of points.
 
int GetNdim () const
 Get dimensionality.
 
int GetNbas () const
 Get the number of bases.
 
double GetSigma2 () const
 Get the variance of the data.
 
void GetCoefCov (Array2D< double > &coef_cov)
 Get coefficient covariance.
 
void GetCoef (Array1D< double > &coef)
 Get coefficients.
 
void Proj (Array1D< double > &array, Array1D< double > &proj_array)
 Project.
 
Array1D< double > LSQ_computeBestLambdas ()
 Compute the best values for regulariation parameter vector lambda, for LSQ.
 
double LSQ_computeBestLambda ()
 Compute the best value for regulariation parameter lambda, for LSQ.
 
void getResid ()
 Compute the residual vector, if not already computed.
 
void getDiagP ()
 Compute the diagonal of projection matrix, if not already computed.
 
Array1D< double > computeErrorMetrics (string method)
 Compote error according to a selected metrics.
 
double computeRVE (Array2D< double > &xval, Array1D< double > &yval, Array1D< double > &yval_regr)
 Compute validation error.
 
+ + + + + + + +

+Private Attributes

Array2D< double > centers_
 RBF centers.
 
Array1D< double > widths_
 RBF bases' widhts.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Additional Inherited Members

- Protected Attributes inherited from Lreg
Array2D< double > xdata_
 xdata array
 
Array1D< double > ydata_
 ydata array
 
int npt_
 Number of samples.
 
int nbas_
 Number of bases.
 
int ndim_
 Dimensionality.
 
Array1D< double > sigma2_
 Variance.
 
Array1D< double > weights_
 Weights.
 
Array1D< double > resid_
 Residuals.
 
bool residFlag_
 Flag to indicate whether residual is computed.
 
Array1D< double > diagP_
 Diagonal of projection matrix.
 
bool diagPFlag_
 Flag to indicate whether diagonal of projetion matrix is computed.
 
Array2D< double > bdata_
 Auxiliary matrix or vector; see UQTk Manual.
 
Array2D< double > A_
 
Array2D< double > A_inv_
 
Array2D< double > coef_cov_
 
Array1D< double > Hty_
 
Array1D< double > coef_
 
Array1D< double > coef_erb_
 
+

Detailed Description

+

Derived class for RBF regression.

+

Constructor & Destructor Documentation

+ +

◆ RBFreg()

+ +
+
+ + + + + + + + + + + +
RBFreg::RBFreg (Array2D< double > & centers,
Array1D< double > & widths )
+
+ +

Constructor:

+ +
+
+ +

◆ ~RBFreg()

+ +
+
+ + + + + +
+ + + + + + + +
RBFreg::~RBFreg ()
+ 		+inline
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ EvalBases()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void RBFreg::EvalBases (Array2D< double > & xx,
Array2D< double > & bb )
+ 		+virtual
+
+ +

Evaluate the bases.

+ +

Reimplemented from Lreg.

+ +
+
+ +

◆ SetCenters()

+ +
+
+ + + + + +
+ + + + + + + +
void RBFreg::SetCenters (Array2D< double > & centers)
+ 		+virtual
+
+ +

Set centers.

+ +

Reimplemented from Lreg.

+ +
+
+ +

◆ SetWidths()

+ +
+
+ + + + + +
+ + + + + + + +
void RBFreg::SetWidths (Array1D< double > & widths)
+ 		+virtual
+
+ +

Set widths.

+ +

Reimplemented from Lreg.

+ +
+
+ +

◆ StripBases()

+ +
+
+ + + + + +
+ + + + + + + +
void RBFreg::StripBases (Array1D< int > & used)
+ 		+virtual
+
+ +

Strip the bases.

+ +

Reimplemented from Lreg.

+ +
+
+

Member Data Documentation

+ +

◆ centers_

+ +
+
+ + + + + +
+ + + + +
Array2D<double> RBFreg::centers_
+ 		+private
+
+ +

RBF centers.

+ +
+
+ +

◆ widths_

+ +
+
+ + + + + +
+ + + + +
Array1D<double> RBFreg::widths_
+ 		+private
+
+ +

RBF bases' widhts.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classRBFreg.png b/docs/html/classRBFreg.png new file mode 100644 index 0000000000000000000000000000000000000000..bc3c9fc0f8fa953357de2152dbdc006cc90e3d27 GIT binary patch literal 363 zcmV-x0hIoUP)vTJr#LVva2S`&=-}Ys|Ns9r%~qrU000SeQchC<|NsC0|NsC0Hv*f~0002? zNkl>LDz@BjWLdJK55P|~)k{srBo{{7| zzwX)R%`Am+J*Vq?A1%iz0m_(j}eue$L%nm#^JTuHcX6MR^aPLBnop8$+5dU-yOpGx=$V;~^8-t)Ep-gd5F7vi002ov JPDHLkV1m2(uKfT2 literal 0 HcmV?d00001 diff --git a/docs/html/classRefPtr-members.html b/docs/html/classRefPtr-members.html new file mode 100644 index 00000000..7029e5e2 --- /dev/null +++ b/docs/html/classRefPtr-members.html @@ -0,0 +1,92 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
RefPtr< T > Member List
+
+
+ +

This is the complete list of members for RefPtr< T >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + +
cast(Other *p)RefPtr< T >inline
cast(RefPtr< Other > p)RefPtr< T >inline
grab()RefPtr< T >inlineprivate
operator!=(const T *p) constRefPtr< T >inline
operator!=(const RefPtr< T > &p) constRefPtr< T >inline
operator*() constRefPtr< T >inline
operator->() constRefPtr< T >inline
operator<(const RefPtr< T > &p) constRefPtr< T >inline
operator<(const RefPtr< Other > &p) constRefPtr< T >inline
operator=(T *p)RefPtr< T >inline
operator=(const RefPtr< T > &p)RefPtr< T >inline
operator==(const T *p) constRefPtr< T >inline
operator==(const RefPtr< T > &p) constRefPtr< T >inline
pointee()RefPtr< T >inline
pointee() constRefPtr< T >inline
ptr_RefPtr< T >private
RefPtr()RefPtr< T >inline
RefPtr(T *p)RefPtr< T >inline
RefPtr(const RefPtr< T > &p)RefPtr< T >inline
RefPtr(RefPtr< Other > p)RefPtr< T >inline
release()RefPtr< T >inlineprivate
Type typedefRefPtr< T >
~RefPtr()RefPtr< T >inline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classRefPtr.html b/docs/html/classRefPtr.html new file mode 100644 index 00000000..028bccad --- /dev/null +++ b/docs/html/classRefPtr.html @@ -0,0 +1,817 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: RefPtr< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Types | +Public Member Functions | +Private Member Functions | +Private Attributes | +List of all members
+
RefPtr< T > Class Template Reference
+
+
+ +

#include <RefPtr.h>

+ + + + + +

+Public Types

typedef T Type
 Make the typename that this pointer holds accessible to other objects.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 RefPtr ()
 Construct a new RefPtr and initialize the pointee to NULL.
 
 RefPtr (T *p)
 Construct a new RefPtr and initialize the pointee as given.
 
 RefPtr (const RefPtr< T > &p)
 Construct a new RefPtr and initialize to the given RefPtr pointee.
 
template<class Other >
 RefPtr (RefPtr< Other > p)
 
 ~RefPtr ()
 Destroy this RefPtr.
 
RefPtr< T > & operator= (T *p)
 Assign the value of this RefPtr to the given pointee.
 
RefPtr< T > & operator= (const RefPtr< T > &p)
 Assign the value of this RefPtr to the pointee of the given RefPtr.
 
template<class Other >
RefPtr< T > & cast (Other *p)
 
template<class Other >
RefPtr< T > & cast (RefPtr< Other > p)
 
T * operator-> () const
 
T & operator* () const
 
T * pointee ()
 Return the pointee of this RefPtr.
 
const T * pointee () const
 Return the pointee of this RefPtr in a const context.
 
bool operator== (const T *p) const
 Compare the pointee of this RefPtr with the given pointer.
 
bool operator== (const RefPtr< T > &p) const
 Compare the value of this pointee with the pointee of the given RefPtr.
 
bool operator!= (const T *p) const
 Test inequality.
 
bool operator!= (const RefPtr< T > &p) const
 Test inequality.
 
bool operator< (const RefPtr< T > &p) const
 Convenience routine to sort pointer values in standard containers.
 
template<class Other >
bool operator< (const RefPtr< Other > &p) const
 Convenience routine to sort pointer values in standard containers.
 
+ + + + + + +

+Private Member Functions

void grab ()
 Grab a reference to the current pointee if it is not NULL.
 
void release ()
 
+ + + +

+Private Attributes

T * ptr_
 
+

Detailed Description

+
template<class T>
+class RefPtr< T >

Reference counted pointer that gives the holder modification privileges to the pointee.

+

Part of the Particle Simulation Toolkit (pst)

+

Member Typedef Documentation

+ +

◆ Type

+ +
+
+
+template<class T >
+ + + + +
T RefPtr< T >::Type
+
+ +

Make the typename that this pointer holds accessible to other objects.

+ +
+
+

Constructor & Destructor Documentation

+ +

◆ RefPtr() [1/4]

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
RefPtr< T >::RefPtr ()
+ 		+inline
+
+ +

Construct a new RefPtr and initialize the pointee to NULL.

+ +
+
+ +

◆ RefPtr() [2/4]

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
RefPtr< T >::RefPtr (T * p)
+ 		+inline
+
+ +

Construct a new RefPtr and initialize the pointee as given.

+ +
+
+ +

◆ RefPtr() [3/4]

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
RefPtr< T >::RefPtr (const RefPtr< T > & p)
+ 		+inline
+
+ +

Construct a new RefPtr and initialize to the given RefPtr pointee.

+ +
+
+ +

◆ RefPtr() [4/4]

+ +
+
+
+template<class T >
+
+template<class Other >
+ + + + + +
+ + + + + + + +
RefPtr< T >::RefPtr (RefPtr< Other > p)
+ 		+inline
+
+

Perform a static cast to initialize this pointee. This cast is only valid if T is a parent class of Other

+ +
+
+ +

◆ ~RefPtr()

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
RefPtr< T >::~RefPtr ()
+ 		+inline
+
+ +

Destroy this RefPtr.

+ +
+
+

Member Function Documentation

+ +

◆ cast() [1/2]

+ +
+
+
+template<class T >
+
+template<class Other >
+ + + + + +
+ + + + + + + +
RefPtr< T > & RefPtr< T >::cast (Other * p)
+ 		+inline
+
+

Use dynamic_cast to set the pointee to the pointer that was passed in, and return *this. The returned value is NULL if the cast fails.

+ +
+
+ +

◆ cast() [2/2]

+ +
+
+
+template<class T >
+
+template<class Other >
+ + + + + +
+ + + + + + + +
RefPtr< T > & RefPtr< T >::cast (RefPtr< Other > p)
+ 		+inline
+
+

Use dynamic_cast to set the pointee to the pointee of the RefPtr given, and return *this. The returned value is NULL if the cast fails.

+ +
+
+ +

◆ grab()

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
void RefPtr< T >::grab ()
+ 		+inlineprivate
+
+ +

Grab a reference to the current pointee if it is not NULL.

+ +
+
+ +

◆ operator!=() [1/2]

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
bool RefPtr< T >::operator!= (const RefPtr< T > & p) const
+ 		+inline
+
+ +

Test inequality.

+ +
+
+ +

◆ operator!=() [2/2]

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
bool RefPtr< T >::operator!= (const T * p) const
+ 		+inline
+
+ +

Test inequality.

+ +
+
+ +

◆ operator*()

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
T & RefPtr< T >::operator* () const
+ 		+inline
+
+

Return a reference to the pointee of this RefPtr. This will not work right if the pointee is NULL.

+ +
+
+ +

◆ operator->()

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
T * RefPtr< T >::operator-> () const
+ 		+inline
+
+

Return the pointee of this RefPtr. This will throw an exception if the pointee is NULL.

+ +
+
+ +

◆ operator<() [1/2]

+ +
+
+
+template<class T >
+
+template<class Other >
+ + + + + +
+ + + + + + + +
bool RefPtr< T >::operator< (const RefPtr< Other > & p) const
+ 		+inline
+
+ +

Convenience routine to sort pointer values in standard containers.

+ +
+
+ +

◆ operator<() [2/2]

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
bool RefPtr< T >::operator< (const RefPtr< T > & p) const
+ 		+inline
+
+ +

Convenience routine to sort pointer values in standard containers.

+ +
+
+ +

◆ operator=() [1/2]

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
RefPtr< T > & RefPtr< T >::operator= (const RefPtr< T > & p)
+ 		+inline
+
+ +

Assign the value of this RefPtr to the pointee of the given RefPtr.

+ +
+
+ +

◆ operator=() [2/2]

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
RefPtr< T > & RefPtr< T >::operator= (T * p)
+ 		+inline
+
+ +

Assign the value of this RefPtr to the given pointee.

+ +
+
+ +

◆ operator==() [1/2]

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
bool RefPtr< T >::operator== (const RefPtr< T > & p) const
+ 		+inline
+
+ +

Compare the value of this pointee with the pointee of the given RefPtr.

+ +
+
+ +

◆ operator==() [2/2]

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
bool RefPtr< T >::operator== (const T * p) const
+ 		+inline
+
+ +

Compare the pointee of this RefPtr with the given pointer.

+ +
+
+ +

◆ pointee() [1/2]

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
T * RefPtr< T >::pointee ()
+ 		+inline
+
+ +

Return the pointee of this RefPtr.

+ +
+
+ +

◆ pointee() [2/2]

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
const T * RefPtr< T >::pointee () const
+ 		+inline
+
+ +

Return the pointee of this RefPtr in a const context.

+ +
+
+ +

◆ release()

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + +
void RefPtr< T >::release ()
+ 		+inlineprivate
+
+

Release the reference to the current pointee if it is not NULL. If this results in the reference count of the pointee dropping to zero, delete the object pointed to.

+ +
+
+

Member Data Documentation

+ +

◆ ptr_

+ +
+
+
+template<class T >
+ + + + + +
+ + + + +
T* RefPtr< T >::ptr_
+ 		+private
+
+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classXMLAttributeList-members.html b/docs/html/classXMLAttributeList-members.html new file mode 100644 index 00000000..0fdf081a --- /dev/null +++ b/docs/html/classXMLAttributeList-members.html @@ -0,0 +1,107 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
XMLAttributeList Member List
+
+
+ +

This is the complete list of members for XMLAttributeList, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
attribute_XMLAttributeListprivate
begin()XMLAttributeList
begin() constXMLAttributeList
boolean_value(const std::string &, const char *where) constXMLAttributeListprivate
const_iterator typedefXMLAttributeList
ConstRefPtr classXMLAttributeListfriend
end()XMLAttributeList
end() constXMLAttributeList
get(const std::string &) constXMLAttributeList
get(const std::string &, const std::string &) constXMLAttributeList
get_bool(const std::string &) constXMLAttributeList
get_bool(const std::string &, bool) constXMLAttributeList
get_double(const std::string &) constXMLAttributeList
get_double(const std::string &, double) constXMLAttributeList
get_int(const std::string &) constXMLAttributeList
get_int(const std::string &, int) constXMLAttributeList
get_location(const std::string &)XMLAttributeListprivate
get_location(const std::string &) constXMLAttributeListprivate
has(const std::string &) constXMLAttributeList
iterator typedefXMLAttributeList
make_lower_case(std::string &) constXMLAttributeListprivate
Map_t typedefXMLAttributeList
Object()Objectinline
operator=(const XMLAttributeList &)XMLAttributeListprivate
reference_count() constObjectinline
reference_grab() constObjectinlineprotected
reference_release() constObjectinlineprotected
RefPtr classXMLAttributeListfriend
refs_Objectmutableprivate
set(const std::string &, const std::string &)XMLAttributeList
set_bool(const std::string &, bool)XMLAttributeList
set_double(const std::string &, double)XMLAttributeList
set_int(const std::string &, int)XMLAttributeList
size() constXMLAttributeList
XMLAttributeList()XMLAttributeList
XMLAttributeList(const XMLAttributeList &)XMLAttributeListprivate
~Object()Objectinlinevirtual
~XMLAttributeList()XMLAttributeListvirtual
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classXMLAttributeList.html b/docs/html/classXMLAttributeList.html new file mode 100644 index 00000000..97bf72b8 --- /dev/null +++ b/docs/html/classXMLAttributeList.html @@ -0,0 +1,957 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLAttributeList Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Types | +Public Member Functions | +Private Member Functions | +Private Attributes | +Friends | +List of all members
+
XMLAttributeList Class Reference
+
+
+ +

#include <XMLAttributeList.h>

+
+Inheritance diagram for XMLAttributeList:
+
+
+ + +Object + +
+ + + + + + + + + + +

+Public Types

typedef std::map< std::string, std::string > Map_t
 The container type used to hold the attributes.
 
typedef Map_t::iterator iterator
 The iterator type returned by this implementation.
 
typedef Map_t::const_iterator const_iterator
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 XMLAttributeList ()
 Construct a blank attribute list.
 
virtual ~XMLAttributeList ()
 Destroy this list.
 
int size () const
 Get the number of attributes in the list.
 
bool has (const std::string &) const
 Return true if the given key is defined.
 
const std::string & get (const std::string &) const
 
std::string get (const std::string &, const std::string &) const
 
int get_int (const std::string &) const
 
int get_int (const std::string &, int) const
 
double get_double (const std::string &) const
 
double get_double (const std::string &, double) const
 
bool get_bool (const std::string &) const
 
bool get_bool (const std::string &, bool) const
 
void set (const std::string &, const std::string &)
 Assign a text attribute to the given key.
 
void set_int (const std::string &, int)
 Assign an integer value to the given key.
 
void set_double (const std::string &, double)
 Assign a numerical value to the given key.
 
void set_bool (const std::string &, bool)
 
iterator begin ()
 Get an iterator to the first element.
 
iterator end ()
 Get an iterator past the last element.
 
const_iterator begin () const
 Get an iterator to the first element in a const context.
 
const_iterator end () const
 Get an iterator past the last element in a const context.
 
- Public Member Functions inherited from Object
 Object ()
 Construct a new reference counted object with a zero reference count.
 
virtual ~Object ()
 Destroy this object.
 
long int reference_count () const
 Returns the number of references that are held to this object.
 
+ + + + + + + + + + + + + + + + +

+Private Member Functions

 XMLAttributeList (const XMLAttributeList &)
 Blocked copy constructor. Throws an exception.
 
XMLAttributeList & operator= (const XMLAttributeList &)
 
void make_lower_case (std::string &) const
 
iterator get_location (const std::string &)
 Get an iterator pointing to the location of the given string.
 
const_iterator get_location (const std::string &) const
 Get an iterator to a location in a const context.
 
bool boolean_value (const std::string &, const char *where) const
 
+ + + + +

+Private Attributes

Map_t attribute_
 The attributes.
 
+ + + + + + + +

+Friends

template<class T >
class RefPtr
 
template<class T >
class ConstRefPtr
 
+ + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from Object
long int reference_grab () const
 
long int reference_release () const
 
+

Detailed Description

+

The implementation of a container for XML attributes.

+

Attributes are stored as key-value pairs, both of which are stored as text strings. The keys are stored and handled in a case-sensitive manner, whereas the values are stored exactly as given.

+

The order in which attributes were added is not preserved. I am not sure whether this is a problem or not.

+

Boolean values are a special case. They are treated in a case-insensitive manner. True boolean values are returned for the strings 'true', 'yes', and non-zero numerical values. False boolean values are returned for the strings 'false', 'no', and zero values. All other strings are considered unacceptable boolean values.

+

Written by Helgi Adalsteinsson Modified by Bert Debusschere, 3/13/08 to make keys case-sensitive

+

Member Typedef Documentation

+ +

◆ const_iterator

+ +
+
+ + + + +
Map_t::const_iterator XMLAttributeList::const_iterator
+
+ +
+
+ +

◆ iterator

+ +
+
+ + + + +
Map_t::iterator XMLAttributeList::iterator
+
+ +

The iterator type returned by this implementation.

+ +
+
+ +

◆ Map_t

+ +
+
+ + + + +
std::map< std::string, std::string > XMLAttributeList::Map_t
+
+ +

The container type used to hold the attributes.

+ +
+
+

Constructor & Destructor Documentation

+ +

◆ XMLAttributeList() [1/2]

+ +
+
+ + + + + + + +
XMLAttributeList::XMLAttributeList ()
+
+ +

Construct a blank attribute list.

+ +
+
+ +

◆ XMLAttributeList() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
XMLAttributeList::XMLAttributeList (const XMLAttributeList & )
+ 		+private
+
+ +

Blocked copy constructor. Throws an exception.

+ +
+
+ +

◆ ~XMLAttributeList()

+ +
+
+ + + + + +
+ + + + + + + +
XMLAttributeList::~XMLAttributeList ()
+ 		+virtual
+
+ +

Destroy this list.

+ +
+
+

Member Function Documentation

+ +

◆ begin() [1/2]

+ +
+
+ + + + + + + +
XMLAttributeList::iterator XMLAttributeList::begin ()
+
+ +

Get an iterator to the first element.

+ +
+
+ +

◆ begin() [2/2]

+ +
+
+ + + + + + + +
XMLAttributeList::const_iterator XMLAttributeList::begin () const
+
+ +

Get an iterator to the first element in a const context.

+ +
+
+ +

◆ boolean_value()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
bool XMLAttributeList::boolean_value (const std::string & str,
const char * where ) const
+ 		+private
+
+

Return the boolean value of the given string.

Exceptions
+ + +
MyExceptionif the string is not a valid boolean value.
+
+
+ +
+
+ +

◆ end() [1/2]

+ +
+
+ + + + + + + +
XMLAttributeList::iterator XMLAttributeList::end ()
+
+ +

Get an iterator past the last element.

+ +
+
+ +

◆ end() [2/2]

+ +
+
+ + + + + + + +
XMLAttributeList::const_iterator XMLAttributeList::end () const
+
+ +

Get an iterator past the last element in a const context.

+ +
+
+ +

◆ get() [1/2]

+ +
+
+ + + + + + + +
const std::string & XMLAttributeList::get (const std::string & key) const
+
+

Get the attribute associated with the given key.

Exceptions
+ + +
MyExceptionif the key is not defined.
+
+
+ +
+
+ +

◆ get() [2/2]

+ +
+
+ + + + + + + + + + + +
std::string XMLAttributeList::get (const std::string & key,
const std::string & def ) const
+
+

Get the attribute associated with the given key or return the given default value if the key is not defined.

+ +
+
+ +

◆ get_bool() [1/2]

+ +
+
+ + + + + + + +
bool XMLAttributeList::get_bool (const std::string & key) const
+
+

Get the given attribute as a boolean value.

Exceptions
+ + + +
MyExceptionif the key is not defined.
MyExceptionif the value is not a valid boolean value. True boolean values are "yes", "true", and 'non-zero' numerical values. False boolean values are "no" "false", and 'zero' numerical values.
+
+
+ +
+
+ +

◆ get_bool() [2/2]

+ +
+
+ + + + + + + + + + + +
bool XMLAttributeList::get_bool (const std::string & key,
bool def ) const
+
+

Get the given attribute as a boolean value or return the given default value if the key is not defined.

Exceptions
+ + +
MyExceptionif the value is not a valid boolean value.
+
+
+ +
+
+ +

◆ get_double() [1/2]

+ +
+
+ + + + + + + +
double XMLAttributeList::get_double (const std::string & key) const
+
+

Get the given attribute as a real value.

Exceptions
+ + + +
MyExceptionif the key is not defined.
MyExceptionif the value is not a valid number.
+
+
+ +
+
+ +

◆ get_double() [2/2]

+ +
+
+ + + + + + + + + + + +
double XMLAttributeList::get_double (const std::string & key,
double def ) const
+
+

Get the given attribute as a real value or return the given default value if the key is not defined.

Exceptions
+ + +
MyExceptionif the value is set and is not a valid number.
+
+
+ +
+
+ +

◆ get_int() [1/2]

+ +
+
+ + + + + + + +
int XMLAttributeList::get_int (const std::string & key) const
+
+

Get the given attribute as an integer value.

Exceptions
+ + + +
MyExceptionif the key is not defined.
MyExceptionif the value is not a valid integer.
+
+
+ +
+
+ +

◆ get_int() [2/2]

+ +
+
+ + + + + + + + + + + +
int XMLAttributeList::get_int (const std::string & key,
int def ) const
+
+

Get the given attribute as an integer value or return the given default value if the key is not defined.

Exceptions
+ + +
MyExceptionif the value is set and is not a valid integer.
+
+
+ +
+
+ +

◆ get_location() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
XMLAttributeList::iterator XMLAttributeList::get_location (const std::string & key)
+ 		+private
+
+ +

Get an iterator pointing to the location of the given string.

+ +
+
+ +

◆ get_location() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
XMLAttributeList::const_iterator XMLAttributeList::get_location (const std::string & key) const
+ 		+private
+
+ +

Get an iterator to a location in a const context.

+ +
+
+ +

◆ has()

+ +
+
+ + + + + + + +
bool XMLAttributeList::has (const std::string & key) const
+
+ +

Return true if the given key is defined.

+ +
+
+ +

◆ make_lower_case()

+ +
+
+ + + + + +
+ + + + + + + +
void XMLAttributeList::make_lower_case (std::string & str) const
+ 		+private
+
+

Convert a string to lower case (conversion in place). (needed to handle boolean values)

+ +
+
+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + +
XMLAttributeList & XMLAttributeList::operator= (const XMLAttributeList & )
+ 		+private
+
+

Blocked assignment operator.
+

Exceptions
+ + +
MyException
+
+
+ +
+
+ +

◆ set()

+ +
+
+ + + + + + + + + + + +
void XMLAttributeList::set (const std::string & key,
const std::string & val )
+
+ +

Assign a text attribute to the given key.

+ +
+
+ +

◆ set_bool()

+ +
+
+ + + + + + + + + + + +
void XMLAttributeList::set_bool (const std::string & key,
bool val )
+
+

Assign a boolean attribute to the given key. True boolean values are added as "true", false as "false"

+ +
+
+ +

◆ set_double()

+ +
+
+ + + + + + + + + + + +
void XMLAttributeList::set_double (const std::string & key,
double val )
+
+ +

Assign a numerical value to the given key.

+ +
+
+ +

◆ set_int()

+ +
+
+ + + + + + + + + + + +
void XMLAttributeList::set_int (const std::string & key,
int val )
+
+ +

Assign an integer value to the given key.

+ +
+
+ +

◆ size()

+ +
+
+ + + + + + + +
int XMLAttributeList::size () const
+
+ +

Get the number of attributes in the list.

+ +
+
+

Friends And Related Symbol Documentation

+ +

◆ ConstRefPtr

+ +
+
+
+template<class T >
+ + + + + +
+ + + + +
friend class ConstRefPtr
+ 		+friend
+
+ +
+
+ +

◆ RefPtr

+ +
+
+
+template<class T >
+ + + + + +
+ + + + +
friend class RefPtr
+ 		+friend
+
+ +
+
+

Member Data Documentation

+ +

◆ attribute_

+ +
+
+ + + + + +
+ + + + +
Map_t XMLAttributeList::attribute_
+ 		+private
+
+ +

The attributes.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classXMLAttributeList.png b/docs/html/classXMLAttributeList.png new file mode 100644 index 0000000000000000000000000000000000000000..089bfb82f3101ab0bfe8be3b2e937389b8e59e92 GIT binary patch literal 485 zcmeAS@N?(olHy`uVBq!ia0vp^nLr%C!3-pIHCN{XDd_;85ZC|z{{xvX-h3_XKeXJ! zK(jz%`k5CG9y|bwo1P6@0+iz{3GxeO0P?}WoN4wI1_s6gPZ!6K3dXl{U*H$|p;7%}PDXzNa;)RPS}y znzC54eE4q3&P#mt-uv z?~^wxd~>PmWi95N@invFE-J~Yo^~Xy{ts)W^FGI}^{#JRgTI|AKHYS0xz&xQD{U%n z-EP%d{bv0#9~19e8+-jtC8sZ0SLt`FJ8pW + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
XMLElement Member List
+
+
+ +

This is the complete list of members for XMLElement, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
add_child(RefPtr< XMLElement >)XMLElement
add_child_rpt(RefPtr< XMLElement >)XMLElement
add_content_line(const std::string &)XMLElement
attributes()XMLElement
attributes_XMLElementprivate
children_XMLElementprivate
clear_children()XMLElement
clear_content()XMLElement
ConstRefPtr classXMLElementfriend
content_XMLElementprivate
count_attributes() constXMLElement
count_children() constXMLElement
count_content() constXMLElement
get_child(int)XMLElement
get_child(const std::string &)XMLElement
get_content_line(int)XMLElement
label() constXMLElement
label_XMLElementprivate
Object()Objectinline
operator=(const XMLElement &)XMLElementprivate
recurse(RefPtr< XMLElement >, std::set< RefPtr< XMLElement > >)XMLElementprivate
reference_count() constObjectinline
reference_grab() constObjectinlineprotected
reference_release() constObjectinlineprotected
RefPtr classXMLElementfriend
refs_Objectmutableprivate
set_attributes(RefPtr< XMLAttributeList >)XMLElement
set_label(const std::string &)XMLElement
XMLElement(const std::string &)XMLElement
XMLElement(const XMLElement &)XMLElementprivate
~Object()Objectinlinevirtual
~XMLElement()XMLElementvirtual
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classXMLElement.html b/docs/html/classXMLElement.html new file mode 100644 index 00000000..a2cd4754 --- /dev/null +++ b/docs/html/classXMLElement.html @@ -0,0 +1,784 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLElement Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Private Member Functions | +Private Attributes | +Friends | +List of all members
+
XMLElement Class Reference
+
+
+ +

#include <XMLElement.h>

+
+Inheritance diagram for XMLElement:
+
+
+ + +Object + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 XMLElement (const std::string &)
 Construct a new xml element object and give it a label.
 
virtual ~XMLElement ()
 Destructor.
 
const std::string & label () const
 Get the label of this node.
 
void set_label (const std::string &)
 Assign a new label to this node.
 
int count_attributes () const
 
RefPtr< XMLAttributeList > attributes ()
 Get access to the attribute list.
 
void set_attributes (RefPtr< XMLAttributeList >)
 Assign an attribute list to this element.
 
int count_children () const
 Utility function to check how many children this element has.
 
RefPtr< XMLElement > get_child (int)
 
RefPtr< XMLElement > get_child (const std::string &)
 
void add_child (RefPtr< XMLElement >)
 
void add_child_rpt (RefPtr< XMLElement >)
 Same as add_child, but this allows for repeating children.
 
void clear_children ()
 Erase all child elements from this node.
 
int count_content () const
 
const std::string & get_content_line (int)
 
void add_content_line (const std::string &)
 Add a line of content.
 
void clear_content ()
 Clear all text content.
 
- Public Member Functions inherited from Object
 Object ()
 Construct a new reference counted object with a zero reference count.
 
virtual ~Object ()
 Destroy this object.
 
long int reference_count () const
 Returns the number of references that are held to this object.
 
+ + + + + + + +

+Private Member Functions

 XMLElement (const XMLElement &)
 
XMLElement & operator= (const XMLElement &)
 
void recurse (RefPtr< XMLElement >, std::set< RefPtr< XMLElement > >)
 
+ + + + + + + + + + + + + +

+Private Attributes

std::string label_
 The iterator type returned for list of children.
 
RefPtr< XMLAttributeList > attributes_
 The list of attributes associated with this element.
 
std::vector< RefPtr< XMLElement > > children_
 The list of children associated with this element.
 
std::vector< std::string > content_
 The list of content associated with this element.
 
+ + + + + + + +

+Friends

template<class T >
class RefPtr
 
template<class T >
class ConstRefPtr
 
+ + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from Object
long int reference_grab () const
 
long int reference_release () const
 
+

Detailed Description

+

This is the implementation of a node in an XML parse tree. Each node contains the following three containers, any (or all) of which may be empty.

+

attributes (XMLAttributeList): Contains attributes (key/value pairs). children (Vector<XMLElement>): Contains children of this node. content (Vector<std::string>): Contains content (text) data.

+

The implementation is very limited. In particular, the following advanced features are missing:

+

encoding: Support for character types other than char/std::string. comments: Allowing comment blocks to accompany each element. other xml types (control statements, etc.).

+

This implementation is heavily based on Kevin Long's XMLObject.

+

Constructor & Destructor Documentation

+ +

◆ XMLElement() [1/2]

+ +
+
+ + + + + + + +
XMLElement::XMLElement (const std::string & lbl)
+
+ +

Construct a new xml element object and give it a label.

+ +
+
+ +

◆ XMLElement() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
XMLElement::XMLElement (const XMLElement & )
+ 		+private
+
+

Blocked copy constructor.
+

Exceptions
+ + +
MyException.
+
+
+ +
+
+ +

◆ ~XMLElement()

+ +
+
+ + + + + +
+ + + + + + + +
XMLElement::~XMLElement ()
+ 		+virtual
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ add_child()

+ +
+
+ + + + + + + +
void XMLElement::add_child (RefPtr< XMLElement > kid)
+
+

Add a child to the back of the list. Ignored if the child is already in the list.

Exceptions
+ + + +
MyExceptionif adding the child would result in a cyclic relationship.
MyExceptionif the child holds a NULL pointer.
+
+
+ +
+
+ +

◆ add_child_rpt()

+ +
+
+ + + + + + + +
void XMLElement::add_child_rpt (RefPtr< XMLElement > kid)
+
+ +

Same as add_child, but this allows for repeating children.

+ +
+
+ +

◆ add_content_line()

+ +
+
+ + + + + + + +
void XMLElement::add_content_line (const std::string & text)
+
+ +

Add a line of content.

+ +
+
+ +

◆ attributes()

+ +
+
+ + + + + + + +
RefPtr< XMLAttributeList > XMLElement::attributes ()
+
+ +

Get access to the attribute list.

+ +
+
+ +

◆ clear_children()

+ +
+
+ + + + + + + +
void XMLElement::clear_children ()
+
+ +

Erase all child elements from this node.

+ +
+
+ +

◆ clear_content()

+ +
+
+ + + + + + + +
void XMLElement::clear_content ()
+
+ +

Clear all text content.

+ +
+
+ +

◆ count_attributes()

+ +
+
+ + + + + + + +
int XMLElement::count_attributes () const
+
+

Utility function to check how many attributes this element has. This amounts to the same as calling '.attributes().size()'

+ +
+
+ +

◆ count_children()

+ +
+
+ + + + + + + +
int XMLElement::count_children () const
+
+ +

Utility function to check how many children this element has.

+ +
+
+ +

◆ count_content()

+ +
+
+ + + + + + + +
int XMLElement::count_content () const
+
+

Utility function to check how many lines of text content are associated with this element.

+ +
+
+ +

◆ get_child() [1/2]

+ +
+
+ + + + + + + +
RefPtr< XMLElement > XMLElement::get_child (const std::string & lbl)
+
+

Find the first instance of a child with a given label and return a pointer to it.

Note
Since child labels do not need to be unique, there may be multiple instances matching children
+
Exceptions
+ + +
MyExceptionif the child label can not be found
+
+
+
Todo
Make this more elegant with the STL find_if function
+ +
+
+ +

◆ get_child() [2/2]

+ +
+
+ + + + + + + +
RefPtr< XMLElement > XMLElement::get_child (int index)
+
+

Get the child with the given index.

Exceptions
+ + +
MyExceptionif the index is invalid.
+
+
+ +
+
+ +

◆ get_content_line()

+ +
+
+ + + + + + + +
const std::string & XMLElement::get_content_line (int index)
+
+

Get a line of content by index.

Exceptions
+ + +
MyExceptionif the index is out of range.
+
+
+ +
+
+ +

◆ label()

+ +
+
+ + + + + + + +
const std::string & XMLElement::label () const
+
+ +

Get the label of this node.

+ +
+
+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + +
XMLElement & XMLElement::operator= (const XMLElement & )
+ 		+private
+
+

Blocked assignment operator.
+

Exceptions
+ + +
MyExcepiton.
+
+
+ +
+
+ +

◆ recurse()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void XMLElement::recurse (RefPtr< XMLElement > kid,
std::set< RefPtr< XMLElement > > seen )
+ 		+private
+
+

A private routine called recursively to ensure that we don't have a cyclic relationship.

+ +
+
+ +

◆ set_attributes()

+ +
+
+ + + + + + + +
void XMLElement::set_attributes (RefPtr< XMLAttributeList > att)
+
+ +

Assign an attribute list to this element.

+ +
+
+ +

◆ set_label()

+ +
+
+ + + + + + + +
void XMLElement::set_label (const std::string & lbl)
+
+ +

Assign a new label to this node.

+ +
+
+

Friends And Related Symbol Documentation

+ +

◆ ConstRefPtr

+ +
+
+
+template<class T >
+ + + + + +
+ + + + +
friend class ConstRefPtr
+ 		+friend
+
+ +
+
+ +

◆ RefPtr

+ +
+
+
+template<class T >
+ + + + + +
+ + + + +
friend class RefPtr
+ 		+friend
+
+ +
+
+

Member Data Documentation

+ +

◆ attributes_

+ +
+
+ + + + + +
+ + + + +
RefPtr<XMLAttributeList> XMLElement::attributes_
+ 		+private
+
+ +

The list of attributes associated with this element.

+ +
+
+ +

◆ children_

+ +
+
+ + + + + +
+ + + + +
std::vector< RefPtr<XMLElement> > XMLElement::children_
+ 		+private
+
+ +

The list of children associated with this element.

+ +
+
+ +

◆ content_

+ +
+
+ + + + + +
+ + + + +
std::vector<std::string> XMLElement::content_
+ 		+private
+
+ +

The list of content associated with this element.

+ +
+
+ +

◆ label_

+ +
+
+ + + + + +
+ + + + +
std::string XMLElement::label_
+ 		+private
+
+ +

The iterator type returned for list of children.

+

The label of this element.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classXMLElement.png b/docs/html/classXMLElement.png new file mode 100644 index 0000000000000000000000000000000000000000..6b720437131ce021590ac033616099c1892f0d83 GIT binary patch literal 451 zcmV;!0X+VRP)vTJr#LVva2S`&=-}Ys|Ns9r%~qrU000SeQchC<|NsC0|NsC0Hv*f~0003_ zNklb}T0V*s+`dV8?O-fE~*T0GBxDoH1~cWXf_%k{!i) zbm2SyMjal-tal`7N?u>$-1|tfH_m>GB+dDyGX@++`EHr-7xLDc&$uvmb=N5yad&L( zyj|baD5vz~toh82rVZVTIE!!+XKU}~Q)kKNTW34!S6n#9HRpWZJA3zhmee07YfqT! tTvq0JF4cP9CCQZKlq5TX(>dpC`2iklM3Y`E#Bcxr002ovPDHLkV1oXK){X!G literal 0 HcmV?d00001 diff --git a/docs/html/classXMLExpatParser-members.html b/docs/html/classXMLExpatParser-members.html new file mode 100644 index 00000000..5050fd0c --- /dev/null +++ b/docs/html/classXMLExpatParser-members.html @@ -0,0 +1,93 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
XMLExpatParser Member List
+
+
+ +

This is the complete list of members for XMLExpatParser, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + +
character_data_(void *, const XML_Char *, int)XMLExpatParserstatic
ConstRefPtr classXMLExpatParserfriend
do_character_data(const XML_Char *, int)XMLExpatParserprivate
do_end(const XML_Char *)XMLExpatParserprivate
do_start(const XML_Char *, const XML_Char **)XMLExpatParserprivate
end_(void *, const XML_Char *)XMLExpatParserstatic
init()XMLExpatParserprivate
leaf_XMLExpatParserprivate
Object()Objectinline
operator=(const XMLExpatParser &)XMLExpatParserprivate
parse(std::istream &)XMLExpatParservirtual
parser_XMLExpatParserprivate
path_XMLExpatParserprivate
reference_count() constObjectinline
reference_grab() constObjectinlineprotected
reference_release() constObjectinlineprotected
RefPtr classXMLExpatParserfriend
start_(void *, const XML_Char *, const XML_Char **)XMLExpatParserstatic
XMLExpatParser()XMLExpatParser
XMLExpatParser(const XMLExpatParser &)XMLExpatParserprivate
XMLParser()XMLParser
~Object()Objectinlinevirtual
~XMLExpatParser()XMLExpatParservirtual
~XMLParser()XMLParservirtual
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classXMLExpatParser.html b/docs/html/classXMLExpatParser.html new file mode 100644 index 00000000..0a0ad3ba --- /dev/null +++ b/docs/html/classXMLExpatParser.html @@ -0,0 +1,652 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLExpatParser Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Static Public Member Functions | +Private Member Functions | +Private Attributes | +Friends | +List of all members
+
XMLExpatParser Class Reference
+
+
+ +

#include <XMLExpatParser.h>

+
+Inheritance diagram for XMLExpatParser:
+
+
+ + +XMLParser +Object + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 XMLExpatParser ()
 Construct a new parser.
 
virtual ~XMLExpatParser () throw ()
 Destructor.
 
RefPtr< XMLElement > parse (std::istream &)
 Parse the given input buffer and return a parse tree.
 
- Public Member Functions inherited from XMLParser
 XMLParser ()
 Default constructor. Intended for derived classes.
 
virtual ~XMLParser ()
 Destructor.
 
- Public Member Functions inherited from Object
 Object ()
 Construct a new reference counted object with a zero reference count.
 
virtual ~Object ()
 Destroy this object.
 
long int reference_count () const
 Returns the number of references that are held to this object.
 
+ + + + + + + +

+Static Public Member Functions

static void start_ (void *, const XML_Char *, const XML_Char **)
 
static void end_ (void *, const XML_Char *)
 
static void character_data_ (void *, const XML_Char *, int)
 
+ + + + + + + + + + + + + + + + + + +

+Private Member Functions

 XMLExpatParser (const XMLExpatParser &)
 
XMLExpatParser & operator= (const XMLExpatParser &)
 Blocked assignment operator. Not for public consumption.
 
void do_start (const XML_Char *, const XML_Char **)
 The method used to parse the start tag.
 
void do_end (const XML_Char *)
 The method used to parse the end tag.
 
void do_character_data (const XML_Char *, int)
 The method used to parse character (content) data.
 
void init ()
 Initialize the state of the parser.
 
+ + + + + + + + + + +

+Private Attributes

XML_Parser parser_
 The Expat parser.
 
std::vector< RefPtr< XMLElement > > path_
 The path that we have traversed so far in building the tree.
 
RefPtr< XMLElement > leaf_
 The current leaf of the parse tree.
 
+ + + + + + + +

+Friends

template<class T >
class RefPtr
 
template<class T >
class ConstRefPtr
 
+ + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from Object
long int reference_grab () const
 
long int reference_release () const
 
+

Detailed Description

+

An XML parser that uses the Expat library to handle the gruntwork. This class requires that the Expat be installed on your system.

+

Expat is available at the Expat site

+

This class may not be fully exception safe, since there is no good way of enforcing that the Expat parser is destroyed cleanly.

+

Constructor & Destructor Documentation

+ +

◆ XMLExpatParser() [1/2]

+ +
+
+ + + + + + + +
XMLExpatParser::XMLExpatParser ()
+
+ +

Construct a new parser.

+ +
+
+ +

◆ XMLExpatParser() [2/2]

+ +
+
+ + + + + +
+ + + + + + + +
XMLExpatParser::XMLExpatParser (const XMLExpatParser & )
+ 		+private
+
+

Blocked copy constructor. It is not safe to copy this object since the Expat parser may save state which cannot be duplicated.

+ +
+
+ +

◆ ~XMLExpatParser()

+ +
+
+ + + + + +
+ + + + + + + + + + +
XMLExpatParser::~XMLExpatParser ()
throw ( )
+ 		+virtual
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ character_data_()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void XMLExpatParser::character_data_ (void * object,
const XML_Char * data,
int size )
+ 		+static
+
+

Static wrapper method used as a callback to get character data. This method is for internal use only. Calling this method directly will most likely result in a segmentation fault.

+ +
+
+ +

◆ do_character_data()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void XMLExpatParser::do_character_data (const XML_Char * data,
int size )
+ 		+private
+
+ +

The method used to parse character (content) data.

+ +
+
+ +

◆ do_end()

+ +
+
+ + + + + +
+ + + + + + + +
void XMLExpatParser::do_end (const XML_Char * )
+ 		+private
+
+ +

The method used to parse the end tag.

+ +
+
+ +

◆ do_start()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void XMLExpatParser::do_start (const XML_Char * lbl,
const XML_Char ** attr )
+ 		+private
+
+ +

The method used to parse the start tag.

+ +
+
+ +

◆ end_()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
void XMLExpatParser::end_ (void * object,
const XML_Char * label )
+ 		+static
+
+

Static wrapper method used as a callback to get the 'end' tag. This method is for internal use only. Calling this method directly will most likely result in a segmentation fault.

+ +
+
+ +

◆ init()

+ +
+
+ + + + + +
+ + + + + + + +
void XMLExpatParser::init ()
+ 		+private
+
+ +

Initialize the state of the parser.

+ +
+
+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + +
XMLExpatParser & XMLExpatParser::operator= (const XMLExpatParser & )
+ 		+private
+
+ +

Blocked assignment operator. Not for public consumption.

+ +
+
+ +

◆ parse()

+ +
+
+ + + + + +
+ + + + + + + +
RefPtr< XMLElement > XMLExpatParser::parse (std::istream & buf)
+ 		+virtual
+
+ +

Parse the given input buffer and return a parse tree.

+ +

Implements XMLParser.

+ +
+
+ +

◆ start_()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + +
void XMLExpatParser::start_ (void * object,
const XML_Char * label,
const XML_Char ** attributes )
+ 		+static
+
+

Static wrapper method used as a callback to get the 'start' tag. This method is for internal use only. Calling this method directly will most likely result in a segmentation fault.

+ +
+
+

Friends And Related Symbol Documentation

+ +

◆ ConstRefPtr

+ +
+
+
+template<class T >
+ + + + + +
+ + + + +
friend class ConstRefPtr
+ 		+friend
+
+ +
+
+ +

◆ RefPtr

+ +
+
+
+template<class T >
+ + + + + +
+ + + + +
friend class RefPtr
+ 		+friend
+
+ +
+
+

Member Data Documentation

+ +

◆ leaf_

+ +
+
+ + + + + +
+ + + + +
RefPtr<XMLElement> XMLExpatParser::leaf_
+ 		+private
+
+ +

The current leaf of the parse tree.

+ +
+
+ +

◆ parser_

+ +
+
+ + + + + +
+ + + + +
XML_Parser XMLExpatParser::parser_
+ 		+private
+
+ +

The Expat parser.

+ +
+
+ +

◆ path_

+ +
+
+ + + + + +
+ + + + +
std::vector< RefPtr<XMLElement> > XMLExpatParser::path_
+ 		+private
+
+ +

The path that we have traversed so far in building the tree.

+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classXMLExpatParser.png b/docs/html/classXMLExpatParser.png new file mode 100644 index 0000000000000000000000000000000000000000..f06c0791f95845f6b0782bea690cd3866c80aece GIT binary patch literal 799 zcmeAS@N?(olHy`uVBq!ia0vp^IY8XO!3-o#bN^)nDd_;85ZC|z{{xvX-h3_XKeXJ! zK(jz%`k5CG9y|bwo1P6@0+iz{3GxeO0P?}WoN4wI1_q{8o-U3d6^w7^zMiy3fv08m zvQwvi+ka#flKHUdao6O{rmWfB32O3+2mf+sbYIK)G1E|CrQz1|-#cF(3z{LUeQ=R< zx8TLz)D7RaDQ>;=+TzW<_(ZWAtYPnj9fdw#c$c&9b@0ph)TtFr&Z)~HKL5THc_;r* z#>@S;nWM{-)Rv!GQ@E^fX8pT4sW+~bx2}wxSN~$p&0V`Iica2WdHQ)_aoX#5k6ymM zG^2mc=11Dcr>{CVW2xJem6d;vSZddPi#-*emGchP(_$2K~xI(~eGj#_6qNKTG>f_v*q!3<)v9Yz&8I88Ap( zYhgUFL5+u@%`}n0U=1g8L!z%l!?!L&H+{uPOZwG%RNB9)CoH`8bzv>f&WTUfmr6yJ zg{RzL`xeFH`Oit&fZJfoimw}IDxT~;SDd#0f}iZS4P}Q>?d$9|74xe3n}ctt_3bP2ELyI;LHvuzwv&>caxX4fu6|cC z{Z?+w^$jcCCf&)dllCl%5O$k%_*Yg$kD(POxjy1jWYJgb==hOw$i=1YYkk74rPZzb z<+e_8art&C?0LTHlD%;gpYA)cf!D|7iObbjLT|+lif8@%vNB@HZLZA>r+t!>jcdVl=a6-)Y{M+ky`>xTimplLoZ(lF_Pjl()WFq5G}ZXo z(pfTxrQFpwy#4nz?6!qjzF*?n!?lev&wN~*)|;i<&)b}pAHDRiqv^EgWzzAim%|_5 u)jx4SJRRgn(?lhu!=Kt(1)3)RWBk+HzJJ%7x-Gz@%;4$j=d#Wzp$Py|m3_7V literal 0 HcmV?d00001 diff --git a/docs/html/classXMLParser-members.html b/docs/html/classXMLParser-members.html new file mode 100644 index 00000000..571b0f90 --- /dev/null +++ b/docs/html/classXMLParser-members.html @@ -0,0 +1,80 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
XMLParser Member List
+
+
+ +

This is the complete list of members for XMLParser, including all inherited members.

+ + + + + + + + + + + + +
ConstRefPtr classXMLParserfriend
Object()Objectinline
parse(std::istream &)=0XMLParserpure virtual
reference_count() constObjectinline
reference_grab() constObjectinlineprotected
reference_release() constObjectinlineprotected
RefPtr classXMLParserfriend
refs_Objectmutableprivate
XMLParser()XMLParser
~Object()Objectinlinevirtual
~XMLParser()XMLParservirtual
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classXMLParser.html b/docs/html/classXMLParser.html new file mode 100644 index 00000000..f4c7f21f --- /dev/null +++ b/docs/html/classXMLParser.html @@ -0,0 +1,254 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: XMLParser Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Friends | +List of all members
+
XMLParser Class Referenceabstract
+
+
+ +

#include <XMLParser.h>

+
+Inheritance diagram for XMLParser:
+
+
+ + +Object +XMLExpatParser + +
+ + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 XMLParser ()
 Default constructor. Intended for derived classes.
 
virtual ~XMLParser ()
 Destructor.
 
virtual RefPtr< XMLElement > parse (std::istream &)=0
 Parse the given input buffer and return the parse tree.
 
- Public Member Functions inherited from Object
 Object ()
 Construct a new reference counted object with a zero reference count.
 
virtual ~Object ()
 Destroy this object.
 
long int reference_count () const
 Returns the number of references that are held to this object.
 
+ + + + + + + +

+Friends

template<class T >
class RefPtr
 
template<class T >
class ConstRefPtr
 
+ + + + + + +

+Additional Inherited Members

- Protected Member Functions inherited from Object
long int reference_grab () const
 
long int reference_release () const
 
+

Detailed Description

+

A pure abstract base class for parsers that read data from an XML file and return the top node of a parse tree. The parse tree node is a RefPtr< XMLElement >.

+

Constructor & Destructor Documentation

+ +

◆ XMLParser()

+ +
+
+ + + + + + + +
XMLParser::XMLParser ()
+
+ +

Default constructor. Intended for derived classes.

+ +
+
+ +

◆ ~XMLParser()

+ +
+
+ + + + + +
+ + + + + + + +
XMLParser::~XMLParser ()
+ 		+virtual
+
+ +

Destructor.

+ +
+
+

Member Function Documentation

+ +

◆ parse()

+ +
+
+ + + + + +
+ + + + + + + +
virtual RefPtr< XMLElement > XMLParser::parse (std::istream & )
+ 		+pure virtual
+
+ +

Parse the given input buffer and return the parse tree.

+ +

Implemented in XMLExpatParser.

+ +
+
+

Friends And Related Symbol Documentation

+ +

◆ ConstRefPtr

+ +
+
+
+template<class T >
+ + + + + +
+ + + + +
friend class ConstRefPtr
+ 		+friend
+
+ +
+
+ +

◆ RefPtr

+ +
+
+
+template<class T >
+ + + + + +
+ + + + +
friend class RefPtr
+ 		+friend
+
+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classXMLParser.png b/docs/html/classXMLParser.png new file mode 100644 index 0000000000000000000000000000000000000000..86ab9ff1ccc9ad30dbfbc5c35c789a46e4f159ab GIT binary patch literal 806 zcmeAS@N?(olHy`uVBq!ia0vp^IY8XO!3-o#bN^)nDd_;85ZC|z{{xvX-h3_XKeXJ! zK(jz%`k5CG9y|bwo1P6@0+iz{3GxeO0P?}WoN4wI1_q{$o-U3d6^w7^=1y)_;Axp| z@c7OD|3{B|2RQ7F+IYuT{fg+pDeV)M{N;M`Z0pMp#>ou}Ju~LNXD*h~KCHHp>5PAJ zXZ!qPK{v9a#iL$*zVY^6e4^S7*049sjg1u<Dce$(z4ZU`PXjlmD(4XetyH7|8Khg zpO<^dtka@vvR=2}&V;Q&I*K7-TH2v$sYx(aohln*}|$?Rs$2 zYn83`m8-$F*K^xctoQca)Lip<@!6P3cV2SkG|xM + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
base Member List
+
+
+ +

This is the complete list of members for base, including all inherited members.

+ + +
fun(double *x, int n)baseinlinevirtual
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classbase.html b/docs/html/classbase.html new file mode 100644 index 00000000..c1094d9c --- /dev/null +++ b/docs/html/classbase.html @@ -0,0 +1,110 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: base Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +List of all members
+
base Class Reference
+
+
+ +

#include <mcmc.h>

+ + + + +

+Public Member Functions

virtual double fun (double *x, int n)
 
+

Member Function Documentation

+ +

◆ fun()

+ +
+
+ + + + + +
+ + + + + + + + + + + +
virtual double base::fun (double * x,
int n )
+ 		+inlinevirtual
+
+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classdataPosteriorInformation-members.html b/docs/html/classdataPosteriorInformation-members.html new file mode 100644 index 00000000..6b196a9b --- /dev/null +++ b/docs/html/classdataPosteriorInformation-members.html @@ -0,0 +1,95 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
dataPosteriorInformation Member List
+
+
+ +

This is the complete list of members for dataPosteriorInformation, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + +
burninParamWriteFiledataPosteriorInformation
dataChain_countdataPosteriorInformation
dataChainBurnedIndataPosteriorInformation
dataDimdataPosteriorInformation
errordataPosteriorInformation
errorOptdataPosteriorInformation
hyperparametersdataPosteriorInformation
mainParamWriteFiledataPosteriorInformation
nominalErrorParametersdataPosteriorInformation
nominalParametersdataPosteriorInformation
numConstraintsdataPosteriorInformation
numSurrdataPosteriorInformation
optErrorParametersdataPosteriorInformation
paramDimdataPosteriorInformation
parameterBurnInNumSamplesdataPosteriorInformation
parameterChainNumSamplesdataPosteriorInformation
paramWriteFlagdataPosteriorInformation
seeddataPosteriorInformation
statDeltasdataPosteriorInformation
statLabelsdataPosteriorInformation
statValuesdataPosteriorInformation
surrModelObjdataPosteriorInformation
surrModelsdataPosteriorInformation
surrParametersdataPosteriorInformation
trueDataxdataPosteriorInformation
trueDataydataPosteriorInformation
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classdataPosteriorInformation.html b/docs/html/classdataPosteriorInformation.html new file mode 100644 index 00000000..4bf4979d --- /dev/null +++ b/docs/html/classdataPosteriorInformation.html @@ -0,0 +1,495 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: dataPosteriorInformation Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Attributes | +List of all members
+
dataPosteriorInformation Class Reference
+
+
+ +

#include <dfi.h>

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Attributes

int seed
 
int dataDim
 
int paramDim
 
int numConstraints
 
bool errorOpt
 
bool dataChainBurnedIn
 
int dataChain_count
 
Array1D< double > optErrorParameters
 
Array1D< double > trueDatax
 
Array1D< double > trueDatay
 
Array1D< double > error
 
Array1D< double > nominalParameters
 
Array1D< double > nominalErrorParameters
 
Array1D< double > hyperparameters
 
Array1D< double > surrParameters
 
vector< string > statLabels
 
vector< double > statValues
 
vector< double > statDeltas
 
int paramWriteFlag
 
string burninParamWriteFile
 
string mainParamWriteFile
 
int parameterBurnInNumSamples
 
int parameterChainNumSamples
 
DFIsurr surrModelObj
 
int numSurr
 
vector< DFIsurr > surrModels
 
+

Member Data Documentation

+ +

◆ burninParamWriteFile

+ +
+
+ + + + +
string dataPosteriorInformation::burninParamWriteFile
+
+ +
+
+ +

◆ dataChain_count

+ +
+
+ + + + +
int dataPosteriorInformation::dataChain_count
+
+ +
+
+ +

◆ dataChainBurnedIn

+ +
+
+ + + + +
bool dataPosteriorInformation::dataChainBurnedIn
+
+ +
+
+ +

◆ dataDim

+ +
+
+ + + + +
int dataPosteriorInformation::dataDim
+
+ +
+
+ +

◆ error

+ +
+
+ + + + +
Array1D<double> dataPosteriorInformation::error
+
+ +
+
+ +

◆ errorOpt

+ +
+
+ + + + +
bool dataPosteriorInformation::errorOpt
+
+ +
+
+ +

◆ hyperparameters

+ +
+
+ + + + +
Array1D<double> dataPosteriorInformation::hyperparameters
+
+ +
+
+ +

◆ mainParamWriteFile

+ +
+
+ + + + +
string dataPosteriorInformation::mainParamWriteFile
+
+ +
+
+ +

◆ nominalErrorParameters

+ +
+
+ + + + +
Array1D<double> dataPosteriorInformation::nominalErrorParameters
+
+ +
+
+ +

◆ nominalParameters

+ +
+
+ + + + +
Array1D<double> dataPosteriorInformation::nominalParameters
+
+ +
+
+ +

◆ numConstraints

+ +
+
+ + + + +
int dataPosteriorInformation::numConstraints
+
+ +
+
+ +

◆ numSurr

+ +
+
+ + + + +
int dataPosteriorInformation::numSurr
+
+ +
+
+ +

◆ optErrorParameters

+ +
+
+ + + + +
Array1D<double> dataPosteriorInformation::optErrorParameters
+
+ +
+
+ +

◆ paramDim

+ +
+
+ + + + +
int dataPosteriorInformation::paramDim
+
+ +
+
+ +

◆ parameterBurnInNumSamples

+ +
+
+ + + + +
int dataPosteriorInformation::parameterBurnInNumSamples
+
+ +
+
+ +

◆ parameterChainNumSamples

+ +
+
+ + + + +
int dataPosteriorInformation::parameterChainNumSamples
+
+ +
+
+ +

◆ paramWriteFlag

+ +
+
+ + + + +
int dataPosteriorInformation::paramWriteFlag
+
+ +
+
+ +

◆ seed

+ +
+
+ + + + +
int dataPosteriorInformation::seed
+
+ +
+
+ +

◆ statDeltas

+ +
+
+ + + + +
vector<double> dataPosteriorInformation::statDeltas
+
+ +
+
+ +

◆ statLabels

+ +
+
+ + + + +
vector<string> dataPosteriorInformation::statLabels
+
+ +
+
+ +

◆ statValues

+ +
+
+ + + + +
vector<double> dataPosteriorInformation::statValues
+
+ +
+
+ +

◆ surrModelObj

+ +
+
+ + + + +
DFIsurr dataPosteriorInformation::surrModelObj
+
+ +
+
+ +

◆ surrModels

+ +
+
+ + + + +
vector<DFIsurr> dataPosteriorInformation::surrModels
+
+ +
+
+ +

◆ surrParameters

+ +
+
+ + + + +
Array1D<double> dataPosteriorInformation::surrParameters
+
+ +
+
+ +

◆ trueDatax

+ +
+
+ + + + +
Array1D<double> dataPosteriorInformation::trueDatax
+
+ +
+
+ +

◆ trueDatay

+ +
+
+ + + + +
Array1D<double> dataPosteriorInformation::trueDatay
+
+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classes.html b/docs/html/classes.html new file mode 100644 index 00000000..917520b3 --- /dev/null +++ b/docs/html/classes.html @@ -0,0 +1,108 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Index + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Class Index
+
+
+
A | B | C | D | G | K | L | M | O | P | Q | R | X
+
+
+
A
+
Array1D
Array1D< double >
Array1D< int >
Array2D
Array3D
+
+
B
+
base
+
+
C
+
MCMC::chainstate
+
+
D
+
dataPosteriorInformation
DFI
DFIsurr
+
+
G
+
Gproc
+
+
K
+
KLDecompUni
+
+
L
+
Lik_ABC
Lik_ABCm
Lik_Classical
Lik_Eov
Lik_Full
Lik_GausMarg
Lik_GausMargD
Lik_Koh
Lik_Marg
Lik_MVN
LogPosteriorBase
Lreg
+
+
M
+
main
MCMC
Mrv
MyException
+
+
O
+
Object
MCMC::outputInfo
+
+
P
+
parameterPosteriorInformation
PCBasis
PCreg
PCSet
PLreg
Post
+
+
Q
+
Quad
Quad::QuadRule
+
+
R
+
RBFreg
RefPtr
+
+
X
+
XMLAttributeList
XMLElement
XMLExpatParser
XMLParser
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classmain-members.html b/docs/html/classmain-members.html new file mode 100644 index 00000000..045d0635 --- /dev/null +++ b/docs/html/classmain-members.html @@ -0,0 +1,71 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
main Member List
+
+
+ +

This is the complete list of members for main, including all inherited members.

+ + + +
b_main
main(base &b)maininline
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classmain.html b/docs/html/classmain.html new file mode 100644 index 00000000..4c5246ca --- /dev/null +++ b/docs/html/classmain.html @@ -0,0 +1,127 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: main Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Member Functions | +Public Attributes | +List of all members
+
main Class Reference
+
+
+ +

#include <mcmc.h>

+ + + + +

+Public Member Functions

 main (base &b)
 
+ + + +

+Public Attributes

base * b_
 
+

Constructor & Destructor Documentation

+ +

◆ main()

+ +
+
+ + + + + +
+ + + + + + + +
main::main (base & b)
+ 		+inline
+
+ +
+
+

Member Data Documentation

+ +

◆ b_

+ +
+
+ + + + +
base* main::b_
+
+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classparameterPosteriorInformation-members.html b/docs/html/classparameterPosteriorInformation-members.html new file mode 100644 index 00000000..c3920577 --- /dev/null +++ b/docs/html/classparameterPosteriorInformation-members.html @@ -0,0 +1,76 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
parameterPosteriorInformation Member List
+
+
+ +

This is the complete list of members for parameterPosteriorInformation, including all inherited members.

+ + + + + + + + +
dataChainStateparameterPosteriorInformation
errorOptparameterPosteriorInformation
hyperparametersparameterPosteriorInformation
optErrorParamsparameterPosteriorInformation
surrModelObj_parameterPosteriorInformation
surrModels_parameterPosteriorInformation
trueDataxparameterPosteriorInformation
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/classparameterPosteriorInformation.html b/docs/html/classparameterPosteriorInformation.html new file mode 100644 index 00000000..02abaadf --- /dev/null +++ b/docs/html/classparameterPosteriorInformation.html @@ -0,0 +1,191 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: parameterPosteriorInformation Class Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + +
+
+
+
+Public Attributes | +List of all members
+
parameterPosteriorInformation Class Reference
+
+
+ +

#include <dfi.h>

+ + + + + + + + + + + + + + + + +

+Public Attributes

Array1D< double > dataChainState
 
Array1D< double > optErrorParams
 
Array1D< double > hyperparameters
 
bool errorOpt
 
Array1D< double > trueDatax
 
DFIsurr * surrModelObj_
 
vector< DFIsurr > * surrModels_
 
+

Member Data Documentation

+ +

◆ dataChainState

+ +
+
+ + + + +
Array1D<double> parameterPosteriorInformation::dataChainState
+
+ +
+
+ +

◆ errorOpt

+ +
+
+ + + + +
bool parameterPosteriorInformation::errorOpt
+
+ +
+
+ +

◆ hyperparameters

+ +
+
+ + + + +
Array1D<double> parameterPosteriorInformation::hyperparameters
+
+ +
+
+ +

◆ optErrorParams

+ +
+
+ + + + +
Array1D<double> parameterPosteriorInformation::optErrorParams
+
+ +
+
+ +

◆ surrModelObj_

+ +
+
+ + + + +
DFIsurr* parameterPosteriorInformation::surrModelObj_
+
+ +
+
+ +

◆ surrModels_

+ +
+
+ + + + +
vector<DFIsurr>* parameterPosteriorInformation::surrModels_
+
+ +
+
+ +

◆ trueDatax

+ +
+
+ + + + +
Array1D<double> parameterPosteriorInformation::trueDatax
+
+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/clipboard.js b/docs/html/clipboard.js new file mode 100644 index 00000000..42c1fb0e --- /dev/null +++ b/docs/html/clipboard.js @@ -0,0 +1,61 @@ +/** + +The code below is based on the Doxygen Awesome project, see +https://github.com/jothepro/doxygen-awesome-css + +MIT License + +Copyright (c) 2021 - 2022 jothepro + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in all +copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE +SOFTWARE. + +*/ + +let clipboard_title = "Copy to clipboard" +let clipboard_icon = `` +let clipboard_successIcon = `` +let clipboard_successDuration = 1000 + +$(function() { + if(navigator.clipboard) { + const fragments = document.getElementsByClassName("fragment") + for(const fragment of fragments) { + const clipboard_div = document.createElement("div") + clipboard_div.classList.add("clipboard") + clipboard_div.innerHTML = clipboard_icon + clipboard_div.title = clipboard_title + $(clipboard_div).click(function() { + const content = this.parentNode.cloneNode(true) + // filter out line number and folded fragments from file listings + content.querySelectorAll(".lineno, .ttc, .foldclosed").forEach((node) => { node.remove() }) + let text = content.textContent + // remove trailing newlines and trailing spaces from empty lines + text = text.replace(/^\s*\n/gm,'\n').replace(/\n*$/,'') + navigator.clipboard.writeText(text); + this.classList.add("success") + this.innerHTML = clipboard_successIcon + window.setTimeout(() => { // switch back to normal icon after timeout + this.classList.remove("success") + this.innerHTML = clipboard_icon + }, clipboard_successDuration); + }) + fragment.insertBefore(clipboard_div, fragment.firstChild) + } + } +}) diff --git a/docs/html/closed.png b/docs/html/closed.png new file mode 100644 index 0000000000000000000000000000000000000000..98cc2c909da37a6df914fbf67780eebd99c597f5 GIT binary patch literal 132 zcmeAS@N?(olHy`uVBq!ia0vp^oFL4>1|%O$WD@{V-kvUwAr*{o@8{^CZMh(5KoB^r_<4^zF@3)Cp&&t3hdujKf f*?bjBoY!V+E))@{xMcbjXe@)LtDnm{r-UW|*e5JT literal 0 HcmV?d00001 diff --git a/docs/html/combin_8cpp.html b/docs/html/combin_8cpp.html new file mode 100644 index 00000000..b03a9255 --- /dev/null +++ b/docs/html/combin_8cpp.html @@ -0,0 +1,535 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: combin.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Macros | +Functions
+
combin.cpp File Reference
+
+
+ +

Tools to evaluate combinatorial quantities. +More...

+
#include "Array1D.h"
+#include "Array2D.h"
+#include "gen_defs.h"
+#include "probability.h"
+#include "combin.h"
+#include <math.h>
+#include <float.h>
+#include "error_handlers.h"
+
+ + + + + +

+Macros

#define STOP   1.0e-8
 
#define TINY   1.0e-30
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

int choose (int n, int k)
 Calculates binomial coefficient C(n,k): n-choose-k.
 
int factorial (int number)
 Calculates the factorial of a number.
 
double logfactorial (int number)
 Calculates the logfactorial of a number.
 
void chooseComb (int n, int k, Array2D< int > &fullInd)
 Computes all possible k-combinations of the first n non-negative integers and returns them in fullInd.
 
void get_perm (Array1D< int > &perm, int seed)
 Computes a random permutation of the first n non-negative integers and returns is in perm.
 
void get_perm (int nn, int *perm, int seed)
 Computes a random permutation of the first n non-negative integers and returns is in perm
+
 
double gammai (const double p, const double x)
 Compute the incomplete Gamma function with parameter a at point x.
 
double beta (const double z, const double w)
 Compute the Beta function at the point pair (z,w)
 
double betai (double a, double b, double x)
 Compute the incomplete Beta function with parameters a and b at point x.
 
double digama (double x)
 Computes the digamma, or psi, function, i.e. derivative of the logarithm of gamma function.
 
void clust (Array2D< double > &data_in, Array1D< double > &w, int ncl, Array1D< int > &numData, int *pClusterIndex)
 K-center clustering of data.
 
double clust_best (Array2D< double > &data_in, Array1D< double > &w, int ncl, Array1D< int > &bestnumData, int *bestClusterIndex, int ntry)
 Multiple trials of K-center clustering and picking the best one according to explained variance criterion.
 
int findNumCl (Array2D< double > &data_in, Array1D< double > &w, int ntry)
 Find the best number of clusters in a dataset according to one of three (hardcoded) criteria.
 
+

Detailed Description

+

Tools to evaluate combinatorial quantities.

+

Macro Definition Documentation

+ +

◆ STOP

+ +
+
+ + + + +
#define STOP   1.0e-8
+
+ +
+
+ +

◆ TINY

+ +
+
+ + + + +
#define TINY   1.0e-30
+
+ +
+
+

Function Documentation

+ +

◆ beta()

+ +
+
+ + + + + + + + + + + +
double beta (const double z,
const double w )
+
+ +

Compute the Beta function at the point pair (z,w)

+ +
+
+ +

◆ betai()

+ +
+
+ + + + + + + + + + + + + + + + +
double betai (const double p,
const double q,
const double x )
+
+ +

Compute the incomplete Beta function with parameters a and b at point x.

+
Note
This is a slightly modified version of a code distributed by John Burkardt
+
+see http://people.sc.fsu.edu/~jburkardt/cpp_src/asa063/asa063.html
+
+see comments under the function file
+
+ +
+
+ +

◆ choose()

+ +
+
+ + + + + + + + + + + +
int choose (int n,
int k )
+
+ +

Calculates binomial coefficient C(n,k): n-choose-k.

+ +
+
+ +

◆ chooseComb()

+ +
+
+ + + + + + + + + + + + + + + + +
void chooseComb (int n,
int k,
Array2D< int > & fullInd )
+
+ +

Computes all possible k-combinations of the first n non-negative integers and returns them in fullInd.

+ +
+
+ +

◆ clust()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void clust (Array2D< double > & data_in,
Array1D< double > & w,
int ncl,
Array1D< int > & numData,
int * pClusterIndex )
+
+ +

K-center clustering of data.

+
Parameters
+ + + + + + +
[in]data_in: Nxd matrix of data
[in]w: Array of size d; dimension-wise scaling weights
[in]ncl: Number of clusters
[out]numData: Array of size ncl; stores the number of elements for each cluster
[out]pClusterIndex: Array of size N indicating the cluster index for each data point
+
+
+ +
+
+ +

◆ clust_best()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double clust_best (Array2D< double > & data_in,
Array1D< double > & w,
int ncl,
Array1D< int > & bestnumData,
int * bestClusterIndex,
int ntry )
+
+ +

Multiple trials of K-center clustering and picking the best one according to explained variance criterion.

+ +
+
+ +

◆ digama()

+ +
+
+ + + + + + + +
double digama (double x)
+
+ +

Computes the digamma, or psi, function, i.e. derivative of the logarithm of gamma function.

+
Note
This is a slightly modified version of a code distributed by John Burkardt
+
+see http://people.sc.fsu.edu/~jburkardt/cpp_src/asa103/asa103.cpp
+ +
+
+ +

◆ factorial()

+ +
+
+ + + + + + + +
int factorial (int number)
+
+ +

Calculates the factorial of a number.

+ +
+
+ +

◆ findNumCl()

+ +
+
+ + + + + + + + + + + + + + + + +
int findNumCl (Array2D< double > & data_in,
Array1D< double > & w,
int ntry )
+
+ +

Find the best number of clusters in a dataset according to one of three (hardcoded) criteria.

+ +
+
+ +

◆ gammai()

+ +
+
+ + + + + + + + + + + +
double gammai (const double a,
const double x )
+
+ +

Compute the incomplete Gamma function with parameter a at point x.

+
Note
This is a slightly modified version of a code distributed by John Burkardt
+
+see http://people.sc.fsu.edu/~jburkardt/cpp_src/asa147/asa147.html
+
+see comments under the function definition
+ +
+
+ +

◆ get_perm() [1/2]

+ +
+
+ + + + + + + + + + + +
void get_perm (Array1D< int > & perm,
int seed )
+
+ +

Computes a random permutation of the first n non-negative integers and returns is in perm.

+
Note
n is the size of the array argument perm
+ +
+
+ +

◆ get_perm() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void get_perm (int nn,
int * perm,
int seed )
+
+ +

Computes a random permutation of the first n non-negative integers and returns is in perm
+

+ +
+
+ +

◆ logfactorial()

+ +
+
+ + + + + + + +
double logfactorial (int number)
+
+ +

Calculates the logfactorial of a number.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/combin_8h.html b/docs/html/combin_8h.html new file mode 100644 index 00000000..76f126e5 --- /dev/null +++ b/docs/html/combin_8h.html @@ -0,0 +1,494 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: combin.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
combin.h File Reference
+
+
+ +

Header for combinatorial tools. +More...

+
#include "Array2D.h"
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

int choose (int n, int k)
 Calculates binomial coefficient C(n,k): n-choose-k.
 
int factorial (int number)
 Calculates the factorial of a number.
 
double logfactorial (int number)
 Calculates the logfactorial of a number.
 
void chooseComb (int n, int k, Array2D< int > &fullInd)
 Computes all possible k-combinations of the first n non-negative integers and returns them in fullInd.
 
void get_perm (int n, int *perm, int seed)
 Computes a random permutation of the first n non-negative integers and returns is in perm
+
 
void get_perm (Array1D< int > &perm, int seed)
 Computes a random permutation of the first n non-negative integers and returns is in perm.
 
double gammai (const double a, const double x)
 Compute the incomplete Gamma function with parameter a at point x.
 
double beta (const double z, const double w)
 Compute the Beta function at the point pair (z,w)
 
double betai (const double p, const double q, const double x)
 Compute the incomplete Beta function with parameters a and b at point x.
 
double digama (double x)
 Computes the digamma, or psi, function, i.e. derivative of the logarithm of gamma function.
 
void clust (Array2D< double > &data_in, Array1D< double > &w, int ncl, Array1D< int > &numData, int *pClusterIndex)
 K-center clustering of data.
 
double clust_best (Array2D< double > &data_in, Array1D< double > &w, int ncl, Array1D< int > &bestnumData, int *bestClusterIndex, int ntry)
 Multiple trials of K-center clustering and picking the best one according to explained variance criterion.
 
int findNumCl (Array2D< double > &data_in, Array1D< double > &w, int ntry)
 Find the best number of clusters in a dataset according to one of three (hardcoded) criteria.
 
+

Detailed Description

+

Header for combinatorial tools.

+
Note
Some functions are likely not optimal and could have been computed more efficiently.
+

Function Documentation

+ +

◆ beta()

+ +
+
+ + + + + + + + + + + +
double beta (const double z,
const double w )
+
+ +

Compute the Beta function at the point pair (z,w)

+ +
+
+ +

◆ betai()

+ +
+
+ + + + + + + + + + + + + + + + +
double betai (const double p,
const double q,
const double x )
+
+ +

Compute the incomplete Beta function with parameters a and b at point x.

+
Note
This is a slightly modified version of a code distributed by John Burkardt
+
+see http://people.sc.fsu.edu/~jburkardt/cpp_src/asa063/asa063.html
+
+see comments under the function file
+
+ +
+
+ +

◆ choose()

+ +
+
+ + + + + + + + + + + +
int choose (int n,
int k )
+
+ +

Calculates binomial coefficient C(n,k): n-choose-k.

+ +
+
+ +

◆ chooseComb()

+ +
+
+ + + + + + + + + + + + + + + + +
void chooseComb (int n,
int k,
Array2D< int > & fullInd )
+
+ +

Computes all possible k-combinations of the first n non-negative integers and returns them in fullInd.

+ +
+
+ +

◆ clust()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void clust (Array2D< double > & data_in,
Array1D< double > & w,
int ncl,
Array1D< int > & numData,
int * pClusterIndex )
+
+ +

K-center clustering of data.

+
Parameters
+ + + + + + +
[in]data_in: Nxd matrix of data
[in]w: Array of size d; dimension-wise scaling weights
[in]ncl: Number of clusters
[out]numData: Array of size ncl; stores the number of elements for each cluster
[out]pClusterIndex: Array of size N indicating the cluster index for each data point
+
+
+ +
+
+ +

◆ clust_best()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double clust_best (Array2D< double > & data_in,
Array1D< double > & w,
int ncl,
Array1D< int > & bestnumData,
int * bestClusterIndex,
int ntry )
+
+ +

Multiple trials of K-center clustering and picking the best one according to explained variance criterion.

+ +
+
+ +

◆ digama()

+ +
+
+ + + + + + + +
double digama (double x)
+
+ +

Computes the digamma, or psi, function, i.e. derivative of the logarithm of gamma function.

+
Note
This is a slightly modified version of a code distributed by John Burkardt
+
+see http://people.sc.fsu.edu/~jburkardt/cpp_src/asa103/asa103.cpp
+ +
+
+ +

◆ factorial()

+ +
+
+ + + + + + + +
int factorial (int number)
+
+ +

Calculates the factorial of a number.

+ +
+
+ +

◆ findNumCl()

+ +
+
+ + + + + + + + + + + + + + + + +
int findNumCl (Array2D< double > & data_in,
Array1D< double > & w,
int ntry )
+
+ +

Find the best number of clusters in a dataset according to one of three (hardcoded) criteria.

+ +
+
+ +

◆ gammai()

+ +
+
+ + + + + + + + + + + +
double gammai (const double a,
const double x )
+
+ +

Compute the incomplete Gamma function with parameter a at point x.

+
Note
This is a slightly modified version of a code distributed by John Burkardt
+
+see http://people.sc.fsu.edu/~jburkardt/cpp_src/asa147/asa147.html
+
+see comments under the function definition
+ +
+
+ +

◆ get_perm() [1/2]

+ +
+
+ + + + + + + + + + + +
void get_perm (Array1D< int > & perm,
int seed )
+
+ +

Computes a random permutation of the first n non-negative integers and returns is in perm.

+
Note
n is the size of the array argument perm
+ +
+
+ +

◆ get_perm() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + +
void get_perm (int n,
int * perm,
int seed )
+
+ +

Computes a random permutation of the first n non-negative integers and returns is in perm
+

+ +
+
+ +

◆ logfactorial()

+ +
+
+ + + + + + + +
double logfactorial (int number)
+
+ +

Calculates the logfactorial of a number.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/combin_8h_source.html b/docs/html/combin_8h_source.html new file mode 100644 index 00000000..ff74c34b --- /dev/null +++ b/docs/html/combin_8h_source.html @@ -0,0 +1,148 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: combin.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
combin.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
31
+
32#ifndef COMBIN_H
+
33#define COMBIN_H
+
34
+
35#include "Array2D.h"
+
36
+
37
+
38
+
40int choose(int n,int k);
+
41
+
43int factorial(int number);
+
44
+
46double logfactorial(int number);
+
47
+
50void chooseComb(int n, int k,Array2D<int>& fullInd);
+
51
+
52
+
55void get_perm(int n, int* perm,int seed);
+
56
+
60void get_perm(Array1D<int>& perm, int seed);
+
61
+
62
+
67double gammai(const double a, const double x);
+
68
+
70double beta(const double z, const double w);
+
71
+
76double betai(const double p, const double q, const double x);
+
77
+
81double digama ( double x );
+
82
+
89void clust(Array2D<double>& data_in, Array1D<double>& w,int ncl, Array1D<int>& numData,int *pClusterIndex);
+
90
+
92double clust_best(Array2D<double>& data_in, Array1D<double>& w,int ncl, Array1D<int>& bestnumData,int *bestClusterIndex,int ntry);
+
94int findNumCl(Array2D<double>& data_in,Array1D<double>& w,int ntry);
+
95//---------------------------------------------------------------------------------------
+
96#endif // COMBIN_H
+
Array2D.h
2D Array class for any type T
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
clust
void clust(Array2D< double > &data_in, Array1D< double > &w, int ncl, Array1D< int > &numData, int *pClusterIndex)
K-center clustering of data.
Definition combin.cpp:383
+
findNumCl
int findNumCl(Array2D< double > &data_in, Array1D< double > &w, int ntry)
Find the best number of clusters in a dataset according to one of three (hardcoded) criteria.
Definition combin.cpp:468
+
clust_best
double clust_best(Array2D< double > &data_in, Array1D< double > &w, int ncl, Array1D< int > &bestnumData, int *bestClusterIndex, int ntry)
Multiple trials of K-center clustering and picking the best one according to explained variance crite...
Definition combin.cpp:412
+
chooseComb
void chooseComb(int n, int k, Array2D< int > &fullInd)
Computes all possible k-combinations of the first n non-negative integers and returns them in fullInd...
Definition combin.cpp:80
+
factorial
int factorial(int number)
Calculates the factorial of a number.
Definition combin.cpp:59
+
gammai
double gammai(const double a, const double x)
Compute the incomplete Gamma function with parameter a at point x.
Definition combin.cpp:149
+
beta
double beta(const double z, const double w)
Compute the Beta function at the point pair (z,w)
Definition combin.cpp:218
+
logfactorial
double logfactorial(int number)
Calculates the logfactorial of a number.
Definition combin.cpp:69
+
digama
double digama(double x)
Computes the digamma, or psi, function, i.e. derivative of the logarithm of gamma function.
Definition combin.cpp:330
+
choose
int choose(int n, int k)
Calculates binomial coefficient C(n,k): n-choose-k.
Definition combin.cpp:41
+
betai
double betai(const double p, const double q, const double x)
Compute the incomplete Beta function with parameters a and b at point x.
Definition combin.cpp:256
+
get_perm
void get_perm(int n, int *perm, int seed)
Computes a random permutation of the first n non-negative integers and returns is in perm
Definition combin.cpp:123
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dfi_8cpp.html b/docs/html/dfi_8cpp.html new file mode 100644 index 00000000..6054d48c --- /dev/null +++ b/docs/html/dfi_8cpp.html @@ -0,0 +1,232 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: dfi.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
dfi.cpp File Reference
+
+
+
#include "dfi.h"
+#include "userFunctions.h"
+
+ + + + + + + + + + + + + +

+Functions

double dataInferenceLogPosterior (Array1D< double > &m, void *info)
 
void parameterInference (dataPosteriorInformation *dataPostInfo, Array1D< double > &m, Array1D< MCMC::chainstate > &parameterChainEntries)
 
double parameterInferenceLogPosterior (Array1D< double > &parameters, void *info)
 
double computeParamLogPosterior (parameterPosteriorInformation *paramPostInfo, Array1D< double > parameters)
 
double computeParamLogLikelihood (parameterPosteriorInformation *paramPostInfo, Array1D< double > modelDataOut, Array1D< double > parameters, Array1D< double > hyperparameters)
 
void computeStatistics (Array1D< double > &parameterStatistics, Array1D< MCMC::chainstate > &parameterChain)
 
+

Function Documentation

+ +

◆ computeParamLogLikelihood()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
double computeParamLogLikelihood (parameterPosteriorInformation * paramPostInfo,
Array1D< double > modelDataOut,
Array1D< double > parameters,
Array1D< double > hyperparameters )
+
+ +
+
+ +

◆ computeParamLogPosterior()

+ +
+
+ + + + + + + + + + + +
double computeParamLogPosterior (parameterPosteriorInformation * paramPostInfo,
Array1D< double > parameters )
+
+ +
+
+ +

◆ computeStatistics()

+ +
+
+ + + + + + + + + + + +
void computeStatistics (Array1D< double > & parameterStatistics,
Array1D< MCMC::chainstate > & parameterChain )
+
+ +
+
+ +

◆ dataInferenceLogPosterior()

+ +
+
+ + + + + + + + + + + +
double dataInferenceLogPosterior (Array1D< double > & m,
void * info )
+
+ +
+
+ +

◆ parameterInference()

+ +
+
+ + + + + + + + + + + + + + + + +
void parameterInference (dataPosteriorInformation * dataPostInfo,
Array1D< double > & m,
Array1D< MCMC::chainstate > & parameterChainEntries )
+
+ +
+
+ +

◆ parameterInferenceLogPosterior()

+ +
+
+ + + + + + + + + + + +
double parameterInferenceLogPosterior (Array1D< double > & parameters,
void * info )
+
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dfi_8h.html b/docs/html/dfi_8h.html new file mode 100644 index 00000000..7d565a6a --- /dev/null +++ b/docs/html/dfi_8h.html @@ -0,0 +1,453 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: dfi.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes | +Macros | +Functions
+
dfi.h File Reference
+
+
+
#include "Array1D.h"
+#include "Array2D.h"
+#include "Array3D.h"
+#include "mcmc.h"
+#include "amcmc.h"
+#include "quad.h"
+#include "math.h"
+#include "arrayio.h"
+#include "dsfmt_add.h"
+#include <sys/time.h>
+#include "arraytools.h"
+#include <string>
+#include <iostream>
+#include <iomanip>
+#include "sampling.hpp"
+#include "tools.h"
+#include "PCSet.h"
+#include <stdlib.h>
+#include <sstream>
+
+

Go to the source code of this file.

+ + + + + + + + + + +

+Classes

class  DFIsurr
 
class  dataPosteriorInformation
 
class  parameterPosteriorInformation
 
class  DFI
 
+ + + +

+Macros

#define __wsu
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

void userRunModel (Array1D< double > &modelDataY, Array1D< double > &modelDataX, Array1D< double > &parameters, Array1D< double > &hyperparameters)
 
double userComputeParamLogPosterior (parameterPosteriorInformation *paramPostInfo, Array1D< double > parameters)
 
double userComputeParamLogLikelihood (parameterPosteriorInformation *paramPostInfo, Array1D< double > modelDataOut, Array1D< double > parameters, Array1D< double > hyperparameters)
 
void userComputeStatistics (Array1D< double > &parameterStatistics, Array1D< MCMC::chainstate > &parameterChain)
 
void userDefineData (dataPosteriorInformation &dataPostInfo)
 
void userDefineConstraints (dataPosteriorInformation &dataPostInfo)
 
void userSpecifyNominalParams (dataPosteriorInformation &dataPostInfo)
 
double dataInferenceLogPosterior (Array1D< double > &m, void *info)
 
double parameterInferenceLogPosterior (Array1D< double > &beta, void *info)
 
void parameterInference (dataPosteriorInformation *dataPostInfo, Array1D< double > &m, Array1D< MCMC::chainstate > &parameterChainEntries)
 
double computeParamLogPosterior (parameterPosteriorInformation *paramPostInfo, Array1D< double > parameters)
 
double computeParamLogLikelihood (parameterPosteriorInformation *paramPostInfo, Array1D< double > modelDataOut, Array1D< double > parameters, Array1D< double > hyperparameters)
 
void computeStatistics (Array1D< double > &parameterStatistics, Array1D< MCMC::chainstate > &parameterChain)
 
+

Macro Definition Documentation

+ +

◆ __wsu

+ +
+
+ + + + +
#define __wsu
+
+ +
+
+

Function Documentation

+ +

◆ computeParamLogLikelihood()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
double computeParamLogLikelihood (parameterPosteriorInformation * paramPostInfo,
Array1D< double > modelDataOut,
Array1D< double > parameters,
Array1D< double > hyperparameters )
+
+ +
+
+ +

◆ computeParamLogPosterior()

+ +
+
+ + + + + + + + + + + +
double computeParamLogPosterior (parameterPosteriorInformation * paramPostInfo,
Array1D< double > parameters )
+
+ +
+
+ +

◆ computeStatistics()

+ +
+
+ + + + + + + + + + + +
void computeStatistics (Array1D< double > & parameterStatistics,
Array1D< MCMC::chainstate > & parameterChain )
+
+ +
+
+ +

◆ dataInferenceLogPosterior()

+ +
+
+ + + + + + + + + + + +
double dataInferenceLogPosterior (Array1D< double > & m,
void * info )
+
+ +
+
+ +

◆ parameterInference()

+ +
+
+ + + + + + + + + + + + + + + + +
void parameterInference (dataPosteriorInformation * dataPostInfo,
Array1D< double > & m,
Array1D< MCMC::chainstate > & parameterChainEntries )
+
+ +
+
+ +

◆ parameterInferenceLogPosterior()

+ +
+
+ + + + + + + + + + + +
double parameterInferenceLogPosterior (Array1D< double > & beta,
void * info )
+
+ +
+
+ +

◆ userComputeParamLogLikelihood()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
double userComputeParamLogLikelihood (parameterPosteriorInformation * paramPostInfo,
Array1D< double > modelDataOut,
Array1D< double > parameters,
Array1D< double > hyperparameters )
+
+ +
+
+ +

◆ userComputeParamLogPosterior()

+ +
+
+ + + + + + + + + + + +
double userComputeParamLogPosterior (parameterPosteriorInformation * paramPostInfo,
Array1D< double > parameters )
+
+ +
+
+ +

◆ userComputeStatistics()

+ +
+
+ + + + + + + + + + + +
void userComputeStatistics (Array1D< double > & parameterStatistics,
Array1D< MCMC::chainstate > & parameterChain )
+
+ +
+
+ +

◆ userDefineConstraints()

+ +
+
+ + + + + + + +
void userDefineConstraints (dataPosteriorInformation & dataPostInfo)
+
+ +
+
+ +

◆ userDefineData()

+ +
+
+ + + + + + + +
void userDefineData (dataPosteriorInformation & dataPostInfo)
+
+ +
+
+ +

◆ userRunModel()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void userRunModel (Array1D< double > & modelDataY,
Array1D< double > & modelDataX,
Array1D< double > & parameters,
Array1D< double > & hyperparameters )
+
+ +
+
+ +

◆ userSpecifyNominalParams()

+ +
+
+ + + + + + + +
void userSpecifyNominalParams (dataPosteriorInformation & dataPostInfo)
+
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dfi_8h_source.html b/docs/html/dfi_8h_source.html new file mode 100644 index 00000000..5070b721 --- /dev/null +++ b/docs/html/dfi_8h_source.html @@ -0,0 +1,524 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: dfi.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
dfi.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
28#ifndef DFI_H_
+
29#define DFI_H_
+
30
+
31#include "Array1D.h"
+
32#include "Array2D.h"
+
33#include "Array3D.h"
+
34#include "mcmc.h"
+
35#include "amcmc.h"
+
36#include "quad.h"
+
37#include "math.h"
+
38#include "arrayio.h"
+
39
+
40#include "dsfmt_add.h"
+
41#include <sys/time.h>
+
42#include "arraytools.h"
+
43#include <string>
+
44#include <iostream>
+
45//for setting stdout precision
+
46#include <iomanip>
+
47
+
48#include "sampling.hpp"
+
49
+
50//for UQTk KDE functionality
+
51#include "tools.h"
+
52
+
53//for PCE surrogate construction
+
54#ifndef PCSET_H_SEEN
+
55#define __wsu
+
56#include "PCSet.h"
+
57#endif //PCSET_H_SEEN
+
58
+
59#include <stdlib.h>
+
60#include <sstream>
+
61
+
62//data container for surrogate model
+
+
63class DFIsurr{
+
64
+
65 public:
+
66
+
67 //model surrogate containers
+
68
+
69 //PCE dimension
+
70 int PCEdim;
+
71
+
72 //surrogate limits
+
73 Array1D<double> surrLo;
+
74 Array1D<double> surrHi;
+
75
+
76 //surrogate defined flag
+
77 bool surrDefined;
+
78
+
79 //PCset defines and initializes polynomial chaos basis function set
+
80 PCSet* surrModel;
+
81
+
82 //number of PCE terms
+
83 int numPCETerms;
+
84 //cotainer for coeefficients
+
85 Array2D<double> PCEcoefficients;
+
86 //container for evaluated PCE basis functions
+
87 Array2D<double> psiPCE;
+
88
+
89 // surrogate evaulation function
+
90 void evaluateSurr(Array1D<double> & modelOutput, Array1D<double> & params);
+
91};
+
+
92
+
93
+
94
+
95
+
96//data container
+
+
97class dataPosteriorInformation{
+
98
+
99 public:
+
100
+
101 int seed;
+
102 //dimension of the data space
+
103 int dataDim;
+
104 //parameter dimension
+
105 int paramDim;
+
106 //the number of constraints to impose
+
107 int numConstraints;
+
108
+
109
+
110 //boolean flag indicating that the data likelihood function is running for noise optimzation
+
111 bool errorOpt;
+
112 //boolean flag indicating that the the data chain has achieved burn-in
+
113 bool dataChainBurnedIn;
+
114 //counter for entry in data chain
+
115 int dataChain_count;
+
116
+
117
+
118 //container for passing noisy data sample to 1D noise optimization chain
+
119 Array1D<double> optErrorParameters;
+
120
+
121 //containers for data signal, i.e. y=f(x)
+
122 Array1D<double> trueDatax;
+
123 Array1D<double> trueDatay;
+
124 //container for error signal (e.g. noise + bias)
+
125 Array1D<double> error;
+
126 //container for nominal parameters, which define the nominal true data (trueDatay)
+
127 Array1D<double> nominalParameters;
+
128 //container for nominal error parameters
+
129 Array1D<double> nominalErrorParameters;
+
130 //container for additional parameters needed to run the model (but not inferred)
+
131 Array1D<double> hyperparameters;
+
132 //container for parameters for surrogate data model
+
133 Array1D<double> surrParameters;
+
134
+
135 //ABC data likelihood containers
+
136 //container to store labels describing the statistics to enforce as constraints
+
137 vector<string> statLabels;
+
138 //container to store the values of the statistics to enforce as constraints
+
139 vector<double> statValues;
+
140 //container to store the values of the ABC deltas for approximately enforcing statistics as contraints
+
141 vector<double> statDeltas;
+
142
+
143
+
144 //parameter chain write options
+
145 int paramWriteFlag;
+
146 //burn in chain file
+
147 string burninParamWriteFile;
+
148 //parameter chainfile
+
149 string mainParamWriteFile;
+
150
+
151 //length of parameter chains
+
152 int parameterBurnInNumSamples;
+
153 int parameterChainNumSamples;
+
154
+
155
+
156 //surrogate model
+
157 DFIsurr surrModelObj;
+
158 int numSurr;
+
159 vector<DFIsurr> surrModels;
+
160
+
161};
+
+
162
+
163//data container
+
+
164class parameterPosteriorInformation{
+
165
+
166 public:
+
167 Array1D<double> dataChainState;
+
168 //container for passing optimal error parameters to inner likelihood during error optimation
+
169 Array1D<double> optErrorParams;
+
170 Array1D<double> hyperparameters;
+
171 bool errorOpt;
+
172 //the input 'x' possibly required to compute the model function y=f(x)
+
173 Array1D<double> trueDatax;
+
174
+
175 // pointer to surrogate model object
+
176 DFIsurr * surrModelObj_;
+
177
+
178 vector<DFIsurr> * surrModels_;
+
179
+
180};
+
+
181
+
182//============================================
+
183//user defined functions
+
184
+
185//run the true data model
+
186void userRunModel(Array1D<double> &modelDataY, Array1D<double> &modelDataX, Array1D<double> & parameters, Array1D<double> &hyperparameters);
+
187//compute parameter (truth model and error model) parameter posterior
+
188double userComputeParamLogPosterior(parameterPosteriorInformation * paramPostInfo, Array1D<double> parameters);
+
189//compute parameter (truth model and error model) likelihood
+
190double userComputeParamLogLikelihood(parameterPosteriorInformation * paramPostInfo, Array1D<double> modelDataOut, Array1D<double> parameters, Array1D<double> hyperparameters);
+
191//compute statistics from inner parameter chain
+
192void userComputeStatistics(Array1D<double> &parameterStatistics, Array1D<MCMC::chainstate> & parameterChain);
+
193//define the target data signal
+
194void userDefineData(dataPosteriorInformation & dataPostInfo);
+
195//define the constraints
+
196void userDefineConstraints(dataPosteriorInformation & dataPostInfo);
+
197//specify the nominal values of the parameters
+
198void userSpecifyNominalParams(dataPosteriorInformation & dataPostInfo);
+
199//=============================================
+
200
+
201//data log postrior function to be passed to UQTk MCMC object for data chain
+
202double dataInferenceLogPosterior(Array1D<double>& m, void *info);
+
203//parameter log posterior function to be passed to UQTk MCMC object for parameter chains
+
204double parameterInferenceLogPosterior(Array1D<double>& beta, void *info);
+
205
+
206//define inner parameter inference
+
207void parameterInference(dataPosteriorInformation *dataPostInfo, Array1D<double> &m, Array1D<MCMC::chainstate>& parameterChainEntries);
+
208
+
209//compute parameter (truth model and error model) parameter posterior
+
210double computeParamLogPosterior(parameterPosteriorInformation * paramPostInfo, Array1D<double> parameters);
+
211//compute parameter (truth model and error model) likelihood
+
212double computeParamLogLikelihood(parameterPosteriorInformation * paramPostInfo, Array1D<double> modelDataOut, Array1D<double> parameters, Array1D<double> hyperparameters);
+
213//compute statistics from inner parameter chain
+
214void computeStatistics(Array1D<double> &parameterStatistics, Array1D<MCMC::chainstate> & parameterChain);
+
215
+
216
+
217
+
+
218class DFI{
+
219
+
220 private:
+
221 //seed
+
222 int seed;
+
223
+
224
+
225 //metadata container to pass by argument to data MCMC chain
+
226 dataPosteriorInformation dataPostInfo;
+
227 //metadata container to pass by argument to parameter MCMC chain
+
228 parameterPosteriorInformation paramPostInfo;
+
229
+
230 //I/O ===============
+
231 //log file name
+
232 stringstream logFileName;
+
233 //log file
+
234 ofstream logFile;
+
235 //===================
+
236
+
237 //container for noisy data
+
238 Array1D<double> noisyData;
+
239 //data scale (defines an approximate scale for the noise to be added)
+
240 double dataScale;
+
241
+
242
+
243 //length of main data chain after burn-in
+
244 int dataChainNumSamples;
+
245 //length of burn-in chainlets
+
246 int dataChainNumSamples_burnin;
+
247 //length of error model parameter optimization chain
+
248 double errorOptChainNumSamples;
+
249 //target data chain acceptance ratio (a burn-in parameter)
+
250 double targetDataChainAcceptanceRatio;
+
251 //data chain acceptance ratio
+
252 double dataChainAcceptanceRatio;
+
253 //data chain mode ratio
+
254 double dataPosteriorMode;
+
255
+
256 //intial data chain (Gaussian) proposal covariance
+
257 double dataChainPropCov_init;
+
258 //scale for setting proposal covariance
+
259 double dataChainPropCov_fac;
+
260
+
261
+
262 //data chain proposal covariance matrix
+
263 Array2D<double> dataChainPropCovMatrix;
+
264
+
265 //=====wrappers for user specified functions=========
+
266 //define the target data signal
+ +
270 //define the constraints
+ +
274 //specify the nominal values of the parameters
+ +
278 //run the true data model
+
+
279 void runModel(Array1D<double> &modelDataY, Array1D<double> &modelDataX, Array1D<double> & parameters, Array1D<double> &hyperparameters){
+
280
+
281 //if a surrogate is defined, use it
+
282 if (dataPostInfo.surrModelObj.surrDefined){
+
283
+
284 /* map parameters of interest to surrogate parameters */
+
285 //userSurrMap(dataPostInfo.surrParameters, parameters, hyperparameters);
+
286
+
287 /* check if parameters are within surrogate bounds */
+
288 bool inBounds=true;
+
289 for (int i=0; i<parameters.XSize();i++){
+
290 if ( (parameters(i) < dataPostInfo.surrModelObj.surrLo(i)) || (parameters(i) >dataPostInfo.surrModelObj.surrHi(i)) ){
+
291 inBounds=false;
+
292 std::cout<<"Out of bounds: param("<<i+1<<"<<) = "<<parameters(i)<<std::endl;
+
293 }
+
294 }
+
295
+
296 if (inBounds){
+
297 dataPostInfo.surrModelObj.evaluateSurr(modelDataY, parameters);
+
298 }else{
+
299 userRunModel(modelDataY, modelDataX, parameters, hyperparameters);
+
300 }
+
301
+
302 }else{
+
303 //run user specified detailed model
+
304 userRunModel(modelDataY, modelDataX, parameters, hyperparameters);
+
305 }
+
306
+
307 };
+
+
308 //===================================================
+
309
+
310
+
311 public:
+
312 //constructor
+
313 DFI();
+
314 //constructor
+
315 DFI(string inputfile);
+
316 //destructor
+
317 ~DFI();
+
318 //perform data inference
+
319 void dataInference();
+
320 //perform data refitting
+
321 void dataRefit();
+
322 //build KDE densities
+
323 void buildKDE(Array1D<int> KDEdim);
+
324 //generate samples from a pdf
+
325 void genSamples(Array2D<double> &pdf);
+
326 //build surrogate model
+
327 void buildSurrogateModel();
+
328 //load surrogate model
+
329 void loadSurrogateModel();
+
330 //test surrogate model
+
331 void testSurrogateModel();
+
332
+
333
+
334};
+
+
335
+
336#endif //DFI_H_
+
Array1D.h
1D Array class for any type T
+
Array2D.h
2D Array class for any type T
+
Array3D.h
3D Array class for any type T
+
PCSet.h
Header file for the Multivariate PC class.
+
arrayio.h
Header file for array read/write utilities.
+
arraytools.h
Header file for array tools.
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array1D::XSize
int XSize() const
Returns size in the x-direction.
Definition Array1D.h:103
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
DFI
Definition dfi.h:218
+
DFI::DFI
DFI()
Definition dfi.cpp:33
+
DFI::logFile
ofstream logFile
Definition dfi.h:234
+
DFI::buildKDE
void buildKDE(Array1D< int > KDEdim)
Definition dfi.cpp:914
+
DFI::logFileName
stringstream logFileName
Definition dfi.h:232
+
DFI::dataChainNumSamples
int dataChainNumSamples
Definition dfi.h:244
+
DFI::dataChainPropCov_fac
double dataChainPropCov_fac
Definition dfi.h:259
+
DFI::dataPostInfo
dataPosteriorInformation dataPostInfo
Definition dfi.h:226
+
DFI::specifyNominalParams
void specifyNominalParams(dataPosteriorInformation &dataPostInfo)
Definition dfi.h:275
+
DFI::targetDataChainAcceptanceRatio
double targetDataChainAcceptanceRatio
Definition dfi.h:250
+
DFI::seed
int seed
Definition dfi.h:222
+
DFI::noisyData
Array1D< double > noisyData
Definition dfi.h:238
+
DFI::genSamples
void genSamples(Array2D< double > &pdf)
Definition dfi.cpp:1092
+
DFI::buildSurrogateModel
void buildSurrogateModel()
Definition dfi.cpp:521
+
DFI::testSurrogateModel
void testSurrogateModel()
Definition dfi.cpp:845
+
DFI::dataChainAcceptanceRatio
double dataChainAcceptanceRatio
Definition dfi.h:252
+
DFI::paramPostInfo
parameterPosteriorInformation paramPostInfo
Definition dfi.h:228
+
DFI::loadSurrogateModel
void loadSurrogateModel()
Definition dfi.cpp:698
+
DFI::dataInference
void dataInference()
Definition dfi.cpp:208
+
DFI::dataRefit
void dataRefit()
Definition dfi.cpp:401
+
DFI::~DFI
~DFI()
Definition dfi.cpp:200
+
DFI::errorOptChainNumSamples
double errorOptChainNumSamples
Definition dfi.h:248
+
DFI::dataChainPropCovMatrix
Array2D< double > dataChainPropCovMatrix
Definition dfi.h:263
+
DFI::dataScale
double dataScale
Definition dfi.h:240
+
DFI::defineConstraints
void defineConstraints(dataPosteriorInformation &dataPostInfo)
Definition dfi.h:271
+
DFI::runModel
void runModel(Array1D< double > &modelDataY, Array1D< double > &modelDataX, Array1D< double > &parameters, Array1D< double > &hyperparameters)
Definition dfi.h:279
+
DFI::dataPosteriorMode
double dataPosteriorMode
Definition dfi.h:254
+
DFI::dataChainNumSamples_burnin
int dataChainNumSamples_burnin
Definition dfi.h:246
+
DFI::dataChainPropCov_init
double dataChainPropCov_init
Definition dfi.h:257
+
DFI::defineData
void defineData(dataPosteriorInformation &dataPostInfo)
Definition dfi.h:267
+
DFIsurr
Definition dfi.h:63
+
DFIsurr::PCEcoefficients
Array2D< double > PCEcoefficients
Definition dfi.h:85
+
DFIsurr::surrLo
Array1D< double > surrLo
Definition dfi.h:73
+
DFIsurr::surrModel
PCSet * surrModel
Definition dfi.h:80
+
DFIsurr::numPCETerms
int numPCETerms
Definition dfi.h:83
+
DFIsurr::evaluateSurr
void evaluateSurr(Array1D< double > &modelOutput, Array1D< double > &params)
Definition dfi.cpp:1106
+
DFIsurr::surrDefined
bool surrDefined
Definition dfi.h:77
+
DFIsurr::psiPCE
Array2D< double > psiPCE
Definition dfi.h:87
+
DFIsurr::surrHi
Array1D< double > surrHi
Definition dfi.h:74
+
DFIsurr::PCEdim
int PCEdim
Definition dfi.h:70
+
PCSet
Defines and initializes PC basis function set and provides functions to manipulate PC expansions defi...
Definition PCSet.h:73
+
dataPosteriorInformation
Definition dfi.h:97
+
dataPosteriorInformation::statValues
vector< double > statValues
Definition dfi.h:139
+
dataPosteriorInformation::errorOpt
bool errorOpt
Definition dfi.h:111
+
dataPosteriorInformation::trueDatax
Array1D< double > trueDatax
Definition dfi.h:122
+
dataPosteriorInformation::dataChainBurnedIn
bool dataChainBurnedIn
Definition dfi.h:113
+
dataPosteriorInformation::burninParamWriteFile
string burninParamWriteFile
Definition dfi.h:147
+
dataPosteriorInformation::seed
int seed
Definition dfi.h:101
+
dataPosteriorInformation::numConstraints
int numConstraints
Definition dfi.h:107
+
dataPosteriorInformation::numSurr
int numSurr
Definition dfi.h:158
+
dataPosteriorInformation::hyperparameters
Array1D< double > hyperparameters
Definition dfi.h:131
+
dataPosteriorInformation::parameterBurnInNumSamples
int parameterBurnInNumSamples
Definition dfi.h:152
+
dataPosteriorInformation::error
Array1D< double > error
Definition dfi.h:125
+
dataPosteriorInformation::surrModelObj
DFIsurr surrModelObj
Definition dfi.h:157
+
dataPosteriorInformation::nominalParameters
Array1D< double > nominalParameters
Definition dfi.h:127
+
dataPosteriorInformation::optErrorParameters
Array1D< double > optErrorParameters
Definition dfi.h:119
+
dataPosteriorInformation::statLabels
vector< string > statLabels
Definition dfi.h:137
+
dataPosteriorInformation::dataDim
int dataDim
Definition dfi.h:103
+
dataPosteriorInformation::surrModels
vector< DFIsurr > surrModels
Definition dfi.h:159
+
dataPosteriorInformation::surrParameters
Array1D< double > surrParameters
Definition dfi.h:133
+
dataPosteriorInformation::parameterChainNumSamples
int parameterChainNumSamples
Definition dfi.h:153
+
dataPosteriorInformation::statDeltas
vector< double > statDeltas
Definition dfi.h:141
+
dataPosteriorInformation::trueDatay
Array1D< double > trueDatay
Definition dfi.h:123
+
dataPosteriorInformation::paramWriteFlag
int paramWriteFlag
Definition dfi.h:145
+
dataPosteriorInformation::dataChain_count
int dataChain_count
Definition dfi.h:115
+
dataPosteriorInformation::mainParamWriteFile
string mainParamWriteFile
Definition dfi.h:149
+
dataPosteriorInformation::nominalErrorParameters
Array1D< double > nominalErrorParameters
Definition dfi.h:129
+
dataPosteriorInformation::paramDim
int paramDim
Definition dfi.h:105
+
parameterPosteriorInformation
Definition dfi.h:164
+
parameterPosteriorInformation::errorOpt
bool errorOpt
Definition dfi.h:171
+
parameterPosteriorInformation::surrModels_
vector< DFIsurr > * surrModels_
Definition dfi.h:178
+
parameterPosteriorInformation::dataChainState
Array1D< double > dataChainState
Definition dfi.h:167
+
parameterPosteriorInformation::hyperparameters
Array1D< double > hyperparameters
Definition dfi.h:170
+
parameterPosteriorInformation::trueDatax
Array1D< double > trueDatax
Definition dfi.h:173
+
parameterPosteriorInformation::optErrorParams
Array1D< double > optErrorParams
Definition dfi.h:169
+
parameterPosteriorInformation::surrModelObj_
DFIsurr * surrModelObj_
Definition dfi.h:176
+
beta
double beta(const double z, const double w)
Compute the Beta function at the point pair (z,w)
Definition combin.cpp:218
+
computeStatistics
void computeStatistics(Array1D< double > &parameterStatistics, Array1D< MCMC::chainstate > &parameterChain)
Definition dfi.cpp:1410
+
dataInferenceLogPosterior
double dataInferenceLogPosterior(Array1D< double > &m, void *info)
Definition dfi.cpp:1149
+
userComputeStatistics
void userComputeStatistics(Array1D< double > &parameterStatistics, Array1D< MCMC::chainstate > &parameterChain)
+
parameterInferenceLogPosterior
double parameterInferenceLogPosterior(Array1D< double > &beta, void *info)
Definition dfi.cpp:1387
+
computeParamLogPosterior
double computeParamLogPosterior(parameterPosteriorInformation *paramPostInfo, Array1D< double > parameters)
Definition dfi.cpp:1402
+
userDefineConstraints
void userDefineConstraints(dataPosteriorInformation &dataPostInfo)
+
userComputeParamLogPosterior
double userComputeParamLogPosterior(parameterPosteriorInformation *paramPostInfo, Array1D< double > parameters)
+
userDefineData
void userDefineData(dataPosteriorInformation &dataPostInfo)
+
computeParamLogLikelihood
double computeParamLogLikelihood(parameterPosteriorInformation *paramPostInfo, Array1D< double > modelDataOut, Array1D< double > parameters, Array1D< double > hyperparameters)
Definition dfi.cpp:1406
+
parameterInference
void parameterInference(dataPosteriorInformation *dataPostInfo, Array1D< double > &m, Array1D< MCMC::chainstate > &parameterChainEntries)
Definition dfi.cpp:1232
+
userComputeParamLogLikelihood
double userComputeParamLogLikelihood(parameterPosteriorInformation *paramPostInfo, Array1D< double > modelDataOut, Array1D< double > parameters, Array1D< double > hyperparameters)
+
userRunModel
void userRunModel(Array1D< double > &modelDataY, Array1D< double > &modelDataX, Array1D< double > &parameters, Array1D< double > &hyperparameters)
+
userSpecifyNominalParams
void userSpecifyNominalParams(dataPosteriorInformation &dataPostInfo)
+
mcmc.h
Header file for the Markov chain Monte Carlo class.
+
quad.h
Header file for the quadrature class.
+
tools.h
A header function that includes all tools.
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_006721c806d6821325371dd377832d8c.html b/docs/html/dir_006721c806d6821325371dd377832d8c.html new file mode 100644 index 00000000..a93877b8 --- /dev/null +++ b/docs/html/dir_006721c806d6821325371dd377832d8c.html @@ -0,0 +1,79 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: mcmc Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
mcmc Directory Reference
+
+
+ + + + + + + +

+Files

 mcmc.cpp
 
 mcmc.h
 Header file for the Markov chain Monte Carlo class.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_06694bf5fd41ba74684056be78273ad2.html b/docs/html/dir_06694bf5fd41ba74684056be78273ad2.html new file mode 100644 index 00000000..f09ec630 --- /dev/null +++ b/docs/html/dir_06694bf5fd41ba74684056be78273ad2.html @@ -0,0 +1,80 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: lreg Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
lreg Directory Reference
+
+
+ + + + + + + + +

+Files

 lreg.cpp
 Linear regression class.
 
 lreg.h
 Header file for the linear regression class A great deal of notations and computations follow [Orr:1996].
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_093fd1291c916f9be3adb1135a493bae.html b/docs/html/dir_093fd1291c916f9be3adb1135a493bae.html new file mode 100644 index 00000000..0097bb4c --- /dev/null +++ b/docs/html/dir_093fd1291c916f9be3adb1135a493bae.html @@ -0,0 +1,80 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gproc Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
gproc Directory Reference
+
+
+ + + + + + + + +

+Files

 gproc.cpp
 Gaussian Process class.
 
 gproc.h
 Header file for Gaussian Process class.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_128519fc8b37a5a067b4c5f6cc8f4c49.html b/docs/html/dir_128519fc8b37a5a067b4c5f6cc8f4c49.html new file mode 100644 index 00000000..a5de8ae1 --- /dev/null +++ b/docs/html/dir_128519fc8b37a5a067b4c5f6cc8f4c49.html @@ -0,0 +1,95 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: array Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
array Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + +

+Files

 Array1D.h
 1D Array class for any type T
 
 Array2D.h
 2D Array class for any type T
 
 Array3D.h
 3D Array class for any type T
 
 arrayio.cpp
 Read/write capabilities from/to matrix or vector form arrays/files.
 
 arrayio.h
 Header file for array read/write utilities.
 
 arraytools.cpp
 Tools to manipulate Array 1D and 2D objects. Some tools mimick MATLAB functionalities.
 
 arraytools.h
 Header file for array tools.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_16a870b7d07bdaacfd3f0908a78f5e9d.html b/docs/html/dir_16a870b7d07bdaacfd3f0908a78f5e9d.html new file mode 100644 index 00000000..b628001c --- /dev/null +++ b/docs/html/dir_16a870b7d07bdaacfd3f0908a78f5e9d.html @@ -0,0 +1,80 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: bcs Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
bcs Directory Reference
+
+
+ + + + + + + + +

+Files

 bcs.cpp
 Implementation of Bayesian compressive sensing algorithm.
 
 bcs.h
 Header for the implementations of Bayesian compressive sensing algorithm.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_19007e3130b5965ca6c49213286cf7eb.html b/docs/html/dir_19007e3130b5965ca6c49213286cf7eb.html new file mode 100644 index 00000000..b32cc9a7 --- /dev/null +++ b/docs/html/dir_19007e3130b5965ca6c49213286cf7eb.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pdf_cl Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
pdf_cl Directory Reference
+
+
+ + + + + +

+Files

 pdf_cl.cpp
 Command-line utility for KDE given samples.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_1eb400768e3494ee2ca629243c22fbce.html b/docs/html/dir_1eb400768e3494ee2ca629243c22fbce.html new file mode 100644 index 00000000..5add49ec --- /dev/null +++ b/docs/html/dir_1eb400768e3494ee2ca629243c22fbce.html @@ -0,0 +1,92 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: infer Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
infer Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + +

+Files

 inference.cpp
 Model inference tools.
 
 inference.h
 Header for the model inference tools.
 
 mrv.cpp
 Multivariate random variable class.
 
 mrv.h
 Header for multivariate random variable class.
 
 post.cpp
 Posterior computation class.
 
 post.h
 Header for the posterior computation class.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_20f2680a3977f3851122b2d6066a454e.html b/docs/html/dir_20f2680a3977f3851122b2d6066a454e.html new file mode 100644 index 00000000..a16c0b68 --- /dev/null +++ b/docs/html/dir_20f2680a3977f3851122b2d6066a454e.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gp_regr Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
gp_regr Directory Reference
+
+
+ + + + + +

+Files

 gp_regr.cpp
 Command-line utility for Gaussian Process regression.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_28e3df397f43e8f1af7e6c2b7d87b0e6.html b/docs/html/dir_28e3df397f43e8f1af7e6c2b7d87b0e6.html new file mode 100644 index 00000000..ea161e8e --- /dev/null +++ b/docs/html/dir_28e3df397f43e8f1af7e6c2b7d87b0e6.html @@ -0,0 +1,125 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: tools Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
tools Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

 combin.cpp
 Tools to evaluate combinatorial quantities.
 
 combin.h
 Header for combinatorial tools.
 
 func.cpp
 Implements several functions of form $y=f(\lambda;x)$.
 
 func.h
 Header for implementation of functions of form $y=f(\lambda;x)$.
 
 gq.cpp
 Utilities to generate quadrature rules.
 
 gq.h
 Header for quadrature generation utilities.
 
 minmax.cpp
 Tools to find min/max values of arrays.
 
 minmax.h
 Header for min/max tools.
 
 multiindex.cpp
 Tools that deal with integer multiindices.
 
 multiindex.h
 Header for tools that deal with integer multiindices.
 
 pcmaps.cpp
 Suite of functions to help map one kind of a PC variable to another.
 
 pcmaps.h
 Header for suite of functions to help map one kind of a PC variable to another.
 
 probability.cpp
 Probability and random number generation- related tools.
 
 probability.h
 Header for probability and random number generation- related tools.
 
 rosenblatt.cpp
 Tools related to Rosenblatt transformation.
 
 rosenblatt.h
 Header for tools related to Rosenblatt transformation.
 
 tools.h
 A header function that includes all tools.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_40ca0f9b78da4ccbb14e5a28ee282e45.html b/docs/html/dir_40ca0f9b78da4ccbb14e5a28ee282e45.html new file mode 100644 index 00000000..9c0dde17 --- /dev/null +++ b/docs/html/dir_40ca0f9b78da4ccbb14e5a28ee282e45.html @@ -0,0 +1,86 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pce Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
pce Directory Reference
+
+
+ + + + + + + + + + + + + + +

+Files

 PCBasis.cpp
 Univariate PC class.
 
 PCBasis.h
 Header file for the univariate PC class.
 
 PCSet.cpp
 Multivariate PC class.
 
 PCSet.h
 Header file for the Multivariate PC class.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_4532e4717bdbef31626f1f4eec1ad1de.html b/docs/html/dir_4532e4717bdbef31626f1f4eec1ad1de.html new file mode 100644 index 00000000..10d3e368 --- /dev/null +++ b/docs/html/dir_4532e4717bdbef31626f1f4eec1ad1de.html @@ -0,0 +1,80 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gkpSparse Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
gkpSparse Directory Reference
+
+
+ + + + + + + + +

+Files

 gkpclib.cpp
 
 gkplib.h
 
 gkpSparse.cpp
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_5c4c5ed82fd393e0105f6bcdb5914010.html b/docs/html/dir_5c4c5ed82fd393e0105f6bcdb5914010.html new file mode 100644 index 00000000..5557335e --- /dev/null +++ b/docs/html/dir_5c4c5ed82fd393e0105f6bcdb5914010.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: regression Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
regression Directory Reference
+
+
+ + + + + +

+Files

 regression.cpp
 Command-line utility for linear regression.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_7a58a101592a95cebbfd07e6a75340e1.html b/docs/html/dir_7a58a101592a95cebbfd07e6a75340e1.html new file mode 100644 index 00000000..3a334cb8 --- /dev/null +++ b/docs/html/dir_7a58a101592a95cebbfd07e6a75340e1.html @@ -0,0 +1,98 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: lib Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
lib Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +

+Directories

 array
 
 bcs
 
 dfi
 
 gproc
 
 infer
 
 kle
 
 lreg
 
 mcmc
 
 pce
 
 quad
 
 tools
 
 xmlutils
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_7b5ab9ffb3898dc1cc468814aa6ead1a.html b/docs/html/dir_7b5ab9ffb3898dc1cc468814aa6ead1a.html new file mode 100644 index 00000000..218b5689 --- /dev/null +++ b/docs/html/dir_7b5ab9ffb3898dc1cc468814aa6ead1a.html @@ -0,0 +1,80 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: dfi Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
dfi Directory Reference
+
+
+ + + + + + + + +

+Files

 dfi.cpp
 
 dfi.h
 
 userFunctions.h
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_7e9b6b5d4305474956bab61a81ab07f7.html b/docs/html/dir_7e9b6b5d4305474956bab61a81ab07f7.html new file mode 100644 index 00000000..23e08f10 --- /dev/null +++ b/docs/html/dir_7e9b6b5d4305474956bab61a81ab07f7.html @@ -0,0 +1,100 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: xmlutils Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
xmlutils Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

 MyException.h
 
 Object.h
 
 RefPtr.h
 
 XMLAttributeList.cpp
 
 XMLAttributeList.h
 
 XMLElement.cpp
 
 XMLElement.h
 
 XMLExpatParser.cpp
 
 XMLExpatParser.h
 
 XMLParser.cpp
 
 XMLParser.h
 
 XMLUtils.cpp
 
 XMLUtils.h
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_8dadda8c97c669c14bc759cc9927688a.html b/docs/html/dir_8dadda8c97c669c14bc759cc9927688a.html new file mode 100644 index 00000000..4c183ced --- /dev/null +++ b/docs/html/dir_8dadda8c97c669c14bc759cc9927688a.html @@ -0,0 +1,80 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: quad Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
quad Directory Reference
+
+
+ + + + + + + + +

+Files

 quad.cpp
 Quadrature class.
 
 quad.h
 Header file for the quadrature class.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_93836573b90394f9b606bea0a1f27892.html b/docs/html/dir_93836573b90394f9b606bea0a1f27892.html new file mode 100644 index 00000000..a162dbec --- /dev/null +++ b/docs/html/dir_93836573b90394f9b606bea0a1f27892.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gen_mi Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
gen_mi Directory Reference
+
+
+ + + + + +

+Files

 gen_mi.cpp
 Command-line utility to generate multiindex.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_97f84c1072eb90142eaac1b180b6d7c5.html b/docs/html/dir_97f84c1072eb90142eaac1b180b6d7c5.html new file mode 100644 index 00000000..4a93d7cb --- /dev/null +++ b/docs/html/dir_97f84c1072eb90142eaac1b180b6d7c5.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pce_quad Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
pce_quad Directory Reference
+
+
+ + + + + +

+Files

 pce_quad.cpp
 Command-line utility for PC construction given samples.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_9edb83e4ed44c497265383775a8507cd.html b/docs/html/dir_9edb83e4ed44c497265383775a8507cd.html new file mode 100644 index 00000000..b61c3dfb --- /dev/null +++ b/docs/html/dir_9edb83e4ed44c497265383775a8507cd.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: generate_quad Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
generate_quad Directory Reference
+
+
+ + + + + +

+Files

 generate_quad.cpp
 Command-line utility to generate quadrature points.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_9faeda79623e471167af325f01dc9fc9.html b/docs/html/dir_9faeda79623e471167af325f01dc9fc9.html new file mode 100644 index 00000000..2774bade --- /dev/null +++ b/docs/html/dir_9faeda79623e471167af325f01dc9fc9.html @@ -0,0 +1,98 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: app Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
app Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +

+Directories

 gen_mi
 
 generate_quad
 
 gkpSparse
 
 gp_regr
 
 model_inf
 
 pce_eval
 
 pce_quad
 
 pce_rv
 
 pce_sens
 
 pdf_cl
 
 regression
 
 sens
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_a3750b93c2443f2a35afa7a30a5b3dee.html b/docs/html/dir_a3750b93c2443f2a35afa7a30a5b3dee.html new file mode 100644 index 00000000..a22fad5f --- /dev/null +++ b/docs/html/dir_a3750b93c2443f2a35afa7a30a5b3dee.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pce_sens Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
pce_sens Directory Reference
+
+
+ + + + + +

+Files

 pce_sens.cpp
 Command-line utility for Sobol sensitivity index computation given PC.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_b5a0728fb7018a88df0fa60e862f7cd4.html b/docs/html/dir_b5a0728fb7018a88df0fa60e862f7cd4.html new file mode 100644 index 00000000..748c1595 --- /dev/null +++ b/docs/html/dir_b5a0728fb7018a88df0fa60e862f7cd4.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: model_inf Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
model_inf Directory Reference
+
+
+ + + + + +

+Files

 model_inf.cpp
 Command-line utility for model parameter inference.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_b915a5b945a42a3919ddfe29e13bcb81.html b/docs/html/dir_b915a5b945a42a3919ddfe29e13bcb81.html new file mode 100644 index 00000000..9c0a1a5b --- /dev/null +++ b/docs/html/dir_b915a5b945a42a3919ddfe29e13bcb81.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pce_eval Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
pce_eval Directory Reference
+
+
+ + + + + +

+Files

 pce_eval.cpp
 Command-line utility for PC-related evaluations.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_dc842bf419791690b2dfdb2fe51d5bc8.html b/docs/html/dir_dc842bf419791690b2dfdb2fe51d5bc8.html new file mode 100644 index 00000000..489fa94d --- /dev/null +++ b/docs/html/dir_dc842bf419791690b2dfdb2fe51d5bc8.html @@ -0,0 +1,78 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: kle Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
kle Directory Reference
+
+
+ + + + + + +

+Files

 kle.cpp
 
 kle.h
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_df511e5bd85cec96854b39d5e1c27aa8.html b/docs/html/dir_df511e5bd85cec96854b39d5e1c27aa8.html new file mode 100644 index 00000000..11d14bcd --- /dev/null +++ b/docs/html/dir_df511e5bd85cec96854b39d5e1c27aa8.html @@ -0,0 +1,78 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: cpp Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
cpp Directory Reference
+
+
+ + + + + + +

+Directories

 app
 
 lib
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_e002628c42d6516cdcbe6e17a7fdfaec.html b/docs/html/dir_e002628c42d6516cdcbe6e17a7fdfaec.html new file mode 100644 index 00000000..19309593 --- /dev/null +++ b/docs/html/dir_e002628c42d6516cdcbe6e17a7fdfaec.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pce_rv Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
pce_rv Directory Reference
+
+
+ + + + + +

+Files

 pce_rv.cpp
 Command-line utility for PC-related random variable generation.
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/dir_fcacb3c2852ebd65abb669ef5bd9c0b5.html b/docs/html/dir_fcacb3c2852ebd65abb669ef5bd9c0b5.html new file mode 100644 index 00000000..abe33b05 --- /dev/null +++ b/docs/html/dir_fcacb3c2852ebd65abb669ef5bd9c0b5.html @@ -0,0 +1,78 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: sens Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
sens Directory Reference
+
+
+ + + + + + +

+Files

 sens.cpp
 
 trdSpls.cpp
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/doc.svg b/docs/html/doc.svg new file mode 100644 index 00000000..0b928a53 --- /dev/null +++ b/docs/html/doc.svg @@ -0,0 +1,12 @@ + + + + + + + + + + + diff --git a/docs/html/docd.svg b/docs/html/docd.svg new file mode 100644 index 00000000..ac18b275 --- /dev/null +++ b/docs/html/docd.svg @@ -0,0 +1,12 @@ + + + + + + + + + + + diff --git a/docs/html/doxygen.css b/docs/html/doxygen.css new file mode 100644 index 00000000..574b3335 --- /dev/null +++ b/docs/html/doxygen.css @@ -0,0 +1,2247 @@ +/* The standard CSS for doxygen 1.12.0*/ + +html { +/* page base colors */ +--page-background-color: white; +--page-foreground-color: black; +--page-link-color: #3D578C; +--page-visited-link-color: #4665A2; + +/* index */ +--index-odd-item-bg-color: #F8F9FC; +--index-even-item-bg-color: white; +--index-header-color: black; +--index-separator-color: #A0A0A0; + +/* header */ +--header-background-color: #F9FAFC; +--header-separator-color: #C4CFE5; +--header-gradient-image: url('nav_h.png'); +--group-header-separator-color: #879ECB; +--group-header-color: #354C7B; +--inherit-header-color: gray; + +--footer-foreground-color: #2A3D61; +--footer-logo-width: 104px; +--citation-label-color: #334975; +--glow-color: cyan; + +--title-background-color: white; +--title-separator-color: #5373B4; +--directory-separator-color: #9CAFD4; +--separator-color: #4A6AAA; + +--blockquote-background-color: #F7F8FB; +--blockquote-border-color: #9CAFD4; + +--scrollbar-thumb-color: #9CAFD4; +--scrollbar-background-color: #F9FAFC; + +--icon-background-color: #728DC1; +--icon-foreground-color: white; +--icon-doc-image: url('doc.svg'); +--icon-folder-open-image: url('folderopen.svg'); +--icon-folder-closed-image: url('folderclosed.svg'); + +/* brief member declaration list */ +--memdecl-background-color: #F9FAFC; +--memdecl-separator-color: #DEE4F0; +--memdecl-foreground-color: #555; +--memdecl-template-color: #4665A2; + +/* detailed member list */ +--memdef-border-color: #A8B8D9; +--memdef-title-background-color: #E2E8F2; +--memdef-title-gradient-image: url('nav_f.png'); +--memdef-proto-background-color: #DFE5F1; +--memdef-proto-text-color: #253555; +--memdef-proto-text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); +--memdef-doc-background-color: white; +--memdef-param-name-color: #602020; +--memdef-template-color: #4665A2; + +/* tables */ +--table-cell-border-color: #2D4068; +--table-header-background-color: #374F7F; +--table-header-foreground-color: #FFFFFF; + +/* labels */ +--label-background-color: #728DC1; +--label-left-top-border-color: #5373B4; +--label-right-bottom-border-color: #C4CFE5; +--label-foreground-color: white; + +/** navigation bar/tree/menu */ +--nav-background-color: #F9FAFC; +--nav-foreground-color: #364D7C; +--nav-gradient-image: url('tab_b.png'); +--nav-gradient-hover-image: url('tab_h.png'); +--nav-gradient-active-image: url('tab_a.png'); +--nav-gradient-active-image-parent: url("../tab_a.png"); +--nav-separator-image: url('tab_s.png'); +--nav-breadcrumb-image: url('bc_s.png'); +--nav-breadcrumb-border-color: #C2CDE4; +--nav-splitbar-image: url('splitbar.png'); +--nav-font-size-level1: 13px; +--nav-font-size-level2: 10px; +--nav-font-size-level3: 9px; +--nav-text-normal-color: #283A5D; +--nav-text-hover-color: white; +--nav-text-active-color: white; +--nav-text-normal-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); +--nav-text-hover-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); +--nav-text-active-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); +--nav-menu-button-color: #364D7C; +--nav-menu-background-color: white; +--nav-menu-foreground-color: #555555; +--nav-menu-toggle-color: rgba(255, 255, 255, 0.5); +--nav-arrow-color: #9CAFD4; +--nav-arrow-selected-color: #9CAFD4; + +/* table of contents */ +--toc-background-color: #F4F6FA; +--toc-border-color: #D8DFEE; +--toc-header-color: #4665A2; +--toc-down-arrow-image: url("data:image/svg+xml;utf8,&%238595;"); + +/** search field */ +--search-background-color: white; +--search-foreground-color: #909090; +--search-magnification-image: url('mag.svg'); +--search-magnification-select-image: url('mag_sel.svg'); +--search-active-color: black; +--search-filter-background-color: #F9FAFC; +--search-filter-foreground-color: black; +--search-filter-border-color: #90A5CE; +--search-filter-highlight-text-color: white; +--search-filter-highlight-bg-color: #3D578C; +--search-results-foreground-color: #425E97; +--search-results-background-color: #EEF1F7; +--search-results-border-color: black; +--search-box-shadow: inset 0.5px 0.5px 3px 0px #555; + +/** code fragments */ +--code-keyword-color: #008000; +--code-type-keyword-color: #604020; +--code-flow-keyword-color: #E08000; +--code-comment-color: #800000; +--code-preprocessor-color: #806020; +--code-string-literal-color: #002080; +--code-char-literal-color: #008080; +--code-xml-cdata-color: black; +--code-vhdl-digit-color: #FF00FF; +--code-vhdl-char-color: #000000; +--code-vhdl-keyword-color: #700070; +--code-vhdl-logic-color: #FF0000; +--code-link-color: #4665A2; +--code-external-link-color: #4665A2; +--fragment-foreground-color: black; +--fragment-background-color: #FBFCFD; +--fragment-border-color: #C4CFE5; +--fragment-lineno-border-color: #00FF00; +--fragment-lineno-background-color: #E8E8E8; +--fragment-lineno-foreground-color: black; +--fragment-lineno-link-fg-color: #4665A2; +--fragment-lineno-link-bg-color: #D8D8D8; +--fragment-lineno-link-hover-fg-color: #4665A2; +--fragment-lineno-link-hover-bg-color: #C8C8C8; +--fragment-copy-ok-color: #2EC82E; +--tooltip-foreground-color: black; +--tooltip-background-color: white; +--tooltip-border-color: gray; +--tooltip-doc-color: grey; +--tooltip-declaration-color: #006318; +--tooltip-link-color: #4665A2; +--tooltip-shadow: 1px 1px 7px gray; +--fold-line-color: #808080; +--fold-minus-image: url('minus.svg'); +--fold-plus-image: url('plus.svg'); +--fold-minus-image-relpath: url('../../minus.svg'); +--fold-plus-image-relpath: url('../../plus.svg'); + +/** font-family */ +--font-family-normal: Roboto,sans-serif; +--font-family-monospace: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; +--font-family-nav: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; +--font-family-title: Tahoma,Arial,sans-serif; +--font-family-toc: Verdana,'DejaVu Sans',Geneva,sans-serif; +--font-family-search: Arial,Verdana,sans-serif; +--font-family-icon: Arial,Helvetica; +--font-family-tooltip: Roboto,sans-serif; + +/** special sections */ +--warning-color-bg: #f8d1cc; +--warning-color-hl: #b61825; +--warning-color-text: #75070f; +--note-color-bg: #faf3d8; +--note-color-hl: #f3a600; +--note-color-text: #5f4204; +--todo-color-bg: #e4f3ff; +--todo-color-hl: #1879C4; +--todo-color-text: #274a5c; +--test-color-bg: #e8e8ff; +--test-color-hl: #3939C4; +--test-color-text: #1a1a5c; +--deprecated-color-bg: #ecf0f3; +--deprecated-color-hl: #5b6269; +--deprecated-color-text: #43454a; +--bug-color-bg: #e4dafd; +--bug-color-hl: #5b2bdd; +--bug-color-text: #2a0d72; +--invariant-color-bg: #d8f1e3; +--invariant-color-hl: #44b86f; +--invariant-color-text: #265532; +} + +@media (prefers-color-scheme: dark) { + html:not(.dark-mode) { + color-scheme: dark; + +/* page base colors */ +--page-background-color: black; +--page-foreground-color: #C9D1D9; +--page-link-color: #90A5CE; +--page-visited-link-color: #A3B4D7; + +/* index */ +--index-odd-item-bg-color: #0B101A; +--index-even-item-bg-color: black; +--index-header-color: #C4CFE5; +--index-separator-color: #334975; + +/* header */ +--header-background-color: #070B11; +--header-separator-color: #141C2E; +--header-gradient-image: url('nav_hd.png'); +--group-header-separator-color: #283A5D; +--group-header-color: #90A5CE; +--inherit-header-color: #A0A0A0; + +--footer-foreground-color: #5B7AB7; +--footer-logo-width: 60px; +--citation-label-color: #90A5CE; +--glow-color: cyan; + +--title-background-color: #090D16; +--title-separator-color: #354C79; +--directory-separator-color: #283A5D; +--separator-color: #283A5D; + +--blockquote-background-color: #101826; +--blockquote-border-color: #283A5D; + +--scrollbar-thumb-color: #283A5D; +--scrollbar-background-color: #070B11; + +--icon-background-color: #334975; +--icon-foreground-color: #C4CFE5; +--icon-doc-image: url('docd.svg'); +--icon-folder-open-image: url('folderopend.svg'); +--icon-folder-closed-image: url('folderclosedd.svg'); + +/* brief member declaration list */ +--memdecl-background-color: #0B101A; +--memdecl-separator-color: #2C3F65; +--memdecl-foreground-color: #BBB; +--memdecl-template-color: #7C95C6; + +/* detailed member list */ +--memdef-border-color: #233250; +--memdef-title-background-color: #1B2840; +--memdef-title-gradient-image: url('nav_fd.png'); +--memdef-proto-background-color: #19243A; +--memdef-proto-text-color: #9DB0D4; +--memdef-proto-text-shadow: 0px 1px 1px rgba(0, 0, 0, 0.9); +--memdef-doc-background-color: black; +--memdef-param-name-color: #D28757; +--memdef-template-color: #7C95C6; + +/* tables */ +--table-cell-border-color: #283A5D; +--table-header-background-color: #283A5D; +--table-header-foreground-color: #C4CFE5; + +/* labels */ +--label-background-color: #354C7B; +--label-left-top-border-color: #4665A2; +--label-right-bottom-border-color: #283A5D; +--label-foreground-color: #CCCCCC; + +/** navigation bar/tree/menu */ +--nav-background-color: #101826; +--nav-foreground-color: #364D7C; +--nav-gradient-image: url('tab_bd.png'); +--nav-gradient-hover-image: url('tab_hd.png'); +--nav-gradient-active-image: url('tab_ad.png'); +--nav-gradient-active-image-parent: url("../tab_ad.png"); +--nav-separator-image: url('tab_sd.png'); +--nav-breadcrumb-image: url('bc_sd.png'); +--nav-breadcrumb-border-color: #2A3D61; +--nav-splitbar-image: url('splitbard.png'); +--nav-font-size-level1: 13px; +--nav-font-size-level2: 10px; +--nav-font-size-level3: 9px; +--nav-text-normal-color: #B6C4DF; +--nav-text-hover-color: #DCE2EF; +--nav-text-active-color: #DCE2EF; +--nav-text-normal-shadow: 0px 1px 1px black; +--nav-text-hover-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); +--nav-text-active-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); +--nav-menu-button-color: #B6C4DF; +--nav-menu-background-color: #05070C; +--nav-menu-foreground-color: #BBBBBB; +--nav-menu-toggle-color: rgba(255, 255, 255, 0.2); +--nav-arrow-color: #334975; +--nav-arrow-selected-color: #90A5CE; + +/* table of contents */ +--toc-background-color: #151E30; +--toc-border-color: #202E4A; +--toc-header-color: #A3B4D7; +--toc-down-arrow-image: url("data:image/svg+xml;utf8,&%238595;"); + +/** search field */ +--search-background-color: black; +--search-foreground-color: #C5C5C5; +--search-magnification-image: url('mag_d.svg'); +--search-magnification-select-image: url('mag_seld.svg'); +--search-active-color: #C5C5C5; +--search-filter-background-color: #101826; +--search-filter-foreground-color: #90A5CE; +--search-filter-border-color: #7C95C6; +--search-filter-highlight-text-color: #BCC9E2; +--search-filter-highlight-bg-color: #283A5D; +--search-results-background-color: #101826; +--search-results-foreground-color: #90A5CE; +--search-results-border-color: #7C95C6; +--search-box-shadow: inset 0.5px 0.5px 3px 0px #2F436C; + +/** code fragments */ +--code-keyword-color: #CC99CD; +--code-type-keyword-color: #AB99CD; +--code-flow-keyword-color: #E08000; +--code-comment-color: #717790; +--code-preprocessor-color: #65CABE; +--code-string-literal-color: #7EC699; +--code-char-literal-color: #00E0F0; +--code-xml-cdata-color: #C9D1D9; +--code-vhdl-digit-color: #FF00FF; +--code-vhdl-char-color: #C0C0C0; +--code-vhdl-keyword-color: #CF53C9; +--code-vhdl-logic-color: #FF0000; +--code-link-color: #79C0FF; +--code-external-link-color: #79C0FF; +--fragment-foreground-color: #C9D1D9; +--fragment-background-color: #090D16; +--fragment-border-color: #30363D; +--fragment-lineno-border-color: #30363D; +--fragment-lineno-background-color: black; +--fragment-lineno-foreground-color: #6E7681; +--fragment-lineno-link-fg-color: #6E7681; +--fragment-lineno-link-bg-color: #303030; +--fragment-lineno-link-hover-fg-color: #8E96A1; +--fragment-lineno-link-hover-bg-color: #505050; +--fragment-copy-ok-color: #0EA80E; +--tooltip-foreground-color: #C9D1D9; +--tooltip-background-color: #202020; +--tooltip-border-color: #C9D1D9; +--tooltip-doc-color: #D9E1E9; +--tooltip-declaration-color: #20C348; +--tooltip-link-color: #79C0FF; +--tooltip-shadow: none; +--fold-line-color: #808080; +--fold-minus-image: url('minusd.svg'); +--fold-plus-image: url('plusd.svg'); +--fold-minus-image-relpath: url('../../minusd.svg'); +--fold-plus-image-relpath: url('../../plusd.svg'); + +/** font-family */ +--font-family-normal: Roboto,sans-serif; +--font-family-monospace: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed; +--font-family-nav: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; +--font-family-title: Tahoma,Arial,sans-serif; +--font-family-toc: Verdana,'DejaVu Sans',Geneva,sans-serif; +--font-family-search: Arial,Verdana,sans-serif; +--font-family-icon: Arial,Helvetica; +--font-family-tooltip: Roboto,sans-serif; + +/** special sections */ +--warning-color-bg: #2e1917; +--warning-color-hl: #ad2617; +--warning-color-text: #f5b1aa; +--note-color-bg: #3b2e04; +--note-color-hl: #f1b602; +--note-color-text: #ceb670; +--todo-color-bg: #163750; +--todo-color-hl: #1982D2; +--todo-color-text: #dcf0fa; +--test-color-bg: #121258; +--test-color-hl: #4242cf; +--test-color-text: #c0c0da; +--deprecated-color-bg: #2e323b; +--deprecated-color-hl: #738396; +--deprecated-color-text: #abb0bd; +--bug-color-bg: #2a2536; +--bug-color-hl: #7661b3; +--bug-color-text: #ae9ed6; +--invariant-color-bg: #303a35; +--invariant-color-hl: #76ce96; +--invariant-color-text: #cceed5; +}} +body { + background-color: var(--page-background-color); + color: var(--page-foreground-color); +} + +body, table, div, p, dl { + font-weight: 400; + font-size: 14px; + font-family: var(--font-family-normal); + line-height: 22px; +} + +/* @group Heading Levels */ + +.title { + font-family: var(--font-family-normal); + line-height: 28px; + font-size: 150%; + font-weight: bold; + margin: 10px 2px; +} + +h1.groupheader { + font-size: 150%; +} + +h2.groupheader { + border-bottom: 1px solid var(--group-header-separator-color); + color: var(--group-header-color); + font-size: 150%; + font-weight: normal; + margin-top: 1.75em; + padding-top: 8px; + padding-bottom: 4px; + width: 100%; +} + +h3.groupheader { + font-size: 100%; +} + +h1, h2, h3, h4, h5, h6 { + -webkit-transition: text-shadow 0.5s linear; + -moz-transition: text-shadow 0.5s linear; + -ms-transition: text-shadow 0.5s linear; + -o-transition: text-shadow 0.5s linear; + transition: text-shadow 0.5s linear; + margin-right: 15px; +} + +h1.glow, h2.glow, h3.glow, h4.glow, h5.glow, h6.glow { + text-shadow: 0 0 15px var(--glow-color); +} + +dt { + font-weight: bold; +} + +p.startli, p.startdd { + margin-top: 2px; +} + +th p.starttd, th p.intertd, th p.endtd { + font-size: 100%; + font-weight: 700; +} + +p.starttd { + margin-top: 0px; +} + +p.endli { + margin-bottom: 0px; +} + +p.enddd { + margin-bottom: 4px; +} + +p.endtd { + margin-bottom: 2px; +} + +p.interli { +} + +p.interdd { +} + +p.intertd { +} + +/* @end */ + +caption { + font-weight: bold; +} + +span.legend { + font-size: 70%; + text-align: center; +} + +h3.version { + font-size: 90%; + text-align: center; +} + +div.navtab { + padding-right: 15px; + text-align: right; + line-height: 110%; +} + +div.navtab table { + border-spacing: 0; +} + +td.navtab { + padding-right: 6px; + padding-left: 6px; +} + +td.navtabHL { + background-image: var(--nav-gradient-active-image); + background-repeat:repeat-x; + padding-right: 6px; + padding-left: 6px; +} + +td.navtabHL a, td.navtabHL a:visited { + color: var(--nav-text-hover-color); + text-shadow: var(--nav-text-hover-shadow); +} + +a.navtab { + font-weight: bold; +} + +div.qindex{ + text-align: center; + width: 100%; + line-height: 140%; + font-size: 130%; + color: var(--index-separator-color); +} + +#main-menu a:focus { + outline: auto; + z-index: 10; + position: relative; +} + +dt.alphachar{ + font-size: 180%; + font-weight: bold; +} + +.alphachar a{ + color: var(--index-header-color); +} + +.alphachar a:hover, .alphachar a:visited{ + text-decoration: none; +} + +.classindex dl { + padding: 25px; + column-count:1 +} + +.classindex dd { + display:inline-block; + margin-left: 50px; + width: 90%; + line-height: 1.15em; +} + +.classindex dl.even { + background-color: var(--index-even-item-bg-color); +} + +.classindex dl.odd { + background-color: var(--index-odd-item-bg-color); +} + +@media(min-width: 1120px) { + .classindex dl { + column-count:2 + } +} + +@media(min-width: 1320px) { + .classindex dl { + column-count:3 + } +} + + +/* @group Link Styling */ + +a { + color: var(--page-link-color); + font-weight: normal; + text-decoration: none; +} + +.contents a:visited { + color: var(--page-visited-link-color); +} + +a:hover { + text-decoration: none; + background: linear-gradient(to bottom, transparent 0,transparent calc(100% - 1px), currentColor 100%); +} + +a:hover > span.arrow { + text-decoration: none; + background : var(--nav-background-color); +} + +a.el { + font-weight: bold; +} + +a.elRef { +} + +a.code, a.code:visited, a.line, a.line:visited { + color: var(--code-link-color); +} + +a.codeRef, a.codeRef:visited, a.lineRef, a.lineRef:visited { + color: var(--code-external-link-color); +} + +a.code.hl_class { /* style for links to class names in code snippets */ } +a.code.hl_struct { /* style for links to struct names in code snippets */ } +a.code.hl_union { /* style for links to union names in code snippets */ } +a.code.hl_interface { /* style for links to interface names in code snippets */ } +a.code.hl_protocol { /* style for links to protocol names in code snippets */ } +a.code.hl_category { /* style for links to category names in code snippets */ } +a.code.hl_exception { /* style for links to exception names in code snippets */ } +a.code.hl_service { /* style for links to service names in code snippets */ } +a.code.hl_singleton { /* style for links to singleton names in code snippets */ } +a.code.hl_concept { /* style for links to concept names in code snippets */ } +a.code.hl_namespace { /* style for links to namespace names in code snippets */ } +a.code.hl_package { /* style for links to package names in code snippets */ } +a.code.hl_define { /* style for links to macro names in code snippets */ } +a.code.hl_function { /* style for links to function names in code snippets */ } +a.code.hl_variable { /* style for links to variable names in code snippets */ } +a.code.hl_typedef { /* style for links to typedef names in code snippets */ } +a.code.hl_enumvalue { /* style for links to enum value names in code snippets */ } +a.code.hl_enumeration { /* style for links to enumeration names in code snippets */ } +a.code.hl_signal { /* style for links to Qt signal names in code snippets */ } +a.code.hl_slot { /* style for links to Qt slot names in code snippets */ } +a.code.hl_friend { /* style for links to friend names in code snippets */ } +a.code.hl_dcop { /* style for links to KDE3 DCOP names in code snippets */ } +a.code.hl_property { /* style for links to property names in code snippets */ } +a.code.hl_event { /* style for links to event names in code snippets */ } +a.code.hl_sequence { /* style for links to sequence names in code snippets */ } +a.code.hl_dictionary { /* style for links to dictionary names in code snippets */ } + +/* @end */ + +dl.el { + margin-left: -1cm; +} + +ul.check { + list-style:none; + text-indent: -16px; + padding-left: 38px; +} +li.unchecked:before { + content: "\2610\A0"; +} +li.checked:before { + content: "\2611\A0"; +} + +ol { + text-indent: 0px; +} + +ul { + text-indent: 0px; + overflow: visible; +} + +ul.multicol { + -moz-column-gap: 1em; + -webkit-column-gap: 1em; + column-gap: 1em; + -moz-column-count: 3; + -webkit-column-count: 3; + column-count: 3; + list-style-type: none; +} + +#side-nav ul { + overflow: visible; /* reset ul rule for scroll bar in GENERATE_TREEVIEW window */ +} + +#main-nav ul { + overflow: visible; /* reset ul rule for the navigation bar drop down lists */ +} + +.fragment { + text-align: left; + direction: ltr; + overflow-x: auto; + overflow-y: hidden; + position: relative; + min-height: 12px; + margin: 10px 0px; + padding: 10px 10px; + border: 1px solid var(--fragment-border-color); + border-radius: 4px; + background-color: var(--fragment-background-color); + color: var(--fragment-foreground-color); +} + +pre.fragment { + word-wrap: break-word; + font-size: 10pt; + line-height: 125%; + font-family: var(--font-family-monospace); +} + +.clipboard { + width: 24px; + height: 24px; + right: 5px; + top: 5px; + opacity: 0; + position: absolute; + display: inline; + overflow: auto; + fill: var(--fragment-foreground-color); + justify-content: center; + align-items: center; + cursor: pointer; +} + +.clipboard.success { + border: 1px solid var(--fragment-foreground-color); + border-radius: 4px; +} + +.fragment:hover .clipboard, .clipboard.success { + opacity: .28; +} + +.clipboard:hover, .clipboard.success { + opacity: 1 !important; +} + +.clipboard:active:not([class~=success]) svg { + transform: scale(.91); +} + +.clipboard.success svg { + fill: var(--fragment-copy-ok-color); +} + +.clipboard.success { + border-color: var(--fragment-copy-ok-color); +} + +div.line { + font-family: var(--font-family-monospace); + font-size: 13px; + min-height: 13px; + line-height: 1.2; + text-wrap: unrestricted; + white-space: -moz-pre-wrap; /* Moz */ + white-space: -pre-wrap; /* Opera 4-6 */ + white-space: -o-pre-wrap; /* Opera 7 */ + white-space: pre-wrap; /* CSS3 */ + word-wrap: break-word; /* IE 5.5+ */ + text-indent: -53px; + padding-left: 53px; + padding-bottom: 0px; + margin: 0px; + -webkit-transition-property: background-color, box-shadow; + -webkit-transition-duration: 0.5s; + -moz-transition-property: background-color, box-shadow; + -moz-transition-duration: 0.5s; + -ms-transition-property: background-color, box-shadow; + -ms-transition-duration: 0.5s; + -o-transition-property: background-color, box-shadow; + -o-transition-duration: 0.5s; + transition-property: background-color, box-shadow; + transition-duration: 0.5s; +} + +div.line:after { + content:"\000A"; + white-space: pre; +} + +div.line.glow { + background-color: var(--glow-color); + box-shadow: 0 0 10px var(--glow-color); +} + +span.fold { + margin-left: 5px; + margin-right: 1px; + margin-top: 0px; + margin-bottom: 0px; + padding: 0px; + display: inline-block; + width: 12px; + height: 12px; + background-repeat:no-repeat; + background-position:center; +} + +span.lineno { + padding-right: 4px; + margin-right: 9px; + text-align: right; + border-right: 2px solid var(--fragment-lineno-border-color); + color: var(--fragment-lineno-foreground-color); + background-color: var(--fragment-lineno-background-color); + white-space: pre; +} +span.lineno a, span.lineno a:visited { + color: var(--fragment-lineno-link-fg-color); + background-color: var(--fragment-lineno-link-bg-color); +} + +span.lineno a:hover { + color: var(--fragment-lineno-link-hover-fg-color); + background-color: var(--fragment-lineno-link-hover-bg-color); +} + +.lineno { + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +div.classindex ul { + list-style: none; + padding-left: 0; +} + +div.classindex span.ai { + display: inline-block; +} + +div.groupHeader { + margin-left: 16px; + margin-top: 12px; + font-weight: bold; +} + +div.groupText { + margin-left: 16px; + font-style: italic; +} + +body { + color: var(--page-foreground-color); + margin: 0; +} + +div.contents { + margin-top: 10px; + margin-left: 12px; + margin-right: 8px; +} + +p.formulaDsp { + text-align: center; +} + +img.dark-mode-visible { + display: none; +} +img.light-mode-visible { + display: none; +} + +img.formulaInl, img.inline { + vertical-align: middle; +} + +div.center { + text-align: center; + margin-top: 0px; + margin-bottom: 0px; + padding: 0px; +} + +div.center img { + border: 0px; +} + +address.footer { + text-align: right; + padding-right: 12px; +} + +img.footer { + border: 0px; + vertical-align: middle; + width: var(--footer-logo-width); +} + +.compoundTemplParams { + color: var(--memdecl-template-color); + font-size: 80%; + line-height: 120%; +} + +/* @group Code Colorization */ + +span.keyword { + color: var(--code-keyword-color); +} + +span.keywordtype { + color: var(--code-type-keyword-color); +} + +span.keywordflow { + color: var(--code-flow-keyword-color); +} + +span.comment { + color: var(--code-comment-color); +} + +span.preprocessor { + color: var(--code-preprocessor-color); +} + +span.stringliteral { + color: var(--code-string-literal-color); +} + +span.charliteral { + color: var(--code-char-literal-color); +} + +span.xmlcdata { + color: var(--code-xml-cdata-color); +} + +span.vhdldigit { + color: var(--code-vhdl-digit-color); +} + +span.vhdlchar { + color: var(--code-vhdl-char-color); +} + +span.vhdlkeyword { + color: var(--code-vhdl-keyword-color); +} + +span.vhdllogic { + color: var(--code-vhdl-logic-color); +} + +blockquote { + background-color: var(--blockquote-background-color); + border-left: 2px solid var(--blockquote-border-color); + margin: 0 24px 0 4px; + padding: 0 12px 0 16px; +} + +/* @end */ + +td.tiny { + font-size: 75%; +} + +.dirtab { + padding: 4px; + border-collapse: collapse; + border: 1px solid var(--table-cell-border-color); +} + +th.dirtab { + background-color: var(--table-header-background-color); + color: var(--table-header-foreground-color); + font-weight: bold; +} + +hr { + height: 0px; + border: none; + border-top: 1px solid var(--separator-color); +} + +hr.footer { + height: 1px; +} + +/* @group Member Descriptions */ + +table.memberdecls { + border-spacing: 0px; + padding: 0px; +} + +.memberdecls td, .fieldtable tr { + -webkit-transition-property: background-color, box-shadow; + -webkit-transition-duration: 0.5s; + -moz-transition-property: background-color, box-shadow; + -moz-transition-duration: 0.5s; + -ms-transition-property: background-color, box-shadow; + -ms-transition-duration: 0.5s; + -o-transition-property: background-color, box-shadow; + -o-transition-duration: 0.5s; + transition-property: background-color, box-shadow; + transition-duration: 0.5s; +} + +.memberdecls td.glow, .fieldtable tr.glow { + background-color: var(--glow-color); + box-shadow: 0 0 15px var(--glow-color); +} + +.mdescLeft, .mdescRight, +.memItemLeft, .memItemRight, +.memTemplItemLeft, .memTemplItemRight, .memTemplParams { + background-color: var(--memdecl-background-color); + border: none; + margin: 4px; + padding: 1px 0 0 8px; +} + +.mdescLeft, .mdescRight { + padding: 0px 8px 4px 8px; + color: var(--memdecl-foreground-color); +} + +.memSeparator { + border-bottom: 1px solid var(--memdecl-separator-color); + line-height: 1px; + margin: 0px; + padding: 0px; +} + +.memItemLeft, .memTemplItemLeft { + white-space: nowrap; +} + +.memItemRight, .memTemplItemRight { + width: 100%; +} + +.memTemplParams { + color: var(--memdecl-template-color); + white-space: nowrap; + font-size: 80%; +} + +/* @end */ + +/* @group Member Details */ + +/* Styles for detailed member documentation */ + +.memtitle { + padding: 8px; + border-top: 1px solid var(--memdef-border-color); + border-left: 1px solid var(--memdef-border-color); + border-right: 1px solid var(--memdef-border-color); + border-top-right-radius: 4px; + border-top-left-radius: 4px; + margin-bottom: -1px; + background-image: var(--memdef-title-gradient-image); + background-repeat: repeat-x; + background-color: var(--memdef-title-background-color); + line-height: 1.25; + font-weight: 300; + float:left; +} + +.permalink +{ + font-size: 65%; + display: inline-block; + vertical-align: middle; +} + +.memtemplate { + font-size: 80%; + color: var(--memdef-template-color); + font-weight: normal; + margin-left: 9px; +} + +.mempage { + width: 100%; +} + +.memitem { + padding: 0; + margin-bottom: 10px; + margin-right: 5px; + -webkit-transition: box-shadow 0.5s linear; + -moz-transition: box-shadow 0.5s linear; + -ms-transition: box-shadow 0.5s linear; + -o-transition: box-shadow 0.5s linear; + transition: box-shadow 0.5s linear; + display: table !important; + width: 100%; +} + +.memitem.glow { + box-shadow: 0 0 15px var(--glow-color); +} + +.memname { + font-weight: 400; + margin-left: 6px; +} + +.memname td { + vertical-align: bottom; +} + +.memproto, dl.reflist dt { + border-top: 1px solid var(--memdef-border-color); + border-left: 1px solid var(--memdef-border-color); + border-right: 1px solid var(--memdef-border-color); + padding: 6px 0px 6px 0px; + color: var(--memdef-proto-text-color); + font-weight: bold; + text-shadow: var(--memdef-proto-text-shadow); + background-color: var(--memdef-proto-background-color); + box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + border-top-right-radius: 4px; +} + +.overload { + font-family: var(--font-family-monospace); + font-size: 65%; +} + +.memdoc, dl.reflist dd { + border-bottom: 1px solid var(--memdef-border-color); + border-left: 1px solid var(--memdef-border-color); + border-right: 1px solid var(--memdef-border-color); + padding: 6px 10px 2px 10px; + border-top-width: 0; + background-image:url('nav_g.png'); + background-repeat:repeat-x; + background-color: var(--memdef-doc-background-color); + /* opera specific markup */ + border-bottom-left-radius: 4px; + border-bottom-right-radius: 4px; + box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + /* firefox specific markup */ + -moz-border-radius-bottomleft: 4px; + -moz-border-radius-bottomright: 4px; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; + /* webkit specific markup */ + -webkit-border-bottom-left-radius: 4px; + -webkit-border-bottom-right-radius: 4px; + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); +} + +dl.reflist dt { + padding: 5px; +} + +dl.reflist dd { + margin: 0px 0px 10px 0px; + padding: 5px; +} + +.paramkey { + text-align: right; +} + +.paramtype { + white-space: nowrap; + padding: 0px; + padding-bottom: 1px; +} + +.paramname { + white-space: nowrap; + padding: 0px; + padding-bottom: 1px; + margin-left: 2px; +} + +.paramname em { + color: var(--memdef-param-name-color); + font-style: normal; + margin-right: 1px; +} + +.paramname .paramdefval { + font-family: var(--font-family-monospace); +} + +.params, .retval, .exception, .tparams { + margin-left: 0px; + padding-left: 0px; +} + +.params .paramname, .retval .paramname, .tparams .paramname, .exception .paramname { + font-weight: bold; + vertical-align: top; +} + +.params .paramtype, .tparams .paramtype { + font-style: italic; + vertical-align: top; +} + +.params .paramdir, .tparams .paramdir { + font-family: var(--font-family-monospace); + vertical-align: top; +} + +table.mlabels { + border-spacing: 0px; +} + +td.mlabels-left { + width: 100%; + padding: 0px; +} + +td.mlabels-right { + vertical-align: bottom; + padding: 0px; + white-space: nowrap; +} + +span.mlabels { + margin-left: 8px; +} + +span.mlabel { + background-color: var(--label-background-color); + border-top:1px solid var(--label-left-top-border-color); + border-left:1px solid var(--label-left-top-border-color); + border-right:1px solid var(--label-right-bottom-border-color); + border-bottom:1px solid var(--label-right-bottom-border-color); + text-shadow: none; + color: var(--label-foreground-color); + margin-right: 4px; + padding: 2px 3px; + border-radius: 3px; + font-size: 7pt; + white-space: nowrap; + vertical-align: middle; +} + + + +/* @end */ + +/* these are for tree view inside a (index) page */ + +div.directory { + margin: 10px 0px; + border-top: 1px solid var(--directory-separator-color); + border-bottom: 1px solid var(--directory-separator-color); + width: 100%; +} + +.directory table { + border-collapse:collapse; +} + +.directory td { + margin: 0px; + padding: 0px; + vertical-align: top; +} + +.directory td.entry { + white-space: nowrap; + padding-right: 6px; + padding-top: 3px; +} + +.directory td.entry a { + outline:none; +} + +.directory td.entry a img { + border: none; +} + +.directory td.desc { + width: 100%; + padding-left: 6px; + padding-right: 6px; + padding-top: 3px; + border-left: 1px solid rgba(0,0,0,0.05); +} + +.directory tr.odd { + padding-left: 6px; + background-color: var(--index-odd-item-bg-color); +} + +.directory tr.even { + padding-left: 6px; + background-color: var(--index-even-item-bg-color); +} + +.directory img { + vertical-align: -30%; +} + +.directory .levels { + white-space: nowrap; + width: 100%; + text-align: right; + font-size: 9pt; +} + +.directory .levels span { + cursor: pointer; + padding-left: 2px; + padding-right: 2px; + color: var(--page-link-color); +} + +.arrow { + color: var(--nav-arrow-color); + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; + cursor: pointer; + font-size: 80%; + display: inline-block; + width: 16px; + height: 22px; +} + +.icon { + font-family: var(--font-family-icon); + line-height: normal; + font-weight: bold; + font-size: 12px; + height: 14px; + width: 16px; + display: inline-block; + background-color: var(--icon-background-color); + color: var(--icon-foreground-color); + text-align: center; + border-radius: 4px; + margin-left: 2px; + margin-right: 2px; +} + +.icona { + width: 24px; + height: 22px; + display: inline-block; +} + +.iconfopen { + width: 24px; + height: 18px; + margin-bottom: 4px; + background-image:var(--icon-folder-open-image); + background-repeat: repeat-y; + vertical-align:top; + display: inline-block; +} + +.iconfclosed { + width: 24px; + height: 18px; + margin-bottom: 4px; + background-image:var(--icon-folder-closed-image); + background-repeat: repeat-y; + vertical-align:top; + display: inline-block; +} + +.icondoc { + width: 24px; + height: 18px; + margin-bottom: 4px; + background-image:var(--icon-doc-image); + background-position: 0px -4px; + background-repeat: repeat-y; + vertical-align:top; + display: inline-block; +} + +/* @end */ + +div.dynheader { + margin-top: 8px; + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +address { + font-style: normal; + color: var(--footer-foreground-color); +} + +table.doxtable caption { + caption-side: top; +} + +table.doxtable { + border-collapse:collapse; + margin-top: 4px; + margin-bottom: 4px; +} + +table.doxtable td, table.doxtable th { + border: 1px solid var(--table-cell-border-color); + padding: 3px 7px 2px; +} + +table.doxtable th { + background-color: var(--table-header-background-color); + color: var(--table-header-foreground-color); + font-size: 110%; + padding-bottom: 4px; + padding-top: 5px; +} + +table.fieldtable { + margin-bottom: 10px; + border: 1px solid var(--memdef-border-color); + border-spacing: 0px; + border-radius: 4px; + box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); +} + +.fieldtable td, .fieldtable th { + padding: 3px 7px 2px; +} + +.fieldtable td.fieldtype, .fieldtable td.fieldname, .fieldtable td.fieldinit { + white-space: nowrap; + border-right: 1px solid var(--memdef-border-color); + border-bottom: 1px solid var(--memdef-border-color); + vertical-align: top; +} + +.fieldtable td.fieldname { + padding-top: 3px; +} + +.fieldtable td.fieldinit { + padding-top: 3px; + text-align: right; +} + + +.fieldtable td.fielddoc { + border-bottom: 1px solid var(--memdef-border-color); +} + +.fieldtable td.fielddoc p:first-child { + margin-top: 0px; +} + +.fieldtable td.fielddoc p:last-child { + margin-bottom: 2px; +} + +.fieldtable tr:last-child td { + border-bottom: none; +} + +.fieldtable th { + background-image: var(--memdef-title-gradient-image); + background-repeat:repeat-x; + background-color: var(--memdef-title-background-color); + font-size: 90%; + color: var(--memdef-proto-text-color); + padding-bottom: 4px; + padding-top: 5px; + text-align:left; + font-weight: 400; + border-top-left-radius: 4px; + border-top-right-radius: 4px; + border-bottom: 1px solid var(--memdef-border-color); +} + + +.tabsearch { + top: 0px; + left: 10px; + height: 36px; + background-image: var(--nav-gradient-image); + z-index: 101; + overflow: hidden; + font-size: 13px; +} + +.navpath ul +{ + font-size: 11px; + background-image: var(--nav-gradient-image); + background-repeat:repeat-x; + background-position: 0 -5px; + height:30px; + line-height:30px; + color:var(--nav-text-normal-color); + border:solid 1px var(--nav-breadcrumb-border-color); + overflow:hidden; + margin:0px; + padding:0px; +} + +.navpath li +{ + list-style-type:none; + float:left; + padding-left:10px; + padding-right:15px; + background-image:var(--nav-breadcrumb-image); + background-repeat:no-repeat; + background-position:right; + color: var(--nav-foreground-color); +} + +.navpath li.navelem a +{ + height:32px; + display:block; + outline: none; + color: var(--nav-text-normal-color); + font-family: var(--font-family-nav); + text-shadow: var(--nav-text-normal-shadow); + text-decoration: none; +} + +.navpath li.navelem a:hover +{ + color: var(--nav-text-hover-color); + text-shadow: var(--nav-text-hover-shadow); +} + +.navpath li.footer +{ + list-style-type:none; + float:right; + padding-left:10px; + padding-right:15px; + background-image:none; + background-repeat:no-repeat; + background-position:right; + color: var(--footer-foreground-color); + font-size: 8pt; +} + + +div.summary +{ + float: right; + font-size: 8pt; + padding-right: 5px; + width: 50%; + text-align: right; +} + +div.summary a +{ + white-space: nowrap; +} + +table.classindex +{ + margin: 10px; + white-space: nowrap; + margin-left: 3%; + margin-right: 3%; + width: 94%; + border: 0; + border-spacing: 0; + padding: 0; +} + +div.ingroups +{ + font-size: 8pt; + width: 50%; + text-align: left; +} + +div.ingroups a +{ + white-space: nowrap; +} + +div.header +{ + background-image: var(--header-gradient-image); + background-repeat:repeat-x; + background-color: var(--header-background-color); + margin: 0px; + border-bottom: 1px solid var(--header-separator-color); +} + +div.headertitle +{ + padding: 5px 5px 5px 10px; +} + +.PageDocRTL-title div.headertitle { + text-align: right; + direction: rtl; +} + +dl { + padding: 0 0 0 0; +} + +/* + +dl.section { + margin-left: 0px; + padding-left: 0px; +} + +dl.note { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #D0C000; +} + +dl.warning, dl.attention, dl.important { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #FF0000; +} + +dl.pre, dl.post, dl.invariant { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #00D000; +} + +dl.deprecated { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #505050; +} + +dl.todo { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #00C0E0; +} + +dl.test { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #3030E0; +} + +dl.bug { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #C08050; +} + +*/ + +dl.bug dt a, dl.deprecated dt a, dl.todo dt a, dl.test a { + font-weight: bold !important; +} + +dl.warning, dl.attention, dl.important, dl.note, dl.deprecated, dl.bug, +dl.invariant, dl.pre, dl.post, dl.todo, dl.test, dl.remark { + padding: 10px; + margin: 10px 0px; + overflow: hidden; + margin-left: 0; + border-radius: 4px; +} + +dl.section dd { + margin-bottom: 2px; +} + +dl.warning, dl.attention, dl.important { + background: var(--warning-color-bg); + border-left: 8px solid var(--warning-color-hl); + color: var(--warning-color-text); +} + +dl.warning dt, dl.attention dt, dl.important dt { + color: var(--warning-color-hl); +} + +dl.note, dl.remark { + background: var(--note-color-bg); + border-left: 8px solid var(--note-color-hl); + color: var(--note-color-text); +} + +dl.note dt, dl.remark dt { + color: var(--note-color-hl); +} + +dl.todo { + background: var(--todo-color-bg); + border-left: 8px solid var(--todo-color-hl); + color: var(--todo-color-text); +} + +dl.todo dt { + color: var(--todo-color-hl); +} + +dl.test { + background: var(--test-color-bg); + border-left: 8px solid var(--test-color-hl); + color: var(--test-color-text); +} + +dl.test dt { + color: var(--test-color-hl); +} + +dl.bug dt a { + color: var(--bug-color-hl) !important; +} + +dl.bug { + background: var(--bug-color-bg); + border-left: 8px solid var(--bug-color-hl); + color: var(--bug-color-text); +} + +dl.bug dt a { + color: var(--bug-color-hl) !important; +} + +dl.deprecated { + background: var(--deprecated-color-bg); + border-left: 8px solid var(--deprecated-color-hl); + color: var(--deprecated-color-text); +} + +dl.deprecated dt a { + color: var(--deprecated-color-hl) !important; +} + +dl.note dd, dl.warning dd, dl.pre dd, dl.post dd, +dl.remark dd, dl.attention dd, dl.important dd, dl.invariant dd, +dl.bug dd, dl.deprecated dd, dl.todo dd, dl.test dd { + margin-inline-start: 0px; +} + +dl.invariant, dl.pre, dl.post { + background: var(--invariant-color-bg); + border-left: 8px solid var(--invariant-color-hl); + color: var(--invariant-color-text); +} + +dl.invariant dt, dl.pre dt, dl.post dt { + color: var(--invariant-color-hl); +} + + +#projectrow +{ + height: 56px; +} + +#projectlogo +{ + text-align: center; + vertical-align: bottom; + border-collapse: separate; +} + +#projectlogo img +{ + border: 0px none; +} + +#projectalign +{ + vertical-align: middle; + padding-left: 0.5em; +} + +#projectname +{ + font-size: 200%; + font-family: var(--font-family-title); + margin: 0px; + padding: 2px 0px; +} + +#projectbrief +{ + font-size: 90%; + font-family: var(--font-family-title); + margin: 0px; + padding: 0px; +} + +#projectnumber +{ + font-size: 50%; + font-family: 50% var(--font-family-title); + margin: 0px; + padding: 0px; +} + +#titlearea +{ + padding: 0px; + margin: 0px; + width: 100%; + border-bottom: 1px solid var(--title-separator-color); + background-color: var(--title-background-color); +} + +.image +{ + text-align: center; +} + +.dotgraph +{ + text-align: center; +} + +.mscgraph +{ + text-align: center; +} + +.plantumlgraph +{ + text-align: center; +} + +.diagraph +{ + text-align: center; +} + +.caption +{ + font-weight: bold; +} + +dl.citelist { + margin-bottom:50px; +} + +dl.citelist dt { + color:var(--citation-label-color); + float:left; + font-weight:bold; + margin-right:10px; + padding:5px; + text-align:right; + width:52px; +} + +dl.citelist dd { + margin:2px 0 2px 72px; + padding:5px 0; +} + +div.toc { + padding: 14px 25px; + background-color: var(--toc-background-color); + border: 1px solid var(--toc-border-color); + border-radius: 7px 7px 7px 7px; + float: right; + height: auto; + margin: 0 8px 10px 10px; + width: 200px; +} + +div.toc li { + background: var(--toc-down-arrow-image) no-repeat scroll 0 5px transparent; + font: 10px/1.2 var(--font-family-toc); + margin-top: 5px; + padding-left: 10px; + padding-top: 2px; +} + +div.toc h3 { + font: bold 12px/1.2 var(--font-family-toc); + color: var(--toc-header-color); + border-bottom: 0 none; + margin: 0; +} + +div.toc ul { + list-style: none outside none; + border: medium none; + padding: 0px; +} + +div.toc li[class^='level'] { + margin-left: 15px; +} + +div.toc li.level1 { + margin-left: 0px; +} + +div.toc li.empty { + background-image: none; + margin-top: 0px; +} + +span.emoji { + /* font family used at the site: https://unicode.org/emoji/charts/full-emoji-list.html + * font-family: "Noto Color Emoji", "Apple Color Emoji", "Segoe UI Emoji", Times, Symbola, Aegyptus, Code2000, Code2001, Code2002, Musica, serif, LastResort; + */ +} + +span.obfuscator { + display: none; +} + +.inherit_header { + font-weight: bold; + color: var(--inherit-header-color); + cursor: pointer; + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +.inherit_header td { + padding: 6px 0px 2px 5px; +} + +.inherit { + display: none; +} + +tr.heading h2 { + margin-top: 12px; + margin-bottom: 4px; +} + +/* tooltip related style info */ + +.ttc { + position: absolute; + display: none; +} + +#powerTip { + cursor: default; + /*white-space: nowrap;*/ + color: var(--tooltip-foreground-color); + background-color: var(--tooltip-background-color); + border: 1px solid var(--tooltip-border-color); + border-radius: 4px 4px 4px 4px; + box-shadow: var(--tooltip-shadow); + display: none; + font-size: smaller; + max-width: 80%; + opacity: 0.9; + padding: 1ex 1em 1em; + position: absolute; + z-index: 2147483647; +} + +#powerTip div.ttdoc { + color: var(--tooltip-doc-color); + font-style: italic; +} + +#powerTip div.ttname a { + font-weight: bold; +} + +#powerTip a { + color: var(--tooltip-link-color); +} + +#powerTip div.ttname { + font-weight: bold; +} + +#powerTip div.ttdeci { + color: var(--tooltip-declaration-color); +} + +#powerTip div { + margin: 0px; + padding: 0px; + font-size: 12px; + font-family: var(--font-family-tooltip); + line-height: 16px; +} + +#powerTip:before, #powerTip:after { + content: ""; + position: absolute; + margin: 0px; +} + +#powerTip.n:after, #powerTip.n:before, +#powerTip.s:after, #powerTip.s:before, +#powerTip.w:after, #powerTip.w:before, +#powerTip.e:after, #powerTip.e:before, +#powerTip.ne:after, #powerTip.ne:before, +#powerTip.se:after, #powerTip.se:before, +#powerTip.nw:after, #powerTip.nw:before, +#powerTip.sw:after, #powerTip.sw:before { + border: solid transparent; + content: " "; + height: 0; + width: 0; + position: absolute; +} + +#powerTip.n:after, #powerTip.s:after, +#powerTip.w:after, #powerTip.e:after, +#powerTip.nw:after, #powerTip.ne:after, +#powerTip.sw:after, #powerTip.se:after { + border-color: rgba(255, 255, 255, 0); +} + +#powerTip.n:before, #powerTip.s:before, +#powerTip.w:before, #powerTip.e:before, +#powerTip.nw:before, #powerTip.ne:before, +#powerTip.sw:before, #powerTip.se:before { + border-color: rgba(128, 128, 128, 0); +} + +#powerTip.n:after, #powerTip.n:before, +#powerTip.ne:after, #powerTip.ne:before, +#powerTip.nw:after, #powerTip.nw:before { + top: 100%; +} + +#powerTip.n:after, #powerTip.ne:after, #powerTip.nw:after { + border-top-color: var(--tooltip-background-color); + border-width: 10px; + margin: 0px -10px; +} +#powerTip.n:before, #powerTip.ne:before, #powerTip.nw:before { + border-top-color: var(--tooltip-border-color); + border-width: 11px; + margin: 0px -11px; +} +#powerTip.n:after, #powerTip.n:before { + left: 50%; +} + +#powerTip.nw:after, #powerTip.nw:before { + right: 14px; +} + +#powerTip.ne:after, #powerTip.ne:before { + left: 14px; +} + +#powerTip.s:after, #powerTip.s:before, +#powerTip.se:after, #powerTip.se:before, +#powerTip.sw:after, #powerTip.sw:before { + bottom: 100%; +} + +#powerTip.s:after, #powerTip.se:after, #powerTip.sw:after { + border-bottom-color: var(--tooltip-background-color); + border-width: 10px; + margin: 0px -10px; +} + +#powerTip.s:before, #powerTip.se:before, #powerTip.sw:before { + border-bottom-color: var(--tooltip-border-color); + border-width: 11px; + margin: 0px -11px; +} + +#powerTip.s:after, #powerTip.s:before { + left: 50%; +} + +#powerTip.sw:after, #powerTip.sw:before { + right: 14px; +} + +#powerTip.se:after, #powerTip.se:before { + left: 14px; +} + +#powerTip.e:after, #powerTip.e:before { + left: 100%; +} +#powerTip.e:after { + border-left-color: var(--tooltip-border-color); + border-width: 10px; + top: 50%; + margin-top: -10px; +} +#powerTip.e:before { + border-left-color: var(--tooltip-border-color); + border-width: 11px; + top: 50%; + margin-top: -11px; +} + +#powerTip.w:after, #powerTip.w:before { + right: 100%; +} +#powerTip.w:after { + border-right-color: var(--tooltip-border-color); + border-width: 10px; + top: 50%; + margin-top: -10px; +} +#powerTip.w:before { + border-right-color: var(--tooltip-border-color); + border-width: 11px; + top: 50%; + margin-top: -11px; +} + +@media print +{ + #top { display: none; } + #side-nav { display: none; } + #nav-path { display: none; } + body { overflow:visible; } + h1, h2, h3, h4, h5, h6 { page-break-after: avoid; } + .summary { display: none; } + .memitem { page-break-inside: avoid; } + #doc-content + { + margin-left:0 !important; + height:auto !important; + width:auto !important; + overflow:inherit; + display:inline; + } +} + +/* @group Markdown */ + +table.markdownTable { + border-collapse:collapse; + margin-top: 4px; + margin-bottom: 4px; +} + +table.markdownTable td, table.markdownTable th { + border: 1px solid var(--table-cell-border-color); + padding: 3px 7px 2px; +} + +table.markdownTable tr { +} + +th.markdownTableHeadLeft, th.markdownTableHeadRight, th.markdownTableHeadCenter, th.markdownTableHeadNone { + background-color: var(--table-header-background-color); + color: var(--table-header-foreground-color); + font-size: 110%; + padding-bottom: 4px; + padding-top: 5px; +} + +th.markdownTableHeadLeft, td.markdownTableBodyLeft { + text-align: left +} + +th.markdownTableHeadRight, td.markdownTableBodyRight { + text-align: right +} + +th.markdownTableHeadCenter, td.markdownTableBodyCenter { + text-align: center +} + +tt, code, kbd, samp +{ + display: inline-block; +} +/* @end */ + +u { + text-decoration: underline; +} + +details>summary { + list-style-type: none; +} + +details > summary::-webkit-details-marker { + display: none; +} + +details>summary::before { + content: "\25ba"; + padding-right:4px; + font-size: 80%; +} + +details[open]>summary::before { + content: "\25bc"; + padding-right:4px; + font-size: 80%; +} + +body { + scrollbar-color: var(--scrollbar-thumb-color) var(--scrollbar-background-color); +} + +::-webkit-scrollbar { + background-color: var(--scrollbar-background-color); + height: 12px; + width: 12px; +} +::-webkit-scrollbar-thumb { + border-radius: 6px; + box-shadow: inset 0 0 12px 12px var(--scrollbar-thumb-color); + border: solid 2px transparent; +} +::-webkit-scrollbar-corner { + background-color: var(--scrollbar-background-color); +} + diff --git a/docs/html/doxygen.svg b/docs/html/doxygen.svg new file mode 100644 index 00000000..79a76354 --- /dev/null +++ b/docs/html/doxygen.svg @@ -0,0 +1,28 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/docs/html/doxygen_crawl.html b/docs/html/doxygen_crawl.html new file mode 100644 index 00000000..228aa380 --- /dev/null +++ b/docs/html/doxygen_crawl.html @@ -0,0 +1,2478 @@ + + + +Validator / crawler helper + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/docs/html/dynsections.js b/docs/html/dynsections.js new file mode 100644 index 00000000..b05f4c8d --- /dev/null +++ b/docs/html/dynsections.js @@ -0,0 +1,198 @@ +/* + @licstart The following is the entire license notice for the JavaScript code in this file. + + The MIT License (MIT) + + Copyright (C) 1997-2020 by Dimitri van Heesch + + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: + + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file + */ + +function toggleVisibility(linkObj) { + return dynsection.toggleVisibility(linkObj); +} + +let dynsection = { + + // helper function + updateStripes : function() { + $('table.directory tr'). + removeClass('even').filter(':visible:even').addClass('even'); + $('table.directory tr'). + removeClass('odd').filter(':visible:odd').addClass('odd'); + }, + + toggleVisibility : function(linkObj) { + const base = $(linkObj).attr('id'); + const summary = $('#'+base+'-summary'); + const content = $('#'+base+'-content'); + const trigger = $('#'+base+'-trigger'); + const src=$(trigger).attr('src'); + if (content.is(':visible')===true) { + content.hide(); + summary.show(); + $(linkObj).addClass('closed').removeClass('opened'); + $(trigger).attr('src',src.substring(0,src.length-8)+'closed.png'); + } else { + content.show(); + summary.hide(); + $(linkObj).removeClass('closed').addClass('opened'); + $(trigger).attr('src',src.substring(0,src.length-10)+'open.png'); + } + return false; + }, + + toggleLevel : function(level) { + $('table.directory tr').each(function() { + const l = this.id.split('_').length-1; + const i = $('#img'+this.id.substring(3)); + const a = $('#arr'+this.id.substring(3)); + if (l'); + // add vertical lines to other rows + $('span[class=lineno]').not(':eq(0)').append(''); + // add toggle controls to lines with fold divs + $('div[class=foldopen]').each(function() { + // extract specific id to use + const id = $(this).attr('id').replace('foldopen',''); + // extract start and end foldable fragment attributes + const start = $(this).attr('data-start'); + const end = $(this).attr('data-end'); + // replace normal fold span with controls for the first line of a foldable fragment + $(this).find('span[class=fold]:first').replaceWith(''); + // append div for folded (closed) representation + $(this).after(''); + // extract the first line from the "open" section to represent closed content + const line = $(this).children().first().clone(); + // remove any glow that might still be active on the original line + $(line).removeClass('glow'); + if (start) { + // if line already ends with a start marker (e.g. trailing {), remove it + $(line).html($(line).html().replace(new RegExp('\\s*'+start+'\\s*$','g'),'')); + } + // replace minus with plus symbol + $(line).find('span[class=fold]').css('background-image',codefold.plusImg[relPath]); + // append ellipsis + $(line).append(' '+start+'…'+end); + // insert constructed line into closed div + $('#foldclosed'+id).html(line); + }); + }, +}; +/* @license-end */ diff --git a/docs/html/files.html b/docs/html/files.html new file mode 100644 index 00000000..39ee52ca --- /dev/null +++ b/docs/html/files.html @@ -0,0 +1,174 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File List + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
File List
+
+
+
Here is a list of all files with brief descriptions:
+
[detail level 1234]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
 ▼ cpp
 ▼ app
 ► gen_mi
 ► generate_quad
 ► gkpSparse
 ► gp_regr
 ► model_inf
 ► pce_eval
 ► pce_quad
 ► pce_rv
 ► pce_sens
 ► pdf_cl
 ► regression
 ► sens
 ▼ lib
 ► array
 ► bcs
 ► dfi
 ► gproc
 ► infer
 ► kle
 ► lreg
 ► mcmc
 ► pce
 ► quad
 ► tools
 ► xmlutils
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/folderclosed.svg b/docs/html/folderclosed.svg new file mode 100644 index 00000000..b04bed2e --- /dev/null +++ b/docs/html/folderclosed.svg @@ -0,0 +1,11 @@ + + + + + + + + + + diff --git a/docs/html/folderclosedd.svg b/docs/html/folderclosedd.svg new file mode 100644 index 00000000..52f0166a --- /dev/null +++ b/docs/html/folderclosedd.svg @@ -0,0 +1,11 @@ + + + + + + + + + + diff --git a/docs/html/folderopen.svg b/docs/html/folderopen.svg new file mode 100644 index 00000000..f6896dd2 --- /dev/null +++ b/docs/html/folderopen.svg @@ -0,0 +1,17 @@ + + + + + + + + + + diff --git a/docs/html/folderopend.svg b/docs/html/folderopend.svg new file mode 100644 index 00000000..2d1f06e7 --- /dev/null +++ b/docs/html/folderopend.svg @@ -0,0 +1,12 @@ + + + + + + + + + + + diff --git a/docs/html/func_8cpp.html b/docs/html/func_8cpp.html new file mode 100644 index 00000000..e573abe3 --- /dev/null +++ b/docs/html/func_8cpp.html @@ -0,0 +1,699 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: func.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
func.cpp File Reference
+
+
+ +

Implements several functions of form $y=f(\lambda;x)$. +More...

+
#include <math.h>
+#include <cfloat>
+#include <assert.h>
+#include "func.h"
+#include "gen_defs.h"
+#include "PCSet.h"
+#include "error_handlers.h"
+#include "arrayio.h"
+#include "arraytools.h"
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

Array2D< double > Func_Prop (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=\lambda x$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^1$
 
Array2D< double > Func_PropQuad (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=\lambda_1 x+\lambda_2x^2$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$
 
Array2D< double > Func_Exp (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=e^{\lambda_1 +\lambda_2x}$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$
 
Array2D< double > Func_ExpQuad (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=e^{\lambda_1 +\lambda_2x+\lambda_3x^2}$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^3$
 
Array2D< double > Func_Const (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=\lambda$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^1$
 
Array2D< double > Func_Linear (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=\lambda_1+\lambda_2x$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$
 
Array2D< double > Func_BB (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)$ a black-box function with a script bb.x which takes p.dat and x.dat and returns output in y.dat
 
Array2D< double > Func_HT1 (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 Heat_transfer1: a custom model designed for a tutorial case of a heat conduction problem.
 
Array2D< double > Func_HT2 (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 Heat_transfer2: a custom model designed for a tutorial case of a heat conduction problem.
 
Array2D< double > Func_FracPower (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=\lambda_1+\lambda_2 x+\lambda_3 x^2+ \lambda_4 (x+1)^{3.5}$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^4$
 
Array2D< double > Func_ExpSketch (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=\lambda_2 e^{\lambda_1 x} - 2$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$
 
Array2D< double > Func_Inputs (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x_i)=\lambda_i$ for $i=1,...,d$, $x_i\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^d$
 
Array2D< double > Func_PCl (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 Legendre PC expansion with $\lambda$'s as coefficients.
 
Array2D< double > Func_PCx (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 Legendre PC expansion with respect to $z=(\lambda,x)$.
 
Array2D< double > Func_PC (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 Legendre PC expansion for each value of $x$.
 
Array2D< double > Func_PCs (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 Legendre PC expansion for each value of $x$.
 
Array2D< double > augment (Array2D< double > &p, Array2D< double > &fixindnom)
 Augments a parameter matrix with 'fixed' columns given indices and nominal values of those.
 
+

Detailed Description

+

Implements several functions of form $y=f(\lambda;x)$.

+

Function Documentation

+ +

◆ augment()

+ +
+
+ + + + + + + + + + + +
Array2D< double > augment (Array2D< double > & p,
Array2D< double > & fixindnom )
+
+ +

Augments a parameter matrix with 'fixed' columns given indices and nominal values of those.

+ +
+
+ +

◆ Func_BB()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_BB (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)$ a black-box function with a script bb.x which takes p.dat and x.dat and returns output in y.dat

+ +
+
+ +

◆ Func_Const()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_Const (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=\lambda$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^1$

+ +
+
+ +

◆ Func_Exp()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_Exp (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=e^{\lambda_1 +\lambda_2x}$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$

+ +
+
+ +

◆ Func_ExpQuad()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_ExpQuad (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=e^{\lambda_1 +\lambda_2x+\lambda_3x^2}$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^3$

+ +
+
+ +

◆ Func_ExpSketch()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_ExpSketch (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=\lambda_2 e^{\lambda_1 x} - 2$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$

+ +
+
+ +

◆ Func_FracPower()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_FracPower (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=\lambda_1+\lambda_2 x+\lambda_3 x^2+ \lambda_4 (x+1)^{3.5}$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^4$

+ +
+
+ +

◆ Func_HT1()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_HT1 (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

Heat_transfer1: a custom model designed for a tutorial case of a heat conduction problem.

+

$y=f(\lambda;x)=\frac{x d_w}{A_w \lambda}+T_0$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^1$

Note
hardwired parameters: $d_w=0.1, A_w=0.04, T_0=273$
+ +
+
+ +

◆ Func_HT2()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_HT2 (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

Heat_transfer2: a custom model designed for a tutorial case of a heat conduction problem.

+

$y=f(\lambda;x)=\frac{x Q}{A_w \lambda_1}+\lambda_2$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$

Note
hardwired parameters: $A_w=0.04, Q=20.0$
+ +
+
+ +

◆ Func_Inputs()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_Inputs (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x_i)=\lambda_i$ for $i=1,...,d$, $x_i\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^d$

+ +
+
+ +

◆ Func_Linear()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_Linear (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=\lambda_1+\lambda_2x$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$

+ +
+
+ +

◆ Func_PC()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_PC (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

Legendre PC expansion for each value of $x$.

+

$y=f(\lambda;x^{(i)})=\sum_{\alpha\in{\cal S}} c_{\alpha,i} \Psi_\alpha(\lambda)$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^d$

Note
hardwired parameters: common multiindex set for all PCs ${\cal S}$ is given in a file mindexp.dat, coefficients $c_{\alpha,i}$ are given in a file pccf_all.dat
+ +
+
+ +

◆ Func_PCl()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_PCl (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

Legendre PC expansion with $\lambda$'s as coefficients.

+

$y=f(\lambda;x)=\sum_{\alpha\in{\cal S}} \lambda_\alpha \Psi_\alpha(x)$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^{|{\cal S}|}$

Note
hardwired parameter: multiindex set ${\cal S}$ is given in a file mindexx.dat
+ +
+
+ +

◆ Func_PCs()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_PCs (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

Legendre PC expansion for each value of $x$.

+

$y=f(\lambda;x^{(i)})=\sum_{\alpha\in{\cal S}_i} c_{\alpha,i} \Psi_\alpha(\lambda)$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^d$

Note
hardwired parameters: multiindex sets for all PCs ${\cal S}$ are given in files mindexp.i.dat, coefficients $c_{\alpha,i}$ are given in files pccfp.i.dat
+ +
+
+ +

◆ Func_PCx()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_PCx (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

Legendre PC expansion with respect to $z=(\lambda,x)$.

+

$y=f(\lambda;x)=\sum_{\alpha\in{\cal S}} c_\alpha \Psi_\alpha(\lambda,x)$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^d$

Note
hardwired parameters: multiindex set ${\cal S}$ is given in a file mindexpx.dat, coefficients $c_\alpha$ given in a file pccfpx.dat
+ +
+
+ +

◆ Func_Prop()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_Prop (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=\lambda x$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^1$

+ +
+
+ +

◆ Func_PropQuad()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_PropQuad (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=\lambda_1 x+\lambda_2x^2$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/func_8h.html b/docs/html/func_8h.html new file mode 100644 index 00000000..daef3830 --- /dev/null +++ b/docs/html/func_8h.html @@ -0,0 +1,708 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: func.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
func.h File Reference
+
+
+ +

Header for implementation of functions of form $y=f(\lambda;x)$. +More...

+
#include "Array1D.h"
+#include "Array2D.h"
+#include <iostream>
+#include <string.h>
+#include <stdio.h>
+#include <sstream>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

Array2D< double > Func_Prop (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=\lambda x$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^1$
 
Array2D< double > Func_PropQuad (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=\lambda_1 x+\lambda_2x^2$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$
 
Array2D< double > Func_Exp (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=e^{\lambda_1 +\lambda_2x}$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$
 
Array2D< double > Func_ExpQuad (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=e^{\lambda_1 +\lambda_2x+\lambda_3x^2}$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^3$
 
Array2D< double > Func_Const (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=\lambda$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^1$
 
Array2D< double > Func_Linear (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=\lambda_1+\lambda_2x$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$
 
Array2D< double > Func_BB (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)$ a black-box function with a script bb.x which takes p.dat and x.dat and returns output in y.dat
 
Array2D< double > Func_HT1 (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 Heat_transfer1: a custom model designed for a tutorial case of a heat conduction problem.
 
Array2D< double > Func_HT2 (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 Heat_transfer2: a custom model designed for a tutorial case of a heat conduction problem.
 
Array2D< double > Func_FracPower (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=\lambda_1+\lambda_2 x+\lambda_3 x^2+ \lambda_4 (x+1)^{3.5}$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^4$
 
Array2D< double > Func_ExpSketch (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x)=\lambda_2 e^{\lambda_1 x} - 2$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$
 
Array2D< double > Func_Inputs (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 $y=f(\lambda;x_i)=\lambda_i$ for $i=1,...,d$, $x_i\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^d$
 
Array2D< double > Func_PCl (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 Legendre PC expansion with $\lambda$'s as coefficients.
 
Array2D< double > Func_PCx (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 Legendre PC expansion with respect to $z=(\lambda,x)$.
 
Array2D< double > Func_PC (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 Legendre PC expansion for each value of $x$.
 
Array2D< double > Func_PCs (Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
 Legendre PC expansion for each value of $x$.
 
Array2D< double > augment (Array2D< double > &p, Array2D< double > &fixindnom)
 Augments a parameter matrix with 'fixed' columns given indices and nominal values of those.
 
+

Detailed Description

+

Header for implementation of functions of form $y=f(\lambda;x)$.

+
Note
Functions of form $y=f(\lambda;x)$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^d$ at $r$ values of model parameters $\lambda$ and $n$ values of design parameters $x$
+
Parameters
+ + + + +
pModel parameters $\lambda$ as a matrix $r\times d$
xDesign parameters $x$ as a matrix $n\times s$
*funcinfoPotentially function-specific information
+
+
+
Returns
y Output as a matrix $r\times n$
+

Function Documentation

+ +

◆ augment()

+ +
+
+ + + + + + + + + + + +
Array2D< double > augment (Array2D< double > & p,
Array2D< double > & fixindnom )
+
+ +

Augments a parameter matrix with 'fixed' columns given indices and nominal values of those.

+ +
+
+ +

◆ Func_BB()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_BB (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)$ a black-box function with a script bb.x which takes p.dat and x.dat and returns output in y.dat

+ +
+
+ +

◆ Func_Const()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_Const (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=\lambda$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^1$

+ +
+
+ +

◆ Func_Exp()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_Exp (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=e^{\lambda_1 +\lambda_2x}$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$

+ +
+
+ +

◆ Func_ExpQuad()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_ExpQuad (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=e^{\lambda_1 +\lambda_2x+\lambda_3x^2}$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^3$

+ +
+
+ +

◆ Func_ExpSketch()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_ExpSketch (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=\lambda_2 e^{\lambda_1 x} - 2$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$

+ +
+
+ +

◆ Func_FracPower()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_FracPower (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=\lambda_1+\lambda_2 x+\lambda_3 x^2+ \lambda_4 (x+1)^{3.5}$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^4$

+ +
+
+ +

◆ Func_HT1()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_HT1 (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

Heat_transfer1: a custom model designed for a tutorial case of a heat conduction problem.

+

$y=f(\lambda;x)=\frac{x d_w}{A_w \lambda}+T_0$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^1$

Note
hardwired parameters: $d_w=0.1, A_w=0.04, T_0=273$
+ +
+
+ +

◆ Func_HT2()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_HT2 (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

Heat_transfer2: a custom model designed for a tutorial case of a heat conduction problem.

+

$y=f(\lambda;x)=\frac{x Q}{A_w \lambda_1}+\lambda_2$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$

Note
hardwired parameters: $A_w=0.04, Q=20.0$
+ +
+
+ +

◆ Func_Inputs()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_Inputs (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x_i)=\lambda_i$ for $i=1,...,d$, $x_i\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^d$

+ +
+
+ +

◆ Func_Linear()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_Linear (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=\lambda_1+\lambda_2x$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$

+ +
+
+ +

◆ Func_PC()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_PC (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

Legendre PC expansion for each value of $x$.

+

$y=f(\lambda;x^{(i)})=\sum_{\alpha\in{\cal S}} c_{\alpha,i} \Psi_\alpha(\lambda)$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^d$

Note
hardwired parameters: common multiindex set for all PCs ${\cal S}$ is given in a file mindexp.dat, coefficients $c_{\alpha,i}$ are given in a file pccf_all.dat
+ +
+
+ +

◆ Func_PCl()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_PCl (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

Legendre PC expansion with $\lambda$'s as coefficients.

+

$y=f(\lambda;x)=\sum_{\alpha\in{\cal S}} \lambda_\alpha \Psi_\alpha(x)$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^{|{\cal S}|}$

Note
hardwired parameter: multiindex set ${\cal S}$ is given in a file mindexx.dat
+ +
+
+ +

◆ Func_PCs()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_PCs (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

Legendre PC expansion for each value of $x$.

+

$y=f(\lambda;x^{(i)})=\sum_{\alpha\in{\cal S}_i} c_{\alpha,i} \Psi_\alpha(\lambda)$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^d$

Note
hardwired parameters: multiindex sets for all PCs ${\cal S}$ are given in files mindexp.i.dat, coefficients $c_{\alpha,i}$ are given in files pccfp.i.dat
+ +
+
+ +

◆ Func_PCx()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_PCx (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

Legendre PC expansion with respect to $z=(\lambda,x)$.

+

$y=f(\lambda;x)=\sum_{\alpha\in{\cal S}} c_\alpha \Psi_\alpha(\lambda,x)$ for $x\in\mathbf{R}^s$ and $\lambda\in\mathbf{R}^d$

Note
hardwired parameters: multiindex set ${\cal S}$ is given in a file mindexpx.dat, coefficients $c_\alpha$ given in a file pccfpx.dat
+ +
+
+ +

◆ Func_Prop()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_Prop (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=\lambda x$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^1$

+ +
+
+ +

◆ Func_PropQuad()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
Array2D< double > Func_PropQuad (Array2D< double > & p,
Array2D< double > & x,
Array2D< double > & fixindnom,
void * funcinfo )
+
+ +

$y=f(\lambda;x)=\lambda_1 x+\lambda_2x^2$ for $x\in\mathbf{R}^1$ and $\lambda\in\mathbf{R}^2$

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/func_8h_source.html b/docs/html/func_8h_source.html new file mode 100644 index 00000000..512ef883 --- /dev/null +++ b/docs/html/func_8h_source.html @@ -0,0 +1,170 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: func.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
func.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
37
+
38#ifndef FUNC_H_SEEN
+
39#define FUNC_H_SEEN
+
40
+
41#include "Array1D.h"
+
42#include "Array2D.h"
+
43
+
44#include <iostream>
+
45#include <string.h>
+
46#include <stdio.h>
+
47#include <sstream>
+
48
+
49using namespace std; // needed for python string conversion
+
50
+
51
+
52
+
54Array2D<double> Func_Prop(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
55
+
57Array2D<double> Func_PropQuad(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
58
+
60Array2D<double> Func_Exp(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
61
+
63Array2D<double> Func_ExpQuad(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
64
+
66Array2D<double> Func_Const(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
67
+
69Array2D<double> Func_Linear(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
70
+
72Array2D<double> Func_BB(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
73
+
77Array2D<double> Func_HT1(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
78
+
82Array2D<double> Func_HT2(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
83
+
85Array2D<double> Func_FracPower(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
86
+
88Array2D<double> Func_ExpSketch(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
89
+
91Array2D<double> Func_Inputs(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
92
+
96Array2D<double> Func_PCl(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
97
+
101Array2D<double> Func_PCx(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
102
+
106Array2D<double> Func_PC(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
107
+
111Array2D<double> Func_PCs(Array2D<double>& p, Array2D<double>& x, Array2D<double>& fixindnom, void* funcinfo);
+
112
+
113
+
115Array2D<double> augment(Array2D<double>& p, Array2D<double>& fixindnom);
+
116
+
117
+
118#endif /* FUNC_H_SEEN */
+
Array1D.h
1D Array class for any type T
+
Array2D.h
2D Array class for any type T
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
Func_PC
Array2D< double > Func_PC(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
Legendre PC expansion for each value of .
Definition func.cpp:411
+
Func_FracPower
Array2D< double > Func_FracPower(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
for and
Definition func.cpp:258
+
Func_ExpQuad
Array2D< double > Func_ExpQuad(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
for and
Definition func.cpp:114
+
Func_PCx
Array2D< double > Func_PCx(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
Legendre PC expansion with respect to .
Definition func.cpp:368
+
Func_Linear
Array2D< double > Func_Linear(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
for and
Definition func.cpp:159
+
Func_PCl
Array2D< double > Func_PCl(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
Legendre PC expansion with 's as coefficients.
Definition func.cpp:328
+
Func_Exp
Array2D< double > Func_Exp(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
for and
Definition func.cpp:91
+
Func_PCs
Array2D< double > Func_PCs(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
Legendre PC expansion for each value of .
Definition func.cpp:456
+
Func_BB
Array2D< double > Func_BB(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
a black-box function with a script bb.x which takes p.dat and x.dat and returns output in y....
Definition func.cpp:182
+
Func_HT1
Array2D< double > Func_HT1(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
Heat_transfer1: a custom model designed for a tutorial case of a heat conduction problem.
Definition func.cpp:206
+
Func_Inputs
Array2D< double > Func_Inputs(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
for , and
Definition func.cpp:305
+
Func_Prop
Array2D< double > Func_Prop(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
for and
Definition func.cpp:45
+
Func_Const
Array2D< double > Func_Const(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
for and
Definition func.cpp:137
+
augment
Array2D< double > augment(Array2D< double > &p, Array2D< double > &fixindnom)
Augments a parameter matrix with 'fixed' columns given indices and nominal values of those.
Definition func.cpp:515
+
Func_PropQuad
Array2D< double > Func_PropQuad(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
for and
Definition func.cpp:68
+
Func_ExpSketch
Array2D< double > Func_ExpSketch(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
for and
Definition func.cpp:282
+
Func_HT2
Array2D< double > Func_HT2(Array2D< double > &p, Array2D< double > &x, Array2D< double > &fixindnom, void *funcinfo)
Heat_transfer2: a custom model designed for a tutorial case of a heat conduction problem.
Definition func.cpp:232
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions.html b/docs/html/functions.html new file mode 100644 index 00000000..84b10e5d --- /dev/null +++ b/docs/html/functions.html @@ -0,0 +1,98 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- a -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_b.html b/docs/html/functions_b.html new file mode 100644 index 00000000..4aaa465b --- /dev/null +++ b/docs/html/functions_b.html @@ -0,0 +1,83 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- b -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_c.html b/docs/html/functions_c.html new file mode 100644 index 00000000..0c655c8c --- /dev/null +++ b/docs/html/functions_c.html @@ -0,0 +1,125 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- c -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_d.html b/docs/html/functions_d.html new file mode 100644 index 00000000..5ea0e229 --- /dev/null +++ b/docs/html/functions_d.html @@ -0,0 +1,109 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- d -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_e.html b/docs/html/functions_e.html new file mode 100644 index 00000000..85a084ee --- /dev/null +++ b/docs/html/functions_e.html @@ -0,0 +1,109 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- e -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_f.html b/docs/html/functions_f.html new file mode 100644 index 00000000..53454b19 --- /dev/null +++ b/docs/html/functions_f.html @@ -0,0 +1,83 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- f -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func.html b/docs/html/functions_func.html new file mode 100644 index 00000000..00e7cb97 --- /dev/null +++ b/docs/html/functions_func.html @@ -0,0 +1,81 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- a -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_b.html b/docs/html/functions_func_b.html new file mode 100644 index 00000000..7fb57ae7 --- /dev/null +++ b/docs/html/functions_func_b.html @@ -0,0 +1,74 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- b -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_c.html b/docs/html/functions_func_c.html new file mode 100644 index 00000000..fc0b45ff --- /dev/null +++ b/docs/html/functions_func_c.html @@ -0,0 +1,103 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- c -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_d.html b/docs/html/functions_func_d.html new file mode 100644 index 00000000..4bc3d6cd --- /dev/null +++ b/docs/html/functions_func_d.html @@ -0,0 +1,88 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- d -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_e.html b/docs/html/functions_func_e.html new file mode 100644 index 00000000..20f76507 --- /dev/null +++ b/docs/html/functions_func_e.html @@ -0,0 +1,101 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- e -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_f.html b/docs/html/functions_func_f.html new file mode 100644 index 00000000..8f7332f6 --- /dev/null +++ b/docs/html/functions_func_f.html @@ -0,0 +1,70 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- f -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_g.html b/docs/html/functions_func_g.html new file mode 100644 index 00000000..cc7c5fa0 --- /dev/null +++ b/docs/html/functions_func_g.html @@ -0,0 +1,182 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- g -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_h.html b/docs/html/functions_func_h.html new file mode 100644 index 00000000..01c86745 --- /dev/null +++ b/docs/html/functions_func_h.html @@ -0,0 +1,68 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- h -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_i.html b/docs/html/functions_func_i.html new file mode 100644 index 00000000..a6989393 --- /dev/null +++ b/docs/html/functions_func_i.html @@ -0,0 +1,86 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- i -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_k.html b/docs/html/functions_func_k.html new file mode 100644 index 00000000..2099c69f --- /dev/null +++ b/docs/html/functions_func_k.html @@ -0,0 +1,70 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- k -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_l.html b/docs/html/functions_func_l.html new file mode 100644 index 00000000..d1d6f040 --- /dev/null +++ b/docs/html/functions_func_l.html @@ -0,0 +1,92 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- l -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_m.html b/docs/html/functions_func_m.html new file mode 100644 index 00000000..b13ef234 --- /dev/null +++ b/docs/html/functions_func_m.html @@ -0,0 +1,81 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- m -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_n.html b/docs/html/functions_func_n.html new file mode 100644 index 00000000..1acaa60a --- /dev/null +++ b/docs/html/functions_func_n.html @@ -0,0 +1,71 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- n -

    +
  • namesPrepended() : MCMC
    • +
  • newModeFound() : MCMC
    • +
  • nextLevel() : Quad
    • +
  • NormSq_Exact() : PCBasis
    • +
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_o.html b/docs/html/functions_func_o.html new file mode 100644 index 00000000..01178b14 --- /dev/null +++ b/docs/html/functions_func_o.html @@ -0,0 +1,76 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- o -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_p.html b/docs/html/functions_func_p.html new file mode 100644 index 00000000..c781ce63 --- /dev/null +++ b/docs/html/functions_func_p.html @@ -0,0 +1,87 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- p -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_q.html b/docs/html/functions_func_q.html new file mode 100644 index 00000000..43abb48a --- /dev/null +++ b/docs/html/functions_func_q.html @@ -0,0 +1,69 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- q -

    +
  • Quad() : Quad
    • +
  • quadParam() : Mrv
    • +
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_r.html b/docs/html/functions_func_r.html new file mode 100644 index 00000000..4c63ee46 --- /dev/null +++ b/docs/html/functions_func_r.html @@ -0,0 +1,86 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- r -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_s.html b/docs/html/functions_func_s.html new file mode 100644 index 00000000..b0b11a0f --- /dev/null +++ b/docs/html/functions_func_s.html @@ -0,0 +1,136 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- s -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_t.html b/docs/html/functions_func_t.html new file mode 100644 index 00000000..f41795a0 --- /dev/null +++ b/docs/html/functions_func_t.html @@ -0,0 +1,70 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- t -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_u.html b/docs/html/functions_func_u.html new file mode 100644 index 00000000..e817cf76 --- /dev/null +++ b/docs/html/functions_func_u.html @@ -0,0 +1,68 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- u -

    +
  • updateMode() : MCMC
    • +
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_w.html b/docs/html/functions_func_w.html new file mode 100644 index 00000000..fd957047 --- /dev/null +++ b/docs/html/functions_func_w.html @@ -0,0 +1,71 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- w -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_x.html b/docs/html/functions_func_x.html new file mode 100644 index 00000000..986bb388 --- /dev/null +++ b/docs/html/functions_func_x.html @@ -0,0 +1,72 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- x -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_y.html b/docs/html/functions_func_y.html new file mode 100644 index 00000000..c68b5423 --- /dev/null +++ b/docs/html/functions_func_y.html @@ -0,0 +1,68 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- y -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_z.html b/docs/html/functions_func_z.html new file mode 100644 index 00000000..f09a6717 --- /dev/null +++ b/docs/html/functions_func_z.html @@ -0,0 +1,68 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- z -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_func_~.html b/docs/html/functions_func_~.html new file mode 100644 index 00000000..7d17d3cf --- /dev/null +++ b/docs/html/functions_func_~.html @@ -0,0 +1,100 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Functions + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the classes they belong to:
+ +

- ~ -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_g.html b/docs/html/functions_g.html new file mode 100644 index 00000000..31f5ca17 --- /dev/null +++ b/docs/html/functions_g.html @@ -0,0 +1,186 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- g -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_h.html b/docs/html/functions_h.html new file mode 100644 index 00000000..5cecbec6 --- /dev/null +++ b/docs/html/functions_h.html @@ -0,0 +1,75 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- h -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_i.html b/docs/html/functions_i.html new file mode 100644 index 00000000..ddf5ed2e --- /dev/null +++ b/docs/html/functions_i.html @@ -0,0 +1,93 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- i -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_j.html b/docs/html/functions_j.html new file mode 100644 index 00000000..eac8140e --- /dev/null +++ b/docs/html/functions_j.html @@ -0,0 +1,70 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- j -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_k.html b/docs/html/functions_k.html new file mode 100644 index 00000000..85c62b30 --- /dev/null +++ b/docs/html/functions_k.html @@ -0,0 +1,72 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- k -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_l.html b/docs/html/functions_l.html new file mode 100644 index 00000000..621ce657 --- /dev/null +++ b/docs/html/functions_l.html @@ -0,0 +1,103 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- l -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_m.html b/docs/html/functions_m.html new file mode 100644 index 00000000..7b066333 --- /dev/null +++ b/docs/html/functions_m.html @@ -0,0 +1,96 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- m -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_n.html b/docs/html/functions_n.html new file mode 100644 index 00000000..37f1c15f --- /dev/null +++ b/docs/html/functions_n.html @@ -0,0 +1,97 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- n -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_o.html b/docs/html/functions_o.html new file mode 100644 index 00000000..bac89970 --- /dev/null +++ b/docs/html/functions_o.html @@ -0,0 +1,84 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- o -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_p.html b/docs/html/functions_p.html new file mode 100644 index 00000000..63e799bb --- /dev/null +++ b/docs/html/functions_p.html @@ -0,0 +1,122 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- p -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_q.html b/docs/html/functions_q.html new file mode 100644 index 00000000..e4954818 --- /dev/null +++ b/docs/html/functions_q.html @@ -0,0 +1,76 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- q -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_r.html b/docs/html/functions_r.html new file mode 100644 index 00000000..a7de8d03 --- /dev/null +++ b/docs/html/functions_r.html @@ -0,0 +1,100 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- r -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_rela.html b/docs/html/functions_rela.html new file mode 100644 index 00000000..b3fe94b7 --- /dev/null +++ b/docs/html/functions_rela.html @@ -0,0 +1,67 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Related Symbols + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all related symbols with links to the classes they belong to:
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_s.html b/docs/html/functions_s.html new file mode 100644 index 00000000..061d0e3f --- /dev/null +++ b/docs/html/functions_s.html @@ -0,0 +1,156 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- s -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_t.html b/docs/html/functions_t.html new file mode 100644 index 00000000..edee01a4 --- /dev/null +++ b/docs/html/functions_t.html @@ -0,0 +1,75 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- t -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_type.html b/docs/html/functions_type.html new file mode 100644 index 00000000..1ef6eda6 --- /dev/null +++ b/docs/html/functions_type.html @@ -0,0 +1,70 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Typedefs + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all typedefs with links to the classes they belong to:
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_u.html b/docs/html/functions_u.html new file mode 100644 index 00000000..a964bc58 --- /dev/null +++ b/docs/html/functions_u.html @@ -0,0 +1,73 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- u -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_v.html b/docs/html/functions_v.html new file mode 100644 index 00000000..20500053 --- /dev/null +++ b/docs/html/functions_v.html @@ -0,0 +1,75 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- v -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars.html b/docs/html/functions_vars.html new file mode 100644 index 00000000..a6c51261 --- /dev/null +++ b/docs/html/functions_vars.html @@ -0,0 +1,84 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- a -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_b.html b/docs/html/functions_vars_b.html new file mode 100644 index 00000000..e073ce8e --- /dev/null +++ b/docs/html/functions_vars_b.html @@ -0,0 +1,76 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- b -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_c.html b/docs/html/functions_vars_c.html new file mode 100644 index 00000000..bd852150 --- /dev/null +++ b/docs/html/functions_vars_c.html @@ -0,0 +1,87 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- c -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_d.html b/docs/html/functions_vars_d.html new file mode 100644 index 00000000..f9b661aa --- /dev/null +++ b/docs/html/functions_vars_d.html @@ -0,0 +1,88 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- d -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_e.html b/docs/html/functions_vars_e.html new file mode 100644 index 00000000..3ca400b0 --- /dev/null +++ b/docs/html/functions_vars_e.html @@ -0,0 +1,75 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- e -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_f.html b/docs/html/functions_vars_f.html new file mode 100644 index 00000000..43f21b70 --- /dev/null +++ b/docs/html/functions_vars_f.html @@ -0,0 +1,80 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- f -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_g.html b/docs/html/functions_vars_g.html new file mode 100644 index 00000000..940d91a3 --- /dev/null +++ b/docs/html/functions_vars_g.html @@ -0,0 +1,71 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- g -

    +
  • grid_type_ : Quad
    • +
  • grid_types_ : Quad
    • +
  • growth_rule_ : Quad
    • +
  • growth_rules_ : Quad
    • +
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_h.html b/docs/html/functions_vars_h.html new file mode 100644 index 00000000..b117326c --- /dev/null +++ b/docs/html/functions_vars_h.html @@ -0,0 +1,74 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- h -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_i.html b/docs/html/functions_vars_i.html new file mode 100644 index 00000000..6a23d676 --- /dev/null +++ b/docs/html/functions_vars_i.html @@ -0,0 +1,73 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- i -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_j.html b/docs/html/functions_vars_j.html new file mode 100644 index 00000000..de00d992 --- /dev/null +++ b/docs/html/functions_vars_j.html @@ -0,0 +1,70 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- j -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_k.html b/docs/html/functions_vars_k.html new file mode 100644 index 00000000..91bbb77c --- /dev/null +++ b/docs/html/functions_vars_k.html @@ -0,0 +1,69 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- k -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_l.html b/docs/html/functions_vars_l.html new file mode 100644 index 00000000..77410488 --- /dev/null +++ b/docs/html/functions_vars_l.html @@ -0,0 +1,78 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- l -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_m.html b/docs/html/functions_vars_m.html new file mode 100644 index 00000000..da275bcd --- /dev/null +++ b/docs/html/functions_vars_m.html @@ -0,0 +1,81 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- m -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_n.html b/docs/html/functions_vars_n.html new file mode 100644 index 00000000..65905d91 --- /dev/null +++ b/docs/html/functions_vars_n.html @@ -0,0 +1,93 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- n -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_o.html b/docs/html/functions_vars_o.html new file mode 100644 index 00000000..caaf22ba --- /dev/null +++ b/docs/html/functions_vars_o.html @@ -0,0 +1,74 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- o -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_p.html b/docs/html/functions_vars_p.html new file mode 100644 index 00000000..92543138 --- /dev/null +++ b/docs/html/functions_vars_p.html @@ -0,0 +1,102 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- p -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_q.html b/docs/html/functions_vars_q.html new file mode 100644 index 00000000..803a26f6 --- /dev/null +++ b/docs/html/functions_vars_q.html @@ -0,0 +1,74 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- q -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_r.html b/docs/html/functions_vars_r.html new file mode 100644 index 00000000..bb8cedf3 --- /dev/null +++ b/docs/html/functions_vars_r.html @@ -0,0 +1,81 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- r -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_s.html b/docs/html/functions_vars_s.html new file mode 100644 index 00000000..226bef69 --- /dev/null +++ b/docs/html/functions_vars_s.html @@ -0,0 +1,87 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- s -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_t.html b/docs/html/functions_vars_t.html new file mode 100644 index 00000000..827f490b --- /dev/null +++ b/docs/html/functions_vars_t.html @@ -0,0 +1,71 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- t -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_u.html b/docs/html/functions_vars_u.html new file mode 100644 index 00000000..eb1c836b --- /dev/null +++ b/docs/html/functions_vars_u.html @@ -0,0 +1,72 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- u -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_v.html b/docs/html/functions_vars_v.html new file mode 100644 index 00000000..19c9afb2 --- /dev/null +++ b/docs/html/functions_vars_v.html @@ -0,0 +1,75 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- v -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_w.html b/docs/html/functions_vars_w.html new file mode 100644 index 00000000..f3d7efd1 --- /dev/null +++ b/docs/html/functions_vars_w.html @@ -0,0 +1,74 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- w -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_x.html b/docs/html/functions_vars_x.html new file mode 100644 index 00000000..6448b435 --- /dev/null +++ b/docs/html/functions_vars_x.html @@ -0,0 +1,71 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- x -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_y.html b/docs/html/functions_vars_y.html new file mode 100644 index 00000000..77811707 --- /dev/null +++ b/docs/html/functions_vars_y.html @@ -0,0 +1,72 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- y -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_vars_z.html b/docs/html/functions_vars_z.html new file mode 100644 index 00000000..cc230f63 --- /dev/null +++ b/docs/html/functions_vars_z.html @@ -0,0 +1,69 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members - Variables + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the classes they belong to:
+ +

- z -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_w.html b/docs/html/functions_w.html new file mode 100644 index 00000000..384f629f --- /dev/null +++ b/docs/html/functions_w.html @@ -0,0 +1,78 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- w -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_x.html b/docs/html/functions_x.html new file mode 100644 index 00000000..25b6d4f3 --- /dev/null +++ b/docs/html/functions_x.html @@ -0,0 +1,76 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- x -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_y.html b/docs/html/functions_y.html new file mode 100644 index 00000000..db499c20 --- /dev/null +++ b/docs/html/functions_y.html @@ -0,0 +1,73 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- y -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_z.html b/docs/html/functions_z.html new file mode 100644 index 00000000..47c49f3c --- /dev/null +++ b/docs/html/functions_z.html @@ -0,0 +1,70 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- z -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/functions_~.html b/docs/html/functions_~.html new file mode 100644 index 00000000..837268d2 --- /dev/null +++ b/docs/html/functions_~.html @@ -0,0 +1,100 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all class members with links to the classes they belong to:
+ +

- ~ -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/gen__mi_8cpp.html b/docs/html/gen__mi_8cpp.html new file mode 100644 index 00000000..eb8972b5 --- /dev/null +++ b/docs/html/gen__mi_8cpp.html @@ -0,0 +1,260 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gen_mi.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Macros | +Functions
+
gen_mi.cpp File Reference
+
+
+ +

Command-line utility to generate multiindex. +More...

+
#include "tools.h"
+#include "arrayio.h"
+#include "arraytools.h"
+#include <unistd.h>
+
+ + + + + + + + + + + + + + + + + + + +

+Macros

#define MI_TYPE   "TO"
 default multiindex type
 
#define MI_SEQ   "NONE"
 default multiindex sequence
 
#define ORD   1
 default order
 
#define DIM   3
 default dimensionality
+
 
#define PARAM_FILE   "mi_param.dat"
 default parameter filename
 
#define VERBOSITY   1
 default verbosity
 
+ + + + + + + +

+Functions

int usage ()
 Displays information about this program.
 
int main (int argc, char *argv[])
 Main program: Generates multiindex of requested type with given parameters.
 
+

Detailed Description

+

Command-line utility to generate multiindex.

+
Author
K. Sargsyan 2014 -
+

Macro Definition Documentation

+ +

◆ DIM

+ +
+
+ + + + +
#define DIM   3
+
+ +

default dimensionality
+

+ +
+
+ +

◆ MI_SEQ

+ +
+
+ + + + +
#define MI_SEQ   "NONE"
+
+ +

default multiindex sequence

+ +
+
+ +

◆ MI_TYPE

+ +
+
+ + + + +
#define MI_TYPE   "TO"
+
+ +

default multiindex type

+ +
+
+ +

◆ ORD

+ +
+
+ + + + +
#define ORD   1
+
+ +

default order

+ +
+
+ +

◆ PARAM_FILE

+ +
+
+ + + + +
#define PARAM_FILE   "mi_param.dat"
+
+ +

default parameter filename

+ +
+
+ +

◆ VERBOSITY

+ +
+
+ + + + +
#define VERBOSITY   1
+
+ +

default verbosity

+ +
+
+

Function Documentation

+ +

◆ main()

+ +
+
+ + + + + + + + + + + +
int main (int argc,
char * argv[] )
+
+ +

Main program: Generates multiindex of requested type with given parameters.

+

Set the default values

+

Read the user input

+

Print the input information on screen

+

Write to file mindex.dat

+ +
+
+ +

◆ usage()

+ +
+
+ + + + + + + +
int usage ()
+
+ +

Displays information about this program.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/generate__quad_8cpp.html b/docs/html/generate__quad_8cpp.html new file mode 100644 index 00000000..595671d6 --- /dev/null +++ b/docs/html/generate__quad_8cpp.html @@ -0,0 +1,302 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: generate_quad.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Macros | +Functions
+
generate_quad.cpp File Reference
+
+
+ +

Command-line utility to generate quadrature points. +More...

+
#include <unistd.h>
+#include "quad.h"
+#include "tools.h"
+#include "arrayio.h"
+
+ + + + + + + + + + + + + + + + + + + + + + + + + +

+Macros

#define PARAM   3
 default value of parameter (level for sparse quadrature, or number of grid points for full quadrature)
 
#define DIM   2
 default data dimensionality
 
#define FSTYPE   "sparse"
 default sparseness type (full or sparse)
 
#define QUADTYPE   "CC"
 default quadrature type
 
#define ALPHA   0.0
 default alpha parameter for chaos
 
#define BETA   1.0
 default beta parameter for chaos
 
#define DOMAIN_FILE   "param_domain.dat"
 default domain file
 
#define VERBOSITY   1
 default verbosity
 
+ + + + + + + +

+Functions

int usage ()
 Displays information about this program.
 
int main (int argc, char *argv[])
 Main program: Generates various kinds of quadrature points and weights.
 
+

Detailed Description

+

Command-line utility to generate quadrature points.

+
Author
K. Sargsyan 2013 -
+

Macro Definition Documentation

+ +

◆ ALPHA

+ +
+
+ + + + +
#define ALPHA   0.0
+
+ +

default alpha parameter for chaos

+ +
+
+ +

◆ BETA

+ +
+
+ + + + +
#define BETA   1.0
+
+ +

default beta parameter for chaos

+ +
+
+ +

◆ DIM

+ +
+
+ + + + +
#define DIM   2
+
+ +

default data dimensionality

+ +
+
+ +

◆ DOMAIN_FILE

+ +
+
+ + + + +
#define DOMAIN_FILE   "param_domain.dat"
+
+ +

default domain file

+ +
+
+ +

◆ FSTYPE

+ +
+
+ + + + +
#define FSTYPE   "sparse"
+
+ +

default sparseness type (full or sparse)

+ +
+
+ +

◆ PARAM

+ +
+
+ + + + +
#define PARAM   3
+
+ +

default value of parameter (level for sparse quadrature, or number of grid points for full quadrature)

+ +
+
+ +

◆ QUADTYPE

+ +
+
+ + + + +
#define QUADTYPE   "CC"
+
+ +

default quadrature type

+ +
+
+ +

◆ VERBOSITY

+ +
+
+ + + + +
#define VERBOSITY   1
+
+ +

default verbosity

+ +
+
+

Function Documentation

+ +

◆ main()

+ +
+
+ + + + + + + + + + + +
int main (int argc,
char * argv[] )
+
+ +

Main program: Generates various kinds of quadrature points and weights.

+

Set the default values

+

Read the user input

+

Print the input information on screen

+

Parameter sanity checks

+

Declare the quadrature rule object

+

Extract the properties of the rule

+

Write-out to files

+

Scale if domain is provided

+

Set the domain

+

Write-out to files

+ +
+
+ +

◆ usage()

+ +
+
+ + + + + + + +
int usage ()
+
+ +

Displays information about this program.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/gkpSparse_8cpp.html b/docs/html/gkpSparse_8cpp.html new file mode 100644 index 00000000..0d056f0c --- /dev/null +++ b/docs/html/gkpSparse_8cpp.html @@ -0,0 +1,200 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gkpSparse.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Macros | +Functions
+
gkpSparse.cpp File Reference
+
+
+
#include <stdlib.h>
+#include <stdio.h>
+#include <iostream>
+#include <unistd.h>
+#include <math.h>
+#include <assert.h>
+#include "arrayio.h"
+#include "gkplib.h"
+
+ + + + + + + + + +

+Macros

#define NDIM   2
 
#define NLEV   2
 
#define VERBOSITY   1
 
#define PDFTYPE   "unif"
 
+ + + + + + +

+Functions

int usage ()
 Displays information about this program.
 
int main (int argc, char *argv[])
 
+

Macro Definition Documentation

+ +

◆ NDIM

+ +
+
+ + + + +
#define NDIM   2
+
+ +
+
+ +

◆ NLEV

+ +
+
+ + + + +
#define NLEV   2
+
+ +
+
+ +

◆ PDFTYPE

+ +
+
+ + + + +
#define PDFTYPE   "unif"
+
+ +
+
+ +

◆ VERBOSITY

+ +
+
+ + + + +
#define VERBOSITY   1
+
+ +
+
+

Function Documentation

+ +

◆ main()

+ +
+
+ + + + + + + + + + + +
int main (int argc,
char * argv[] )
+
+

Read the user input

+ +
+
+ +

◆ usage()

+ +
+
+ + + + + + + +
int usage ()
+
+ +

Displays information about this program.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/gkpclib_8cpp.html b/docs/html/gkpclib_8cpp.html new file mode 100644 index 00000000..eaa3292d --- /dev/null +++ b/docs/html/gkpclib_8cpp.html @@ -0,0 +1,1200 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gkpclib.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Macros | +Functions | +Variables
+
gkpclib.cpp File Reference
+
+
+
#include "math.h"
+#include "tools.h"
+#include "gkplib.h"
+
+ + + +

+Macros

#define MAX(a, b)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

void getCC (int n, int *nq, double **x, double **w)
 retrieve pointers to 1D Clenshaw-Curtis rules
 
void getGKPunif (int n, int *nq, double **x, double **w)
 retrieve pointers to 1D Gauss-Kronrod-Patterson rules for uniform pdf based on the quadrature level
 
void getGKPnorm (int n, int *nq, double **x, double **w)
 retrieve pointers to 1D Kronrod-Patterson rules for normal pdf based on the quadrature level
 
int getOrderCC (int lev)
 get order of Clenshaw-Curtis rules based on level
 
int getOrderGKPunif (int lev)
 get order of uniform Gauss-Kronrod-Patterson rules based on level
 
int getOrderGKPnorm (int lev)
 get order of normal Gauss-Kronrod-Patterson rules based on level
 
void getCompNintoDim (int n, int dim, int *nelem, int **plist)
 List of decompositions of 'n' into 'dim' parts. The implementation is based on Algorithm 5 of Combinatorial Algorithms by Albert Nijenhuis, Herbert Wilf.
 
int getSpgSize (int getOrder(int), int dim, int lev)
 Initial estimate for sparse grid size.
 
void getSpgQW (void get1DQW(int, int *, double **, double **), int getOrder(int), int dim, int lev, int *nqpts, double **qpts, double **w)
 Main function that connects the user setup for pdftype, dimensionality, and quadrature level and various pieces of the sparse quadrature algorithm employing Gauss-Kronrod-Patterson rules.
 
void getSpgAnisQW (void get1DQW(int, int *, double **, double **), int getOrder(int), int dim, int *levList, int *nqpts, double **qpts, double **w)
 
void sortSpg (int dim, int spgSize, double *qpts, double *w)
 Sort sparse grid in lexicographical order.
 
void getTensorProd (int dim, double *qpts, double *w, int *spgSize, int *n1D, double **x1D, double **w1D, double qfac)
 compute dim-dimensional tensor grid based a series of 1D rules
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Variables

static double x1 [] = {0.0000000}
 
static double w1 [] = {2.0000000}
 
static double x3 [] = {-0.77459666924148337704,0.0, 0.77459666924148337704 }
 
static double w3 [] = {0.555555555555555555556,0.888888888888888888889,0.555555555555555555556}
 
static double x7 []
 
static double w7 []
 
static double x15 []
 
static double w15 []
 
static double x31 []
 
static double w31 []
 
static double x63 []
 
static double w63 []
 
static double xn1 [] = {0.0000000000000000}
 
static double wn1 [] = {1.0000000000000000}
 
static double xn3 [] = {-1.73205080756887719, 0.000000000000000000, 1.73205080756887719}
 
static double wn3 [] = {0.166666666666666657, 0.66666666666666663, 0.166666666666666657}
 
static double xn9 []
 
static double wn9 []
 
static double xn19 []
 
static double wn19 []
 
static double xn35 []
 
static double wn35 []
 
+

Macro Definition Documentation

+ +

◆ MAX

+ +
+
+ + + + + + + + + + + +
#define MAX( a,
b )
+
+Value:
(((a) > (b)) ? (a) : (b))
+
+
+
+

Function Documentation

+ +

◆ getCC()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void getCC (int n,
int * nq,
double ** x,
double ** w )
+
+ +

retrieve pointers to 1D Clenshaw-Curtis rules

+ +
+
+ +

◆ getCompNintoDim()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void getCompNintoDim (int n,
int dim,
int * nelem,
int ** plist )
+
+ +

List of decompositions of 'n' into 'dim' parts. The implementation is based on Algorithm 5 of Combinatorial Algorithms by Albert Nijenhuis, Herbert Wilf.

+ +
+
+ +

◆ getGKPnorm()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void getGKPnorm (int n,
int * nq,
double ** x,
double ** w )
+
+ +

retrieve pointers to 1D Kronrod-Patterson rules for normal pdf based on the quadrature level

+ +
+
+ +

◆ getGKPunif()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void getGKPunif (int n,
int * nq,
double ** x,
double ** w )
+
+ +

retrieve pointers to 1D Gauss-Kronrod-Patterson rules for uniform pdf based on the quadrature level

+ +
+
+ +

◆ getOrderCC()

+ +
+
+ + + + + + + +
int getOrderCC (int lev)
+
+ +

get order of Clenshaw-Curtis rules based on level

+ +
+
+ +

◆ getOrderGKPnorm()

+ +
+
+ + + + + + + +
int getOrderGKPnorm (int lev)
+
+ +

get order of normal Gauss-Kronrod-Patterson rules based on level

+ +
+
+ +

◆ getOrderGKPunif()

+ +
+
+ + + + + + + +
int getOrderGKPunif (int lev)
+
+ +

get order of uniform Gauss-Kronrod-Patterson rules based on level

+ +
+
+ +

◆ getSpgAnisQW()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void getSpgAnisQW (void get1DQWint, int *, double **, double **,
int getOrderint,
int dim,
int * levList,
int * nqpts,
double ** qpts,
double ** w )
+
+ +
+
+ +

◆ getSpgQW()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void getSpgQW (void get1DQWint, int *, double **, double **,
int getOrderint,
int dim,
int lev,
int * nqpts,
double ** qpts,
double ** w )
+
+ +

Main function that connects the user setup for pdftype, dimensionality, and quadrature level and various pieces of the sparse quadrature algorithm employing Gauss-Kronrod-Patterson rules.

+ +
+
+ +

◆ getSpgSize()

+ +
+
+ + + + + + + + + + + + + + + + +
int getSpgSize (int getOrderint,
int dim,
int lev )
+
+ +

Initial estimate for sparse grid size.

+ +
+
+ +

◆ getTensorProd()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void getTensorProd (int dim,
double * qpts,
double * w,
int * spgSize,
int * n1D,
double ** x1D,
double ** w1D,
double qfac )
+
+ +

compute dim-dimensional tensor grid based a series of 1D rules

+ +
+
+ +

◆ sortSpg()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void sortSpg (int dim,
int spgSize,
double * qpts,
double * w )
+
+ +

Sort sparse grid in lexicographical order.

+ +
+
+

Variable Documentation

+ +

◆ w1

+ +
+
+ + + + + +
+ + + + +
double w1[] = {2.0000000}
+ 		+static
+
+ +
+
+ +

◆ w15

+ +
+
+ + + + + +
+ + + + +
double w15[]
+ 		+static
+
+Initial value:
= {0.0170017196299402603390,0.0516032829970797396969,0.0929271953151245376859,
+
0.134415255243784220360, 0.171511909136391380787, 0.200628529376989021034,
+
0.219156858401587496404, 0.225510499798206687386, 0.219156858401587496404,
+
0.200628529376989021034, 0.171511909136391380787, 0.134415255243784220360,
+
0.0929271953151245376859,0.0516032829970797396969, 0.0170017196299402603390}
+
+
+
+ +

◆ w3

+ +
+
+ + + + + +
+ + + + +
double w3[] = {0.555555555555555555556,0.888888888888888888889,0.555555555555555555556}
+ 		+static
+
+ +
+
+ +

◆ w31

+ +
+
+ + + + + +
+ + + + +
double w31[]
+ 		+static
+
+Initial value:
= {0.00254478079156187441540,0.00843456573932110624631,0.0164460498543878109338,
+
0.0258075980961766535646, 0.0359571033071293220968, 0.0464628932617579865414,
+
0.0569795094941233574122, 0.0672077542959907035404, 0.0768796204990035310427,
+
0.0857559200499903511542, 0.0936271099812644736167, 0.100314278611795578771,
+
0.105669893580234809744, 0.109578421055924638237, 0.111956873020953456880,
+
0.112755256720768691607,
+
0.111956873020953456880, 0.109578421055924638237, 0.105669893580234809744,
+
0.100314278611795578771, 0.0936271099812644736167, 0.0857559200499903511542,
+
0.0768796204990035310427, 0.0672077542959907035404, 0.0569795094941233574122,
+
0.0464628932617579865414, 0.0359571033071293220968, 0.0258075980961766535646,
+
0.0164460498543878109338, 0.00843456573932110624631,0.00254478079156187441540 }
+
+
+
+ +

◆ w63

+ +
+
+ + + + + +
+ + + + +
double w63[]
+ 		+static
+
+Initial value:
= {0.000363221481845530659694,0.00126515655623006801137,0.00257904979468568827243,
+
0.00421763044155885483908, 0.00611550682211724633968,0.00822300795723592966926,
+
0.0104982469096213218983, 0.0129038001003512656260, 0.0154067504665594978021,
+
0.0179785515681282703329, 0.0205942339159127111492, 0.0232314466399102694433,
+
0.0258696793272147469108, 0.0284897547458335486125, 0.0310735511116879648799,
+
0.0336038771482077305417, 0.0360644327807825726401, 0.0384398102494555320386,
+
0.0407155101169443189339, 0.0428779600250077344929, 0.0449145316536321974143,
+
0.0468135549906280124026, 0.0485643304066731987159, 0.0501571393058995374137,
+
0.0515832539520484587768, 0.0528349467901165198621, 0.0539054993352660639269,
+
0.0547892105279628650322, 0.0554814043565593639878, 0.0559784365104763194076,
+
0.0562776998312543012726, 0.0563776283603847173877, 0.0562776998312543012726,
+
0.0559784365104763194076, 0.0554814043565593639878, 0.0547892105279628650322,
+
0.0539054993352660639269, 0.0528349467901165198621, 0.0515832539520484587768,
+
0.0501571393058995374137, 0.0485643304066731987159, 0.0468135549906280124026,
+
0.0449145316536321974143, 0.0428779600250077344929, 0.0407155101169443189339,
+
0.0384398102494555320386, 0.0360644327807825726401, 0.0336038771482077305417,
+
0.0310735511116879648799, 0.0284897547458335486125, 0.0258696793272147469108,
+
0.0232314466399102694433, 0.0205942339159127111492, 0.0179785515681282703329,
+
0.0154067504665594978021, 0.0129038001003512656260, 0.0104982469096213218983,
+
0.00822300795723592966926, 0.00611550682211724633968,0.00421763044155885483908,
+
0.00257904979468568827243, 0.00126515655623006801137,0.000363221481845530659694 }
+
+
+
+ +

◆ w7

+ +
+
+ + + + + +
+ + + + +
double w7[]
+ 		+static
+
+Initial value:
= { 0.104656226026467265194,0.268488089868333440729,0.401397414775962222905,
+
0.450916538658474142345,
+
0.401397414775962222905,0.268488089868333440729,0.104656226026467265194}
+
+
+
+ +

◆ wn1

+ +
+
+ + + + + +
+ + + + +
double wn1[] = {1.0000000000000000}
+ 		+static
+
+ +
+
+ +

◆ wn19

+ +
+
+ + + + + +
+ + + + +
double wn19[]
+ 		+static
+
+Initial value:
= { 8.62968460222986318E-10, 6.09480873146898402E-07, 6.01233694598479965E-05,
+
0.00288488043650675591, -0.00633722479337375712, 0.0180852342547984622,
+
0.0640960546868076103, 0.0611517301252477163, 0.208324991649608771,
+
0.303467199854206227,
+
0.208324991649608771, 0.0611517301252477163, 0.0640960546868076103,
+
0.0180852342547984622, -0.00633722479337375712, 0.00288488043650675591,
+
6.01233694598479965E-05, 6.09480873146898402E-07,8.62968460222986318E-10 }
+
+
+
+ +

◆ wn3

+ +
+
+ + + + + +
+ + + + +
double wn3[] = {0.166666666666666657, 0.66666666666666663, 0.166666666666666657}
+ 		+static
+
+ +
+
+ +

◆ wn35

+ +
+
+ + + + + +
+ + + + +
double wn35[]
+ 		+static
+
+Initial value:
= { 1.05413265823340136E-18, 5.45004126506381281E-15, 3.09722235760629949E-12,
+
4.60117603486559168E-10, 2.13941944795610622E-08, 2.46764213457981401E-07,
+
2.73422068011878881E-06, 3.57293481989753322E-05, 0.000275242141167851312,
+
0.000818953927502267349, 0.00231134524035220713, 0.00315544626918755127,
+
0.015673473751851151, 0.0452736854651503914, 0.0923647267169863534,
+
0.148070831155215854, 0.191760115888044341,
+
0.000514894508069213769,
+
0.191760115888044341, 0.148070831155215854,
+
0.0923647267169863534, 0.0452736854651503914, 0.015673473751851151,
+
0.00315544626918755127, 0.00231134524035220713, 0.000818953927502267349,
+
0.000275242141167851312, 3.57293481989753322E-05, 2.73422068011878881E-06,
+
2.46764213457981401E-07, 2.13941944795610622E-08, 4.60117603486559168E-10,
+
3.09722235760629949E-12, 5.45004126506381281E-15, 1.05413265823340136E-18 }
+
+
+
+ +

◆ wn9

+ +
+
+ + + + + +
+ + + + +
double wn9[]
+ 		+static
+
+Initial value:
= { 9.42694575565174701E-05, 0.00799632547089352934, 0.0948509485094851251,
+
0.270074329577937755, 0.253968253968254065, 0.270074329577937755,
+
0.0948509485094851251,0.00799632547089352934,9.42694575565174701E-05 }
+
+
+
+ +

◆ x1

+ +
+
+ + + + + +
+ + + + +
double x1[] = {0.0000000}
+ 		+static
+
+ +
+
+ +

◆ x15

+ +
+
+ + + + + +
+ + + + +
double x15[]
+ 		+static
+
+Initial value:
= {-0.99383196321275502221,-0.96049126870802028342,-0.88845923287225699889,
+
-0.77459666924148337704,-0.62110294673722640294,-0.43424374934680255800,
+
-0.22338668642896688163, 0.0, 0.22338668642896688163,
+
0.43424374934680255800, 0.62110294673722640294, 0.77459666924148337704,
+
0.88845923287225699889, 0.96049126870802028342, 0.99383196321275502221 }
+
+
+
+ +

◆ x3

+ +
+
+ + + + + +
+ + + + +
double x3[] = {-0.77459666924148337704,0.0, 0.77459666924148337704 }
+ 		+static
+
+ +
+
+ +

◆ x31

+ +
+
+ + + + + +
+ + + + +
double x31[]
+ 		+static
+
+Initial value:
= {-0.99909812496766759766,-0.99383196321275502221,-0.98153114955374010687,
+
-0.96049126870802028342,-0.92965485742974005667,-0.88845923287225699889,
+
-0.83672593816886873550,-0.77459666924148337704,-0.70249620649152707861,
+
-0.62110294673722640294,-0.53131974364437562397,-0.43424374934680255800,
+
-0.33113539325797683309,-0.22338668642896688163,-0.11248894313318662575,
+
0.0,
+
0.11248894313318662575, 0.22338668642896688163, 0.33113539325797683309,
+
0.43424374934680255800, 0.53131974364437562397, 0.62110294673722640294,
+
0.70249620649152707861, 0.77459666924148337704, 0.83672593816886873550,
+
0.88845923287225699889, 0.92965485742974005667, 0.96049126870802028342,
+
0.98153114955374010687, 0.99383196321275502221, 0.99909812496766759766 }
+
+
+
+ +

◆ x63

+ +
+
+ + + + + +
+ + + + +
double x63[]
+ 		+static
+
+Initial value:
= {-0.99987288812035761194,-0.99909812496766759766,-0.99720625937222195908,
+
-0.99383196321275502221,-0.98868475754742947994,-0.98153114955374010687,
+
-0.97218287474858179658,-0.96049126870802028342,-0.94634285837340290515,
+
-0.92965485742974005667,-0.91037115695700429250,-0.88845923287225699889,
+
-0.86390793819369047715,-0.83672593816886873550,-0.80694053195021761186,
+
-0.77459666924148337704,-0.73975604435269475868,-0.70249620649152707861,
+
-0.66290966002478059546,-0.62110294673722640294,-0.57719571005204581484,
+
-0.53131974364437562397,-0.48361802694584102756,-0.43424374934680255800,
+
-0.38335932419873034692,-0.33113539325797683309,-0.27774982202182431507,
+
-0.22338668642896688163,-0.16823525155220746498,-0.11248894313318662575,
+
-0.056344313046592789972,0.0, 0.056344313046592789972,
+
0.11248894313318662575, 0.16823525155220746498, 0.22338668642896688163,
+
0.27774982202182431507, 0.33113539325797683309, 0.38335932419873034692,
+
0.43424374934680255800, 0.48361802694584102756, 0.53131974364437562397,
+
0.57719571005204581484, 0.62110294673722640294, 0.66290966002478059546,
+
0.70249620649152707861, 0.73975604435269475868, 0.77459666924148337704,
+
0.80694053195021761186, 0.83672593816886873550, 0.86390793819369047715,
+
0.88845923287225699889, 0.91037115695700429250, 0.92965485742974005667,
+
0.94634285837340290515, 0.96049126870802028342, 0.97218287474858179658,
+
0.98153114955374010687, 0.98868475754742947994, 0.99383196321275502221,
+
0.99720625937222195908, 0.99909812496766759766, 0.99987288812035761194 }
+
+
+
+ +

◆ x7

+ +
+
+ + + + + +
+ + + + +
double x7[]
+ 		+static
+
+Initial value:
= {-0.96049126870802028342,-0.77459666924148337704,-0.43424374934680255800,
+
0.0,
+
0.43424374934680255800, 0.77459666924148337704, 0.96049126870802028342}
+
+
+
+ +

◆ xn1

+ +
+
+ + + + + +
+ + + + +
double xn1[] = {0.0000000000000000}
+ 		+static
+
+ +
+
+ +

◆ xn19

+ +
+
+ + + + + +
+ + + + +
double xn19[]
+ 		+static
+
+Initial value:
= {-6.36339449433636961, -5.18701603991365623, -4.18495601767273229,
+
-3.20533379449919442, -2.86127957605705818, -2.59608311504920231,
+
-1.73205080756887719, -1.23042363402730603, -0.741095349994540853,
+
0.0000000000000000,
+
0.741095349994540853, 1.23042363402730603, 1.73205080756887719,
+
2.59608311504920231, 2.86127957605705818, 3.20533379449919442,
+
4.18495601767273229, 5.18701603991365623, 6.36339449433636961 }
+
+
+
+ +

◆ xn3

+ +
+
+ + + + + +
+ + + + +
double xn3[] = {-1.73205080756887719, 0.000000000000000000, 1.73205080756887719}
+ 		+static
+
+ +
+
+ +

◆ xn35

+ +
+
+ + + + + +
+ + + + +
double xn35[]
+ 		+static
+
+Initial value:
= {-9.0169397898903032, -7.98077179859056063, -7.12210670080461661,
+
-6.36339449433636961, -5.69817776848810986, -5.18701603991365623,
+
-4.73643308595229673, -4.18495601767273229, -3.63531851903727832,
+
-3.20533379449919442, -2.86127957605705818, -2.59608311504920231,
+
-2.23362606167694189, -1.73205080756887719, -1.23042363402730603,
+
-0.741095349994540853, -0.248992297579960609,
+
0.00000000000000000,
+
0.248992297579960609, 0.741095349994540853,
+
1.23042363402730603, 1.73205080756887719, 2.23362606167694189,
+
2.59608311504920231, 2.86127957605705818, 3.20533379449919442,
+
3.63531851903727832, 4.18495601767273229, 4.73643308595229673,
+
5.18701603991365623, 5.69817776848810986, 6.36339449433636961,
+
7.12210670080461661, 7.98077179859056063, 9.0169397898903032 }
+
+
+
+ +

◆ xn9

+ +
+
+ + + + + +
+ + + + +
double xn9[]
+ 		+static
+
+Initial value:
= {-4.18495601767273229, -2.86127957605705818, -1.73205080756887719,
+
-0.741095349994540853, 0.00000000000000000, 0.741095349994540853,
+
1.73205080756887719, 2.86127957605705818, 4.18495601767273229 }
+
+
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/gkplib_8h.html b/docs/html/gkplib_8h.html new file mode 100644 index 00000000..78782b53 --- /dev/null +++ b/docs/html/gkplib_8h.html @@ -0,0 +1,552 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gkplib.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
gkplib.h File Reference
+
+
+ +

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

void getCC (int n, int *nq, double **x, double **w)
 retrieve pointers to 1D Clenshaw-Curtis rules
 
int getOrderCC (int lev)
 get order of Clenshaw-Curtis rules based on level
 
void getGKPunif (int n, int *nq, double **x, double **w)
 retrieve pointers to 1D Gauss-Kronrod-Patterson rules for uniform pdf based on the quadrature level
 
void getGKPnorm (int n, int *nq, double **x, double **w)
 retrieve pointers to 1D Kronrod-Patterson rules for normal pdf based on the quadrature level
 
int getOrderGKPunif (int lev)
 get order of uniform Gauss-Kronrod-Patterson rules based on level
 
int getOrderGKPnorm (int lev)
 get order of normal Gauss-Kronrod-Patterson rules based on level
 
void getCompNintoDim (int n, int dim, int *nelem, int **plist)
 List of decompositions of 'n' into 'dim' parts. The implementation is based on Algorithm 5 of Combinatorial Algorithms by Albert Nijenhuis, Herbert Wilf.
 
int getSpgSize (int getOrder(int), int dim, int lev)
 Initial estimate for sparse grid size.
 
void sortSpg (int dim, int spgSize, double *qpts, double *w)
 Sort sparse grid in lexicographical order.
 
void getTensorProd (int dim, double *qpts, double *w, int *spgSize, int *n1D, double **x1D, double **w1D, double qfac)
 compute dim-dimensional tensor grid based a series of 1D rules
 
void getSpgQW (void get1DQW(int, int *, double **, double **), int getOrder(int), int dim, int lev, int *nqpts, double **qpts, double **w)
 Main function that connects the user setup for pdftype, dimensionality, and quadrature level and various pieces of the sparse quadrature algorithm employing Gauss-Kronrod-Patterson rules.
 
void getSpgAnisQW (void get1DQW(int, int *, double **, double **), int getOrder(int), int dim, int *levList, int *nqpts, double **qpts, double **w)
 
void heap_ext_ (const int *, const int *, int *, int *, int *)
 
+

Detailed Description

+

Functions related to Gauss-Kronrod-Patterson sparse quadrature construction

+

Function Documentation

+ +

◆ getCC()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void getCC (int n,
int * nq,
double ** x,
double ** w )
+
+ +

retrieve pointers to 1D Clenshaw-Curtis rules

+ +
+
+ +

◆ getCompNintoDim()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void getCompNintoDim (int n,
int dim,
int * nelem,
int ** plist )
+
+ +

List of decompositions of 'n' into 'dim' parts. The implementation is based on Algorithm 5 of Combinatorial Algorithms by Albert Nijenhuis, Herbert Wilf.

+ +
+
+ +

◆ getGKPnorm()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void getGKPnorm (int n,
int * nq,
double ** x,
double ** w )
+
+ +

retrieve pointers to 1D Kronrod-Patterson rules for normal pdf based on the quadrature level

+ +
+
+ +

◆ getGKPunif()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void getGKPunif (int n,
int * nq,
double ** x,
double ** w )
+
+ +

retrieve pointers to 1D Gauss-Kronrod-Patterson rules for uniform pdf based on the quadrature level

+ +
+
+ +

◆ getOrderCC()

+ +
+
+ + + + + + + +
int getOrderCC (int lev)
+
+ +

get order of Clenshaw-Curtis rules based on level

+ +
+
+ +

◆ getOrderGKPnorm()

+ +
+
+ + + + + + + +
int getOrderGKPnorm (int lev)
+
+ +

get order of normal Gauss-Kronrod-Patterson rules based on level

+ +
+
+ +

◆ getOrderGKPunif()

+ +
+
+ + + + + + + +
int getOrderGKPunif (int lev)
+
+ +

get order of uniform Gauss-Kronrod-Patterson rules based on level

+ +
+
+ +

◆ getSpgAnisQW()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void getSpgAnisQW (void get1DQWint, int *, double **, double **,
int getOrderint,
int dim,
int * levList,
int * nqpts,
double ** qpts,
double ** w )
+
+ +
+
+ +

◆ getSpgQW()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void getSpgQW (void get1DQWint, int *, double **, double **,
int getOrderint,
int dim,
int lev,
int * nqpts,
double ** qpts,
double ** w )
+
+ +

Main function that connects the user setup for pdftype, dimensionality, and quadrature level and various pieces of the sparse quadrature algorithm employing Gauss-Kronrod-Patterson rules.

+ +
+
+ +

◆ getSpgSize()

+ +
+
+ + + + + + + + + + + + + + + + +
int getSpgSize (int getOrderint,
int dim,
int lev )
+
+ +

Initial estimate for sparse grid size.

+ +
+
+ +

◆ getTensorProd()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void getTensorProd (int dim,
double * qpts,
double * w,
int * spgSize,
int * n1D,
double ** x1D,
double ** w1D,
double qfac )
+
+ +

compute dim-dimensional tensor grid based a series of 1D rules

+ +
+
+ +

◆ heap_ext_()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void heap_ext_ (const int * ,
const int * ,
int * ,
int * ,
int *  )
+
+

brief Fortran function for sorting an array of items. The array operations happen outside this function, based on a series of flags passed between the user code and this function. This implementation is based on Algorithm 15 of Combinatorial Algorithms by Albert Nijenhuis, Herbert Wilf

+ +
+
+ +

◆ sortSpg()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void sortSpg (int dim,
int spgSize,
double * qpts,
double * w )
+
+ +

Sort sparse grid in lexicographical order.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/gkplib_8h_source.html b/docs/html/gkplib_8h_source.html new file mode 100644 index 00000000..f1479ccb --- /dev/null +++ b/docs/html/gkplib_8h_source.html @@ -0,0 +1,147 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gkplib.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
gkplib.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
28#ifndef GKPLIB
+
29#define GKPLIB
+
30
+
36void getCC ( int n, int *nq, double **x, double **w );
+
37
+
39int getOrderCC ( int lev ) ;
+
40
+
43void getGKPunif ( int n, int *nq, double **x, double **w );
+
44
+
47void getGKPnorm ( int n, int *nq, double **x, double **w );
+
48
+
50int getOrderGKPunif ( int lev ) ;
+
51
+
53int getOrderGKPnorm ( int lev ) ;
+
54
+
58void getCompNintoDim(int n, int dim, int *nelem, int **plist) ;
+
59
+
61int getSpgSize ( int getOrder ( int ), int dim, int lev );
+
62
+
64void sortSpg ( int dim, int spgSize, double *qpts, double *w );
+
65
+
67void getTensorProd(int dim, double *qpts, double *w, int *spgSize, int *n1D,
+
68 double **x1D, double **w1D, double qfac);
+
69
+
73void getSpgQW ( void get1DQW ( int , int *, double **, double** ), int getOrder ( int ),
+
74 int dim, int lev, int *nqpts, double **qpts, double
+
75 **w );
+
76
+
77void getSpgAnisQW ( void get1DQW ( int , int *, double **, double** ), int getOrder ( int ),
+
78 int dim, int *levList, int *nqpts, double **qpts, double **w ) ;
+
79
+
80void getCC ( int n, int *nq, double **x, double **w );
+
81int getOrderCC ( int lev );
+
82
+
88extern "C" void heap_ext_(const int *,const int *, int *, int *, int *);
+
89
+
90#endif
+
sortSpg
void sortSpg(int dim, int spgSize, double *qpts, double *w)
Sort sparse grid in lexicographical order.
Definition gkpclib.cpp:612
+
getTensorProd
void getTensorProd(int dim, double *qpts, double *w, int *spgSize, int *n1D, double **x1D, double **w1D, double qfac)
compute dim-dimensional tensor grid based a series of 1D rules
Definition gkpclib.cpp:654
+
getOrderGKPnorm
int getOrderGKPnorm(int lev)
get order of normal Gauss-Kronrod-Patterson rules based on level
Definition gkpclib.cpp:318
+
getOrderGKPunif
int getOrderGKPunif(int lev)
get order of uniform Gauss-Kronrod-Patterson rules based on level
Definition gkpclib.cpp:304
+
getSpgQW
void getSpgQW(void get1DQW(int, int *, double **, double **), int getOrder(int), int dim, int lev, int *nqpts, double **qpts, double **w)
Main function that connects the user setup for pdftype, dimensionality, and quadrature level and vari...
Definition gkpclib.cpp:392
+
getOrderCC
int getOrderCC(int lev)
get order of Clenshaw-Curtis rules based on level
Definition gkpclib.cpp:294
+
getGKPunif
void getGKPunif(int n, int *nq, double **x, double **w)
retrieve pointers to 1D Gauss-Kronrod-Patterson rules for uniform pdf based on the quadrature level
Definition gkpclib.cpp:235
+
getCompNintoDim
void getCompNintoDim(int n, int dim, int *nelem, int **plist)
List of decompositions of 'n' into 'dim' parts. The implementation is based on Algorithm 5 of Combina...
Definition gkpclib.cpp:331
+
getSpgSize
int getSpgSize(int getOrder(int), int dim, int lev)
Initial estimate for sparse grid size.
Definition gkpclib.cpp:361
+
getGKPnorm
void getGKPnorm(int n, int *nq, double **x, double **w)
retrieve pointers to 1D Kronrod-Patterson rules for normal pdf based on the quadrature level
Definition gkpclib.cpp:267
+
heap_ext_
void heap_ext_(const int *, const int *, int *, int *, int *)
+
getCC
void getCC(int n, int *nq, double **x, double **w)
retrieve pointers to 1D Clenshaw-Curtis rules
Definition gkpclib.cpp:193
+
getSpgAnisQW
void getSpgAnisQW(void get1DQW(int, int *, double **, double **), int getOrder(int), int dim, int *levList, int *nqpts, double **qpts, double **w)
Definition gkpclib.cpp:495
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals.html b/docs/html/globals.html new file mode 100644 index 00000000..758f2437 --- /dev/null +++ b/docs/html/globals.html @@ -0,0 +1,68 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- _ -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_a.html b/docs/html/globals_a.html new file mode 100644 index 00000000..6fae22f6 --- /dev/null +++ b/docs/html/globals_a.html @@ -0,0 +1,83 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- a -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_b.html b/docs/html/globals_b.html new file mode 100644 index 00000000..7065eb32 --- /dev/null +++ b/docs/html/globals_b.html @@ -0,0 +1,75 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- b -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_c.html b/docs/html/globals_c.html new file mode 100644 index 00000000..0d72e028 --- /dev/null +++ b/docs/html/globals_c.html @@ -0,0 +1,86 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- c -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_d.html b/docs/html/globals_d.html new file mode 100644 index 00000000..0b080f8f --- /dev/null +++ b/docs/html/globals_d.html @@ -0,0 +1,88 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- d -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_defs.html b/docs/html/globals_defs.html new file mode 100644 index 00000000..2e71484b --- /dev/null +++ b/docs/html/globals_defs.html @@ -0,0 +1,228 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all macros with links to the files they belong to:
+ +

- _ -

+ + +

- a -

+ + +

- b -

+ + +

- c -

+ + +

- d -

+ + +

- e -

+ + +

- f -

+ + +

- g -

+ + +

- i -

+ + +

- l -

+ + +

- m -

+ + +

- n -

+ + +

- o -

+ + +

- p -

+ + +

- q -

+ + +

- r -

+ + +

- s -

+ + +

- t -

+ + +

- v -

+ + +

- x -

+ + +

- y -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_e.html b/docs/html/globals_e.html new file mode 100644 index 00000000..e50566f5 --- /dev/null +++ b/docs/html/globals_e.html @@ -0,0 +1,71 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- e -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_enum.html b/docs/html/globals_enum.html new file mode 100644 index 00000000..69fcb05a --- /dev/null +++ b/docs/html/globals_enum.html @@ -0,0 +1,66 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all enums with links to the files they belong to:
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_eval.html b/docs/html/globals_eval.html new file mode 100644 index 00000000..df90aa37 --- /dev/null +++ b/docs/html/globals_eval.html @@ -0,0 +1,67 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all enum values with links to the files they belong to:
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_f.html b/docs/html/globals_f.html new file mode 100644 index 00000000..e54d875d --- /dev/null +++ b/docs/html/globals_f.html @@ -0,0 +1,98 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- f -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func.html b/docs/html/globals_func.html new file mode 100644 index 00000000..75be6426 --- /dev/null +++ b/docs/html/globals_func.html @@ -0,0 +1,81 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- a -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_b.html b/docs/html/globals_func_b.html new file mode 100644 index 00000000..aa95da3d --- /dev/null +++ b/docs/html/globals_func_b.html @@ -0,0 +1,70 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- b -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_c.html b/docs/html/globals_func_c.html new file mode 100644 index 00000000..22a27cbf --- /dev/null +++ b/docs/html/globals_func_c.html @@ -0,0 +1,83 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- c -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_d.html b/docs/html/globals_func_d.html new file mode 100644 index 00000000..bc120ed2 --- /dev/null +++ b/docs/html/globals_func_d.html @@ -0,0 +1,80 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- d -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_e.html b/docs/html/globals_func_e.html new file mode 100644 index 00000000..d8683c41 --- /dev/null +++ b/docs/html/globals_func_e.html @@ -0,0 +1,69 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- e -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_f.html b/docs/html/globals_func_f.html new file mode 100644 index 00000000..ad50e90e --- /dev/null +++ b/docs/html/globals_func_f.html @@ -0,0 +1,93 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- f -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_g.html b/docs/html/globals_func_g.html new file mode 100644 index 00000000..32c623ab --- /dev/null +++ b/docs/html/globals_func_g.html @@ -0,0 +1,104 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- g -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_h.html b/docs/html/globals_func_h.html new file mode 100644 index 00000000..3f97bfd3 --- /dev/null +++ b/docs/html/globals_func_h.html @@ -0,0 +1,70 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- h -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_i.html b/docs/html/globals_func_i.html new file mode 100644 index 00000000..352f02db --- /dev/null +++ b/docs/html/globals_func_i.html @@ -0,0 +1,79 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- i -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_j.html b/docs/html/globals_func_j.html new file mode 100644 index 00000000..d000271c --- /dev/null +++ b/docs/html/globals_func_j.html @@ -0,0 +1,69 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- j -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_l.html b/docs/html/globals_func_l.html new file mode 100644 index 00000000..9fa2918f --- /dev/null +++ b/docs/html/globals_func_l.html @@ -0,0 +1,76 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- l -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_m.html b/docs/html/globals_func_m.html new file mode 100644 index 00000000..794e4cad --- /dev/null +++ b/docs/html/globals_func_m.html @@ -0,0 +1,78 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- m -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_n.html b/docs/html/globals_func_n.html new file mode 100644 index 00000000..42e8579b --- /dev/null +++ b/docs/html/globals_func_n.html @@ -0,0 +1,73 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- n -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_p.html b/docs/html/globals_func_p.html new file mode 100644 index 00000000..5f865eab --- /dev/null +++ b/docs/html/globals_func_p.html @@ -0,0 +1,80 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- p -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_q.html b/docs/html/globals_func_q.html new file mode 100644 index 00000000..224bebb9 --- /dev/null +++ b/docs/html/globals_func_q.html @@ -0,0 +1,69 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- q -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_r.html b/docs/html/globals_func_r.html new file mode 100644 index 00000000..67a5212f --- /dev/null +++ b/docs/html/globals_func_r.html @@ -0,0 +1,73 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- r -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_s.html b/docs/html/globals_func_s.html new file mode 100644 index 00000000..74a90363 --- /dev/null +++ b/docs/html/globals_func_s.html @@ -0,0 +1,83 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- s -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_t.html b/docs/html/globals_func_t.html new file mode 100644 index 00000000..34a07825 --- /dev/null +++ b/docs/html/globals_func_t.html @@ -0,0 +1,73 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- t -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_u.html b/docs/html/globals_func_u.html new file mode 100644 index 00000000..68eee013 --- /dev/null +++ b/docs/html/globals_func_u.html @@ -0,0 +1,76 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- u -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_v.html b/docs/html/globals_func_v.html new file mode 100644 index 00000000..3eb4e13e --- /dev/null +++ b/docs/html/globals_func_v.html @@ -0,0 +1,69 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- v -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_func_w.html b/docs/html/globals_func_w.html new file mode 100644 index 00000000..0a4aea81 --- /dev/null +++ b/docs/html/globals_func_w.html @@ -0,0 +1,71 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all functions with links to the files they belong to:
+ +

- w -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_g.html b/docs/html/globals_g.html new file mode 100644 index 00000000..e9eb855c --- /dev/null +++ b/docs/html/globals_g.html @@ -0,0 +1,105 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- g -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_h.html b/docs/html/globals_h.html new file mode 100644 index 00000000..0a62d303 --- /dev/null +++ b/docs/html/globals_h.html @@ -0,0 +1,70 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- h -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_i.html b/docs/html/globals_i.html new file mode 100644 index 00000000..4edb324e --- /dev/null +++ b/docs/html/globals_i.html @@ -0,0 +1,81 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- i -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_j.html b/docs/html/globals_j.html new file mode 100644 index 00000000..51970d3b --- /dev/null +++ b/docs/html/globals_j.html @@ -0,0 +1,69 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- j -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_l.html b/docs/html/globals_l.html new file mode 100644 index 00000000..efea14d4 --- /dev/null +++ b/docs/html/globals_l.html @@ -0,0 +1,80 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- l -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_m.html b/docs/html/globals_m.html new file mode 100644 index 00000000..7ac3a2e9 --- /dev/null +++ b/docs/html/globals_m.html @@ -0,0 +1,91 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- m -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_n.html b/docs/html/globals_n.html new file mode 100644 index 00000000..fc459860 --- /dev/null +++ b/docs/html/globals_n.html @@ -0,0 +1,80 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- n -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_o.html b/docs/html/globals_o.html new file mode 100644 index 00000000..5f0ac5fb --- /dev/null +++ b/docs/html/globals_o.html @@ -0,0 +1,69 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- o -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_p.html b/docs/html/globals_p.html new file mode 100644 index 00000000..a96ddaf1 --- /dev/null +++ b/docs/html/globals_p.html @@ -0,0 +1,91 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- p -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_q.html b/docs/html/globals_q.html new file mode 100644 index 00000000..4ba97757 --- /dev/null +++ b/docs/html/globals_q.html @@ -0,0 +1,71 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- q -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_r.html b/docs/html/globals_r.html new file mode 100644 index 00000000..408dc3ba --- /dev/null +++ b/docs/html/globals_r.html @@ -0,0 +1,74 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- r -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_s.html b/docs/html/globals_s.html new file mode 100644 index 00000000..0d0ebb22 --- /dev/null +++ b/docs/html/globals_s.html @@ -0,0 +1,92 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- s -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_t.html b/docs/html/globals_t.html new file mode 100644 index 00000000..459b653b --- /dev/null +++ b/docs/html/globals_t.html @@ -0,0 +1,75 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- t -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_u.html b/docs/html/globals_u.html new file mode 100644 index 00000000..3ffe6688 --- /dev/null +++ b/docs/html/globals_u.html @@ -0,0 +1,76 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- u -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_v.html b/docs/html/globals_v.html new file mode 100644 index 00000000..2de0ab05 --- /dev/null +++ b/docs/html/globals_v.html @@ -0,0 +1,71 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- v -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_vars.html b/docs/html/globals_vars.html new file mode 100644 index 00000000..9dd1a500 --- /dev/null +++ b/docs/html/globals_vars.html @@ -0,0 +1,87 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all variables with links to the files they belong to:
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_w.html b/docs/html/globals_w.html new file mode 100644 index 00000000..d02dbd1b --- /dev/null +++ b/docs/html/globals_w.html @@ -0,0 +1,82 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- w -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_x.html b/docs/html/globals_x.html new file mode 100644 index 00000000..f2552629 --- /dev/null +++ b/docs/html/globals_x.html @@ -0,0 +1,79 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- x -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/globals_y.html b/docs/html/globals_y.html new file mode 100644 index 00000000..712da293 --- /dev/null +++ b/docs/html/globals_y.html @@ -0,0 +1,68 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: File Members + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Here is a list of all file members with links to the files they belong to:
+ +

- y -

+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/gp__regr_8cpp.html b/docs/html/gp__regr_8cpp.html new file mode 100644 index 00000000..000288bf --- /dev/null +++ b/docs/html/gp__regr_8cpp.html @@ -0,0 +1,250 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gp_regr.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Macros | +Functions
+
gp_regr.cpp File Reference
+
+
+ +

Command-line utility for Gaussian Process regression. +More...

+
#include <iostream>
+#include <getopt.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <time.h>
+#include <math.h>
+#include <string>
+#include "Array1D.h"
+#include "Array2D.h"
+#include "PCSet.h"
+#include "error_handlers.h"
+#include "ftndefs.h"
+#include "gen_defs.h"
+#include "assert.h"
+#include "quad.h"
+#include "gproc.h"
+#include "arrayio.h"
+#include "tools.h"
+#include "arraytools.h"
+#include "dsfmt_add.h"
+
+ + + + + + + + + + + + + +

+Macros

#define XFILE   "xdata.dat"
 default x-file
 
#define YFILE   "ydata.dat"
 default y-file
 
#define MSC   "ms"
 default flag to output mean (m), mean+std (ms) or mean+std+cov (msc)
 
#define ORD   3
 default PC order
 
+ + + + + + + +

+Functions

int usage ()
 Displays information about this program.
 
int main (int argc, char *argv[])
 Main program of building Gaussian Process response surface.
 
+

Detailed Description

+

Command-line utility for Gaussian Process regression.

+
Author
K. Sargsyan 2015 -
+

Macro Definition Documentation

+ +

◆ MSC

+ +
+
+ + + + +
#define MSC   "ms"
+
+ +

default flag to output mean (m), mean+std (ms) or mean+std+cov (msc)

+ +
+
+ +

◆ ORD

+ +
+
+ + + + +
#define ORD   3
+
+ +

default PC order

+ +
+
+ +

◆ XFILE

+ +
+
+ + + + +
#define XFILE   "xdata.dat"
+
+ +

default x-file

+ +
+
+ +

◆ YFILE

+ +
+
+ + + + +
#define YFILE   "ydata.dat"
+
+ +

default y-file

+ +
+
+

Function Documentation

+ +

◆ main()

+ +
+
+ + + + + + + + + + + +
int main (int argc,
char * argv[] )
+
+ +

Main program of building Gaussian Process response surface.

+

Set the default values

+

Read the user input

+

Sanity checks

+

Print the input information on screen

+

Read data
+

+

Set or read data variance

+

Read validation check data, if any

+

Set the correlation parameters

+

Set the PC trend

+

Initialize a GP object

+

Print out the roughness param

+

Sanity check to ensure the regression is well-defined

+

Build the GP

+

Evaluate the GP (actually, a Student-t process, see the UQTk Manual)

+

Write the mean

+

If asked, compute and write standard deviation and covariance of the Student-t process

+

Print out output information

+ +
+
+ +

◆ usage()

+ +
+
+ + + + + + + +
int usage ()
+
+ +

Displays information about this program.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/gproc_8cpp.html b/docs/html/gproc_8cpp.html new file mode 100644 index 00000000..761e540a --- /dev/null +++ b/docs/html/gproc_8cpp.html @@ -0,0 +1,123 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gproc.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
gproc.cpp File Reference
+
+
+ +

Gaussian Process class. +More...

+
#include <math.h>
+#include <cfloat>
+#include <iostream>
+#include "gproc.h"
+#include "error_handlers.h"
+#include "gen_defs.h"
+#include "arraytools.h"
+#include "arrayio.h"
+#include "tools.h"
+#include "lbfgs_routines.h"
+#include <assert.h>
+
+ + + +

+Functions

double neglogPostParam (int ndim, double *m, void *classpointer)
 
+

Detailed Description

+

Gaussian Process class.

+
Author
K. Sargsyan 2014 -
+

Function Documentation

+ +

◆ neglogPostParam()

+ +
+
+ + + + + + + + + + + + + + + + +
double neglogPostParam (int ndim,
double * m,
void * classpointer )
+
+

Function to compute negative log posterior (needed to maximize with respect to roughness parameter)

Todo
Find a more elegant way to do this within the class
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/gproc_8h.html b/docs/html/gproc_8h.html new file mode 100644 index 00000000..f61bc0b4 --- /dev/null +++ b/docs/html/gproc_8h.html @@ -0,0 +1,90 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gproc.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
gproc.h File Reference
+
+
+ +

Header file for Gaussian Process class. +More...

+
#include "Array1D.h"
+#include "Array2D.h"
+#include "PCSet.h"
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  Gproc
 Class for Gaussian processes. More...
 
+

Detailed Description

+

Header file for Gaussian Process class.

+
Author
K. Sargsyan 2014 -
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/gproc_8h_source.html b/docs/html/gproc_8h_source.html new file mode 100644 index 00000000..fcce4d30 --- /dev/null +++ b/docs/html/gproc_8h_source.html @@ -0,0 +1,247 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gproc.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
gproc.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
31
+
32#ifndef GPROC_H_SEEN
+
33#define GPROC_H_SEEN
+
34
+
35#include "Array1D.h"
+
36#include "Array2D.h"
+
37#include "PCSet.h"
+
38
+
+
41class Gproc {
+
42public:
+
43
+
46 Gproc(const string covtype, PCSet *PCModel, Array1D<double>& param);
+
48 ~Gproc() {};
+
49
+
51 void SetupPrior();
+
53 void SetupData(Array2D<double>& xdata, Array1D<double>& ydata,Array1D<double>& datavar);
+
55 void setCorrParam(Array1D<double> param){param_=param; return;}
+
56
+
59 void BuildGP();
+
64 void BuildGP_inv();
+
67 void EvalGP(Array2D<double>& xgrid, string msc, Array1D<double>& mst);
+
72 void EvalGP_inv(Array2D<double>& xgrid, string msc, Array1D<double>& mst);
+
74 int getNpt() const {return npt_;}
+
76 int getNdim() const {return ndim_;}
+
78 int getNPC() const {return npc_;}
+
80 double getAl() const {return al_;}
+
82 double getBe() const {return be_;}
+
84 double getSig2hat() const {return sig2hat_;}
+
86 void getVst(Array2D<double>& vst) {vst=Vst_; return;}
+
88 void getA(Array2D<double>& acor) {acor=A_; return;}
+
90 void getParam(Array1D<double>& param) {param=param_; return;}
+
92 void getCov(Array2D<double>& cov) {cov=cov_;}
+
94 void getVar(Array1D<double>& var) {var=var_;}
+
96 void getXYCov(Array2D<double>& xgrid,Array2D<double>& xycov);
+
98 void getSttPars(Array1D<double>& sttmat);
+
100 void findBestCorrParam();
+
101
+
102
+
103 private:
+
104
+
106 double covariance(Array1D<double>& x1, Array1D<double>& x2,Array1D<double>& param);
+
108 void computeDataCov_(Array2D<double>& xdata,Array1D<double>& param,Array2D<double>& A);
+
109
+
111 Array2D<double> xdata_;
+
113 Array1D<double> ydata_;
+
115 Array1D<double> dataVar_;
+
116
+
118 int npc_;
+
120 Array2D<double> Vinv_;
+
122 Array1D<double> z_;
+
123 //double sig2f_;
+
125 double al_;
+
127 double be_;
+
129 double sig2hat_;
+
130
+
132 int npt_;
+
134 int ndim_;
+
136 string covType_;
+
138 PCSet *PCModel_;
+
139
+
141 Array1D<double> mst_;
+
143 Array1D<double> var_;
+
145 Array2D<double> cov_;
+
147 Array1D<double> param_;
+
148
+
150
+
151 Array2D<double> H_, Ht_;
+
152 Array2D<double> A_, Ainv_;
+
153 Array1D<double> Ainvd_;
+
154 Array1D<double> Vinvz_;
+
155 Array1D<double> HtAinvd_;
+
156 Array2D<double> AinvH_;
+
157 Array2D<double> HtAinvH_;
+
158 Array2D<double> Vst_; // V^*
+
159 Array1D<double> bhat_;
+
160 Array1D<double> Hbhat_;
+
161 Array1D<double> yHbhat_;
+
162 Array1D<double> AinvyHbhat_;
+
163 Array2D<double> Vstinv_;
+
165
+
166
+
167};
+
+
168#endif /* GPROC_H_SEEN */
+
Array1D.h
1D Array class for any type T
+
Array2D.h
2D Array class for any type T
+
PCSet.h
Header file for the Multivariate PC class.
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
Gproc
Class for Gaussian processes.
Definition gproc.h:41
+
Gproc::bhat_
Array1D< double > bhat_
Definition gproc.h:159
+
Gproc::ydata_
Array1D< double > ydata_
ydata array
Definition gproc.h:113
+
Gproc::getVst
void getVst(Array2D< double > &vst)
Get , an auxiliary matrix.
Definition gproc.h:86
+
Gproc::Vst_
Array2D< double > Vst_
Definition gproc.h:158
+
Gproc::EvalGP
void EvalGP(Array2D< double > &xgrid, string msc, Array1D< double > &mst)
Evaluate the Gaussian Process at a given grid msc controls whether only mean will be computed,...
Definition gproc.cpp:205
+
Gproc::Ht_
Array2D< double > Ht_
Definition gproc.h:151
+
Gproc::be_
double be_
Prior parameter .
Definition gproc.h:127
+
Gproc::BuildGP
void BuildGP()
Build Gaussian Process regressor, i.e. compute internally all necessary matrices and vectors that des...
Definition gproc.cpp:99
+
Gproc::getCov
void getCov(Array2D< double > &cov)
Get the posterior covariance matrix.
Definition gproc.h:92
+
Gproc::getParam
void getParam(Array1D< double > &param)
Get the roughness parameters.
Definition gproc.h:90
+
Gproc::setCorrParam
void setCorrParam(Array1D< double > param)
Set the roughness parameter vector.
Definition gproc.h:55
+
Gproc::findBestCorrParam
void findBestCorrParam()
Function to find the best values for roughness parameters.
Definition gproc.cpp:511
+
Gproc::xdata_
Array2D< double > xdata_
xdata array
Definition gproc.h:111
+
Gproc::A_
Array2D< double > A_
Definition gproc.h:152
+
Gproc::HtAinvd_
Array1D< double > HtAinvd_
Definition gproc.h:155
+
Gproc::SetupPrior
void SetupPrior()
Setup the prior.
Definition gproc.cpp:68
+
Gproc::AinvH_
Array2D< double > AinvH_
Definition gproc.h:156
+
Gproc::sig2hat_
double sig2hat_
Posterior variance factor.
Definition gproc.h:129
+
Gproc::getSig2hat
double getSig2hat() const
Get Sigma-hat-squared, i.e. the posterior variance factor.
Definition gproc.h:84
+
Gproc::covType_
string covType_
Covariance type, only 'SqExp' implemented so far.
Definition gproc.h:136
+
Gproc::BuildGP_inv
void BuildGP_inv()
Build Gaussian Process regressor, i.e. compute internally all necessary matrices and vectors that des...
Definition gproc.cpp:155
+
Gproc::Vinvz_
Array1D< double > Vinvz_
Definition gproc.h:154
+
Gproc::getNPC
int getNPC() const
Get the number of basis terms in the trend.
Definition gproc.h:78
+
Gproc::Gproc
Gproc(const string covtype, PCSet *PCModel, Array1D< double > &param)
Constructor: initialize with covariance type, trend function basis and roughness parameter vector.
Definition gproc.cpp:52
+
Gproc::getA
void getA(Array2D< double > &acor)
Get the correlation matrix .
Definition gproc.h:88
+
Gproc::Vstinv_
Array2D< double > Vstinv_
Definition gproc.h:163
+
Gproc::Ainvd_
Array1D< double > Ainvd_
Definition gproc.h:153
+
Gproc::getXYCov
void getXYCov(Array2D< double > &xgrid, Array2D< double > &xycov)
Get the covariance in a different format, with the x,x' values.
Definition gproc.cpp:435
+
Gproc::getVar
void getVar(Array1D< double > &var)
Get the posterior variance vector.
Definition gproc.h:94
+
Gproc::Ainv_
Array2D< double > Ainv_
Definition gproc.h:152
+
Gproc::ndim_
int ndim_
Dimensionality.
Definition gproc.h:134
+
Gproc::computeDataCov_
void computeDataCov_(Array2D< double > &xdata, Array1D< double > &param, Array2D< double > &A)
Compute the data covariance .
Definition gproc.cpp:489
+
Gproc::yHbhat_
Array1D< double > yHbhat_
Definition gproc.h:161
+
Gproc::H_
Array2D< double > H_
Auxiliary matrices or vectors, see the UQTk Manual.
Definition gproc.h:151
+
Gproc::Vinv_
Array2D< double > Vinv_
Inverse of the mean trend coefficient prior covariance.
Definition gproc.h:120
+
Gproc::getSttPars
void getSttPars(Array1D< double > &sttmat)
Get the Student-t parameters.
Definition gproc.cpp:418
+
Gproc::npc_
int npc_
Number of bases in the mean trend.
Definition gproc.h:118
+
Gproc::covariance
double covariance(Array1D< double > &x1, Array1D< double > &x2, Array1D< double > &param)
Prior covariance function.
Definition gproc.cpp:460
+
Gproc::var_
Array1D< double > var_
Variance of the Student-t posterior.
Definition gproc.h:143
+
Gproc::getNpt
int getNpt() const
Get the number of data points.
Definition gproc.h:74
+
Gproc::param_
Array1D< double > param_
Roughness parameter vector.
Definition gproc.h:147
+
Gproc::getBe
double getBe() const
Get beta parameter.
Definition gproc.h:82
+
Gproc::Hbhat_
Array1D< double > Hbhat_
Definition gproc.h:160
+
Gproc::al_
double al_
Prior parameter .
Definition gproc.h:125
+
Gproc::~Gproc
~Gproc()
Destructor: cleans up all memory and destroys object.
Definition gproc.h:48
+
Gproc::EvalGP_inv
void EvalGP_inv(Array2D< double > &xgrid, string msc, Array1D< double > &mst)
Evaluate the Gaussian Process at a given grid msc controls whether only mean will be computed,...
Definition gproc.cpp:328
+
Gproc::npt_
int npt_
Number of data points.
Definition gproc.h:132
+
Gproc::AinvyHbhat_
Array1D< double > AinvyHbhat_
Definition gproc.h:162
+
Gproc::cov_
Array2D< double > cov_
Covariance of the Student-t posterior.
Definition gproc.h:145
+
Gproc::z_
Array1D< double > z_
Prior mean of the mean trend.
Definition gproc.h:122
+
Gproc::dataVar_
Array1D< double > dataVar_
Data noise 'nugget'.
Definition gproc.h:115
+
Gproc::getNdim
int getNdim() const
Get the dimensionality.
Definition gproc.h:76
+
Gproc::PCModel_
PCSet * PCModel_
Basis set for the trend function.
Definition gproc.h:138
+
Gproc::getAl
double getAl() const
Get alpha parameter.
Definition gproc.h:80
+
Gproc::mst_
Array1D< double > mst_
Mean of the Student-t posterior.
Definition gproc.h:141
+
Gproc::SetupData
void SetupData(Array2D< double > &xdata, Array1D< double > &ydata, Array1D< double > &datavar)
Setup the data.
Definition gproc.cpp:87
+
Gproc::HtAinvH_
Array2D< double > HtAinvH_
Definition gproc.h:157
+
PCSet
Defines and initializes PC basis function set and provides functions to manipulate PC expansions defi...
Definition PCSet.h:73
+
x1
static double x1[]
Definition gkpclib.cpp:36
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/gq_8cpp.html b/docs/html/gq_8cpp.html new file mode 100644 index 00000000..3c35eb3e --- /dev/null +++ b/docs/html/gq_8cpp.html @@ -0,0 +1,537 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gq.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Macros | +Functions
+
gq.cpp File Reference
+
+
+ +

Utilities to generate quadrature rules. +More...

+
#include "stdio.h"
+#include "stdlib.h"
+#include <iostream>
+#include <cmath>
+#include "Array1D.h"
+#include "Array2D.h"
+#include "deplapack.h"
+#include "gq.h"
+#include "combin.h"
+
+ + + +

+Macros

#define DPI   3.14159265358979323846
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

double lpol_gq (int n, double x)
 
double hpol_gq (int n, double x)
 
double hpol_phys_gq (int n, double x)
 
double jpol_gq (int n, double a, double b, double x)
 
double jpolp_gq (int n, double a, double b, double x)
 
double lgpol_gq (int n, double a, double x)
 
double fact_gq (int n)
 
void gq (const int kind, const double a, const double b, Array1D< double > &x, Array1D< double > &w)
 Computes abscissas and weights for several quadrature rules.
 
void gq (const int kind, const int n, const double a, const double b, double *x, double *w)
 Computes abscissas and weights for several quadrature rules.
 
void gchb (const int kind, const int n, double *x, double *w)
 Computes abscissas and weights for Chebyshev quadrature rules.
 
void gq_gen (Array1D< double > &a, Array1D< double > &b, const double amu0, Array1D< double > &x, Array1D< double > &w)
 Computes abscissas and weights for a generic orthogonal polynomial recursion using the Golub-Welsch algorithm.
 
void vandermonde_gq (Array1D< double > &x, Array1D< double > &w, Array1D< double > &q)
 Computes abscissas and weights for Newton-Cotes rules through the solution of a Vandermonde matrix. This function was tested as an internal function only, called by the quadrature class.
 
+

Detailed Description

+

Utilities to generate quadrature rules.

+

Macro Definition Documentation

+ +

◆ DPI

+ +
+
+ + + + +
#define DPI   3.14159265358979323846
+
+ +
+
+

Function Documentation

+ +

◆ fact_gq()

+ +
+
+ + + + + + + +
double fact_gq (int n)
+
+ +
+
+ +

◆ gchb()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void gchb (const int kind,
const int n,
double * x,
double * w )
+
+ +

Computes abscissas and weights for Chebyshev quadrature rules.

+
Parameters
+ + + + + +
kind: defines quadrature type (1) Gauss-Chebyshev 1st kind (2) Gauss-Chebyshev 2nd kind
n: quadrature order
x: on return it holds quadrature abscissas.
w: on return it holds quadrature weights.
+
+
+ +
+
+ +

◆ gq() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void gq (const int kind,
const double a,
const double b,
Array1D< double > & x,
Array1D< double > & w )
+
+ +

Computes abscissas and weights for several quadrature rules.

+
Parameters
+ + + + + + +
kind: defines quadrature type (1) Gauss-Legendre, (2) Gauss-Chebyshev 1st kind (3) Gauss-Chebyshev 2nd kind, (4) Gauss-Hermite, (5) Gauss-Jacobi (6) Gauss-Laguerre
a: optional parameter needed by Gauss-Jacobi and Gauss-Laguerre rules
b: optional parameter needed by Gauss-Jacobi rule
x: on return it holds quadrature abscissas. Its initial size determines the quadrature order
w: on return it holds quadrature weights.
+
+
+ +
+
+ +

◆ gq() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void gq (const int kind,
const int n,
const double a,
const double b,
double * x,
double * w )
+
+ +

Computes abscissas and weights for several quadrature rules.

+
Parameters
+ + + + + + + +
kind: defines quadrature type (1) Gauss-Legendre, (2) Gauss-Chebyshev 1st kind (3) Gauss-Chebyshev 2nd kind, (4) Gauss-Hermite, (5) Gauss-Jacobi (6) Gauss-Laguerre
n: quadrature order
a: optional parameter needed by Gauss-Jacobi and Gauss-Laguerre rules
b: optional parameter needed by Gauss-Jacobi rule
x: on return it holds quadrature abscissas.
w: on return it holds quadrature weights.
+
+
+ +
+
+ +

◆ gq_gen()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void gq_gen (Array1D< double > & a,
Array1D< double > & b,
const double amu0,
Array1D< double > & x,
Array1D< double > & w )
+
+ +

Computes abscissas and weights for a generic orthogonal polynomial recursion using the Golub-Welsch algorithm.

+
Parameters
+ + + + + + +
a: array of parameters for the orthogonal polynomial recursion. Its initial size determines the quadrature order
b: array of parameters for the orthogonal polynomial recursion
amu0: parameter for custom scaling of quadrature weights
x: on return it holds quadrature abscissas
w: on return it holds quadrature weights.
+
+
+ +
+
+ +

◆ hpol_gq()

+ +
+
+ + + + + + + + + + + +
double hpol_gq (int n,
double x )
+
+ +
+
+ +

◆ hpol_phys_gq()

+ +
+
+ + + + + + + + + + + +
double hpol_phys_gq (int n,
double x )
+
+ +
+
+ +

◆ jpol_gq()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
double jpol_gq (int n,
double a,
double b,
double x )
+
+ +
+
+ +

◆ jpolp_gq()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
double jpolp_gq (int n,
double a,
double b,
double x )
+
+ +
+
+ +

◆ lgpol_gq()

+ +
+
+ + + + + + + + + + + + + + + + +
double lgpol_gq (int n,
double a,
double x )
+
+ +
+
+ +

◆ lpol_gq()

+ +
+
+ + + + + + + + + + + +
double lpol_gq (int n,
double x )
+
+ +
+
+ +

◆ vandermonde_gq()

+ +
+
+ + + + + + + + + + + + + + + + +
void vandermonde_gq (Array1D< double > & x,
Array1D< double > & w,
Array1D< double > & q )
+
+ +

Computes abscissas and weights for Newton-Cotes rules through the solution of a Vandermonde matrix. This function was tested as an internal function only, called by the quadrature class.

+
Parameters
+ + + + +
x: holds quadrature abscissas
w: on return it holds quadrature weights.
q: array of parameters needed to setup the Vandermonde matrix
+
+
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/gq_8h.html b/docs/html/gq_8h.html new file mode 100644 index 00000000..a63bcfe7 --- /dev/null +++ b/docs/html/gq_8h.html @@ -0,0 +1,327 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gq.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
gq.h File Reference
+
+
+ +

Header for quadrature generation utilities. +More...

+ +

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + +

+Functions

void gq (const int kind, const double a, const double b, Array1D< double > &x, Array1D< double > &w)
 Computes abscissas and weights for several quadrature rules.
 
void gq (const int kind, const int n, const double a, const double b, double *x, double *w)
 Computes abscissas and weights for several quadrature rules.
 
void gq_gen (Array1D< double > &a, Array1D< double > &b, const double amu0, Array1D< double > &x, Array1D< double > &w)
 Computes abscissas and weights for a generic orthogonal polynomial recursion using the Golub-Welsch algorithm.
 
void vandermonde_gq (Array1D< double > &x, Array1D< double > &w, Array1D< double > &q)
 Computes abscissas and weights for Newton-Cotes rules through the solution of a Vandermonde matrix. This function was tested as an internal function only, called by the quadrature class.
 
void gchb (const int kind, const int n, double *x, double *w)
 Computes abscissas and weights for Chebyshev quadrature rules.
 
+

Detailed Description

+

Header for quadrature generation utilities.

+

Function Documentation

+ +

◆ gchb()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + +
void gchb (const int kind,
const int n,
double * x,
double * w )
+
+ +

Computes abscissas and weights for Chebyshev quadrature rules.

+
Parameters
+ + + + + +
kind: defines quadrature type (1) Gauss-Chebyshev 1st kind (2) Gauss-Chebyshev 2nd kind
n: quadrature order
x: on return it holds quadrature abscissas.
w: on return it holds quadrature weights.
+
+
+ +
+
+ +

◆ gq() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void gq (const int kind,
const double a,
const double b,
Array1D< double > & x,
Array1D< double > & w )
+
+ +

Computes abscissas and weights for several quadrature rules.

+
Parameters
+ + + + + + +
kind: defines quadrature type (1) Gauss-Legendre, (2) Gauss-Chebyshev 1st kind (3) Gauss-Chebyshev 2nd kind, (4) Gauss-Hermite, (5) Gauss-Jacobi (6) Gauss-Laguerre
a: optional parameter needed by Gauss-Jacobi and Gauss-Laguerre rules
b: optional parameter needed by Gauss-Jacobi rule
x: on return it holds quadrature abscissas. Its initial size determines the quadrature order
w: on return it holds quadrature weights.
+
+
+ +
+
+ +

◆ gq() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void gq (const int kind,
const int n,
const double a,
const double b,
double * x,
double * w )
+
+ +

Computes abscissas and weights for several quadrature rules.

+
Parameters
+ + + + + + + +
kind: defines quadrature type (1) Gauss-Legendre, (2) Gauss-Chebyshev 1st kind (3) Gauss-Chebyshev 2nd kind, (4) Gauss-Hermite, (5) Gauss-Jacobi (6) Gauss-Laguerre
n: quadrature order
a: optional parameter needed by Gauss-Jacobi and Gauss-Laguerre rules
b: optional parameter needed by Gauss-Jacobi rule
x: on return it holds quadrature abscissas.
w: on return it holds quadrature weights.
+
+
+ +
+
+ +

◆ gq_gen()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
void gq_gen (Array1D< double > & a,
Array1D< double > & b,
const double amu0,
Array1D< double > & x,
Array1D< double > & w )
+
+ +

Computes abscissas and weights for a generic orthogonal polynomial recursion using the Golub-Welsch algorithm.

+
Parameters
+ + + + + + +
a: array of parameters for the orthogonal polynomial recursion. Its initial size determines the quadrature order
b: array of parameters for the orthogonal polynomial recursion
amu0: parameter for custom scaling of quadrature weights
x: on return it holds quadrature abscissas
w: on return it holds quadrature weights.
+
+
+ +
+
+ +

◆ vandermonde_gq()

+ +
+
+ + + + + + + + + + + + + + + + +
void vandermonde_gq (Array1D< double > & x,
Array1D< double > & w,
Array1D< double > & q )
+
+ +

Computes abscissas and weights for Newton-Cotes rules through the solution of a Vandermonde matrix. This function was tested as an internal function only, called by the quadrature class.

+
Parameters
+ + + + +
x: holds quadrature abscissas
w: on return it holds quadrature weights.
q: array of parameters needed to setup the Vandermonde matrix
+
+
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/gq_8h_source.html b/docs/html/gq_8h_source.html new file mode 100644 index 00000000..42394280 --- /dev/null +++ b/docs/html/gq_8h_source.html @@ -0,0 +1,118 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: gq.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
gq.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
28#ifndef GQ_H
+
29#define GQ_H
+
30
+
48void gq ( const int kind, const double a, const double b, Array1D<double> &x, Array1D<double> &w ) ;
+
49
+
63void gq ( const int kind, const int n, const double a, const double b, double *x, double *w ) ;
+
64
+
77void gq_gen(Array1D<double> &a, Array1D<double> &b, const double amu0,
+
78 Array1D<double> &x, Array1D<double> &w) ;
+
79
+
80
+
91void vandermonde_gq(Array1D<double> &x, Array1D<double> &w, Array1D<double> &q) ;
+
92
+
103void gchb(const int kind, const int n, double *x, double *w ) ;
+
104
+
105#endif
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
gq_gen
void gq_gen(Array1D< double > &a, Array1D< double > &b, const double amu0, Array1D< double > &x, Array1D< double > &w)
Computes abscissas and weights for a generic orthogonal polynomial recursion using the Golub-Welsch a...
Definition gq.cpp:252
+
gq
void gq(const int kind, const double a, const double b, Array1D< double > &x, Array1D< double > &w)
Computes abscissas and weights for several quadrature rules.
Definition gq.cpp:66
+
vandermonde_gq
void vandermonde_gq(Array1D< double > &x, Array1D< double > &w, Array1D< double > &q)
Computes abscissas and weights for Newton-Cotes rules through the solution of a Vandermonde matrix....
Definition gq.cpp:285
+
gchb
void gchb(const int kind, const int n, double *x, double *w)
Computes abscissas and weights for Chebyshev quadrature rules.
Definition gq.cpp:213
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/hierarchy.html b/docs/html/hierarchy.html new file mode 100644 index 00000000..a711ffd1 --- /dev/null +++ b/docs/html/hierarchy.html @@ -0,0 +1,126 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Class Hierarchy + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
Class Hierarchy
+
+
+
This inheritance list is sorted roughly, but not completely, alphabetically:
+
[detail level 123]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
 CArray1D< T >Stores data of any type T in a 1D array
 CArray1D< Array1D< double > >
 CArray1D< Array1D< int > >
 CArray1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) >
 CArray1D< double >
 CArray1D< int >
 CArray1D< MCMC::chainstate >
 CArray1D< Quad::QuadRule >
 CArray1D< string >
 CArray2D< T >Stores data of any type T in a 2D array
 CArray2D< double >
 CArray2D< int >
 CArray2D< Quad::QuadRule >
 CArray3D< T >Stores data of any type T in a 3D array
 Cbase
 CMCMC::chainstate
 CdataPosteriorInformation
 CDFI
 CDFIsurr
 ▼Cstd::exception
 CMyException
 CGprocClass for Gaussian processes
 CKLDecompUniComputes the Karhunen-Loeve decomposition of a univariate stochastic process
 CLogPosteriorBase
 ▼CLregClass for linear parameteric regression
 CPCregDerived class for PC regression
 CPLregDerived class for polynomial regression
 CRBFregDerived class for RBF regression
 Cmain
 CMCMCMarkov Chain Monte Carlo base class. Implemented the basic and most general MCMC algorithms
 CMrvMultivariate RV parameterized by PC expansions
 ▼CObject
 CXMLAttributeList
 CXMLElement
 ▼CXMLParser
 CXMLExpatParser
 CMCMC::outputInfo
 CparameterPosteriorInformation
 CPCBasisContains all basis type specific definitions and operations needed to generate a PCSet
 CPCSetDefines and initializes PC basis function set and provides functions to manipulate PC expansions defined on this basis set
 ▼CPostPosterior evaluation with various likelihood and prior options
 CLik_ABCDerived class for ABC likelihood
 CLik_ABCmDerived class for ABC-mean likelihood
 CLik_ClassicalDerived class for classical likelihood
 CLik_EovDerived class for error-in-variable likelihood
 CLik_FullDerived class for full likelihood
 CLik_GausMargDerived class for gaussian-marginal likelihood
 CLik_GausMargDDerived class for gaussian-marginal likelihood with discrete parameter
 CLik_KohDerived class for Kennedy-O'Hagan likelihood
 CLik_MVNDerived class for mvn likelihood
 CLik_MargDerived class for marginal likelihood
 CQuadGenerates quadrature rules
 CQuad::QuadRuleRule structure that stores quadrature points, weights and indices
 CRefPtr< T >
 CRefPtr< XMLAttributeList >
 CRefPtr< XMLElement >
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/index.html b/docs/html/index.html new file mode 100644 index 00000000..52f980fd --- /dev/null +++ b/docs/html/index.html @@ -0,0 +1,68 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: <a href="http://www.sandia.gov/UQToolkit">The UQ Toolkit</a> + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + +
+
+ +
+
The UQ Toolkit
+
+
+
+ +
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/inference_8cpp.html b/docs/html/inference_8cpp.html new file mode 100644 index 00000000..b0e3bf87 --- /dev/null +++ b/docs/html/inference_8cpp.html @@ -0,0 +1,405 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: inference.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
inference.cpp File Reference
+
+
+ +

Model inference tools. +More...

+
#include <unistd.h>
+#include <sstream>
+#include <map>
+#include <iostream>
+#include <string>
+#include <math.h>
+#include "func.h"
+#include "post.h"
+#include "mrv.h"
+#include "inference.h"
+#include "mcmc.h"
+#include "amcmc.h"
+#include "tools.h"
+#include "arrayio.h"
+#include "arraytools.h"
+
+ + + + + + + +

+Functions

void infer_model (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, void *funcInfo, string likType, string priorType, double priora, double priorb, Array2D< double > &xdata, Array1D< Array1D< double > > &ydata, Array2D< double > &xgrid, int dataNoiseInference, Array1D< double > &datanoise_array, int pdim, int order, Array1D< int > &rndInd, Array2D< double > &fixindnom, string pdfType, string pcType, int seed, int nmcmc, double mcmcgamma, bool optimflag, Array1D< double > &chstart, Array1D< double > &chsig, double likParam, int likParam_int, Array2D< double > &pgrid, Array2D< double > &pchain, int nburn, int nstep, Array1D< double > &mapparam, Array1D< double > &datavar_map, Array1D< double > &pmean_map, Array1D< double > &pvar_map, Array1D< double > &fmean_map, Array1D< double > &fvar_map, Array1D< double > &postave_datavar, Array1D< double > &p_postave_mean, Array1D< double > &p_postave_var, Array1D< double > &p_postvar_mean, Array2D< double > &f_postsam_mean, Array1D< double > &f_postave_mean, Array1D< double > &f_postave_var, Array1D< double > &f_postvar_mean, Array2D< double > &paramPCcfs)
 Main function for inferring model parameters.
 
double LogPosterior (Array1D< double > &m, void *mypost_void)
 Log-posterior function given a vector of parameters (chain state) and a void* set of auxiliary variables.
 
+

Detailed Description

+

Model inference tools.

+
Author
K. Sargsyan 2016 -
+

Function Documentation

+ +

◆ infer_model()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void infer_model (Array1D< Array2D< double >(* forwardFuncs )(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) >,
void * funcInfo,
string likType,
string priorType,
double priora,
double priorb,
Array2D< double > & xdata,
Array1D< Array1D< double > > & ydata,
Array2D< double > & xgrid,
int dataNoiseInference,
Array1D< double > & datanoise_array,
int pdim,
int order,
Array1D< int > & rndInd,
Array2D< double > & fixIndNom,
string pdfType,
string pcType,
int seed,
int nmcmc,
double mcmcgamma,
bool optimflag,
Array1D< double > & chstart,
Array1D< double > & chsig,
double likParam,
int likParam_int,
Array2D< double > & pgrid,
Array2D< double > & pchain,
int nburn,
int nstep,
Array1D< double > & mapparam,
Array1D< double > & datavar_map,
Array1D< double > & pmean_map,
Array1D< double > & pvar_map,
Array1D< double > & fmean_map,
Array1D< double > & fvar_map,
Array1D< double > & postave_datavar,
Array1D< double > & p_postave_mean,
Array1D< double > & p_postave_var,
Array1D< double > & p_postvar_mean,
Array2D< double > & f_postsam_mean,
Array1D< double > & f_postave_mean,
Array1D< double > & f_postave_var,
Array1D< double > & f_postvar_mean,
Array2D< double > & paramPCcfs )
+
+ +

Main function for inferring model parameters.

+
Note
This is written in a fortran style, i.e. some arguments are inputs, and the rest are output
+
Parameters
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
[in]*forwardFuncs: an array of y=f(p,x) functions that take np-by-pdim and nx-by-xdim input arrays and returns an np-by-nx output, see tools/func.h for several examples
[in]funcinfo: auxiliary function-specific information (can be 0)
[in]likType: likelihood type: options are 'full', 'marg', 'mvn', 'gausmarg', 'abc', 'abcm', 'classical', 'koh' (see UQTk Manual)
[in]priorType: prior type: options are 'uniform', 'normal', 'inverse', etc ... (see UQTk Manual)
[in]priora,priorb: prior parameters (todo: need to be made dimension-specific) for uniform, it is the range, for normal it is the moments
[in]xdata: x-values of data, nx-by-xdim
[in]ydata: y-values of data, nx-by-neach
[in]xgrid: x-values where predictive moments are computed after the inference : can be the same as xdata
[in]dataNoiseInference: indicator, data noise stdev is fixed(0), inferred (1), or log-inferred (2)
[in]datanoise_array: data noise stdev array, if fixed, otherwise merely an MCMC starting point
[in]pdim: model parameter dimensionality
[in]order: order of output PC that is computed via NISP in the likelihood
[in]rndInd: array of indices of parameters to be randomized
[in]fixIndNom: array of indices and nominal values of parameters to be fixed
[in]pdfType: type of PDF PC parameterization, options are 'pct','pci' and 'full' (see UQTk Manual)
[in]pcType: type of PC for the PDF parameterization, options are all common PC types, e.g. 'HG','LU'
[in]seed: integer seed for MCMC
[in]nmcmc: number of MCMC steps to follow optimization; if 0, then only optimization is performed if optimflag is True
[in]mcmcgamma: gamma (scaling) parameter for adaptive MCMC
[in]optimflag: indicates if optimization is prepended to MCMC
[in]chstart: initial chain state
[in]chsig: initial non-adaptive, dimensionwise proposal jump size
[in]likParam,likParam_int: likelihood parameters (currently, only needed for KDE-based likelihoods, 'full' and 'marg', to pass the KDE bandwidth and number of samples)
[in]pgrid: parameter grid, if requested, to compute exact posterior (can be empty)
[in]nburn: burn-in for MCMC to write to pchain
[in]nstep: thinning of MCMC to write to pchain
[in,out]pchain: thinned chain file with nburn and nstep applied, to be used for postprocessing : if given as non-empty array, the MCMC is skipped, and only postprocessing is performed
[out]mapparam: MAP parameters
[out]datavar_map: MAP value of data variances
[out]pmean_map,pvar_map: MAP values of parameter means and variances
[out]fmean_map,fvar_map: MAP values of function predition (at xgrid) means and variances
[out]postave_datavar: posterior average of data variances
[out]p_postave_mean: posterior average of parameter mean
[out]p_postave_var: posterior average of parameter variance
[out]p_postvar_mean: posterior variance of parameter mean
[out]f_postave_mean: posterior average of function prediction mean
[out]f_postave_var: posterior average of function prediction variance
[out]f_postvar_mean: posterior variance of function prediction mean
[out]paramPCcfs: each column is a vector of parameter PC coefficients corresponding to an MCMC sample from pchain the last column is the MAP value of parameter PC coefficients
+
+
+ +
+
+ +

◆ LogPosterior()

+ +
+
+ + + + + + + + + + + +
double LogPosterior (Array1D< double > & m,
void * mypost_void )
+
+ +

Log-posterior function given a vector of parameters (chain state) and a void* set of auxiliary variables.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/inference_8h.html b/docs/html/inference_8h.html new file mode 100644 index 00000000..9302e647 --- /dev/null +++ b/docs/html/inference_8h.html @@ -0,0 +1,395 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: inference.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
inference.h File Reference
+
+
+ +

Header for the model inference tools. +More...

+
#include <string>
+#include "Array1D.h"
+#include "Array2D.h"
+
+

Go to the source code of this file.

+ + + + + + + + +

+Functions

void infer_model (Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, void *funcInfo, string likType, string priorType, double priora, double priorb, Array2D< double > &xdata, Array1D< Array1D< double > > &ydata, Array2D< double > &xgrid, int dataNoiseInference, Array1D< double > &datanoise_array, int pdim, int order, Array1D< int > &rndInd, Array2D< double > &fixIndNom, string pdfType, string pcType, int seed, int nmcmc, double mcmcgamma, bool optimflag, Array1D< double > &chstart, Array1D< double > &chsig, double likParam, int likParam_int, Array2D< double > &pgrid, Array2D< double > &pchain, int nburn, int nstep, Array1D< double > &mapparam, Array1D< double > &datavar_map, Array1D< double > &pmean_map, Array1D< double > &pvar_map, Array1D< double > &fmean_map, Array1D< double > &fvar_map, Array1D< double > &postave_datavar, Array1D< double > &p_postave_mean, Array1D< double > &p_postave_var, Array1D< double > &p_postvar_mean, Array2D< double > &f_postsam_mean, Array1D< double > &f_postave_mean, Array1D< double > &f_postave_var, Array1D< double > &f_postvar_mean, Array2D< double > &paramPCcfs)
 Main function for inferring model parameters.
 
double LogPosterior (Array1D< double > &m, void *mypost_void)
 Log-posterior function given a vector of parameters (chain state) and a void* set of auxiliary variables.
 
+

Detailed Description

+

Header for the model inference tools.

+
Author
K. Sargsyan 2016 -
+

Function Documentation

+ +

◆ infer_model()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void infer_model (Array1D< Array2D< double >(* forwardFuncs )(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) >,
void * funcInfo,
string likType,
string priorType,
double priora,
double priorb,
Array2D< double > & xdata,
Array1D< Array1D< double > > & ydata,
Array2D< double > & xgrid,
int dataNoiseInference,
Array1D< double > & datanoise_array,
int pdim,
int order,
Array1D< int > & rndInd,
Array2D< double > & fixIndNom,
string pdfType,
string pcType,
int seed,
int nmcmc,
double mcmcgamma,
bool optimflag,
Array1D< double > & chstart,
Array1D< double > & chsig,
double likParam,
int likParam_int,
Array2D< double > & pgrid,
Array2D< double > & pchain,
int nburn,
int nstep,
Array1D< double > & mapparam,
Array1D< double > & datavar_map,
Array1D< double > & pmean_map,
Array1D< double > & pvar_map,
Array1D< double > & fmean_map,
Array1D< double > & fvar_map,
Array1D< double > & postave_datavar,
Array1D< double > & p_postave_mean,
Array1D< double > & p_postave_var,
Array1D< double > & p_postvar_mean,
Array2D< double > & f_postsam_mean,
Array1D< double > & f_postave_mean,
Array1D< double > & f_postave_var,
Array1D< double > & f_postvar_mean,
Array2D< double > & paramPCcfs )
+
+ +

Main function for inferring model parameters.

+
Note
This is written in a fortran style, i.e. some arguments are inputs, and the rest are output
+
Parameters
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
[in]*forwardFuncs: an array of y=f(p,x) functions that take np-by-pdim and nx-by-xdim input arrays and returns an np-by-nx output, see tools/func.h for several examples
[in]funcinfo: auxiliary function-specific information (can be 0)
[in]likType: likelihood type: options are 'full', 'marg', 'mvn', 'gausmarg', 'abc', 'abcm', 'classical', 'koh' (see UQTk Manual)
[in]priorType: prior type: options are 'uniform', 'normal', 'inverse', etc ... (see UQTk Manual)
[in]priora,priorb: prior parameters (todo: need to be made dimension-specific) for uniform, it is the range, for normal it is the moments
[in]xdata: x-values of data, nx-by-xdim
[in]ydata: y-values of data, nx-by-neach
[in]xgrid: x-values where predictive moments are computed after the inference : can be the same as xdata
[in]dataNoiseInference: indicator, data noise stdev is fixed(0), inferred (1), or log-inferred (2)
[in]datanoise_array: data noise stdev array, if fixed, otherwise merely an MCMC starting point
[in]pdim: model parameter dimensionality
[in]order: order of output PC that is computed via NISP in the likelihood
[in]rndInd: array of indices of parameters to be randomized
[in]fixIndNom: array of indices and nominal values of parameters to be fixed
[in]pdfType: type of PDF PC parameterization, options are 'pct','pci' and 'full' (see UQTk Manual)
[in]pcType: type of PC for the PDF parameterization, options are all common PC types, e.g. 'HG','LU'
[in]seed: integer seed for MCMC
[in]nmcmc: number of MCMC steps to follow optimization; if 0, then only optimization is performed if optimflag is True
[in]mcmcgamma: gamma (scaling) parameter for adaptive MCMC
[in]optimflag: indicates if optimization is prepended to MCMC
[in]chstart: initial chain state
[in]chsig: initial non-adaptive, dimensionwise proposal jump size
[in]likParam,likParam_int: likelihood parameters (currently, only needed for KDE-based likelihoods, 'full' and 'marg', to pass the KDE bandwidth and number of samples)
[in]pgrid: parameter grid, if requested, to compute exact posterior (can be empty)
[in]nburn: burn-in for MCMC to write to pchain
[in]nstep: thinning of MCMC to write to pchain
[in,out]pchain: thinned chain file with nburn and nstep applied, to be used for postprocessing : if given as non-empty array, the MCMC is skipped, and only postprocessing is performed
[out]mapparam: MAP parameters
[out]datavar_map: MAP value of data variances
[out]pmean_map,pvar_map: MAP values of parameter means and variances
[out]fmean_map,fvar_map: MAP values of function predition (at xgrid) means and variances
[out]postave_datavar: posterior average of data variances
[out]p_postave_mean: posterior average of parameter mean
[out]p_postave_var: posterior average of parameter variance
[out]p_postvar_mean: posterior variance of parameter mean
[out]f_postave_mean: posterior average of function prediction mean
[out]f_postave_var: posterior average of function prediction variance
[out]f_postvar_mean: posterior variance of function prediction mean
[out]paramPCcfs: each column is a vector of parameter PC coefficients corresponding to an MCMC sample from pchain the last column is the MAP value of parameter PC coefficients
+
+
+ +
+
+ +

◆ LogPosterior()

+ +
+
+ + + + + + + + + + + +
double LogPosterior (Array1D< double > & m,
void * mypost_void )
+
+ +

Log-posterior function given a vector of parameters (chain state) and a void* set of auxiliary variables.

+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/inference_8h_source.html b/docs/html/inference_8h_source.html new file mode 100644 index 00000000..ce5ca1b0 --- /dev/null +++ b/docs/html/inference_8h_source.html @@ -0,0 +1,130 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: inference.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
inference.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
31
+
32#include <string>
+
33
+
34#include "Array1D.h"
+
35#include "Array2D.h"
+
36
+
37
+
87void infer_model(Array1D< Array2D<double> (*)(Array2D<double>&, Array2D<double>&, Array2D<double>&, void *) > forwardFuncs, void* funcInfo,
+
88 string likType,
+
89 string priorType, double priora, double priorb,
+
90 Array2D<double>& xdata,Array1D<Array1D<double>>& ydata, Array2D<double>& xgrid,
+
91 int dataNoiseInference, Array1D<double>& datanoise_array,
+
92 int pdim,int order,Array1D<int>& rndInd,Array2D<double>& fixIndNom,string pdfType,string pcType,
+
93 int seed, int nmcmc, double mcmcgamma, bool optimflag, Array1D<double>& chstart, Array1D<double>& chsig,
+
94 double likParam, int likParam_int,
+
95 Array2D<double>& pgrid,Array2D<double>& pchain, int nburn, int nstep,
+
96 Array1D<double>& mapparam, Array1D<double>& datavar_map,
+
97 Array1D<double>& pmean_map, Array1D<double>& pvar_map,
+
98 Array1D<double>& fmean_map, Array1D<double>& fvar_map,
+
99 Array1D<double>& postave_datavar,
+
100 Array1D<double>& p_postave_mean, Array1D<double>& p_postave_var, Array1D<double>& p_postvar_mean,
+
101 Array2D<double>& f_postsam_mean, Array1D<double>& f_postave_mean, Array1D<double>& f_postave_var, Array1D<double>& f_postvar_mean,
+
102 Array2D<double>& paramPCcfs);
+
103
+
105double LogPosterior(Array1D<double>& m, void* mypost_void);
+
106
+
107
+
Array1D.h
1D Array class for any type T
+
Array2D.h
2D Array class for any type T
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
infer_model
void infer_model(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, void *funcInfo, string likType, string priorType, double priora, double priorb, Array2D< double > &xdata, Array1D< Array1D< double > > &ydata, Array2D< double > &xgrid, int dataNoiseInference, Array1D< double > &datanoise_array, int pdim, int order, Array1D< int > &rndInd, Array2D< double > &fixIndNom, string pdfType, string pcType, int seed, int nmcmc, double mcmcgamma, bool optimflag, Array1D< double > &chstart, Array1D< double > &chsig, double likParam, int likParam_int, Array2D< double > &pgrid, Array2D< double > &pchain, int nburn, int nstep, Array1D< double > &mapparam, Array1D< double > &datavar_map, Array1D< double > &pmean_map, Array1D< double > &pvar_map, Array1D< double > &fmean_map, Array1D< double > &fvar_map, Array1D< double > &postave_datavar, Array1D< double > &p_postave_mean, Array1D< double > &p_postave_var, Array1D< double > &p_postvar_mean, Array2D< double > &f_postsam_mean, Array1D< double > &f_postave_mean, Array1D< double > &f_postave_var, Array1D< double > &f_postvar_mean, Array2D< double > &paramPCcfs)
Main function for inferring model parameters.
Definition inference.cpp:52
+
LogPosterior
double LogPosterior(Array1D< double > &m, void *mypost_void)
Log-posterior function given a vector of parameters (chain state) and a void* set of auxiliary variab...
Definition inference.cpp:311
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/jquery.js b/docs/html/jquery.js new file mode 100644 index 00000000..875ada73 --- /dev/null +++ b/docs/html/jquery.js @@ -0,0 +1,204 @@ +/*! jQuery v3.6.0 | (c) OpenJS Foundation and other contributors | jquery.org/license */ +!function(e,t){"use strict";"object"==typeof module&&"object"==typeof module.exports?module.exports=e.document?t(e,!0):function(e){if(!e.document)throw new Error("jQuery requires a window with a document");return t(e)}:t(e)}("undefined"!=typeof window?window:this,function(C,e){"use strict";var t=[],r=Object.getPrototypeOf,s=t.slice,g=t.flat?function(e){return t.flat.call(e)}:function(e){return t.concat.apply([],e)},u=t.push,i=t.indexOf,n={},o=n.toString,v=n.hasOwnProperty,a=v.toString,l=a.call(Object),y={},m=function(e){return"function"==typeof e&&"number"!=typeof e.nodeType&&"function"!=typeof e.item},x=function(e){return null!=e&&e===e.window},E=C.document,c={type:!0,src:!0,nonce:!0,noModule:!0};function b(e,t,n){var r,i,o=(n=n||E).createElement("script");if(o.text=e,t)for(r in c)(i=t[r]||t.getAttribute&&t.getAttribute(r))&&o.setAttribute(r,i);n.head.appendChild(o).parentNode.removeChild(o)}function w(e){return null==e?e+"":"object"==typeof e||"function"==typeof e?n[o.call(e)]||"object":typeof e} +var f="3.6.0",S=function(e,t){return new S.fn.init(e,t)};function p(e){var t=!!e&&"length"in e&&e.length,n=w(e);return!m(e)&&!x(e)&&("array"===n||0===t||"number"==typeof t&&0+~]|"+M+")"+M+"*"),U=new RegExp(M+"|>"),X=new RegExp(F),V=new RegExp("^"+I+"$"),G={ID:new RegExp("^#("+I+")"),CLASS:new RegExp("^\\.("+I+")"),TAG:new RegExp("^("+I+"|[*])"),ATTR:new RegExp("^"+W),PSEUDO:new RegExp("^"+F),CHILD:new RegExp( +"^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+M+"*(even|odd|(([+-]|)(\\d*)n|)"+M+"*(?:([+-]|)"+M+"*(\\d+)|))"+M+"*\\)|)","i"),bool:new RegExp("^(?:"+R+")$","i"),needsContext:new RegExp("^"+M+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+M+"*((?:-\\d)?\\d*)"+M+"*\\)|)(?=[^-]|$)","i")},Y=/HTML$/i,Q=/^(?:input|select|textarea|button)$/i,J=/^h\d$/i,K=/^[^{]+\{\s*\[native \w/,Z=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,ee=/[+~]/,te=new RegExp("\\\\[\\da-fA-F]{1,6}"+M+"?|\\\\([^\\r\\n\\f])","g"),ne=function(e,t){var n="0x"+e.slice(1)-65536;return t||(n<0?String.fromCharCode(n+65536):String.fromCharCode(n>>10|55296,1023&n|56320))},re=/([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,ie=function(e,t){return t?"\0"===e?"�":e.slice(0,-1)+"\\"+e.charCodeAt(e.length-1).toString(16)+" ":"\\"+e},oe=function(){T()},ae=be(function(e){return!0===e.disabled&&"fieldset"===e.nodeName.toLowerCase()},{dir:"parentNode",next:"legend"});try{H.apply(t=O.call(p.childNodes),p.childNodes),t[p.childNodes.length].nodeType +}catch(e){H={apply:t.length?function(e,t){L.apply(e,O.call(t))}:function(e,t){var n=e.length,r=0;while(e[n++]=t[r++]);e.length=n-1}}}function se(t,e,n,r){var i,o,a,s,u,l,c,f=e&&e.ownerDocument,p=e?e.nodeType:9;if(n=n||[],"string"!=typeof t||!t||1!==p&&9!==p&&11!==p)return n;if(!r&&(T(e),e=e||C,E)){if(11!==p&&(u=Z.exec(t)))if(i=u[1]){if(9===p){if(!(a=e.getElementById(i)))return n;if(a.id===i)return n.push(a),n}else if(f&&(a=f.getElementById(i))&&y(e,a)&&a.id===i)return n.push(a),n}else{if(u[2])return H.apply(n,e.getElementsByTagName(t)),n;if((i=u[3])&&d.getElementsByClassName&&e.getElementsByClassName)return H.apply(n,e.getElementsByClassName(i)),n}if(d.qsa&&!N[t+" "]&&(!v||!v.test(t))&&(1!==p||"object"!==e.nodeName.toLowerCase())){if(c=t,f=e,1===p&&(U.test(t)||z.test(t))){(f=ee.test(t)&&ye(e.parentNode)||e)===e&&d.scope||((s=e.getAttribute("id"))?s=s.replace(re,ie):e.setAttribute("id",s=S)),o=(l=h(t)).length;while(o--)l[o]=(s?"#"+s:":scope")+" "+xe(l[o]);c=l.join(",")}try{return H.apply(n,f.querySelectorAll(c +)),n}catch(e){N(t,!0)}finally{s===S&&e.removeAttribute("id")}}}return g(t.replace($,"$1"),e,n,r)}function ue(){var r=[];return function e(t,n){return r.push(t+" ")>b.cacheLength&&delete e[r.shift()],e[t+" "]=n}}function le(e){return e[S]=!0,e}function ce(e){var t=C.createElement("fieldset");try{return!!e(t)}catch(e){return!1}finally{t.parentNode&&t.parentNode.removeChild(t),t=null}}function fe(e,t){var n=e.split("|"),r=n.length;while(r--)b.attrHandle[n[r]]=t}function pe(e,t){var n=t&&e,r=n&&1===e.nodeType&&1===t.nodeType&&e.sourceIndex-t.sourceIndex;if(r)return r;if(n)while(n=n.nextSibling)if(n===t)return-1;return e?1:-1}function de(t){return function(e){return"input"===e.nodeName.toLowerCase()&&e.type===t}}function he(n){return function(e){var t=e.nodeName.toLowerCase();return("input"===t||"button"===t)&&e.type===n}}function ge(t){return function(e){ +return"form"in e?e.parentNode&&!1===e.disabled?"label"in e?"label"in e.parentNode?e.parentNode.disabled===t:e.disabled===t:e.isDisabled===t||e.isDisabled!==!t&&ae(e)===t:e.disabled===t:"label"in e&&e.disabled===t}}function ve(a){return le(function(o){return o=+o,le(function(e,t){var n,r=a([],e.length,o),i=r.length;while(i--)e[n=r[i]]&&(e[n]=!(t[n]=e[n]))})})}function ye(e){return e&&"undefined"!=typeof e.getElementsByTagName&&e}for(e in d=se.support={},i=se.isXML=function(e){var t=e&&e.namespaceURI,n=e&&(e.ownerDocument||e).documentElement;return!Y.test(t||n&&n.nodeName||"HTML")},T=se.setDocument=function(e){var t,n,r=e?e.ownerDocument||e:p;return r!=C&&9===r.nodeType&&r.documentElement&&(a=(C=r).documentElement,E=!i(C),p!=C&&(n=C.defaultView)&&n.top!==n&&(n.addEventListener?n.addEventListener("unload",oe,!1):n.attachEvent&&n.attachEvent("onunload",oe)),d.scope=ce(function(e){return a.appendChild(e).appendChild(C.createElement("div")),"undefined"!=typeof e.querySelectorAll&&!e.querySelectorAll( +":scope fieldset div").length}),d.attributes=ce(function(e){return e.className="i",!e.getAttribute("className")}),d.getElementsByTagName=ce(function(e){return e.appendChild(C.createComment("")),!e.getElementsByTagName("*").length}),d.getElementsByClassName=K.test(C.getElementsByClassName),d.getById=ce(function(e){return a.appendChild(e).id=S,!C.getElementsByName||!C.getElementsByName(S).length}),d.getById?(b.filter.ID=function(e){var t=e.replace(te,ne);return function(e){return e.getAttribute("id")===t}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n=t.getElementById(e);return n?[n]:[]}}):(b.filter.ID=function(e){var n=e.replace(te,ne);return function(e){var t="undefined"!=typeof e.getAttributeNode&&e.getAttributeNode("id");return t&&t.value===n}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n,r,i,o=t.getElementById(e);if(o){if((n=o.getAttributeNode("id"))&&n.value===e)return[o];i=t.getElementsByName(e),r=0;while(o=i[r++])if((n=o.getAttributeNode("id") +)&&n.value===e)return[o]}return[]}}),b.find.TAG=d.getElementsByTagName?function(e,t){return"undefined"!=typeof t.getElementsByTagName?t.getElementsByTagName(e):d.qsa?t.querySelectorAll(e):void 0}:function(e,t){var n,r=[],i=0,o=t.getElementsByTagName(e);if("*"===e){while(n=o[i++])1===n.nodeType&&r.push(n);return r}return o},b.find.CLASS=d.getElementsByClassName&&function(e,t){if("undefined"!=typeof t.getElementsByClassName&&E)return t.getElementsByClassName(e)},s=[],v=[],(d.qsa=K.test(C.querySelectorAll))&&(ce(function(e){var t;a.appendChild(e).innerHTML="",e.querySelectorAll("[msallowcapture^='']").length&&v.push("[*^$]="+M+"*(?:''|\"\")"),e.querySelectorAll("[selected]").length||v.push("\\["+M+"*(?:value|"+R+")"),e.querySelectorAll("[id~="+S+"-]").length||v.push("~="),(t=C.createElement("input")).setAttribute("name",""),e.appendChild(t),e.querySelectorAll("[name='']").length||v.push( +"\\["+M+"*name"+M+"*="+M+"*(?:''|\"\")"),e.querySelectorAll(":checked").length||v.push(":checked"),e.querySelectorAll("a#"+S+"+*").length||v.push(".#.+[+~]"),e.querySelectorAll("\\\f"),v.push("[\\r\\n\\f]")}),ce(function(e){e.innerHTML="";var t=C.createElement("input");t.setAttribute("type","hidden"),e.appendChild(t).setAttribute("name","D"),e.querySelectorAll("[name=d]").length&&v.push("name"+M+"*[*^$|!~]?="),2!==e.querySelectorAll(":enabled").length&&v.push(":enabled",":disabled"),a.appendChild(e).disabled=!0,2!==e.querySelectorAll(":disabled").length&&v.push(":enabled",":disabled"),e.querySelectorAll("*,:x"),v.push(",.*:")})),(d.matchesSelector=K.test(c=a.matches||a.webkitMatchesSelector||a.mozMatchesSelector||a.oMatchesSelector||a.msMatchesSelector))&&ce(function(e){d.disconnectedMatch=c.call(e,"*"),c.call(e,"[s!='']:x"),s.push("!=",F)}),v=v.length&&new RegExp(v.join("|")),s=s.length&&new RegExp(s.join("|")),t=K.test( +a.compareDocumentPosition),y=t||K.test(a.contains)?function(e,t){var n=9===e.nodeType?e.documentElement:e,r=t&&t.parentNode;return e===r||!(!r||1!==r.nodeType||!(n.contains?n.contains(r):e.compareDocumentPosition&&16&e.compareDocumentPosition(r)))}:function(e,t){if(t)while(t=t.parentNode)if(t===e)return!0;return!1},j=t?function(e,t){if(e===t)return l=!0,0;var n=!e.compareDocumentPosition-!t.compareDocumentPosition;return n||(1&(n=(e.ownerDocument||e)==(t.ownerDocument||t)?e.compareDocumentPosition(t):1)||!d.sortDetached&&t.compareDocumentPosition(e)===n?e==C||e.ownerDocument==p&&y(p,e)?-1:t==C||t.ownerDocument==p&&y(p,t)?1:u?P(u,e)-P(u,t):0:4&n?-1:1)}:function(e,t){if(e===t)return l=!0,0;var n,r=0,i=e.parentNode,o=t.parentNode,a=[e],s=[t];if(!i||!o)return e==C?-1:t==C?1:i?-1:o?1:u?P(u,e)-P(u,t):0;if(i===o)return pe(e,t);n=e;while(n=n.parentNode)a.unshift(n);n=t;while(n=n.parentNode)s.unshift(n);while(a[r]===s[r])r++;return r?pe(a[r],s[r]):a[r]==p?-1:s[r]==p?1:0}),C},se.matches=function(e,t){return se(e,null, +null,t)},se.matchesSelector=function(e,t){if(T(e),d.matchesSelector&&E&&!N[t+" "]&&(!s||!s.test(t))&&(!v||!v.test(t)))try{var n=c.call(e,t);if(n||d.disconnectedMatch||e.document&&11!==e.document.nodeType)return n}catch(e){N(t,!0)}return 0":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace(te,ne),e[3]=(e[3]||e[4]||e[5]||"").replace(te,ne),"~="===e[2]&&(e[3]=" "+e[3]+" "),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),"nth"===e[1].slice(0,3)?(e[3]||se.error(e[0]),e[4]=+(e[4]?e[5]+(e[6]||1):2*("even"===e[3]||"odd"===e[3])),e[5]=+(e[7]+e[8]||"odd"===e[3])):e[3]&&se.error(e[0]),e},PSEUDO:function(e){var t,n=!e[6]&&e[2];return G.CHILD.test(e[0])?null:(e[3]?e[2]=e[4]||e[5]||"":n&&X.test(n)&&(t=h(n,!0))&&(t=n.indexOf(")",n.length-t)-n.length)&&(e[0]=e[0].slice(0,t),e[2]=n.slice(0,t)),e.slice(0,3))}},filter:{TAG:function(e){var t=e.replace(te,ne +).toLowerCase();return"*"===e?function(){return!0}:function(e){return e.nodeName&&e.nodeName.toLowerCase()===t}},CLASS:function(e){var t=m[e+" "];return t||(t=new RegExp("(^|"+M+")"+e+"("+M+"|$)"))&&m(e,function(e){return t.test("string"==typeof e.className&&e.className||"undefined"!=typeof e.getAttribute&&e.getAttribute("class")||"")})},ATTR:function(n,r,i){return function(e){var t=se.attr(e,n);return null==t?"!="===r:!r||(t+="","="===r?t===i:"!="===r?t!==i:"^="===r?i&&0===t.indexOf(i):"*="===r?i&&-1:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;function j(e,n,r){return m(n)?S.grep(e,function(e,t){return!!n.call(e,t,e)!==r}):n.nodeType?S.grep(e,function(e){return e===n!==r}):"string"!=typeof n?S.grep(e,function(e){return-1)[^>]*|#([\w-]+))$/;(S.fn.init=function(e,t,n){var r,i;if(!e)return this;if(n=n||D,"string"==typeof e){if(!(r="<"===e[0]&&">"===e[e.length-1]&&3<=e.length?[null,e,null]:q.exec(e))||!r[1]&&t)return!t||t.jquery?(t||n).find(e):this.constructor(t).find(e);if(r[1]){if(t=t instanceof S?t[0]:t,S.merge(this,S.parseHTML(r[1],t&&t.nodeType?t.ownerDocument||t:E,!0)),N.test(r[1])&&S.isPlainObject(t))for(r in t)m(this[r])?this[r](t[r]):this.attr(r,t[r]);return this}return(i=E.getElementById(r[2]))&&(this[0]=i,this.length=1),this}return e.nodeType?(this[0]=e,this.length=1,this):m(e)?void 0!==n.ready?n.ready(e):e(S):S.makeArray(e,this)}).prototype=S.fn,D=S(E);var L=/^(?:parents|prev(?:Until|All))/,H={children:!0,contents:!0,next:!0,prev:!0};function O(e,t){while((e=e[t])&&1!==e.nodeType);return e}S.fn.extend({has:function(e){var t=S(e,this),n=t.length;return this.filter(function(){for( +var e=0;e\x20\t\r\n\f]*)/i,he=/^$|^module$|\/(?:java|ecma)script/i;ce=E.createDocumentFragment().appendChild(E.createElement("div")),(fe=E.createElement("input")).setAttribute("type","radio"),fe.setAttribute("checked","checked"),fe.setAttribute("name","t"),ce.appendChild(fe),y.checkClone=ce.cloneNode(!0).cloneNode(!0).lastChild.checked,ce.innerHTML="",y.noCloneChecked=!!ce.cloneNode(!0).lastChild.defaultValue,ce.innerHTML="",y.option=!!ce.lastChild;var ge={thead:[1,"","
"],col:[2,"","
"],tr:[2,"","
"],td:[3,"","
"],_default:[0,"",""]};function ve(e,t){var n; +return n="undefined"!=typeof e.getElementsByTagName?e.getElementsByTagName(t||"*"):"undefined"!=typeof e.querySelectorAll?e.querySelectorAll(t||"*"):[],void 0===t||t&&A(e,t)?S.merge([e],n):n}function ye(e,t){for(var n=0,r=e.length;n",""]);var me=/<|&#?\w+;/;function xe(e,t,n,r,i){for(var o,a,s,u,l,c,f=t.createDocumentFragment(),p=[],d=0,h=e.length;d\s*$/g;function je(e,t){return A(e,"table")&&A(11!==t.nodeType?t:t.firstChild,"tr")&&S(e).children("tbody")[0]||e}function De(e){return e.type=(null!==e.getAttribute("type"))+"/"+e.type,e}function qe(e){return"true/"===(e.type||"").slice(0,5)?e.type=e.type.slice(5):e.removeAttribute("type"),e}function Le(e,t){var n,r,i,o,a,s;if(1===t.nodeType){if(Y.hasData(e)&&(s=Y.get(e).events))for(i in Y.remove(t,"handle events"),s)for(n=0, +r=s[i].length;n").attr(n.scriptAttrs||{}).prop({charset:n.scriptCharset,src:n.url}).on("load error",i=function(e){r.remove(),i=null,e&&t("error"===e.type?404:200,e.type)}),E.head.appendChild(r[0])},abort:function(){i&&i()}}});var _t,zt=[],Ut=/(=)\?(?=&|$)|\?\?/;S.ajaxSetup({jsonp:"callback",jsonpCallback:function(){var e=zt.pop()||S.expando+"_"+wt.guid++;return this[e]=!0,e}}),S.ajaxPrefilter("json jsonp",function(e,t,n){var r,i,o,a=!1!==e.jsonp&&(Ut.test(e.url)?"url":"string"==typeof e.data&&0===(e.contentType||"").indexOf("application/x-www-form-urlencoded")&&Ut.test(e.data)&&"data");if(a||"jsonp"===e.dataTypes[0])return r=e.jsonpCallback=m(e.jsonpCallback)?e.jsonpCallback():e.jsonpCallback,a?e[a]=e[a].replace(Ut,"$1"+r):!1!==e.jsonp&&(e.url+=(Tt.test(e.url)?"&":"?")+e.jsonp+"="+r),e.converters["script json"]=function(){return o||S.error(r+" was not called"),o[0]},e.dataTypes[0]="json",i=C[r] +,C[r]=function(){o=arguments},n.always(function(){void 0===i?S(C).removeProp(r):C[r]=i,e[r]&&(e.jsonpCallback=t.jsonpCallback,zt.push(r)),o&&m(i)&&i(o[0]),o=i=void 0}),"script"}),y.createHTMLDocument=((_t=E.implementation.createHTMLDocument("").body).innerHTML="
",2===_t.childNodes.length),S.parseHTML=function(e,t,n){return"string"!=typeof e?[]:("boolean"==typeof t&&(n=t,t=!1),t||(y.createHTMLDocument?((r=(t=E.implementation.createHTMLDocument("")).createElement("base")).href=E.location.href,t.head.appendChild(r)):t=E),o=!n&&[],(i=N.exec(e))?[t.createElement(i[1])]:(i=xe([e],t,o),o&&o.length&&S(o).remove(),S.merge([],i.childNodes)));var r,i,o},S.fn.load=function(e,t,n){var r,i,o,a=this,s=e.indexOf(" ");return-1").append(S.parseHTML(e)).find(r):e)}).always(n&&function(e,t){a.each( +function(){n.apply(this,o||[e.responseText,t,e])})}),this},S.expr.pseudos.animated=function(t){return S.grep(S.timers,function(e){return t===e.elem}).length},S.offset={setOffset:function(e,t,n){var r,i,o,a,s,u,l=S.css(e,"position"),c=S(e),f={};"static"===l&&(e.style.position="relative"),s=c.offset(),o=S.css(e,"top"),u=S.css(e,"left"),("absolute"===l||"fixed"===l)&&-1<(o+u).indexOf("auto")?(a=(r=c.position()).top,i=r.left):(a=parseFloat(o)||0,i=parseFloat(u)||0),m(t)&&(t=t.call(e,n,S.extend({},s))),null!=t.top&&(f.top=t.top-s.top+a),null!=t.left&&(f.left=t.left-s.left+i),"using"in t?t.using.call(e,f):c.css(f)}},S.fn.extend({offset:function(t){if(arguments.length)return void 0===t?this:this.each(function(e){S.offset.setOffset(this,t,e)});var e,n,r=this[0];return r?r.getClientRects().length?(e=r.getBoundingClientRect(),n=r.ownerDocument.defaultView,{top:e.top+n.pageYOffset,left:e.left+n.pageXOffset}):{top:0,left:0}:void 0},position:function(){if(this[0]){var e,t,n,r=this[0],i={top:0,left:0};if("fixed"===S.css(r, +"position"))t=r.getBoundingClientRect();else{t=this.offset(),n=r.ownerDocument,e=r.offsetParent||n.documentElement;while(e&&(e===n.body||e===n.documentElement)&&"static"===S.css(e,"position"))e=e.parentNode;e&&e!==r&&1===e.nodeType&&((i=S(e).offset()).top+=S.css(e,"borderTopWidth",!0),i.left+=S.css(e,"borderLeftWidth",!0))}return{top:t.top-i.top-S.css(r,"marginTop",!0),left:t.left-i.left-S.css(r,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var e=this.offsetParent;while(e&&"static"===S.css(e,"position"))e=e.offsetParent;return e||re})}}),S.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(t,i){var o="pageYOffset"===i;S.fn[t]=function(e){return $(this,function(e,t,n){var r;if(x(e)?r=e:9===e.nodeType&&(r=e.defaultView),void 0===n)return r?r[i]:e[t];r?r.scrollTo(o?r.pageXOffset:n,o?n:r.pageYOffset):e[t]=n},t,e,arguments.length)}}),S.each(["top","left"],function(e,n){S.cssHooks[n]=Fe(y.pixelPosition,function(e,t){if(t)return t=We(e,n),Pe.test(t)?S(e).position()[n]+"px":t})} +),S.each({Height:"height",Width:"width"},function(a,s){S.each({padding:"inner"+a,content:s,"":"outer"+a},function(r,o){S.fn[o]=function(e,t){var n=arguments.length&&(r||"boolean"!=typeof e),i=r||(!0===e||!0===t?"margin":"border");return $(this,function(e,t,n){var r;return x(e)?0===o.indexOf("outer")?e["inner"+a]:e.document.documentElement["client"+a]:9===e.nodeType?(r=e.documentElement,Math.max(e.body["scroll"+a],r["scroll"+a],e.body["offset"+a],r["offset"+a],r["client"+a])):void 0===n?S.css(e,t,i):S.style(e,t,n,i)},s,n?e:void 0,n)}})}),S.each(["ajaxStart","ajaxStop","ajaxComplete","ajaxError","ajaxSuccess","ajaxSend"],function(e,t){S.fn[t]=function(e){return this.on(t,e)}}),S.fn.extend({bind:function(e,t,n){return this.on(e,null,t,n)},unbind:function(e,t){return this.off(e,null,t)},delegate:function(e,t,n,r){return this.on(t,e,n,r)},undelegate:function(e,t,n){return 1===arguments.length?this.off(e,"**"):this.off(t,e||"**",n)},hover:function(e,t){return this.mouseenter(e).mouseleave(t||e)}}),S.each( +"blur focus focusin focusout resize scroll click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup contextmenu".split(" "),function(e,n){S.fn[n]=function(e,t){return 0",options:{classes:{},disabled:!1,create:null},_createWidget:function(t,e){e=y(e||this.defaultElement||this)[0],this.element=y(e),this.uuid=i++,this.eventNamespace="."+this.widgetName+this.uuid,this.bindings=y(),this.hoverable=y(),this.focusable=y(),this.classesElementLookup={},e!==this&&(y.data(e,this.widgetFullName,this),this._on(!0,this.element,{remove:function(t +){t.target===e&&this.destroy()}}),this.document=y(e.style?e.ownerDocument:e.document||e),this.window=y(this.document[0].defaultView||this.document[0].parentWindow)),this.options=y.widget.extend({},this.options,this._getCreateOptions(),t),this._create(),this.options.disabled&&this._setOptionDisabled(this.options.disabled),this._trigger("create",null,this._getCreateEventData()),this._init()},_getCreateOptions:function(){return{}},_getCreateEventData:y.noop,_create:y.noop,_init:y.noop,destroy:function(){var i=this;this._destroy(),y.each(this.classesElementLookup,function(t,e){i._removeClass(e,t)}),this.element.off(this.eventNamespace).removeData(this.widgetFullName),this.widget().off(this.eventNamespace).removeAttr("aria-disabled"),this.bindings.off(this.eventNamespace)},_destroy:y.noop,widget:function(){return this.element},option:function(t,e){var i,s,n,o=t;if(0===arguments.length)return y.widget.extend({},this.options);if("string"==typeof t)if(o={},t=(i=t.split(".")).shift(),i.length){for(s=o[t +]=y.widget.extend({},this.options[t]),n=0;n
"),i=e.children()[0];return y("body").append(e),t=i.offsetWidth,e.css("overflow","scroll"),t===(i=i.offsetWidth)&&(i=e[0].clientWidth),e.remove(),s=t-i}, +getScrollInfo:function(t){var e=t.isWindow||t.isDocument?"":t.element.css("overflow-x"),i=t.isWindow||t.isDocument?"":t.element.css("overflow-y"),e="scroll"===e||"auto"===e&&t.widthx(D(s),D(n))?o.important="horizontal":o.important="vertical",p.using.call(this,t,o)}),h.offset(y.extend(l,{using:t}))})},y.ui.position={fit:{left:function(t,e){var i=e.within, +s=i.isWindow?i.scrollLeft:i.offset.left,n=i.width,o=t.left-e.collisionPosition.marginLeft,h=s-o,a=o+e.collisionWidth-n-s;e.collisionWidth>n?0n?0=this.options.distance},_mouseDelayMet:function(){return this.mouseDelayMet},_mouseStart:function(){},_mouseDrag:function(){},_mouseStop:function(){},_mouseCapture:function(){return!0}}),y.ui.plugin={add:function(t,e,i){var s,n=y.ui[t].prototype;for(s in i)n.plugins[s]=n.plugins[s]||[],n.plugins[s].push([e,i[s]])},call:function(t,e,i,s){var n,o=t.plugins[e];if(o&&(s||t.element[0].parentNode&&11!==t.element[0].parentNode.nodeType))for(n=0;n").css({overflow:"hidden",position:this.element.css("position"),width:this.element.outerWidth(),height:this.element.outerHeight(),top:this.element.css("top"),left:this.element.css("left")})), +this.element=this.element.parent().data("ui-resizable",this.element.resizable("instance")),this.elementIsWrapper=!0,t={marginTop:this.originalElement.css("marginTop"),marginRight:this.originalElement.css("marginRight"),marginBottom:this.originalElement.css("marginBottom"),marginLeft:this.originalElement.css("marginLeft")},this.element.css(t),this.originalElement.css("margin",0),this.originalResizeStyle=this.originalElement.css("resize"),this.originalElement.css("resize","none"),this._proportionallyResizeElements.push(this.originalElement.css({position:"static",zoom:1,display:"block"})),this.originalElement.css(t),this._proportionallyResize()),this._setupHandles(),e.autoHide&&y(this.element).on("mouseenter",function(){e.disabled||(i._removeClass("ui-resizable-autohide"),i._handles.show())}).on("mouseleave",function(){e.disabled||i.resizing||(i._addClass("ui-resizable-autohide"),i._handles.hide())}),this._mouseInit()},_destroy:function(){this._mouseDestroy(),this._addedHandles.remove();function t(t){y(t +).removeData("resizable").removeData("ui-resizable").off(".resizable")}var e;return this.elementIsWrapper&&(t(this.element),e=this.element,this.originalElement.css({position:e.css("position"),width:e.outerWidth(),height:e.outerHeight(),top:e.css("top"),left:e.css("left")}).insertAfter(e),e.remove()),this.originalElement.css("resize",this.originalResizeStyle),t(this.originalElement),this},_setOption:function(t,e){switch(this._super(t,e),t){case"handles":this._removeHandles(),this._setupHandles();break;case"aspectRatio":this._aspectRatio=!!e}},_setupHandles:function(){var t,e,i,s,n,o=this.options,h=this;if(this.handles=o.handles||(y(".ui-resizable-handle",this.element).length?{n:".ui-resizable-n",e:".ui-resizable-e",s:".ui-resizable-s",w:".ui-resizable-w",se:".ui-resizable-se",sw:".ui-resizable-sw",ne:".ui-resizable-ne",nw:".ui-resizable-nw"}:"e,s,se"),this._handles=y(),this._addedHandles=y(),this.handles.constructor===String)for("all"===this.handles&&(this.handles="n,e,s,w,se,sw,ne,nw"),i=this.handles.split( +","),this.handles={},e=0;e"),this._addClass(n,"ui-resizable-handle "+s),n.css({zIndex:o.zIndex}),this.handles[t]=".ui-resizable-"+t,this.element.children(this.handles[t]).length||(this.element.append(n),this._addedHandles=this._addedHandles.add(n));this._renderAxis=function(t){var e,i,s;for(e in t=t||this.element,this.handles)this.handles[e].constructor===String?this.handles[e]=this.element.children(this.handles[e]).first().show():(this.handles[e].jquery||this.handles[e].nodeType)&&(this.handles[e]=y(this.handles[e]),this._on(this.handles[e],{mousedown:h._mouseDown})),this.elementIsWrapper&&this.originalElement[0].nodeName.match(/^(textarea|input|select|button)$/i)&&(i=y(this.handles[e],this.element),s=/sw|ne|nw|se|n|s/.test(e)?i.outerHeight():i.outerWidth(),i=["padding",/ne|nw|n/.test(e)?"Top":/se|sw|s/.test(e)?"Bottom":/^e$/.test(e)?"Right":"Left"].join(""),t.css(i,s),this._proportionallyResize()),this._handles=this._handles.add( +this.handles[e])},this._renderAxis(this.element),this._handles=this._handles.add(this.element.find(".ui-resizable-handle")),this._handles.disableSelection(),this._handles.on("mouseover",function(){h.resizing||(this.className&&(n=this.className.match(/ui-resizable-(se|sw|ne|nw|n|e|s|w)/i)),h.axis=n&&n[1]?n[1]:"se")}),o.autoHide&&(this._handles.hide(),this._addClass("ui-resizable-autohide"))},_removeHandles:function(){this._addedHandles.remove()},_mouseCapture:function(t){var e,i,s=!1;for(e in this.handles)(i=y(this.handles[e])[0])!==t.target&&!y.contains(i,t.target)||(s=!0);return!this.options.disabled&&s},_mouseStart:function(t){var e,i,s=this.options,n=this.element;return this.resizing=!0,this._renderProxy(),e=this._num(this.helper.css("left")),i=this._num(this.helper.css("top")),s.containment&&(e+=y(s.containment).scrollLeft()||0,i+=y(s.containment).scrollTop()||0),this.offset=this.helper.offset(),this.position={left:e,top:i},this.size=this._helper?{width:this.helper.width(),height:this.helper.height()}:{ +width:n.width(),height:n.height()},this.originalSize=this._helper?{width:n.outerWidth(),height:n.outerHeight()}:{width:n.width(),height:n.height()},this.sizeDiff={width:n.outerWidth()-n.width(),height:n.outerHeight()-n.height()},this.originalPosition={left:e,top:i},this.originalMousePosition={left:t.pageX,top:t.pageY},this.aspectRatio="number"==typeof s.aspectRatio?s.aspectRatio:this.originalSize.width/this.originalSize.height||1,s=y(".ui-resizable-"+this.axis).css("cursor"),y("body").css("cursor","auto"===s?this.axis+"-resize":s),this._addClass("ui-resizable-resizing"),this._propagate("start",t),!0},_mouseDrag:function(t){var e=this.originalMousePosition,i=this.axis,s=t.pageX-e.left||0,e=t.pageY-e.top||0,i=this._change[i];return this._updatePrevProperties(),i&&(e=i.apply(this,[t,s,e]),this._updateVirtualBoundaries(t.shiftKey),(this._aspectRatio||t.shiftKey)&&(e=this._updateRatio(e,t)),e=this._respectSize(e,t),this._updateCache(e),this._propagate("resize",t),e=this._applyChanges(), +!this._helper&&this._proportionallyResizeElements.length&&this._proportionallyResize(),y.isEmptyObject(e)||(this._updatePrevProperties(),this._trigger("resize",t,this.ui()),this._applyChanges())),!1},_mouseStop:function(t){this.resizing=!1;var e,i,s,n=this.options,o=this;return this._helper&&(s=(e=(i=this._proportionallyResizeElements).length&&/textarea/i.test(i[0].nodeName))&&this._hasScroll(i[0],"left")?0:o.sizeDiff.height,i=e?0:o.sizeDiff.width,e={width:o.helper.width()-i,height:o.helper.height()-s},i=parseFloat(o.element.css("left"))+(o.position.left-o.originalPosition.left)||null,s=parseFloat(o.element.css("top"))+(o.position.top-o.originalPosition.top)||null,n.animate||this.element.css(y.extend(e,{top:s,left:i})),o.helper.height(o.size.height),o.helper.width(o.size.width),this._helper&&!n.animate&&this._proportionallyResize()),y("body").css("cursor","auto"),this._removeClass("ui-resizable-resizing"),this._propagate("stop",t),this._helper&&this.helper.remove(),!1},_updatePrevProperties:function(){ +this.prevPosition={top:this.position.top,left:this.position.left},this.prevSize={width:this.size.width,height:this.size.height}},_applyChanges:function(){var t={};return this.position.top!==this.prevPosition.top&&(t.top=this.position.top+"px"),this.position.left!==this.prevPosition.left&&(t.left=this.position.left+"px"),this.size.width!==this.prevSize.width&&(t.width=this.size.width+"px"),this.size.height!==this.prevSize.height&&(t.height=this.size.height+"px"),this.helper.css(t),t},_updateVirtualBoundaries:function(t){var e,i,s=this.options,n={minWidth:this._isNumber(s.minWidth)?s.minWidth:0,maxWidth:this._isNumber(s.maxWidth)?s.maxWidth:1/0,minHeight:this._isNumber(s.minHeight)?s.minHeight:0,maxHeight:this._isNumber(s.maxHeight)?s.maxHeight:1/0};(this._aspectRatio||t)&&(e=n.minHeight*this.aspectRatio,i=n.minWidth/this.aspectRatio,s=n.maxHeight*this.aspectRatio,t=n.maxWidth/this.aspectRatio,e>n.minWidth&&(n.minWidth=e),i>n.minHeight&&(n.minHeight=i),st.width,h=this._isNumber(t.height)&&e.minHeight&&e.minHeight>t.height,a=this.originalPosition.left+this.originalSize.width,r=this.originalPosition.top+this.originalSize.height +,l=/sw|nw|w/.test(i),i=/nw|ne|n/.test(i);return o&&(t.width=e.minWidth),h&&(t.height=e.minHeight),s&&(t.width=e.maxWidth),n&&(t.height=e.maxHeight),o&&l&&(t.left=a-e.minWidth),s&&l&&(t.left=a-e.maxWidth),h&&i&&(t.top=r-e.minHeight),n&&i&&(t.top=r-e.maxHeight),t.width||t.height||t.left||!t.top?t.width||t.height||t.top||!t.left||(t.left=null):t.top=null,t},_getPaddingPlusBorderDimensions:function(t){for(var e=0,i=[],s=[t.css("borderTopWidth"),t.css("borderRightWidth"),t.css("borderBottomWidth"),t.css("borderLeftWidth")],n=[t.css("paddingTop"),t.css("paddingRight"),t.css("paddingBottom"),t.css("paddingLeft")];e<4;e++)i[e]=parseFloat(s[e])||0,i[e]+=parseFloat(n[e])||0;return{height:i[0]+i[2],width:i[1]+i[3]}},_proportionallyResize:function(){if(this._proportionallyResizeElements.length)for(var t,e=0,i=this.helper||this.element;e").css({overflow:"hidden"}),this._addClass(this.helper,this._helper),this.helper.css({width:this.element.outerWidth(),height:this.element.outerHeight(),position:"absolute",left:this.elementOffset.left+"px",top:this.elementOffset.top+"px",zIndex:++e.zIndex}),this.helper.appendTo("body").disableSelection()):this.helper=this.element},_change:{e:function(t,e){return{width:this.originalSize.width+e}},w:function(t,e){var i=this.originalSize;return{left:this.originalPosition.left+e,width:i.width-e}},n:function(t,e,i){var s=this.originalSize;return{top:this.originalPosition.top+i,height:s.height-i}},s:function(t,e,i){return{height:this.originalSize.height+i}},se:function(t,e,i){return y.extend(this._change.s.apply(this,arguments),this._change.e.apply(this,[t,e,i]))},sw:function(t,e, +i){return y.extend(this._change.s.apply(this,arguments),this._change.w.apply(this,[t,e,i]))},ne:function(t,e,i){return y.extend(this._change.n.apply(this,arguments),this._change.e.apply(this,[t,e,i]))},nw:function(t,e,i){return y.extend(this._change.n.apply(this,arguments),this._change.w.apply(this,[t,e,i]))}},_propagate:function(t,e){y.ui.plugin.call(this,t,[e,this.ui()]),"resize"!==t&&this._trigger(t,e,this.ui())},plugins:{},ui:function(){return{originalElement:this.originalElement,element:this.element,helper:this.helper,position:this.position,size:this.size,originalSize:this.originalSize,originalPosition:this.originalPosition}}}),y.ui.plugin.add("resizable","animate",{stop:function(e){var i=y(this).resizable("instance"),t=i.options,s=i._proportionallyResizeElements,n=s.length&&/textarea/i.test(s[0].nodeName),o=n&&i._hasScroll(s[0],"left")?0:i.sizeDiff.height,h=n?0:i.sizeDiff.width,n={width:i.size.width-h,height:i.size.height-o},h=parseFloat(i.element.css("left"))+(i.position.left-i.originalPosition.left +)||null,o=parseFloat(i.element.css("top"))+(i.position.top-i.originalPosition.top)||null;i.element.animate(y.extend(n,o&&h?{top:o,left:h}:{}),{duration:t.animateDuration,easing:t.animateEasing,step:function(){var t={width:parseFloat(i.element.css("width")),height:parseFloat(i.element.css("height")),top:parseFloat(i.element.css("top")),left:parseFloat(i.element.css("left"))};s&&s.length&&y(s[0]).css({width:t.width,height:t.height}),i._updateCache(t),i._propagate("resize",e)}})}}),y.ui.plugin.add("resizable","containment",{start:function(){var i,s,n=y(this).resizable("instance"),t=n.options,e=n.element,o=t.containment,h=o instanceof y?o.get(0):/parent/.test(o)?e.parent().get(0):o;h&&(n.containerElement=y(h),/document/.test(o)||o===document?(n.containerOffset={left:0,top:0},n.containerPosition={left:0,top:0},n.parentData={element:y(document),left:0,top:0,width:y(document).width(),height:y(document).height()||document.body.parentNode.scrollHeight}):(i=y(h),s=[],y(["Top","Right","Left","Bottom"]).each(function(t,e +){s[t]=n._num(i.css("padding"+e))}),n.containerOffset=i.offset(),n.containerPosition=i.position(),n.containerSize={height:i.innerHeight()-s[3],width:i.innerWidth()-s[1]},t=n.containerOffset,e=n.containerSize.height,o=n.containerSize.width,o=n._hasScroll(h,"left")?h.scrollWidth:o,e=n._hasScroll(h)?h.scrollHeight:e,n.parentData={element:h,left:t.left,top:t.top,width:o,height:e}))},resize:function(t){var e=y(this).resizable("instance"),i=e.options,s=e.containerOffset,n=e.position,o=e._aspectRatio||t.shiftKey,h={top:0,left:0},a=e.containerElement,t=!0;a[0]!==document&&/static/.test(a.css("position"))&&(h=s),n.left<(e._helper?s.left:0)&&(e.size.width=e.size.width+(e._helper?e.position.left-s.left:e.position.left-h.left),o&&(e.size.height=e.size.width/e.aspectRatio,t=!1),e.position.left=i.helper?s.left:0),n.top<(e._helper?s.top:0)&&(e.size.height=e.size.height+(e._helper?e.position.top-s.top:e.position.top),o&&(e.size.width=e.size.height*e.aspectRatio,t=!1),e.position.top=e._helper?s.top:0), +i=e.containerElement.get(0)===e.element.parent().get(0),n=/relative|absolute/.test(e.containerElement.css("position")),i&&n?(e.offset.left=e.parentData.left+e.position.left,e.offset.top=e.parentData.top+e.position.top):(e.offset.left=e.element.offset().left,e.offset.top=e.element.offset().top),n=Math.abs(e.sizeDiff.width+(e._helper?e.offset.left-h.left:e.offset.left-s.left)),s=Math.abs(e.sizeDiff.height+(e._helper?e.offset.top-h.top:e.offset.top-s.top)),n+e.size.width>=e.parentData.width&&(e.size.width=e.parentData.width-n,o&&(e.size.height=e.size.width/e.aspectRatio,t=!1)),s+e.size.height>=e.parentData.height&&(e.size.height=e.parentData.height-s,o&&(e.size.width=e.size.height*e.aspectRatio,t=!1)),t||(e.position.left=e.prevPosition.left,e.position.top=e.prevPosition.top,e.size.width=e.prevSize.width,e.size.height=e.prevSize.height)},stop:function(){var t=y(this).resizable("instance"),e=t.options,i=t.containerOffset,s=t.containerPosition,n=t.containerElement,o=y(t.helper),h=o.offset(),a=o.outerWidth( +)-t.sizeDiff.width,o=o.outerHeight()-t.sizeDiff.height;t._helper&&!e.animate&&/relative/.test(n.css("position"))&&y(this).css({left:h.left-s.left-i.left,width:a,height:o}),t._helper&&!e.animate&&/static/.test(n.css("position"))&&y(this).css({left:h.left-s.left-i.left,width:a,height:o})}}),y.ui.plugin.add("resizable","alsoResize",{start:function(){var t=y(this).resizable("instance").options;y(t.alsoResize).each(function(){var t=y(this);t.data("ui-resizable-alsoresize",{width:parseFloat(t.width()),height:parseFloat(t.height()),left:parseFloat(t.css("left")),top:parseFloat(t.css("top"))})})},resize:function(t,i){var e=y(this).resizable("instance"),s=e.options,n=e.originalSize,o=e.originalPosition,h={height:e.size.height-n.height||0,width:e.size.width-n.width||0,top:e.position.top-o.top||0,left:e.position.left-o.left||0};y(s.alsoResize).each(function(){var t=y(this),s=y(this).data("ui-resizable-alsoresize"),n={},e=t.parents(i.originalElement[0]).length?["width","height"]:["width","height","top","left"];y.each(e, +function(t,e){var i=(s[e]||0)+(h[e]||0);i&&0<=i&&(n[e]=i||null)}),t.css(n)})},stop:function(){y(this).removeData("ui-resizable-alsoresize")}}),y.ui.plugin.add("resizable","ghost",{start:function(){var t=y(this).resizable("instance"),e=t.size;t.ghost=t.originalElement.clone(),t.ghost.css({opacity:.25,display:"block",position:"relative",height:e.height,width:e.width,margin:0,left:0,top:0}),t._addClass(t.ghost,"ui-resizable-ghost"),!1!==y.uiBackCompat&&"string"==typeof t.options.ghost&&t.ghost.addClass(this.options.ghost),t.ghost.appendTo(t.helper)},resize:function(){var t=y(this).resizable("instance");t.ghost&&t.ghost.css({position:"relative",height:t.size.height,width:t.size.width})},stop:function(){var t=y(this).resizable("instance");t.ghost&&t.helper&&t.helper.get(0).removeChild(t.ghost.get(0))}}),y.ui.plugin.add("resizable","grid",{resize:function(){var t,e=y(this).resizable("instance"),i=e.options,s=e.size,n=e.originalSize,o=e.originalPosition,h=e.axis,a="number"==typeof i.grid?[i.grid,i.grid]:i.grid,r=a[0 +]||1,l=a[1]||1,u=Math.round((s.width-n.width)/r)*r,p=Math.round((s.height-n.height)/l)*l,d=n.width+u,c=n.height+p,f=i.maxWidth&&i.maxWidthd,s=i.minHeight&&i.minHeight>c;i.grid=a,m&&(d+=r),s&&(c+=l),f&&(d-=r),g&&(c-=l),/^(se|s|e)$/.test(h)?(e.size.width=d,e.size.height=c):/^(ne)$/.test(h)?(e.size.width=d,e.size.height=c,e.position.top=o.top-p):/^(sw)$/.test(h)?(e.size.width=d,e.size.height=c,e.position.left=o.left-u):((c-l<=0||d-r<=0)&&(t=e._getPaddingPlusBorderDimensions(this)),0=f[g]?0:Math.min(f[g],n));!a&&1-1){ +targetElements.on(evt+EVENT_NAMESPACE,function elementToggle(event){$.powerTip.toggle(this,event)})}else{targetElements.on(evt+EVENT_NAMESPACE,function elementOpen(event){$.powerTip.show(this,event)})}});$.each(options.closeEvents,function(idx,evt){if($.inArray(evt,options.openEvents)<0){targetElements.on(evt+EVENT_NAMESPACE,function elementClose(event){$.powerTip.hide(this,!isMouseEvent(event))})}});targetElements.on("keydown"+EVENT_NAMESPACE,function elementKeyDown(event){if(event.keyCode===27){$.powerTip.hide(this,true)}})}return targetElements};$.fn.powerTip.defaults={fadeInTime:200,fadeOutTime:100,followMouse:false,popupId:"powerTip",popupClass:null,intentSensitivity:7,intentPollInterval:100,closeDelay:100,placement:"n",smartPlacement:false,offset:10,mouseOnToPopup:false,manual:false,openEvents:["mouseenter","focus"],closeEvents:["mouseleave","blur"]};$.fn.powerTip.smartPlacementLists={n:["n","ne","nw","s"],e:["e","ne","se","w","nw","sw","n","s","e"],s:["s","se","sw","n"],w:["w","nw","sw","e","ne","se", +"n","s","w"],nw:["nw","w","sw","n","s","se","nw"],ne:["ne","e","se","n","s","sw","ne"],sw:["sw","w","nw","s","n","ne","sw"],se:["se","e","ne","s","n","nw","se"],"nw-alt":["nw-alt","n","ne-alt","sw-alt","s","se-alt","w","e"],"ne-alt":["ne-alt","n","nw-alt","se-alt","s","sw-alt","e","w"],"sw-alt":["sw-alt","s","se-alt","nw-alt","n","ne-alt","w","e"],"se-alt":["se-alt","s","sw-alt","ne-alt","n","nw-alt","e","w"]};$.powerTip={show:function apiShowTip(element,event){if(isMouseEvent(event)){trackMouse(event);session.previousX=event.pageX;session.previousY=event.pageY;$(element).data(DATA_DISPLAYCONTROLLER).show()}else{$(element).first().data(DATA_DISPLAYCONTROLLER).show(true,true)}return element},reposition:function apiResetPosition(element){$(element).first().data(DATA_DISPLAYCONTROLLER).resetPosition();return element},hide:function apiCloseTip(element,immediate){var displayController;immediate=element?immediate:true;if(element){displayController=$(element).first().data(DATA_DISPLAYCONTROLLER)}else if( +session.activeHover){displayController=session.activeHover.data(DATA_DISPLAYCONTROLLER)}if(displayController){displayController.hide(immediate)}return element},toggle:function apiToggle(element,event){if(session.activeHover&&session.activeHover.is(element)){$.powerTip.hide(element,!isMouseEvent(event))}else{$.powerTip.show(element,event)}return element}};$.powerTip.showTip=$.powerTip.show;$.powerTip.closeTip=$.powerTip.hide;function CSSCoordinates(){var me=this;me.top="auto";me.left="auto";me.right="auto";me.bottom="auto";me.set=function(property,value){if($.isNumeric(value)){me[property]=Math.round(value)}}}function DisplayController(element,options,tipController){var hoverTimer=null,myCloseDelay=null;function openTooltip(immediate,forceOpen){cancelTimer();if(!element.data(DATA_HASACTIVEHOVER)){if(!immediate){session.tipOpenImminent=true;hoverTimer=setTimeout(function intentDelay(){hoverTimer=null;checkForIntent()},options.intentPollInterval)}else{if(forceOpen){element.data(DATA_FORCEDOPEN,true)} +closeAnyDelayed();tipController.showTip(element)}}else{cancelClose()}}function closeTooltip(disableDelay){if(myCloseDelay){myCloseDelay=session.closeDelayTimeout=clearTimeout(myCloseDelay);session.delayInProgress=false}cancelTimer();session.tipOpenImminent=false;if(element.data(DATA_HASACTIVEHOVER)){element.data(DATA_FORCEDOPEN,false);if(!disableDelay){session.delayInProgress=true;session.closeDelayTimeout=setTimeout(function closeDelay(){session.closeDelayTimeout=null;tipController.hideTip(element);session.delayInProgress=false;myCloseDelay=null},options.closeDelay);myCloseDelay=session.closeDelayTimeout}else{tipController.hideTip(element)}}}function checkForIntent(){var xDifference=Math.abs(session.previousX-session.currentX),yDifference=Math.abs(session.previousY-session.currentY),totalDifference=xDifference+yDifference;if(totalDifference",{id:options.popupId});if($body.length===0){$body=$("body")}$body.append(tipElement);session.tooltips=session.tooltips?session.tooltips.add(tipElement):tipElement}if(options.followMouse){if(!tipElement.data(DATA_HASMOUSEMOVE)){$document.on("mousemove"+EVENT_NAMESPACE,positionTipOnCursor);$window.on("scroll"+EVENT_NAMESPACE,positionTipOnCursor);tipElement.data(DATA_HASMOUSEMOVE,true)}}function beginShowTip(element){element.data(DATA_HASACTIVEHOVER,true);tipElement.queue(function queueTipInit(next){showTip(element);next()})}function showTip(element){var tipContent;if(!element.data(DATA_HASACTIVEHOVER)){return}if( +session.isTipOpen){if(!session.isClosing){hideTip(session.activeHover)}tipElement.delay(100).queue(function queueTipAgain(next){showTip(element);next()});return}element.trigger("powerTipPreRender");tipContent=getTooltipContent(element);if(tipContent){tipElement.empty().append(tipContent)}else{return}element.trigger("powerTipRender");session.activeHover=element;session.isTipOpen=true;tipElement.data(DATA_MOUSEONTOTIP,options.mouseOnToPopup);tipElement.addClass(options.popupClass);if(!options.followMouse||element.data(DATA_FORCEDOPEN)){positionTipOnElement(element);session.isFixedTipOpen=true}else{positionTipOnCursor()}if(!element.data(DATA_FORCEDOPEN)&&!options.followMouse){$document.on("click"+EVENT_NAMESPACE,function documentClick(event){var target=event.target;if(target!==element[0]){if(options.mouseOnToPopup){if(target!==tipElement[0]&&!$.contains(tipElement[0],target)){$.powerTip.hide()}}else{$.powerTip.hide()}}})}if(options.mouseOnToPopup&&!options.manual){tipElement.on("mouseenter"+EVENT_NAMESPACE, +function tipMouseEnter(){if(session.activeHover){session.activeHover.data(DATA_DISPLAYCONTROLLER).cancel()}});tipElement.on("mouseleave"+EVENT_NAMESPACE,function tipMouseLeave(){if(session.activeHover){session.activeHover.data(DATA_DISPLAYCONTROLLER).hide()}})}tipElement.fadeIn(options.fadeInTime,function fadeInCallback(){if(!session.desyncTimeout){session.desyncTimeout=setInterval(closeDesyncedTip,500)}element.trigger("powerTipOpen")})}function hideTip(element){session.isClosing=true;session.isTipOpen=false;session.desyncTimeout=clearInterval(session.desyncTimeout);element.data(DATA_HASACTIVEHOVER,false);element.data(DATA_FORCEDOPEN,false);$document.off("click"+EVENT_NAMESPACE);tipElement.off(EVENT_NAMESPACE);tipElement.fadeOut(options.fadeOutTime,function fadeOutCallback(){var coords=new CSSCoordinates;session.activeHover=null;session.isClosing=false;session.isFixedTipOpen=false;tipElement.removeClass();coords.set("top",session.currentY+options.offset);coords.set("left",session.currentX+options.offset); +tipElement.css(coords);element.trigger("powerTipClose")})}function positionTipOnCursor(){var tipWidth,tipHeight,coords,collisions,collisionCount;if(!session.isFixedTipOpen&&(session.isTipOpen||session.tipOpenImminent&&tipElement.data(DATA_HASMOUSEMOVE))){tipWidth=tipElement.outerWidth();tipHeight=tipElement.outerHeight();coords=new CSSCoordinates;coords.set("top",session.currentY+options.offset);coords.set("left",session.currentX+options.offset);collisions=getViewportCollisions(coords,tipWidth,tipHeight);if(collisions!==Collision.none){collisionCount=countFlags(collisions);if(collisionCount===1){if(collisions===Collision.right){coords.set("left",session.scrollLeft+session.windowWidth-tipWidth)}else if(collisions===Collision.bottom){coords.set("top",session.scrollTop+session.windowHeight-tipHeight)}}else{coords.set("left",session.currentX-tipWidth-options.offset);coords.set("top",session.currentY-tipHeight-options.offset)}}tipElement.css(coords)}}function positionTipOnElement(element){var priorityList, +finalPlacement;if(options.smartPlacement||options.followMouse&&element.data(DATA_FORCEDOPEN)){priorityList=$.fn.powerTip.smartPlacementLists[options.placement];$.each(priorityList,function(idx,pos){var collisions=getViewportCollisions(placeTooltip(element,pos),tipElement.outerWidth(),tipElement.outerHeight());finalPlacement=pos;return collisions!==Collision.none})}else{placeTooltip(element,options.placement);finalPlacement=options.placement}tipElement.removeClass("w nw sw e ne se n s w se-alt sw-alt ne-alt nw-alt");tipElement.addClass(finalPlacement)}function placeTooltip(element,placement){var iterationCount=0,tipWidth,tipHeight,coords=new CSSCoordinates;coords.set("top",0);coords.set("left",0);tipElement.css(coords);do{tipWidth=tipElement.outerWidth();tipHeight=tipElement.outerHeight();coords=placementCalculator.compute(element,placement,tipWidth,tipHeight,options.offset);tipElement.css(coords)}while(++iterationCount<=5&&(tipWidth!==tipElement.outerWidth()||tipHeight!==tipElement.outerHeight())); +return coords}function closeDesyncedTip(){var isDesynced=false,hasDesyncableCloseEvent=$.grep(["mouseleave","mouseout","blur","focusout"],function(eventType){return $.inArray(eventType,options.closeEvents)!==-1}).length>0;if(session.isTipOpen&&!session.isClosing&&!session.delayInProgress&&hasDesyncableCloseEvent){if(session.activeHover.data(DATA_HASACTIVEHOVER)===false||session.activeHover.is(":disabled")){isDesynced=true}else if(!isMouseOver(session.activeHover)&&!session.activeHover.is(":focus")&&!session.activeHover.data(DATA_FORCEDOPEN)){if(tipElement.data(DATA_MOUSEONTOTIP)){if(!isMouseOver(tipElement)){isDesynced=true}}else{isDesynced=true}}if(isDesynced){hideTip(session.activeHover)}}}this.showTip=beginShowTip;this.hideTip=hideTip;this.resetPosition=positionTipOnElement}function isSvgElement(element){return Boolean(window.SVGElement&&element[0]instanceof SVGElement)}function isMouseEvent(event){return Boolean(event&&$.inArray(event.type,MOUSE_EVENTS)>-1&&typeof event.pageX==="number")} +function initTracking(){if(!session.mouseTrackingActive){session.mouseTrackingActive=true;getViewportDimensions();$(getViewportDimensions);$document.on("mousemove"+EVENT_NAMESPACE,trackMouse);$window.on("resize"+EVENT_NAMESPACE,trackResize);$window.on("scroll"+EVENT_NAMESPACE,trackScroll)}}function getViewportDimensions(){session.scrollLeft=$window.scrollLeft();session.scrollTop=$window.scrollTop();session.windowWidth=$window.width();session.windowHeight=$window.height()}function trackResize(){session.windowWidth=$window.width();session.windowHeight=$window.height()}function trackScroll(){var x=$window.scrollLeft(),y=$window.scrollTop();if(x!==session.scrollLeft){session.currentX+=x-session.scrollLeft;session.scrollLeft=x}if(y!==session.scrollTop){session.currentY+=y-session.scrollTop;session.scrollTop=y}}function trackMouse(event){session.currentX=event.pageX;session.currentY=event.pageY}function isMouseOver(element){var elementPosition=element.offset(),elementBox=element[0].getBoundingClientRect(), +elementWidth=elementBox.right-elementBox.left,elementHeight=elementBox.bottom-elementBox.top;return session.currentX>=elementPosition.left&&session.currentX<=elementPosition.left+elementWidth&&session.currentY>=elementPosition.top&&session.currentY<=elementPosition.top+elementHeight}function getTooltipContent(element){var tipText=element.data(DATA_POWERTIP),tipObject=element.data(DATA_POWERTIPJQ),tipTarget=element.data(DATA_POWERTIPTARGET),targetElement,content;if(tipText){if($.isFunction(tipText)){tipText=tipText.call(element[0])}content=tipText}else if(tipObject){if($.isFunction(tipObject)){tipObject=tipObject.call(element[0])}if(tipObject.length>0){content=tipObject.clone(true,true)}}else if(tipTarget){targetElement=$("#"+tipTarget);if(targetElement.length>0){content=targetElement.html()}}return content}function getViewportCollisions(coords,elementWidth,elementHeight){var viewportTop=session.scrollTop,viewportLeft=session.scrollLeft,viewportBottom=viewportTop+session.windowHeight, +viewportRight=viewportLeft+session.windowWidth,collisions=Collision.none;if(coords.topviewportBottom||Math.abs(coords.bottom-session.windowHeight)>viewportBottom){collisions|=Collision.bottom}if(coords.leftviewportRight){collisions|=Collision.left}if(coords.left+elementWidth>viewportRight||coords.right1)){a.preventDefault();var c=a.originalEvent.changedTouches[0],d=document.createEvent("MouseEvents");d.initMouseEvent(b,!0,!0,window,1,c.screenX,c.screenY,c.clientX,c.clientY,!1,!1,!1,!1,0,null),a.target.dispatchEvent(d)}}if(a.support.touch="ontouchend"in document,a.support.touch){var e,b=a.ui.mouse.prototype,c=b._mouseInit,d=b._mouseDestroy;b._touchStart=function(a){var b=this;!e&&b._mouseCapture(a.originalEvent.changedTouches[0])&&(e=!0,b._touchMoved=!1,f(a,"mouseover"),f(a,"mousemove"),f(a,"mousedown"))},b._touchMove=function(a){e&&(this._touchMoved=!0,f(a,"mousemove"))},b._touchEnd=function(a){e&&(f(a,"mouseup"),f(a,"mouseout"),this._touchMoved||f(a,"click"),e=!1)},b._mouseInit=function(){var b=this;b.element.bind({touchstart:a.proxy(b,"_touchStart"),touchmove:a.proxy(b,"_touchMove"),touchend:a.proxy(b,"_touchEnd")}),c.call(b)},b._mouseDestroy=function(){var b=this;b.element.unbind({touchstart:a.proxy(b,"_touchStart"),touchmove:a.proxy(b, +"_touchMove"),touchend:a.proxy(b,"_touchEnd")}),d.call(b)}}}(jQuery); +/*! SmartMenus jQuery Plugin - v1.1.0 - September 17, 2017 + * http://www.smartmenus.org/ + * Copyright Vasil Dinkov, Vadikom Web Ltd. http://vadikom.com; Licensed MIT */(function(t){"function"==typeof define&&define.amd?define(["jquery"],t):"object"==typeof module&&"object"==typeof module.exports?module.exports=t(require("jquery")):t(jQuery)})(function($){function initMouseDetection(t){var e=".smartmenus_mouse";if(mouseDetectionEnabled||t)mouseDetectionEnabled&&t&&($(document).off(e),mouseDetectionEnabled=!1);else{var i=!0,s=null,o={mousemove:function(t){var e={x:t.pageX,y:t.pageY,timeStamp:(new Date).getTime()};if(s){var o=Math.abs(s.x-e.x),a=Math.abs(s.y-e.y);if((o>0||a>0)&&2>=o&&2>=a&&300>=e.timeStamp-s.timeStamp&&(mouse=!0,i)){var n=$(t.target).closest("a");n.is("a")&&$.each(menuTrees,function(){return $.contains(this.$root[0],n[0])?(this.itemEnter({currentTarget:n[0]}),!1):void 0}),i=!1}}s=e}};o[touchEvents?"touchstart":"pointerover pointermove pointerout MSPointerOver MSPointerMove MSPointerOut"]=function(t){isTouchEvent(t.originalEvent)&&(mouse=!1)},$(document).on(getEventsNS(o,e)), +mouseDetectionEnabled=!0}}function isTouchEvent(t){return!/^(4|mouse)$/.test(t.pointerType)}function getEventsNS(t,e){e||(e="");var i={};for(var s in t)i[s.split(" ").join(e+" ")+e]=t[s];return i}var menuTrees=[],mouse=!1,touchEvents="ontouchstart"in window,mouseDetectionEnabled=!1,requestAnimationFrame=window.requestAnimationFrame||function(t){return setTimeout(t,1e3/60)},cancelAnimationFrame=window.cancelAnimationFrame||function(t){clearTimeout(t)},canAnimate=!!$.fn.animate;return $.SmartMenus=function(t,e){this.$root=$(t),this.opts=e,this.rootId="",this.accessIdPrefix="",this.$subArrow=null,this.activatedItems=[],this.visibleSubMenus=[],this.showTimeout=0,this.hideTimeout=0,this.scrollTimeout=0,this.clickActivated=!1,this.focusActivated=!1,this.zIndexInc=0,this.idInc=0,this.$firstLink=null,this.$firstSub=null,this.disabled=!1,this.$disableOverlay=null,this.$touchScrollingSub=null,this.cssTransforms3d="perspective"in t.style||"webkitPerspective"in t.style,this.wasCollapsible=!1,this.init()},$.extend( +$.SmartMenus,{hideAll:function(){$.each(menuTrees,function(){this.menuHideAll()})},destroy:function(){for(;menuTrees.length;)menuTrees[0].destroy();initMouseDetection(!0)},prototype:{init:function(t){var e=this;if(!t){menuTrees.push(this),this.rootId=((new Date).getTime()+Math.random()+"").replace(/\D/g,""),this.accessIdPrefix="sm-"+this.rootId+"-",this.$root.hasClass("sm-rtl")&&(this.opts.rightToLeftSubMenus=!0);var i=".smartmenus";this.$root.data("smartmenus",this).attr("data-smartmenus-id",this.rootId).dataSM("level",1).on(getEventsNS({"mouseover focusin":$.proxy(this.rootOver,this),"mouseout focusout":$.proxy(this.rootOut,this),keydown:$.proxy(this.rootKeyDown,this)},i)).on(getEventsNS({mouseenter:$.proxy(this.itemEnter,this),mouseleave:$.proxy(this.itemLeave,this),mousedown:$.proxy(this.itemDown,this),focus:$.proxy(this.itemFocus,this),blur:$.proxy(this.itemBlur,this),click:$.proxy(this.itemClick,this)},i),"a"),i+=this.rootId,this.opts.hideOnClick&&$(document).on(getEventsNS({touchstart:$.proxy( +this.docTouchStart,this),touchmove:$.proxy(this.docTouchMove,this),touchend:$.proxy(this.docTouchEnd,this),click:$.proxy(this.docClick,this)},i)),$(window).on(getEventsNS({"resize orientationchange":$.proxy(this.winResize,this)},i)),this.opts.subIndicators&&(this.$subArrow=$("").addClass("sub-arrow"),this.opts.subIndicatorsText&&this.$subArrow.html(this.opts.subIndicatorsText)),initMouseDetection()}if(this.$firstSub=this.$root.find("ul").each(function(){e.menuInit($(this))}).eq(0),this.$firstLink=this.$root.find("a").eq(0),this.opts.markCurrentItem){var s=/(index|default)\.[^#\?\/]*/i,o=/#.*/,a=window.location.href.replace(s,""),n=a.replace(o,"");this.$root.find("a").each(function(){var t=this.href.replace(s,""),i=$(this);(t==a||t==n)&&(i.addClass("current"),e.opts.markCurrentTree&&i.parentsUntil("[data-smartmenus-id]","ul").each(function(){$(this).dataSM("parent-a").addClass("current")}))})}this.wasCollapsible=this.isCollapsible()},destroy:function(t){if(!t){var e=".smartmenus";this.$root.removeData( +"smartmenus").removeAttr("data-smartmenus-id").removeDataSM("level").off(e),e+=this.rootId,$(document).off(e),$(window).off(e),this.opts.subIndicators&&(this.$subArrow=null)}this.menuHideAll();var i=this;this.$root.find("ul").each(function(){var t=$(this);t.dataSM("scroll-arrows")&&t.dataSM("scroll-arrows").remove(),t.dataSM("shown-before")&&((i.opts.subMenusMinWidth||i.opts.subMenusMaxWidth)&&t.css({width:"",minWidth:"",maxWidth:""}).removeClass("sm-nowrap"),t.dataSM("scroll-arrows")&&t.dataSM("scroll-arrows").remove(),t.css({zIndex:"",top:"",left:"",marginLeft:"",marginTop:"",display:""})),0==(t.attr("id")||"").indexOf(i.accessIdPrefix)&&t.removeAttr("id")}).removeDataSM("in-mega").removeDataSM("shown-before").removeDataSM("scroll-arrows").removeDataSM("parent-a").removeDataSM("level").removeDataSM("beforefirstshowfired").removeAttr("role").removeAttr("aria-hidden").removeAttr("aria-labelledby").removeAttr("aria-expanded"),this.$root.find("a.has-submenu").each(function(){var t=$(this);0==t.attr("id" +).indexOf(i.accessIdPrefix)&&t.removeAttr("id")}).removeClass("has-submenu").removeDataSM("sub").removeAttr("aria-haspopup").removeAttr("aria-controls").removeAttr("aria-expanded").closest("li").removeDataSM("sub"),this.opts.subIndicators&&this.$root.find("span.sub-arrow").remove(),this.opts.markCurrentItem&&this.$root.find("a.current").removeClass("current"),t||(this.$root=null,this.$firstLink=null,this.$firstSub=null,this.$disableOverlay&&(this.$disableOverlay.remove(),this.$disableOverlay=null),menuTrees.splice($.inArray(this,menuTrees),1))},disable:function(t){if(!this.disabled){if(this.menuHideAll(),!t&&!this.opts.isPopup&&this.$root.is(":visible")){var e=this.$root.offset();this.$disableOverlay=$('
').css({position:"absolute",top:e.top,left:e.left,width:this.$root.outerWidth(),height:this.$root.outerHeight(),zIndex:this.getStartZIndex(!0),opacity:0}).appendTo(document.body)}this.disabled=!0}},docClick:function(t){return this.$touchScrollingSub?( +this.$touchScrollingSub=null,void 0):((this.visibleSubMenus.length&&!$.contains(this.$root[0],t.target)||$(t.target).closest("a").length)&&this.menuHideAll(),void 0)},docTouchEnd:function(){if(this.lastTouch){if(!(!this.visibleSubMenus.length||void 0!==this.lastTouch.x2&&this.lastTouch.x1!=this.lastTouch.x2||void 0!==this.lastTouch.y2&&this.lastTouch.y1!=this.lastTouch.y2||this.lastTouch.target&&$.contains(this.$root[0],this.lastTouch.target))){this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0);var t=this;this.hideTimeout=setTimeout(function(){t.menuHideAll()},350)}this.lastTouch=null}},docTouchMove:function(t){if(this.lastTouch){var e=t.originalEvent.touches[0];this.lastTouch.x2=e.pageX,this.lastTouch.y2=e.pageY}},docTouchStart:function(t){var e=t.originalEvent.touches[0];this.lastTouch={x1:e.pageX,y1:e.pageY,target:e.target}},enable:function(){this.disabled&&(this.$disableOverlay&&(this.$disableOverlay.remove(),this.$disableOverlay=null),this.disabled=!1)},getClosestMenu:function(t){for( +var e=$(t).closest("ul");e.dataSM("in-mega");)e=e.parent().closest("ul");return e[0]||null},getHeight:function(t){return this.getOffset(t,!0)},getOffset:function(t,e){var i;"none"==t.css("display")&&(i={position:t[0].style.position,visibility:t[0].style.visibility},t.css({position:"absolute",visibility:"hidden"}).show());var s=t[0].getBoundingClientRect&&t[0].getBoundingClientRect(),o=s&&(e?s.height||s.bottom-s.top:s.width||s.right-s.left);return o||0===o||(o=e?t[0].offsetHeight:t[0].offsetWidth),i&&t.hide().css(i),o},getStartZIndex:function(t){var e=parseInt(this[t?"$root":"$firstSub"].css("z-index"));return!t&&isNaN(e)&&(e=parseInt(this.$root.css("z-index"))),isNaN(e)?1:e},getTouchPoint:function(t){return t.touches&&t.touches[0]||t.changedTouches&&t.changedTouches[0]||t},getViewport:function(t){var e=t?"Height":"Width",i=document.documentElement["client"+e],s=window["inner"+e];return s&&(i=Math.min(i,s)),i},getViewportHeight:function(){return this.getViewport(!0)},getViewportWidth:function(){ +return this.getViewport()},getWidth:function(t){return this.getOffset(t)},handleEvents:function(){return!this.disabled&&this.isCSSOn()},handleItemEvents:function(t){return this.handleEvents()&&!this.isLinkInMegaMenu(t)},isCollapsible:function(){return"static"==this.$firstSub.css("position")},isCSSOn:function(){return"inline"!=this.$firstLink.css("display")},isFixed:function(){var t="fixed"==this.$root.css("position");return t||this.$root.parentsUntil("body").each(function(){return"fixed"==$(this).css("position")?(t=!0,!1):void 0}),t},isLinkInMegaMenu:function(t){return $(this.getClosestMenu(t[0])).hasClass("mega-menu")},isTouchMode:function(){return!mouse||this.opts.noMouseOver||this.isCollapsible()},itemActivate:function(t,e){var i=t.closest("ul"),s=i.dataSM("level");if(s>1&&(!this.activatedItems[s-2]||this.activatedItems[s-2][0]!=i.dataSM("parent-a")[0])){var o=this;$(i.parentsUntil("[data-smartmenus-id]","ul").get().reverse()).add(i).each(function(){o.itemActivate($(this).dataSM("parent-a"))})}if(( +!this.isCollapsible()||e)&&this.menuHideSubMenus(this.activatedItems[s-1]&&this.activatedItems[s-1][0]==t[0]?s:s-1),this.activatedItems[s-1]=t,this.$root.triggerHandler("activate.smapi",t[0])!==!1){var a=t.dataSM("sub");a&&(this.isTouchMode()||!this.opts.showOnClick||this.clickActivated)&&this.menuShow(a)}},itemBlur:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&this.$root.triggerHandler("blur.smapi",e[0])},itemClick:function(t){var e=$(t.currentTarget);if(this.handleItemEvents(e)){if(this.$touchScrollingSub&&this.$touchScrollingSub[0]==e.closest("ul")[0])return this.$touchScrollingSub=null,t.stopPropagation(),!1;if(this.$root.triggerHandler("click.smapi",e[0])===!1)return!1;var i=$(t.target).is(".sub-arrow"),s=e.dataSM("sub"),o=s?2==s.dataSM("level"):!1,a=this.isCollapsible(),n=/toggle$/.test(this.opts.collapsibleBehavior),r=/link$/.test(this.opts.collapsibleBehavior),h=/^accordion/.test(this.opts.collapsibleBehavior);if(s&&!s.is(":visible")){if((!r||!a||i)&&(this.opts.showOnClick&&o&&( +this.clickActivated=!0),this.itemActivate(e,h),s.is(":visible")))return this.focusActivated=!0,!1}else if(a&&(n||i))return this.itemActivate(e,h),this.menuHide(s),n&&(this.focusActivated=!1),!1;return this.opts.showOnClick&&o||e.hasClass("disabled")||this.$root.triggerHandler("select.smapi",e[0])===!1?!1:void 0}},itemDown:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&e.dataSM("mousedown",!0)},itemEnter:function(t){var e=$(t.currentTarget);if(this.handleItemEvents(e)){if(!this.isTouchMode()){this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0);var i=this;this.showTimeout=setTimeout(function(){i.itemActivate(e)},this.opts.showOnClick&&1==e.closest("ul").dataSM("level")?1:this.opts.showTimeout)}this.$root.triggerHandler("mouseenter.smapi",e[0])}},itemFocus:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&(!this.focusActivated||this.isTouchMode()&&e.dataSM("mousedown")||this.activatedItems.length&&this.activatedItems[this.activatedItems.length-1][0]==e[0 +]||this.itemActivate(e,!0),this.$root.triggerHandler("focus.smapi",e[0]))},itemLeave:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&(this.isTouchMode()||(e[0].blur(),this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0)),e.removeDataSM("mousedown"),this.$root.triggerHandler("mouseleave.smapi",e[0]))},menuHide:function(t){if(this.$root.triggerHandler("beforehide.smapi",t[0])!==!1&&(canAnimate&&t.stop(!0,!0),"none"!=t.css("display"))){var e=function(){t.css("z-index","")};this.isCollapsible()?canAnimate&&this.opts.collapsibleHideFunction?this.opts.collapsibleHideFunction.call(this,t,e):t.hide(this.opts.collapsibleHideDuration,e):canAnimate&&this.opts.hideFunction?this.opts.hideFunction.call(this,t,e):t.hide(this.opts.hideDuration,e),t.dataSM("scroll")&&(this.menuScrollStop(t),t.css({"touch-action":"","-ms-touch-action":"","-webkit-transform":"",transform:""}).off(".smartmenus_scroll").removeDataSM("scroll").dataSM("scroll-arrows").hide()),t.dataSM("parent-a").removeClass( +"highlighted").attr("aria-expanded","false"),t.attr({"aria-expanded":"false","aria-hidden":"true"});var i=t.dataSM("level");this.activatedItems.splice(i-1,1),this.visibleSubMenus.splice($.inArray(t,this.visibleSubMenus),1),this.$root.triggerHandler("hide.smapi",t[0])}},menuHideAll:function(){this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0);for(var t=this.opts.isPopup?1:0,e=this.visibleSubMenus.length-1;e>=t;e--)this.menuHide(this.visibleSubMenus[e]);this.opts.isPopup&&(canAnimate&&this.$root.stop(!0,!0),this.$root.is(":visible")&&(canAnimate&&this.opts.hideFunction?this.opts.hideFunction.call(this,this.$root):this.$root.hide(this.opts.hideDuration))),this.activatedItems=[],this.visibleSubMenus=[],this.clickActivated=!1,this.focusActivated=!1,this.zIndexInc=0,this.$root.triggerHandler("hideAll.smapi")},menuHideSubMenus:function(t){for(var e=this.activatedItems.length-1;e>=t;e--){var i=this.activatedItems[e].dataSM("sub");i&&this.menuHide(i)}},menuInit:function(t){if(!t.dataSM("in-mega")){ +t.hasClass("mega-menu")&&t.find("ul").dataSM("in-mega",!0);for(var e=2,i=t[0];(i=i.parentNode.parentNode)!=this.$root[0];)e++;var s=t.prevAll("a").eq(-1);s.length||(s=t.prevAll().find("a").eq(-1)),s.addClass("has-submenu").dataSM("sub",t),t.dataSM("parent-a",s).dataSM("level",e).parent().dataSM("sub",t);var o=s.attr("id")||this.accessIdPrefix+ ++this.idInc,a=t.attr("id")||this.accessIdPrefix+ ++this.idInc;s.attr({id:o,"aria-haspopup":"true","aria-controls":a,"aria-expanded":"false"}),t.attr({id:a,role:"group","aria-hidden":"true","aria-labelledby":o,"aria-expanded":"false"}),this.opts.subIndicators&&s[this.opts.subIndicatorsPos](this.$subArrow.clone())}},menuPosition:function(t){var e,i,s=t.dataSM("parent-a"),o=s.closest("li"),a=o.parent(),n=t.dataSM("level"),r=this.getWidth(t),h=this.getHeight(t),u=s.offset(),l=u.left,c=u.top,d=this.getWidth(s),m=this.getHeight(s),p=$(window),f=p.scrollLeft(),v=p.scrollTop(),b=this.getViewportWidth(),S=this.getViewportHeight(),g=a.parent().is("[data-sm-horizontal-sub]" +)||2==n&&!a.hasClass("sm-vertical"),M=this.opts.rightToLeftSubMenus&&!o.is("[data-sm-reverse]")||!this.opts.rightToLeftSubMenus&&o.is("[data-sm-reverse]"),w=2==n?this.opts.mainMenuSubOffsetX:this.opts.subMenusSubOffsetX,T=2==n?this.opts.mainMenuSubOffsetY:this.opts.subMenusSubOffsetY;if(g?(e=M?d-r-w:w,i=this.opts.bottomToTopSubMenus?-h-T:m+T):(e=M?w-r:d-w,i=this.opts.bottomToTopSubMenus?m-T-h:T),this.opts.keepInViewport){var y=l+e,I=c+i;if(M&&f>y?e=g?f-y+e:d-w:!M&&y+r>f+b&&(e=g?f+b-r-y+e:w-r),g||(S>h&&I+h>v+S?i+=v+S-h-I:(h>=S||v>I)&&(i+=v-I)),g&&(I+h>v+S+.49||v>I)||!g&&h>S+.49){var x=this;t.dataSM("scroll-arrows")||t.dataSM("scroll-arrows",$([$('')[0],$('')[0]]).on({mouseenter:function(){t.dataSM("scroll").up=$(this).hasClass("scroll-up"),x.menuScroll(t)},mouseleave:function(e){x.menuScrollStop(t),x.menuScrollOut(t,e)},"mousewheel DOMMouseScroll":function(t){ +t.preventDefault()}}).insertAfter(t));var A=".smartmenus_scroll";if(t.dataSM("scroll",{y:this.cssTransforms3d?0:i-m,step:1,itemH:m,subH:h,arrowDownH:this.getHeight(t.dataSM("scroll-arrows").eq(1))}).on(getEventsNS({mouseover:function(e){x.menuScrollOver(t,e)},mouseout:function(e){x.menuScrollOut(t,e)},"mousewheel DOMMouseScroll":function(e){x.menuScrollMousewheel(t,e)}},A)).dataSM("scroll-arrows").css({top:"auto",left:"0",marginLeft:e+(parseInt(t.css("border-left-width"))||0),width:r-(parseInt(t.css("border-left-width"))||0)-(parseInt(t.css("border-right-width"))||0),zIndex:t.css("z-index")}).eq(g&&this.opts.bottomToTopSubMenus?0:1).show(),this.isFixed()){var C={};C[touchEvents?"touchstart touchmove touchend":"pointerdown pointermove pointerup MSPointerDown MSPointerMove MSPointerUp"]=function(e){x.menuScrollTouch(t,e)},t.css({"touch-action":"none","-ms-touch-action":"none"}).on(getEventsNS(C,A))}}}t.css({top:"auto",left:"0",marginLeft:e,marginTop:i-m})},menuScroll:function(t,e,i){var s,o=t.dataSM("scroll"), +a=t.dataSM("scroll-arrows"),n=o.up?o.upEnd:o.downEnd;if(!e&&o.momentum){if(o.momentum*=.92,s=o.momentum,.5>s)return this.menuScrollStop(t),void 0}else s=i||(e||!this.opts.scrollAccelerate?this.opts.scrollStep:Math.floor(o.step));var r=t.dataSM("level");if(this.activatedItems[r-1]&&this.activatedItems[r-1].dataSM("sub")&&this.activatedItems[r-1].dataSM("sub").is(":visible")&&this.menuHideSubMenus(r-1),o.y=o.up&&o.y>=n||!o.up&&n>=o.y?o.y:Math.abs(n-o.y)>s?o.y+(o.up?s:-s):n,t.css(this.cssTransforms3d?{"-webkit-transform":"translate3d(0, "+o.y+"px, 0)",transform:"translate3d(0, "+o.y+"px, 0)"}:{marginTop:o.y}),mouse&&(o.up&&o.y>o.downEnd||!o.up&&o.y0;t.dataSM("scroll-arrows").eq(i?0:1).is(":visible")&&(t.dataSM("scroll").up=i,this.menuScroll(t,!0))}e.preventDefault()},menuScrollOut:function(t,e){mouse&&(/^scroll-(up|down)/.test((e.relatedTarget||"").className)||(t[0]==e.relatedTarget||$.contains(t[0],e.relatedTarget))&&this.getClosestMenu(e.relatedTarget)==t[0]||t.dataSM("scroll-arrows").css("visibility","hidden"))},menuScrollOver:function(t,e){if(mouse&&!/^scroll-(up|down)/.test(e.target.className)&&this.getClosestMenu(e.target)==t[0]){this.menuScrollRefreshData(t);var i=t.dataSM("scroll"),s=$(window).scrollTop()-t.dataSM("parent-a").offset().top-i.itemH;t.dataSM("scroll-arrows").eq(0).css("margin-top",s).end().eq(1).css("margin-top",s+this.getViewportHeight()-i.arrowDownH).end().css("visibility","visible")}},menuScrollRefreshData:function(t){var e=t.dataSM("scroll"),i=$(window).scrollTop()-t.dataSM("parent-a").offset().top-e.itemH;this.cssTransforms3d&&(i=-(parseFloat(t.css("margin-top"))-i)),$.extend(e,{upEnd:i, +downEnd:i+this.getViewportHeight()-e.subH})},menuScrollStop:function(t){return this.scrollTimeout?(cancelAnimationFrame(this.scrollTimeout),this.scrollTimeout=0,t.dataSM("scroll").step=1,!0):void 0},menuScrollTouch:function(t,e){if(e=e.originalEvent,isTouchEvent(e)){var i=this.getTouchPoint(e);if(this.getClosestMenu(i.target)==t[0]){var s=t.dataSM("scroll");if(/(start|down)$/i.test(e.type))this.menuScrollStop(t)?(e.preventDefault(),this.$touchScrollingSub=t):this.$touchScrollingSub=null,this.menuScrollRefreshData(t),$.extend(s,{touchStartY:i.pageY,touchStartTime:e.timeStamp});else if(/move$/i.test(e.type)){var o=void 0!==s.touchY?s.touchY:s.touchStartY;if(void 0!==o&&o!=i.pageY){this.$touchScrollingSub=t;var a=i.pageY>o;void 0!==s.up&&s.up!=a&&$.extend(s,{touchStartY:i.pageY,touchStartTime:e.timeStamp}),$.extend(s,{up:a,touchY:i.pageY}),this.menuScroll(t,!0,Math.abs(i.pageY-o))}e.preventDefault()}else void 0!==s.touchY&&((s.momentum=15*Math.pow(Math.abs(i.pageY-s.touchStartY)/(e.timeStamp-s.touchStartTime),2) +)&&(this.menuScrollStop(t),this.menuScroll(t),e.preventDefault()),delete s.touchY)}}},menuShow:function(t){if((t.dataSM("beforefirstshowfired")||(t.dataSM("beforefirstshowfired",!0),this.$root.triggerHandler("beforefirstshow.smapi",t[0])!==!1))&&this.$root.triggerHandler("beforeshow.smapi",t[0])!==!1&&(t.dataSM("shown-before",!0),canAnimate&&t.stop(!0,!0),!t.is(":visible"))){var e=t.dataSM("parent-a"),i=this.isCollapsible();if((this.opts.keepHighlighted||i)&&e.addClass("highlighted"),i)t.removeClass("sm-nowrap").css({zIndex:"",width:"auto",minWidth:"",maxWidth:"",top:"",left:"",marginLeft:"",marginTop:""});else{if(t.css("z-index",this.zIndexInc=(this.zIndexInc||this.getStartZIndex())+1),(this.opts.subMenusMinWidth||this.opts.subMenusMaxWidth)&&(t.css({width:"auto",minWidth:"",maxWidth:""}).addClass("sm-nowrap"),this.opts.subMenusMinWidth&&t.css("min-width",this.opts.subMenusMinWidth),this.opts.subMenusMaxWidth)){var s=this.getWidth(t);t.css("max-width",this.opts.subMenusMaxWidth),s>this.getWidth(t +)&&t.removeClass("sm-nowrap").css("width",this.opts.subMenusMaxWidth)}this.menuPosition(t)}var o=function(){t.css("overflow","")};i?canAnimate&&this.opts.collapsibleShowFunction?this.opts.collapsibleShowFunction.call(this,t,o):t.show(this.opts.collapsibleShowDuration,o):canAnimate&&this.opts.showFunction?this.opts.showFunction.call(this,t,o):t.show(this.opts.showDuration,o),e.attr("aria-expanded","true"),t.attr({"aria-expanded":"true","aria-hidden":"false"}),this.visibleSubMenus.push(t),this.$root.triggerHandler("show.smapi",t[0])}},popupHide:function(t){this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0);var e=this;this.hideTimeout=setTimeout(function(){e.menuHideAll()},t?1:this.opts.hideTimeout)},popupShow:function(t,e){if(!this.opts.isPopup)return alert('SmartMenus jQuery Error:\n\nIf you want to show this menu via the "popupShow" method, set the isPopup:true option.'),void 0;if(this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0),this.$root.dataSM("shown-before",!0), +canAnimate&&this.$root.stop(!0,!0),!this.$root.is(":visible")){this.$root.css({left:t,top:e});var i=this,s=function(){i.$root.css("overflow","")};canAnimate&&this.opts.showFunction?this.opts.showFunction.call(this,this.$root,s):this.$root.show(this.opts.showDuration,s),this.visibleSubMenus[0]=this.$root}},refresh:function(){this.destroy(!0),this.init(!0)},rootKeyDown:function(t){if(this.handleEvents())switch(t.keyCode){case 27:var e=this.activatedItems[0];if(e){this.menuHideAll(),e[0].focus();var i=e.dataSM("sub");i&&this.menuHide(i)}break;case 32:var s=$(t.target);if(s.is("a")&&this.handleItemEvents(s)){var i=s.dataSM("sub");i&&!i.is(":visible")&&(this.itemClick({currentTarget:t.target}),t.preventDefault())}}},rootOut:function(t){if(this.handleEvents()&&!this.isTouchMode()&&t.target!=this.$root[0]&&(this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0),!this.opts.showOnClick||!this.opts.hideOnClick)){var e=this;this.hideTimeout=setTimeout(function(){e.menuHideAll()},this.opts.hideTimeout)}}, +rootOver:function(t){this.handleEvents()&&!this.isTouchMode()&&t.target!=this.$root[0]&&this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0)},winResize:function(t){if(this.handleEvents()){if(!("onorientationchange"in window)||"orientationchange"==t.type){var e=this.isCollapsible();this.wasCollapsible&&e||(this.activatedItems.length&&this.activatedItems[this.activatedItems.length-1][0].blur(),this.menuHideAll()),this.wasCollapsible=e}}else if(this.$disableOverlay){var i=this.$root.offset();this.$disableOverlay.css({top:i.top,left:i.left,width:this.$root.outerWidth(),height:this.$root.outerHeight()})}}}}),$.fn.dataSM=function(t,e){return e?this.data(t+"_smartmenus",e):this.data(t+"_smartmenus")},$.fn.removeDataSM=function(t){return this.removeData(t+"_smartmenus")},$.fn.smartmenus=function(options){if("string"==typeof options){var args=arguments,method=options;return Array.prototype.shift.call(args),this.each(function(){var t=$(this).data("smartmenus");t&&t[method]&&t[method].apply(t,args)})} +return this.each(function(){var dataOpts=$(this).data("sm-options")||null;if(dataOpts)try{dataOpts=eval("("+dataOpts+")")}catch(e){dataOpts=null,alert('ERROR\n\nSmartMenus jQuery init:\nInvalid "data-sm-options" attribute value syntax.')}new $.SmartMenus(this,$.extend({},$.fn.smartmenus.defaults,options,dataOpts))})},$.fn.smartmenus.defaults={isPopup:!1,mainMenuSubOffsetX:0,mainMenuSubOffsetY:0,subMenusSubOffsetX:0,subMenusSubOffsetY:0,subMenusMinWidth:"10em",subMenusMaxWidth:"20em",subIndicators:!0,subIndicatorsPos:"append",subIndicatorsText:"",scrollStep:30,scrollAccelerate:!0,showTimeout:250,hideTimeout:500,showDuration:0,showFunction:null,hideDuration:0,hideFunction:function(t,e){t.fadeOut(200,e)},collapsibleShowDuration:0,collapsibleShowFunction:function(t,e){t.slideDown(200,e)},collapsibleHideDuration:0,collapsibleHideFunction:function(t,e){t.slideUp(200,e)},showOnClick:!1,hideOnClick:!0,noMouseOver:!1,keepInViewport:!0,keepHighlighted:!0,markCurrentItem:!1,markCurrentTree:!0,rightToLeftSubMenus:!1, +bottomToTopSubMenus:!1,collapsibleBehavior:"default"},$}); diff --git a/docs/html/kle_8cpp.html b/docs/html/kle_8cpp.html new file mode 100644 index 00000000..b025ddb7 --- /dev/null +++ b/docs/html/kle_8cpp.html @@ -0,0 +1,74 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: kle.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
kle.cpp File Reference
+
+
+
#include <math.h>
+#include "kle.h"
+#include "deplapack.h"
+#include "error_handlers.h"
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/kle_8h.html b/docs/html/kle_8h.html new file mode 100644 index 00000000..c9a3babd --- /dev/null +++ b/docs/html/kle_8h.html @@ -0,0 +1,85 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: kle.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
kle.h File Reference
+
+
+
#include <iostream>
+#include "ftndefs.h"
+#include "Array1D.h"
+#include "Array2D.h"
+
+

Go to the source code of this file.

+ + + + + +

+Classes

class  KLDecompUni
 Computes the Karhunen-Loeve decomposition of a univariate stochastic process. More...
 
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/kle_8h_source.html b/docs/html/kle_8h_source.html new file mode 100644 index 00000000..213cf24c --- /dev/null +++ b/docs/html/kle_8h_source.html @@ -0,0 +1,206 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: kle.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
kle.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
31
+
32
+
33#ifndef KLDECOMPUNI_H_SEEN
+
34#define KLDECOMPUNI_H_SEEN
+
35
+
36#include <iostream>
+
37#include "ftndefs.h"
+
38#include "Array1D.h"
+
39#include "Array2D.h"
+
40// #include "Array3D.h"
+
41
+
+
50class KLDecompUni {
+
51
+
52 public:
+
53
+
64 KLDecompUni(const Array1D<double>& tSamples);
+
65
+
66 KLDecompUni();
+
67
+
69 ~KLDecompUni() {};
+
70
+
71 void Init() ;
+
72
+
75 void SetWeights(const Array1D<double>& weights) ;
+
76
+
79 void SetWeights(const double *weights, const int npts) ;
+
80
+
89 int decompose(const Array2D<double>& corr, const int& nKL);
+
90
+
99 int decompose(const double *corr, const int &nKL);
+
100
+
113 void KLproject(const Array2D<double>& realiz, Array2D<double>& xi);
+
114
+
116 const Array1D<double>& eigenvalues() const;
+
117 void eigenvalues(const int nEIG, double *eigs) const;
+
118
+
120 const Array2D<double>& KLmodes() const;
+
121
+
123 void KLmodes(const int npts, const int nKL, double *klModes ) const;
+
124
+
126 void meanRealiz(const Array2D<double>& realiz, Array1D<double>& mean_realiz);
+
127
+
138 void truncRealiz(const Array1D<double>& meanrea,const Array2D<double>& xi,const int& nKL, Array2D<double>& trunc_realiz);
+
139
+
140 private:
+
142 //KLDecompUni() {};
+
143
+
145 KLDecompUni(const KLDecompUni &) {};
+
146
+
149 bool decomposed_;
+
150
+
152 Array2D<double> whcwh_;
+
153
+
155 Array1D<double> w_;
+
156
+
158 Array1D<double> wh_;
+
159
+
161 char jobz_ ;
+
163 char eigRange_;
+
165 char uplo_;
+
167 double vl_;
+
169 double vu_;
+
171 int il_;
+
173 int iu_;
+
175 double absTol_;
+
176
+
178 Array1D<double> eig_values_;
+
180 Array2D<double> KL_modes_;
+
181
+
183 int eig_info_;
+
185 Array1D<int> ifail_;
+
186
+
187};
+
+
188
+
189#endif /* KLDECOMPUNI_H_SEEN */
+
Array1D.h
1D Array class for any type T
+
Array2D.h
2D Array class for any type T
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
KLDecompUni
Computes the Karhunen-Loeve decomposition of a univariate stochastic process.
Definition kle.h:50
+
KLDecompUni::decomposed_
bool decomposed_
Flag to determine whether KL decomposition has taken place (and consequently that the interal data st...
Definition kle.h:149
+
KLDecompUni::iu_
int iu_
Upper index of range of eigenvalues requested.
Definition kle.h:173
+
KLDecompUni::Init
void Init()
Definition kle.cpp:73
+
KLDecompUni::SetWeights
void SetWeights(const Array1D< double > &weights)
Set weights for computing the integral needed for Nystrom's method for solving the Fredholm integral ...
Definition kle.cpp:89
+
KLDecompUni::KLDecompUni
KLDecompUni(const KLDecompUni &)
Dummy default constructor, which should not be used as it is not well defined.
Definition kle.h:145
+
KLDecompUni::KLDecompUni
KLDecompUni()
Definition kle.cpp:65
+
KLDecompUni::eigRange_
char eigRange_
Option to set the type of range for eigenvalues.
Definition kle.h:163
+
KLDecompUni::wh_
Array1D< double > wh_
Array to hold square roots of weights.
Definition kle.h:158
+
KLDecompUni::decompose
int decompose(const Array2D< double > &corr, const int &nKL)
Perform KL decomposition into nKL modes and return actual number of modes that were obtained.
Definition kle.cpp:121
+
KLDecompUni::whcwh_
Array2D< double > whcwh_
Matrix to hold the upper triangular part of the matrix to get eigenvalues of.
Definition kle.h:152
+
KLDecompUni::ifail_
Array1D< int > ifail_
Array to store indices of eigenvectors that failed to converge.
Definition kle.h:185
+
KLDecompUni::vu_
double vu_
Upper bound for range of eigenvalues.
Definition kle.h:169
+
KLDecompUni::vl_
double vl_
Lower bound for range of eigenvalues.
Definition kle.h:167
+
KLDecompUni::KLmodes
const Array2D< double > & KLmodes() const
Get associated KL modes.
Definition kle.cpp:264
+
KLDecompUni::~KLDecompUni
~KLDecompUni()
Destructor.
Definition kle.h:69
+
KLDecompUni::jobz_
char jobz_
Option to determine what to compute (eigenvalues and eigenvectors)
Definition kle.h:161
+
KLDecompUni::truncRealiz
void truncRealiz(const Array1D< double > &meanrea, const Array2D< double > &xi, const int &nKL, Array2D< double > &trunc_realiz)
Returns the truncated KL sum.
Definition kle.cpp:321
+
KLDecompUni::meanRealiz
void meanRealiz(const Array2D< double > &realiz, Array1D< double > &mean_realiz)
Calculate (in meanRealiz) the mean realizations.
Definition kle.cpp:300
+
KLDecompUni::KLproject
void KLproject(const Array2D< double > &realiz, Array2D< double > &xi)
Project realizations to the KL modes and store them in xi ( )
Definition kle.cpp:204
+
KLDecompUni::absTol_
double absTol_
Absolute tolerance for convergence.
Definition kle.h:175
+
KLDecompUni::eigenvalues
const Array1D< double > & eigenvalues() const
Get eigenvalues in descending order.
Definition kle.cpp:232
+
KLDecompUni::eig_info_
int eig_info_
info on success of the eigenvector solutions
Definition kle.h:183
+
KLDecompUni::uplo_
char uplo_
Option to indicate how matrix is stored.
Definition kle.h:165
+
KLDecompUni::w_
Array1D< double > w_
Array to hold weights for Nystrom's method for Fredholm integral equation solution.
Definition kle.h:155
+
KLDecompUni::il_
int il_
Lower index of range of eigenvalues requested.
Definition kle.h:171
+
KLDecompUni::eig_values_
Array1D< double > eig_values_
Array to store eigenvalues.
Definition kle.h:178
+
KLDecompUni::KL_modes_
Array2D< double > KL_modes_
Matrix to store KL modes.
Definition kle.h:180
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/lreg_8cpp.html b/docs/html/lreg_8cpp.html new file mode 100644 index 00000000..8c7398fc --- /dev/null +++ b/docs/html/lreg_8cpp.html @@ -0,0 +1,128 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: lreg.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
lreg.cpp File Reference
+
+
+ +

Linear regression class. +More...

+
#include <math.h>
+#include <cfloat>
+#include <iostream>
+#include "lreg.h"
+#include "gen_defs.h"
+#include "error_handlers.h"
+#include "arraytools.h"
+#include "arrayio.h"
+#include "PCSet.h"
+#include "bcs.h"
+#include "ftndefs.h"
+#include "depblas.h"
+#include "deplapack.h"
+#include "tools.h"
+#include "lbfgs_routines.h"
+#include <assert.h>
+
+ + + +

+Functions

double loo (int ndim, double *m, void *classpointer)
 
+

Detailed Description

+

Linear regression class.

+
Author
K. Sargsyan 2015 -
+

Function Documentation

+ +

◆ loo()

+ +
+
+ + + + + + + + + + + + + + + + +
double loo (int ndim,
double * m,
void * classpointer )
+
+

Leave-one-out error computation done as a global function for optimization

Todo
Find a more elegant way to do this within the class
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/lreg_8h.html b/docs/html/lreg_8h.html new file mode 100644 index 00000000..758153f0 --- /dev/null +++ b/docs/html/lreg_8h.html @@ -0,0 +1,98 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: lreg.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
lreg.h File Reference
+
+
+ +

Header file for the linear regression class A great deal of notations and computations follow [Orr:1996]. +More...

+
#include "Array1D.h"
+#include "Array2D.h"
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + +

+Classes

class  Lreg
 Class for linear parameteric regression. More...
 
class  RBFreg
 Derived class for RBF regression. More...
 
class  PCreg
 Derived class for PC regression. More...
 
class  PLreg
 Derived class for polynomial regression. More...
 
+

Detailed Description

+

Header file for the linear regression class A great deal of notations and computations follow [Orr:1996].

+
Author
K. Sargsyan 2015 -
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/lreg_8h_source.html b/docs/html/lreg_8h_source.html new file mode 100644 index 00000000..c901de46 --- /dev/null +++ b/docs/html/lreg_8h_source.html @@ -0,0 +1,315 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: lreg.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
lreg.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
32
+
33#ifndef LREG_H_SEEN
+
34#define LREG_H_SEEN
+
35
+
36#include "Array1D.h"
+
37#include "Array2D.h"
+
38
+
+
41class Lreg {
+
42public:
+
43
+
45 Lreg() {residFlag_=false; diagPFlag_=false; sigma2_.Resize(1,0.e0); return;};
+
47 ~Lreg() {};
+
48 //void testing();
+
49
+
51 virtual void SetMindex(Array2D<int>& mindex){};
+
53 virtual void GetMindex(Array2D<int>& mindex){};
+
55 virtual void SetCenters(Array2D<double>& centers){};
+
57 virtual void SetWidths(Array1D<double>& widths){};
+
59 virtual void SetParamsRBF(){};
+
61 virtual void EvalBases(Array2D<double>& xx,Array2D<double>& bb){};// dummy
+
63 virtual void StripBases(Array1D<int>& used){};
+
64
+
66 void InitRegr();
+
68 void SetupData(Array2D<double>& xdata, Array1D<double>& ydata);
+
70 void SetupData(Array2D<double>& xdata, Array2D<double>& ydata);
+
72 void SetRegMode(string regmode){regMode_=regmode; return;}
+
74 void SetRegWeights(Array1D<double>& weights);
+
76 void BCS_BuildRegr(Array1D<int>& selected, double eta);
+
78 void LSQ_BuildRegr();
+
80 void EvalRegr(Array2D<double>& xcheck, Array1D<double>& ycheck,Array1D<double>& yvar,Array2D<double>& ycov);
+
81
+
83 int GetNpt() const {return npt_;}
+
85 int GetNdim() const {return ndim_;}
+
87 int GetNbas() const {return nbas_;}
+
89 double GetSigma2() const {return sigma2_(0);}
+
91 void GetCoefCov(Array2D<double>& coef_cov) {coef_cov=coef_cov_; return;}
+
93 void GetCoef(Array1D<double>& coef) {coef=coef_; return;}
+
95 void Proj(Array1D<double>& array,Array1D<double>& proj_array);
+
97 Array1D<double> LSQ_computeBestLambdas();
+
99 double LSQ_computeBestLambda();
+
101 void getResid();
+
103 void getDiagP();
+
105 Array1D<double> computeErrorMetrics(string method);
+
107 double computeRVE(Array2D<double>& xval,Array1D<double>& yval,Array1D<double>& yval_regr);
+
108
+
109
+
110 protected:
+
111
+
113 Array2D<double> xdata_;
+
115 Array1D<double> ydata_;
+
116
+
118 int npt_;
+
120 int nbas_;
+
122 int ndim_;
+
124 Array1D<double> sigma2_; // Defined as an array of length one for ease of passing it through Pybind
+
125 // double sigma2_;
+
127 Array1D<double> weights_;
+
129 Array1D<double> resid_;
+
131 bool residFlag_;
+
133 Array1D<double> diagP_;
+
135 bool diagPFlag_;
+
136
+
138
+
139 Array2D<double> bdata_,A_,A_inv_,coef_cov_;
+
140 Array1D<double> Hty_,coef_,coef_erb_;
+
142
+
143private:
+
144
+
146 double LSQ_computeLOO();
+
148 double LSQ_computeGCV();
+
150 bool dataSetFlag_;
+
152 string regMode_;
+
153
+
154};
+
+
155
+
+
158class RBFreg: public Lreg {
+
159public:
+
161 RBFreg(Array2D<double>& centers, Array1D<double>& widths);
+
163 ~RBFreg() {};
+
164
+
166 void SetCenters(Array2D<double>& centers);
+
168 void SetWidths(Array1D<double>& widths);
+
169
+
171 void EvalBases(Array2D<double>& xx,Array2D<double>& bb);
+
173 void StripBases(Array1D<int>& used);
+
174
+
175private:
+
177 Array2D<double> centers_;
+
179 Array1D<double> widths_;
+
180
+
181};
+
+
182
+
+
185class PCreg: public Lreg {
+
186public:
+
188 PCreg(string strpar,int order,int dim);
+
189 PCreg(string strpar,Array2D<int>& mindex);
+
191 ~PCreg() {};
+
192
+
194 void EvalBases(Array2D<double>& xx,Array2D<double>& bb);
+
196 void StripBases(Array1D<int>& used);
+
198 void SetMindex(Array2D<int>& mindex){mindex_=mindex;}
+
200 void GetMindex(Array2D<int>& mindex){mindex=mindex_;return;}
+
201
+
202private:
+
204 Array2D<int> mindex_;
+
206 string pctype_;
+
207
+
208};
+
+
209
+
+
212class PLreg: public Lreg {
+
213public:
+
215 PLreg(int order, int dim);
+
216 PLreg(Array2D<int>& mindex);
+
218 ~PLreg() {};
+
219
+
221 void EvalBases(Array2D<double>& xx,Array2D<double>& bb);
+
223 void StripBases(Array1D<int>& used);
+
225 void SetMindex(Array2D<int>& mindex){mindex_=mindex;}
+
227 void GetMindex(Array2D<int>& mindex){mindex=mindex_;return;}
+
228
+
229
+
230private:
+
232 Array2D<int> mindex_;
+
233
+
234};
+
+
235
+
236#endif /* LREG_H_SEEN */
+
Array1D.h
1D Array class for any type T
+
Array2D.h
2D Array class for any type T
+
Array1D< double >::Resize
void Resize(const int &nx)
Resizes the array.
Definition Array1D.h:545
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
Lreg
Class for linear parameteric regression.
Definition lreg.h:41
+
Lreg::GetNbas
int GetNbas() const
Get the number of bases.
Definition lreg.h:87
+
Lreg::LSQ_computeBestLambdas
Array1D< double > LSQ_computeBestLambdas()
Compute the best values for regulariation parameter vector lambda, for LSQ.
Definition lreg.cpp:384
+
Lreg::ydata_
Array1D< double > ydata_
ydata array
Definition lreg.h:115
+
Lreg::diagP_
Array1D< double > diagP_
Diagonal of projection matrix.
Definition lreg.h:133
+
Lreg::BCS_BuildRegr
void BCS_BuildRegr(Array1D< int > &selected, double eta)
Build BCS regression.
Definition lreg.cpp:206
+
Lreg::nbas_
int nbas_
Number of bases.
Definition lreg.h:120
+
Lreg::sigma2_
Array1D< double > sigma2_
Variance.
Definition lreg.h:124
+
Lreg::dataSetFlag_
bool dataSetFlag_
Flag to indicate whether data has been set or not.
Definition lreg.h:150
+
Lreg::~Lreg
~Lreg()
Destrcutor.
Definition lreg.h:47
+
Lreg::SetRegWeights
void SetRegWeights(Array1D< double > &weights)
Set weights.
Definition lreg.cpp:197
+
Lreg::LSQ_computeGCV
double LSQ_computeGCV()
COmpute generalized-cross-validation error for LSQ.
Definition lreg.cpp:504
+
Lreg::SetParamsRBF
virtual void SetParamsRBF()
Set parameters (for RBF)
Definition lreg.h:59
+
Lreg::residFlag_
bool residFlag_
Flag to indicate whether residual is computed.
Definition lreg.h:131
+
Lreg::GetCoef
void GetCoef(Array1D< double > &coef)
Get coefficients.
Definition lreg.h:93
+
Lreg::xdata_
Array2D< double > xdata_
xdata array
Definition lreg.h:113
+
Lreg::A_inv_
Array2D< double > A_inv_
Definition lreg.h:139
+
Lreg::GetNpt
int GetNpt() const
Get the number of points.
Definition lreg.h:83
+
Lreg::Hty_
Array1D< double > Hty_
Definition lreg.h:140
+
Lreg::GetCoefCov
void GetCoefCov(Array2D< double > &coef_cov)
Get coefficient covariance.
Definition lreg.h:91
+
Lreg::GetNdim
int GetNdim() const
Get dimensionality.
Definition lreg.h:85
+
Lreg::getResid
void getResid()
Compute the residual vector, if not already computed.
Definition lreg.cpp:423
+
Lreg::computeErrorMetrics
Array1D< double > computeErrorMetrics(string method)
Compote error according to a selected metrics.
Definition lreg.cpp:454
+
Lreg::coef_cov_
Array2D< double > coef_cov_
Definition lreg.h:139
+
Lreg::StripBases
virtual void StripBases(Array1D< int > &used)
Strip bases.
Definition lreg.h:63
+
Lreg::regMode_
string regMode_
Regression mode (m, ms, msc for mean-only, mean+variance, mean+covariance)
Definition lreg.h:152
+
Lreg::GetMindex
virtual void GetMindex(Array2D< int > &mindex)
Get multiindex.
Definition lreg.h:53
+
Lreg::SetMindex
virtual void SetMindex(Array2D< int > &mindex)
Set multiindex.
Definition lreg.h:51
+
Lreg::bdata_
Array2D< double > bdata_
Auxiliary matrix or vector; see UQTk Manual.
Definition lreg.h:139
+
Lreg::computeRVE
double computeRVE(Array2D< double > &xval, Array1D< double > &yval, Array1D< double > &yval_regr)
Compute validation error.
Definition lreg.cpp:470
+
Lreg::GetSigma2
double GetSigma2() const
Get the variance of the data.
Definition lreg.h:89
+
Lreg::resid_
Array1D< double > resid_
Residuals.
Definition lreg.h:129
+
Lreg::EvalBases
virtual void EvalBases(Array2D< double > &xx, Array2D< double > &bb)
Evaluate bases.
Definition lreg.h:61
+
Lreg::ndim_
int ndim_
Dimensionality.
Definition lreg.h:122
+
Lreg::InitRegr
void InitRegr()
Initialize.
Definition lreg.cpp:133
+
Lreg::coef_
Array1D< double > coef_
Definition lreg.h:140
+
Lreg::Proj
void Proj(Array1D< double > &array, Array1D< double > &proj_array)
Project.
Definition lreg.cpp:368
+
Lreg::SetRegMode
void SetRegMode(string regmode)
Set the regression mode.
Definition lreg.h:72
+
Lreg::A_
Array2D< double > A_
Definition lreg.h:139
+
Lreg::coef_erb_
Array1D< double > coef_erb_
Definition lreg.h:140
+
Lreg::EvalRegr
void EvalRegr(Array2D< double > &xcheck, Array1D< double > &ycheck, Array1D< double > &yvar, Array2D< double > &ycov)
Evaluate the regression expansion.
Definition lreg.cpp:301
+
Lreg::weights_
Array1D< double > weights_
Weights.
Definition lreg.h:127
+
Lreg::LSQ_BuildRegr
void LSQ_BuildRegr()
Build LSQ regression.
Definition lreg.cpp:238
+
Lreg::SetWidths
virtual void SetWidths(Array1D< double > &widths)
Set widths (for RBF)
Definition lreg.h:57
+
Lreg::SetupData
void SetupData(Array2D< double > &xdata, Array1D< double > &ydata)
Setup data (1d ydata)
Definition lreg.cpp:151
+
Lreg::LSQ_computeLOO
double LSQ_computeLOO()
Compute Leave-one-out error for LSQ.
Definition lreg.cpp:492
+
Lreg::getDiagP
void getDiagP()
Compute the diagonal of projection matrix, if not already computed.
Definition lreg.cpp:436
+
Lreg::LSQ_computeBestLambda
double LSQ_computeBestLambda()
Compute the best value for regulariation parameter lambda, for LSQ.
Definition lreg.cpp:404
+
Lreg::npt_
int npt_
Number of samples.
Definition lreg.h:118
+
Lreg::diagPFlag_
bool diagPFlag_
Flag to indicate whether diagonal of projetion matrix is computed.
Definition lreg.h:135
+
Lreg::SetCenters
virtual void SetCenters(Array2D< double > &centers)
Set centers (for RBF)
Definition lreg.h:55
+
Lreg::Lreg
Lreg()
Constructor.
Definition lreg.h:45
+
PCreg
Derived class for PC regression.
Definition lreg.h:185
+
PCreg::~PCreg
~PCreg()
Destructor.
Definition lreg.h:191
+
PCreg::PCreg
PCreg(string strpar, int order, int dim)
Constructors:
Definition lreg.cpp:76
+
PCreg::mindex_
Array2D< int > mindex_
Multiindex.
Definition lreg.h:204
+
PCreg::EvalBases
void EvalBases(Array2D< double > &xx, Array2D< double > &bb)
Evaluate the bases.
Definition lreg.cpp:540
+
PCreg::pctype_
string pctype_
PC type.
Definition lreg.h:206
+
PCreg::SetMindex
void SetMindex(Array2D< int > &mindex)
Set multiindex.
Definition lreg.h:198
+
PCreg::StripBases
void StripBases(Array1D< int > &used)
Strip the bases.
Definition lreg.cpp:596
+
PCreg::GetMindex
void GetMindex(Array2D< int > &mindex)
Get multiindex.
Definition lreg.h:200
+
PLreg
Derived class for polynomial regression.
Definition lreg.h:212
+
PLreg::StripBases
void StripBases(Array1D< int > &used)
Strip the bases.
Definition lreg.cpp:610
+
PLreg::SetMindex
void SetMindex(Array2D< int > &mindex)
Set multiindex.
Definition lreg.h:225
+
PLreg::GetMindex
void GetMindex(Array2D< int > &mindex)
Get multiindex.
Definition lreg.h:227
+
PLreg::PLreg
PLreg(int order, int dim)
Constructors:
Definition lreg.cpp:104
+
PLreg::EvalBases
void EvalBases(Array2D< double > &xx, Array2D< double > &bb)
Evaluate the bases.
Definition lreg.cpp:553
+
PLreg::mindex_
Array2D< int > mindex_
Multiindex.
Definition lreg.h:232
+
PLreg::~PLreg
~PLreg()
Destructor.
Definition lreg.h:218
+
RBFreg
Derived class for RBF regression.
Definition lreg.h:158
+
RBFreg::SetWidths
void SetWidths(Array1D< double > &widths)
Set widths.
Definition lreg.cpp:532
+
RBFreg::RBFreg
RBFreg(Array2D< double > &centers, Array1D< double > &widths)
Constructor:
Definition lreg.cpp:64
+
RBFreg::EvalBases
void EvalBases(Array2D< double > &xx, Array2D< double > &bb)
Evaluate the bases.
Definition lreg.cpp:574
+
RBFreg::~RBFreg
~RBFreg()
Destructor.
Definition lreg.h:163
+
RBFreg::centers_
Array2D< double > centers_
RBF centers.
Definition lreg.h:177
+
RBFreg::StripBases
void StripBases(Array1D< int > &used)
Strip the bases.
Definition lreg.cpp:624
+
RBFreg::SetCenters
void SetCenters(Array2D< double > &centers)
Set centers.
Definition lreg.cpp:523
+
RBFreg::widths_
Array1D< double > widths_
RBF bases' widhts.
Definition lreg.h:179
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/mcmc_8cpp.html b/docs/html/mcmc_8cpp.html new file mode 100644 index 00000000..3dc72f66 --- /dev/null +++ b/docs/html/mcmc_8cpp.html @@ -0,0 +1,115 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: mcmc.cpp File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Functions
+
mcmc.cpp File Reference
+
+
+
#include <math.h>
+#include <float.h>
+#include "error_handlers.h"
+#include "deplapack.h"
+#include "tools.h"
+#include "arrayio.h"
+#include "arraytools.h"
+#include "mcmc.h"
+#include "gen_defs.h"
+#include "lbfgs_routines.h"
+
+ + + +

+Functions

double neg_logposteriorproxy (int chaindim, double *m, void *classpointer)
 
+

Function Documentation

+ +

◆ neg_logposteriorproxy()

+ +
+
+ + + + + + + + + + + + + + + + +
double neg_logposteriorproxy (int chaindim,
double * m,
void * classpointer )
+
+ +
+
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/mcmc_8h.html b/docs/html/mcmc_8h.html new file mode 100644 index 00000000..fdd7182e --- /dev/null +++ b/docs/html/mcmc_8h.html @@ -0,0 +1,104 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: mcmc.h File Reference + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
+Classes
+
mcmc.h File Reference
+
+
+ +

Header file for the Markov chain Monte Carlo class. +More...

+
#include "dsfmt_add.h"
+#include "arrayio.h"
+#include "arraytools.h"
+#include <iostream>
+#include <string.h>
+#include <stdio.h>
+#include <sstream>
+
+

Go to the source code of this file.

+ + + + + + + + + + + + + + + +

+Classes

class  LogPosteriorBase
 
class  base
 
class  main
 
class  MCMC
 Markov Chain Monte Carlo base class. Implemented the basic and most general MCMC algorithms. More...
 
struct  MCMC::chainstate
 
struct  MCMC::outputInfo
 
+

Detailed Description

+

Header file for the Markov chain Monte Carlo class.

+
Author
K. Sargsyan, C. Safta, B. Debusschere, 2012 -
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/mcmc_8h_source.html b/docs/html/mcmc_8h_source.html new file mode 100644 index 00000000..56aee9eb --- /dev/null +++ b/docs/html/mcmc_8h_source.html @@ -0,0 +1,439 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: mcmc.h Source File + + + + + + + + + +
+
+ + + + + + +
+
UQTk: Uncertainty Quantification Toolkit 3.1.5 +
+
+
+ + + + + + + + + +
+
+
+
mcmc.h
+
+
+Go to the documentation of this file.
1/* =====================================================================================
+
2
+
3 The UQ Toolkit (UQTk) version 3.1.5
+
4 Copyright (2024) NTESS
+
5 https://www.sandia.gov/UQToolkit/
+
6 https://github.com/sandialabs/UQTk
+
7
+
8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
+
9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
+
10 retains certain rights in this software.
+
11
+
12 This file is part of The UQ Toolkit (UQTk)
+
13
+
14 UQTk is open source software: you can redistribute it and/or modify
+
15 it under the terms of BSD 3-Clause License
+
16
+
17 UQTk is distributed in the hope that it will be useful,
+
18 but WITHOUT ANY WARRANTY; without even the implied warranty of
+
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+
20 BSD 3 Clause License for more details.
+
21
+
22 You should have received a copy of the BSD 3 Clause License
+
23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
+
24
+
25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
+
26 Sandia National Laboratories, Livermore, CA, USA
+
27===================================================================================== */
+
31
+
32#ifndef UQTKMCMC_H_SEEN
+
33#define UQTKMCMC_H_SEEN
+
34
+
35#include "dsfmt_add.h"
+
36#include "arrayio.h"
+
37#include "arraytools.h"
+
38
+
39#include <iostream>
+
40#include <string.h>
+
41#include <stdio.h>
+
42#include <sstream>
+
43
+
44using namespace std; // needed for python string conversion
+
45
+
+
46class LogPosteriorBase{
+
47public:
+
+
48 virtual double eval(Array1D<double>&){
+
49 return 3.14;
+
50 };
+
+
51 virtual ~LogPosteriorBase(){};
+
52};
+
+
53
+
+
54class base{
+
55public:
+
56 virtual double fun(double* x, int n){return 0.0;}
+
57};
+
+
58
+
+
59class main{
+
60public:
+
61 base* b_;
+
62
+
+
63 main(base& b){
+
64 b_ = &b;
+
65 }
+
+
66};
+
+
67//*****************************************
+
68
+
+
72class MCMC{
+
73public:
+
74 // Struct for the chain state
+
+
75 struct chainstate{
+
76 int step;
+
77 Array1D<double> state;
+
78 double alfa;
+
79 double post;
+
80 };
+
+
81
+
82 // Constructors:
+
83
+
85 MCMC(double (*logposterior)(Array1D<double>&, void *), void *postinfo);
+
87 MCMC(LogPosteriorBase& L);
+
89 MCMC();
+
90
+
91 // Set or initialization functions:
+
92
+
94 void setWriteFlag(int I);
+
96 void setFcnAccept(void (*fcnAccept)(void *));
+
97 void setFcnReject(void (*fcnReject)(void *));
+
99 void setChainDim(int chdim);
+
102 void initChainPropCov(Array2D<double>& propcov);
+
105 void initChainPropCovDiag(Array1D<double>& sig);
+
107 void setOutputInfo(string outtype, string file,int freq_file, int freq_screen);
+
109 void namesPrepended();
+
111 void setSeed(int seed);
+
113 void setLower(double lower, int i);
+
115 void setUpper(double upper, int i);
+
117 void setDefaultDomain();
+
119 void setPostInfo(void *postinfo);
+
120
+
121 // Get functions:
+
122
+
124 void getChainPropCov(Array2D<double>& propcov);
+
126 string getFilename();
+
128 int getWriteFlag();
+
130 void getSamples(int burnin, int every,Array2D<double>& samples);
+
132 void getSamples(Array2D<double>& samples);
+
134 void getFcnAccept(void (*fcnAccept)(void *));
+
135 void getFcnReject(void (*fcnReject)(void *));
+
137 string getOutputType();
+
139 int getFileFreq();
+
141 int getScreenFreq();
+
143 bool getNamesPrepended();
+
145 int getSeed();
+
147 double getLower(int i);
+
149 double getUpper(int i);
+
151 bool getDimInit();
+
153 void getPostInfo(void *post);
+
155 bool getPropCovInit();
+
157 bool getOutputInit();
+
159 int getLastWrite();
+
161 bool getFcnAcceptInit();
+
162 bool getFcnRejectInit();
+
164 virtual int getNSubSteps(){return 1;};
+
166 int getLowerFlag(int i);
+
167 int getUpperFlag(int i);
+
169 void getAcceptRatio(double * accrat);
+
171 double getAcceptRatio();
+
173 int GetChainDim() const;
+
174
+
175 // Chain Functions:
+
176
+
178 void resetChainState();
+
180 void resetChainFilename(string filename);
+
182 void parseBinChain(string filename, Array1D<chainstate>& readchain);
+
184 void writeFullChainTxt(string filename, Array1D<chainstate> fullchain);
+
186 void getFullChain(Array1D<chainstate>& readchain);
+
188 void appendMAP();
+
190 double getMode(Array1D<double>& MAPparams);
+
192 int getFullChainSize();
+
193
+
194 // Functions to make sure the code respects the interface for chainstates:
+
195
+
197 void setCurrentStateStep(int i);
+
199 void getCurrentStateState(Array1D<double>& state);
+
201 double getCurrentStatePost();
+
203 void setCurrentStateState(Array1D<double>& newState);
+
205 void setCurrentStatePost(double newPost);
+
207 void setCurrentStateAlfa(double newAlfa);
+
209 double getModeStatePost();
+
211 void getModeStateState(Array1D<double>& state);
+
212
+
213 // Run functions:
+
214
+
216 virtual void runOptim(Array1D<double>& start);
+
218 virtual void runChain(int ncalls, Array1D<double>& chstart) = 0;
+
220 virtual void runChain(int ncalls) = 0;
+
222 void runAcceptFcn();
+
224 void runRejectFcn();
+
225
+
226
+
227
+
229 bool newModeFound();
+
231 double evalLogPosterior(Array1D<double>& m);
+
233 bool inDomain(Array1D<double>& m);
+
235 void writeChainTxt(string filename);
+
237 void writeChainBin(string filename);
+
238
+
240 void setNewMode(bool value);
+
241
+
242
+
243
+
244protected:
+
246 void setAcceptRatio(double d);
+
248 void addCurrentState();
+
250 void updateMode();
+
252 void setLastWrite(int i);
+
253
+
254 dsfmt_t RandomState;
+
255
+
256
+
257private:
+
258 int WRITE_FLAG; // Write Flag
+
259 int FLAG; // Flag
+
260 LogPosteriorBase* L_; // Pointer to the LogPosterior base passed in through contstructor
+
+
261 struct outputInfo{
+
262 string outtype;
+
263 string filename;
+
264 int freq_file;
+
265 int freq_screen;
+
266 } outputinfo_;
+
+
267 int chainDim_; // Chain dimensions
+
268 double (*logPosterior_)(Array1D<double>&, void *) = NULL; // Pointer to log-posterior function
+
269 void (*fcnAccept_)(void *) = NULL; // Pointer to accept function
+
270 void (*fcnReject_)(void *) = NULL; // Pointer to reject function
+
271 void *postInfo_ = NULL; // Void pointer to the posterior info (data)
+
272 Array2D<double> chcov; // Chain proposal distributions (before the adaptivity starts)
+
273 int seed_; // Random seed for mcmc
+
274
+
275 virtual double probOldNew(Array1D<double>& a, Array1D<double>& b){return 0.0;}; // Evaluate old|new probabilities and new|old probabilities
+
276 //double evallogMVN_diag(Array1D<double>& x,Array1D<double>& mu,Array1D<double>& sig2); // Evaluate MVN
+
277
+
278 chainstate currState_; // The current chain state
+
279 chainstate modeState_; // The current MAP state
+
280 Array1D<chainstate> fullChain_; // Array of chain states
+
281
+
282 //void updateMode(); // Function to update the chain mode
+
283
+
284 int lastwrite_; // Indicates up to which state
+
285 bool namesPrepend = false;
+
286
+
287 bool newMode_ = false; // Flag to indicate whether a new mode is found during the last call of runChain, initalized as false
+
288
+
289 double accRatio_ = -1.0; // Acceptance ratio of the chain, initialized as -1.0
+
290
+
291 // Flags to indicate whether the corresponding parameters are initialized or not
+
292 bool chaindimInit_ = false;
+
293 bool propcovInit_ = false;
+
294 bool methodInit_ = false;
+
295 bool outputInit_ = false;
+
296
+
297 bool fcnAcceptFlag_ = false; // Flag that indicates whether the accept function is given or not
+
298 bool fcnRejectFlag_ = false; // Flag that indicates whether the reject function is given or not
+
299
+
301 Array1D<double> Lower_;
+
303 Array1D<double> Upper_;
+
304
+
306 Array1D<int> lower_flag_;
+
308 Array1D<int> upper_flag_;
+
309
+
310};
+
+
311
+
312#endif /* UQTKMCMC_H_SEEN */
+
arrayio.h
Header file for array read/write utilities.
+
arraytools.h
Header file for array tools.
+
Array1D
Stores data of any type T in a 1D array.
Definition Array1D.h:61
+
Array2D
Stores data of any type T in a 2D array.
Definition Array2D.h:60
+
LogPosteriorBase
Definition mcmc.h:46
+
LogPosteriorBase::~LogPosteriorBase
virtual ~LogPosteriorBase()
Definition mcmc.h:51
+
LogPosteriorBase::eval
virtual double eval(Array1D< double > &)
Definition mcmc.h:48
+
MCMC
Markov Chain Monte Carlo base class. Implemented the basic and most general MCMC algorithms.
Definition mcmc.h:72
+
MCMC::setCurrentStateStep
void setCurrentStateStep(int i)
Function to set the step of the current state.
Definition mcmc.cpp:425
+
MCMC::chcov
Array2D< double > chcov
Definition mcmc.h:272
+
MCMC::getUpperFlag
int getUpperFlag(int i)
Definition mcmc.cpp:571
+
MCMC::getLower
double getLower(int i)
Get the lower bounds based on an index i.
Definition mcmc.cpp:271
+
MCMC::setFcnAccept
void setFcnAccept(void(*fcnAccept)(void *))
Set the accept and reject functions.
Definition mcmc.cpp:111
+
MCMC::writeFullChainTxt
void writeFullChainTxt(string filename, Array1D< chainstate > fullchain)
Write an array of chain-states to a file.
Definition mcmc.cpp:368
+
MCMC::L_
LogPosteriorBase * L_
Definition mcmc.h:260
+
MCMC::fcnAcceptFlag_
bool fcnAcceptFlag_
Definition mcmc.h:297
+
MCMC::currState_
chainstate currState_
Definition mcmc.h:278
+
MCMC::inDomain
bool inDomain(Array1D< double > &m)
Check if a point is in the domain.
Definition mcmc.cpp:526
+
MCMC::lower_flag_
Array1D< int > lower_flag_
Lower bound existence flags.
Definition mcmc.h:306
+
MCMC::setLower
void setLower(double lower, int i)
Set lower bound at the index of i.
Definition mcmc.cpp:185
+
MCMC::GetChainDim
int GetChainDim() const
Get the MCMC chain dimensionality.
Definition mcmc.cpp:513
+
MCMC::upper_flag_
Array1D< int > upper_flag_
Upper bound existence flags.
Definition mcmc.h:308
+
MCMC::fcnRejectFlag_
bool fcnRejectFlag_
Definition mcmc.h:298
+
MCMC::chainDim_
int chainDim_
Definition mcmc.h:267
+
MCMC::RandomState
dsfmt_t RandomState
Definition mcmc.h:254
+
MCMC::setFcnReject
void setFcnReject(void(*fcnReject)(void *))
Definition mcmc.cpp:119
+
MCMC::getFilename
string getFilename()
Get the name of the chain file.
Definition mcmc.cpp:217
+
MCMC::MCMC
MCMC()
Dummy Constructor, used for TMCMC.
Definition mcmc.cpp:88
+
MCMC::getFullChain
void getFullChain(Array1D< chainstate > &readchain)
Get full chain as an array of chain-states.
Definition mcmc.cpp:402
+
MCMC::setChainDim
void setChainDim(int chdim)
Set the dimensions of the chain given an integer.
Definition mcmc.cpp:127
+
MCMC::getFcnAcceptInit
bool getFcnAcceptInit()
Get if the accept and reject functions are initialized.
Definition mcmc.cpp:559
+
MCMC::initChainPropCovDiag
void initChainPropCovDiag(Array1D< double > &sig)
Initialize proposal covariance matrix given its 1d-array diagonal For aMCMC, this matrix is used only...
Definition mcmc.cpp:145
+
MCMC::runChain
virtual void runChain(int ncalls)=0
Start an MCMC chain with trivial initial condition.
+
MCMC::outputinfo_
struct MCMC::outputInfo outputinfo_
+
MCMC::writeChainTxt
void writeChainTxt(string filename)
Write the full chain as a text.
Definition mcmc.cpp:575
+
MCMC::runAcceptFcn
void runAcceptFcn()
Function to run the accept function.
Definition mcmc.cpp:315
+
MCMC::setCurrentStateState
void setCurrentStateState(Array1D< double > &newState)
Function to set the current state's state.
Definition mcmc.cpp:435
+
MCMC::getCurrentStateState
void getCurrentStateState(Array1D< double > &state)
Function to get the state of the current state.
Definition mcmc.cpp:430
+
MCMC::getUpper
double getUpper(int i)
Get the upper bounds based on an index i.
Definition mcmc.cpp:275
+
MCMC::runChain
virtual void runChain(int ncalls, Array1D< double > &chstart)=0
The actual function that generates MCMC.
+
MCMC::getDimInit
bool getDimInit()
Get if the Chain Dimensions are initialized.
Definition mcmc.cpp:279
+
MCMC::propcovInit_
bool propcovInit_
Definition mcmc.h:293
+
MCMC::seed_
int seed_
Definition mcmc.h:273
+
MCMC::FLAG
int FLAG
Definition mcmc.h:259
+
MCMC::getFullChainSize
int getFullChainSize()
Get the full chain size.
Definition mcmc.cpp:417
+
MCMC::fcnAccept_
void(* fcnAccept_)(void *)
Definition mcmc.h:269
+
MCMC::getModeStatePost
double getModeStatePost()
Function to get the mode state's post.
Definition mcmc.cpp:449
+
MCMC::getOutputInit
bool getOutputInit()
Get if the output info has been initialized.
Definition mcmc.cpp:292
+
MCMC::addCurrentState
void addCurrentState()
Function to add the current chain state to the full chain.
Definition mcmc.cpp:421
+
MCMC::initChainPropCov
void initChainPropCov(Array2D< double > &propcov)
Initialize proposal covariance matrix given as a 2d-array For aMCMC, this matrix is used only before ...
Definition mcmc.cpp:135
+
MCMC::getChainPropCov
void getChainPropCov(Array2D< double > &propcov)
Returns proposal covariance matrix.
Definition mcmc.cpp:211
+
MCMC::getFcnAccept
void getFcnAccept(void(*fcnAccept)(void *))
Get the accept and reject functions given a pointer.
Definition mcmc.cpp:241
+
MCMC::setSeed
void setSeed(int seed)
Set random generation seed.
Definition mcmc.cpp:178
+
MCMC::evalLogPosterior
double evalLogPosterior(Array1D< double > &m)
Function to evaluate the log-posterior.
Definition mcmc.cpp:517
+
MCMC::setAcceptRatio
void setAcceptRatio(double d)
Set the acceptance ratio.
Definition mcmc.cpp:305
+
MCMC::getOutputType
string getOutputType()
Get the output file type as a string.
Definition mcmc.cpp:251
+
MCMC::getLowerFlag
int getLowerFlag(int i)
Get function for the lower and upper Flag at index i.
Definition mcmc.cpp:567
+
MCMC::newModeFound
bool newModeFound()
Check to see if a new mode was found during last call to runChain.
Definition mcmc.cpp:499
+
MCMC::postInfo_
void * postInfo_
Definition mcmc.h:271
+
MCMC::Lower_
Array1D< double > Lower_
Lower bounds.
Definition mcmc.h:301
+
MCMC::getModeStateState
void getModeStateState(Array1D< double > &state)
Function to get the mode state's state.
Definition mcmc.cpp:458
+
MCMC::getPostInfo
void getPostInfo(void *post)
Get post info pointer.
Definition mcmc.cpp:283
+
MCMC::getNSubSteps
virtual int getNSubSteps()
Get function for number of sub steps.
Definition mcmc.h:164
+
MCMC::setCurrentStatePost
void setCurrentStatePost(double newPost)
Function to set the current state's post.
Definition mcmc.cpp:444
+
MCMC::probOldNew
virtual double probOldNew(Array1D< double > &a, Array1D< double > &b)
Definition mcmc.h:275
+
MCMC::setPostInfo
void setPostInfo(void *postinfo)
Set the Posterior Info pointer.
Definition mcmc.cpp:310
+
MCMC::Upper_
Array1D< double > Upper_
Upper bounds.
Definition mcmc.h:303
+
MCMC::newMode_
bool newMode_
Definition mcmc.h:287
+
MCMC::writeChainBin
void writeChainBin(string filename)
Write the full chain as a binary file.
Definition mcmc.cpp:609
+
MCMC::setNewMode
void setNewMode(bool value)
Function to set a new mode value.
Definition mcmc.cpp:554
+
MCMC::WRITE_FLAG
int WRITE_FLAG
Definition mcmc.h:258
+
MCMC::getFileFreq
int getFileFreq()
Get the frequency of output to file.
Definition mcmc.cpp:255
+
MCMC::namesPrepended
void namesPrepended()
Set the indicator to confirm that the names of parameters are prepended in the output file.
Definition mcmc.cpp:171
+
MCMC::setOutputInfo
void setOutputInfo(string outtype, string file, int freq_file, int freq_screen)
Set output specification struct, type('txt' or 'bin'), filename, frequency of outputs to the file and...
Definition mcmc.cpp:159
+
MCMC::methodInit_
bool methodInit_
Definition mcmc.h:294
+
MCMC::setCurrentStateAlfa
void setCurrentStateAlfa(double newAlfa)
Function to set the current state's alfa.
Definition mcmc.cpp:453
+
MCMC::getWriteFlag
int getWriteFlag()
Get the value of the write flag as an integer.
Definition mcmc.cpp:221
+
MCMC::outputInit_
bool outputInit_
Definition mcmc.h:295
+
MCMC::chaindimInit_
bool chaindimInit_
Definition mcmc.h:292
+
MCMC::getMode
double getMode(Array1D< double > &MAPparams)
Get MAP parameters.
Definition mcmc.cpp:412
+
MCMC::appendMAP
void appendMAP()
Append MAP state to the end.
Definition mcmc.cpp:407
+
MCMC::runOptim
virtual void runOptim(Array1D< double > &start)
The optimization routine.
Definition mcmc.cpp:463
+
MCMC::getAcceptRatio
double getAcceptRatio()
Get the chain's acceptance ratio as a double.
Definition mcmc.cpp:509
+
MCMC::logPosterior_
double(* logPosterior_)(Array1D< double > &, void *)
Definition mcmc.h:268
+
MCMC::runRejectFcn
void runRejectFcn()
Function to run the reject function.
Definition mcmc.cpp:320
+
MCMC::getLastWrite
int getLastWrite()
Get last write.
Definition mcmc.cpp:296
+
MCMC::parseBinChain
void parseBinChain(string filename, Array1D< chainstate > &readchain)
An auxiliary function to parse the binary file and produce an array of chain-states.
Definition mcmc.cpp:339
+
MCMC::setLastWrite
void setLastWrite(int i)
Set last write.
Definition mcmc.cpp:300
+
MCMC::getSamples
void getSamples(int burnin, int every, Array2D< double > &samples)
Get samples of the chain with burnin and thining.
Definition mcmc.cpp:225
+
MCMC::getFcnReject
void getFcnReject(void(*fcnReject)(void *))
Definition mcmc.cpp:246
+
MCMC::accRatio_
double accRatio_
Definition mcmc.h:289
+
MCMC::getScreenFreq
int getScreenFreq()
Get the frequency of output to the screen.
Definition mcmc.cpp:259
+
MCMC::getFcnRejectInit
bool getFcnRejectInit()
Definition mcmc.cpp:563
+
MCMC::getPropCovInit
bool getPropCovInit()
Get if the Prop Cov has been initialized.
Definition mcmc.cpp:288
+
MCMC::fcnReject_
void(* fcnReject_)(void *)
Definition mcmc.h:270
+
MCMC::resetChainState
void resetChainState()
Reset the chain state.
Definition mcmc.cpp:325
+
MCMC::getCurrentStatePost
double getCurrentStatePost()
Function to get the post of the current state.
Definition mcmc.cpp:440
+
MCMC::setUpper
void setUpper(double upper, int i)
Set upper bound at the index of i.
Definition mcmc.cpp:193
+
MCMC::setDefaultDomain
void setDefaultDomain()
Set default unbounded domain.
Definition mcmc.cpp:201
+
MCMC::getSeed
int getSeed()
Get the seed used for random generation.
Definition mcmc.cpp:267
+
MCMC::updateMode
void updateMode()
Function to update the Chain mode.
Definition mcmc.cpp:544
+
MCMC::namesPrepend
bool namesPrepend
Definition mcmc.h:285
+
MCMC::lastwrite_
int lastwrite_
Definition mcmc.h:284
+
MCMC::setWriteFlag
void setWriteFlag(int I)
Set the write flag function given an integer.
Definition mcmc.cpp:106
+
MCMC::fullChain_
Array1D< chainstate > fullChain_
Definition mcmc.h:280
+
MCMC::getNamesPrepended
bool getNamesPrepended()
Get if the names are prepended.
Definition mcmc.cpp:263
+
MCMC::resetChainFilename
void resetChainFilename(string filename)
Reset to a new chain file.
Definition mcmc.cpp:331
+
MCMC::modeState_
chainstate modeState_
Definition mcmc.h:279
+
base
Definition mcmc.h:54
+
base::fun
virtual double fun(double *x, int n)
Definition mcmc.h:56
+
main
Definition mcmc.h:59
+
main::b_
base * b_
Definition mcmc.h:61
+
main::main
main(base &b)
Definition mcmc.h:63
+
MCMC::chainstate
Definition mcmc.h:75
+
MCMC::chainstate::alfa
double alfa
Definition mcmc.h:78
+
MCMC::chainstate::state
Array1D< double > state
Definition mcmc.h:77
+
MCMC::chainstate::post
double post
Definition mcmc.h:79
+
MCMC::chainstate::step
int step
Definition mcmc.h:76
+
MCMC::outputInfo
Definition mcmc.h:261
+
MCMC::outputInfo::filename
string filename
Definition mcmc.h:263
+
MCMC::outputInfo::freq_file
int freq_file
Definition mcmc.h:264
+
MCMC::outputInfo::outtype
string outtype
Definition mcmc.h:262
+
MCMC::outputInfo::freq_screen
int freq_screen
Definition mcmc.h:265
+
+ +
+Generated by doxygen 1.12.0 +
+
+ + diff --git a/docs/html/menu.js b/docs/html/menu.js new file mode 100644 index 00000000..0fd1e990 --- /dev/null +++ b/docs/html/menu.js @@ -0,0 +1,134 @@ +/* + @licstart The following is the entire license notice for the JavaScript code in this file. + + The MIT License (MIT) + + Copyright (C) 1997-2020 by Dimitri van Heesch + + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: + + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file + */ +function initMenu(relPath,searchEnabled,serverSide,searchPage,search,treeview) { + function makeTree(data,relPath) { + let result=''; + if ('children' in data) { + result+='
    '; + for (let i in data.children) { + let url; + const link = data.children[i].url; + if (link.substring(0,1)=='^') { + url = link.substring(1); + } else { + url = relPath+link; + } + result+='
  • '+ + data.children[i].text+''+ + makeTree(data.children[i],relPath)+'
    • '; + } + result+='
'; + } + return result; + } + let searchBoxHtml; + if (searchEnabled) { + if (serverSide) { + searchBoxHtml='
'+ + '
'+ + '
 '+ + ''+ + '
'+ + '
'+ + '
'+ + '
'; + } else { + searchBoxHtml='
'+ + ''+ + ' '+ + ''+ + ''+ + ''+ + ''+ + ''+ + '
'; + } + } + + $('#main-nav').before('
'+ + ''+ + ''+ + '
'); + $('#main-nav').append(makeTree(menudata,relPath)); + $('#main-nav').children(':first').addClass('sm sm-dox').attr('id','main-menu'); + if (searchBoxHtml) { + $('#main-menu').append('
  • '); + } + const $mainMenuState = $('#main-menu-state'); + let prevWidth = 0; + if ($mainMenuState.length) { + const initResizableIfExists = function() { + if (typeof initResizable==='function') initResizable(treeview); + } + // animate mobile menu + $mainMenuState.change(function() { + const $menu = $('#main-menu'); + let options = { duration: 250, step: initResizableIfExists }; + if (this.checked) { + options['complete'] = () => $menu.css('display', 'block'); + $menu.hide().slideDown(options); + } else { + options['complete'] = () => $menu.css('display', 'none'); + $menu.show().slideUp(options); + } + }); + // set default menu visibility + const resetState = function() { + const $menu = $('#main-menu'); + const newWidth = $(window).outerWidth(); + if (newWidth!=prevWidth) { + if ($(window).outerWidth()<768) { + $mainMenuState.prop('checked',false); $menu.hide(); + $('#searchBoxPos1').html(searchBoxHtml); + $('#searchBoxPos2').hide(); + } else { + $menu.show(); + $('#searchBoxPos1').empty(); + $('#searchBoxPos2').html(searchBoxHtml); + $('#searchBoxPos2').show(); + } + if (typeof searchBox!=='undefined') { + searchBox.CloseResultsWindow(); + } + prevWidth = newWidth; + } + } + $(window).ready(function() { resetState(); initResizableIfExists(); }); + $(window).resize(resetState); + } + $('#main-menu').smartmenus(); +} +/* @license-end */ diff --git a/docs/html/menudata.js b/docs/html/menudata.js new file mode 100644 index 00000000..62bf3c81 --- /dev/null +++ b/docs/html/menudata.js @@ -0,0 +1,190 @@ +/* + @licstart The following is the entire license notice for the JavaScript code in this file. + + The MIT License (MIT) + + Copyright (C) 1997-2020 by Dimitri van Heesch + + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: + + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file +*/ +var menudata={children:[ +{text:"Main Page",url:"index.html"}, +{text:"Related Pages",url:"pages.html"}, +{text:"Classes",url:"annotated.html",children:[ +{text:"Class List",url:"annotated.html"}, +{text:"Class Hierarchy",url:"hierarchy.html"}, +{text:"Class Members",url:"functions.html",children:[ +{text:"All",url:"functions.html",children:[ +{text:"a",url:"functions.html#index_a"}, +{text:"b",url:"functions_b.html#index_b"}, +{text:"c",url:"functions_c.html#index_c"}, +{text:"d",url:"functions_d.html#index_d"}, +{text:"e",url:"functions_e.html#index_e"}, +{text:"f",url:"functions_f.html#index_f"}, +{text:"g",url:"functions_g.html#index_g"}, +{text:"h",url:"functions_h.html#index_h"}, +{text:"i",url:"functions_i.html#index_i"}, +{text:"j",url:"functions_j.html#index_j"}, +{text:"k",url:"functions_k.html#index_k"}, +{text:"l",url:"functions_l.html#index_l"}, +{text:"m",url:"functions_m.html#index_m"}, +{text:"n",url:"functions_n.html#index_n"}, +{text:"o",url:"functions_o.html#index_o"}, +{text:"p",url:"functions_p.html#index_p"}, +{text:"q",url:"functions_q.html#index_q"}, +{text:"r",url:"functions_r.html#index_r"}, +{text:"s",url:"functions_s.html#index_s"}, +{text:"t",url:"functions_t.html#index_t"}, +{text:"u",url:"functions_u.html#index_u"}, +{text:"v",url:"functions_v.html#index_v"}, +{text:"w",url:"functions_w.html#index_w"}, +{text:"x",url:"functions_x.html#index_x"}, +{text:"y",url:"functions_y.html#index_y"}, +{text:"z",url:"functions_z.html#index_z"}, +{text:"~",url:"functions_~.html#index__7E"}]}, +{text:"Functions",url:"functions_func.html",children:[ +{text:"a",url:"functions_func.html#index_a"}, +{text:"b",url:"functions_func_b.html#index_b"}, +{text:"c",url:"functions_func_c.html#index_c"}, +{text:"d",url:"functions_func_d.html#index_d"}, +{text:"e",url:"functions_func_e.html#index_e"}, +{text:"f",url:"functions_func_f.html#index_f"}, +{text:"g",url:"functions_func_g.html#index_g"}, +{text:"h",url:"functions_func_h.html#index_h"}, +{text:"i",url:"functions_func_i.html#index_i"}, +{text:"k",url:"functions_func_k.html#index_k"}, +{text:"l",url:"functions_func_l.html#index_l"}, +{text:"m",url:"functions_func_m.html#index_m"}, +{text:"n",url:"functions_func_n.html#index_n"}, +{text:"o",url:"functions_func_o.html#index_o"}, +{text:"p",url:"functions_func_p.html#index_p"}, +{text:"q",url:"functions_func_q.html#index_q"}, +{text:"r",url:"functions_func_r.html#index_r"}, +{text:"s",url:"functions_func_s.html#index_s"}, +{text:"t",url:"functions_func_t.html#index_t"}, +{text:"u",url:"functions_func_u.html#index_u"}, +{text:"w",url:"functions_func_w.html#index_w"}, +{text:"x",url:"functions_func_x.html#index_x"}, +{text:"y",url:"functions_func_y.html#index_y"}, +{text:"z",url:"functions_func_z.html#index_z"}, +{text:"~",url:"functions_func_~.html#index__7E"}]}, +{text:"Variables",url:"functions_vars.html",children:[ +{text:"a",url:"functions_vars.html#index_a"}, +{text:"b",url:"functions_vars_b.html#index_b"}, +{text:"c",url:"functions_vars_c.html#index_c"}, +{text:"d",url:"functions_vars_d.html#index_d"}, +{text:"e",url:"functions_vars_e.html#index_e"}, +{text:"f",url:"functions_vars_f.html#index_f"}, +{text:"g",url:"functions_vars_g.html#index_g"}, +{text:"h",url:"functions_vars_h.html#index_h"}, +{text:"i",url:"functions_vars_i.html#index_i"}, +{text:"j",url:"functions_vars_j.html#index_j"}, +{text:"k",url:"functions_vars_k.html#index_k"}, +{text:"l",url:"functions_vars_l.html#index_l"}, +{text:"m",url:"functions_vars_m.html#index_m"}, +{text:"n",url:"functions_vars_n.html#index_n"}, +{text:"o",url:"functions_vars_o.html#index_o"}, +{text:"p",url:"functions_vars_p.html#index_p"}, +{text:"q",url:"functions_vars_q.html#index_q"}, +{text:"r",url:"functions_vars_r.html#index_r"}, +{text:"s",url:"functions_vars_s.html#index_s"}, +{text:"t",url:"functions_vars_t.html#index_t"}, +{text:"u",url:"functions_vars_u.html#index_u"}, +{text:"v",url:"functions_vars_v.html#index_v"}, +{text:"w",url:"functions_vars_w.html#index_w"}, +{text:"x",url:"functions_vars_x.html#index_x"}, +{text:"y",url:"functions_vars_y.html#index_y"}, +{text:"z",url:"functions_vars_z.html#index_z"}]}, +{text:"Typedefs",url:"functions_type.html"}, +{text:"Related Symbols",url:"functions_rela.html"}]}]}, +{text:"Files",url:"files.html",children:[ +{text:"File List",url:"files.html"}, +{text:"File Members",url:"globals.html",children:[ +{text:"All",url:"globals.html",children:[ +{text:"_",url:"globals.html#index__5F"}, +{text:"a",url:"globals_a.html#index_a"}, +{text:"b",url:"globals_b.html#index_b"}, +{text:"c",url:"globals_c.html#index_c"}, +{text:"d",url:"globals_d.html#index_d"}, +{text:"e",url:"globals_e.html#index_e"}, +{text:"f",url:"globals_f.html#index_f"}, +{text:"g",url:"globals_g.html#index_g"}, +{text:"h",url:"globals_h.html#index_h"}, +{text:"i",url:"globals_i.html#index_i"}, +{text:"j",url:"globals_j.html#index_j"}, +{text:"l",url:"globals_l.html#index_l"}, +{text:"m",url:"globals_m.html#index_m"}, +{text:"n",url:"globals_n.html#index_n"}, +{text:"o",url:"globals_o.html#index_o"}, +{text:"p",url:"globals_p.html#index_p"}, +{text:"q",url:"globals_q.html#index_q"}, +{text:"r",url:"globals_r.html#index_r"}, +{text:"s",url:"globals_s.html#index_s"}, +{text:"t",url:"globals_t.html#index_t"}, +{text:"u",url:"globals_u.html#index_u"}, +{text:"v",url:"globals_v.html#index_v"}, +{text:"w",url:"globals_w.html#index_w"}, +{text:"x",url:"globals_x.html#index_x"}, +{text:"y",url:"globals_y.html#index_y"}]}, +{text:"Functions",url:"globals_func.html",children:[ +{text:"a",url:"globals_func.html#index_a"}, +{text:"b",url:"globals_func_b.html#index_b"}, +{text:"c",url:"globals_func_c.html#index_c"}, +{text:"d",url:"globals_func_d.html#index_d"}, +{text:"e",url:"globals_func_e.html#index_e"}, +{text:"f",url:"globals_func_f.html#index_f"}, +{text:"g",url:"globals_func_g.html#index_g"}, +{text:"h",url:"globals_func_h.html#index_h"}, +{text:"i",url:"globals_func_i.html#index_i"}, +{text:"j",url:"globals_func_j.html#index_j"}, +{text:"l",url:"globals_func_l.html#index_l"}, +{text:"m",url:"globals_func_m.html#index_m"}, +{text:"n",url:"globals_func_n.html#index_n"}, +{text:"p",url:"globals_func_p.html#index_p"}, +{text:"q",url:"globals_func_q.html#index_q"}, +{text:"r",url:"globals_func_r.html#index_r"}, +{text:"s",url:"globals_func_s.html#index_s"}, +{text:"t",url:"globals_func_t.html#index_t"}, +{text:"u",url:"globals_func_u.html#index_u"}, +{text:"v",url:"globals_func_v.html#index_v"}, +{text:"w",url:"globals_func_w.html#index_w"}]}, +{text:"Variables",url:"globals_vars.html"}, +{text:"Enumerations",url:"globals_enum.html"}, +{text:"Enumerator",url:"globals_eval.html"}, +{text:"Macros",url:"globals_defs.html",children:[ +{text:"_",url:"globals_defs.html#index__5F"}, +{text:"a",url:"globals_defs.html#index_a"}, +{text:"b",url:"globals_defs.html#index_b"}, +{text:"c",url:"globals_defs.html#index_c"}, +{text:"d",url:"globals_defs.html#index_d"}, +{text:"e",url:"globals_defs.html#index_e"}, +{text:"f",url:"globals_defs.html#index_f"}, +{text:"g",url:"globals_defs.html#index_g"}, +{text:"i",url:"globals_defs.html#index_i"}, +{text:"l",url:"globals_defs.html#index_l"}, +{text:"m",url:"globals_defs.html#index_m"}, +{text:"n",url:"globals_defs.html#index_n"}, +{text:"o",url:"globals_defs.html#index_o"}, +{text:"p",url:"globals_defs.html#index_p"}, +{text:"q",url:"globals_defs.html#index_q"}, +{text:"r",url:"globals_defs.html#index_r"}, +{text:"s",url:"globals_defs.html#index_s"}, +{text:"t",url:"globals_defs.html#index_t"}, +{text:"v",url:"globals_defs.html#index_v"}, +{text:"x",url:"globals_defs.html#index_x"}, +{text:"y",url:"globals_defs.html#index_y"}]}]}]}]} diff --git a/docs/html/minmax_8cpp.html b/docs/html/minmax_8cpp.html new file mode 100644 index 00000000..423999cd --- /dev/null +++ b/docs/html/minmax_8cpp.html @@ -0,0 +1,435 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: minmax.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Functions
    +
    minmax.cpp File Reference
    +
    +
    + +

    Tools to find min/max values of arrays. +More...

    +
    #include "Array1D.h"
    +#include "Array2D.h"
    +#include <math.h>
    +#include "minmax.h"
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Functions

    void getDomain (Array2D< double > &data_in, Array1D< double > &a, Array1D< double > &b)
     Get domain of the data.
     
    double maxVal (Array1D< double > &vector)
     Returns the maximum value of a 1d double array.
     
    int maxVal (const Array1D< int > &vector)
     Returns the maximum value of a 1d int array.
     
    double maxVal (const Array2D< double > &vector)
     Returns the maximum value of a 2d double array.
     
    int maxVal (const Array2D< int > &vector)
     Returns the maximum value of a 2d int array.
     
    double minVal (const Array1D< double > &vector)
     Returns the minimum value of a 1d double array.
     
    int minVal (const Array1D< int > &vector)
     Returns the minimum value of a 1d int array.
     
    double minVal (const Array2D< double > &vector)
     Returns the minimum value of a 2d double array.
     
    int minVal (const Array2D< int > &vector)
     Returns the minimum value of a 2d int array.
     
    int maxIndex (Array1D< double > &vector)
     Returns the index of the maximal value of a 1d double array.
     
    int minIndex (Array1D< double > &vector)
     Returns the index of the minimal value of a 1d double array.
     
    int maxIndex (Array1D< int > &vector)
     Returns the index of the maximal value of a 1d int array.
     
    int minIndex (Array1D< int > &vector)
     Returns the index of the minimal value of a 1d int array.
     
    int maxIndexC_2D (const Array2D< double > &a2d, const int icol)
     Returns the column number of the maximal element in the irow-th row of a 2d double array.
     
    int minIndexC_2D (const Array2D< double > &a2d, const int icol)
     Returns the row number of the minimal element in the icol-th column of a 2d double array.
     
    +

    Detailed Description

    +

    Tools to find min/max values of arrays.

    +

    Function Documentation

    + +

    ◆ getDomain()

    + +
    +
    + + + + + + + + + + + + + + + + +
    void getDomain (Array2D< double > & data_in,
    Array1D< double > & a,
    Array1D< double > & b )
    +
    + +

    Get domain of the data.

    + +
    +
    + +

    ◆ maxIndex() [1/2]

    + +
    +
    + + + + + + + +
    int maxIndex (Array1D< double > & vector)
    +
    + +

    Returns the index of the maximal value of a 1d double array.

    + +
    +
    + +

    ◆ maxIndex() [2/2]

    + +
    +
    + + + + + + + +
    int maxIndex (Array1D< int > & vector)
    +
    + +

    Returns the index of the maximal value of a 1d int array.

    + +
    +
    + +

    ◆ maxIndexC_2D()

    + +
    +
    + + + + + + + + + + + +
    int maxIndexC_2D (const Array2D< double > & vector,
    const int icol )
    +
    + +

    Returns the column number of the maximal element in the irow-th row of a 2d double array.

    +

    Returns the column number of the minimal element in the irow-th row of a 2d double array

    +

    Returns the row number of the maximal element in the icol-th column of a 2d double array

    + +
    +
    + +

    ◆ maxVal() [1/4]

    + +
    +
    + + + + + + + +
    double maxVal (Array1D< double > & vector)
    +
    + +

    Returns the maximum value of a 1d double array.

    + +
    +
    + +

    ◆ maxVal() [2/4]

    + +
    +
    + + + + + + + +
    int maxVal (const Array1D< int > & vector)
    +
    + +

    Returns the maximum value of a 1d int array.

    + +
    +
    + +

    ◆ maxVal() [3/4]

    + +
    +
    + + + + + + + +
    double maxVal (const Array2D< double > & vector)
    +
    + +

    Returns the maximum value of a 2d double array.

    + +
    +
    + +

    ◆ maxVal() [4/4]

    + +
    +
    + + + + + + + +
    int maxVal (const Array2D< int > & vector)
    +
    + +

    Returns the maximum value of a 2d int array.

    + +
    +
    + +

    ◆ minIndex() [1/2]

    + +
    +
    + + + + + + + +
    int minIndex (Array1D< double > & vector)
    +
    + +

    Returns the index of the minimal value of a 1d double array.

    + +
    +
    + +

    ◆ minIndex() [2/2]

    + +
    +
    + + + + + + + +
    int minIndex (Array1D< int > & vector)
    +
    + +

    Returns the index of the minimal value of a 1d int array.

    + +
    +
    + +

    ◆ minIndexC_2D()

    + +
    +
    + + + + + + + + + + + +
    int minIndexC_2D (const Array2D< double > & a2d,
    const int icol )
    +
    + +

    Returns the row number of the minimal element in the icol-th column of a 2d double array.

    + +
    +
    + +

    ◆ minVal() [1/4]

    + +
    +
    + + + + + + + +
    double minVal (const Array1D< double > & vector)
    +
    + +

    Returns the minimum value of a 1d double array.

    + +
    +
    + +

    ◆ minVal() [2/4]

    + +
    +
    + + + + + + + +
    int minVal (const Array1D< int > & vector)
    +
    + +

    Returns the minimum value of a 1d int array.

    + +
    +
    + +

    ◆ minVal() [3/4]

    + +
    +
    + + + + + + + +
    double minVal (const Array2D< double > & vector)
    +
    + +

    Returns the minimum value of a 2d double array.

    + +
    +
    + +

    ◆ minVal() [4/4]

    + +
    +
    + + + + + + + +
    int minVal (const Array2D< int > & vector)
    +
    + +

    Returns the minimum value of a 2d int array.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/minmax_8h.html b/docs/html/minmax_8h.html new file mode 100644 index 00000000..8adbf767 --- /dev/null +++ b/docs/html/minmax_8h.html @@ -0,0 +1,458 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: minmax.h File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros | +Functions
    +
    minmax.h File Reference
    +
    +
    + +

    Header for min/max tools. +More...

    + +

    Go to the source code of this file.

    + + + + + +

    +Macros

    #define M_PI   atan(1.0) * 4.0
     Define M_PI for compatibility with cygwin on Windows.
     
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Functions

    void getDomain (Array2D< double > &data_in, Array1D< double > &a, Array1D< double > &b)
     Get domain of the data.
     
    double maxVal (Array1D< double > &vector)
     Returns the maximum value of a 1d double array.
     
    int maxVal (const Array1D< int > &vector)
     Returns the maximum value of a 1d int array.
     
    double maxVal (const Array2D< double > &vector)
     Returns the maximum value of a 2d double array.
     
    int maxVal (const Array2D< int > &vector)
     Returns the maximum value of a 2d int array.
     
    double minVal (const Array1D< double > &vector)
     Returns the minimum value of a 1d double array.
     
    int minVal (const Array1D< int > &vector)
     Returns the minimum value of a 1d int array.
     
    double minVal (const Array2D< double > &vector)
     Returns the minimum value of a 2d double array.
     
    int minVal (const Array2D< int > &vector)
     Returns the minimum value of a 2d int array.
     
    int maxIndex (Array1D< double > &vector)
     Returns the index of the maximal value of a 1d double array.
     
    int maxIndex (Array1D< int > &vector)
     Returns the index of the maximal value of a 1d int array.
     
    int minIndex (Array1D< double > &vector)
     Returns the index of the minimal value of a 1d double array.
     
    int minIndex (Array1D< int > &vector)
     Returns the index of the minimal value of a 1d int array.
     
    int maxIndexC_2D (const Array2D< double > &vector, const int icol)
     Returns the column number of the maximal element in the irow-th row of a 2d double array.
     
    int minIndexC_2D (const Array2D< double > &vector, const int icol)
     Returns the row number of the minimal element in the icol-th column of a 2d double array.
     
    +

    Detailed Description

    +

    Header for min/max tools.

    +

    Macro Definition Documentation

    + +

    ◆ M_PI

    + +
    +
    + + + + +
    #define M_PI   atan(1.0) * 4.0
    +
    + +

    Define M_PI for compatibility with cygwin on Windows.

    +
    Todo
    See if we could move this to the CMake installation scripts instead
    + +
    +
    +

    Function Documentation

    + +

    ◆ getDomain()

    + +
    +
    + + + + + + + + + + + + + + + + +
    void getDomain (Array2D< double > & data_in,
    Array1D< double > & a,
    Array1D< double > & b )
    +
    + +

    Get domain of the data.

    + +
    +
    + +

    ◆ maxIndex() [1/2]

    + +
    +
    + + + + + + + +
    int maxIndex (Array1D< double > & vector)
    +
    + +

    Returns the index of the maximal value of a 1d double array.

    + +
    +
    + +

    ◆ maxIndex() [2/2]

    + +
    +
    + + + + + + + +
    int maxIndex (Array1D< int > & vector)
    +
    + +

    Returns the index of the maximal value of a 1d int array.

    + +
    +
    + +

    ◆ maxIndexC_2D()

    + +
    +
    + + + + + + + + + + + +
    int maxIndexC_2D (const Array2D< double > & vector,
    const int icol )
    +
    + +

    Returns the column number of the maximal element in the irow-th row of a 2d double array.

    +

    Returns the column number of the minimal element in the irow-th row of a 2d double array

    +

    Returns the row number of the maximal element in the icol-th column of a 2d double array

    + +
    +
    + +

    ◆ maxVal() [1/4]

    + +
    +
    + + + + + + + +
    double maxVal (Array1D< double > & vector)
    +
    + +

    Returns the maximum value of a 1d double array.

    + +
    +
    + +

    ◆ maxVal() [2/4]

    + +
    +
    + + + + + + + +
    int maxVal (const Array1D< int > & vector)
    +
    + +

    Returns the maximum value of a 1d int array.

    + +
    +
    + +

    ◆ maxVal() [3/4]

    + +
    +
    + + + + + + + +
    double maxVal (const Array2D< double > & vector)
    +
    + +

    Returns the maximum value of a 2d double array.

    + +
    +
    + +

    ◆ maxVal() [4/4]

    + +
    +
    + + + + + + + +
    int maxVal (const Array2D< int > & vector)
    +
    + +

    Returns the maximum value of a 2d int array.

    + +
    +
    + +

    ◆ minIndex() [1/2]

    + +
    +
    + + + + + + + +
    int minIndex (Array1D< double > & vector)
    +
    + +

    Returns the index of the minimal value of a 1d double array.

    + +
    +
    + +

    ◆ minIndex() [2/2]

    + +
    +
    + + + + + + + +
    int minIndex (Array1D< int > & vector)
    +
    + +

    Returns the index of the minimal value of a 1d int array.

    + +
    +
    + +

    ◆ minIndexC_2D()

    + +
    +
    + + + + + + + + + + + +
    int minIndexC_2D (const Array2D< double > & vector,
    const int icol )
    +
    + +

    Returns the row number of the minimal element in the icol-th column of a 2d double array.

    + +
    +
    + +

    ◆ minVal() [1/4]

    + +
    +
    + + + + + + + +
    double minVal (const Array1D< double > & vector)
    +
    + +

    Returns the minimum value of a 1d double array.

    + +
    +
    + +

    ◆ minVal() [2/4]

    + +
    +
    + + + + + + + +
    int minVal (const Array1D< int > & vector)
    +
    + +

    Returns the minimum value of a 1d int array.

    + +
    +
    + +

    ◆ minVal() [3/4]

    + +
    +
    + + + + + + + +
    double minVal (const Array2D< double > & vector)
    +
    + +

    Returns the minimum value of a 2d double array.

    + +
    +
    + +

    ◆ minVal() [4/4]

    + +
    +
    + + + + + + + +
    int minVal (const Array2D< int > & vector)
    +
    + +

    Returns the minimum value of a 2d int array.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/minmax_8h_source.html b/docs/html/minmax_8h_source.html new file mode 100644 index 00000000..267fd7b0 --- /dev/null +++ b/docs/html/minmax_8h_source.html @@ -0,0 +1,138 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: minmax.h Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    minmax.h
    +
    +
    +Go to the documentation of this file.
    1/* =====================================================================================
    +
    2
    +
    3 The UQ Toolkit (UQTk) version 3.1.5
    +
    4 Copyright (2024) NTESS
    +
    5 https://www.sandia.gov/UQToolkit/
    +
    6 https://github.com/sandialabs/UQTk
    +
    7
    +
    8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
    +
    9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
    +
    10 retains certain rights in this software.
    +
    11
    +
    12 This file is part of The UQ Toolkit (UQTk)
    +
    13
    +
    14 UQTk is open source software: you can redistribute it and/or modify
    +
    15 it under the terms of BSD 3-Clause License
    +
    16
    +
    17 UQTk is distributed in the hope that it will be useful,
    +
    18 but WITHOUT ANY WARRANTY; without even the implied warranty of
    +
    19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    +
    20 BSD 3 Clause License for more details.
    +
    21
    +
    22 You should have received a copy of the BSD 3 Clause License
    +
    23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
    +
    24
    +
    25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
    +
    26 Sandia National Laboratories, Livermore, CA, USA
    +
    27===================================================================================== */
    +
    28#ifndef MINMAX_H
    +
    29#define MINMAX_H
    +
    30
    +
    37#ifndef M_PI
    +
    38#define M_PI atan(1.0) * 4.0
    +
    39#endif
    +
    40
    +
    41
    +
    43void getDomain(Array2D<double>& data_in,Array1D<double>& a, Array1D<double>& b);
    +
    44
    +
    46double maxVal(Array1D<double>& vector) ;
    +
    48int maxVal(const Array1D<int> &vector) ;
    +
    50double maxVal(const Array2D<double> &vector) ;
    +
    52int maxVal(const Array2D<int> &vector) ;
    +
    53
    +
    55double minVal(const Array1D<double> &vector) ;
    +
    57int minVal(const Array1D<int> &vector) ;
    +
    59double minVal(const Array2D<double> &vector) ;
    +
    61int minVal(const Array2D<int> &vector) ;
    +
    62
    +
    64int maxIndex(Array1D<double>& vector);
    +
    66int maxIndex(Array1D<int>& vector);
    +
    68int minIndex(Array1D<double>& vector);
    +
    70int minIndex(Array1D<int>& vector);
    +
    71
    +
    72
    +
    74//int maxIndexR_2D(const Array2D<double>& vector, const int irow);
    +
    76//int minIndexR_2D(const Array2D<double>& vector, const int irow);
    +
    78int maxIndexC_2D(const Array2D<double>& vector, const int icol);
    +
    80int minIndexC_2D(const Array2D<double>& vector, const int icol);
    +
    81
    +
    82#endif // MINMAX_H
    +
    Array1D
    Stores data of any type T in a 1D array.
    Definition Array1D.h:61
    +
    Array2D
    Stores data of any type T in a 2D array.
    Definition Array2D.h:60
    +
    maxIndex
    int maxIndex(Array1D< double > &vector)
    Returns the index of the maximal value of a 1d double array.
    Definition minmax.cpp:158
    +
    maxIndexC_2D
    int maxIndexC_2D(const Array2D< double > &vector, const int icol)
    Returns the column number of the maximal element in the irow-th row of a 2d double array.
    Definition minmax.cpp:240
    +
    minVal
    double minVal(const Array1D< double > &vector)
    Returns the minimum value of a 1d double array.
    Definition minmax.cpp:112
    +
    minIndexC_2D
    int minIndexC_2D(const Array2D< double > &vector, const int icol)
    Returns the row number of the minimal element in the icol-th column of a 2d double array.
    Definition minmax.cpp:259
    +
    getDomain
    void getDomain(Array2D< double > &data_in, Array1D< double > &a, Array1D< double > &b)
    Get domain of the data.
    Definition minmax.cpp:38
    +
    maxVal
    double maxVal(Array1D< double > &vector)
    Returns the maximum value of a 1d double array.
    Definition minmax.cpp:65
    +
    minIndex
    int minIndex(Array1D< double > &vector)
    Returns the index of the minimal value of a 1d double array.
    Definition minmax.cpp:169
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/minus.svg b/docs/html/minus.svg new file mode 100644 index 00000000..f70d0c1a --- /dev/null +++ b/docs/html/minus.svg @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/docs/html/minusd.svg b/docs/html/minusd.svg new file mode 100644 index 00000000..5f8e8796 --- /dev/null +++ b/docs/html/minusd.svg @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/docs/html/model__inf_8cpp.html b/docs/html/model__inf_8cpp.html new file mode 100644 index 00000000..e7adb838 --- /dev/null +++ b/docs/html/model__inf_8cpp.html @@ -0,0 +1,501 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: model_inf.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros | +Functions
    +
    model_inf.cpp File Reference
    +
    +
    + +

    Command-line utility for model parameter inference. +More...

    +
    #include <unistd.h>
    +#include <stdlib.h>
    +#include <time.h>
    +#include <sstream>
    +#include <map>
    +#include <iostream>
    +#include <string>
    +#include <math.h>
    +#include <getopt.h>
    +#include "func.h"
    +#include "post.h"
    +#include "mrv.h"
    +#include "inference.h"
    +#include "mcmc.h"
    +#include "tools.h"
    +#include "arrayio.h"
    +#include "arraytools.h"
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Macros

    #define MODELTYPE   "linear"
     default model type
     
    #define LIKTYPE   "classical"
     default likelihood type
     
    #define LIKPARAM_DBL   0.01
     default likelihood parameter of type double
     
    #define LIKPARAM_INT   1000
     default likelihood parameter of type int
     
    #define PRIORTYPE   "uniform"
     default prior type
     
    #define PRIORA   -DBL_MAX
     default prior parameter #1
     
    #define PRIORB   DBL_MAX
     default prior parameter #2
     
    #define XFILE   "xdata.dat"
     default xfile
     
    #define YFILE   "ydata.dat"
     default yfile
     
    #define PDIM   2
     default model parameter dimensionailty
     
    #define ORDER   1
     default parameter pdf order
     
    #define PDFTYPE   "pct"
     default parameter pdf type
     
    #define PCTYPE   "HG"
     default parameter pc for parameter pdf
     
    #define DATANOISE   0.1
     default datanoise
     
    #define NMCMC   10000
     default number of MCMC steps
     
    #define MCMCGAMMA   0.1
     default MCMC gamma (i.e. proposal size factor) for adaptive MCMC
     
    #define FBURN   10
     default burn-in ratio
     
    #define NSTEP   5
     default chain thinning
     
    + + + + + + + +

    +Functions

    int usage ()
     Displays information about this program.
     
    int main (int argc, char *argv[])
     Main program: Bayesian inference of a few standard function types.
     
    +

    Detailed Description

    +

    Command-line utility for model parameter inference.

    +
    Author
    K. Sargsyan 2015 -
    +

    Macro Definition Documentation

    + +

    ◆ DATANOISE

    + +
    +
    + + + + +
    #define DATANOISE   0.1
    +
    + +

    default datanoise

    + +
    +
    + +

    ◆ FBURN

    + +
    +
    + + + + +
    #define FBURN   10
    +
    + +

    default burn-in ratio

    + +
    +
    + +

    ◆ LIKPARAM_DBL

    + +
    +
    + + + + +
    #define LIKPARAM_DBL   0.01
    +
    + +

    default likelihood parameter of type double

    + +
    +
    + +

    ◆ LIKPARAM_INT

    + +
    +
    + + + + +
    #define LIKPARAM_INT   1000
    +
    + +

    default likelihood parameter of type int

    + +
    +
    + +

    ◆ LIKTYPE

    + +
    +
    + + + + +
    #define LIKTYPE   "classical"
    +
    + +

    default likelihood type

    + +
    +
    + +

    ◆ MCMCGAMMA

    + +
    +
    + + + + +
    #define MCMCGAMMA   0.1
    +
    + +

    default MCMC gamma (i.e. proposal size factor) for adaptive MCMC

    + +
    +
    + +

    ◆ MODELTYPE

    + +
    +
    + + + + +
    #define MODELTYPE   "linear"
    +
    + +

    default model type

    + +
    +
    + +

    ◆ NMCMC

    + +
    +
    + + + + +
    #define NMCMC   10000
    +
    + +

    default number of MCMC steps

    + +
    +
    + +

    ◆ NSTEP

    + +
    +
    + + + + +
    #define NSTEP   5
    +
    + +

    default chain thinning

    + +
    +
    + +

    ◆ ORDER

    + +
    +
    + + + + +
    #define ORDER   1
    +
    + +

    default parameter pdf order

    + +
    +
    + +

    ◆ PCTYPE

    + +
    +
    + + + + +
    #define PCTYPE   "HG"
    +
    + +

    default parameter pc for parameter pdf

    + +
    +
    + +

    ◆ PDFTYPE

    + +
    +
    + + + + +
    #define PDFTYPE   "pct"
    +
    + +

    default parameter pdf type

    + +
    +
    + +

    ◆ PDIM

    + +
    +
    + + + + +
    #define PDIM   2
    +
    + +

    default model parameter dimensionailty

    + +
    +
    + +

    ◆ PRIORA

    + +
    +
    + + + + +
    #define PRIORA   -DBL_MAX
    +
    + +

    default prior parameter #1

    + +
    +
    + +

    ◆ PRIORB

    + +
    +
    + + + + +
    #define PRIORB   DBL_MAX
    +
    + +

    default prior parameter #2

    + +
    +
    + +

    ◆ PRIORTYPE

    + +
    +
    + + + + +
    #define PRIORTYPE   "uniform"
    +
    + +

    default prior type

    + +
    +
    + +

    ◆ XFILE

    + +
    +
    + + + + +
    #define XFILE   "xdata.dat"
    +
    + +

    default xfile

    + +
    +
    + +

    ◆ YFILE

    + +
    +
    + + + + +
    #define YFILE   "ydata.dat"
    +
    + +

    default yfile

    + +
    +
    +

    Function Documentation

    + +

    ◆ main()

    + +
    +
    + + + + + + + + + + + +
    int main (int argc,
    char * argv[] )
    +
    + +

    Main program: Bayesian inference of a few standard function types.

    +

    Set the defaults, where necessary

    +

    Parse input arguments

    +

    Read datafiles

    +

    Read the indices of randomized parameters

    +

    Run the inference

    +

    Write the outputs

    + +
    +
    + +

    ◆ usage()

    + +
    +
    + + + + + + + +
    int usage ()
    +
    + +

    Displays information about this program.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/mrv_8cpp.html b/docs/html/mrv_8cpp.html new file mode 100644 index 00000000..6f914a32 --- /dev/null +++ b/docs/html/mrv_8cpp.html @@ -0,0 +1,107 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: mrv.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros
    +
    mrv.cpp File Reference
    +
    +
    + +

    Multivariate random variable class. +More...

    +
    #include <math.h>
    +#include <cfloat>
    +#include <assert.h>
    +#include "mrv.h"
    +#include "PCSet.h"
    +#include "error_handlers.h"
    +#include "arrayio.h"
    +#include "arraytools.h"
    +
    + + + +

    +Macros

    #define SIG_MAX   10
     
    +

    Detailed Description

    +

    Multivariate random variable class.

    +
    Author
    K. Sargsyan 2016 -
    +

    Macro Definition Documentation

    + +

    ◆ SIG_MAX

    + +
    +
    + + + + +
    #define SIG_MAX   10
    +
    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/mrv_8h.html b/docs/html/mrv_8h.html new file mode 100644 index 00000000..e65cc7c5 --- /dev/null +++ b/docs/html/mrv_8h.html @@ -0,0 +1,94 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: mrv.h File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Classes
    +
    mrv.h File Reference
    +
    +
    + +

    Header for multivariate random variable class. +More...

    +
    #include "Array1D.h"
    +#include "Array2D.h"
    +#include "PCSet.h"
    +#include <iostream>
    +#include <string.h>
    +#include <stdio.h>
    +#include <sstream>
    +
    +

    Go to the source code of this file.

    + + + + + +

    +Classes

    class  Mrv
     multivariate RV parameterized by PC expansions More...
     
    +

    Detailed Description

    +

    Header for multivariate random variable class.

    +
    Author
    K. Sargsyan 2016 -
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/mrv_8h_source.html b/docs/html/mrv_8h_source.html new file mode 100644 index 00000000..0e8ad891 --- /dev/null +++ b/docs/html/mrv_8h_source.html @@ -0,0 +1,193 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: mrv.h Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    mrv.h
    +
    +
    +Go to the documentation of this file.
    1/* =====================================================================================
    +
    2
    +
    3 The UQ Toolkit (UQTk) version 3.1.5
    +
    4 Copyright (2024) NTESS
    +
    5 https://www.sandia.gov/UQToolkit/
    +
    6 https://github.com/sandialabs/UQTk
    +
    7
    +
    8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
    +
    9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
    +
    10 retains certain rights in this software.
    +
    11
    +
    12 This file is part of The UQ Toolkit (UQTk)
    +
    13
    +
    14 UQTk is open source software: you can redistribute it and/or modify
    +
    15 it under the terms of BSD 3-Clause License
    +
    16
    +
    17 UQTk is distributed in the hope that it will be useful,
    +
    18 but WITHOUT ANY WARRANTY; without even the implied warranty of
    +
    19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    +
    20 BSD 3 Clause License for more details.
    +
    21
    +
    22 You should have received a copy of the BSD 3 Clause License
    +
    23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
    +
    24
    +
    25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
    +
    26 Sandia National Laboratories, Livermore, CA, USA
    +
    27===================================================================================== */
    +
    31
    +
    32#ifndef MRV_H_SEEN
    +
    33#define MRV_H_SEEN
    +
    34
    +
    35#include "Array1D.h"
    +
    36#include "Array2D.h"
    +
    37#include "PCSet.h"
    +
    38
    +
    39#include <iostream>
    +
    40#include <string.h>
    +
    41#include <stdio.h>
    +
    42#include <sstream>
    +
    43
    +
    44using namespace std; // needed for python string conversion
    +
    45
    +
    47
    +
    +
    48class Mrv {
    +
    49public:
    +
    50
    +
    52 Mrv(int ndim,string pdfType, Array1D<int> rndInd, int order,string pctype);
    +
    54 ~Mrv() {}
    +
    55
    +
    56
    +
    58 int Parametrize();
    +
    59
    +
    62 void getBounds(Array1D<double>& lower, Array1D<double>& upper);
    +
    63
    +
    65 int getPDim(){ return this->pDim_;}
    +
    66
    +
    68 Array2D<double> getMultiPCcf(Array1D<double>& rvParams);
    +
    70 Array2D<double> evalMultiPC(Array2D<double>& xiSam, Array2D<double>& multiPCcf);
    +
    72 Array2D<double> mcParam(Array2D<double>& multiPCcf, int nsam);
    +
    74 Array2D<double> quadParam(Array2D<double>& multiPCcf);
    +
    76 Array2D<double> propNISP(Array2D<double> (*forwardFcn)(Array2D<double>&, Array2D<double>&, Array2D<double>&, void*), Array2D<double>& fixindnom,void* funcinfo, Array2D<double>& multiPCcf, Array2D<double>& x);
    +
    78 Array2D<double> propMC(Array2D<double> (*forwardFcn)(Array2D<double>&, Array2D<double>&, Array2D<double>&, void*), Array2D<double>& fixindnom,void* funcinfo,Array2D<double>& multiPCcf, Array2D<double>& x,int nsam);
    +
    80 void computeMoments(Array2D<double>& funcCf, Array1D<double>& fcnMean,Array1D<double>& fcnStd,bool covFlag, Array2D<double>& fcnCov);
    +
    81
    +
    83 void getPCTermId(Array1D<int>& pctermid){pctermid=pctermId_; return;}
    +
    84
    +
    85private:
    +
    87 Array1D<int> rndInd_;
    +
    89 Array1D<int> paramId_;
    +
    91 Array1D<int> pctermId_;
    +
    92
    +
    94 string pdfType_;
    +
    96 string pcType_;
    +
    98 int pDim_;
    +
    100 int rDim_;
    +
    102 int nDim_;
    +
    104 int order_;
    +
    106 int nPC_;
    +
    108 PCSet* pcModel_;
    +
    109
    +
    110
    +
    111
    +
    112};
    +
    +
    113
    +
    114/*******************************************************************/
    +
    115/*******************************************************************/
    +
    116/*******************************************************************/
    +
    117
    +
    118
    +
    119#endif /* MRV_H_SEEN */
    +
    Array1D.h
    1D Array class for any type T
    +
    Array2D.h
    2D Array class for any type T
    +
    PCSet.h
    Header file for the Multivariate PC class.
    +
    Array1D
    Stores data of any type T in a 1D array.
    Definition Array1D.h:61
    +
    Array2D
    Stores data of any type T in a 2D array.
    Definition Array2D.h:60
    +
    Mrv
    multivariate RV parameterized by PC expansions
    Definition mrv.h:48
    +
    Mrv::getPDim
    int getPDim()
    Get dimensionailty of parameterization.
    Definition mrv.h:65
    +
    Mrv::getBounds
    void getBounds(Array1D< double > &lower, Array1D< double > &upper)
    Get bounds on parameters.
    Definition mrv.cpp:130
    +
    Mrv::~Mrv
    ~Mrv()
    Destructor.
    Definition mrv.h:54
    +
    Mrv::getMultiPCcf
    Array2D< double > getMultiPCcf(Array1D< double > &rvParams)
    Given parameters of representation, fold them in a 2d-array of PC coefficients for convenience.
    Definition mrv.cpp:164
    +
    Mrv::evalMultiPC
    Array2D< double > evalMultiPC(Array2D< double > &xiSam, Array2D< double > &multiPCcf)
    Evaluate at multivariate PC at given germ samples for given coefficient matrix.
    Definition mrv.cpp:176
    +
    Mrv::pcModel_
    PCSet * pcModel_
    Pointer to the corresponding PC object.
    Definition mrv.h:108
    +
    Mrv::Mrv
    Mrv(int ndim, string pdfType, Array1D< int > rndInd, int order, string pctype)
    Constructor with dimensionality, pdftype, randomized parameter indices, order, and pctype.
    Definition mrv.cpp:45
    +
    Mrv::order_
    int order_
    Order of function PC representation.
    Definition mrv.h:104
    +
    Mrv::nDim_
    int nDim_
    Number of physical parameters lambda.
    Definition mrv.h:102
    +
    Mrv::rndInd_
    Array1D< int > rndInd_
    Randomized parameters indices.
    Definition mrv.h:87
    +
    Mrv::getPCTermId
    void getPCTermId(Array1D< int > &pctermid)
    Get PC term ID.
    Definition mrv.h:83
    +
    Mrv::propNISP
    Array2D< double > propNISP(Array2D< double >(*forwardFcn)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array2D< double > &fixindnom, void *funcinfo, Array2D< double > &multiPCcf, Array2D< double > &x)
    Propagate the multivariate RV with given coefficeints through a given function at given values x.
    Definition mrv.cpp:217
    +
    Mrv::paramId_
    Array1D< int > paramId_
    For a given parameterization, id the corresponding physical parameter lambda.
    Definition mrv.h:89
    +
    Mrv::pctermId_
    Array1D< int > pctermId_
    For a given parameterization, id the PC term/order for the corresponding parameter representation.
    Definition mrv.h:91
    +
    Mrv::nPC_
    int nPC_
    Number of PC parameters for each independent component.
    Definition mrv.h:106
    +
    Mrv::quadParam
    Array2D< double > quadParam(Array2D< double > &multiPCcf)
    Quadrature-sample all parameters given coefficient matrix.
    Definition mrv.cpp:205
    +
    Mrv::mcParam
    Array2D< double > mcParam(Array2D< double > &multiPCcf, int nsam)
    Random-sample all parameters given coefficient matrix.
    Definition mrv.cpp:195
    +
    Mrv::computeMoments
    void computeMoments(Array2D< double > &funcCf, Array1D< double > &fcnMean, Array1D< double > &fcnStd, bool covFlag, Array2D< double > &fcnCov)
    Compute moments given coefficent matrix.
    Definition mrv.cpp:251
    +
    Mrv::rDim_
    int rDim_
    Number of randomized parameters.
    Definition mrv.h:100
    +
    Mrv::Parametrize
    int Parametrize()
    Parameterization bookkeeping (i.e. alpha corresponds to certain parameter lambda and certain PC term)
    Definition mrv.cpp:69
    +
    Mrv::propMC
    Array2D< double > propMC(Array2D< double >(*forwardFcn)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array2D< double > &fixindnom, void *funcinfo, Array2D< double > &multiPCcf, Array2D< double > &x, int nsam)
    Sample values of a given function given input coefficeint matrix.
    Definition mrv.cpp:239
    +
    Mrv::pcType_
    string pcType_
    PC type (see pce library for options)
    Definition mrv.h:96
    +
    Mrv::pDim_
    int pDim_
    Number of parameters in alpha parameterization.
    Definition mrv.h:98
    +
    Mrv::pdfType_
    string pdfType_
    PDF type ('pct', 'pci' or 'full')
    Definition mrv.h:94
    +
    PCSet
    Defines and initializes PC basis function set and provides functions to manipulate PC expansions defi...
    Definition PCSet.h:73
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/multiindex_8cpp.html b/docs/html/multiindex_8cpp.html new file mode 100644 index 00000000..7dbf5049 --- /dev/null +++ b/docs/html/multiindex_8cpp.html @@ -0,0 +1,453 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: multiindex.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Functions
    +
    multiindex.cpp File Reference
    +
    +
    + +

    Tools that deal with integer multiindices. +More...

    +
    #include <math.h>
    +#include <assert.h>
    +#include "gen_defs.h"
    +#include "tools.h"
    +#include "arraytools.h"
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Functions

    int computeNPCTerms (int ndim, int norder)
     Computes the number of PC basis terms for Total-Order truncation with a given dimensionality and order.
     
    int computeMultiIndex (int ndim, int norder, Array2D< int > &mi)
     Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and order Also, returns the number of terms.
     
    int computeMultiIndexT (int ndim, int norder, int *mi)
     Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and order Also, returns the number of terms. Note that here, the multiindex array pointer stores indices in column-major format, i.e. mi[j*ndim+i] holds the j-th index for dimension i.
     
    int computeMultiIndex (int ndim, int norder, Array2D< int > &mi, string ordtype)
     Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and order Also, returns the number of terms.
     
    int computeMultiIndexTP (Array1D< int > &maxorders, Array2D< int > &mindex)
     Computes the multiindex set of a PC basis for Tensor-Product truncation with a given maximum order per dimensionality Also, returns the number of terms.
     
    int computeNPCTermsHDMR (int ndim, Array1D< int > &maxorders)
     Computes the number of PC basis terms for HDMR truncation with a given dimensionality and maxorders array that contains maximal orders per interaction dimensionalities.
     
    int computeMultiIndexHDMR (int ndim, Array1D< int > &maxorders, Array2D< int > &mindex)
     Computes the multiindex set of a PC basis for HDMR truncation with a given dimensionality and maxorders array that contains maximal orders per interaction dimensionalities.
     
    void decodeMindex (Array1D< Array2D< int > > &sp_mindex, int ndim, Array2D< int > &mindex)
     Decode a multiindex set from a sparse format to a regular format.
     
    bool is_admis (Array1D< int > &mindex_try, Array2D< int > &mindex)
     A boolean check to see if a new basis term is admissible or not.
     
    void upOrder (Array2D< int > &mindex, Array2D< int > &new_mindex)
     Given a multiindex set it computes a new multiindex set where only 'admissible' bases are added.
     
    void getOrders (Array2D< int > &mindex, Array1D< int > &orders)
     Given a multiindex set, it returns the orders of each basis term.
     
    int get_invmindex (Array1D< int > mi)
     Given a single multiindex, this returns its relative position in the total-order multiindex set.
     
    int get_invmindex_ord (Array1D< int > mi)
     Given a single multiindex, this returns its relative position in the total-order multiindex set among the bases of the same order.
     
    +

    Detailed Description

    +

    Tools that deal with integer multiindices.

    +

    Function Documentation

    + +

    ◆ computeMultiIndex() [1/2]

    + +
    +
    + + + + + + + + + + + + + + + + +
    int computeMultiIndex (int ndim,
    int norder,
    Array2D< int > & mi )
    +
    + +

    Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and order Also, returns the number of terms.

    + +
    +
    + +

    ◆ computeMultiIndex() [2/2]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    int computeMultiIndex (int ndim,
    int norder,
    Array2D< int > & mi,
    string ordtype )
    +
    + +

    Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and order Also, returns the number of terms.

    + +
    +
    + +

    ◆ computeMultiIndexHDMR()

    + +
    +
    + + + + + + + + + + + + + + + + +
    int computeMultiIndexHDMR (int ndim,
    Array1D< int > & maxorders,
    Array2D< int > & mindex )
    +
    + +

    Computes the multiindex set of a PC basis for HDMR truncation with a given dimensionality and maxorders array that contains maximal orders per interaction dimensionalities.

    + +
    +
    + +

    ◆ computeMultiIndexT()

    + +
    +
    + + + + + + + + + + + + + + + + +
    int computeMultiIndexT (int ndim,
    int norder,
    int * mi )
    +
    + +

    Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and order Also, returns the number of terms. Note that here, the multiindex array pointer stores indices in column-major format, i.e. mi[j*ndim+i] holds the j-th index for dimension i.

    + +
    +
    + +

    ◆ computeMultiIndexTP()

    + +
    +
    + + + + + + + + + + + +
    int computeMultiIndexTP (Array1D< int > & maxorders,
    Array2D< int > & mindex )
    +
    + +

    Computes the multiindex set of a PC basis for Tensor-Product truncation with a given maximum order per dimensionality Also, returns the number of terms.

    + +
    +
    + +

    ◆ computeNPCTerms()

    + +
    +
    + + + + + + + + + + + +
    int computeNPCTerms (int ndim,
    int norder )
    +
    + +

    Computes the number of PC basis terms for Total-Order truncation with a given dimensionality and order.

    +
    Note
    The formula is (ndim+norder)!/(ndim!norder!)
    +
    + +
    +
    + +

    ◆ computeNPCTermsHDMR()

    + +
    +
    + + + + + + + + + + + +
    int computeNPCTermsHDMR (int ndim,
    Array1D< int > & maxorders )
    +
    + +

    Computes the number of PC basis terms for HDMR truncation with a given dimensionality and maxorders array that contains maximal orders per interaction dimensionalities.

    + +
    +
    + +

    ◆ decodeMindex()

    + +
    +
    + + + + + + + + + + + + + + + + +
    void decodeMindex (Array1D< Array2D< int > > & sp_mindex,
    int ndim,
    Array2D< int > & mindex )
    +
    + +

    Decode a multiindex set from a sparse format to a regular format.

    +
    Note
    For encoding and for more details on the format, see encodeMindex function of PCSet class
    +
    See also
    PCSet.h
    + +
    +
    + +

    ◆ get_invmindex()

    + +
    +
    + + + + + + + +
    int get_invmindex (Array1D< int > mi)
    +
    + +

    Given a single multiindex, this returns its relative position in the total-order multiindex set.

    + +
    +
    + +

    ◆ get_invmindex_ord()

    + +
    +
    + + + + + + + +
    int get_invmindex_ord (Array1D< int > mi)
    +
    + +

    Given a single multiindex, this returns its relative position in the total-order multiindex set among the bases of the same order.

    + +
    +
    + +

    ◆ getOrders()

    + +
    +
    + + + + + + + + + + + +
    void getOrders (Array2D< int > & mindex,
    Array1D< int > & orders )
    +
    + +

    Given a multiindex set, it returns the orders of each basis term.

    +
    Note
    Essentially, this function performs sums of each rows
    + +
    +
    + +

    ◆ is_admis()

    + +
    +
    + + + + + + + + + + + +
    bool is_admis (Array1D< int > & mindex_try,
    Array2D< int > & mindex )
    +
    + +

    A boolean check to see if a new basis term is admissible or not.

    + +
    +
    + +

    ◆ upOrder()

    + +
    +
    + + + + + + + + + + + +
    void upOrder (Array2D< int > & mindex,
    Array2D< int > & new_mindex )
    +
    + +

    Given a multiindex set it computes a new multiindex set where only 'admissible' bases are added.

    +
    Note
    A new basis is admissible, if by subtracting one order from any of the dimensions with non-zero order, one never leaves the set of old multiindices
    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/multiindex_8h.html b/docs/html/multiindex_8h.html new file mode 100644 index 00000000..6f1a329c --- /dev/null +++ b/docs/html/multiindex_8h.html @@ -0,0 +1,491 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: multiindex.h File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Functions
    +
    multiindex.h File Reference
    +
    +
    + +

    Header for tools that deal with integer multiindices. +More...

    +
    #include "Array1D.h"
    +#include "Array2D.h"
    +
    +

    Go to the source code of this file.

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Functions

    void heap_ext_ (const int *, const int *, int *, int *, int *)
     
    int computeNPCTerms (int ndim, int norder)
     Computes the number of PC basis terms for Total-Order truncation with a given dimensionality and order.
     
    int computeMultiIndex (int ndim, int norder, Array2D< int > &mi)
     Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and order Also, returns the number of terms.
     
    int computeMultiIndexT (int ndim, int norder, int *mi)
     Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and order Also, returns the number of terms. Note that here, the multiindex array pointer stores indices in column-major format, i.e. mi[j*ndim+i] holds the j-th index for dimension i.
     
    int computeMultiIndex (int ndim, int norder, Array2D< int > &mi, string ordtype)
     Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and order Also, returns the number of terms.
     
    int computeMultiIndexTP (Array1D< int > &maxorders, Array2D< int > &mindex)
     Computes the multiindex set of a PC basis for Tensor-Product truncation with a given maximum order per dimensionality Also, returns the number of terms.
     
    int computeNPCTermsHDMR (int ndim, Array1D< int > &maxorders)
     Computes the number of PC basis terms for HDMR truncation with a given dimensionality and maxorders array that contains maximal orders per interaction dimensionalities.
     
    int computeMultiIndexHDMR (int ndim, Array1D< int > &maxorders, Array2D< int > &mindex)
     Computes the multiindex set of a PC basis for HDMR truncation with a given dimensionality and maxorders array that contains maximal orders per interaction dimensionalities.
     
    void decodeMindex (Array1D< Array2D< int > > &sp_mindex, int ndim, Array2D< int > &mindex)
     Decode a multiindex set from a sparse format to a regular format.
     
    void upOrder (Array2D< int > &mindex, Array2D< int > &new_mindex)
     Given a multiindex set it computes a new multiindex set where only 'admissible' bases are added.
     
    bool is_admis (Array1D< int > &mindex_try, Array2D< int > &mindex)
     A boolean check to see if a new basis term is admissible or not.
     
    void getOrders (Array2D< int > &mindex, Array1D< int > &orders)
     Given a multiindex set, it returns the orders of each basis term.
     
    int get_invmindex (Array1D< int > mi)
     Given a single multiindex, this returns its relative position in the total-order multiindex set.
     
    int get_invmindex_ord (Array1D< int > mi)
     Given a single multiindex, this returns its relative position in the total-order multiindex set among the bases of the same order.
     
    +

    Detailed Description

    +

    Header for tools that deal with integer multiindices.

    +
    Todo
    Multiindex could be a separate class and a part of core UQTk.
    +

    Function Documentation

    + +

    ◆ computeMultiIndex() [1/2]

    + +
    +
    + + + + + + + + + + + + + + + + +
    int computeMultiIndex (int ndim,
    int norder,
    Array2D< int > & mi )
    +
    + +

    Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and order Also, returns the number of terms.

    + +
    +
    + +

    ◆ computeMultiIndex() [2/2]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    int computeMultiIndex (int ndim,
    int norder,
    Array2D< int > & mi,
    string ordtype )
    +
    + +

    Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and order Also, returns the number of terms.

    + +
    +
    + +

    ◆ computeMultiIndexHDMR()

    + +
    +
    + + + + + + + + + + + + + + + + +
    int computeMultiIndexHDMR (int ndim,
    Array1D< int > & maxorders,
    Array2D< int > & mindex )
    +
    + +

    Computes the multiindex set of a PC basis for HDMR truncation with a given dimensionality and maxorders array that contains maximal orders per interaction dimensionalities.

    + +
    +
    + +

    ◆ computeMultiIndexT()

    + +
    +
    + + + + + + + + + + + + + + + + +
    int computeMultiIndexT (int ndim,
    int norder,
    int * mi )
    +
    + +

    Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and order Also, returns the number of terms. Note that here, the multiindex array pointer stores indices in column-major format, i.e. mi[j*ndim+i] holds the j-th index for dimension i.

    + +
    +
    + +

    ◆ computeMultiIndexTP()

    + +
    +
    + + + + + + + + + + + +
    int computeMultiIndexTP (Array1D< int > & maxorders,
    Array2D< int > & mindex )
    +
    + +

    Computes the multiindex set of a PC basis for Tensor-Product truncation with a given maximum order per dimensionality Also, returns the number of terms.

    + +
    +
    + +

    ◆ computeNPCTerms()

    + +
    +
    + + + + + + + + + + + +
    int computeNPCTerms (int ndim,
    int norder )
    +
    + +

    Computes the number of PC basis terms for Total-Order truncation with a given dimensionality and order.

    +
    Note
    The formula is (ndim+norder)!/(ndim!norder!)
    +
    + +
    +
    + +

    ◆ computeNPCTermsHDMR()

    + +
    +
    + + + + + + + + + + + +
    int computeNPCTermsHDMR (int ndim,
    Array1D< int > & maxorders )
    +
    + +

    Computes the number of PC basis terms for HDMR truncation with a given dimensionality and maxorders array that contains maximal orders per interaction dimensionalities.

    + +
    +
    + +

    ◆ decodeMindex()

    + +
    +
    + + + + + + + + + + + + + + + + +
    void decodeMindex (Array1D< Array2D< int > > & sp_mindex,
    int ndim,
    Array2D< int > & mindex )
    +
    + +

    Decode a multiindex set from a sparse format to a regular format.

    +
    Note
    For encoding and for more details on the format, see encodeMindex function of PCSet class
    +
    See also
    PCSet.h
    + +
    +
    + +

    ◆ get_invmindex()

    + +
    +
    + + + + + + + +
    int get_invmindex (Array1D< int > mi)
    +
    + +

    Given a single multiindex, this returns its relative position in the total-order multiindex set.

    + +
    +
    + +

    ◆ get_invmindex_ord()

    + +
    +
    + + + + + + + +
    int get_invmindex_ord (Array1D< int > mi)
    +
    + +

    Given a single multiindex, this returns its relative position in the total-order multiindex set among the bases of the same order.

    + +
    +
    + +

    ◆ getOrders()

    + +
    +
    + + + + + + + + + + + +
    void getOrders (Array2D< int > & mindex,
    Array1D< int > & orders )
    +
    + +

    Given a multiindex set, it returns the orders of each basis term.

    +
    Note
    Essentially, this function performs sums of each rows
    + +
    +
    + +

    ◆ heap_ext_()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void heap_ext_ (const int * ,
    const int * ,
    int * ,
    int * ,
    int *  )
    +
    + +
    +
    + +

    ◆ is_admis()

    + +
    +
    + + + + + + + + + + + +
    bool is_admis (Array1D< int > & mindex_try,
    Array2D< int > & mindex )
    +
    + +

    A boolean check to see if a new basis term is admissible or not.

    + +
    +
    + +

    ◆ upOrder()

    + +
    +
    + + + + + + + + + + + +
    void upOrder (Array2D< int > & mindex,
    Array2D< int > & new_mindex )
    +
    + +

    Given a multiindex set it computes a new multiindex set where only 'admissible' bases are added.

    +
    Note
    A new basis is admissible, if by subtracting one order from any of the dimensions with non-zero order, one never leaves the set of old multiindices
    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/multiindex_8h_source.html b/docs/html/multiindex_8h_source.html new file mode 100644 index 00000000..02110cee --- /dev/null +++ b/docs/html/multiindex_8h_source.html @@ -0,0 +1,153 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: multiindex.h Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    multiindex.h
    +
    +
    +Go to the documentation of this file.
    1/* =====================================================================================
    +
    2
    +
    3 The UQ Toolkit (UQTk) version 3.1.5
    +
    4 Copyright (2024) NTESS
    +
    5 https://www.sandia.gov/UQToolkit/
    +
    6 https://github.com/sandialabs/UQTk
    +
    7
    +
    8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
    +
    9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
    +
    10 retains certain rights in this software.
    +
    11
    +
    12 This file is part of The UQ Toolkit (UQTk)
    +
    13
    +
    14 UQTk is open source software: you can redistribute it and/or modify
    +
    15 it under the terms of BSD 3-Clause License
    +
    16
    +
    17 UQTk is distributed in the hope that it will be useful,
    +
    18 but WITHOUT ANY WARRANTY; without even the implied warranty of
    +
    19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    +
    20 BSD 3 Clause License for more details.
    +
    21
    +
    22 You should have received a copy of the BSD 3 Clause License
    +
    23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
    +
    24
    +
    25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
    +
    26 Sandia National Laboratories, Livermore, CA, USA
    +
    27===================================================================================== */
    +
    28#ifndef MULTIINDEX_H
    +
    29#define MULTIINDEX_H
    +
    30
    +
    31#include "Array1D.h"
    +
    32#include "Array2D.h"
    +
    33
    +
    34
    +
    40extern "C" void heap_ext_(const int *,const int *, int *, int *, int *);
    +
    41
    +
    45int computeNPCTerms(int ndim,int norder);
    +
    46
    +
    50int computeMultiIndex(int ndim,int norder, Array2D<int> &mi);
    +
    51
    +
    57int computeMultiIndexT(int ndim,int norder, int *mi);
    +
    58
    +
    62int computeMultiIndex(int ndim,int norder, Array2D<int> &mi, string ordtype);
    +
    63
    +
    64
    +
    68int computeMultiIndexTP(Array1D<int>& maxorders, Array2D<int>& mindex);
    +
    69
    +
    73int computeNPCTermsHDMR(int ndim, Array1D<int>& maxorders);
    +
    74
    +
    78int computeMultiIndexHDMR(int ndim, Array1D<int>& maxorders,Array2D<int>& mindex);
    +
    79
    +
    83void decodeMindex(Array1D< Array2D<int> >& sp_mindex, int ndim, Array2D<int>& mindex);
    +
    84
    +
    85
    +
    89void upOrder(Array2D<int>& mindex,Array2D<int>& new_mindex);
    +
    90
    +
    92bool is_admis(Array1D<int>& mindex_try,Array2D<int>& mindex);
    +
    93
    +
    96void getOrders(Array2D<int>& mindex,Array1D<int>& orders);
    +
    97
    +
    99int get_invmindex(Array1D<int> mi);
    +
    100
    +
    102int get_invmindex_ord(Array1D<int> mi);
    +
    103
    +
    104
    +
    105#endif // MULTIINDEX_H
    +
    Array1D.h
    1D Array class for any type T
    +
    Array2D.h
    2D Array class for any type T
    +
    Array1D
    Stores data of any type T in a 1D array.
    Definition Array1D.h:61
    +
    Array2D
    Stores data of any type T in a 2D array.
    Definition Array2D.h:60
    +
    computeMultiIndexT
    int computeMultiIndexT(int ndim, int norder, int *mi)
    Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and ...
    Definition multiindex.cpp:116
    +
    computeMultiIndexTP
    int computeMultiIndexTP(Array1D< int > &maxorders, Array2D< int > &mindex)
    Computes the multiindex set of a PC basis for Tensor-Product truncation with a given maximum order pe...
    Definition multiindex.cpp:381
    +
    computeNPCTerms
    int computeNPCTerms(int ndim, int norder)
    Computes the number of PC basis terms for Total-Order truncation with a given dimensionality and orde...
    Definition multiindex.cpp:40
    +
    computeMultiIndexHDMR
    int computeMultiIndexHDMR(int ndim, Array1D< int > &maxorders, Array2D< int > &mindex)
    Computes the multiindex set of a PC basis for HDMR truncation with a given dimensionality and maxorde...
    Definition multiindex.cpp:431
    +
    computeMultiIndex
    int computeMultiIndex(int ndim, int norder, Array2D< int > &mi)
    Computes the multiindex set of a PC basis for Total-Order truncation with a given dimensionality and ...
    Definition multiindex.cpp:61
    +
    get_invmindex_ord
    int get_invmindex_ord(Array1D< int > mi)
    Given a single multiindex, this returns its relative position in the total-order multiindex set among...
    Definition multiindex.cpp:600
    +
    heap_ext_
    void heap_ext_(const int *, const int *, int *, int *, int *)
    +
    is_admis
    bool is_admis(Array1D< int > &mindex_try, Array2D< int > &mindex)
    A boolean check to see if a new basis term is admissible or not.
    Definition multiindex.cpp:488
    +
    decodeMindex
    void decodeMindex(Array1D< Array2D< int > > &sp_mindex, int ndim, Array2D< int > &mindex)
    Decode a multiindex set from a sparse format to a regular format.
    Definition multiindex.cpp:464
    +
    upOrder
    void upOrder(Array2D< int > &mindex, Array2D< int > &new_mindex)
    Given a multiindex set it computes a new multiindex set where only 'admissible' bases are added.
    Definition multiindex.cpp:526
    +
    get_invmindex
    int get_invmindex(Array1D< int > mi)
    Given a single multiindex, this returns its relative position in the total-order multiindex set.
    Definition multiindex.cpp:583
    +
    getOrders
    void getOrders(Array2D< int > &mindex, Array1D< int > &orders)
    Given a multiindex set, it returns the orders of each basis term.
    Definition multiindex.cpp:564
    +
    computeNPCTermsHDMR
    int computeNPCTermsHDMR(int ndim, Array1D< int > &maxorders)
    Computes the number of PC basis terms for HDMR truncation with a given dimensionality and maxorders a...
    Definition multiindex.cpp:418
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/nav_f.png b/docs/html/nav_f.png new file mode 100644 index 0000000000000000000000000000000000000000..72a58a529ed3a9ed6aa0c51a79cf207e026deee2 GIT binary patch literal 153 zcmeAS@N?(olHy`uVBq!ia0vp^j6iI`!2~2XGqLUlQVE_ejv*C{Z|{2ZH7M}7UYxc) zn!W8uqtnIQ>_z8U literal 0 HcmV?d00001 diff --git a/docs/html/nav_fd.png b/docs/html/nav_fd.png new file mode 100644 index 0000000000000000000000000000000000000000..032fbdd4c54f54fa9a2e6423b94ef4b2ebdfaceb GIT binary patch literal 169 zcmeAS@N?(olHy`uVBq!ia0vp^j6iI`!2~2XGqLUlQU#tajv*C{Z|C~*H7f|XvG1G8 zt7aS*L7xwMeS}!z6R#{C5tIw-s~AJ==F^i}x3XyJseHR@yF& zerFf(Zf;Dd{+(0lDIROL@Sj-Ju2JQ8&-n%4%q?>|^bShc&lR?}7HeMo@BDl5N(aHY Uj$gdr1MOz;boFyt=akR{0D!zeaR2}S literal 0 HcmV?d00001 diff --git a/docs/html/nav_g.png b/docs/html/nav_g.png new file mode 100644 index 0000000000000000000000000000000000000000..2093a237a94f6c83e19ec6e5fd42f7ddabdafa81 GIT binary patch literal 95 zcmeAS@N?(olHy`uVBq!ia0vp^j6lrB!3HFm1ilyoDK$?Q$B+ufw|5PB85lU25BhtE tr?otc=hd~V+ws&_A@j8Fiv!KF$B+ufw|5=67#uj90@pIL wZ=Q8~_Ju`#59=RjDrmm`tMD@M=!-l18IR?&vFVdQ&MBb@0HFXL6W-eg#Jd_@e6*DPn)w;=|1H}Zvm9l6xXXB%>yL=NQU;mg M>FVdQ&MBb@0Bdt1Qvd(} literal 0 HcmV?d00001 diff --git a/docs/html/navtree.css b/docs/html/navtree.css new file mode 100644 index 00000000..69211d4a --- /dev/null +++ b/docs/html/navtree.css @@ -0,0 +1,149 @@ +#nav-tree .children_ul { + margin:0; + padding:4px; +} + +#nav-tree ul { + list-style:none outside none; + margin:0px; + padding:0px; +} + +#nav-tree li { + white-space:nowrap; + margin:0px; + padding:0px; +} + +#nav-tree .plus { + margin:0px; +} + +#nav-tree .selected { + background-image: url('tab_a.png'); + background-repeat:repeat-x; + color: var(--nav-text-active-color); + text-shadow: var(--nav-text-active-shadow); +} + +#nav-tree .selected .arrow { + color: var(--nav-arrow-selected-color); + text-shadow: none; +} + +#nav-tree img { + margin:0px; + padding:0px; + border:0px; + vertical-align: middle; +} + +#nav-tree a { + text-decoration:none; + padding:0px; + margin:0px; +} + +#nav-tree .label { + margin:0px; + padding:0px; + font: 12px var(--font-family-nav); +} + +#nav-tree .label a { + padding:2px; +} + +#nav-tree .selected a { + text-decoration:none; + color:var(--nav-text-active-color); +} + +#nav-tree .children_ul { + margin:0px; + padding:0px; +} + +#nav-tree .item { + margin:0px; + padding:0px; +} + +#nav-tree { + padding: 0px 0px; + font-size:14px; + overflow:auto; +} + +#doc-content { + overflow:auto; + display:block; + padding:0px; + margin:0px; + -webkit-overflow-scrolling : touch; /* iOS 5+ */ +} + +#side-nav { + padding:0 6px 0 0; + margin: 0px; + display:block; + position: absolute; + left: 0px; + width: $width; + overflow : hidden; +} + +.ui-resizable .ui-resizable-handle { + display:block; +} + +.ui-resizable-e { + background-image:var(--nav-splitbar-image); + background-size:100%; + background-repeat:repeat-y; + background-attachment: scroll; + cursor:ew-resize; + height:100%; + right:0; + top:0; + width:6px; +} + +.ui-resizable-handle { + display:none; + font-size:0.1px; + position:absolute; + z-index:1; +} + +#nav-tree-contents { + margin: 6px 0px 0px 0px; +} + +#nav-tree { + background-repeat:repeat-x; + background-color: var(--nav-background-color); + -webkit-overflow-scrolling : touch; /* iOS 5+ */ +} + +#nav-sync { + position:absolute; + top:5px; + right:24px; + z-index:0; +} + +#nav-sync img { + opacity:0.3; +} + +#nav-sync img:hover { + opacity:0.9; +} + +@media print +{ + #nav-tree { display: none; } + div.ui-resizable-handle { display: none; position: relative; } +} + diff --git a/docs/html/open.png b/docs/html/open.png new file mode 100644 index 0000000000000000000000000000000000000000..30f75c7efe2dd0c9e956e35b69777a02751f048b GIT binary patch literal 123 zcmeAS@N?(olHy`uVBq!ia0vp^oFL4>1|%O$WD@{VPM$7~Ar*{o?;hlAFyLXmaDC0y znK1_#cQqJWPES%4Uujug^TE?jMft$}Eq^WaR~)%f)vSNs&gek&x%A9X9sM + + + + + + +UQTk: Uncertainty Quantification Toolkit: Related Pages + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + +
    +
    + +
    +
    Related Pages
    +
    +
    +
    Here is a list of all related documentation pages:
    + + + +
     Todo List
     Bibliography
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/pce__eval_8cpp.html b/docs/html/pce__eval_8cpp.html new file mode 100644 index 00000000..183a8c23 --- /dev/null +++ b/docs/html/pce__eval_8cpp.html @@ -0,0 +1,612 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pce_eval.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros | +Functions
    +
    pce_eval.cpp File Reference
    +
    +
    + +

    Command-line utility for PC-related evaluations. +More...

    +
    #include <unistd.h>
    +#include "PCSet.h"
    +#include "tools.h"
    +#include "arrayio.h"
    +#include "arraytools.h"
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Macros

    #define FCNTYPE   "PC"
     default function type
     
    #define PCORD   1
     default PC order
     
    #define PARAMFILE   "pccf.dat"
     default parameter file
     
    #define AA   0.0
     default a parameter
     
    #define BB   1.0
     default b parameter
     
    #define CC   0.0
     default c parameter
     
    #define DD   1.0
     default d parameter
     
    #define STR1   "HG"
     default string parameter # 1
     
    #define STR2   "mindex.dat"
     default string parameter # 2
     
    + + + + + + + + + + + + + + + + + + +

    +Functions

    void fEval_PC (Array2D< double > &xdata, Array1D< double > &ydata, int pcdim, int pcord, Array1D< double > &c_k, char *pcType, double alpha, double beta)
     Evaluates a PC given dimensionality, order, and coefficients array.
     
    void gEval_PC (Array2D< double > &xdata, Array2D< double > &gdata, int pcdim, int pcord, Array1D< double > &c_k, char *pcType, double alpha, double beta)
     Evaluates the gradient of a PC given dimensionality, order, and coefficients array (only for LU PC)
     
    void fEval_PCmi (Array2D< double > &xdata, Array1D< double > &ydata, Array1D< double > &c_k, char *pcType, char *miFile, double alpha, double beta)
     Evaluates a PC given multiindex file and coefficients array.
     
    void fEval_PCmap (Array2D< double > &xdata, Array1D< double > &ydata, string pcIn, double a, double b, string pcOut, double c, double d)
     Maps given points according to PC maps, i.e. if x=PC1(\xi) and y=PC2(\xi), this function is y=PC2( PC1^{-1} (x) )
     
    int usage ()
     Displays information about this program.
     
    int main (int argc, char *argv[])
     
    +

    Detailed Description

    +

    Command-line utility for PC-related evaluations.

    +
    Author
    K. Sargsyan 2012 -
    +

    Macro Definition Documentation

    + +

    ◆ AA

    + +
    +
    + + + + +
    #define AA   0.0
    +
    + +

    default a parameter

    + +
    +
    + +

    ◆ BB

    + +
    +
    + + + + +
    #define BB   1.0
    +
    + +

    default b parameter

    + +
    +
    + +

    ◆ CC

    + +
    +
    + + + + +
    #define CC   0.0
    +
    + +

    default c parameter

    + +
    +
    + +

    ◆ DD

    + +
    +
    + + + + +
    #define DD   1.0
    +
    + +

    default d parameter

    + +
    +
    + +

    ◆ FCNTYPE

    + +
    +
    + + + + +
    #define FCNTYPE   "PC"
    +
    + +

    default function type

    + +
    +
    + +

    ◆ PARAMFILE

    + +
    +
    + + + + +
    #define PARAMFILE   "pccf.dat"
    +
    + +

    default parameter file

    + +
    +
    + +

    ◆ PCORD

    + +
    +
    + + + + +
    #define PCORD   1
    +
    + +

    default PC order

    + +
    +
    + +

    ◆ STR1

    + +
    +
    + + + + +
    #define STR1   "HG"
    +
    + +

    default string parameter # 1

    + +
    +
    + +

    ◆ STR2

    + +
    +
    + + + + +
    #define STR2   "mindex.dat"
    +
    + +

    default string parameter # 2

    + +
    +
    +

    Function Documentation

    + +

    ◆ fEval_PC()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void fEval_PC (Array2D< double > & xdata,
    Array1D< double > & ydata,
    int ndim,
    int nord,
    Array1D< double > & c_k,
    char * pcType,
    double alpha,
    double beta )
    +
    + +

    Evaluates a PC given dimensionality, order, and coefficients array.

    +
    Parameters
    + + + + + + + + + +
    [in]xdata: Input samples
    [out]ydata: Output array
    [in]ndim: PC dimesnionality
    [in]nord: PC order
    [in]c_k: Coefficient array
    [in]pcType: PC type
    [in]alpha: PC parameter #1
    [in]beta: PC parameter #2
    +
    +
    +

    Get the number of input points and appropriately resize the output array

    +

    Sanity check of dimensionality

    +

    Declare the PC object

    +

    Get the number of terms

    +

    Evaluate the PC expansion

    + +
    +
    + +

    ◆ fEval_PCmap()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void fEval_PCmap (Array2D< double > & xdata,
    Array1D< double > & ydata,
    string pcIn,
    double a,
    double b,
    string pcOut,
    double c,
    double d )
    +
    + +

    Maps given points according to PC maps, i.e. if x=PC1(\xi) and y=PC2(\xi), this function is y=PC2( PC1^{-1} (x) )

    +
    Parameters
    + + + + + + + + + +
    [in]xdata: Input samples
    [out]ydata: Output array
    [in]pcIn: Input PC type (PC1)
    [in]a: Input PC parameter #1
    [in]b: Input PC parameter #2
    [in]pcOut: Output PC type (PC2)
    [in]c: Output PC parameter #1
    [in]d: Output PC parameter #2
    +
    +
    +

    Get the number of input points and appropriately resize the output array

    +

    Ensure dimensionality = 1

    +

    Compute the PC map using function in pcmaps.cpp

    + +
    +
    + +

    ◆ fEval_PCmi()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void fEval_PCmi (Array2D< double > & xdata,
    Array1D< double > & ydata,
    Array1D< double > & c_k,
    char * pcType,
    char * miFile,
    double alpha,
    double beta )
    +
    + +

    Evaluates a PC given multiindex file and coefficients array.

    +
    Parameters
    + + + + + + + + +
    [in]xdata: Input samples
    [out]ydata: Output array
    [in]c_k: Coefficient array
    [in]pcType: PC type
    [in]nord: PC multiindex array
    [in]alpha: PC parameter #1
    [in]beta: PC parameter #2
    +
    +
    +

    Read the multiindex given the file

    +

    Get the number of input points and appropriately resize the output array

    +

    Sanity check of dimensionality

    +

    Declare the PC object

    +

    Get the number of terms

    +

    Evaluate the PC expansion

    + +
    +
    + +

    ◆ gEval_PC()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void gEval_PC (Array2D< double > & xdata,
    Array2D< double > & gdata,
    int ndim,
    int nord,
    Array1D< double > & c_k,
    char * pcType,
    double alpha,
    double beta )
    +
    + +

    Evaluates the gradient of a PC given dimensionality, order, and coefficients array (only for LU PC)

    +
    Parameters
    + + + + + + + + + +
    [in]xdata: Input samples
    [out]gdata: Output gradient information stired in 2D array
    [in]ndim: PC dimesnionality
    [in]nord: PC order
    [in]c_k: Coefficient array
    [in]pcType: PC type
    [in]alpha: PC parameter #1
    [in]beta: PC parameter #2
    +
    +
    +

    Get the number of input points

    +

    Get the dimensionality

    +

    Resize the output array

    +

    Sanity check of dimensionality

    +

    Declare the PC object

    +

    Get the number of terms

    +

    Get the multi-indices for this PC representation

    +

    Evaluate the gradient of th PC expansion

    + +
    +
    + +

    ◆ main()

    + +
    +
    + + + + + + + + + + + +
    int main (int argc,
    char * argv[] )
    +
    +

    Main program: evaluates PC-related functions

    Todo
    Make the input arguments more transparent, i.e. what do they mean in different scenarios?
    +
    +

    Set the default values

    +

    Read the user input

    +

    Print the input information on screen

    +

    Read the input data

    +

    Check which function is requested and compute it

    +

    Write the resulting array to a file

    +

    Gradient info, only available for LU PC

    +

    Write the resulting array to a file

    +

    Write the resulting 2D array to a file

    + +
    +
    + +

    ◆ usage()

    + +
    +
    + + + + + + + +
    int usage ()
    +
    + +

    Displays information about this program.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/pce__quad_8cpp.html b/docs/html/pce__quad_8cpp.html new file mode 100644 index 00000000..4e35565c --- /dev/null +++ b/docs/html/pce__quad_8cpp.html @@ -0,0 +1,289 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pce_quad.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros | +Functions
    +
    pce_quad.cpp File Reference
    +
    +
    + +

    Command-line utility for PC construction given samples. +More...

    +
    #include "PCSet.h"
    +#include "tools.h"
    +#include "arraytools.h"
    +#include "arrayio.h"
    +#include <unistd.h>
    +
    + + + + + + + + + + + + + + + + + + + + + + +

    +Macros

    #define ORD   1
     default PC order
     
    #define BWDTH   0.01
     default bandwidth for Rosenblatt transformation
     
    #define FILEIN   "data_in.dat"
     default input filename
     
    #define CHAOS   "LU"
     default chaos type
     
    #define ALPHA   0.0
     default PC parameter #1
     
    #define BETA   1.0
     default PC parameter #2
     
    #define DIAG_GP   1000
     diagnostic: frequency of showing progress of Galerkin projection
     
    + + + + + + + +

    +Functions

    int usage ()
     Displays information about this program.
     
    int main (int argc, char *argv[])
     Program to find PC coefficient of a random variable given a set of data samples.
     
    +

    Detailed Description

    +

    Command-line utility for PC construction given samples.

    +
    Author
    K. Sargsyan 2012 -
    +

    Macro Definition Documentation

    + +

    ◆ ALPHA

    + +
    +
    + + + + +
    #define ALPHA   0.0
    +
    + +

    default PC parameter #1

    + +
    +
    + +

    ◆ BETA

    + +
    +
    + + + + +
    #define BETA   1.0
    +
    + +

    default PC parameter #2

    + +
    +
    + +

    ◆ BWDTH

    + +
    +
    + + + + +
    #define BWDTH   0.01
    +
    + +

    default bandwidth for Rosenblatt transformation

    + +
    +
    + +

    ◆ CHAOS

    + +
    +
    + + + + +
    #define CHAOS   "LU"
    +
    + +

    default chaos type

    + +
    +
    + +

    ◆ DIAG_GP

    + +
    +
    + + + + +
    #define DIAG_GP   1000
    +
    + +

    diagnostic: frequency of showing progress of Galerkin projection

    + +
    +
    + +

    ◆ FILEIN

    + +
    +
    + + + + +
    #define FILEIN   "data_in.dat"
    +
    + +

    default input filename

    + +
    +
    + +

    ◆ ORD

    + +
    +
    + + + + +
    #define ORD   1
    +
    + +

    default PC order

    + +
    +
    +

    Function Documentation

    + +

    ◆ main()

    + +
    +
    + + + + + + + + + + + +
    int main (int argc,
    char * argv[] )
    +
    + +

    Program to find PC coefficient of a random variable given a set of data samples.

    +

    Set the defaults and parse the input arguments

    +

    Print the input information

    +

    Read the input datafile and get its size

    +

    For the projection based PC (unlike the inference), the data dimensionality has to coincide with the stochastic dimension

    +

    Set the chaos

    +

    Get the default quadrature points

    +

    Transpose the data array to prepare for invRos()

    +

    Array to contain inverse-Rosenblatt transformed points

    +

    Frequency of showing Galerkin projection progress

    +

    Begin Loop over all quadrature points

    +

    Map quadrature points to uniform[0,1]

    +

    Map uniform[0,1] to the distribution given by the original samples via inverse Rosenblatt

    +

    Get PC coefficients by Galerkin Projection (xxik(ip,idim)=<xi_idim * psi_ip>)

    +

    Write PC coefficients to the output file

    +

    Write multi-indices to the output file

    + +
    +
    + +

    ◆ usage()

    + +
    +
    + + + + + + + +
    int usage ()
    +
    + +

    Displays information about this program.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/pce__rv_8cpp.html b/docs/html/pce__rv_8cpp.html new file mode 100644 index 00000000..d5695b24 --- /dev/null +++ b/docs/html/pce__rv_8cpp.html @@ -0,0 +1,355 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pce_rv.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros | +Functions
    +
    pce_rv.cpp File Reference
    +
    +
    + +

    Command-line utility for PC-related random variable generation. +More...

    +
    #include <math.h>
    +#include <unistd.h>
    +#include "PCSet.h"
    +#include "tools.h"
    +#include "arrayio.h"
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Macros

    #define RVTYPE   "PCvar"
     default r.v. type
     
    #define DIM   1
     default r.v. dimensionality
     
    #define SAMPLE   1000
     default number of samples
     
    #define PCDIM   1
     default PC dimensionality
     
    #define PCORD   3
     default PC order
     
    #define PARAMFILE   "pccf.dat"
     default parameter file
     
    #define AA   0.0
     default first parameter of PC, if needed
     
    #define BB   1.0
     default second parameter of PC, if needed
     
    #define MIFILE   "mi.dat"
     default multiindex file
     
    #define SEED   1
     default seed
     
    #define STRPARAM   "LEG"
     default string parameter
     
    + + + + + + + +

    +Functions

    int usage ()
     Displays information about this program.
     
    int main (int argc, char *argv[])
     Main program: generates PC-related random variables.
     
    +

    Detailed Description

    +

    Command-line utility for PC-related random variable generation.

    +
    Author
    K. Sargsyan 2014 -
    +

    Macro Definition Documentation

    + +

    ◆ AA

    + +
    +
    + + + + +
    #define AA   0.0
    +
    + +

    default first parameter of PC, if needed

    + +
    +
    + +

    ◆ BB

    + +
    +
    + + + + +
    #define BB   1.0
    +
    + +

    default second parameter of PC, if needed

    + +
    +
    + +

    ◆ DIM

    + +
    +
    + + + + +
    #define DIM   1
    +
    + +

    default r.v. dimensionality

    + +
    +
    + +

    ◆ MIFILE

    + +
    +
    + + + + +
    #define MIFILE   "mi.dat"
    +
    + +

    default multiindex file

    + +
    +
    + +

    ◆ PARAMFILE

    + +
    +
    + + + + +
    #define PARAMFILE   "pccf.dat"
    +
    + +

    default parameter file

    + +
    +
    + +

    ◆ PCDIM

    + +
    +
    + + + + +
    #define PCDIM   1
    +
    + +

    default PC dimensionality

    + +
    +
    + +

    ◆ PCORD

    + +
    +
    + + + + +
    #define PCORD   3
    +
    + +

    default PC order

    + +
    +
    + +

    ◆ RVTYPE

    + +
    +
    + + + + +
    #define RVTYPE   "PCvar"
    +
    + +

    default r.v. type

    + +
    +
    + +

    ◆ SAMPLE

    + +
    +
    + + + + +
    #define SAMPLE   1000
    +
    + +

    default number of samples

    + +
    +
    + +

    ◆ SEED

    + +
    +
    + + + + +
    #define SEED   1
    +
    + +

    default seed

    + +
    +
    + +

    ◆ STRPARAM

    + +
    +
    + + + + +
    #define STRPARAM   "LEG"
    +
    + +

    default string parameter

    + +
    +
    +

    Function Documentation

    + +

    ◆ main()

    + +
    +
    + + + + + + + + + + + +
    int main (int argc,
    char * argv[] )
    +
    + +

    Main program: generates PC-related random variables.

    +

    Set the defaults and parse input arguments

    +

    Print out input information

    +

    Go through options for R.V. generation

    +

    Write out to a file

    + +
    +
    + +

    ◆ usage()

    + +
    +
    + + + + + + + +
    int usage ()
    +
    + +

    Displays information about this program.

    +
    Todo
    Add more detailed information on options. E.g. what are the different options for type of random variable? When does the order need to be specified?
    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/pce__sens_8cpp.html b/docs/html/pce__sens_8cpp.html new file mode 100644 index 00000000..0b77c919 --- /dev/null +++ b/docs/html/pce__sens_8cpp.html @@ -0,0 +1,244 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pce_sens.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros | +Functions
    +
    pce_sens.cpp File Reference
    +
    +
    + +

    Command-line utility for Sobol sensitivity index computation given PC. +More...

    +
    #include "PCSet.h"
    +#include "tools.h"
    +#include "arrayio.h"
    +#include <unistd.h>
    +
    + + + + + + + + + + + + + + + + +

    +Macros

    #define CHAOS   "LU"
     default PC type
     
    #define MINDEX_FILE   "mindex.dat"
     default multiindex file
     
    #define COEF_FILE   "PCcoeff.dat"
     default coefficient file
     
    #define ALPHA   0.0
     default alpha parameter for PC
     
    #define BETA   1.0
     default beta parameter for PC
     
    + + + + + + + +

    +Functions

    int usage ()
     Displays information about this program.
     
    int main (int argc, char *argv[])
     Main program: parses the information contained in given multiindices and corresponding coefficients.
     
    +

    Detailed Description

    +

    Command-line utility for Sobol sensitivity index computation given PC.

    +
    Author
    K. Sargsyan 2014 -
    +

    Macro Definition Documentation

    + +

    ◆ ALPHA

    + +
    +
    + + + + +
    #define ALPHA   0.0
    +
    + +

    default alpha parameter for PC

    + +
    +
    + +

    ◆ BETA

    + +
    +
    + + + + +
    #define BETA   1.0
    +
    + +

    default beta parameter for PC

    + +
    +
    + +

    ◆ CHAOS

    + +
    +
    + + + + +
    #define CHAOS   "LU"
    +
    + +

    default PC type

    + +
    +
    + +

    ◆ COEF_FILE

    + +
    +
    + + + + +
    #define COEF_FILE   "PCcoeff.dat"
    +
    + +

    default coefficient file

    + +
    +
    + +

    ◆ MINDEX_FILE

    + +
    +
    + + + + +
    #define MINDEX_FILE   "mindex.dat"
    +
    + +

    default multiindex file

    + +
    +
    +

    Function Documentation

    + +

    ◆ main()

    + +
    +
    + + + + + + + + + + + +
    int main (int argc,
    char * argv[] )
    +
    + +

    Main program: parses the information contained in given multiindices and corresponding coefficients.

    +

    Set the defaults and parse the input arguments

    +

    Print out input information

    +

    Read the multiindex and coefficients' files

    +

    Declare PC in NISP formulation with no quadrature

    +

    Encode the multiindex in a sparse format and print to files

    +

    Compute mean and variance of PC and variance fractions for each term

    +

    Compute main sensitivities

    +

    Compute total sensitivities

    +

    Compute joint sensitivities

    + +
    +
    + +

    ◆ usage()

    + +
    +
    + + + + + + + +
    int usage ()
    +
    + +

    Displays information about this program.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/pcmaps_8cpp.html b/docs/html/pcmaps_8cpp.html new file mode 100644 index 00000000..8f39a96c --- /dev/null +++ b/docs/html/pcmaps_8cpp.html @@ -0,0 +1,395 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pcmaps.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros | +Functions
    +
    pcmaps.cpp File Reference
    +
    +
    + +

    Suite of functions to help map one kind of a PC variable to another. +More...

    +
    #include "Array1D.h"
    +#include "Array2D.h"
    +#include "gen_defs.h"
    +#include "error_handlers.h"
    +#include "probability.h"
    +#include "arrayio.h"
    +#include "pcmaps.h"
    +#include "combin.h"
    +#include <assert.h>
    +#include <math.h>
    +#include <float.h>
    +
    + + + + + +

    +Macros

    #define EPS   1e-16
     
    #define MXEPS   1e+100
     
    + + + + + + + + + + + + + + + + +

    +Functions

    double PCtoPC (double x, const std::string pcIn, double in1, double in2, const std::string pcOut, double out1, double out2)
     Implements a map y=f(x), where f is a function mapping one PC domain (pcIn with parameters in1,in2) to another (pcOut with parameters out1,out2)
     
    void PCtoPC (Array2D< double > &xx, const std::string pcIn, double in1, double in2, Array2D< double > &yy, const std::string pcOut, double out1, double out2)
     Implements PCtoPC() map entrywise from array xx to yy.
     
    double rtbis_mod (double func(double, const std::string, double, double, const std::string, double, double), const double x1, const double x2, const double xacc, double x, const std::string pcIn, double in1, double in2, const std::string pcOut, double out1, double out2)
     Bisection method for root-finding, modified to invert PCtoPC maps.
     
    void linint (Array2D< double > &xydata, const double x, double &y, int col)
     Auxiliary linear interpolation function.
     
    void linint (Array2D< double > &xydata, const double x, double &y)
     Auxiliary linear interpolation function.
     
    +

    Detailed Description

    +

    Suite of functions to help map one kind of a PC variable to another.

    +

    Macro Definition Documentation

    + +

    ◆ EPS

    + +
    +
    + + + + +
    #define EPS   1e-16
    +
    + +
    +
    + +

    ◆ MXEPS

    + +
    +
    + + + + +
    #define MXEPS   1e+100
    +
    + +
    +
    +

    Function Documentation

    + +

    ◆ linint() [1/2]

    + +
    +
    + + + + + + + + + + + + + + + + +
    void linint (Array2D< double > & xydata,
    const double x,
    double & y )
    +
    + +

    Auxiliary linear interpolation function.

    +
    Note
    Currently not used, as there is an overloaded linint() function that is more general
    + +
    +
    + +

    ◆ linint() [2/2]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void linint (Array2D< double > & xydata,
    const double x,
    double & y,
    int col )
    +
    + +

    Auxiliary linear interpolation function.

    + +
    +
    + +

    ◆ PCtoPC() [1/2]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void PCtoPC (Array2D< double > & xx,
    const std::string pcIn,
    double in1,
    double in2,
    Array2D< double > & yy,
    const std::string pcOut,
    double out1,
    double out2 )
    +
    + +

    Implements PCtoPC() map entrywise from array xx to yy.

    + +
    +
    + +

    ◆ PCtoPC() [2/2]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    double PCtoPC (double x,
    const std::string pcIn,
    double in1,
    double in2,
    const std::string pcOut,
    double out1,
    double out2 )
    +
    + +

    Implements a map y=f(x), where f is a function mapping one PC domain (pcIn with parameters in1,in2) to another (pcOut with parameters out1,out2)

    +
    Note
    Besides standard PC types, it also incorporates a) 'TG' : truncated-gaussian variable, b) 'RB' : Roe-Baker PDF from Roe, G. H., & Baker, M. B. (2007). Why is climate sensitivity so unpredictable?. Science, 318(5850), 629-632. c) 'pdf': Given arbitrary cumulative distribution function values in cdf.dat it maps corresponding r.v. to PC variables as well
    +
    Parameters
    + + + + + + + + +
    [in]x: Input scalar x
    [in]pcIn: PC type for input x (options are LU, HG, LG, JB, SW, TG, RB, pdf)
    [in]in1: Parameter #1 for input PC (if relevant, i.e. for LG, JB, SW, TG, RB)
    [in]in2: Parameter #2 for input PC (if relevant, i.e. for JB, SW, RB)
    [in]pcOut: PC type for output y (options are LU, HG, LG, JB, SW, TG, RB, pdf)
    [in]out1: Parameter #1 for output PC (if relevant, i.e. for LG, JB, SW, TG, RB)
    [in]out2: Parameter #2 for output PC (if relevant, i.e. for JB, SW, RB)
    +
    +
    +
    Returns
    y : Output scalar y
    +
    Note
    The user is free to choose any value of x that is in the PC domain defined by pcIn
    +
    +The map f() is a map frpm pcIn germ to a pcOut germ
    +
    +For example, y=PCtoPC(x,'HG',0,0,'LU',0,0) maps $(-\infty,\infty)$ to $[-1,1]$ as a map from standard normal r.v. to uniform r.v.
    + +
    +
    + +

    ◆ rtbis_mod()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    double rtbis_mod (double funcdouble, const std::string, double, double, const std::string, double, double,
    const double x1,
    const double x2,
    const double xacc,
    double x,
    const std::string pcIn,
    double in1,
    double in2,
    const std::string pcOut,
    double out1,
    double out2 )
    +
    + +

    Bisection method for root-finding, modified to invert PCtoPC maps.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/pcmaps_8h.html b/docs/html/pcmaps_8h.html new file mode 100644 index 00000000..18133a1f --- /dev/null +++ b/docs/html/pcmaps_8h.html @@ -0,0 +1,352 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pcmaps.h File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Functions
    +
    pcmaps.h File Reference
    +
    +
    + +

    Header for suite of functions to help map one kind of a PC variable to another. +More...

    + +

    Go to the source code of this file.

    + + + + + + + + + + + + + + + + + +

    +Functions

    double PCtoPC (double x, const std::string pcIn, double in1, double in2, const std::string pcOut, double out1, double out2)
     Implements a map y=f(x), where f is a function mapping one PC domain (pcIn with parameters in1,in2) to another (pcOut with parameters out1,out2)
     
    void PCtoPC (Array2D< double > &xx, const std::string pcIn, double in1, double in2, Array2D< double > &yy, const std::string pcOut, double out1, double out2)
     Implements PCtoPC() map entrywise from array xx to yy.
     
    double rtbis_mod (double func(double, const std::string, double, double, const std::string, double, double), const double x1, const double x2, const double xacc, double x, const std::string pcIn, double in1, double in2, const std::string pcOut, double out1, double out2)
     Bisection method for root-finding, modified to invert PCtoPC maps.
     
    void linint (Array2D< double > &xydata, const double x, double &y, int col)
     Auxiliary linear interpolation function.
     
    void linint (Array2D< double > &xydata, const double x, double &y)
     Auxiliary linear interpolation function.
     
    +

    Detailed Description

    +

    Header for suite of functions to help map one kind of a PC variable to another.

    +
    Todo

    Perhaps use more robust tools, like dcdflib.

    +

    Need more testing of these tools.

    +
    +

    Function Documentation

    + +

    ◆ linint() [1/2]

    + +
    +
    + + + + + + + + + + + + + + + + +
    void linint (Array2D< double > & xydata,
    const double x,
    double & y )
    +
    + +

    Auxiliary linear interpolation function.

    +
    Note
    Currently not used, as there is an overloaded linint() function that is more general
    + +
    +
    + +

    ◆ linint() [2/2]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void linint (Array2D< double > & xydata,
    const double x,
    double & y,
    int col )
    +
    + +

    Auxiliary linear interpolation function.

    + +
    +
    + +

    ◆ PCtoPC() [1/2]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void PCtoPC (Array2D< double > & xx,
    const std::string pcIn,
    double in1,
    double in2,
    Array2D< double > & yy,
    const std::string pcOut,
    double out1,
    double out2 )
    +
    + +

    Implements PCtoPC() map entrywise from array xx to yy.

    + +
    +
    + +

    ◆ PCtoPC() [2/2]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    double PCtoPC (double x,
    const std::string pcIn,
    double in1,
    double in2,
    const std::string pcOut,
    double out1,
    double out2 )
    +
    + +

    Implements a map y=f(x), where f is a function mapping one PC domain (pcIn with parameters in1,in2) to another (pcOut with parameters out1,out2)

    +
    Note
    Besides standard PC types, it also incorporates a) 'TG' : truncated-gaussian variable, b) 'RB' : Roe-Baker PDF from Roe, G. H., & Baker, M. B. (2007). Why is climate sensitivity so unpredictable?. Science, 318(5850), 629-632. c) 'pdf': Given arbitrary cumulative distribution function values in cdf.dat it maps corresponding r.v. to PC variables as well
    +
    Parameters
    + + + + + + + + +
    [in]x: Input scalar x
    [in]pcIn: PC type for input x (options are LU, HG, LG, JB, SW, TG, RB, pdf)
    [in]in1: Parameter #1 for input PC (if relevant, i.e. for LG, JB, SW, TG, RB)
    [in]in2: Parameter #2 for input PC (if relevant, i.e. for JB, SW, RB)
    [in]pcOut: PC type for output y (options are LU, HG, LG, JB, SW, TG, RB, pdf)
    [in]out1: Parameter #1 for output PC (if relevant, i.e. for LG, JB, SW, TG, RB)
    [in]out2: Parameter #2 for output PC (if relevant, i.e. for JB, SW, RB)
    +
    +
    +
    Returns
    y : Output scalar y
    +
    Note
    The user is free to choose any value of x that is in the PC domain defined by pcIn
    +
    +The map f() is a map frpm pcIn germ to a pcOut germ
    +
    +For example, y=PCtoPC(x,'HG',0,0,'LU',0,0) maps $(-\infty,\infty)$ to $[-1,1]$ as a map from standard normal r.v. to uniform r.v.
    + +
    +
    + +

    ◆ rtbis_mod()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    double rtbis_mod (double funcdouble, const std::string, double, double, const std::string, double, double,
    const double x1,
    const double x2,
    const double xacc,
    double x,
    const std::string pcIn,
    double in1,
    double in2,
    const std::string pcOut,
    double out1,
    double out2 )
    +
    + +

    Bisection method for root-finding, modified to invert PCtoPC maps.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/pcmaps_8h_source.html b/docs/html/pcmaps_8h_source.html new file mode 100644 index 00000000..4a1ae5ce --- /dev/null +++ b/docs/html/pcmaps_8h_source.html @@ -0,0 +1,118 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pcmaps.h Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    pcmaps.h
    +
    +
    +Go to the documentation of this file.
    1/* =====================================================================================
    +
    2
    +
    3 The UQ Toolkit (UQTk) version 3.1.5
    +
    4 Copyright (2024) NTESS
    +
    5 https://www.sandia.gov/UQToolkit/
    +
    6 https://github.com/sandialabs/UQTk
    +
    7
    +
    8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
    +
    9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
    +
    10 retains certain rights in this software.
    +
    11
    +
    12 This file is part of The UQ Toolkit (UQTk)
    +
    13
    +
    14 UQTk is open source software: you can redistribute it and/or modify
    +
    15 it under the terms of BSD 3-Clause License
    +
    16
    +
    17 UQTk is distributed in the hope that it will be useful,
    +
    18 but WITHOUT ANY WARRANTY; without even the implied warranty of
    +
    19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    +
    20 BSD 3 Clause License for more details.
    +
    21
    +
    22 You should have received a copy of the BSD 3 Clause License
    +
    23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
    +
    24
    +
    25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
    +
    26 Sandia National Laboratories, Livermore, CA, USA
    +
    27===================================================================================== */
    +
    28#ifndef PCMAPS_H
    +
    29#define PCMAPS_H
    +
    30
    +
    54double PCtoPC(double x, const std::string pcIn, double in1, double in2, const std::string pcOut, double out1, double out2);
    +
    55
    +
    57void PCtoPC(Array2D<double>& xx, const std::string pcIn, double in1, double in2, Array2D<double>& yy, const std::string pcOut, double out1, double out2);
    +
    58
    +
    60double rtbis_mod(double func(double,const std::string,double,double,const std::string,double,double), const double x1, const double x2, const double xacc,double x, const std::string pcIn, double in1, double in2, const std::string pcOut, double out1, double out2);
    +
    61
    +
    63void linint( Array2D<double> &xydata, const double x, double &y, int col ) ;
    +
    64
    +
    67void linint( Array2D<double> &xydata, const double x, double &y ) ;
    +
    68
    +
    69
    +
    70//---------------------------------------------------------------------------------------
    +
    71#endif // PCMAPS_H
    +
    Array2D
    Stores data of any type T in a 2D array.
    Definition Array2D.h:60
    +
    x1
    static double x1[]
    Definition gkpclib.cpp:36
    +
    linint
    void linint(Array2D< double > &xydata, const double x, double &y, int col)
    Auxiliary linear interpolation function.
    Definition pcmaps.cpp:440
    +
    PCtoPC
    double PCtoPC(double x, const std::string pcIn, double in1, double in2, const std::string pcOut, double out1, double out2)
    Implements a map y=f(x), where f is a function mapping one PC domain (pcIn with parameters in1,...
    Definition pcmaps.cpp:51
    +
    rtbis_mod
    double rtbis_mod(double func(double, const std::string, double, double, const std::string, double, double), const double x1, const double x2, const double xacc, double x, const std::string pcIn, double in1, double in2, const std::string pcOut, double out1, double out2)
    Bisection method for root-finding, modified to invert PCtoPC maps.
    Definition pcmaps.cpp:416
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/pdf__cl_8cpp.html b/docs/html/pdf__cl_8cpp.html new file mode 100644 index 00000000..b947dac5 --- /dev/null +++ b/docs/html/pdf__cl_8cpp.html @@ -0,0 +1,230 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: pdf_cl.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros | +Functions
    +
    pdf_cl.cpp File Reference
    +
    +
    + +

    Command-line utility for KDE given samples. +More...

    +
    #include <cstdio>
    +#include <stddef.h>
    +#include <fstream>
    +#include <string>
    +#include <math.h>
    +#include <iostream>
    +#include <getopt.h>
    +#include "Array1D.h"
    +#include "Array2D.h"
    +#include "assert.h"
    +#include "tools.h"
    +#include "arrayio.h"
    +#include "arraytools.h"
    +
    + + + + + + + + + + + + + +

    +Macros

    #define FILE_IN   "data_in.dat"
     default input file
     
    #define GRID   100
     default number of grid pts in each dimension
     
    #define N_CL   1
     default number of clusters
     
    #define BFAC   1.0
     default bandwidth scale factor
     
    + + + + + + + +

    +Functions

    int usage ()
     Displays information about this program.
     
    int main (int argc, char *argv[])
     Program to compute PDF via KDE given samples.
     
    +

    Detailed Description

    +

    Command-line utility for KDE given samples.

    +
    Author
    K. Sargsyan, C. Safta 2013 -
    +

    Macro Definition Documentation

    + +

    ◆ BFAC

    + +
    +
    + + + + +
    #define BFAC   1.0
    +
    + +

    default bandwidth scale factor

    + +
    +
    + +

    ◆ FILE_IN

    + +
    +
    + + + + +
    #define FILE_IN   "data_in.dat"
    +
    + +

    default input file

    + +
    +
    + +

    ◆ GRID

    + +
    +
    + + + + +
    #define GRID   100
    +
    + +

    default number of grid pts in each dimension

    + +
    +
    + +

    ◆ N_CL

    + +
    +
    + + + + +
    #define N_CL   1
    +
    + +

    default number of clusters

    + +
    +
    +

    Function Documentation

    + +

    ◆ main()

    + +
    +
    + + + + + + + + + + + +
    int main (int argc,
    char * argv[] )
    +
    + +

    Program to compute PDF via KDE given samples.

    +

    Read the user input

    +

    Input checks

    +

    Prepare grid

    +

    Compute densities

    +

    Write PDF to file

    + +
    +
    + +

    ◆ usage()

    + +
    +
    + + + + + + + +
    int usage ()
    +
    + +

    Displays information about this program.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/plus.svg b/docs/html/plus.svg new file mode 100644 index 00000000..07520165 --- /dev/null +++ b/docs/html/plus.svg @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/docs/html/plusd.svg b/docs/html/plusd.svg new file mode 100644 index 00000000..0c65bfe9 --- /dev/null +++ b/docs/html/plusd.svg @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/docs/html/post_8cpp.html b/docs/html/post_8cpp.html new file mode 100644 index 00000000..f36650ab --- /dev/null +++ b/docs/html/post_8cpp.html @@ -0,0 +1,110 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: post.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros
    +
    post.cpp File Reference
    +
    +
    + +

    Posterior computation class. +More...

    +
    #include <math.h>
    +#include <cfloat>
    +#include <assert.h>
    +#include "func.h"
    +#include "mrv.h"
    +#include "post.h"
    +#include "tools.h"
    +#include "PCSet.h"
    +#include "error_handlers.h"
    +#include "arrayio.h"
    +#include "arraytools.h"
    +
    + + + +

    +Macros

    #define SIG_MAX   10
     
    +

    Detailed Description

    +

    Posterior computation class.

    +
    Author
    K. Sargsyan 2016 -
    +

    Macro Definition Documentation

    + +

    ◆ SIG_MAX

    + +
    +
    + + + + +
    #define SIG_MAX   10
    +
    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/post_8h.html b/docs/html/post_8h.html new file mode 100644 index 00000000..429a0f52 --- /dev/null +++ b/docs/html/post_8h.html @@ -0,0 +1,124 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: post.h File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Classes
    +
    post.h File Reference
    +
    +
    + +

    Header for the posterior computation class. +More...

    +
    #include "Array1D.h"
    +#include "Array2D.h"
    +#include "mrv.h"
    +#include <iostream>
    +#include <string.h>
    +#include <stdio.h>
    +#include <sstream>
    +
    +

    Go to the source code of this file.

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Classes

    class  Post
     posterior evaluation with various likelihood and prior options More...
     
    class  Lik_Full
     Derived class for full likelihood. More...
     
    class  Lik_Marg
     Derived class for marginal likelihood. More...
     
    class  Lik_MVN
     Derived class for mvn likelihood. More...
     
    class  Lik_GausMarg
     Derived class for gaussian-marginal likelihood. More...
     
    class  Lik_GausMargD
     Derived class for gaussian-marginal likelihood with discrete parameter. More...
     
    class  Lik_ABC
     Derived class for ABC likelihood. More...
     
    class  Lik_ABCm
     Derived class for ABC-mean likelihood. More...
     
    class  Lik_Koh
     Derived class for Kennedy-O'Hagan likelihood. More...
     
    class  Lik_Classical
     Derived class for classical likelihood. More...
     
    class  Lik_Eov
     Derived class for error-in-variable likelihood. More...
     
    +

    Detailed Description

    +

    Header for the posterior computation class.

    +
    Author
    K. Sargsyan 2016 -
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/post_8h_source.html b/docs/html/post_8h_source.html new file mode 100644 index 00000000..ac26ec2d --- /dev/null +++ b/docs/html/post_8h_source.html @@ -0,0 +1,432 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: post.h Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    post.h
    +
    +
    +Go to the documentation of this file.
    1/* =====================================================================================
    +
    2
    +
    3 The UQ Toolkit (UQTk) version 3.1.5
    +
    4 Copyright (2024) NTESS
    +
    5 https://www.sandia.gov/UQToolkit/
    +
    6 https://github.com/sandialabs/UQTk
    +
    7
    +
    8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
    +
    9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
    +
    10 retains certain rights in this software.
    +
    11
    +
    12 This file is part of The UQ Toolkit (UQTk)
    +
    13
    +
    14 UQTk is open source software: you can redistribute it and/or modify
    +
    15 it under the terms of BSD 3-Clause License
    +
    16
    +
    17 UQTk is distributed in the hope that it will be useful,
    +
    18 but WITHOUT ANY WARRANTY; without even the implied warranty of
    +
    19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    +
    20 BSD 3 Clause License for more details.
    +
    21
    +
    22 You should have received a copy of the BSD 3 Clause License
    +
    23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
    +
    24
    +
    25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
    +
    26 Sandia National Laboratories, Livermore, CA, USA
    +
    27===================================================================================== */
    +
    31
    +
    32#ifndef POST_H_SEEN
    +
    33#define POST_H_SEEN
    +
    34
    +
    35#include "Array1D.h"
    +
    36#include "Array2D.h"
    +
    37#include "mrv.h"
    +
    38
    +
    39#include <iostream>
    +
    40#include <string.h>
    +
    41#include <stdio.h>
    +
    42#include <sstream>
    +
    43
    +
    44using namespace std; // needed for python string conversion
    +
    45
    +
    47
    +
    +
    48class Post {
    +
    49public:
    +
    50
    +
    52 Post();
    +
    54 ~Post() {}
    +
    55
    +
    57 void setData(Array2D<double>& xdata,Array2D<double>& ydata);
    +
    59 void setData(Array2D<double>& xdata,Array1D<Array1D<double> >& ydata);
    +
    61 void setDataNoise(Array1D<double>& sigma);
    +
    63 void inferDataNoise();
    +
    65 void inferLogDataNoise();
    +
    67 Array1D<double> dataSigma(double m_last);
    +
    69 void setModel(Array1D< Array2D<double> (*)(Array2D<double>&, Array2D<double>&, Array2D<double>&, void *) > forwardFuncs, Array2D<double>& fixindnom, void* funcInfo);
    +
    71 void setModelRVinput(int pdim, int order, Array1D<int>& rndInd,string pdfType,string pcType);
    +
    73 int getChainDim();
    +
    75 void setPrior(string priorType, double priora, double priorb);
    +
    77 double evalLogPrior(Array1D<double>& m);
    +
    79 Array2D<double> getParamPCcf(Array1D<double>& m);
    +
    81 Array2D<double> samParam(Array1D<double>& m, int ns);
    +
    83 void momParam(Array1D<double>& m, Array1D<double>& parMean, Array1D<double>& parVar, bool covFlag, Array2D<double>& parCov);
    +
    85 Array2D<double> samForwardFcn(Array2D<double> (*forwardFunc)(Array2D<double>&, Array2D<double>&, Array2D<double>&, void*),Array1D<double>& m, Array2D<double>& xgrid, int ns);
    +
    87 void momForwardFcn(Array2D<double> (*forwardFunc)(Array2D<double>&, Array2D<double>&, Array2D<double>&, void*),Array1D<double>& m, Array2D<double>& xgrid, Array1D<double>& fcnMean, Array1D<double>& fcnVar, bool covflag, Array2D<double>& fcnCov);
    +
    89 void momForwardFcn(Array1D<double>& m, Array2D<double>& xgrid, Array1D<double>& fcnMean, Array1D<double>& fcnVar, bool covflag, Array2D<double>& fcnCov);
    +
    91 virtual double evalLogLik(Array1D<double>& m){return 0;};
    +
    92
    +
    93
    +
    94protected:
    +
    96 Array2D<double> xData_;
    +
    98 Array1D<Array1D<double>> yData_;
    +
    100 Array1D<double> yDatam_;
    +
    102 int nData_;
    +
    104 Array1D<int> nEachs_;
    +
    106 int xDim_;
    +
    108 int pDim_;
    +
    110 int chDim_;
    +
    112 bool inferDataNoise_;
    +
    114 bool dataNoiseLogFlag_;
    +
    116 Array1D<double> dataNoiseSig_;
    +
    118 //Array2D<double> (*forwardFcn_)(Array2D<double>&, Array2D<double>&, Array2D<double>&, void*);
    +
    119 Array1D< Array2D<double> (*)(Array2D<double>&, Array2D<double>&, Array2D<double>&, void *) > forwardFcns_;
    +
    121 void* funcinfo_;
    +
    123 int extraInferredParams_;
    +
    125 int ncat_;
    +
    126
    +
    128 Mrv * Mrv_;
    +
    130 Array1D<int> rndInd_;
    +
    132 Array2D<double> fixIndNom_;
    +
    134 Array1D<double> lower_,upper_;
    +
    136 string pdfType_;
    +
    138 string rvpcType_;
    +
    140 string priorType_;
    +
    142 double priora_;
    +
    144 double priorb_;
    +
    145
    +
    146 private:
    +
    147
    +
    149 int verbosity_;
    +
    150
    +
    151};
    +
    +
    152
    +
    153/*******************************************************************/
    +
    154/*******************************************************************/
    +
    155/*******************************************************************/
    +
    156
    +
    +
    159class Lik_Full: public Post {
    +
    160public:
    +
    162 Lik_Full(double bdw,int nsam){this->bdw_=bdw; this->nsam_=nsam; return;}
    +
    164 ~Lik_Full(){};
    +
    165
    +
    167 double evalLogLik(Array1D<double>& m);
    +
    168
    +
    169 private:
    +
    171 double bdw_;
    +
    173 int nsam_;
    +
    174};
    +
    +
    175
    +
    176/*******************************************************************/
    +
    177/*******************************************************************/
    +
    178/*******************************************************************/
    +
    179
    +
    +
    182class Lik_Marg: public Post {
    +
    183public:
    +
    185 Lik_Marg(double bdw,int nsam){this->bdw_=bdw; this->nsam_=nsam; return;}
    +
    187 ~Lik_Marg(){};
    +
    188
    +
    190 double evalLogLik(Array1D<double>& m);
    +
    191
    +
    192 private:
    +
    194 double bdw_;
    +
    196 int nsam_;
    +
    197
    +
    198};
    +
    +
    199
    +
    200/*******************************************************************/
    +
    201/*******************************************************************/
    +
    202/*******************************************************************/
    +
    203
    +
    +
    206class Lik_MVN: public Post {
    +
    207public:
    +
    209 Lik_MVN(double nugget){this->nugget_=nugget; return;}
    +
    211 ~Lik_MVN(){};
    +
    212
    +
    214 double evalLogLik(Array1D<double>& m);
    +
    215
    +
    216 private:
    +
    218 double nugget_;
    +
    219
    +
    220};
    +
    +
    221
    +
    222/*******************************************************************/
    +
    223
    +
    +
    226class Lik_GausMarg: public Post {
    +
    227public:
    +
    229 Lik_GausMarg(){return;}
    +
    231 ~Lik_GausMarg(){};
    +
    232
    +
    234 double evalLogLik(Array1D<double>& m);
    +
    235
    +
    236};
    +
    +
    237
    +
    238/*******************************************************************/
    +
    239
    +
    +
    242class Lik_GausMargD: public Post {
    +
    243public:
    +
    245 Lik_GausMargD(){return;}
    +
    247 ~Lik_GausMargD(){};
    +
    248
    +
    250 double evalLogLik(Array1D<double>& m);
    +
    251
    +
    252};
    +
    +
    253
    +
    254/*******************************************************************/
    +
    255
    +
    +
    258class Lik_ABC: public Post {
    +
    259public:
    +
    261 Lik_ABC(double eps){this->abceps_=eps; return;}
    +
    263 ~Lik_ABC(){};
    +
    264
    +
    266 double evalLogLik(Array1D<double>& m);
    +
    267
    +
    268private:
    +
    270 double abceps_;
    +
    271
    +
    272};
    +
    +
    273
    +
    274/*******************************************************************/
    +
    275
    +
    +
    278class Lik_ABCm: public Post {
    +
    279public:
    +
    281 Lik_ABCm(double eps){this->abceps_=eps; return;}
    +
    283 ~Lik_ABCm(){};
    +
    284
    +
    286 double evalLogLik(Array1D<double>& m);
    +
    287
    +
    288private:
    +
    290 double abceps_;
    +
    291
    +
    292};
    +
    +
    293
    +
    294/*******************************************************************/
    +
    295
    +
    +
    298class Lik_Koh: public Post {
    +
    299public:
    +
    301 Lik_Koh(double corLength){ this->extraInferredParams_=1;this->corLength_=corLength; return;}
    +
    303 ~Lik_Koh(){};
    +
    304
    +
    306 double evalLogLik(Array1D<double>& m);
    +
    307private:
    +
    308 double corLength_;
    +
    309
    +
    310};
    +
    +
    311
    +
    312/*******************************************************************/
    +
    313
    +
    +
    316class Lik_Classical: public Post {
    +
    317public:
    +
    319 Lik_Classical(){ return;}
    +
    321 ~Lik_Classical(){};
    +
    322
    +
    324 double evalLogLik(Array1D<double>& m);
    +
    325
    +
    326
    +
    327};
    +
    +
    328
    +
    329/*******************************************************************/
    +
    +
    332class Lik_Eov: public Post {
    +
    333public:
    +
    335 Lik_Eov(){ return;}
    +
    337 ~Lik_Eov(){};
    +
    338
    +
    340 double evalLogLik(Array1D<double>& m);
    +
    341
    +
    342
    +
    343};
    +
    +
    344
    +
    345/*******************************************************************/
    +
    346
    +
    347#endif /* POST_H_SEEN */
    +
    Array1D.h
    1D Array class for any type T
    +
    Array2D.h
    2D Array class for any type T
    +
    Array1D
    Stores data of any type T in a 1D array.
    Definition Array1D.h:61
    +
    Array2D
    Stores data of any type T in a 2D array.
    Definition Array2D.h:60
    +
    Lik_ABC
    Derived class for ABC likelihood.
    Definition post.h:258
    +
    Lik_ABC::evalLogLik
    double evalLogLik(Array1D< double > &m)
    Evaluate log-likelihood.
    Definition post.cpp:623
    +
    Lik_ABC::Lik_ABC
    Lik_ABC(double eps)
    Constructor given ABC epsilon.
    Definition post.h:261
    +
    Lik_ABC::~Lik_ABC
    ~Lik_ABC()
    Destructor.
    Definition post.h:263
    +
    Lik_ABC::abceps_
    double abceps_
    ABC epsilon.
    Definition post.h:270
    +
    Lik_ABCm
    Derived class for ABC-mean likelihood.
    Definition post.h:278
    +
    Lik_ABCm::~Lik_ABCm
    ~Lik_ABCm()
    Destructor.
    Definition post.h:283
    +
    Lik_ABCm::Lik_ABCm
    Lik_ABCm(double eps)
    Constructor given ABC epsilon.
    Definition post.h:281
    +
    Lik_ABCm::abceps_
    double abceps_
    ABC epsilon.
    Definition post.h:290
    +
    Lik_ABCm::evalLogLik
    double evalLogLik(Array1D< double > &m)
    Evaluate log-likelihood.
    Definition post.cpp:662
    +
    Lik_Classical
    Derived class for classical likelihood.
    Definition post.h:316
    +
    Lik_Classical::evalLogLik
    double evalLogLik(Array1D< double > &m)
    Evaluate log-likelihood.
    Definition post.cpp:741
    +
    Lik_Classical::Lik_Classical
    Lik_Classical()
    Constructor.
    Definition post.h:319
    +
    Lik_Classical::~Lik_Classical
    ~Lik_Classical()
    Destructor.
    Definition post.h:321
    +
    Lik_Eov
    Derived class for error-in-variable likelihood.
    Definition post.h:332
    +
    Lik_Eov::evalLogLik
    double evalLogLik(Array1D< double > &m)
    Evaluate log-likelihood.
    Definition post.cpp:774
    +
    Lik_Eov::Lik_Eov
    Lik_Eov()
    Constructor.
    Definition post.h:335
    +
    Lik_Eov::~Lik_Eov
    ~Lik_Eov()
    Destructor.
    Definition post.h:337
    +
    Lik_Full
    Derived class for full likelihood.
    Definition post.h:159
    +
    Lik_Full::~Lik_Full
    ~Lik_Full()
    Destructor.
    Definition post.h:164
    +
    Lik_Full::bdw_
    double bdw_
    KDE bandwidth.
    Definition post.h:171
    +
    Lik_Full::nsam_
    int nsam_
    KDE sample size.
    Definition post.h:173
    +
    Lik_Full::evalLogLik
    double evalLogLik(Array1D< double > &m)
    Evaluate log-likelihood.
    Definition post.cpp:437
    +
    Lik_Full::Lik_Full
    Lik_Full(double bdw, int nsam)
    Constructor given KDE bandwidth and sample size.
    Definition post.h:162
    +
    Lik_GausMargD
    Derived class for gaussian-marginal likelihood with discrete parameter.
    Definition post.h:242
    +
    Lik_GausMargD::~Lik_GausMargD
    ~Lik_GausMargD()
    Destructor.
    Definition post.h:247
    +
    Lik_GausMargD::Lik_GausMargD
    Lik_GausMargD()
    Constructor.
    Definition post.h:245
    +
    Lik_GausMargD::evalLogLik
    double evalLogLik(Array1D< double > &m)
    Evaluate log-likelihood.
    +
    Lik_GausMarg
    Derived class for gaussian-marginal likelihood.
    Definition post.h:226
    +
    Lik_GausMarg::Lik_GausMarg
    Lik_GausMarg()
    Constructor.
    Definition post.h:229
    +
    Lik_GausMarg::~Lik_GausMarg
    ~Lik_GausMarg()
    Destructor.
    Definition post.h:231
    +
    Lik_GausMarg::evalLogLik
    double evalLogLik(Array1D< double > &m)
    Evaluate log-likelihood.
    Definition post.cpp:589
    +
    Lik_Koh
    Derived class for Kennedy-O'Hagan likelihood.
    Definition post.h:298
    +
    Lik_Koh::Lik_Koh
    Lik_Koh(double corLength)
    Constructor given correlation length.
    Definition post.h:301
    +
    Lik_Koh::evalLogLik
    double evalLogLik(Array1D< double > &m)
    Evaluate log-likelihood.
    Definition post.cpp:694
    +
    Lik_Koh::corLength_
    double corLength_
    Definition post.h:308
    +
    Lik_Koh::~Lik_Koh
    ~Lik_Koh()
    Destructor.
    Definition post.h:303
    +
    Lik_MVN
    Derived class for mvn likelihood.
    Definition post.h:206
    +
    Lik_MVN::evalLogLik
    double evalLogLik(Array1D< double > &m)
    Evaluate log-likelihood.
    Definition post.cpp:556
    +
    Lik_MVN::nugget_
    double nugget_
    Nugget size.
    Definition post.h:218
    +
    Lik_MVN::~Lik_MVN
    ~Lik_MVN()
    Destructor.
    Definition post.h:211
    +
    Lik_MVN::Lik_MVN
    Lik_MVN(double nugget)
    Constructor given fiagonal nugget.
    Definition post.h:209
    +
    Lik_Marg
    Derived class for marginal likelihood.
    Definition post.h:182
    +
    Lik_Marg::nsam_
    int nsam_
    KDE sample size.
    Definition post.h:196
    +
    Lik_Marg::bdw_
    double bdw_
    KDE bandwidth.
    Definition post.h:194
    +
    Lik_Marg::Lik_Marg
    Lik_Marg(double bdw, int nsam)
    Constructor given KDE bandwidth and sample size.
    Definition post.h:185
    +
    Lik_Marg::~Lik_Marg
    ~Lik_Marg()
    Destructor.
    Definition post.h:187
    +
    Lik_Marg::evalLogLik
    double evalLogLik(Array1D< double > &m)
    Evaluate log-likelihood.
    Definition post.cpp:497
    +
    Mrv
    multivariate RV parameterized by PC expansions
    Definition mrv.h:48
    +
    Post
    posterior evaluation with various likelihood and prior options
    Definition post.h:48
    +
    Post::yDatam_
    Array1D< double > yDatam_
    ydata averaged per measurement
    Definition post.h:100
    +
    Post::xData_
    Array2D< double > xData_
    xdata
    Definition post.h:96
    +
    Post::yData_
    Array1D< Array1D< double > > yData_
    ydata
    Definition post.h:98
    +
    Post::Post
    Post()
    Constructor.
    Definition post.cpp:51
    +
    Post::funcinfo_
    void * funcinfo_
    Auxiliary information for function evaluation.
    Definition post.h:121
    +
    Post::dataNoiseSig_
    Array1D< double > dataNoiseSig_
    Data noise stdev.
    Definition post.h:116
    +
    Post::setModel
    void setModel(Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFuncs, Array2D< double > &fixindnom, void *funcInfo)
    Set a pointer to the forward model f(p,x)
    Definition post.cpp:153
    +
    Post::inferLogDataNoise
    void inferLogDataNoise()
    Indicate inference of log of data noise stdev.
    Definition post.cpp:123
    +
    Post::upper_
    Array1D< double > upper_
    Definition post.h:134
    +
    Post::dataSigma
    Array1D< double > dataSigma(double m_last)
    Get data noise, whether inferred or fixed.
    Definition post.cpp:133
    +
    Post::dataNoiseLogFlag_
    bool dataNoiseLogFlag_
    Flag to check if data noise logarithm is used.
    Definition post.h:114
    +
    Post::setModelRVinput
    void setModelRVinput(int pdim, int order, Array1D< int > &rndInd, string pdfType, string pcType)
    Set model input parameters' randomization scheme.
    Definition post.cpp:163
    +
    Post::forwardFcns_
    Array1D< Array2D< double >(*)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *) > forwardFcns_
    Pointer to the forward function f(p,x)
    Definition post.h:119
    +
    Post::priora_
    double priora_
    Prior parameter #1.
    Definition post.h:142
    +
    Post::nEachs_
    Array1D< int > nEachs_
    Number of samples at each input.
    Definition post.h:104
    +
    Post::setDataNoise
    void setDataNoise(Array1D< double > &sigma)
    Set the magnitude of data noise.
    Definition post.cpp:98
    +
    Post::nData_
    int nData_
    Number of data points.
    Definition post.h:102
    +
    Post::verbosity_
    int verbosity_
    Verbosity level.
    Definition post.h:149
    +
    Post::lower_
    Array1D< double > lower_
    Lower and upper bounds on parameters.
    Definition post.h:134
    +
    Post::~Post
    ~Post()
    Destructor.
    Definition post.h:54
    +
    Post::pDim_
    int pDim_
    Dimensionality of parameter space (p-space)
    Definition post.h:108
    +
    Post::chDim_
    int chDim_
    Dimensionality of posterior input.
    Definition post.h:110
    +
    Post::rndInd_
    Array1D< int > rndInd_
    Indices of randomized inputs.
    Definition post.h:130
    +
    Post::evalLogPrior
    double evalLogPrior(Array1D< double > &m)
    Evaluate log-prior.
    Definition post.cpp:211
    +
    Post::samParam
    Array2D< double > samParam(Array1D< double > &m, int ns)
    Sample model parameters given posterior input.
    Definition post.cpp:338
    +
    Post::fixIndNom_
    Array2D< double > fixIndNom_
    Indices and nominal values for fixed inputs.
    Definition post.h:132
    +
    Post::inferDataNoise_
    bool inferDataNoise_
    Flag for data noise inference.
    Definition post.h:112
    +
    Post::getChainDim
    int getChainDim()
    Get the dimensionailty of the posterior function.
    Definition post.cpp:195
    +
    Post::momParam
    void momParam(Array1D< double > &m, Array1D< double > &parMean, Array1D< double > &parVar, bool covFlag, Array2D< double > &parCov)
    Get moments of parameters given posterior input.
    Definition post.cpp:348
    +
    Post::setPrior
    void setPrior(string priorType, double priora, double priorb)
    Set the prior type and its parameters.
    Definition post.cpp:201
    +
    Post::extraInferredParams_
    int extraInferredParams_
    Number of extra inferred parameters, such as data noise or Koh variance.
    Definition post.h:123
    +
    Post::setData
    void setData(Array2D< double > &xdata, Array2D< double > &ydata)
    Set the x- and y-data.
    Definition post.cpp:58
    +
    Post::xDim_
    int xDim_
    Dimensionality of x-space.
    Definition post.h:106
    +
    Post::samForwardFcn
    Array2D< double > samForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, int ns)
    Sample forward function at a given grid for given posterior input.
    Definition post.cpp:360
    +
    Post::priorb_
    double priorb_
    Prior parameter #2.
    Definition post.h:144
    +
    Post::ncat_
    int ncat_
    Number of categories.
    Definition post.h:125
    +
    Post::priorType_
    string priorType_
    Prior type.
    Definition post.h:140
    +
    Post::Mrv_
    Mrv * Mrv_
    Pointer to a multivariate PC RV object.
    Definition post.h:128
    +
    Post::evalLogLik
    virtual double evalLogLik(Array1D< double > &m)
    Dummy evaluation of log-likelihood.
    Definition post.h:91
    +
    Post::pdfType_
    string pdfType_
    Input parameter PDF type.
    Definition post.h:136
    +
    Post::momForwardFcn
    void momForwardFcn(Array2D< double >(*forwardFunc)(Array2D< double > &, Array2D< double > &, Array2D< double > &, void *), Array1D< double > &m, Array2D< double > &xgrid, Array1D< double > &fcnMean, Array1D< double > &fcnVar, bool covflag, Array2D< double > &fcnCov)
    Get moments of forward function at a given grid for given posterior input.
    Definition post.cpp:372
    +
    Post::rvpcType_
    string rvpcType_
    PC type parameter for the r.v.
    Definition post.h:138
    +
    Post::getParamPCcf
    Array2D< double > getParamPCcf(Array1D< double > &m)
    Extract parameter PC coefficients from a posterior input.
    Definition post.cpp:326
    +
    Post::inferDataNoise
    void inferDataNoise()
    Indicate inference of data noise stdev.
    Definition post.cpp:111
    +
    mrv.h
    Header for multivariate random variable class.
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/probability_8cpp.html b/docs/html/probability_8cpp.html new file mode 100644 index 00000000..1020ffd1 --- /dev/null +++ b/docs/html/probability_8cpp.html @@ -0,0 +1,983 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: probability.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Functions
    +
    probability.cpp File Reference
    +
    +
    + +

    Probability and random number generation- related tools. +More...

    +
    #include <math.h>
    +#include <iostream>
    +#include <float.h>
    +#include <limits.h>
    +#include "Array1D.h"
    +#include "Array2D.h"
    +#include "probability.h"
    +#include "rosenblatt.h"
    +#include "combin.h"
    +#include "arraytools.h"
    +#include "gen_defs.h"
    +#include "minmax.h"
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Functions

    double erff (const double x)
     An implementation of error function using incomplete gamma function.
     
    double inverf (double y0)
     Inverse error function, input scaled to [-1,1].
     
    double invnormcdf (double y)
     Inverse of the CDF of the normal random variable, uses inverf.
     
    double normcdf (double y)
     Normal random variable CDF.
     
    double normcdfc (double y)
     Complementary function for normcdf.
     
    void generate_uniform (double *rvar, int ns, int nd, int zSeed)
     Generates a vector of i.i.d. uniform(0,1) random variable samples of size ns*nd, given integer seed.
     
    void generate_uniform (Array2D< double > &rvar, int zSeed)
     Generates a matrix of i.i.d. uniform(0,1) random variable samples, given integer seed.
     
    void generate_uniform (double *rvar, int ns, int nd, dsfmt_t *rnstate)
     Generates a vector of i.i.d. uniform(0,1) random variable samples of size ns*nd, given pointer to the state of current random number generator.
     
    void generate_uniform (Array2D< double > &rvar, dsfmt_t *rnstate)
     Generates a matrix of i.i.d. uniform(0,1) random variable samples, given pointer to the state of current random number generator.
     
    void generate_uniform_lhs (double *rvar, int nsample, int ndim, int zSeed)
     Generates a vector of i.i.d. uniform(0,1) random variable LHS samples of size ns*nd, given integer seed.
     
    void generate_uniform_lhs (Array2D< double > &rvar, int zSeed)
     Generates a matrix of i.i.d. uniform(0,1) random variable LHS samples, given integer seed.
     
    void generate_uniform_lhs (double *rvar, int nsample, int ndim, dsfmt_t *rnstate)
     Generates a vector of i.i.d. uniform(0,1) random variable LHS samples of size ns*nd, given pointer to the state of current random number generator.
     
    void generate_uniform_lhs (Array2D< double > &rvar, dsfmt_t *rnstate)
     Generates a matrix of i.i.d. uniform(0,1) random variable LHS samples, given pointer to the state of current random number generator.
     
    void generate_normal (Array2D< double > &rvar, int zSeed)
     Generates a matrix of i.i.d. normal(0,1) random variable samples.
     
    void generate_normal_lhs (Array2D< double > &rvar, int zSeed)
     Generates a matrix of i.i.d. normal(0,1) random variable LHS samples.
     
    double get_median (const Array1D< double > &data)
     Returns the median of a data array.
     
    double get_mean (const Array1D< double > &data)
     Returns the mean of a 1D data array.
     
    double get_mean (const Array2D< double > &data)
     Returns the mean of a 2D data array.
     
    double get_std (const Array1D< double > &data)
     Returns the std of a data array.
     
    double get_var (const Array1D< double > &data)
     Returns the std of a data array.
     
    double getMean_Variance (Array2D< double > &data_c, Array1D< double > &w, Array1D< double > &mean)
     Vector-mean and weighted variance.
     
    void getMean (Array2D< double > &data_c, Array1D< double > &mean)
     Vector mean, column by column.
     
    void getMean (Array2D< double > &matrix, Array1D< double > &mean, char *RC)
     Vector mean, either column by column for RC="C" or row by row for RC="R".
     
    void rperm (int n, int *a, dsfmt_t *rnstate)
     Random permutation of 0..n-1.
     
    void getPdf_figtree (Array2D< double > &source, Array2D< double > &target, Array1D< double > &sig, Array1D< double > &density, Array1D< double > &weight)
     KDE estimation of a PDF.
     
    void getPdf_cl (Array2D< double > &data, Array2D< double > &points, Array1D< double > &dens, int ncl, double sfac)
     Compute the PDF of data at the given points using given number of clusters (if ncl=0, then find the optimal cluster number) and a scale factor for the optimal bandwidth.
     
    double covariance (Array1D< double > &x1, Array1D< double > &x2, Array1D< double > &param, string covtype)
     Compute a few standard covariance functions C(x_1,x_2)
     
    void ihsU (Array2D< double > &rndnos, const int dfac, dsfmt_t *rnstate)
     
    void ihsU (const int ndim, const int ns, double *rndnos, const int dfac, dsfmt_t *rnstate)
     
    void ihsP (const int ndim, const int ns, int *x, const int dupl, dsfmt_t *rnstate)
     
    void distCorr (const Array2D< double > &spl, Array2D< double > &dCor)
     Compute distance correlation factors given a set of samples (no. of rows in spl) from a collection of random variables (no. of columns in spl). dCor(i,j), with i>j stores the distance correlation values between random variables i and j.
     
    +

    Detailed Description

    +

    Probability and random number generation- related tools.

    +

    Function Documentation

    + +

    ◆ covariance()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    double covariance (Array1D< double > & x1,
    Array1D< double > & x2,
    Array1D< double > & param,
    string covtype )
    +
    + +

    Compute a few standard covariance functions C(x_1,x_2)

    + +
    +
    + +

    ◆ distCorr()

    + +
    +
    + + + + + + + + + + + +
    void distCorr (const Array2D< double > & spl,
    Array2D< double > & dCor )
    +
    + +

    Compute distance correlation factors given a set of samples (no. of rows in spl) from a collection of random variables (no. of columns in spl). dCor(i,j), with i>j stores the distance correlation values between random variables i and j.

    + +
    +
    + +

    ◆ erff()

    + +
    +
    + + + + + + + +
    double erff (const double x)
    +
    + +

    An implementation of error function using incomplete gamma function.

    + +
    +
    + +

    ◆ generate_normal()

    + +
    +
    + + + + + + + + + + + +
    void generate_normal (Array2D< double > & rvar,
    int zSeed )
    +
    + +

    Generates a matrix of i.i.d. normal(0,1) random variable samples.

    + +
    +
    + +

    ◆ generate_normal_lhs()

    + +
    +
    + + + + + + + + + + + +
    void generate_normal_lhs (Array2D< double > & rvar,
    int zSeed )
    +
    + +

    Generates a matrix of i.i.d. normal(0,1) random variable LHS samples.

    +
    Todo
    LHS generation is far from optimal, it is quite slow
    + +
    +
    + +

    ◆ generate_uniform() [1/4]

    + +
    +
    + + + + + + + + + + + +
    void generate_uniform (Array2D< double > & rvar,
    dsfmt_t * rnstate )
    +
    + +

    Generates a matrix of i.i.d. uniform(0,1) random variable samples, given pointer to the state of current random number generator.

    + +
    +
    + +

    ◆ generate_uniform() [2/4]

    + +
    +
    + + + + + + + + + + + +
    void generate_uniform (Array2D< double > & rvar,
    int zSeed )
    +
    + +

    Generates a matrix of i.i.d. uniform(0,1) random variable samples, given integer seed.

    + +
    +
    + +

    ◆ generate_uniform() [3/4]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void generate_uniform (double * rvar,
    int ns,
    int nd,
    dsfmt_t * rnstate )
    +
    + +

    Generates a vector of i.i.d. uniform(0,1) random variable samples of size ns*nd, given pointer to the state of current random number generator.

    + +
    +
    + +

    ◆ generate_uniform() [4/4]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void generate_uniform (double * rvar,
    int ns,
    int nd,
    int zSeed )
    +
    + +

    Generates a vector of i.i.d. uniform(0,1) random variable samples of size ns*nd, given integer seed.

    + +
    +
    + +

    ◆ generate_uniform_lhs() [1/4]

    + +
    +
    + + + + + + + + + + + +
    void generate_uniform_lhs (Array2D< double > & rvar,
    dsfmt_t * rnstate )
    +
    + +

    Generates a matrix of i.i.d. uniform(0,1) random variable LHS samples, given pointer to the state of current random number generator.

    + +
    +
    + +

    ◆ generate_uniform_lhs() [2/4]

    + +
    +
    + + + + + + + + + + + +
    void generate_uniform_lhs (Array2D< double > & rvar,
    int zSeed )
    +
    + +

    Generates a matrix of i.i.d. uniform(0,1) random variable LHS samples, given integer seed.

    + +
    +
    + +

    ◆ generate_uniform_lhs() [3/4]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void generate_uniform_lhs (double * rvar,
    int nsample,
    int ndim,
    dsfmt_t * rnstate )
    +
    + +

    Generates a vector of i.i.d. uniform(0,1) random variable LHS samples of size ns*nd, given pointer to the state of current random number generator.

    + +
    +
    + +

    ◆ generate_uniform_lhs() [4/4]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void generate_uniform_lhs (double * rvar,
    int nsample,
    int ndim,
    int zSeed )
    +
    + +

    Generates a vector of i.i.d. uniform(0,1) random variable LHS samples of size ns*nd, given integer seed.

    + +
    +
    + +

    ◆ get_mean() [1/2]

    + +
    +
    + + + + + + + +
    double get_mean (const Array1D< double > & data)
    +
    + +

    Returns the mean of a 1D data array.

    + +
    +
    + +

    ◆ get_mean() [2/2]

    + +
    +
    + + + + + + + +
    double get_mean (const Array2D< double > & data)
    +
    + +

    Returns the mean of a 2D data array.

    + +
    +
    + +

    ◆ get_median()

    + +
    +
    + + + + + + + +
    double get_median (const Array1D< double > & data)
    +
    + +

    Returns the median of a data array.

    + +
    +
    + +

    ◆ get_std()

    + +
    +
    + + + + + + + +
    double get_std (const Array1D< double > & data)
    +
    + +

    Returns the std of a data array.

    + +
    +
    + +

    ◆ get_var()

    + +
    +
    + + + + + + + +
    double get_var (const Array1D< double > & data)
    +
    + +

    Returns the std of a data array.

    + +
    +
    + +

    ◆ getMean() [1/2]

    + +
    +
    + + + + + + + + + + + +
    void getMean (Array2D< double > & data_c,
    Array1D< double > & mean )
    +
    + +

    Vector mean, column by column.

    + +
    +
    + +

    ◆ getMean() [2/2]

    + +
    +
    + + + + + + + + + + + + + + + + +
    void getMean (Array2D< double > & matrix,
    Array1D< double > & mean,
    char * RC )
    +
    + +

    Vector mean, either column by column for RC="C" or row by row for RC="R".

    + +
    +
    + +

    ◆ getMean_Variance()

    + +
    +
    + + + + + + + + + + + + + + + + +
    double getMean_Variance (Array2D< double > & data_c,
    Array1D< double > & w,
    Array1D< double > & mean )
    +
    + +

    Vector-mean and weighted variance.

    + +
    +
    + +

    ◆ getPdf_cl()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void getPdf_cl (Array2D< double > & data,
    Array2D< double > & points,
    Array1D< double > & dens,
    int ncl,
    double sfac )
    +
    + +

    Compute the PDF of data at the given points using given number of clusters (if ncl=0, then find the optimal cluster number) and a scale factor for the optimal bandwidth.

    + +
    +
    + +

    ◆ getPdf_figtree()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void getPdf_figtree (Array2D< double > & source,
    Array2D< double > & target,
    Array1D< double > & sig,
    Array1D< double > & density,
    Array1D< double > & weight )
    +
    + +

    KDE estimation of a PDF.

    + +
    +
    + +

    ◆ ihsP()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void ihsP (const int ndim,
    const int ns,
    int * x,
    const int dupl,
    dsfmt_t * rnstate )
    +
    + +
    +
    + +

    ◆ ihsU() [1/2]

    + +
    +
    + + + + + + + + + + + + + + + + +
    void ihsU (Array2D< double > & rndnos,
    const int dfac,
    dsfmt_t * rnstate )
    +
    + +
    +
    + +

    ◆ ihsU() [2/2]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void ihsU (const int ndim,
    const int ns,
    double * rndnos,
    const int dfac,
    dsfmt_t * rnstate )
    +
    + +
    +
    + +

    ◆ inverf()

    + +
    +
    + + + + + + + +
    double inverf (double y0)
    +
    + +

    Inverse error function, input scaled to [-1,1].

    +
    Note
    Cephes Math Library Release 2.8: June, 2000. Copyright 1984, 1987, 1988, 1992, 2000 by Stephen L. Moshier
    + +
    +
    + +

    ◆ invnormcdf()

    + +
    +
    + + + + + + + +
    double invnormcdf (double y)
    +
    + +

    Inverse of the CDF of the normal random variable, uses inverf.

    + +
    +
    + +

    ◆ normcdf()

    + +
    +
    + + + + + + + +
    double normcdf (double y)
    +
    + +

    Normal random variable CDF.

    + +
    +
    + +

    ◆ normcdfc()

    + +
    +
    + + + + + + + +
    double normcdfc (double y)
    +
    + +

    Complementary function for normcdf.

    + +
    +
    + +

    ◆ rperm()

    + +
    +
    + + + + + + + + + + + + + + + + +
    void rperm (int n,
    int * a,
    dsfmt_t * rnstate )
    +
    + +

    Random permutation of 0..n-1.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/probability_8h.html b/docs/html/probability_8h.html new file mode 100644 index 00000000..41ee62b7 --- /dev/null +++ b/docs/html/probability_8h.html @@ -0,0 +1,1000 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: probability.h File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros | +Functions
    +
    probability.h File Reference
    +
    +
    + +

    Header for probability and random number generation- related tools. +More...

    +
    #include "Array1D.h"
    +#include "Array2D.h"
    +#include "dsfmt_add.h"
    +#include "KCenterClustering.h"
    +#include "figtree_internal.h"
    +
    +

    Go to the source code of this file.

    + + + + +

    +Macros

    #define DSFMT_DO_NOT_USE_OLD_NAMES
     
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Functions

    double erff (const double x)
     An implementation of error function using incomplete gamma function.
     
    double inverf (double y0)
     Inverse error function, input scaled to [-1,1].
     
    double invnormcdf (double y)
     Inverse of the CDF of the normal random variable, uses inverf.
     
    double normcdf (double y)
     Normal random variable CDF.
     
    double normcdfc (double y)
     Complementary function for normcdf.
     
    void generate_uniform (double *rvar, int ns, int nd, int zSeed)
     Generates a vector of i.i.d. uniform(0,1) random variable samples of size ns*nd, given integer seed.
     
    void generate_uniform (Array2D< double > &rvar, int zSeed)
     Generates a matrix of i.i.d. uniform(0,1) random variable samples, given integer seed.
     
    void generate_uniform (double *rvar, int ns, int nd, dsfmt_t *rnstate)
     Generates a vector of i.i.d. uniform(0,1) random variable samples of size ns*nd, given pointer to the state of current random number generator.
     
    void generate_uniform (Array2D< double > &rvar, dsfmt_t *rnstate)
     Generates a matrix of i.i.d. uniform(0,1) random variable samples, given pointer to the state of current random number generator.
     
    void generate_uniform_lhs (double *rvar, int ns, int nd, int zSeed)
     Generates a vector of i.i.d. uniform(0,1) random variable LHS samples of size ns*nd, given integer seed.
     
    void generate_uniform_lhs (Array2D< double > &rvar, int zSeed)
     Generates a matrix of i.i.d. uniform(0,1) random variable LHS samples, given integer seed.
     
    void generate_uniform_lhs (double *rvar, int ns, int nd, dsfmt_t *rnstate)
     Generates a vector of i.i.d. uniform(0,1) random variable LHS samples of size ns*nd, given pointer to the state of current random number generator.
     
    void generate_uniform_lhs (Array2D< double > &rvar, dsfmt_t *rnstate)
     Generates a matrix of i.i.d. uniform(0,1) random variable LHS samples, given pointer to the state of current random number generator.
     
    void generate_normal (Array2D< double > &rvar, int zSeed)
     Generates a matrix of i.i.d. normal(0,1) random variable samples.
     
    void generate_normal_lhs (Array2D< double > &rvar, int zSeed)
     Generates a matrix of i.i.d. normal(0,1) random variable LHS samples.
     
    double get_median (const Array1D< double > &data)
     Returns the median of a data array.
     
    double get_mean (const Array1D< double > &data)
     Returns the mean of a 1D data array.
     
    double get_mean (const Array2D< double > &data)
     Returns the mean of a 2D data array.
     
    double get_std (const Array1D< double > &data)
     Returns the std of a data array.
     
    double get_var (const Array1D< double > &data)
     Returns the std of a data array.
     
    double getMean_Variance (Array2D< double > &data_c, Array1D< double > &w, Array1D< double > &mean)
     Vector-mean and weighted variance.
     
    void getMean (Array2D< double > &data_c, Array1D< double > &mean)
     Vector mean, column by column.
     
    void getMean (Array2D< double > &data_c, Array1D< double > &mean, char *RC)
     Vector mean, either column by column for RC="C" or row by row for RC="R".
     
    void rperm (int n, int *a, dsfmt_t *rnstate)
     Random permutation of 0..n-1.
     
    void getPdf_figtree (Array2D< double > &source, Array2D< double > &target, Array1D< double > &sig, Array1D< double > &density, Array1D< double > &weight)
     KDE estimation of a PDF.
     
    void getPdf_cl (Array2D< double > &data, Array2D< double > &points, Array1D< double > &dens, int ncl, double sfac)
     Compute the PDF of data at the given points using given number of clusters (if ncl=0, then find the optimal cluster number) and a scale factor for the optimal bandwidth.
     
    double covariance (Array1D< double > &x1, Array1D< double > &x2, Array1D< double > &param, string covtype)
     Compute a few standard covariance functions C(x_1,x_2)
     
    void ihsU (Array2D< double > &rndnos, int dfac, dsfmt_t *rnstate)
     
    void ihsU (int ns, int np, double *rndnos, int dfac, dsfmt_t *rnstate)
     
    void ihsP (int ns, int np, int *rpos, int dfac, dsfmt_t *rnstate)
     
    void distCorr (const Array2D< double > &spl, Array2D< double > &dCor)
     Compute distance correlation factors given a set of samples (no. of rows in spl) from a collection of random variables (no. of columns in spl). dCor(i,j), with i>j stores the distance correlation values between random variables i and j.
     
    +

    Detailed Description

    +

    Header for probability and random number generation- related tools.

    +
    Todo
    There shuold be a RNG class as a part of core UQTk - most of these functions will fit there.
    +

    Macro Definition Documentation

    + +

    ◆ DSFMT_DO_NOT_USE_OLD_NAMES

    + +
    +
    + + + + +
    #define DSFMT_DO_NOT_USE_OLD_NAMES
    +
    + +
    +
    +

    Function Documentation

    + +

    ◆ covariance()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    double covariance (Array1D< double > & x1,
    Array1D< double > & x2,
    Array1D< double > & param,
    string covtype )
    +
    + +

    Compute a few standard covariance functions C(x_1,x_2)

    + +
    +
    + +

    ◆ distCorr()

    + +
    +
    + + + + + + + + + + + +
    void distCorr (const Array2D< double > & spl,
    Array2D< double > & dCor )
    +
    + +

    Compute distance correlation factors given a set of samples (no. of rows in spl) from a collection of random variables (no. of columns in spl). dCor(i,j), with i>j stores the distance correlation values between random variables i and j.

    + +
    +
    + +

    ◆ erff()

    + +
    +
    + + + + + + + +
    double erff (const double x)
    +
    + +

    An implementation of error function using incomplete gamma function.

    + +
    +
    + +

    ◆ generate_normal()

    + +
    +
    + + + + + + + + + + + +
    void generate_normal (Array2D< double > & rvar,
    int zSeed )
    +
    + +

    Generates a matrix of i.i.d. normal(0,1) random variable samples.

    + +
    +
    + +

    ◆ generate_normal_lhs()

    + +
    +
    + + + + + + + + + + + +
    void generate_normal_lhs (Array2D< double > & rvar,
    int zSeed )
    +
    + +

    Generates a matrix of i.i.d. normal(0,1) random variable LHS samples.

    +
    Todo
    LHS generation is far from optimal, it is quite slow
    + +
    +
    + +

    ◆ generate_uniform() [1/4]

    + +
    +
    + + + + + + + + + + + +
    void generate_uniform (Array2D< double > & rvar,
    dsfmt_t * rnstate )
    +
    + +

    Generates a matrix of i.i.d. uniform(0,1) random variable samples, given pointer to the state of current random number generator.

    + +
    +
    + +

    ◆ generate_uniform() [2/4]

    + +
    +
    + + + + + + + + + + + +
    void generate_uniform (Array2D< double > & rvar,
    int zSeed )
    +
    + +

    Generates a matrix of i.i.d. uniform(0,1) random variable samples, given integer seed.

    + +
    +
    + +

    ◆ generate_uniform() [3/4]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void generate_uniform (double * rvar,
    int ns,
    int nd,
    dsfmt_t * rnstate )
    +
    + +

    Generates a vector of i.i.d. uniform(0,1) random variable samples of size ns*nd, given pointer to the state of current random number generator.

    + +
    +
    + +

    ◆ generate_uniform() [4/4]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void generate_uniform (double * rvar,
    int ns,
    int nd,
    int zSeed )
    +
    + +

    Generates a vector of i.i.d. uniform(0,1) random variable samples of size ns*nd, given integer seed.

    + +
    +
    + +

    ◆ generate_uniform_lhs() [1/4]

    + +
    +
    + + + + + + + + + + + +
    void generate_uniform_lhs (Array2D< double > & rvar,
    dsfmt_t * rnstate )
    +
    + +

    Generates a matrix of i.i.d. uniform(0,1) random variable LHS samples, given pointer to the state of current random number generator.

    + +
    +
    + +

    ◆ generate_uniform_lhs() [2/4]

    + +
    +
    + + + + + + + + + + + +
    void generate_uniform_lhs (Array2D< double > & rvar,
    int zSeed )
    +
    + +

    Generates a matrix of i.i.d. uniform(0,1) random variable LHS samples, given integer seed.

    + +
    +
    + +

    ◆ generate_uniform_lhs() [3/4]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void generate_uniform_lhs (double * rvar,
    int ns,
    int nd,
    dsfmt_t * rnstate )
    +
    + +

    Generates a vector of i.i.d. uniform(0,1) random variable LHS samples of size ns*nd, given pointer to the state of current random number generator.

    + +
    +
    + +

    ◆ generate_uniform_lhs() [4/4]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void generate_uniform_lhs (double * rvar,
    int ns,
    int nd,
    int zSeed )
    +
    + +

    Generates a vector of i.i.d. uniform(0,1) random variable LHS samples of size ns*nd, given integer seed.

    + +
    +
    + +

    ◆ get_mean() [1/2]

    + +
    +
    + + + + + + + +
    double get_mean (const Array1D< double > & data)
    +
    + +

    Returns the mean of a 1D data array.

    + +
    +
    + +

    ◆ get_mean() [2/2]

    + +
    +
    + + + + + + + +
    double get_mean (const Array2D< double > & data)
    +
    + +

    Returns the mean of a 2D data array.

    + +
    +
    + +

    ◆ get_median()

    + +
    +
    + + + + + + + +
    double get_median (const Array1D< double > & data)
    +
    + +

    Returns the median of a data array.

    + +
    +
    + +

    ◆ get_std()

    + +
    +
    + + + + + + + +
    double get_std (const Array1D< double > & data)
    +
    + +

    Returns the std of a data array.

    + +
    +
    + +

    ◆ get_var()

    + +
    +
    + + + + + + + +
    double get_var (const Array1D< double > & data)
    +
    + +

    Returns the std of a data array.

    + +
    +
    + +

    ◆ getMean() [1/2]

    + +
    +
    + + + + + + + + + + + +
    void getMean (Array2D< double > & data_c,
    Array1D< double > & mean )
    +
    + +

    Vector mean, column by column.

    + +
    +
    + +

    ◆ getMean() [2/2]

    + +
    +
    + + + + + + + + + + + + + + + + +
    void getMean (Array2D< double > & data_c,
    Array1D< double > & mean,
    char * RC )
    +
    + +

    Vector mean, either column by column for RC="C" or row by row for RC="R".

    + +
    +
    + +

    ◆ getMean_Variance()

    + +
    +
    + + + + + + + + + + + + + + + + +
    double getMean_Variance (Array2D< double > & data_c,
    Array1D< double > & w,
    Array1D< double > & mean )
    +
    + +

    Vector-mean and weighted variance.

    + +
    +
    + +

    ◆ getPdf_cl()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void getPdf_cl (Array2D< double > & data,
    Array2D< double > & points,
    Array1D< double > & dens,
    int ncl,
    double sfac )
    +
    + +

    Compute the PDF of data at the given points using given number of clusters (if ncl=0, then find the optimal cluster number) and a scale factor for the optimal bandwidth.

    + +
    +
    + +

    ◆ getPdf_figtree()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void getPdf_figtree (Array2D< double > & source,
    Array2D< double > & target,
    Array1D< double > & sig,
    Array1D< double > & density,
    Array1D< double > & weight )
    +
    + +

    KDE estimation of a PDF.

    + +
    +
    + +

    ◆ ihsP()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void ihsP (int ns,
    int np,
    int * rpos,
    int dfac,
    dsfmt_t * rnstate )
    +
    + +
    +
    + +

    ◆ ihsU() [1/2]

    + +
    +
    + + + + + + + + + + + + + + + + +
    void ihsU (Array2D< double > & rndnos,
    int dfac,
    dsfmt_t * rnstate )
    +
    + +
    +
    + +

    ◆ ihsU() [2/2]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void ihsU (int ns,
    int np,
    double * rndnos,
    int dfac,
    dsfmt_t * rnstate )
    +
    + +
    +
    + +

    ◆ inverf()

    + +
    +
    + + + + + + + +
    double inverf (double y0)
    +
    + +

    Inverse error function, input scaled to [-1,1].

    +
    Note
    Cephes Math Library Release 2.8: June, 2000. Copyright 1984, 1987, 1988, 1992, 2000 by Stephen L. Moshier
    + +
    +
    + +

    ◆ invnormcdf()

    + +
    +
    + + + + + + + +
    double invnormcdf (double y)
    +
    + +

    Inverse of the CDF of the normal random variable, uses inverf.

    + +
    +
    + +

    ◆ normcdf()

    + +
    +
    + + + + + + + +
    double normcdf (double y)
    +
    + +

    Normal random variable CDF.

    + +
    +
    + +

    ◆ normcdfc()

    + +
    +
    + + + + + + + +
    double normcdfc (double y)
    +
    + +

    Complementary function for normcdf.

    + +
    +
    + +

    ◆ rperm()

    + +
    +
    + + + + + + + + + + + + + + + + +
    void rperm (int n,
    int * a,
    dsfmt_t * rnstate )
    +
    + +

    Random permutation of 0..n-1.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/probability_8h_source.html b/docs/html/probability_8h_source.html new file mode 100644 index 00000000..9ccc98ac --- /dev/null +++ b/docs/html/probability_8h_source.html @@ -0,0 +1,204 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: probability.h Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    probability.h
    +
    +
    +Go to the documentation of this file.
    1/* =====================================================================================
    +
    2
    +
    3 The UQ Toolkit (UQTk) version 3.1.5
    +
    4 Copyright (2024) NTESS
    +
    5 https://www.sandia.gov/UQToolkit/
    +
    6 https://github.com/sandialabs/UQTk
    +
    7
    +
    8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
    +
    9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
    +
    10 retains certain rights in this software.
    +
    11
    +
    12 This file is part of The UQ Toolkit (UQTk)
    +
    13
    +
    14 UQTk is open source software: you can redistribute it and/or modify
    +
    15 it under the terms of BSD 3-Clause License
    +
    16
    +
    17 UQTk is distributed in the hope that it will be useful,
    +
    18 but WITHOUT ANY WARRANTY; without even the implied warranty of
    +
    19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    +
    20 BSD 3 Clause License for more details.
    +
    21
    +
    22 You should have received a copy of the BSD 3 Clause License
    +
    23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
    +
    24
    +
    25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
    +
    26 Sandia National Laboratories, Livermore, CA, USA
    +
    27===================================================================================== */
    +
    33#ifndef PROBABILITY_H
    +
    34#define PROBABILITY_H
    +
    35
    +
    36#include "Array1D.h"
    +
    37#include "Array2D.h"
    +
    38
    +
    39#define DSFMT_DO_NOT_USE_OLD_NAMES
    +
    40#include "dsfmt_add.h"
    +
    41
    +
    42#include "KCenterClustering.h"
    +
    43#include "figtree_internal.h"
    +
    44
    +
    45
    +
    47double erff(const double x);
    +
    48
    +
    52// The website (http://www.boutell.com/lsm/lsmbyid.cgi/000626) states copying policy=freely distributable as of July 2012
    +
    53// \note modified by Sandia UQTk group to scale the input to [-1,1]
    +
    54double inverf(double y0);
    +
    55
    +
    57double invnormcdf(double y);
    +
    58
    +
    60double normcdf(double y);
    +
    61
    +
    63double normcdfc(double y);
    +
    64
    +
    66void generate_uniform(double* rvar,int ns, int nd, int zSeed);
    +
    67
    +
    69void generate_uniform(Array2D<double>& rvar,int zSeed);
    +
    70
    +
    72void generate_uniform(double *rvar, int ns, int nd, dsfmt_t *rnstate);
    +
    73
    +
    75void generate_uniform(Array2D<double> &rvar, dsfmt_t *rnstate);
    +
    76
    +
    78void generate_uniform_lhs(double* rvar,int ns, int nd, int zSeed);
    +
    79
    +
    81void generate_uniform_lhs(Array2D<double>& rvar,int zSeed);
    +
    82
    +
    84void generate_uniform_lhs(double *rvar, int ns, int nd, dsfmt_t *rnstate);
    +
    85
    +
    87void generate_uniform_lhs(Array2D<double> &rvar, dsfmt_t *rnstate);
    +
    88
    +
    90void generate_normal(Array2D<double>& rvar,int zSeed);
    +
    91
    +
    94void generate_normal_lhs(Array2D<double>& rvar,int zSeed);
    +
    95
    +
    97double get_median(const Array1D<double>& data);
    +
    98
    +
    100double get_mean(const Array1D<double>& data);
    +
    101
    +
    103double get_mean(const Array2D<double>& data);
    +
    104
    +
    106double get_std(const Array1D<double>& data);
    +
    107
    +
    109double get_var(const Array1D<double>& data);
    +
    110
    +
    112double getMean_Variance(Array2D<double>& data_c, Array1D<double>& w, Array1D<double>& mean);
    +
    113
    +
    115void getMean(Array2D<double>& data_c, Array1D<double>& mean);
    +
    116
    +
    119void getMean(Array2D<double>& data_c, Array1D<double>& mean, char *RC);
    +
    120
    +
    122void rperm(int n, int *a, dsfmt_t *rnstate);
    +
    123
    +
    125void getPdf_figtree(Array2D<double>& source,Array2D<double>& target,Array1D<double>& sig, Array1D<double>& density, Array1D<double>& weight);
    +
    126
    +
    130void getPdf_cl(Array2D<double>& data, Array2D<double>& points, Array1D<double>& dens,int ncl, double sfac);
    +
    131
    +
    133double covariance(Array1D<double>& x1, Array1D<double>& x2,Array1D<double>& param, string covtype);
    +
    134
    +
    135
    +
    136void ihsU(Array2D<double> &rndnos, int dfac, dsfmt_t *rnstate) ;
    +
    137
    +
    138void ihsU(int ns, int np, double *rndnos, int dfac, dsfmt_t *rnstate) ;
    +
    139
    +
    140void ihsP(int ns, int np, int *rpos, int dfac, dsfmt_t *rnstate);
    +
    141
    +
    146void distCorr(const Array2D<double> &spl, Array2D<double> &dCor) ;
    +
    147
    +
    148//---------------------------------------------------------------------------------------
    +
    149#endif // PROBABILITY_H
    +
    Array1D.h
    1D Array class for any type T
    +
    Array2D.h
    2D Array class for any type T
    +
    Array1D
    Stores data of any type T in a 1D array.
    Definition Array1D.h:61
    +
    Array2D
    Stores data of any type T in a 2D array.
    Definition Array2D.h:60
    +
    x1
    static double x1[]
    Definition gkpclib.cpp:36
    +
    normcdfc
    double normcdfc(double y)
    Complementary function for normcdf.
    Definition probability.cpp:194
    +
    generate_uniform_lhs
    void generate_uniform_lhs(double *rvar, int ns, int nd, int zSeed)
    Generates a vector of i.i.d. uniform(0,1) random variable LHS samples of size ns*nd,...
    Definition probability.cpp:249
    +
    getMean_Variance
    double getMean_Variance(Array2D< double > &data_c, Array1D< double > &w, Array1D< double > &mean)
    Vector-mean and weighted variance.
    Definition probability.cpp:437
    +
    getMean
    void getMean(Array2D< double > &data_c, Array1D< double > &mean)
    Vector mean, column by column.
    Definition probability.cpp:460
    +
    getPdf_figtree
    void getPdf_figtree(Array2D< double > &source, Array2D< double > &target, Array1D< double > &sig, Array1D< double > &density, Array1D< double > &weight)
    KDE estimation of a PDF.
    Definition probability.cpp:535
    +
    erff
    double erff(const double x)
    An implementation of error function using incomplete gamma function.
    Definition probability.cpp:53
    +
    ihsP
    void ihsP(int ns, int np, int *rpos, int dfac, dsfmt_t *rnstate)
    Definition probability.cpp:761
    +
    get_std
    double get_std(const Array1D< double > &data)
    Returns the std of a data array.
    Definition probability.cpp:404
    +
    getPdf_cl
    void getPdf_cl(Array2D< double > &data, Array2D< double > &points, Array1D< double > &dens, int ncl, double sfac)
    Compute the PDF of data at the given points using given number of clusters (if ncl=0,...
    Definition probability.cpp:614
    +
    distCorr
    void distCorr(const Array2D< double > &spl, Array2D< double > &dCor)
    Compute distance correlation factors given a set of samples (no. of rows in spl) from a collection of...
    Definition probability.cpp:827
    +
    ihsU
    void ihsU(Array2D< double > &rndnos, int dfac, dsfmt_t *rnstate)
    Definition probability.cpp:737
    +
    inverf
    double inverf(double y0)
    Inverse error function, input scaled to [-1,1].
    Definition probability.cpp:59
    +
    generate_normal_lhs
    void generate_normal_lhs(Array2D< double > &rvar, int zSeed)
    Generates a matrix of i.i.d. normal(0,1) random variable LHS samples.
    Definition probability.cpp:337
    +
    get_median
    double get_median(const Array1D< double > &data)
    Returns the median of a data array.
    Definition probability.cpp:353
    +
    get_var
    double get_var(const Array1D< double > &data)
    Returns the std of a data array.
    Definition probability.cpp:421
    +
    generate_uniform
    void generate_uniform(double *rvar, int ns, int nd, int zSeed)
    Generates a vector of i.i.d. uniform(0,1) random variable samples of size ns*nd, given integer seed.
    Definition probability.cpp:200
    +
    rperm
    void rperm(int n, int *a, dsfmt_t *rnstate)
    Random permutation of 0..n-1.
    Definition probability.cpp:518
    +
    get_mean
    double get_mean(const Array1D< double > &data)
    Returns the mean of a 1D data array.
    Definition probability.cpp:374
    +
    normcdf
    double normcdf(double y)
    Normal random variable CDF.
    Definition probability.cpp:187
    +
    generate_normal
    void generate_normal(Array2D< double > &rvar, int zSeed)
    Generates a matrix of i.i.d. normal(0,1) random variable samples.
    Definition probability.cpp:321
    +
    covariance
    double covariance(Array1D< double > &x1, Array1D< double > &x2, Array1D< double > &param, string covtype)
    Compute a few standard covariance functions C(x_1,x_2)
    Definition probability.cpp:695
    +
    invnormcdf
    double invnormcdf(double y)
    Inverse of the CDF of the normal random variable, uses inverf.
    Definition probability.cpp:180
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/quad_8cpp.html b/docs/html/quad_8cpp.html new file mode 100644 index 00000000..8ffd6479 --- /dev/null +++ b/docs/html/quad_8cpp.html @@ -0,0 +1,86 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: quad.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    quad.cpp File Reference
    +
    +
    + +

    Quadrature class. +More...

    +
    #include <math.h>
    +#include <assert.h>
    +#include <cfloat>
    +#include "quad.h"
    +#include "error_handlers.h"
    +#include "combin.h"
    +#include "multiindex.h"
    +#include "gq.h"
    +#include "arrayio.h"
    +#include "arraytools.h"
    +

    Detailed Description

    +

    Quadrature class.

    +
    Author
    K. Sargsyan, C. Safta 2010 -
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/quad_8h.html b/docs/html/quad_8h.html new file mode 100644 index 00000000..a2aa706a --- /dev/null +++ b/docs/html/quad_8h.html @@ -0,0 +1,120 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: quad.h File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Classes | +Macros
    +
    quad.h File Reference
    +
    +
    + +

    Header file for the quadrature class. +More...

    +
    #include "Array1D.h"
    +#include "Array2D.h"
    +#include <iostream>
    +#include <string.h>
    +#include <stdio.h>
    +#include <sstream>
    +
    +

    Go to the source code of this file.

    + + + + + + + + +

    +Classes

    class  Quad
     Generates quadrature rules. More...
     
    struct  Quad::QuadRule
     Rule structure that stores quadrature points, weights and indices. More...
     
    + + + + +

    +Macros

    #define QD_MAX   20000000
     Capping the maximum value of quadrature array entries for full tensor-product quadrature, i.e. d*N^d < QD_MAX.
     
    +

    Detailed Description

    +

    Header file for the quadrature class.

    +
    Author
    K. Sargsyan, C. Safta 2010 -
    +

    Macro Definition Documentation

    + +

    ◆ QD_MAX

    + +
    +
    + + + + +
    #define QD_MAX   20000000
    +
    + +

    Capping the maximum value of quadrature array entries for full tensor-product quadrature, i.e. d*N^d < QD_MAX.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/quad_8h_source.html b/docs/html/quad_8h_source.html new file mode 100644 index 00000000..e27b4d02 --- /dev/null +++ b/docs/html/quad_8h_source.html @@ -0,0 +1,300 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: quad.h Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    quad.h
    +
    +
    +Go to the documentation of this file.
    1/* =====================================================================================
    +
    2
    +
    3 The UQ Toolkit (UQTk) version 3.1.5
    +
    4 Copyright (2024) NTESS
    +
    5 https://www.sandia.gov/UQToolkit/
    +
    6 https://github.com/sandialabs/UQTk
    +
    7
    +
    8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
    +
    9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
    +
    10 retains certain rights in this software.
    +
    11
    +
    12 This file is part of The UQ Toolkit (UQTk)
    +
    13
    +
    14 UQTk is open source software: you can redistribute it and/or modify
    +
    15 it under the terms of BSD 3-Clause License
    +
    16
    +
    17 UQTk is distributed in the hope that it will be useful,
    +
    18 but WITHOUT ANY WARRANTY; without even the implied warranty of
    +
    19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    +
    20 BSD 3 Clause License for more details.
    +
    21
    +
    22 You should have received a copy of the BSD 3 Clause License
    +
    23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
    +
    24
    +
    25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
    +
    26 Sandia National Laboratories, Livermore, CA, USA
    +
    27===================================================================================== */
    +
    31
    +
    32#ifndef QUAD_H_SEEN
    +
    33#define QUAD_H_SEEN
    +
    34
    +
    35#include "Array1D.h"
    +
    36#include "Array2D.h"
    +
    37
    +
    38#include <iostream>
    +
    39#include <string.h>
    +
    40#include <stdio.h>
    +
    41#include <sstream>
    +
    42using namespace std; // needed for python string conversion
    +
    43
    +
    46#define QD_MAX 20000000
    +
    47
    +
    +
    54class Quad {
    +
    55public:
    +
    65 Quad(char *grid_type, char *fs_type,int ndim,int param,double alpha=0.0, double betta=1.0);
    +
    66
    +
    77 Quad(Array1D<string>& grid_types, char *fs_type, Array1D<int>& param,Array1D<double>& alphas, Array1D<double>& bettas);
    +
    78
    +
    80 Quad() {};
    +
    82 ~Quad() {};
    +
    83
    +
    85 void init();
    +
    86
    +
    88 void SetAlpha(double alpha){this->alpha_=alpha; }
    +
    90 void SetBeta(double betta){this->beta_=betta; }
    +
    91
    +
    93 void SetDomain(Array1D<double>& aa, Array1D<double>& bb);
    +
    95 void SetDomain(Array1D<double>& aa);
    +
    97 void GetDomain(Array1D<double>& aa, Array1D<double>& bb) const {aa=aa_; bb=bb_;}
    +
    99 void GetDomain(Array1D<double>& aa) const {aa=aa_;}
    +
    100
    +
    102 void SetRule(Array2D<double>& q, Array1D<double>& w);
    +
    105 void SetRule(Array2D<double>& q, Array1D<double>& w, Array2D<int>& ind){this->SetRule(q,w);}
    +
    107 //void SetRule(Array2D<double>& q, Array1D<double>& w, Array2D<int>& ind, int param);
    +
    108
    +
    110 void SetRule();
    +
    111
    +
    113 void GetRule(Array2D<double>& q, Array1D<double>& w);
    +
    116 void GetRule(Array2D<double>& q, Array1D<double>& w, Array2D<int>& ind){this->GetRule(q,w);}
    +
    117
    +
    119 void SetQdpts(Array2D<double>& q){ rule_.qdpts=q; return;}
    +
    121 void SetWghts(Array1D<double>& w){ rule_.wghts=w; return;}
    +
    123 // void SetIndices(Array2D<int>& ind){ rule_.indices=ind; return;}
    +
    124
    +
    126 void GetQdpts(Array2D<double>& q){ q=rule_.qdpts; return;}
    +
    128 void GetWghts(Array1D<double>& w){ w=rule_.wghts; return;}
    +
    130 //void GetIndices(Array2D<int>& ind){ ind=rule_.indices; return;}
    +
    131
    +
    133 void SetLevel(int param) {nlevel_=param; return;}
    +
    134
    +
    136 void nextLevel();
    +
    137
    +
    139 int GetNQ() {return rule_.qdpts.XSize(); }
    +
    140
    +
    143 void SetVerbosity(int verbosity) { quadverbose_ = verbosity; }
    +
    144
    +
    145
    +
    146
    +
    147 private:
    +
    148
    +
    150 Quad(const Quad &) {};
    +
    151
    +
    153 Array1D<double> aa_;
    +
    155 Array1D<double> bb_;
    +
    156
    +
    159 int quadverbose_;
    +
    160
    +
    162 double alpha_;
    +
    164 double beta_;
    +
    166 Array1D<double> alphas_;
    +
    168 Array1D<double> betas_;
    +
    169
    +
    +
    171 typedef struct
    +
    172 {
    +
    174 Array2D<double> qdpts;
    +
    176 Array1D<double> wghts;
    +
    177 } QuadRule;
    +
    +
    178
    +
    180 QuadRule rule_;
    +
    181
    +
    183 int ndim_;
    +
    184
    +
    186 int nlevel_;
    +
    187
    +
    190 int maxlevel_;
    +
    191 Array1D<int> param_;
    +
    192
    +
    194 Array2D<int> npts_all, npts_1_all;
    +
    195 Array2D<QuadRule> qr_all, qr_1_all;
    +
    196
    +
    198 void MultiplyTwoRules(QuadRule *rule1,QuadRule *rule2,QuadRule *rule_prod);
    +
    200 void MultiplyManyRules(int nrules, QuadRule *rules, QuadRule *rule_prod);
    +
    201 void MultiplyManyRules_(int nrules, QuadRule *rules, QuadRule *rule_prod);
    +
    203 void AddTwoRules(QuadRule *rule1,QuadRule *rule2,QuadRule *rule_sum);
    +
    205 void SubtractTwoRules(QuadRule *rule1,QuadRule *rule2,QuadRule *rule_sum);
    +
    206
    +
    208 void create1DRule(string gridtype,Array1D<double>& qdpts,Array1D<double>& wghts, int ngr, double a, double b);
    +
    209
    +
    212 void create1DRule_CC(Array1D<double>& qdpts,Array1D<double>& wghts, int ngr, double a, double b);
    +
    214 void create1DRule_LU(Array1D<double>& qdpts,Array1D<double>& wghts, int ngr, double a, double b);
    +
    216 void create1DRule_HG(Array1D<double>& qdpts,Array1D<double>& wghts, int ngr);
    +
    218 void create1DRule_NC(Array1D<double>& qdpts,Array1D<double>& wghts, int ngr, double a, double b);
    +
    220 void create1DRule_NCO(Array1D<double>& qdpts,Array1D<double>& wghts, int ngr, double a, double b);
    +
    223 void create1DRule_CCO(Array1D<double>& qdpts,Array1D<double>& wghts, int ngr, double a, double b);
    +
    225 void create1DRule_JB(Array1D<double>& qdpts,Array1D<double>& wghts, int ngr, double a, double b);
    +
    227 void create1DRule_LG(Array1D<double>& qdpts,Array1D<double>& wghts, int ngr);
    +
    229 void create1DRule_SW(Array1D<double>& qdpts,Array1D<double>& wghts,int ngr);
    +
    232 void create1DRule_pdf(Array1D<double>& qdpts,Array1D<double>& wghts, int ngr, double a, double b);
    +
    235 void create1DRule_GP3(Array1D<double>& qdpts,Array1D<double>& wghts, int ngr, double a, double b);
    +
    236
    +
    238 void getMultiIndexLevel(Array2D<int>& multiIndexLevel, int level, int ndim);
    +
    239
    +
    241 int growth_rule_;
    +
    243 Array1D<int> growth_rules_;
    +
    244
    +
    246 string grid_type_;
    +
    248 Array1D<string> grid_types_;
    +
    249
    +
    251 string fs_type_;
    +
    252
    +
    254 void compressRule(QuadRule *rule);
    +
    255
    +
    256
    +
    257
    +
    258};
    +
    +
    259#endif /* QUAD_H_SEEN */
    +
    Array1D.h
    1D Array class for any type T
    +
    Array2D.h
    2D Array class for any type T
    +
    Array1D
    Stores data of any type T in a 1D array.
    Definition Array1D.h:61
    +
    Array2D
    Stores data of any type T in a 2D array.
    Definition Array2D.h:60
    +
    Array2D::XSize
    int XSize() const
    Returns size in the x-direction.
    Definition Array2D.h:99
    +
    Quad
    Generates quadrature rules.
    Definition quad.h:54
    +
    Quad::grid_types_
    Array1D< string > grid_types_
    Vector of grid types: 'CC','CCO','NC','NCO','LU', 'HG', 'JB', 'LG', 'SW', 'pdf', or 'GP3'.
    Definition quad.h:248
    +
    Quad::create1DRule_JB
    void create1DRule_JB(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
    Jacobi-Beta.
    Definition quad.cpp:607
    +
    Quad::grid_type_
    string grid_type_
    Grid type: 'CC','CCO','NC','NCO','LU', 'HG', 'JB', 'LG', 'SW', 'pdf', or 'GP3'.
    Definition quad.h:246
    +
    Quad::create1DRule
    void create1DRule(string gridtype, Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
    Compute 1D rules.
    Definition quad.cpp:353
    +
    Quad::nextLevel
    void nextLevel()
    Compute the indices of the next-level points.
    Definition quad.cpp:862
    +
    Quad::SetRule
    void SetRule(Array2D< double > &q, Array1D< double > &w, Array2D< int > &ind)
    Set the rule externally (quadrature points, weights and indices) Dummy function for backward compatib...
    Definition quad.h:105
    +
    Quad::npts_1_all
    Array2D< int > npts_1_all
    Definition quad.h:194
    +
    Quad::param_
    Array1D< int > param_
    Definition quad.h:191
    +
    Quad::ndim_
    int ndim_
    The dimensionality.
    Definition quad.h:183
    +
    Quad::alphas_
    Array1D< double > alphas_
    The first parameter of the rule, if any.
    Definition quad.h:166
    +
    Quad::SetQdpts
    void SetQdpts(Array2D< double > &q)
    Externally set quadrature points.
    Definition quad.h:119
    +
    Quad::AddTwoRules
    void AddTwoRules(QuadRule *rule1, QuadRule *rule2, QuadRule *rule_sum)
    Add two rules.
    Definition quad.cpp:324
    +
    Quad::create1DRule_NC
    void create1DRule_NC(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
    Newton-Cotes (i.e. equispaced, includes the endpoints)
    Definition quad.cpp:451
    +
    Quad::alpha_
    double alpha_
    The first parameter of the rule, if any.
    Definition quad.h:162
    +
    Quad::MultiplyManyRules
    void MultiplyManyRules(int nrules, QuadRule *rules, QuadRule *rule_prod)
    Multiply many rules (full tensor product)
    Definition quad.cpp:253
    +
    Quad::SetBeta
    void SetBeta(double betta)
    Set the parameter beta.
    Definition quad.h:90
    +
    Quad::~Quad
    ~Quad()
    Destructor.
    Definition quad.h:82
    +
    Quad::create1DRule_pdf
    void create1DRule_pdf(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
    Custom rule given the recursive coefficients of the corresponding orthogonal polynomials.
    Definition quad.cpp:676
    +
    Quad::bb_
    Array1D< double > bb_
    the right endpoints of the domain
    Definition quad.h:155
    +
    Quad::maxlevel_
    int maxlevel_
    The level for sparse rules, or the number of grid points per dim for full product rules.
    Definition quad.h:190
    +
    Quad::GetNQ
    int GetNQ()
    Get the number of quadrature points.
    Definition quad.h:139
    +
    Quad::quadverbose_
    int quadverbose_
    Verbosity level.
    Definition quad.h:159
    +
    Quad::GetDomain
    void GetDomain(Array1D< double > &aa, Array1D< double > &bb) const
    Get the domain endpoints (for compact support domains)
    Definition quad.h:97
    +
    Quad::MultiplyManyRules_
    void MultiplyManyRules_(int nrules, QuadRule *rules, QuadRule *rule_prod)
    Definition quad.cpp:282
    +
    Quad::GetQdpts
    void GetQdpts(Array2D< double > &q)
    Externally set the indices.
    Definition quad.h:126
    +
    Quad::SetLevel
    void SetLevel(int param)
    Get the indices.
    Definition quad.h:133
    +
    Quad::Quad
    Quad(const Quad &)
    Dummy copy constructor, which should not be used as it is currently not well defined.
    Definition quad.h:150
    +
    Quad::MultiplyTwoRules
    void MultiplyTwoRules(QuadRule *rule1, QuadRule *rule2, QuadRule *rule_prod)
    Multiply two rules (full tensor product)
    Definition quad.cpp:209
    +
    Quad::create1DRule_LU
    void create1DRule_LU(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
    Legendre-Uniform.
    Definition quad.cpp:398
    +
    Quad::create1DRule_LG
    void create1DRule_LG(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr)
    Gamma-Laguerre.
    Definition quad.cpp:628
    +
    Quad::nlevel_
    int nlevel_
    The current level, working variable for hierarchical construction.
    Definition quad.h:186
    +
    Quad::create1DRule_SW
    void create1DRule_SW(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr)
    Stieltjes-Wigert.
    Definition quad.cpp:645
    +
    Quad::compressRule
    void compressRule(QuadRule *rule)
    Compress the rule, i.e. merge repeating points.
    Definition quad.cpp:985
    +
    Quad::qr_all
    Array2D< QuadRule > qr_all
    Definition quad.h:195
    +
    Quad::GetRule
    void GetRule(Array2D< double > &q, Array1D< double > &w)
    Get the quadrature rule.
    Definition quad.cpp:199
    +
    Quad::SetAlpha
    void SetAlpha(double alpha)
    Set the parameter alpha.
    Definition quad.h:88
    +
    Quad::growth_rule_
    int growth_rule_
    Growth rule: exponential(0) or linear(1)
    Definition quad.h:241
    +
    Quad::npts_all
    Array2D< int > npts_all
    Working arrays.
    Definition quad.h:194
    +
    Quad::aa_
    Array1D< double > aa_
    The left endpoints of the domain.
    Definition quad.h:153
    +
    Quad::create1DRule_NCO
    void create1DRule_NCO(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
    Newton-Cotes open (i.e. excludes the endpoints)
    Definition quad.cpp:484
    +
    Quad::init
    void init()
    Initialization function.
    Definition quad.cpp:103
    +
    Quad::qr_1_all
    Array2D< QuadRule > qr_1_all
    Definition quad.h:195
    +
    Quad::SetRule
    void SetRule()
    Set the rule externally (quadrature points, weights, indices, and the level)
    Definition quad.cpp:762
    +
    Quad::rule_
    QuadRule rule_
    The quadrature rule structure.
    Definition quad.h:180
    +
    Quad::create1DRule_GP3
    void create1DRule_GP3(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
    Gauss-Patterson starting with Legendre-Uniform 3.
    Definition quad.cpp:711
    +
    Quad::SetVerbosity
    void SetVerbosity(int verbosity)
    Set the verbosity level.
    Definition quad.h:143
    +
    Quad::fs_type_
    string fs_type_
    Sparseness type (full or sparse)
    Definition quad.h:251
    +
    Quad::SetDomain
    void SetDomain(Array1D< double > &aa, Array1D< double > &bb)
    Set the domain endpoints (for compact support domains)
    Definition quad.cpp:163
    +
    Quad::create1DRule_HG
    void create1DRule_HG(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr)
    Gauss-Hermite.
    Definition quad.cpp:423
    +
    Quad::create1DRule_CCO
    void create1DRule_CCO(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
    Clenshaw-Curtis open (i.e. excludes the endpoints)
    Definition quad.cpp:562
    +
    Quad::betas_
    Array1D< double > betas_
    The second parameter of the rule, if any.
    Definition quad.h:168
    +
    Quad::getMultiIndexLevel
    void getMultiIndexLevel(Array2D< int > &multiIndexLevel, int level, int ndim)
    Auxilliary function: get the level of the multi-index.
    Definition quad.cpp:948
    +
    Quad::GetRule
    void GetRule(Array2D< double > &q, Array1D< double > &w, Array2D< int > &ind)
    Get the quadrature rule with indexing Dummy function for backward compatibility.
    Definition quad.h:116
    +
    Quad::GetDomain
    void GetDomain(Array1D< double > &aa) const
    Get the domain endpoint (for semi-infinite domains)
    Definition quad.h:99
    +
    Quad::beta_
    double beta_
    The second parameter of the rule, if any.
    Definition quad.h:164
    +
    Quad::GetWghts
    void GetWghts(Array1D< double > &w)
    Get the weights.
    Definition quad.h:128
    +
    Quad::Quad
    Quad()
    Constructor: empty.
    Definition quad.h:80
    +
    Quad::create1DRule_CC
    void create1DRule_CC(Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
    Clenshaw-Curtis (includes the endpoints)
    Definition quad.cpp:509
    +
    Quad::growth_rules_
    Array1D< int > growth_rules_
    Growth rules: exponential(0) or linear(1)
    Definition quad.h:243
    +
    Quad::SetWghts
    void SetWghts(Array1D< double > &w)
    Externally set the weights.
    Definition quad.h:121
    +
    Quad::SubtractTwoRules
    void SubtractTwoRules(QuadRule *rule1, QuadRule *rule2, QuadRule *rule_sum)
    Subtract two rules.
    Definition quad.cpp:312
    +
    Quad::QuadRule
    Rule structure that stores quadrature points, weights and indices.
    Definition quad.h:172
    +
    Quad::QuadRule::qdpts
    Array2D< double > qdpts
    Quadrature points.
    Definition quad.h:174
    +
    Quad::QuadRule::wghts
    Array1D< double > wghts
    Quadrature weights.
    Definition quad.h:176
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/regression_8cpp.html b/docs/html/regression_8cpp.html new file mode 100644 index 00000000..a1c8009e --- /dev/null +++ b/docs/html/regression_8cpp.html @@ -0,0 +1,338 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: regression.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros | +Functions
    +
    regression.cpp File Reference
    +
    +
    + +

    Command-line utility for linear regression. +More...

    +
    #include <iostream>
    +#include <stdlib.h>
    +#include <stdio.h>
    +#include <time.h>
    +#include <math.h>
    +#include <assert.h>
    +#include "Array1D.h"
    +#include "Array2D.h"
    +#include "PCSet.h"
    +#include "lreg.h"
    +#include <getopt.h>
    +#include "tools.h"
    +#include "arraytools.h"
    +#include "arrayio.h"
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Macros

    #define XFILE   "xdata.dat"
     default x-file
     
    #define YFILE   "ydata.dat"
     default y-file
     
    #define BTYPE   "PC"
     default basis type
     
    #define METH   "lsq"
     default method
     
    #define MSC   "m"
     default flag to output mean (m), mean+std (ms) or mean+std+cov (msc)
     
    #define INTPAR   5
     default int parameter
     
    #define STRPAR   "LU"
     default string parameter
     
    #define MINDEXFILE   "mindex.dat"
     default multiindex file
     
    #define ETADEFAULT   1.e-3
     default tolerance for bcs
     
    + + + + + + + +

    +Functions

    int usage ()
     Displays information about this program.
     
    int main (int argc, char *argv[])
     Main program of linear regression given data.
     
    +

    Detailed Description

    +

    Command-line utility for linear regression.

    +
    Author
    K. Sargsyan 2015 -
    +

    Macro Definition Documentation

    + +

    ◆ BTYPE

    + +
    +
    + + + + +
    #define BTYPE   "PC"
    +
    + +

    default basis type

    + +
    +
    + +

    ◆ ETADEFAULT

    + +
    +
    + + + + +
    #define ETADEFAULT   1.e-3
    +
    + +

    default tolerance for bcs

    + +
    +
    + +

    ◆ INTPAR

    + +
    +
    + + + + +
    #define INTPAR   5
    +
    + +

    default int parameter

    + +
    +
    + +

    ◆ METH

    + +
    +
    + + + + +
    #define METH   "lsq"
    +
    + +

    default method

    + +
    +
    + +

    ◆ MINDEXFILE

    + +
    +
    + + + + +
    #define MINDEXFILE   "mindex.dat"
    +
    + +

    default multiindex file

    + +
    +
    + +

    ◆ MSC

    + +
    +
    + + + + +
    #define MSC   "m"
    +
    + +

    default flag to output mean (m), mean+std (ms) or mean+std+cov (msc)

    + +
    +
    + +

    ◆ STRPAR

    + +
    +
    + + + + +
    #define STRPAR   "LU"
    +
    + +

    default string parameter

    + +
    +
    + +

    ◆ XFILE

    + +
    +
    + + + + +
    #define XFILE   "xdata.dat"
    +
    + +

    default x-file

    + +
    +
    + +

    ◆ YFILE

    + +
    +
    + + + + +
    #define YFILE   "ydata.dat"
    +
    + +

    default y-file

    + +
    +
    +

    Function Documentation

    + +

    ◆ main()

    + +
    +
    + + + + + + + + + + + +
    int main (int argc,
    char * argv[] )
    +
    + +

    Main program of linear regression given data.

    +

    Set the default values

    +

    Read the user input

    +

    Sanity checks

    +

    Print the input information on screen

    +

    Read data

    +

    Read validation check data, if any

    +

    Declare the 'parent' regression object

    +

    Go through options, RBF, PC, PC_MI, POL, POL_MI

    +

    Initialize regression

    +

    Set the regression model

    +

    Setup data

    +

    Set the regularization parameters

    +

    Go through methods, lsq, wbcs

    +

    Write out coefficients

    +

    Get the data variance

    +

    Evaluate at validation points

    +

    Print standard error measures for the lsq method

    + +
    +
    + +

    ◆ usage()

    + +
    +
    + + + + + + + +
    int usage ()
    +
    + +

    Displays information about this program.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/resize.js b/docs/html/resize.js new file mode 100644 index 00000000..178d03bc --- /dev/null +++ b/docs/html/resize.js @@ -0,0 +1,147 @@ +/* + @licstart The following is the entire license notice for the JavaScript code in this file. + + The MIT License (MIT) + + Copyright (C) 1997-2020 by Dimitri van Heesch + + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: + + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file + */ + +function initResizable(treeview) { + let sidenav,navtree,content,header,footer,barWidth=6; + const RESIZE_COOKIE_NAME = ''+'width'; + + function resizeWidth() { + const sidenavWidth = $(sidenav).outerWidth(); + content.css({marginLeft:parseInt(sidenavWidth)+"px"}); + if (typeof page_layout!=='undefined' && page_layout==1) { + footer.css({marginLeft:parseInt(sidenavWidth)+"px"}); + } + Cookie.writeSetting(RESIZE_COOKIE_NAME,sidenavWidth-barWidth); + } + + function restoreWidth(navWidth) { + content.css({marginLeft:parseInt(navWidth)+barWidth+"px"}); + if (typeof page_layout!=='undefined' && page_layout==1) { + footer.css({marginLeft:parseInt(navWidth)+barWidth+"px"}); + } + sidenav.css({width:navWidth + "px"}); + } + + function resizeHeight(treeview) { + const headerHeight = header.outerHeight(); + const windowHeight = $(window).height(); + let contentHeight; + if (treeview) + { + const footerHeight = footer.outerHeight(); + let navtreeHeight,sideNavHeight; + if (typeof page_layout==='undefined' || page_layout==0) { /* DISABLE_INDEX=NO */ + contentHeight = windowHeight - headerHeight - footerHeight; + navtreeHeight = contentHeight; + sideNavHeight = contentHeight; + } else if (page_layout==1) { /* DISABLE_INDEX=YES */ + contentHeight = windowHeight - footerHeight; + navtreeHeight = windowHeight - headerHeight; + sideNavHeight = windowHeight; + } + navtree.css({height:navtreeHeight + "px"}); + sidenav.css({height:sideNavHeight + "px"}); + } + else + { + contentHeight = windowHeight - headerHeight; + } + content.css({height:contentHeight + "px"}); + if (location.hash.slice(1)) { + (document.getElementById(location.hash.slice(1))||document.body).scrollIntoView(); + } + } + + function collapseExpand() { + let newWidth; + if (sidenav.width()>0) { + newWidth=0; + } else { + const width = Cookie.readSetting(RESIZE_COOKIE_NAME,250); + newWidth = (width>250 && width<$(window).width()) ? width : 250; + } + restoreWidth(newWidth); + const sidenavWidth = $(sidenav).outerWidth(); + Cookie.writeSetting(RESIZE_COOKIE_NAME,sidenavWidth-barWidth); + } + + header = $("#top"); + content = $("#doc-content"); + footer = $("#nav-path"); + sidenav = $("#side-nav"); + if (!treeview) { +// title = $("#titlearea"); +// titleH = $(title).height(); +// let animating = false; +// content.on("scroll", function() { +// slideOpts = { duration: 200, +// step: function() { +// contentHeight = $(window).height() - header.outerHeight(); +// content.css({ height : contentHeight + "px" }); +// }, +// done: function() { animating=false; } +// }; +// if (content.scrollTop()>titleH && title.css('display')!='none' && !animating) { +// title.slideUp(slideOpts); +// animating=true; +// } else if (content.scrollTop()<=titleH && title.css('display')=='none' && !animating) { +// title.slideDown(slideOpts); +// animating=true; +// } +// }); + } else { + navtree = $("#nav-tree"); + $(".side-nav-resizable").resizable({resize: function(e, ui) { resizeWidth(); } }); + $(sidenav).resizable({ minWidth: 0 }); + } + $(window).resize(function() { resizeHeight(treeview); }); + if (treeview) + { + const device = navigator.userAgent.toLowerCase(); + const touch_device = device.match(/(iphone|ipod|ipad|android)/); + if (touch_device) { /* wider split bar for touch only devices */ + $(sidenav).css({ paddingRight:'20px' }); + $('.ui-resizable-e').css({ width:'20px' }); + $('#nav-sync').css({ right:'34px' }); + barWidth=20; + } + const width = Cookie.readSetting(RESIZE_COOKIE_NAME,250); + if (width) { restoreWidth(width); } else { resizeWidth(); } + } + resizeHeight(treeview); + const url = location.href; + const i=url.indexOf("#"); + if (i>=0) window.location.hash=url.substr(i); + const _preventDefault = function(evt) { evt.preventDefault(); }; + if (treeview) + { + $("#splitbar").bind("dragstart", _preventDefault).bind("selectstart", _preventDefault); + $(".ui-resizable-handle").dblclick(collapseExpand); + // workaround for firefox + $("body").css({overflow: "hidden"}); + } + $(window).on('load',function() { resizeHeight(treeview); }); +} +/* @license-end */ diff --git a/docs/html/rosenblatt_8cpp.html b/docs/html/rosenblatt_8cpp.html new file mode 100644 index 00000000..ea71d671 --- /dev/null +++ b/docs/html/rosenblatt_8cpp.html @@ -0,0 +1,395 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: rosenblatt.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Functions
    +
    rosenblatt.cpp File Reference
    +
    +
    + +

    Tools related to Rosenblatt transformation. +More...

    +
    #include <math.h>
    +#include <iostream>
    +#include <float.h>
    +#include "Array1D.h"
    +#include "Array2D.h"
    +#include "tools.h"
    +#include "arraytools.h"
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Functions

    void invRos (Array1D< double > &unif, Array2D< double > &xi, Array1D< double > &newXi, Array1D< double > &sig)
     Generates a new sample by inverse Rosenblatt defined by a given sample set (xi) and a 'uniform' sample from the unit hypercube.
     
    void invRos (Array1D< double > &unif, Array2D< double > &xi, Array1D< double > &newXi, double bw)
     This is a version of invRos() with the same bandwidth (bw) for all dimensions.
     
    void invRos (Array1D< double > &unif, Array2D< double > &xi, Array1D< double > &newXi)
     This is a version of invRos() with an automatic bandwidth selection based on a rule of thumb.
     
    void invRos (Array2D< double > &unif, Array2D< double > &xi, Array2D< double > &newXi)
     This is a version of invRos() with an automatic bandwidth selection based on a rule of thumb, and operating on set of uniform samples (rather than one at a time)
     
    void get_opt_KDEbdwth (const Array2D< double > &data, Array1D< double > &bdwth)
     Calculates 'rule of thumb' optimal KDE bandwidths for a multi-dimensional data.
     
    void Rosen (Array2D< double > &xi, Array2D< double > &xi_data, Array2D< double > &unif, Array1D< double > &sig)
     Given input samples (xi), generates uniform samples by Rosenblatt map whose PDF is defined by a given sample set (xi_data)
     
    void Rosen (Array2D< double > &xi, Array2D< double > &xi_data, Array2D< double > &unif, double bw)
     This is a version of Rosen() with the same bandwidth (bw) for all dimensions.
     
    void Rosen (Array2D< double > &xi, Array2D< double > &xi_data, Array2D< double > &unif)
     This is a version of Rosen() with an automatic bandwidth selection based on a rule of thumb.
     
    +

    Detailed Description

    +

    Tools related to Rosenblatt transformation.

    +

    Function Documentation

    + +

    ◆ get_opt_KDEbdwth()

    + +
    +
    + + + + + + + + + + + +
    void get_opt_KDEbdwth (const Array2D< double > & data,
    Array1D< double > & bdwth )
    +
    + +

    Calculates 'rule of thumb' optimal KDE bandwidths for a multi-dimensional data.

    +
    Note
    Employs Silverman's rule-of-thumb, with a homemade factor adjustment accounting for samples that are near boundaries
    +
    +This rule-of-thumb is quite heuristic; use at your own risk
    +
    Parameters
    + + + +
    [in]data: 2-dimensional array of size $N\times d$ corresponding to samples
    [out]bdwth: 1-dimensional array of size $d$ for dimension-specific KDE bandwidths
    +
    +
    + +
    +
    + +

    ◆ invRos() [1/4]

    + +
    +
    + + + + + + + + + + + + + + + + +
    void invRos (Array1D< double > & unif,
    Array2D< double > & xi,
    Array1D< double > & newXi )
    +
    + +

    This is a version of invRos() with an automatic bandwidth selection based on a rule of thumb.

    +
    Note
    The rule of thumb is not always reliable. It is recommended to test various bandwidths.
    + +
    +
    + +

    ◆ invRos() [2/4]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void invRos (Array1D< double > & unif,
    Array2D< double > & xi,
    Array1D< double > & newXi,
    Array1D< double > & sig )
    +
    + +

    Generates a new sample by inverse Rosenblatt defined by a given sample set (xi) and a 'uniform' sample from the unit hypercube.

    +
    Note
    Performs inverse Rosenblatt map $\xi=R^{-1}(u)\in\mathbf{R}^d$ given a single sample of $u\in[0,1]^d$
    +
    +The command line utility app/pce_quad uses this map; see UQTk Manual entry for the app for technical description of the map
    +
    Parameters
    + + + + + +
    [in]unif: 1-dimensional array of size $d$ corresponding to a sample $u\in[0,1]^d$
    [in]xi: 2-dimensional array of size $d\times M$ corresponding to samples that define the target distribution
    [out]newXi: 1-dimensional array of size $d$ corresponding to a new sample $\xi=R^{-1}(u)\in\mathbf{R}^d$
    [in]sig: 1-dimensional array of size $d$ for dimension-specific KDE bandwidths
    +
    +
    + +
    +
    + +

    ◆ invRos() [3/4]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void invRos (Array1D< double > & unif,
    Array2D< double > & xi,
    Array1D< double > & newXi,
    double bw )
    +
    + +

    This is a version of invRos() with the same bandwidth (bw) for all dimensions.

    + +
    +
    + +

    ◆ invRos() [4/4]

    + +
    +
    + + + + + + + + + + + + + + + + +
    void invRos (Array2D< double > & unif,
    Array2D< double > & xi,
    Array2D< double > & newXi )
    +
    + +

    This is a version of invRos() with an automatic bandwidth selection based on a rule of thumb, and operating on set of uniform samples (rather than one at a time)

    +
    Parameters
    + + + + +
    [in]unif: 2-dimensional array of size $N\times d$ corresponding to N samples $u\in[0,1]^d$ (uniform)
    [in]xi: 2-dimensional array of size $d\times M$ corresponding to samples that define the arbitrary target distribution
    [out]newXi: 2-dimensional array of size $N\times d$ corresponding to a set of N new samples $\xi=R^{-1}(u)\in\mathbf{R}^d$
    +
    +
    +
    Note
    The rule of thumb is not always reliable. It is recommended to test various bandwidths.
    + +
    +
    + +

    ◆ Rosen() [1/3]

    + +
    +
    + + + + + + + + + + + + + + + + +
    void Rosen (Array2D< double > & xi,
    Array2D< double > & xi_data,
    Array2D< double > & unif )
    +
    + +

    This is a version of Rosen() with an automatic bandwidth selection based on a rule of thumb.

    +
    Note
    The rule of thumb is not always reliable. It is recommended to test various bandwidths.
    + +
    +
    + +

    ◆ Rosen() [2/3]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void Rosen (Array2D< double > & xi,
    Array2D< double > & xi_data,
    Array2D< double > & unif,
    Array1D< double > & sig )
    +
    + +

    Given input samples (xi), generates uniform samples by Rosenblatt map whose PDF is defined by a given sample set (xi_data)

    +
    Note
    Performs Rosenblatt map $u=R(\xi)$ given multiple samples of $\xi$
    +
    Parameters
    + + + + + +
    [in]xi: 2-dimensional array of size $N\times d$ for input samples $\xi$ of the Rosenblatt map
    [in]xi_data: 2-dimensional array of size $M\times d$ corresponding to samples $\xi_d$ from PDF defining the Rosenblatt map
    [out]unif: 2-dimensional array of size $N\times d$ for output samples of the Rosenblatt map; will land in $[0,1]^d$ if the input $\xi$ is sampled from the PDF of $\xi_d$
    [in]sig: 1-dimensional array of size $d$ for dimension-specific KDE bandwidths
    +
    +
    + +
    +
    + +

    ◆ Rosen() [3/3]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void Rosen (Array2D< double > & xi,
    Array2D< double > & xi_data,
    Array2D< double > & unif,
    double bw )
    +
    + +

    This is a version of Rosen() with the same bandwidth (bw) for all dimensions.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/rosenblatt_8h.html b/docs/html/rosenblatt_8h.html new file mode 100644 index 00000000..f88e9aa0 --- /dev/null +++ b/docs/html/rosenblatt_8h.html @@ -0,0 +1,390 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: rosenblatt.h File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Functions
    +
    rosenblatt.h File Reference
    +
    +
    + +

    Header for tools related to Rosenblatt transformation. +More...

    + +

    Go to the source code of this file.

    + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Functions

    void invRos (Array1D< double > &unif, Array2D< double > &xi, Array1D< double > &newXi, Array1D< double > &sig)
     Generates a new sample by inverse Rosenblatt defined by a given sample set (xi) and a 'uniform' sample from the unit hypercube.
     
    void invRos (Array1D< double > &unif, Array2D< double > &xi, Array1D< double > &newXi, double bw)
     This is a version of invRos() with the same bandwidth (bw) for all dimensions.
     
    void invRos (Array1D< double > &unif, Array2D< double > &xi, Array1D< double > &newXi)
     This is a version of invRos() with an automatic bandwidth selection based on a rule of thumb.
     
    void invRos (Array2D< double > &unif, Array2D< double > &xi, Array2D< double > &newXi)
     This is a version of invRos() with an automatic bandwidth selection based on a rule of thumb, and operating on set of uniform samples (rather than one at a time)
     
    void get_opt_KDEbdwth (const Array2D< double > &data, Array1D< double > &bdwth)
     Calculates 'rule of thumb' optimal KDE bandwidths for a multi-dimensional data.
     
    void Rosen (Array2D< double > &xi, Array2D< double > &xi_data, Array2D< double > &unif, Array1D< double > &sig)
     Given input samples (xi), generates uniform samples by Rosenblatt map whose PDF is defined by a given sample set (xi_data)
     
    void Rosen (Array2D< double > &xi, Array2D< double > &xi_data, Array2D< double > &unif, double bw)
     This is a version of Rosen() with the same bandwidth (bw) for all dimensions.
     
    void Rosen (Array2D< double > &xi, Array2D< double > &xi_data, Array2D< double > &unif)
     This is a version of Rosen() with an automatic bandwidth selection based on a rule of thumb.
     
    +

    Detailed Description

    +

    Header for tools related to Rosenblatt transformation.

    +

    Function Documentation

    + +

    ◆ get_opt_KDEbdwth()

    + +
    +
    + + + + + + + + + + + +
    void get_opt_KDEbdwth (const Array2D< double > & data,
    Array1D< double > & bdwth )
    +
    + +

    Calculates 'rule of thumb' optimal KDE bandwidths for a multi-dimensional data.

    +
    Note
    Employs Silverman's rule-of-thumb, with a homemade factor adjustment accounting for samples that are near boundaries
    +
    +This rule-of-thumb is quite heuristic; use at your own risk
    +
    Parameters
    + + + +
    [in]data: 2-dimensional array of size $N\times d$ corresponding to samples
    [out]bdwth: 1-dimensional array of size $d$ for dimension-specific KDE bandwidths
    +
    +
    + +
    +
    + +

    ◆ invRos() [1/4]

    + +
    +
    + + + + + + + + + + + + + + + + +
    void invRos (Array1D< double > & unif,
    Array2D< double > & xi,
    Array1D< double > & newXi )
    +
    + +

    This is a version of invRos() with an automatic bandwidth selection based on a rule of thumb.

    +
    Note
    The rule of thumb is not always reliable. It is recommended to test various bandwidths.
    + +
    +
    + +

    ◆ invRos() [2/4]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void invRos (Array1D< double > & unif,
    Array2D< double > & xi,
    Array1D< double > & newXi,
    Array1D< double > & sig )
    +
    + +

    Generates a new sample by inverse Rosenblatt defined by a given sample set (xi) and a 'uniform' sample from the unit hypercube.

    +
    Note
    Performs inverse Rosenblatt map $\xi=R^{-1}(u)\in\mathbf{R}^d$ given a single sample of $u\in[0,1]^d$
    +
    +The command line utility app/pce_quad uses this map; see UQTk Manual entry for the app for technical description of the map
    +
    Parameters
    + + + + + +
    [in]unif: 1-dimensional array of size $d$ corresponding to a sample $u\in[0,1]^d$
    [in]xi: 2-dimensional array of size $d\times M$ corresponding to samples that define the target distribution
    [out]newXi: 1-dimensional array of size $d$ corresponding to a new sample $\xi=R^{-1}(u)\in\mathbf{R}^d$
    [in]sig: 1-dimensional array of size $d$ for dimension-specific KDE bandwidths
    +
    +
    + +
    +
    + +

    ◆ invRos() [3/4]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void invRos (Array1D< double > & unif,
    Array2D< double > & xi,
    Array1D< double > & newXi,
    double bw )
    +
    + +

    This is a version of invRos() with the same bandwidth (bw) for all dimensions.

    + +
    +
    + +

    ◆ invRos() [4/4]

    + +
    +
    + + + + + + + + + + + + + + + + +
    void invRos (Array2D< double > & unif,
    Array2D< double > & xi,
    Array2D< double > & newXi )
    +
    + +

    This is a version of invRos() with an automatic bandwidth selection based on a rule of thumb, and operating on set of uniform samples (rather than one at a time)

    +
    Parameters
    + + + + +
    [in]unif: 2-dimensional array of size $N\times d$ corresponding to N samples $u\in[0,1]^d$ (uniform)
    [in]xi: 2-dimensional array of size $d\times M$ corresponding to samples that define the arbitrary target distribution
    [out]newXi: 2-dimensional array of size $N\times d$ corresponding to a set of N new samples $\xi=R^{-1}(u)\in\mathbf{R}^d$
    +
    +
    +
    Note
    The rule of thumb is not always reliable. It is recommended to test various bandwidths.
    + +
    +
    + +

    ◆ Rosen() [1/3]

    + +
    +
    + + + + + + + + + + + + + + + + +
    void Rosen (Array2D< double > & xi,
    Array2D< double > & xi_data,
    Array2D< double > & unif )
    +
    + +

    This is a version of Rosen() with an automatic bandwidth selection based on a rule of thumb.

    +
    Note
    The rule of thumb is not always reliable. It is recommended to test various bandwidths.
    + +
    +
    + +

    ◆ Rosen() [2/3]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void Rosen (Array2D< double > & xi,
    Array2D< double > & xi_data,
    Array2D< double > & unif,
    Array1D< double > & sig )
    +
    + +

    Given input samples (xi), generates uniform samples by Rosenblatt map whose PDF is defined by a given sample set (xi_data)

    +
    Note
    Performs Rosenblatt map $u=R(\xi)$ given multiple samples of $\xi$
    +
    Parameters
    + + + + + +
    [in]xi: 2-dimensional array of size $N\times d$ for input samples $\xi$ of the Rosenblatt map
    [in]xi_data: 2-dimensional array of size $M\times d$ corresponding to samples $\xi_d$ from PDF defining the Rosenblatt map
    [out]unif: 2-dimensional array of size $N\times d$ for output samples of the Rosenblatt map; will land in $[0,1]^d$ if the input $\xi$ is sampled from the PDF of $\xi_d$
    [in]sig: 1-dimensional array of size $d$ for dimension-specific KDE bandwidths
    +
    +
    + +
    +
    + +

    ◆ Rosen() [3/3]

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void Rosen (Array2D< double > & xi,
    Array2D< double > & xi_data,
    Array2D< double > & unif,
    double bw )
    +
    + +

    This is a version of Rosen() with the same bandwidth (bw) for all dimensions.

    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/rosenblatt_8h_source.html b/docs/html/rosenblatt_8h_source.html new file mode 100644 index 00000000..07c2b183 --- /dev/null +++ b/docs/html/rosenblatt_8h_source.html @@ -0,0 +1,124 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: rosenblatt.h Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    rosenblatt.h
    +
    +
    +Go to the documentation of this file.
    1/* =====================================================================================
    +
    2
    +
    3 The UQ Toolkit (UQTk) version 3.1.5
    +
    4 Copyright (2024) NTESS
    +
    5 https://www.sandia.gov/UQToolkit/
    +
    6 https://github.com/sandialabs/UQTk
    +
    7
    +
    8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
    +
    9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
    +
    10 retains certain rights in this software.
    +
    11
    +
    12 This file is part of The UQ Toolkit (UQTk)
    +
    13
    +
    14 UQTk is open source software: you can redistribute it and/or modify
    +
    15 it under the terms of BSD 3-Clause License
    +
    16
    +
    17 UQTk is distributed in the hope that it will be useful,
    +
    18 but WITHOUT ANY WARRANTY; without even the implied warranty of
    +
    19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    +
    20 BSD 3 Clause License for more details.
    +
    21
    +
    22 You should have received a copy of the BSD 3 Clause License
    +
    23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
    +
    24
    +
    25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
    +
    26 Sandia National Laboratories, Livermore, CA, USA
    +
    27===================================================================================== */
    +
    30#ifndef ROSENBLATT_H
    +
    31#define ROSENBLATT_H
    +
    32
    +
    33
    +
    41void invRos(Array1D<double>& unif, Array2D<double>& xi, Array1D<double>& newXi, Array1D<double>& sig);
    +
    42
    +
    44void invRos(Array1D<double>& unif, Array2D<double>& xi, Array1D<double>& newXi, double bw);
    +
    45
    +
    48void invRos(Array1D<double>& unif, Array2D<double>& xi, Array1D<double>& newXi);
    +
    49
    +
    56void invRos(Array2D<double>& unif, Array2D<double>& xi, Array2D<double>& newXi);
    +
    57
    +
    63void get_opt_KDEbdwth(const Array2D<double>& data, Array1D<double>& bdwth);
    +
    64
    +
    71void Rosen(Array2D<double>& xi, Array2D<double>& xi_data, Array2D<double>& unif, Array1D<double>& sig);
    +
    72
    +
    74void Rosen(Array2D<double>& xi, Array2D<double>& xi_data, Array2D<double>& unif, double bw);
    +
    75
    +
    78void Rosen(Array2D<double>& xi, Array2D<double>& xi_data, Array2D<double>& unif);
    +
    79
    +
    80
    +
    81#endif // ROSENBLATT_H
    +
    Array1D
    Stores data of any type T in a 1D array.
    Definition Array1D.h:61
    +
    Array2D
    Stores data of any type T in a 2D array.
    Definition Array2D.h:60
    +
    Rosen
    void Rosen(Array2D< double > &xi, Array2D< double > &xi_data, Array2D< double > &unif, Array1D< double > &sig)
    Given input samples (xi), generates uniform samples by Rosenblatt map whose PDF is defined by a given...
    Definition rosenblatt.cpp:272
    +
    get_opt_KDEbdwth
    void get_opt_KDEbdwth(const Array2D< double > &data, Array1D< double > &bdwth)
    Calculates 'rule of thumb' optimal KDE bandwidths for a multi-dimensional data.
    Definition rosenblatt.cpp:209
    +
    invRos
    void invRos(Array1D< double > &unif, Array2D< double > &xi, Array1D< double > &newXi, Array1D< double > &sig)
    Generates a new sample by inverse Rosenblatt defined by a given sample set (xi) and a 'uniform' sampl...
    Definition rosenblatt.cpp:41
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/sens_8cpp.html b/docs/html/sens_8cpp.html new file mode 100644 index 00000000..33646961 --- /dev/null +++ b/docs/html/sens_8cpp.html @@ -0,0 +1,214 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: sens.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros | +Functions
    +
    sens.cpp File Reference
    +
    +
    +
    #include <cstdio>
    +#include <stddef.h>
    +#include <fstream>
    +#include <string>
    +#include <math.h>
    +#include <iostream>
    +#include <sstream>
    +#include <stdlib.h>
    +#include "assert.h"
    +#include <getopt.h>
    +#include "Array2D.h"
    +#include "tools.h"
    +#include "arrayio.h"
    +#include "arraytools.h"
    +#include "error_handlers.h"
    +#include "ftndefs.h"
    +#include "depblas.h"
    +#include "deplapack.h"
    +
    + + + +

    +Macros

    #define VERB
     
    + + + + + + + + + +

    +Functions

    double arrayMean (int n, double *a)
     
    double arrayVar (int n, double *a, double aMean, int ddof)
     
    void usage ()
     
    int main (int argc, char *argv[])
     
    +

    Macro Definition Documentation

    + +

    ◆ VERB

    + +
    +
    + + + + +
    #define VERB
    +
    + +
    +
    +

    Function Documentation

    + +

    ◆ arrayMean()

    + +
    +
    + + + + + + + + + + + +
    double arrayMean (int n,
    double * a )
    +
    + +
    +
    + +

    ◆ arrayVar()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    double arrayVar (int n,
    double * a,
    double aMean,
    int ddof )
    +
    + +
    +
    + +

    ◆ main()

    + +
    +
    + + + + + + + + + + + +
    int main (int argc,
    char * argv[] )
    +
    + +
    +
    + +

    ◆ usage()

    + +
    +
    + + + + + + + +
    void usage ()
    +
    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/splitbar.png b/docs/html/splitbar.png new file mode 100644 index 0000000000000000000000000000000000000000..fe895f2c58179b471a22d8320b39a4bd7312ec8e GIT binary patch literal 314 zcmeAS@N?(olHy`uVBq!ia0vp^Yzz!63>-{AmhX=Jf(#6djGiuzAr*{o?=JLmPLyc> z_*`QK&+BH@jWrYJ7>r6%keRM@)Qyv8R=enp0jiI>aWlGyB58O zFVR20d+y`K7vDw(hJF3;>dD*3-?v=<8M)@x|EEGLnJsniYK!2U1 Y!`|5biEc?d1`HDhPgg&ebxsLQ02F6;9RL6T literal 0 HcmV?d00001 diff --git a/docs/html/splitbard.png b/docs/html/splitbard.png new file mode 100644 index 0000000000000000000000000000000000000000..8367416d757fd7b6dc4272b6432dc75a75abd068 GIT binary patch literal 282 zcmeAS@N?(olHy`uVBq!ia0vp^Yzz!63>-{AmhX=Jf@VhhFKy35^fiT zT~&lUj3=cDh^%3HDY9k5CEku}PHXNoNC(_$U3XPb&Q*ME25pT;2(*BOgAf<+R$lzakPG`kF31()Fx{L5Wrac|GQzjeE= zueY1`Ze{#x<8=S|`~MgGetGce)#vN&|J{Cd^tS%;tBYTo?+^d68<#n_Y_xx`J||4O V@QB{^CqU0Kc)I$ztaD0e0svEzbJzd? literal 0 HcmV?d00001 diff --git a/docs/html/structMCMC_1_1chainstate-members.html b/docs/html/structMCMC_1_1chainstate-members.html new file mode 100644 index 00000000..5d21abb1 --- /dev/null +++ b/docs/html/structMCMC_1_1chainstate-members.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    MCMC::chainstate Member List
    +
    +
    + +

    This is the complete list of members for MCMC::chainstate, including all inherited members.

    + + + + + +
    alfaMCMC::chainstate
    postMCMC::chainstate
    stateMCMC::chainstate
    stepMCMC::chainstate
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/structMCMC_1_1chainstate.html b/docs/html/structMCMC_1_1chainstate.html new file mode 100644 index 00000000..2c101025 --- /dev/null +++ b/docs/html/structMCMC_1_1chainstate.html @@ -0,0 +1,147 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: MCMC::chainstate Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Public Attributes | +List of all members
    +
    MCMC::chainstate Struct Reference
    +
    +
    + +

    #include <mcmc.h>

    + + + + + + + + + + +

    +Public Attributes

    int step
     
    Array1D< double > state
     
    double alfa
     
    double post
     
    +

    Member Data Documentation

    + +

    ◆ alfa

    + +
    +
    + + + + +
    double MCMC::chainstate::alfa
    +
    + +
    +
    + +

    ◆ post

    + +
    +
    + + + + +
    double MCMC::chainstate::post
    +
    + +
    +
    + +

    ◆ state

    + +
    +
    + + + + +
    Array1D<double> MCMC::chainstate::state
    +
    + +
    +
    + +

    ◆ step

    + +
    +
    + + + + +
    int MCMC::chainstate::step
    +
    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/structMCMC_1_1outputInfo-members.html b/docs/html/structMCMC_1_1outputInfo-members.html new file mode 100644 index 00000000..21c7d51d --- /dev/null +++ b/docs/html/structMCMC_1_1outputInfo-members.html @@ -0,0 +1,77 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    MCMC::outputInfo Member List
    +
    +
    + +

    This is the complete list of members for MCMC::outputInfo, including all inherited members.

    + + + + + +
    filenameMCMC::outputInfo
    freq_fileMCMC::outputInfo
    freq_screenMCMC::outputInfo
    outtypeMCMC::outputInfo
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/structMCMC_1_1outputInfo.html b/docs/html/structMCMC_1_1outputInfo.html new file mode 100644 index 00000000..c2ddbcd3 --- /dev/null +++ b/docs/html/structMCMC_1_1outputInfo.html @@ -0,0 +1,145 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: MCMC::outputInfo Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Public Attributes | +List of all members
    +
    MCMC::outputInfo Struct Reference
    +
    +
    + + + + + + + + + + +

    +Public Attributes

    string outtype
     
    string filename
     
    int freq_file
     
    int freq_screen
     
    +

    Member Data Documentation

    + +

    ◆ filename

    + +
    +
    + + + + +
    string MCMC::outputInfo::filename
    +
    + +
    +
    + +

    ◆ freq_file

    + +
    +
    + + + + +
    int MCMC::outputInfo::freq_file
    +
    + +
    +
    + +

    ◆ freq_screen

    + +
    +
    + + + + +
    int MCMC::outputInfo::freq_screen
    +
    + +
    +
    + +

    ◆ outtype

    + +
    +
    + + + + +
    string MCMC::outputInfo::outtype
    +
    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/structQuad_1_1QuadRule-members.html b/docs/html/structQuad_1_1QuadRule-members.html new file mode 100644 index 00000000..61f3980a --- /dev/null +++ b/docs/html/structQuad_1_1QuadRule-members.html @@ -0,0 +1,75 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    Quad::QuadRule Member List
    +
    +
    + +

    This is the complete list of members for Quad::QuadRule, including all inherited members.

    + + + +
    qdptsQuad::QuadRule
    wghtsQuad::QuadRule
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/structQuad_1_1QuadRule.html b/docs/html/structQuad_1_1QuadRule.html new file mode 100644 index 00000000..c82fb0c1 --- /dev/null +++ b/docs/html/structQuad_1_1QuadRule.html @@ -0,0 +1,124 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Quad::QuadRule Struct Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Public Attributes | +List of all members
    +
    Quad::QuadRule Struct Reference
    +
    +
    + +

    Rule structure that stores quadrature points, weights and indices. + More...

    + + + + + + + + +

    +Public Attributes

    Array2D< double > qdpts
     Quadrature points.
     
    Array1D< double > wghts
     Quadrature weights.
     
    +

    Detailed Description

    +

    Rule structure that stores quadrature points, weights and indices.

    +

    Member Data Documentation

    + +

    ◆ qdpts

    + +
    +
    + + + + +
    Array2D<double> Quad::QuadRule::qdpts
    +
    + +

    Quadrature points.

    + +
    +
    + +

    ◆ wghts

    + +
    +
    + + + + +
    Array1D<double> Quad::QuadRule::wghts
    +
    + +

    Quadrature weights.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/sync_off.png b/docs/html/sync_off.png new file mode 100644 index 0000000000000000000000000000000000000000..3b443fc62892114406e3d399421b2a881b897acc GIT binary patch literal 853 zcmV-b1FHOqP)oT|#XixUYy%lpuf3i8{fX!o zUyDD0jOrAiT^tq>fLSOOABs-#u{dV^F$b{L9&!2=9&RmV;;8s^x&UqB$PCj4FdKbh zoB1WTskPUPu05XzFbA}=KZ-GP1fPpAfSs>6AHb12UlR%-i&uOlTpFNS7{jm@mkU1V zh`nrXr~+^lsV-s1dkZOaI|kYyVj3WBpPCY{n~yd%u%e+d=f%`N0FItMPtdgBb@py; zq@v6NVArhyTC7)ULw-Jy8y42S1~4n(3LkrW8mW(F-4oXUP3E`e#g**YyqI7h-J2zK zK{m9##m4ri!7N>CqQqCcnI3hqo1I;Yh&QLNY4T`*ptiQGozK>FF$!$+84Z`xwmeMh zJ0WT+OH$WYFALEaGj2_l+#DC3t7_S`vHpSivNeFbP6+r50cO8iu)`7i%Z4BTPh@_m3Tk!nAm^)5Bqnr%Ov|Baunj#&RPtRuK& z4RGz|D5HNrW83-#ydk}tVKJrNmyYt-sTxLGlJY5nc&Re zU4SgHNPx8~Yxwr$bsju?4q&%T1874xxzq+_%?h8_ofw~(bld=o3iC)LUNR*BY%c0y zWd_jX{Y8`l%z+ol1$@Qa?Cy!(0CVIEeYpKZ`(9{z>3$CIe;pJDQk$m3p}$>xBm4lb zKo{4S)`wdU9Ba9jJbVJ0C=SOefZe%d$8=2r={nu<_^a3~>c#t_U6dye5)JrR(_a^E f@}b6j1K9lwFJq@>o)+Ry00000NkvXXu0mjfWa5j* literal 0 HcmV?d00001 diff --git a/docs/html/sync_on.png b/docs/html/sync_on.png new file mode 100644 index 0000000000000000000000000000000000000000..e08320fb64e6fa33b573005ed6d8fe294e19db76 GIT binary patch literal 845 zcmV-T1G4;yP)Y;xxyHF2B5Wzm| zOOGupOTn@c(JmBOl)e;XMNnZuiTJP>rM8<|Q`7I_))aP?*T)ow&n59{}X4$3Goat zgjs?*aasfbrokzG5cT4K=uG`E14xZl@z)F={P0Y^?$4t z>v!teRnNZym<6h{7sLyF1V0HsfEl+l6TrZpsfr1}luH~F7L}ktXu|*uVX^RG$L0`K zWs3j|0tIvVe(N%_?2{(iCPFGf#B6Hjy6o&}D$A%W%jfO8_W%ZO#-mh}EM$LMn7joJ z05dHr!5Y92g+31l<%i1(=L1a1pXX+OYnalY>31V4K}BjyRe3)9n#;-cCVRD_IG1fT zOKGeNY8q;TL@K{dj@D^scf&VCs*-Jb>8b>|`b*osv52-!A?BpbYtTQBns5EAU**$m zSnVSm(teh>tQi*S*A>#ySc=n;`BHz`DuG4&g4Kf8lLhca+zvZ7t7RflD6-i-mcK=M z!=^P$*u2)bkY5asG4gsss!Hn%u~>}kIW`vMs%lJLH+u*9<4PaV_c6U`KqWXQH%+Nu zTv41O(^ZVi@qhjQdG!fbZw&y+2o!iYymO^?ud3{P*HdoX83YV*Uu_HB=?U&W9%AU# z80}k1SS-CXTU7dcQlsm<^oYLxVSseqY6NO}dc`Nj?8vrhNuCdm@^{a3AQ_>6myOj+ z`1RsLUXF|dm|3k7s2jD(B{rzE>WI2scH8i1;=O5Cc9xB3^aJk%fQjqsu+kH#0=_5a z0nCE8@dbQa-|YIuUVvG0L_IwHMEhOj$Mj4Uq05 X8=0q~qBNan00000NkvXXu0mjfptF>5 literal 0 HcmV?d00001 diff --git a/docs/html/tab_a.png b/docs/html/tab_a.png new file mode 100644 index 0000000000000000000000000000000000000000..3b725c41c5a527a3a3e40097077d0e206a681247 GIT binary patch literal 142 zcmeAS@N?(olHy`uVBq!ia0vp^j6kfy!2~3aiye;!QlXwMjv*C{Z|8b*H5dputLHD# z=<0|*y7z(Vor?d;H&?EG&cXR}?!j-Lm&u1OOI7AIF5&c)RFE;&p0MYK>*Kl@eiymD r@|NpwKX@^z+;{u_Z~trSBfrMKa%3`zocFjEXaR$#tDnm{r-UW|TZ1%4 literal 0 HcmV?d00001 diff --git a/docs/html/tab_ad.png b/docs/html/tab_ad.png new file mode 100644 index 0000000000000000000000000000000000000000..e34850acfc24be58da6d2fd1ccc6b29cc84fe34d GIT binary patch literal 135 zcmeAS@N?(olHy`uVBq!ia0vp^j6kfy!2~3aiye;!QhuH;jv*C{Z|5d*H3V=pKi{In zd2jxLclDRPylmD}^l7{QOtL{vUjO{-WqItb5sQp2h-99b8^^Scr-=2mblCdZuUm?4 jzOJvgvt3{(cjKLW5(A@0qPS@<&}0TrS3j3^P6y&q2{!U5bk+Tso_B!YCpDh>v z{CM*1U8YvQRyBUHt^Ju0W_sq-?;9@_4equ-bavTs=gk796zopr0EBT&m;e9( literal 0 HcmV?d00001 diff --git a/docs/html/tab_s.png b/docs/html/tab_s.png new file mode 100644 index 0000000000000000000000000000000000000000..ab478c95b67371d700a20869f7de1ddd73522d50 GIT binary patch literal 184 zcmeAS@N?(olHy`uVBq!ia0vp^j6kfy!2~3aiye;!QuUrLjv*C{Z|^p8HaRdjTwH7) zC?wLlL}}I{)n%R&r+1}IGmDnq;&J#%V6)9VsYhS`O^BVBQlxOUep0c$RENLq#g8A$ z)z7%K_bI&n@J+X_=x}fJoEKed-$<>=ZI-;YrdjIl`U`uzuDWSP?o#Dmo{%SgM#oan kX~E1%D-|#H#QbHoIja2U-MgvsK&LQxy85}Sb4q9e0Efg%P5=M^ literal 0 HcmV?d00001 diff --git a/docs/html/tab_sd.png b/docs/html/tab_sd.png new file mode 100644 index 0000000000000000000000000000000000000000..757a565ced4730f85c833fb2547d8e199ae68f19 GIT binary patch literal 188 zcmeAS@N?(olHy`uVBq!ia0vp^j6kfy!2~3aiye;!Qq7(&jv*C{Z|_!fH5o7*c=%9% zcILh!EA=pAQKdx-Cdiev=v{eg{8Ht<{e8_NAN~b=)%W>-WDCE0PyDHGemi$BoXwcK z{>e9^za6*c1ilttWw&V+U;WCPlV9{LdC~Ey%_H(qj`xgfES(4Yz5jSTZfCt`4E$0YRsR*S^mTCR^;V&sxC8{l_Cp7w8-YPgg&ebxsLQ00$vXK>z>% literal 0 HcmV?d00001 diff --git a/docs/html/tabs.css b/docs/html/tabs.css new file mode 100644 index 00000000..7fa4268a --- /dev/null +++ b/docs/html/tabs.css @@ -0,0 +1 @@ +.sm{position:relative;z-index:9999}.sm,.sm ul,.sm li{display:block;list-style:none;margin:0;padding:0;line-height:normal;direction:ltr;text-align:left;-webkit-tap-highlight-color:rgba(0,0,0,0)}.sm-rtl,.sm-rtl ul,.sm-rtl li{direction:rtl;text-align:right}.sm>li>h1,.sm>li>h2,.sm>li>h3,.sm>li>h4,.sm>li>h5,.sm>li>h6{margin:0;padding:0}.sm ul{display:none}.sm li,.sm a{position:relative}.sm a{display:block}.sm a.disabled{cursor:not-allowed}.sm:after{content:"\00a0";display:block;height:0;font:0/0 serif;clear:both;visibility:hidden;overflow:hidden}.sm,.sm *,.sm *:before,.sm *:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}.main-menu-btn{position:relative;display:inline-block;width:36px;height:36px;text-indent:36px;margin-left:8px;white-space:nowrap;overflow:hidden;cursor:pointer;-webkit-tap-highlight-color:rgba(0,0,0,0)}.main-menu-btn-icon,.main-menu-btn-icon:before,.main-menu-btn-icon:after{position:absolute;top:50%;left:2px;height:2px;width:24px;background:var(--nav-menu-button-color);-webkit-transition:all .25s;transition:all .25s}.main-menu-btn-icon:before{content:'';top:-7px;left:0}.main-menu-btn-icon:after{content:'';top:7px;left:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon{height:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:before{top:0;-webkit-transform:rotate(-45deg);transform:rotate(-45deg)}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:after{top:0;-webkit-transform:rotate(45deg);transform:rotate(45deg)}#main-menu-state{position:absolute;width:1px;height:1px;margin:-1px;border:0;padding:0;overflow:hidden;clip:rect(1px,1px,1px,1px)}#main-menu-state:not(:checked) ~ #main-menu{display:none}#main-menu-state:checked ~ #main-menu{display:block}@media(min-width:768px){.main-menu-btn{position:absolute;top:-99999px}#main-menu-state:not(:checked) ~ #main-menu{display:block}}.sm-dox{background-image:var(--nav-gradient-image)}.sm-dox a,.sm-dox a:focus,.sm-dox a:hover,.sm-dox a:active{padding:0 12px;padding-right:43px;font-family:var(--font-family-nav);font-size:13px;font-weight:bold;line-height:36px;text-decoration:none;text-shadow:var(--nav-text-normal-shadow);color:var(--nav-text-normal-color);outline:0}.sm-dox a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:var(--nav-text-hover-shadow)}.sm-dox a.current{color:#d23600}.sm-dox a.disabled{color:#bbb}.sm-dox a span.sub-arrow{position:absolute;top:50%;margin-top:-14px;left:auto;right:3px;width:28px;height:28px;overflow:hidden;font:bold 12px/28px monospace !important;text-align:center;text-shadow:none;background:var(--nav-menu-toggle-color);-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox a span.sub-arrow:before{display:block;content:'+'}.sm-dox a.highlighted span.sub-arrow:before{display:block;content:'-'}.sm-dox>li:first-child>a,.sm-dox>li:first-child>:not(ul) a{-moz-border-radius:5px 5px 0 0;-webkit-border-radius:5px;border-radius:5px 5px 0 0}.sm-dox>li:last-child>a,.sm-dox>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul{-moz-border-radius:0 0 5px 5px;-webkit-border-radius:0;border-radius:0 0 5px 5px}.sm-dox>li:last-child>a.highlighted,.sm-dox>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted{-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox ul{background:var(--nav-menu-background-color)}.sm-dox ul a,.sm-dox ul a:focus,.sm-dox ul a:hover,.sm-dox ul a:active{font-size:12px;border-left:8px solid transparent;line-height:36px;text-shadow:none;background-color:var(--nav-menu-background-color);background-image:none}.sm-dox ul a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:0 1px 1px black}.sm-dox ul ul a,.sm-dox ul ul a:hover,.sm-dox ul ul a:focus,.sm-dox ul ul a:active{border-left:16px solid transparent}.sm-dox ul ul ul a,.sm-dox ul ul ul a:hover,.sm-dox ul ul ul a:focus,.sm-dox ul ul ul a:active{border-left:24px solid transparent}.sm-dox ul ul ul ul a,.sm-dox ul ul ul ul a:hover,.sm-dox ul ul ul ul a:focus,.sm-dox ul ul ul ul a:active{border-left:32px solid transparent}.sm-dox ul ul ul ul ul a,.sm-dox ul ul ul ul ul a:hover,.sm-dox ul ul ul ul ul a:focus,.sm-dox ul ul ul ul ul a:active{border-left:40px solid transparent}@media(min-width:768px){.sm-dox ul{position:absolute;width:12em}.sm-dox li{float:left}.sm-dox.sm-rtl li{float:right}.sm-dox ul li,.sm-dox.sm-rtl ul li,.sm-dox.sm-vertical li{float:none}.sm-dox a{white-space:nowrap}.sm-dox ul a,.sm-dox.sm-vertical a{white-space:normal}.sm-dox .sm-nowrap>li>a,.sm-dox .sm-nowrap>li>:not(ul) a{white-space:nowrap}.sm-dox{padding:0 10px;background-image:var(--nav-gradient-image);line-height:36px}.sm-dox a span.sub-arrow{top:50%;margin-top:-2px;right:12px;width:0;height:0;border-width:4px;border-style:solid dashed dashed dashed;border-color:var(--nav-text-normal-color) transparent transparent transparent;background:transparent;-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox a,.sm-dox a:focus,.sm-dox a:active,.sm-dox a:hover,.sm-dox a.highlighted{padding:0 12px;background-image:var(--nav-separator-image);background-repeat:no-repeat;background-position:right;-moz-border-radius:0 !important;-webkit-border-radius:0;border-radius:0 !important}.sm-dox a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:var(--nav-text-hover-shadow)}.sm-dox a:hover span.sub-arrow{border-color:var(--nav-text-hover-color) transparent transparent transparent}.sm-dox a.has-submenu{padding-right:24px}.sm-dox li{border-top:0}.sm-dox>li>ul:before,.sm-dox>li>ul:after{content:'';position:absolute;top:-18px;left:30px;width:0;height:0;overflow:hidden;border-width:9px;border-style:dashed dashed solid dashed;border-color:transparent transparent #bbb transparent}.sm-dox>li>ul:after{top:-16px;left:31px;border-width:8px;border-color:transparent transparent var(--nav-menu-background-color) transparent}.sm-dox ul{border:1px solid #bbb;padding:5px 0;background:var(--nav-menu-background-color);-moz-border-radius:5px !important;-webkit-border-radius:5px;border-radius:5px !important;-moz-box-shadow:0 5px 9px rgba(0,0,0,0.2);-webkit-box-shadow:0 5px 9px rgba(0,0,0,0.2);box-shadow:0 5px 9px rgba(0,0,0,0.2)}.sm-dox ul a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-color:transparent transparent transparent var(--nav-menu-foreground-color);border-style:dashed dashed dashed solid}.sm-dox ul a,.sm-dox ul a:hover,.sm-dox ul a:focus,.sm-dox ul a:active,.sm-dox ul a.highlighted{color:var(--nav-menu-foreground-color);background-image:none;border:0 !important}.sm-dox ul a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:var(--nav-text-hover-shadow)}.sm-dox ul a:hover span.sub-arrow{border-color:transparent transparent transparent var(--nav-text-hover-color)}.sm-dox span.scroll-up,.sm-dox span.scroll-down{position:absolute;display:none;visibility:hidden;overflow:hidden;background:var(--nav-menu-background-color);height:36px}.sm-dox span.scroll-up:hover,.sm-dox span.scroll-down:hover{background:#eee}.sm-dox span.scroll-up:hover span.scroll-up-arrow,.sm-dox span.scroll-up:hover span.scroll-down-arrow{border-color:transparent transparent #d23600 transparent}.sm-dox span.scroll-down:hover span.scroll-down-arrow{border-color:#d23600 transparent transparent transparent}.sm-dox span.scroll-up-arrow,.sm-dox span.scroll-down-arrow{position:absolute;top:0;left:50%;margin-left:-6px;width:0;height:0;overflow:hidden;border-width:6px;border-style:dashed dashed solid dashed;border-color:transparent transparent var(--nav-menu-foreground-color) transparent}.sm-dox span.scroll-down-arrow{top:8px;border-style:solid dashed dashed dashed;border-color:var(--nav-menu-foreground-color) transparent transparent transparent}.sm-dox.sm-rtl a.has-submenu{padding-right:12px;padding-left:24px}.sm-dox.sm-rtl a span.sub-arrow{right:auto;left:12px}.sm-dox.sm-rtl.sm-vertical a.has-submenu{padding:10px 20px}.sm-dox.sm-rtl.sm-vertical a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-rtl>li>ul:before{left:auto;right:30px}.sm-dox.sm-rtl>li>ul:after{left:auto;right:31px}.sm-dox.sm-rtl ul a.has-submenu{padding:10px 20px !important}.sm-dox.sm-rtl ul a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-vertical{padding:10px 0;-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox.sm-vertical a{padding:10px 20px}.sm-dox.sm-vertical a:hover,.sm-dox.sm-vertical a:focus,.sm-dox.sm-vertical a:active,.sm-dox.sm-vertical a.highlighted{background:#fff}.sm-dox.sm-vertical a.disabled{background-image:var(--nav-gradient-image)}.sm-dox.sm-vertical a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-style:dashed dashed dashed solid;border-color:transparent transparent transparent #555}.sm-dox.sm-vertical>li>ul:before,.sm-dox.sm-vertical>li>ul:after{display:none}.sm-dox.sm-vertical ul a{padding:10px 20px}.sm-dox.sm-vertical ul a:hover,.sm-dox.sm-vertical ul a:focus,.sm-dox.sm-vertical ul a:active,.sm-dox.sm-vertical ul a.highlighted{background:#eee}.sm-dox.sm-vertical ul a.disabled{background:var(--nav-menu-background-color)}} diff --git a/docs/html/todo.html b/docs/html/todo.html new file mode 100644 index 00000000..5afff6d1 --- /dev/null +++ b/docs/html/todo.html @@ -0,0 +1,207 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: Todo List + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + +
    +
    +
    +
    Todo List
    +
    +
    +
    +
    Class Array1D< T >
    +
    double check copy constructor
    +
    Class Array2D< T >
    +
    Define copy constructor
    +
    Class Array3D< T >
    +

    Define copy constructor

    +

    +

    Several functions, e.g. insert/erase columns/rows, available in Array1D and Array2D, are missing.

    +
    +
    Member Array3D< T >::Resize (const size_t &nx, const size_t &ny, const size_t &nz)
    +
    Write a better implementation that preserves the original data by copying it to a temporary array and putting the elements back where they were before. This would bring this resize() command more closely in line with vector::resize() function in the original vector class.
    +
    Member Array3D< T >::Resize (const size_t &nx, const size_t &ny, const size_t &nz, const T &t)
    +
    Write an implementation that is more closely follows the resize command in the vector class, which keeps the original elements and only initializes the new elements.
    +
    File arraytools.h
    +

    Some functions are not optimal in terms of array access.

    +

    +

    Some functions should be templated and or moved to array class

    +
    +
    Member delCol (Array2D< T > &A, int icol)
    +
    This should move to Array2D class
    +
    Member delCol (Array1D< T > &x, int icol)
    +
    This should move to Array1D class
    +
    Member delRow (Array2D< T > &A, int irow)
    +
    This should move to Array2D class
    +
    Member generate_multigrid (Array2D< T > &multigrid, Array2D< T > &grid)
    +
    Should ideally be written in a recursive manner, similar to computeMultiIndexTP() in tools/multiindex.cpp
    +
    Member generate_normal_lhs (Array2D< double > &rvar, int zSeed)
    +
    LHS generation is far from optimal, it is quite slow
    +
    Member Gproc::BuildGP_inv ()
    +
    Need formal timing analysis to understand in which situations this version is preferred
    +
    Member Gproc::covariance (Array1D< double > &x1, Array1D< double > &x2, Array1D< double > &param)
    +
    put an 'if' check for covtype_
    +
    Member Gproc::EvalGP_inv (Array2D< double > &xgrid, string msc, Array1D< double > &mst)
    +
    Need formal timing analysis to understand in which situations this version is preferred
    +
    Member Gproc::getSttPars (Array1D< double > &sttmat)
    +
    check that full cov_ already defined(i.e. msc) not just diagonal
    +
    Member Gproc::getXYCov (Array2D< double > &xgrid, Array2D< double > &xycov)
    +
    check that full cov_ already defined(i.e. msc) not just diagonal
    +
    Member logdeterm (Array2D< double > &mat)
    +
    Check and catch the symmetric and positiv-definite conditions.
    +
    Member loo (int ndim, double *m, void *classpointer)
    +
    Find a more elegant way to do this within the class
    +
    Member M_PI
    +
    See if we could move this to the CMake installation scripts instead
    +
    Member main (int argc, char *argv[])
    +
    Make the input arguments more transparent, i.e. what do they mean in different scenarios?
    +
    +
    File multiindex.h
    +
    Multiindex could be a separate class and a part of core UQTk.
    +
    Member neglogPostParam (int ndim, double *m, void *classpointer)
    +
    Find a more elegant way to do this within the class
    +
    Member PCBasis::EvalBasis (const double &xi, Array1D< double > &basisEvals) const
    +
    Import the recursion coefficients in a more friendly fashion.
    +
    Member PCBasis::Init1dQuadPoints (int qdpts)
    +
    Come up with a smarter way to pick the number of quadrature points
    +
    Member PCBasis::PCBasis (const string type="LU", const double alpha=0.0, const double betta=1.0, const int maxord=10)
    +
    At some point, the basis selection should probably be implemented in a more elegant way using base and inherited classes. For the time being, Hermite-Gaussian or Legendre-Uniform will probably be the most commonly used cases. The parameters alpha and betta are relevant only for LG, SW and JB chaoses
    +
    Member PCBasis::rnstate_
    +
    need more functionalities to get/set this variable from user
    +
    File pcmaps.h
    +

    Perhaps use more robust tools, like dcdflib.

    +

    +

    Need more testing of these tools.

    +
    +
    Member PCSet::ComputeJointSens (Array1D< double > &coef, Array2D< double > &jointsens)
    +
    There is no double* version of this function
    +
    Member PCSet::ComputeMainSens (Array1D< double > &coef, Array1D< double > &mainsens)
    +
    There is no double* version of this function
    +
    Member PCSet::ComputeOrders (Array1D< int > &orders)
    +
    There is no double* version of this function
    +
    Member PCSet::ComputeTotSens (Array1D< double > &coef, Array1D< double > &totsens)
    +
    There is no double* version of this function
    +
    Member PCSet::Derivative (const double *p1, double *p2) const
    +

    Supports LU and HG bases only

    +

    +

    Supports only for 1d PCs

    +
    +
    Member PCSet::Derivative (const Array1D< double > &p1, Array1D< double > &p2) const
    +

    Supports LU and HG bases only

    +

    +

    Supports only for 1d PCs

    +
    +
    Member PCSet::Div (const double *p1, const double *p2, double *p3) const
    +
    Remove duplication of data and parameters that was required for enforcing imposed "const" constraints on some of the arguments and the class data members when they are being passed to fortran.
    +
    Member PCSet::DrawSampleVar (Array2D< double > &samples) const
    +
    There is no double* version of this function
    +
    Member PCSet::EncodeMindex (Array1D< Array2D< int > > &sp_mindex)
    +
    There is no double* version of this function
    +
    Member PCSet::EvalBasisAtCustPts (const Array2D< double > &custPoints, Array2D< double > &psi)
    +
    There is no double* version of this function
    +
    Member PCSet::EvalNormSq (Array1D< double > &normsq)
    +
    There is no double* version of this function
    +
    Member PCSet::EvalNormSqExact (Array1D< double > &normsq)
    +
    There is no double* version of this function
    +
    Member PCSet::EvalPCAtCustPoints (Array1D< double > &xch, Array2D< double > &custPoints, Array1D< double > &p)
    +
    There is no double* version of this function
    +
    Member PCSet::GalerkProjection (const Array1D< double > &fcn, Array1D< double > &ck)
    +

    Overload this with forward function pointers

    +

    +

    There is no double* version of this function

    +
    +
    Member PCSet::GalerkProjectionMC (const Array2D< double > &x, const Array1D< double > &fcn, Array1D< double > &ck)
    +

    Overload this with forward function pointers

    +

    +

    There is no double* version of this function

    +
    +
    Member PCSet::GetNormSq (Array1D< double > &normsq) const
    +
    this seems like a duplication, see below GetPsiSq()
    +
    Member PCSet::Initialize (const string ordertype)
    +
    Test and allow intrusive implementation with customized multiindices
    +
    Member PCSet::InitMeanStDv (const double &m, const double &s, double *p) const
    +
    Make this function work for general multi-indices, and for any number of stochastic dimensions
    +
    Member PCSet::InitMeanStDv (const double &m, const double &s, Array1D< double > &p) const
    +
    Make this function work for general multi-indices, and for any number of stochastic dimensions
    +
    Member PCSet::LogIntRhsWrapper (sunrealtype t, N_Vector y, N_Vector ydot, void *f_data)
    +
    Why is this function a static int instead of static void? Should there be a return statement at the end?
    +
    Member PCSet::PolynMulti (const Array1D< double > &polycf, const Array2D< int > &mindex, const Array2D< double > &p1, Array1D< double > &p2) const
    +
    A double* version should be added.
    +
    Member PCSet::SetQuadRule (const string grid_type, const string fs_type, int param)
    +
    Need to improve it
    +
    Member PCSet::StDv (const double *p) const
    +
    Lift the assumption by looking for the constant term in the multiindex
    +
    Member PCSet::StDv (const Array1D< double > &p) const
    +
    Lift the assumption by looking for the constant term in the multiindex
    +
    File probability.h
    +
    There shuold be a RNG class as a part of core UQTk - most of these functions will fit there.
    +
    Member Quad::create1DRule_pdf (Array1D< double > &qdpts, Array1D< double > &wghts, int ngr, double a, double b)
    +
    Recursive coefficients are given in a file 'ab.dat'; will need to make this more friendly
    +
    Member setdiff_s (Array1D< int > &A, Array1D< int > &B, Array1D< int > &C)
    +
    In future, this should sort A too and replace setdiff
    +
    Member usage ()
    +
    Add more detailed information on options. E.g. what are the different options for type of random variable? When does the order need to be specified?
    +
    Member WBCS (Array2D< double > &PHI, Array1D< double > &y, Array1D< double > &sigma2, double eta, Array1D< double > &lambda_init, int adaptive, int optimal, double scale, int verbose, Array1D< double > &weights, Array1D< int > &used, Array1D< double > &errbars, Array1D< double > &basis, Array1D< double > &alpha, Array2D< double > &Sig)
    +

    The array manipulations are not optimized - perhaps they need to be reconsidered using, say, fortran matrix-vector manipulation routines

    +

    The array manipulations are not optimized - perhaps they need to be reconsidered using, say, fortran matrix-vector manipulation routines

    +
    +
    Member XMLElement::get_child (const std::string &)
    +
    Make this more elegant with the STL find_if function
    +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/tools_8h.html b/docs/html/tools_8h.html new file mode 100644 index 00000000..a10e859a --- /dev/null +++ b/docs/html/tools_8h.html @@ -0,0 +1,85 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: tools.h File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    tools.h File Reference
    +
    +
    + +

    A header function that includes all tools. +More...

    +
    #include "probability.h"
    +#include "combin.h"
    +#include "minmax.h"
    +#include "multiindex.h"
    +#include "pcmaps.h"
    +#include "gq.h"
    +#include "rosenblatt.h"
    +#include "func.h"
    +
    +

    Go to the source code of this file.

    +

    Detailed Description

    +

    A header function that includes all tools.

    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/tools_8h_source.html b/docs/html/tools_8h_source.html new file mode 100644 index 00000000..ed93a143 --- /dev/null +++ b/docs/html/tools_8h_source.html @@ -0,0 +1,118 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: tools.h Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    tools.h
    +
    +
    +Go to the documentation of this file.
    1/* =====================================================================================
    +
    2
    +
    3 The UQ Toolkit (UQTk) version 3.1.5
    +
    4 Copyright (2024) NTESS
    +
    5 https://www.sandia.gov/UQToolkit/
    +
    6 https://github.com/sandialabs/UQTk
    +
    7
    +
    8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
    +
    9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
    +
    10 retains certain rights in this software.
    +
    11
    +
    12 This file is part of The UQ Toolkit (UQTk)
    +
    13
    +
    14 UQTk is open source software: you can redistribute it and/or modify
    +
    15 it under the terms of BSD 3-Clause License
    +
    16
    +
    17 UQTk is distributed in the hope that it will be useful,
    +
    18 but WITHOUT ANY WARRANTY; without even the implied warranty of
    +
    19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    +
    20 BSD 3 Clause License for more details.
    +
    21
    +
    22 You should have received a copy of the BSD 3 Clause License
    +
    23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
    +
    24
    +
    25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
    +
    26 Sandia National Laboratories, Livermore, CA, USA
    +
    27===================================================================================== */
    +
    28#ifndef UQTKTOOLS_H
    +
    29#define UQTKTOOLS_H
    +
    30
    +
    36#include "probability.h"
    +
    37#include "combin.h"
    +
    38#include "minmax.h"
    +
    39#include "multiindex.h"
    +
    40#include "pcmaps.h"
    +
    41#include "gq.h"
    +
    42#include "rosenblatt.h"
    +
    43#include "func.h"
    +
    44
    +
    45#endif // UQTKTOOLS_H
    +
    combin.h
    Header for combinatorial tools.
    +
    func.h
    Header for implementation of functions of form .
    +
    gq.h
    Header for quadrature generation utilities.
    +
    minmax.h
    Header for min/max tools.
    +
    multiindex.h
    Header for tools that deal with integer multiindices.
    +
    pcmaps.h
    Header for suite of functions to help map one kind of a PC variable to another.
    +
    probability.h
    Header for probability and random number generation- related tools.
    +
    rosenblatt.h
    Header for tools related to Rosenblatt transformation.
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/trdSpls_8cpp.html b/docs/html/trdSpls_8cpp.html new file mode 100644 index 00000000..c4940ed6 --- /dev/null +++ b/docs/html/trdSpls_8cpp.html @@ -0,0 +1,364 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: trdSpls.cpp File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Macros | +Functions
    +
    trdSpls.cpp File Reference
    +
    +
    +
    #include <cstdio>
    +#include <stddef.h>
    +#include <fstream>
    +#include <string>
    +#include <vector>
    +#include <math.h>
    +#include <iostream>
    +#include <iomanip>
    +#include "assert.h"
    +#include <getopt.h>
    +#include "dsfmt_add.h"
    +#include "error_handlers.h"
    +#include "probability.h"
    +
    + + + + + + + + + + + +

    +Macros

    #define DPI   6.28318530717959
     
    #define NPTS   129
     
    #define NSPL   10000
     
    #define SEED   0
     
    #define SFILE   "samples.dat"
     
    + + + + + + + + + + + + + +

    +Functions

    void usage ()
     
    double ndist (double x, double mean, double sig)
     
    double logndist (double x, double mean, double sig)
     
    void CDFmap (double xmin, double xmax, double mean, double sig, string type, vector< double > &x, vector< double > &cdfmap)
     
    double invTrCdf (double xmin, double xmax, double mean, double sig, string type, double xi)
     
    int main (int argc, char *argv[])
     
    +

    Macro Definition Documentation

    + +

    ◆ DPI

    + +
    +
    + + + + +
    #define DPI   6.28318530717959
    +
    + +
    +
    + +

    ◆ NPTS

    + +
    +
    + + + + +
    #define NPTS   129
    +
    + +
    +
    + +

    ◆ NSPL

    + +
    +
    + + + + +
    #define NSPL   10000
    +
    + +
    +
    + +

    ◆ SEED

    + +
    +
    + + + + +
    #define SEED   0
    +
    + +
    +
    + +

    ◆ SFILE

    + +
    +
    + + + + +
    #define SFILE   "samples.dat"
    +
    + +
    +
    +

    Function Documentation

    + +

    ◆ CDFmap()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    void CDFmap (double xmin,
    double xmax,
    double mean,
    double sig,
    string type,
    vector< double > & x,
    vector< double > & cdfmap )
    +
    + +
    +
    + +

    ◆ invTrCdf()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    double invTrCdf (double xmin,
    double xmax,
    double mean,
    double sig,
    string type,
    double xi )
    +
    + +
    +
    + +

    ◆ logndist()

    + +
    +
    + + + + + + + + + + + + + + + + +
    double logndist (double x,
    double mean,
    double sig )
    +
    + +
    +
    + +

    ◆ main()

    + +
    +
    + + + + + + + + + + + +
    int main (int argc,
    char * argv[] )
    +
    + +
    +
    + +

    ◆ ndist()

    + +
    +
    + + + + + + + + + + + + + + + + +
    double ndist (double x,
    double mean,
    double sig )
    +
    + +
    +
    + +

    ◆ usage()

    + +
    +
    + + + + + + + +
    void usage ()
    +
    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/userFunctions_8h.html b/docs/html/userFunctions_8h.html new file mode 100644 index 00000000..3ea52f7d --- /dev/null +++ b/docs/html/userFunctions_8h.html @@ -0,0 +1,248 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: userFunctions.h File Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    +Functions
    +
    userFunctions.h File Reference
    +
    +
    + +

    Go to the source code of this file.

    + + + + + + + + + + + + + + + + +

    +Functions

    void userSpecifyNominalParams (dataPosteriorInformation &dataPostInfo)
     
    void userDefineConstraints (dataPosteriorInformation &dataPostInfo)
     
    void userDefineData (dataPosteriorInformation &dataPostInfo)
     
    void userRunModel (Array1D< double > &modelDatay, Array1D< double > &modelDatax, Array1D< double > &parameters, Array1D< double > &hyperparameters)
     
    double userComputeParamLogPosterior (parameterPosteriorInformation *paramPostInfo, Array1D< double > parameters)
     
    double userComputeParamLogLikelihood (parameterPosteriorInformation *paramPostInfo, Array1D< double > modelDataOut, Array1D< double > parameters, Array1D< double > hyperparameters)
     
    void userComputeStatistics (Array1D< double > &parameterStatistics, Array1D< MCMC::chainstate > &parameterChain)
     
    +

    Function Documentation

    + +

    ◆ userComputeParamLogLikelihood()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    double userComputeParamLogLikelihood (parameterPosteriorInformation * paramPostInfo,
    Array1D< double > modelDataOut,
    Array1D< double > parameters,
    Array1D< double > hyperparameters )
    +
    + +
    +
    + +

    ◆ userComputeParamLogPosterior()

    + +
    +
    + + + + + + + + + + + +
    double userComputeParamLogPosterior (parameterPosteriorInformation * paramPostInfo,
    Array1D< double > parameters )
    +
    + +
    +
    + +

    ◆ userComputeStatistics()

    + +
    +
    + + + + + + + + + + + +
    void userComputeStatistics (Array1D< double > & parameterStatistics,
    Array1D< MCMC::chainstate > & parameterChain )
    +
    + +
    +
    + +

    ◆ userDefineConstraints()

    + +
    +
    + + + + + + + +
    void userDefineConstraints (dataPosteriorInformation & dataPostInfo)
    +
    + +
    +
    + +

    ◆ userDefineData()

    + +
    +
    + + + + + + + +
    void userDefineData (dataPosteriorInformation & dataPostInfo)
    +
    + +
    +
    + +

    ◆ userRunModel()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + +
    void userRunModel (Array1D< double > & modelDatay,
    Array1D< double > & modelDatax,
    Array1D< double > & parameters,
    Array1D< double > & hyperparameters )
    +
    + +
    +
    + +

    ◆ userSpecifyNominalParams()

    + +
    +
    + + + + + + + +
    void userSpecifyNominalParams (dataPosteriorInformation & dataPostInfo)
    +
    + +
    +
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/docs/html/userFunctions_8h_source.html b/docs/html/userFunctions_8h_source.html new file mode 100644 index 00000000..9f6e0b29 --- /dev/null +++ b/docs/html/userFunctions_8h_source.html @@ -0,0 +1,126 @@ + + + + + + + +UQTk: Uncertainty Quantification Toolkit: userFunctions.h Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    UQTk: Uncertainty Quantification Toolkit 3.1.5 +
    +
    +
    + + + + + + + + + +
    +
    +
    +
    userFunctions.h
    +
    +
    +Go to the documentation of this file.
    1/* =====================================================================================
    +
    2
    +
    3 The UQ Toolkit (UQTk) version 3.1.5
    +
    4 Copyright (2024) NTESS
    +
    5 https://www.sandia.gov/UQToolkit/
    +
    6 https://github.com/sandialabs/UQTk
    +
    7
    +
    8 Copyright 2024 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
    +
    9 Under the terms of Contract DE-NA0003525 with NTESS, the U.S. Government
    +
    10 retains certain rights in this software.
    +
    11
    +
    12 This file is part of The UQ Toolkit (UQTk)
    +
    13
    +
    14 UQTk is open source software: you can redistribute it and/or modify
    +
    15 it under the terms of BSD 3-Clause License
    +
    16
    +
    17 UQTk is distributed in the hope that it will be useful,
    +
    18 but WITHOUT ANY WARRANTY; without even the implied warranty of
    +
    19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
    +
    20 BSD 3 Clause License for more details.
    +
    21
    +
    22 You should have received a copy of the BSD 3 Clause License
    +
    23 along with UQTk. If not, see https://choosealicense.com/licenses/bsd-3-clause/.
    +
    24
    +
    25 Questions? Contact the UQTk Developers at https://github.com/sandialabs/UQTk/discussions
    +
    26 Sandia National Laboratories, Livermore, CA, USA
    +
    27===================================================================================== */
    +
    28#ifndef USER_FUNCS_H_
    +
    29#define USER_FUNCS_H_
    +
    30
    +
    31// specification of the nominal values for parameters
    +
    32void userSpecifyNominalParams(dataPosteriorInformation & dataPostInfo);
    +
    33// specification of constraint information on parameters (e.g. statistics etc.), and adherence coefficients (ABC deltas)
    +
    34void userDefineConstraints(dataPosteriorInformation & dataPostInfo);
    +
    35// specification of (noisy) data, e.g. read from file
    +
    36void userDefineData(dataPosteriorInformation &dataPostInfo);
    +
    37// specification of the fitting model
    +
    38void userRunModel(Array1D<double> &modelDatay, Array1D<double> & modelDatax, Array1D<double> &parameters, Array1D<double> &hyperparameters);
    +
    39// specification of user-defined parameter posterior (likelihood x prior). Runs the model and computes the likelihood
    +
    40double userComputeParamLogPosterior(parameterPosteriorInformation * paramPostInfo, Array1D<double> parameters);
    +
    41// specification of user-defined parameter likelihood function
    +
    42double userComputeParamLogLikelihood(parameterPosteriorInformation * paramPostInfo, Array1D<double> modelDataOut, Array1D<double> parameters, Array1D<double> hyperparameters);
    +
    43// specification of user defined statistics of the parameter posterior (e.g. moments)
    +
    44void userComputeStatistics(Array1D<double> &parameterStatistics, Array1D<MCMC::chainstate> & parameterChain);
    +
    45
    +
    46#endif //USER_FUNCS_H_
    +
    Array1D
    Stores data of any type T in a 1D array.
    Definition Array1D.h:61
    +
    dataPosteriorInformation
    Definition dfi.h:97
    +
    parameterPosteriorInformation
    Definition dfi.h:164
    +
    userComputeStatistics
    void userComputeStatistics(Array1D< double > &parameterStatistics, Array1D< MCMC::chainstate > &parameterChain)
    +
    userDefineConstraints
    void userDefineConstraints(dataPosteriorInformation &dataPostInfo)
    +
    userComputeParamLogPosterior
    double userComputeParamLogPosterior(parameterPosteriorInformation *paramPostInfo, Array1D< double > parameters)
    +
    userDefineData
    void userDefineData(dataPosteriorInformation &dataPostInfo)
    +
    userRunModel
    void userRunModel(Array1D< double > &modelDatay, Array1D< double > &modelDatax, Array1D< double > &parameters, Array1D< double > &hyperparameters)
    +
    userComputeParamLogLikelihood
    double userComputeParamLogLikelihood(parameterPosteriorInformation *paramPostInfo, Array1D< double > modelDataOut, Array1D< double > parameters, Array1D< double > hyperparameters)
    +
    userSpecifyNominalParams
    void userSpecifyNominalParams(dataPosteriorInformation &dataPostInfo)
    +
    + +
    +Generated by doxygen 1.12.0 +
    +
    + + diff --git a/examples/d_spring_series/d_springs_tools.py b/examples/d_spring_series/d_springs_tools.py index dc190c3d..e5d1b122 100644 --- a/examples/d_spring_series/d_springs_tools.py +++ b/examples/d_spring_series/d_springs_tools.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/d_spring_series/run_d_springs.py b/examples/d_spring_series/run_d_springs.py index be0d285d..ac82e0d6 100644 --- a/examples/d_spring_series/run_d_springs.py +++ b/examples/d_spring_series/run_d_springs.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/dfi/line/main.cpp b/examples/dfi/line/main.cpp index 6f7e76de..fd09c240 100644 --- a/examples/dfi/line/main.cpp +++ b/examples/dfi/line/main.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/dfi/line/userFunctions_line.cpp b/examples/dfi/line/userFunctions_line.cpp index 3baf7c43..94734170 100644 --- a/examples/dfi/line/userFunctions_line.cpp +++ b/examples/dfi/line/userFunctions_line.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/iuq/get_postpred.py b/examples/iuq/get_postpred.py index 5dc81361..2c548588 100644 --- a/examples/iuq/get_postpred.py +++ b/examples/iuq/get_postpred.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/get_postsam.py b/examples/iuq/get_postsam.py index 997bde93..bfd3c9c1 100644 --- a/examples/iuq/get_postsam.py +++ b/examples/iuq/get_postsam.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/plot_fit1d.py b/examples/iuq/plot_fit1d.py index d598c1b8..205249b2 100644 --- a/examples/iuq/plot_fit1d.py +++ b/examples/iuq/plot_fit1d.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/plot_pdfs.py b/examples/iuq/plot_pdfs.py index ea0be84c..c04a6958 100644 --- a/examples/iuq/plot_pdfs.py +++ b/examples/iuq/plot_pdfs.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/plot_prpost.py b/examples/iuq/plot_prpost.py index ff354ccf..9d7aa025 100644 --- a/examples/iuq/plot_prpost.py +++ b/examples/iuq/plot_prpost.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/plot_sens.py b/examples/iuq/plot_sens.py index 1c968b79..9f8af2b2 100644 --- a/examples/iuq/plot_sens.py +++ b/examples/iuq/plot_sens.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/plot_shade.py b/examples/iuq/plot_shade.py index 0ff7abca..d75ea23b 100644 --- a/examples/iuq/plot_shade.py +++ b/examples/iuq/plot_shade.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/postp_infer.x b/examples/iuq/postp_infer.x index 7b7de644..d0e60f02 100755 --- a/examples/iuq/postp_infer.x +++ b/examples/iuq/postp_infer.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/prep_calib.x b/examples/iuq/prep_calib.x index b44bc14e..e87ac3bb 100755 --- a/examples/iuq/prep_calib.x +++ b/examples/iuq/prep_calib.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/prep_data1.x b/examples/iuq/prep_data1.x index 940278a5..1f7a7eb4 100755 --- a/examples/iuq/prep_data1.x +++ b/examples/iuq/prep_data1.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/prep_data2.x b/examples/iuq/prep_data2.x index b44f0c81..333ee04f 100755 --- a/examples/iuq/prep_data2.x +++ b/examples/iuq/prep_data2.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/prep_model1.x b/examples/iuq/prep_model1.x index de678f3f..77a6dc9d 100755 --- a/examples/iuq/prep_model1.x +++ b/examples/iuq/prep_model1.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/prep_model2.x b/examples/iuq/prep_model2.x index 3ec24c47..ab69a54c 100755 --- a/examples/iuq/prep_model2.x +++ b/examples/iuq/prep_model2.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/run_infer.x b/examples/iuq/run_infer.x index f253ce0d..e5857bfd 100755 --- a/examples/iuq/run_infer.x +++ b/examples/iuq/run_infer.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/iuq/workflow.x b/examples/iuq/workflow.x index d0bfc9b5..7cb867db 100755 --- a/examples/iuq/workflow.x +++ b/examples/iuq/workflow.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/kle_ex1/data/kl-prep-scus.py b/examples/kle_ex1/data/kl-prep-scus.py index 1da08d9b..c1d2887c 100644 --- a/examples/kle_ex1/data/kl-prep-scus.py +++ b/examples/kle_ex1/data/kl-prep-scus.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/kle_ex1/data/kl_prep_grid.py b/examples/kle_ex1/data/kl_prep_grid.py index dc05d26b..c5305ef0 100644 --- a/examples/kle_ex1/data/kl_prep_grid.py +++ b/examples/kle_ex1/data/kl_prep_grid.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/kle_ex1/kl_1D.cpp b/examples/kle_ex1/kl_1D.cpp index 5ac30fb8..c9fce401 100644 --- a/examples/kle_ex1/kl_1D.cpp +++ b/examples/kle_ex1/kl_1D.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/kle_ex1/kl_2D.cpp b/examples/kle_ex1/kl_2D.cpp index 8d5fa36d..6f4d24b7 100644 --- a/examples/kle_ex1/kl_2D.cpp +++ b/examples/kle_ex1/kl_2D.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/kle_ex1/kl_2Du.cpp b/examples/kle_ex1/kl_2Du.cpp index f2b7198f..cfa99ed4 100644 --- a/examples/kle_ex1/kl_2Du.cpp +++ b/examples/kle_ex1/kl_2Du.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/kle_ex1/kl_utils.cpp b/examples/kle_ex1/kl_utils.cpp index 33b62990..983db46b 100644 --- a/examples/kle_ex1/kl_utils.cpp +++ b/examples/kle_ex1/kl_utils.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/kle_ex1/kl_utils.h b/examples/kle_ex1/kl_utils.h index 81842775..24a968a1 100644 --- a/examples/kle_ex1/kl_utils.h +++ b/examples/kle_ex1/kl_utils.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/kle_ex1/mkplots.py b/examples/kle_ex1/mkplots.py index ef6d1d92..2685deaf 100644 --- a/examples/kle_ex1/mkplots.py +++ b/examples/kle_ex1/mkplots.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/kle_ex1/pl2Dsgrid.py b/examples/kle_ex1/pl2Dsgrid.py index ae8fcea2..1225f3e2 100644 --- a/examples/kle_ex1/pl2Dsgrid.py +++ b/examples/kle_ex1/pl2Dsgrid.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/kle_ex1/pl2Dugrid.py b/examples/kle_ex1/pl2Dugrid.py index 23997de2..460165cc 100644 --- a/examples/kle_ex1/pl2Dugrid.py +++ b/examples/kle_ex1/pl2Dugrid.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/kle_ex1/pyutils.py b/examples/kle_ex1/pyutils.py index 9e7b21e1..f1581b4d 100644 --- a/examples/kle_ex1/pyutils.py +++ b/examples/kle_ex1/pyutils.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/kle_ex1/run1D.sh b/examples/kle_ex1/run1D.sh index 3fb55177..0e41f5eb 100644 --- a/examples/kle_ex1/run1D.sh +++ b/examples/kle_ex1/run1D.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/kle_ex1/run2D.sh b/examples/kle_ex1/run2D.sh index 0da2e5a8..935e57b5 100644 --- a/examples/kle_ex1/run2D.sh +++ b/examples/kle_ex1/run2D.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/line_infer/XMLreader.h b/examples/line_infer/XMLreader.h index ffb550f1..7282d3c7 100644 --- a/examples/line_infer/XMLreader.h +++ b/examples/line_infer/XMLreader.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/line_infer/line_infer.cpp b/examples/line_infer/line_infer.cpp index 049c5463..45a29cdf 100644 --- a/examples/line_infer/line_infer.cpp +++ b/examples/line_infer/line_infer.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/line_infer/line_infer.py b/examples/line_infer/line_infer.py index bca5223a..31ca4139 100644 --- a/examples/line_infer/line_infer.py +++ b/examples/line_infer/line_infer.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/line_infer/model.h b/examples/line_infer/model.h index 58934fa9..6382d8e3 100644 --- a/examples/line_infer/model.h +++ b/examples/line_infer/model.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/line_infer/posterior.h b/examples/line_infer/posterior.h index d700bdbf..dab2840f 100644 --- a/examples/line_infer/posterior.h +++ b/examples/line_infer/posterior.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/muq/genzGP.py b/examples/muq/genzGP.py index b188b654..39056830 100755 --- a/examples/muq/genzGP.py +++ b/examples/muq/genzGP.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/muq/muqPCE2uqtk.cpp b/examples/muq/muqPCE2uqtk.cpp index b1d8e039..9db90156 100644 --- a/examples/muq/muqPCE2uqtk.cpp +++ b/examples/muq/muqPCE2uqtk.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/num_integ/full_quad.py b/examples/num_integ/full_quad.py index 07d6a402..9baed140 100644 --- a/examples/num_integ/full_quad.py +++ b/examples/num_integ/full_quad.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/num_integ/quad_tools.py b/examples/num_integ/quad_tools.py index a9ed7db7..7d2641e9 100644 --- a/examples/num_integ/quad_tools.py +++ b/examples/num_integ/quad_tools.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/num_integ/sparse_quad.py b/examples/num_integ/sparse_quad.py index 9e6359ad..b84f7fdb 100644 --- a/examples/num_integ/sparse_quad.py +++ b/examples/num_integ/sparse_quad.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/ops/LogComp.cpp b/examples/ops/LogComp.cpp index 6da617e5..eea3ae7c 100644 --- a/examples/ops/LogComp.cpp +++ b/examples/ops/LogComp.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/ops/Ops.cpp b/examples/ops/Ops.cpp index 154ef0c5..c64b2226 100644 --- a/examples/ops/Ops.cpp +++ b/examples/ops/Ops.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/ops/Utils.cpp b/examples/ops/Utils.cpp index d414431e..a413ad02 100644 --- a/examples/ops/Utils.cpp +++ b/examples/ops/Utils.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/ops/Utils.h b/examples/ops/Utils.h index 432985cf..c9838173 100644 --- a/examples/ops/Utils.h +++ b/examples/ops/Utils.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/ops/plot_logs.py b/examples/ops/plot_logs.py index f47ffef5..ad283f1b 100644 --- a/examples/ops/plot_logs.py +++ b/examples/ops/plot_logs.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/ops/plot_pdf.py b/examples/ops/plot_pdf.py index eec379e4..56c4ab0a 100644 --- a/examples/ops/plot_pdf.py +++ b/examples/ops/plot_pdf.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/ops/test_all.sh b/examples/ops/test_all.sh index 81660c28..b7303895 100755 --- a/examples/ops/test_all.sh +++ b/examples/ops/test_all.sh @@ -1,12 +1,12 @@ #!/bin/sh #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/pce_bcs/pce_bcs.cpp b/examples/pce_bcs/pce_bcs.cpp index 8f4a955f..9cc1e70f 100644 --- a/examples/pce_bcs/pce_bcs.cpp +++ b/examples/pce_bcs/pce_bcs.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/pce_bcs/pce_bcs.h b/examples/pce_bcs/pce_bcs.h index 737693fd..07e9dbaa 100644 --- a/examples/pce_bcs/pce_bcs.h +++ b/examples/pce_bcs/pce_bcs.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/polynomial/run/full_run.sh b/examples/polynomial/run/full_run.sh index 2dc08cab..d15f04a0 100755 --- a/examples/polynomial/run/full_run.sh +++ b/examples/polynomial/run/full_run.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/polynomial/scripts/evidence.py b/examples/polynomial/scripts/evidence.py index 4d12a0f5..95b8647d 100755 --- a/examples/polynomial/scripts/evidence.py +++ b/examples/polynomial/scripts/evidence.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/polynomial/scripts/fit.py b/examples/polynomial/scripts/fit.py index 0cada98f..5baf6fc2 100644 --- a/examples/polynomial/scripts/fit.py +++ b/examples/polynomial/scripts/fit.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/polynomial/scripts/get_data.py b/examples/polynomial/scripts/get_data.py index a141bb1f..5ea3c165 100644 --- a/examples/polynomial/scripts/get_data.py +++ b/examples/polynomial/scripts/get_data.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/polynomial/scripts/graph_tools.py b/examples/polynomial/scripts/graph_tools.py index 5ba47919..aa5a4e8a 100644 --- a/examples/polynomial/scripts/graph_tools.py +++ b/examples/polynomial/scripts/graph_tools.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/polynomial/scripts/post.py b/examples/polynomial/scripts/post.py index 6060d7af..ef509688 100644 --- a/examples/polynomial/scripts/post.py +++ b/examples/polynomial/scripts/post.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/polynomial/scripts/tools.py b/examples/polynomial/scripts/tools.py index 41a07b1b..f0c2d710 100644 --- a/examples/polynomial/scripts/tools.py +++ b/examples/polynomial/scripts/tools.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/sensMC/genRndSpls.sh b/examples/sensMC/genRndSpls.sh index 613da384..085d0476 100644 --- a/examples/sensMC/genRndSpls.sh +++ b/examples/sensMC/genRndSpls.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/sensMC/model.sh b/examples/sensMC/model.sh index c508cb2b..acb1f4da 100644 --- a/examples/sensMC/model.sh +++ b/examples/sensMC/model.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/sensMC/rmspls.sh b/examples/sensMC/rmspls.sh index 86fb6efe..8e9ee6b5 100644 --- a/examples/sensMC/rmspls.sh +++ b/examples/sensMC/rmspls.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/sensMC/run.sh b/examples/sensMC/run.sh index 7f49c30b..58f160be 100644 --- a/examples/sensMC/run.sh +++ b/examples/sensMC/run.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/SurfRxnDet.cpp b/examples/surf_rxn/SurfRxnDet.cpp index 6f345b1c..f108f096 100644 --- a/examples/surf_rxn/SurfRxnDet.cpp +++ b/examples/surf_rxn/SurfRxnDet.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/surf_rxn/SurfRxnISP.cpp b/examples/surf_rxn/SurfRxnISP.cpp index 5de71349..4d5bdf01 100644 --- a/examples/surf_rxn/SurfRxnISP.cpp +++ b/examples/surf_rxn/SurfRxnISP.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/surf_rxn/SurfRxnMulti.py b/examples/surf_rxn/SurfRxnMulti.py index fc45ddac..f872980e 100644 --- a/examples/surf_rxn/SurfRxnMulti.py +++ b/examples/surf_rxn/SurfRxnMulti.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/SurfRxnNISP.cpp b/examples/surf_rxn/SurfRxnNISP.cpp index 20c10733..6bfdb2f4 100644 --- a/examples/surf_rxn/SurfRxnNISP.cpp +++ b/examples/surf_rxn/SurfRxnNISP.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/surf_rxn/SurfRxnNISP_MC.cpp b/examples/surf_rxn/SurfRxnNISP_MC.cpp index de636bdd..0fb17176 100644 --- a/examples/surf_rxn/SurfRxnNISP_MC.cpp +++ b/examples/surf_rxn/SurfRxnNISP_MC.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/surf_rxn/Utils.cpp b/examples/surf_rxn/Utils.cpp index d414431e..a413ad02 100644 --- a/examples/surf_rxn/Utils.cpp +++ b/examples/surf_rxn/Utils.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/surf_rxn/Utils.h b/examples/surf_rxn/Utils.h index 432985cf..c9838173 100644 --- a/examples/surf_rxn/Utils.h +++ b/examples/surf_rxn/Utils.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/surf_rxn/XMLreader.h b/examples/surf_rxn/XMLreader.h index 11d47173..18c6ffef 100644 --- a/examples/surf_rxn/XMLreader.h +++ b/examples/surf_rxn/XMLreader.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/surf_rxn/cleandir.sh b/examples/surf_rxn/cleandir.sh index 3f013834..1454c8e5 100755 --- a/examples/surf_rxn/cleandir.sh +++ b/examples/surf_rxn/cleandir.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/file_utils.py b/examples/surf_rxn/file_utils.py index 7e6baede..8503b656 100644 --- a/examples/surf_rxn/file_utils.py +++ b/examples/surf_rxn/file_utils.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/forUQ_BB_sr.py b/examples/surf_rxn/forUQ_BB_sr.py index 69eccfab..d45c4777 100644 --- a/examples/surf_rxn/forUQ_BB_sr.py +++ b/examples/surf_rxn/forUQ_BB_sr.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/forUQ_BB_utils.py b/examples/surf_rxn/forUQ_BB_utils.py index 4a746c1c..08014630 100644 --- a/examples/surf_rxn/forUQ_BB_utils.py +++ b/examples/surf_rxn/forUQ_BB_utils.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/forUQ_sr.py b/examples/surf_rxn/forUQ_sr.py index c43d44f3..8cbd3f9b 100644 --- a/examples/surf_rxn/forUQ_sr.py +++ b/examples/surf_rxn/forUQ_sr.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/model.h b/examples/surf_rxn/model.h index 125aecc5..873d60fc 100644 --- a/examples/surf_rxn/model.h +++ b/examples/surf_rxn/model.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/surf_rxn/other/SurfRxnInfer.cpp b/examples/surf_rxn/other/SurfRxnInfer.cpp index 628f961c..d55dc6c2 100644 --- a/examples/surf_rxn/other/SurfRxnInfer.cpp +++ b/examples/surf_rxn/other/SurfRxnInfer.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/surf_rxn/other/plChain.py b/examples/surf_rxn/other/plChain.py index a0b26f25..6ecf0b31 100644 --- a/examples/surf_rxn/other/plChain.py +++ b/examples/surf_rxn/other/plChain.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/other/plPDF_bw.py b/examples/surf_rxn/other/plPDF_bw.py index 26401b85..62aee0f1 100644 --- a/examples/surf_rxn/other/plPDF_bw.py +++ b/examples/surf_rxn/other/plPDF_bw.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/other/plTriang.py b/examples/surf_rxn/other/plTriang.py index 04fde231..f75c0fdf 100644 --- a/examples/surf_rxn/other/plTriang.py +++ b/examples/surf_rxn/other/plTriang.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/other/plot_chain_samples.py b/examples/surf_rxn/other/plot_chain_samples.py index c3c892e2..ba636acd 100644 --- a/examples/surf_rxn/other/plot_chain_samples.py +++ b/examples/surf_rxn/other/plot_chain_samples.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/other/plot_surf_rxn_ISP-NISP_umodes.py b/examples/surf_rxn/other/plot_surf_rxn_ISP-NISP_umodes.py index 4283a981..765367cf 100644 --- a/examples/surf_rxn/other/plot_surf_rxn_ISP-NISP_umodes.py +++ b/examples/surf_rxn/other/plot_surf_rxn_ISP-NISP_umodes.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/other/plot_surf_rxn_ISP_umodes.py b/examples/surf_rxn/other/plot_surf_rxn_ISP_umodes.py index a7ab104f..3ede177f 100644 --- a/examples/surf_rxn/other/plot_surf_rxn_ISP_umodes.py +++ b/examples/surf_rxn/other/plot_surf_rxn_ISP_umodes.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/other/plot_surf_rxn_NISP_umodes.py b/examples/surf_rxn/other/plot_surf_rxn_NISP_umodes.py index b52761ec..8332ae02 100644 --- a/examples/surf_rxn/other/plot_surf_rxn_NISP_umodes.py +++ b/examples/surf_rxn/other/plot_surf_rxn_NISP_umodes.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/other/plot_uvdata.py b/examples/surf_rxn/other/plot_uvdata.py index e093e5b3..80c63bb9 100644 --- a/examples/surf_rxn/other/plot_uvdata.py +++ b/examples/surf_rxn/other/plot_uvdata.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/other/prob4.py b/examples/surf_rxn/other/prob4.py index 476c1f4e..96b63db5 100644 --- a/examples/surf_rxn/other/prob4.py +++ b/examples/surf_rxn/other/prob4.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/plPDF_method.py b/examples/surf_rxn/plPDF_method.py index 8724e845..6542015c 100644 --- a/examples/surf_rxn/plPDF_method.py +++ b/examples/surf_rxn/plPDF_method.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/plSurfRxnMstd.py b/examples/surf_rxn/plSurfRxnMstd.py index 25a89492..96966b87 100644 --- a/examples/surf_rxn/plSurfRxnMstd.py +++ b/examples/surf_rxn/plSurfRxnMstd.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/plot_utils.py b/examples/surf_rxn/plot_utils.py index 92e9186a..a47c930b 100644 --- a/examples/surf_rxn/plot_utils.py +++ b/examples/surf_rxn/plot_utils.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/posterior.h b/examples/surf_rxn/posterior.h index 88207a15..d1a84bce 100644 --- a/examples/surf_rxn/posterior.h +++ b/examples/surf_rxn/posterior.h @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/surf_rxn/postpred.py b/examples/surf_rxn/postpred.py index 4db61b21..8a86f0c2 100644 --- a/examples/surf_rxn/postpred.py +++ b/examples/surf_rxn/postpred.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/surf_rxn/utils.py b/examples/surf_rxn/utils.py index 6fad6e3d..48c16dbc 100644 --- a/examples/surf_rxn/utils.py +++ b/examples/surf_rxn/utils.py @@ -1,11 +1,11 @@ #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/tmcmc_bimodal/bimodal.cpp b/examples/tmcmc_bimodal/bimodal.cpp index fce9a7c5..15842ae1 100644 --- a/examples/tmcmc_bimodal/bimodal.cpp +++ b/examples/tmcmc_bimodal/bimodal.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/tmcmc_bimodal/tmcmc_bimodal.cpp b/examples/tmcmc_bimodal/tmcmc_bimodal.cpp index e55574f4..e91c5cd7 100644 --- a/examples/tmcmc_bimodal/tmcmc_bimodal.cpp +++ b/examples/tmcmc_bimodal/tmcmc_bimodal.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/tmcmc_bimodal/tmcmc_bimodal.py b/examples/tmcmc_bimodal/tmcmc_bimodal.py index 4bf6eb94..a6b66fd1 100644 --- a/examples/tmcmc_bimodal/tmcmc_bimodal.py +++ b/examples/tmcmc_bimodal/tmcmc_bimodal.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/tmcmc_bimodal/tmcmc_getLL.sh b/examples/tmcmc_bimodal/tmcmc_getLL.sh index e82b7956..c6bad082 100755 --- a/examples/tmcmc_bimodal/tmcmc_getLL.sh +++ b/examples/tmcmc_bimodal/tmcmc_getLL.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/tmcmc_bimodal/tmcmc_getLP.sh b/examples/tmcmc_bimodal/tmcmc_getLP.sh index f04aa2f1..42401484 100755 --- a/examples/tmcmc_bimodal/tmcmc_getLP.sh +++ b/examples/tmcmc_bimodal/tmcmc_getLP.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/tmcmc_bimodal/tmcmc_moveIntermediateFiles.sh b/examples/tmcmc_bimodal/tmcmc_moveIntermediateFiles.sh index e61d49be..0fdde006 100755 --- a/examples/tmcmc_bimodal/tmcmc_moveIntermediateFiles.sh +++ b/examples/tmcmc_bimodal/tmcmc_moveIntermediateFiles.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/tmcmc_umbridge/tmcmc_getLL.sh b/examples/tmcmc_umbridge/tmcmc_getLL.sh index a9488813..38bf1452 100644 --- a/examples/tmcmc_umbridge/tmcmc_getLL.sh +++ b/examples/tmcmc_umbridge/tmcmc_getLL.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/tmcmc_umbridge/tmcmc_getLP.sh b/examples/tmcmc_umbridge/tmcmc_getLP.sh index bc4dfe4e..b9619ea7 100644 --- a/examples/tmcmc_umbridge/tmcmc_getLP.sh +++ b/examples/tmcmc_umbridge/tmcmc_getLP.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/tmcmc_umbridge/tmcmc_moveIntermediateFiles.sh b/examples/tmcmc_umbridge/tmcmc_moveIntermediateFiles.sh index e61d49be..0fdde006 100644 --- a/examples/tmcmc_umbridge/tmcmc_moveIntermediateFiles.sh +++ b/examples/tmcmc_umbridge/tmcmc_moveIntermediateFiles.sh @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/tmcmc_umbridge/tmcmc_umbridge.cpp b/examples/tmcmc_umbridge/tmcmc_umbridge.cpp index e55574f4..e91c5cd7 100644 --- a/examples/tmcmc_umbridge/tmcmc_umbridge.cpp +++ b/examples/tmcmc_umbridge/tmcmc_umbridge.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/tmcmc_umbridge/tmcmc_umbridge.py b/examples/tmcmc_umbridge/tmcmc_umbridge.py index 51cfeac8..2a50fad4 100644 --- a/examples/tmcmc_umbridge/tmcmc_umbridge.py +++ b/examples/tmcmc_umbridge/tmcmc_umbridge.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/tmcmc_umbridge/umbridge_model.cpp b/examples/tmcmc_umbridge/umbridge_model.cpp index dc819f4b..9f74da98 100644 --- a/examples/tmcmc_umbridge/umbridge_model.cpp +++ b/examples/tmcmc_umbridge/umbridge_model.cpp @@ -1,11 +1,11 @@ /* ===================================================================================== - The UQ Toolkit (UQTk) version @UQTKVERSION@ - Copyright (@UQTKYEAR@) NTESS + The UQ Toolkit (UQTk) version 3.1.5 + Copyright (2024) NTESS https://www.sandia.gov/UQToolkit/ https://github.com/sandialabs/UQTk - Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). + Copyright 2024 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. diff --git a/examples/uqpc/col_ave.x b/examples/uqpc/col_ave.x index b8d7e485..26d5118a 100755 --- a/examples/uqpc/col_ave.x +++ b/examples/uqpc/col_ave.x @@ -1,12 +1,12 @@ #!/bin/sh -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/example_0.x b/examples/uqpc/example_0.x index 215b75ac..51d11536 100755 --- a/examples/uqpc/example_0.x +++ b/examples/uqpc/example_0.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/example_1.x b/examples/uqpc/example_1.x index 16c44508..537b2778 100755 --- a/examples/uqpc/example_1.x +++ b/examples/uqpc/example_1.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/example_2.x b/examples/uqpc/example_2.x index b2fb2f4b..87b97c8f 100755 --- a/examples/uqpc/example_2.x +++ b/examples/uqpc/example_2.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/example_3.x b/examples/uqpc/example_3.x index 1a3b4342..9f2fdf14 100755 --- a/examples/uqpc/example_3.x +++ b/examples/uqpc/example_3.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/generate_inputsamples.py b/examples/uqpc/generate_inputsamples.py index ae6a1979..4b9e6377 100644 --- a/examples/uqpc/generate_inputsamples.py +++ b/examples/uqpc/generate_inputsamples.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/get_modelpc.py b/examples/uqpc/get_modelpc.py index d7551b15..d1f92af7 100644 --- a/examples/uqpc/get_modelpc.py +++ b/examples/uqpc/get_modelpc.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/getrange.x b/examples/uqpc/getrange.x index 526f65f3..5723d2fc 100755 --- a/examples/uqpc/getrange.x +++ b/examples/uqpc/getrange.x @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/join_results.py b/examples/uqpc/join_results.py index 8ca05292..9e982e54 100644 --- a/examples/uqpc/join_results.py +++ b/examples/uqpc/join_results.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/model.py b/examples/uqpc/model.py index 106518b1..dd73e5ed 100644 --- a/examples/uqpc/model.py +++ b/examples/uqpc/model.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/model_sens.x b/examples/uqpc/model_sens.x index 11162f6f..4631db09 100755 --- a/examples/uqpc/model_sens.x +++ b/examples/uqpc/model_sens.x @@ -1,12 +1,12 @@ #!/bin/bash #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/plot.py b/examples/uqpc/plot.py index a46f7827..501b8cd1 100644 --- a/examples/uqpc/plot.py +++ b/examples/uqpc/plot.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/plot_prep.py b/examples/uqpc/plot_prep.py index b2c18b50..58304478 100644 --- a/examples/uqpc/plot_prep.py +++ b/examples/uqpc/plot_prep.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/prepare_inpc.py b/examples/uqpc/prepare_inpc.py index b51ea986..647d7530 100644 --- a/examples/uqpc/prepare_inpc.py +++ b/examples/uqpc/prepare_inpc.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/scale.x b/examples/uqpc/scale.x index 27987fdf..b1efadf8 100755 --- a/examples/uqpc/scale.x +++ b/examples/uqpc/scale.x @@ -1,12 +1,12 @@ #!/bin/bash -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/transpose_file.x b/examples/uqpc/transpose_file.x index d729d747..af5f8950 100755 --- a/examples/uqpc/transpose_file.x +++ b/examples/uqpc/transpose_file.x @@ -1,12 +1,12 @@ #!/bin/sh -e #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # diff --git a/examples/uqpc/uq_pc.py b/examples/uqpc/uq_pc.py index 200ff5d0..e4ccf2e0 100644 --- a/examples/uqpc/uq_pc.py +++ b/examples/uqpc/uq_pc.py @@ -1,12 +1,12 @@ #!/usr/bin/env python #===================================================================================== # -# The UQ Toolkit (UQTk) version @UQTKVERSION@ -# Copyright (@UQTKYEAR@) NTESS +# The UQ Toolkit (UQTk) version 3.1.5 +# Copyright (2024) NTESS # https://www.sandia.gov/UQToolkit/ # https://github.com/sandialabs/UQTk # -# Copyright @UQTKYEAR@ National Technology & Engineering Solutions of Sandia, LLC (NTESS). +# Copyright 2024 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. # From 02823b8a6bbc4c0ec21a59d21ec2c09da3341f60 Mon Sep 17 00:00:00 2001 From: Bert Debusschere Date: Fri, 22 Nov 2024 21:37:35 -0800 Subject: [PATCH 11/11] updating example config files --- config/README | 2 +- config/config-gcc-Python.sh | 2 +- config/config-gcc-base.sh | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/config/README b/config/README index 19dd8676..b3fc3572 100644 --- a/config/README +++ b/config/README @@ -8,5 +8,5 @@ confic-gcc-Python.sh: same as config-gcc-base with Python added to enable PyUQTk config-intel.sh: basic config file using Intel compiler -config-options.sh: more complicated config file that check system for +config-options.sh: more complicated config file that checks system for different versions of necessary components diff --git a/config/config-gcc-Python.sh b/config/config-gcc-Python.sh index e7bae816..1149f33f 100755 --- a/config/config-gcc-Python.sh +++ b/config/config-gcc-Python.sh @@ -44,7 +44,7 @@ done # Adjust the UQTK_SRC_DIR to point to where the UQTk source directory is. Feel free # to update the desired installation directory as you prefer. -UQTK_SRC_DIR=../UQTk-SNL +UQTK_SRC_DIR=../UQTk #../UQTk-SNL UQTK_INSTALL_DIR=$UQTK_SRC_DIR-install diff --git a/config/config-gcc-base.sh b/config/config-gcc-base.sh index 90099444..2431cb01 100755 --- a/config/config-gcc-base.sh +++ b/config/config-gcc-base.sh @@ -44,7 +44,7 @@ done # Adjust the UQTK_SRC_DIR to point to where the UQTk source directory is. Feel free # to update the desired installation directory as you prefer. -UQTK_SRC_DIR=../UQTk-SNL +UQTK_SRC_DIR=../UQTk UQTK_INSTALL_DIR=$UQTK_SRC_DIR-install echo "This script assumes the UQTk source code is in $UQTK_SRC_DIR"