代码搜索：协方差矩阵
找到约 10,000 项符合「协方差矩阵」的源代码
代码结果 10,000
www.eeworm.com/read/292678/8341302
map hey.map
CodeVisionAVR C Compiler V1.24.8d Professional
(C) Copyright 1998-2006 Pavel Haiduc, HP InfoTech s.r.l.
http://www.hpinfotech.com
File: F:\MCU code\AVR-矩阵键盘\hey.c
Global variables memory map:
www.eeworm.com/read/292658/8342655
cpp le_totalchoicegauss.cpp
//LE_TotalChoiceGauss.cpp 全选主元高斯消去法
#include //输入输出流头文件
#include "LinearEquation.h" //线性方程(组)求解头文件
void main()
{
int i;
double a[4][4] = //实系数矩阵
{
{0.2368, 0.2471,
www.eeworm.com/read/392415/8343877
m nakagamirnd_gamma.m
function na=nakagamirnd_gamma(m1,N1,N2)
%这个函数用gamma分布的方法产生服从Nakagami_m的【N1,N2】维随机矩阵
%-----------------------------2005.5.30 ----------------------------------
% Shuai lujun,Information Engineering
www.eeworm.com/read/392335/8349495
m holderk.m
function [H,u,p]=holderk(x,k)
%求householder矩阵Hk
n=length(x);
if k=n
disp('k值错误');
return;
end
M=max(abs(x));
if M==0
disp('M=0');
return;
else
x=x/M;
end
s=norm(
www.eeworm.com/read/367107/9782412
cpp le_totalchoicegauss.cpp
//LE_TotalChoiceGauss.cpp 全选主元高斯消去法
#include //输入输出流头文件
#include "LinearEquation.h" //线性方程(组)求解头文件
void main()
{
int i;
double a[4][4] = //实系数矩阵
{
{0.2368, 0.2471,
www.eeworm.com/read/267086/11195392
cpp aic.cpp
#include
#include
#include
#include
//矩阵求逆函数
int brinv(double f[],int n)
{ int *is,*js,i,j,k,l,u,v;
double d,p;
is=(int *)malloc(n
www.eeworm.com/read/334860/12568025
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/334860/12568312
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/248016/12607668
m floyd.m
function [d,path]=floyd(a,sp,ep)
% floyd - 最短路问题
%
% Syntax: [d,path]=floyd(a,sp,ep)
%
% Inputs:
% a - 距离矩阵是指i到j之间的距离，可以是有向的
% sp - 起点的标号
% ep - 终点的标号
%
% Outputs:
www.eeworm.com/read/146618/12631749
cpp aic.cpp
#include
#include
#include
#include
//矩阵求逆函数
int brinv(double f[],int n)
{ int *is,*js,i,j,k,l,u,v;
double d,p;
is=(int *)malloc(n