代码搜索：协方差矩阵
找到约 10,000 项符合「协方差矩阵」的源代码
代码结果 10,000
www.eeworm.com/read/278599/10526641
m gauseidel.m
function [y,n]=gauseidel(A,b,x0,eps)
if nargin==3
eps=1.0e-6;
elseif nargin
www.eeworm.com/read/352044/10586117
cpp le_totalchoicegaussjordan.cpp
//LE_TotalChoiceGaussJordan.cpp 全选主元高斯-约当消去法
#include //输入输出流头文件
#include "LinearEquation.h" //线性方程(组)求解头文件
void main()
{
int i;
double a[4][4] = //实系数矩阵
{
{1.0,
www.eeworm.com/read/421634/10723290
cpp l5_1.cpp
//稀疏矩阵的转置
#include
const int maxsize=100;
struct node //定义一个三元组
{
int i , j; //非零元行、列号
int v; //非零元值
};
struct sparmatrix
www.eeworm.com/read/273976/10891803
cpp text1.cpp
// 最小生成树kruskal算法2
#include
#include
#define MaxVex 10 //最大顶点数
#define MaxEdge 20 //最大边数
// 用邻接矩阵表示
typedef struct
{
int begin;
int end;
int weight;
} edge;
www.eeworm.com/read/273606/10908675
m jacobi.m
function [y,n]=jacobi(A,b,x0,eps)
if nargin==3
eps=1.0e-6;
elseif nargin
www.eeworm.com/read/273606/10908697
m gauseidel.m
function [y,n]=gauseidel(A,b,x0,eps)
if nargin==3
eps=1.0e-6;
elseif nargin
www.eeworm.com/read/272210/10965692
cpp tsp1.cpp
#include
#include
#include
#include
#define MAXDIS 30000
#define x 0
#define y 1
int **G; //图的邻接矩阵
int n; //图顶点数
unsigned int s; //用于表示
www.eeworm.com/read/417350/10993275
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/470699/6906031
m jacobi.m
function [y,n]=jacobi(A,b,x0,eps)
if nargin==3
eps=1.0e-6;
elseif nargin
www.eeworm.com/read/470699/6906043
m gauseidel.m
function [y,n]=gauseidel(A,b,x0,eps)
if nargin==3
eps=1.0e-6;
elseif nargin