代码搜索:协方差矩阵

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

代码结果 10,000
www.eeworm.com/read/375828/9348820

c a(蛇行矩阵).c

//蛇行矩阵 蛇行矩阵 #include void main() { float i,j; int k,n = 1,**A; printf("Please input one character:\n"); scanf("%d",&k); A = (int **) malloc(k*sizeof(int *)); for(i = 0;i < k
www.eeworm.com/read/178665/9389227

txt 稀疏矩阵 .txt

/*将稀疏矩阵表示为三元组,求出转置矩阵并输出结果。010650-20030000008000*/ #include #define Max 1000; typedef int datatype; typedef struct node{ int i; /*行*/ int j; /*列*/ datatype k; /*元素*/ }TripleNo
www.eeworm.com/read/169583/9849736

m 矩阵翻转.m

a=rand(4,5) b=rot90(a) flipdim(a,2)
www.eeworm.com/read/363342/9958080

c 逆矩阵.c

#define N 5 /*[注]:修改6为你所要的矩阵阶数*/ #include "stdio.h" #include "conio.h" /*js()函数用于计算行列式,通过递归算法实现*/ int js(s,n) int s[][N],n; {int z,j,k,r,total=0; int b[N][N];/*b[N][N]用于存放,在矩阵s[
www.eeworm.com/read/363342/9958142

c 乘法矩阵.c

#include void main() { int i,j; int big[8][8]; for (i = 0;i < 8;i++) /*循环嵌套*/ for (j = 0;j < 8;j++) big[i][j] = i * j; /* 乘法表 */ big[2][6] = 748;
www.eeworm.com/read/363342/9958331

c 矩阵转换.c

void trans(int *p,int n) { int i,j,temp; int *pi,*pj; for(i=0;i
www.eeworm.com/read/361582/10044421

txt 矩阵相乘.txt

using System; public class MatrixMultiply { public static void Main() { int a,b,c,d; Console.WriteLine ("该程序将求出两个矩阵的积:"); Console.WriteLine ("请指定矩阵A的行数:"); a=int.Parse (Console.Re
www.eeworm.com/read/421224/10748752

asm 矩阵键盘.asm

;矩阵键盘扫描 ;P2.0接行 接上拉电阻到vcc ,P2.7接列 ORG 0000H LJMP MAIN ORG 0030H MAIN: MOV SP,#60H MOV R7,#0 LOOP: LCALL KEY1 ;调用按键检测子程序 LCALL DISP SJMP LOOP KEY: LCALL DISP MOV P2,#0F0H ;按键检测,
www.eeworm.com/read/276181/10758287

c 逆矩阵.c

#define N 5 /*[注]:修改6为你所要的矩阵阶数*/ #include "stdio.h" #include "conio.h" /*js()函数用于计算行列式,通过递归算法实现*/ int js(s,n) int s[][N],n; {int z,j,k,r,total=0; int b[N][N];/*b[N][N]用于存放,在矩阵s[
www.eeworm.com/read/276181/10758384

c 乘法矩阵.c

#include void main() { int i,j; int big[8][8]; for (i = 0;i < 8;i++) /*循环嵌套*/ for (j = 0;j < 8;j++) big[i][j] = i * j; /* 乘法表 */ big[2][6] = 748;