Multi-dimensional interpolation by kriging with nearest-neighbor. More...
#include <interpm_krige.h>
Definition at line 228 of file interpm_krige.h.
Public Types | |
| typedef boost::numeric::ublas::vector< double > | ubvector |
| typedef boost::numeric::ublas::matrix< double > | ubmatrix |
| typedef boost::numeric::ublas::vector< size_t > | ubvector_size_t |
Public Member Functions | |
| template<class vec_vec_t , class vec_vec2_t > | |
| void | set_data (size_t n_in, size_t n_out, size_t n_points, vec_vec_t &x, vec_vec2_t &y, std::vector< covar_func_t > &fcovar, size_t order) |
| Initialize the data for the interpolation. | |
| template<class vec2_t , class vec3_t > | |
| void | eval (const vec2_t &x, vec3_t &y, std::vector< covar_func_t > &fcovar) const |
| Perform the interpolation. | |
| template<class vec2_t > | |
| void | find_lin_indep (const vec2_t &x, size_t iout, std::vector< covar_func_t > &fcovar, ubvector_size_t &index, ubvector_size_t &indep) const |
| Find a set of linearly independent points. | |
| template<class vec2_t > | |
| double | eval (const vec2_t &x, size_t iout, std::vector< covar_func_t > &fcovar) const |
| Perform the interpolation. | |
| template<class vec2_t > | |
| double | eval_jackknife (const vec2_t &x, size_t iout, std::vector< covar_func_t > &fcovar) const |
| Use jackknife to match interpolated to real function values. | |
Public Attributes | |
| int | verbose |
| Verbosity parameter (default 0) | |
Protected Attributes | |
| size_t | norder |
| Desc. | |
| size_t | np |
| The number of points. | |
| size_t | nd_in |
| The number of dimensions of the inputs. | |
| size_t | nd_out |
| The number of dimensions of the outputs. | |
| std::vector< vec_t > | ptrs_x |
| A vector of pointers holding the data. | |
| std::vector< vec_t > | ptrs_y |
| A vector of pointers holding the data. | |
| bool | data_set |
| True if the data has been specified. | |
| size_t | order |
| Number of points to include in each interpolation (default 3) | |
Documentation generated with Doxygen. Provided under the
GNU Free Documentation License (see License Information).