代码搜索:Simplex
找到约 356 项符合「Simplex」的源代码
代码结果 356
www.eeworm.com/read/398163/6291463
o general_inner_simplex.o
www.eeworm.com/read/398163/6291468
c whittle_outer_simplex.c
#include "timeseries.h"
double whittle_outer_simplex(double *P, double *f, int n_psd, time_series ts, data_kernel dk, noise_model *nm, int n_models, options op) {
int i, j, k, l;
int n_ve
www.eeworm.com/read/398163/6291485
o whittle_inner_simplex.o
www.eeworm.com/read/398163/6291486
c general_inner_simplex.c
#include "timeseries.h"
double general_inner_simplex(time_series ts, data_kernel dk, noise_model *nm, int n_models, options op, int end_flag) {
int i, j, k, l, m;
int n_vert, n_params, il
www.eeworm.com/read/398163/6291514
o simplex_color_only.o
www.eeworm.com/read/347945/11623350
m find_simplex_models.m
function [p,simplex_model] = find_simplex_models(p);
simplex_model = [];
if p.K.f == 0
return
elseif any(p.K.q > 0) | any(p.K.s > 0)
return
else
aux = p;
aux.F_struc(1:p.K.f,
www.eeworm.com/read/132338/14097216
c test_simplex2.c
/**********************************************************************
test_simplex.c
**********************************************************************
test_simplex - Test program for GAUL
www.eeworm.com/read/192895/8267495
c gjk.c
#include "gjk.h"
/*
* Implementation of the Gilbert, Johnson and Keerthi routine to compute
* the minimum distance between two convex polyhedra.
*
* Version 2.4, July 1998, (c) Stephen Cameron 19
www.eeworm.com/read/318725/13473356
html thgdalg.html
Algorithms for Contravariant Geometry Descriptions
In this part we consider different algorithms which allow to define
cogeometries.
Si
www.eeworm.com/read/318725/13473388
html thgdcov.html
Definition of a Cogeometry
There are a lot of different technical realizations of the dual concept. So, a
simple dualization leads to a function which returns fo