代码搜索：sparse
找到约 3,324 项符合「sparse」的源代码
代码结果 3,324
www.eeworm.com/read/184787/9076219
m sparfull.m
n=1000;
b=[1:n]';
a1=sparse(1:n,1:n,1,n,n);
a2=sparse(2:n,1:n-1,1,n,n);
a=a1+a2+a2';
tic;
x=a\b;
t1=toc;
aa=full(a);
tic;
xx=aa\b;
t2=toc;
y=sum(x);
yy=sum(xx);
tic;
eig(a);
t3=toc
ti
www.eeworm.com/read/184772/9077087
c prepare.c
/*
** 2005 May 25
**
** The author disclaims copyright to this source code. In place of
** a legal notice, here is a blessing:
**
** May you do good and not evil.
** May you find forgiveness fo
www.eeworm.com/read/282295/9104109
h ssolve.h
c----------Sparse Solver Common Blocks
integer esp,nsp,nspo,ipre
logical lsolv1,lsolv2,domd
common /ssolve/ esp,nsp,nspo,ipre,lsolv1,lsolv2,d
www.eeworm.com/read/379943/9171918
c prepare.c
/*
** 2005 May 25
**
** The author disclaims copyright to this source code. In place of
** a legal notice, here is a blessing:
**
** May you do good and not evil.
** May you find forgiveness fo
www.eeworm.com/read/377683/9265771
c prepare.c
/*
** 2005 May 25
**
** The author disclaims copyright to this source code. In place of
** a legal notice, here is a blessing:
**
** May you do good and not evil.
** May you find forgiveness fo
www.eeworm.com/read/375719/9351839
m sdmvar.m
function [quiz,Xindex] = sdmvar(quiz,nbrow,nbcol,name)
% SDMPB/SDMVAR - declare a new matrix variable X
%
% [quiz,Xindex] = sdmvar(quiz,nbrow,nbcol,name);
%
% is a variable describing a SDM
www.eeworm.com/read/375075/9373479
m bnasparse.m
function [A,Avec] = bnAsparse(F,varF,nv)
% [A,Avec] = bnAsparse(F,varF,nv) - sparse state transition matrix of a Boolean network
% This function creates the state transition matrix A of a Boolean
www.eeworm.com/read/179014/9378633
c prepare.c
/*
** 2005 May 25
**
** The author disclaims copyright to this source code. In place of
** a legal notice, here is a blessing:
**
** May you do good and not evil.
** May you find forgive
www.eeworm.com/read/373250/9467618
m mysymsetdiff.m
function C = mysymsetdiff(A,B)
% MYSYMSETDIFF Symmetric set difference of two sets of positive integers (much faster than built-in setdiff)
% C = mysetdiff(A,B)
% C = (A\B) union (B\A) = { things t