代码搜索:协方差矩阵

找到约 10,000 项符合「协方差矩阵」的源代码

代码结果 10,000
www.eeworm.com/read/179124/9371921

h vfunc.h

#ifndef VFUNC_H #define VFUNC_H #include #include "matrix.h" class valgo // 矩阵算法类 { private: DOUBLE yfactor; // 乘因子,初始化为1 DOUBLE xfactor; // x轴放大因子,初始化为1 DOUBLE addconst;
www.eeworm.com/read/179124/9371954

cpp cmatrix.cpp

#include "stdio.h" #include "string.h" #include "MyComplex.h" #include "cmatrix.h" #include "fstream.h" // 缺省的构造函数,产生0行0列空复矩阵 cmatrix::cmatrix(cbuffer * b): rownum(0),colnum(0), isneg(0),ist
www.eeworm.com/read/179124/9371956

h vfunc.h

#ifndef VFUNC_H #define VFUNC_H #include #include "matrix.h" class valgo // 矩阵算法类 { private: DOUBLE yfactor; // 乘因子,初始化为1 DOUBLE xfactor; // x轴放大因子,初始化为1 DOUBLE addconst;
www.eeworm.com/read/179124/9371978

cpp cmatrix.cpp

#include "stdio.h" #include "string.h" #include "complex.h" #include "cmatrix.h" #include "fstream.h" // 缺省的构造函数,产生0行0列空复矩阵 cmatrix::cmatrix(cbuffer * b): rownum(0),colnum(0), isneg(0),istra
www.eeworm.com/read/179124/9371981

h vfunc.h

#ifndef VFUNC_H #define VFUNC_H #include #include "matrix.h" class valgo // 矩阵算法类 { private: DOUBLE yfactor; // 乘因子,初始化为1 DOUBLE xfactor; // x轴放大因子,初始化为1 DOUBLE addconst;
www.eeworm.com/read/179124/9372010

cpp cmatrix.cpp

#include "stdio.h" #include "string.h" #include "MyComplex.h" #include "cmatrix.h" #include "fstream.h" // 缺省的构造函数,产生0行0列空复矩阵 cmatrix::cmatrix(cbuffer * b): rownum(0),colnum(0), isneg(0),ist
www.eeworm.com/read/177468/9451701

h vfunc.h

#ifndef VFUNC_H #define VFUNC_H #include #include "matrix.h" class valgo // 矩阵算法类 { private: DOUBLE yfactor; // 乘因子,初始化为1 DOUBLE xfactor; // x轴放大因子,初始化为1 DOUBLE addconst;
www.eeworm.com/read/177468/9451718

cpp cmatrix.cpp

#include "stdio.h" #include "string.h" #include "complex.h" #include "cmatrix.h" #include "fstream.h" // 缺省的构造函数,产生0行0列空复矩阵 cmatrix::cmatrix(cbuffer * b): rownum(0),colnum(0), isneg(0),istra
www.eeworm.com/read/371868/9532535

c main.c

#include #include "RLSMatrix.h" void input(RLSMatrix *pM) { int ch; printf("选择输入形式:\n"\ "1.三元组形式输入\n"\ "2.矩阵形式输入\n"); scanf("%d", &ch); switch (ch){ case 1:
www.eeworm.com/read/175213/9555476

cpp usefultool.cpp

/* 矩阵求逆cpp1.cpp */ #include #include #include void out(); long gys(long i,long j) { long r; long f=(i>=j?i:j); long g=(i>=j?j:i); if ((i!=0)&(