代码搜索：协方差矩阵
找到约 10,000 项符合「协方差矩阵」的源代码
代码结果 10,000
www.eeworm.com/read/147529/5728689
m rand.m
%R=rand(m,n) 生成(0,1)上均匀分布的m行n列随机矩阵
%RAND Uniformly distributed random numbers.
% RAND(N) is an N-by-N matrix with random entries, chosen from
% a uniform distribution on the interval (0.0,1.0
www.eeworm.com/read/147529/5728824
m inv.m
%求逆矩阵
%用法 B=inv(A) 其中A为数值或符号方阵,B返回A的逆
%例如
% inv([1 2;3 4]) %数值
% syms a b c d;inv([[a,b;c,d]) %符号
%
%INV Matrix inverse.
% INV(X) is the inverse of the square
www.eeworm.com/read/147529/5728899
m rand.m
%R=rand(m,n) 生成(0,1)上均匀分布的m行n列随机矩阵
%RAND Uniformly distributed random numbers.
% RAND(N) is an N-by-N matrix with random entries, chosen from
% a uniform distribution on the interval (0.0,1.0
www.eeworm.com/read/144587/5749638
java jumain.java
class JuSum
{
float a[ ][ ]={{1,2,3},{4,5,6},{7,8,9}};
float sum=0;
float getSum()
{
System.out.println("矩阵元素：");
for(int i=0;i
www.eeworm.com/read/140673/5784617
cpp main.cpp
#include
#include
#include
const int MAX_VERTEX_NUM = 20;
/* 用邻接矩阵表示的AOV图
*/
struct AOVGraph {
int vexnum;
int matrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM];
www.eeworm.com/read/491859/6427841
h mex.h
#include "mex.h"
void timestwo_alt(double y, double x)
{
*y=2.0 * x;
}
void mexFunction(int nlhs,mxArray *plhs[ ],int nrhs,const mxArray *prhs[ ])
{
double *x, *y;
//为返回参数创建一个1×1的矩阵
plhs
www.eeworm.com/read/491914/6428397
m zhixinhanshu.m
function [Accuracy]=dingwei(BeaconAmount)
BorderLength=100;%正方形区域的边长
UNAmount=60;
NodeAmount=UNAmount+BeaconAmount;%网络节点个数
R=50;%节点的通信距离
% D=zeros(NodeAmount,NodeAmount);%未知节电到信标节点距离初始矩阵；Beaco
www.eeworm.com/read/484459/6577346
txt chenbo.txt
#include
char word[][3]={
{'U','V','0'},
{'Q','V','0'},
{'U','Q','0'},
{'Q','Q','1'}};//矩阵表示
char K[]={'S','U','V','Q'};//状态集
char E[]={'a','b'};//有穷字母表
char string[10];
int resu
www.eeworm.com/read/484019/6589242
java othelloboard.java
//棋盘类，实现电脑走棋和玩家落子
import java.io.*;
public class OthelloBoard
{
private int[][] board;
public OthelloBoard()//构造方法
{
board = new int[8][8]; //定义与棋盘上的位置相对应的二维矩阵
initializeBoard();
}
www.eeworm.com/read/483188/6611095
m luzhuigan.m
function [L,U,x]=LUzhuigan(A,f)
% 对于带状矩阵的追赶法
n=length(A);
a=diag(A)';
b=[diag(A,1)',0];
c=[0,diag(A,-1)'];
for i=1:n
if i==1
ap(i)=a(i);
bp(i)=b(i)/ap(i);
y(i,1)=