代码搜索：协方差矩阵
找到约 10,000 项符合「协方差矩阵」的源代码
代码结果 10,000
www.eeworm.com/read/126405/14425203
h levin.h
//t：对称LEVIN矩阵元素
//b:方程组右端常数
//X:解
int levin(double t[],double b[],int n,double x[])
{ int i,j,k;
double a,beta,q,c,h,*y,*s;
s=(double *)malloc(n*sizeof(double));
y=(double *)malloc(
www.eeworm.com/read/123236/14641825
cpp juzheng.cpp
#include
#include
#include
#include
void main()
{float *x;
int k,a,b,c,i,r,n;
float A[10][10];
coutn;
cout
www.eeworm.com/read/221894/14715716
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/221812/14719544
cpp exam8-1.cpp
#include
#include
typedef char VerT; //定义邻接矩阵图类中的VerT
typedef char DataType; //定义顺序表类中的DataType
const int MaxVertices = 100; //定义最大顶点个数
const int MaxWeight =
www.eeworm.com/read/221812/14719554
cpp exam8-2.cpp
#include
#include
typedef char VerT; //定义邻接矩阵图类中的VerT
typedef char DataType; //定义顺序表类中的DataType
const int MaxVertices = 100; //定义最大顶点个数
const int MaxQueueSize
www.eeworm.com/read/116247/14982178
cpp p263.cpp
//图的邻接矩阵表示,求最短路径算法
#include "iostream.h"
#include "stdio.h"
#include "assert.h"
#include "queue.h"
#include "sqlist.h"
//#include "minspantree.h"
const int MaxNumEdges = 50; //最大边数
c
www.eeworm.com/read/216389/15015292
txt 06-10.txt
例6-10 魔术矩阵的生成。
解：在命令窗口中输入如下命令，并按Enter键确认。
>> magic(2)
ans =
1 3
4 2
>> magic(3)
ans =
8 1 6
3 5 7
4 9 2
>> magic(4)
ans =
16
www.eeworm.com/read/115294/15019072
cpp p263.cpp
//图的邻接矩阵表示,求最短路径算法
#include "iostream.h"
#include "stdio.h"
#include "assert.h"
#include "queue.h"
#include "sqlist.h"
//#include "minspantree.h"
const int MaxNumEdges = 50; //最大边数
c
www.eeworm.com/read/215900/15034612
m jacobi.m
function [y,n]=jacobi(A,b,x0,eps)
if nargin==3
eps=1.0e-6;
elseif nargin
www.eeworm.com/read/215900/15034633
m gauseidel.m
function [y,n]=gauseidel(A,b,x0,eps)
if nargin==3
eps=1.0e-6;
elseif nargin