代码搜索：协方差矩阵

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

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/266227/11235955

m givens.m

function [c,s]=givens(A) %Givens变换得到变换矩阵的参数 if A(2)==0 c=1; s=0; elseif abs(A(2))>=abs(A(1)) t=A(1)/A(2); s=(1+t^2)^(-1/2); c=s*t; else t=A(2)/A(1); c=(1+t^2)^(-
·
www.eeworm.com/read/411023/11261072

cpp 后方交会.cpp

#include "stdio.h" #include "math.h" #include "iostream.h" #define N 4 #define M 2*N void Transpose(double a[M][6],double b[6][M]) //将矩阵a[]转置，存储在b[]中 { int i,j; for(i=0;i
·
www.eeworm.com/read/411011/11261189

cpp spaceresection.cpp

#include "stdio.h" #include "math.h" #include "iostream.h" #define N 4 #define M 2*N void Transpose(double a[M][6],double b[6][M]) //将矩阵a[]转置，存储在b[]中 { int i,j; for(i=0;i
·
www.eeworm.com/read/147421/12553645

m 嵌入.m

clear; X=double(imread('lena.bmp')); [XCsource,XSsource]=wavedec2(X,3,'db1'); W=double(imread('UESTC.bmp')); %'double'将矩阵的元素变成双精度元素 lowarray=reshape(XCsource(1:4096),64,64); %convert matrix XCso
·
www.eeworm.com/read/247679/12631805

c aja_mar.c

//程序实例8_1 //邻接矩阵的生成 #include #include #define Infinite 9999 #define Max 100 int A[Max][Max]; void adjm(int v[][2],int w[],int n,int e,int t) { int k,m=0;
·
www.eeworm.com/read/247679/12631904

c aja_mar.c

//程序实例8_1 //邻接矩阵的生成 #include #include #define Infinite 9999 #define Max 100 int A[Max][Max]; void adjm(int v[][2],int w[],int n,int e,int t) { int k,m=0;
·
www.eeworm.com/read/334088/12642304

m linkexl.m

function linkexl [filename,pathname]=uigetfile(('*.xls'),'choose a file'); str=[pathname filename]; [A,B]=xlsread(str); % matlab自动把字符串和数据放在两个矩阵里。A是数据，B为字符串 x=A(:,5); y=A(:,8); subplot(2,1,1)
·
www.eeworm.com/read/135766/13901140

txt gauss消元法----不选主元.txt

#include #include #include #include #define max_n 200//阶数 #define precision 0.000001//精度 void matrix1(float a[][max_n],int m,int n)//输入矩阵函数 { int i,j;
·
www.eeworm.com/read/203459/15358916

txt pca_program.txt

%--------------------------------------------------------------------------------------------------- %S1,S2,...........Sm是M*N的图像矩阵存于M文件中 %m是样本数存于M文件中 %设共有h类(即h人的照片),每人l张不同的照片，m=h*l %--------------
·
www.eeworm.com/read/202952/15369019

txt gauss-jord求逆算发.txt

下面是实现Gauss-Jordan法实矩阵求逆。 #include #include #include int brinv(double a[], int n) { int *is,*js,i,j,k,l,u,v; double d,p; is=malloc(n*sizeof(int)); js=mal
·