代码搜索:sparse

找到约 3,324 项符合「sparse」的源代码

代码结果 3,324
www.eeworm.com/read/409299/2235077

m maxsparsetargetalignment.m

function u = maxSparseTargetAlignment(X, y) %A function to compute the maximum sparse target alignment vector between matrix X %and vector y % %inputs %X data matrix with examples as rows %y l
www.eeworm.com/read/393395/2474595

m spars.m

function sparsity=spars(x) %Returns the sparsity of the matrix/vector x. It works for sparse and dense %storage, too. % This file is part of SeDuMi 1.1 by Imre Polik and Oleksandr Romanko % Copyright
www.eeworm.com/read/393395/2474656

m symfctmex.m

% [L,perm,xsuper,split,tmpsiz] = symfctmex(X, perm, cachsz) % Computes sparse symbolic factor L, updated permutation PERM, % super-node partition XSUPER, and a splitting of supernodes % (SPLI
www.eeworm.com/read/294317/8241742

cpp lsmatrix.cpp

// test linked sparse matrix class #include #include "lsmatrix.h" void main(void) { LinkedMatrix A, B, C; cin >> A; cout
www.eeworm.com/read/367160/9778479

f dlatm3.f

DOUBLE PRECISION FUNCTION DLATM3( M, N, I, J, ISUB, JSUB, KL, KU, $ IDIST, ISEED, D, IGRADE, DL, DR, IPVTNG, IWORK, $ SPARSE ) * * -- LAPACK auxili
www.eeworm.com/read/367160/9778494

f zlatm3.f

DOUBLE COMPLEX FUNCTION ZLATM3( M, N, I, J, ISUB, JSUB, KL, KU, $ IDIST, ISEED, D, IGRADE, DL, DR, IPVTNG, IWORK, $ SPARSE ) * * -- LAPACK auxili
www.eeworm.com/read/205036/15328888

m mtimes.m

function C = mtimes(A,B) %MTIMES sptensor-scalar multiplication. % % C = MTIMES(A,B) is called for the syntax 'A * B' when A or B is a % sparse tensor and the other argument is a scalar. % % F
www.eeworm.com/read/201477/15407795

cpp lsmatrix.cpp

// test linked sparse matrix class #include #include "lsmatrix.h" void main(void) { LinkedMatrix A, B, C; cin >> A; cout
www.eeworm.com/read/318028/3572832

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/316721/3608513

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