代码搜索:协方差矩阵

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

代码结果 10,000
www.eeworm.com/read/277819/4150785

cpp 7_9.cpp

//Begin of file lequmain.cpp //文件三,主函数 #include "linequ.h" //类声明头文件 void main() //主函数 { double a[]= //方程系数矩阵 { 0.2368,0.2471,0.2568,1.2671, //第一行 0.1968,0.2071,1.2168,0.2271, //第二行
www.eeworm.com/read/392094/2516082

cs sample3_17.cs

/* * 示例程序Sample3_17: Matrix类的求赫申伯格矩阵全部特征值的QR方法 */ using System; using CSharpAlgorithm.Algorithm; namespace CSharpAlgorithm.Sample { class Class1 { [STAThread] static void Main(st
www.eeworm.com/read/392094/2516090

cs sample3_9.cs

/* * 示例程序Sample3_9: Matrix类的对称正定矩阵的乔里斯基分解与行列式的求值 */ using System; using CSharpAlgorithm.Algorithm; namespace CSharpAlgorithm.Sample { class Class1 { [STAThread] static void Main(
www.eeworm.com/read/392094/2516103

cs sample3_18.cs

/* * 示例程序Sample3_18: Matrix类的求实对称矩阵特征值与特征向量的雅可比法 */ using System; using CSharpAlgorithm.Algorithm; namespace CSharpAlgorithm.Sample { class Class1 { [STAThread] static void Main(
www.eeworm.com/read/254498/4381950

cs sample3_17.cs

/* * 示例程序Sample3_17: Matrix类的求赫申伯格矩阵全部特征值的QR方法 */ using System; using CSharpAlgorithm.Algorithm; namespace CSharpAlgorithm.Sample { class Class1 { [STAThread] static void Main(st
www.eeworm.com/read/254498/4381958

cs sample3_9.cs

/* * 示例程序Sample3_9: Matrix类的对称正定矩阵的乔里斯基分解与行列式的求值 */ using System; using CSharpAlgorithm.Algorithm; namespace CSharpAlgorithm.Sample { class Class1 { [STAThread] static void Main(
www.eeworm.com/read/254498/4381971

cs sample3_18.cs

/* * 示例程序Sample3_18: Matrix类的求实对称矩阵特征值与特征向量的雅可比法 */ using System; using CSharpAlgorithm.Algorithm; namespace CSharpAlgorithm.Sample { class Class1 { [STAThread] static void Main(
www.eeworm.com/read/195026/8177968

c encrypt_decrypt.c

#include "huffman.h" /*------------------------------------------------------------------------*/ /*把原始数据文件DATAFILE进行加密得到加密数据文件ENCRYPT_DATAFILE。*/ /*加密算法密钥为"POWERZHU"。定义一个1000行8列的矩阵供加密算法用。*/ //沿
www.eeworm.com/read/294231/8245498

c 潮流.c

#include #include #include #define N 6 #define ep 1e-5 /*矩阵求逆*/ int brinv(double a[], int n) { int *is,*js,i,j,k,l,u,v; double d,p; is=malloc(n*sizeof
www.eeworm.com/read/193048/8255992

m ex7_5.m

% ex7_5 % 状态转移矩阵的拉氏反变换计算法 a=[0 1;-2 -3]; syms s; G= inv(s*eye(size(a))-a), phet =ilaplace(G), for I=1:61; tt=0.1*(I-1); phett(I,:,:)=subs(phet,'t',tt); end;