代码搜索:sparse

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

代码结果 3,324
www.eeworm.com/read/306698/13739975

c radjacency.c

/* * * Returns the Sparse adjacency matrix of neighbours of xi within the ball radius R, such {x_j}, ji, d(xi,xj)
www.eeworm.com/read/303498/13814239

m e0228.m

u=1:4;v=3:6;S=[0.1 0.2 0.3 0.4]; spa=sparse(u,v,S) a=full(spa)
www.eeworm.com/read/147529/5728669

m preaug.m

% $Revision: 1.2 $ function[L,U,P,pcol] = preaug(H,pcf,A); %PREAUG example preconditioner of augmented matrix % % [L,U,P,pcol] = PREAUG(H,pcf,A) computes a sparse % factorization of the LU-facto
www.eeworm.com/read/147529/5728879

m preaug.m

% $Revision: 1.2 $ function[L,U,P,pcol] = preaug(H,pcf,A); %PREAUG example preconditioner of augmented matrix % % [L,U,P,pcol] = PREAUG(H,pcf,A) computes a sparse % factorization of the LU-facto
www.eeworm.com/read/274660/6288452

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/491859/6427868

m li40.m

n=2000; D=sparse(1:n,1:n,-2*ones(1,n),n,n); E=sparse(2:n,1:n-1,ones(1,n-1),n,n); S=E+D+E' %生成稀疏矩阵S b=ones(n,1) tic; %计时开始 x=S\b; t1=toc %计时结束
www.eeworm.com/read/263879/11338200

m preaug.m

% $Revision: 1.2 $ function[L,U,P,pcol] = preaug(H,pcf,A); %PREAUG example preconditioner of augmented matrix % % [L,U,P,pcol] = PREAUG(H,pcf,A) computes a sparse % factorization of the LU-facto
www.eeworm.com/read/407093/11429503

m lusolve.m

function x = lusolve(A,b,Pcol) % LUSOLVE : Solve linear systems by supernodal LU factorization. % % x = lusolve(A, b) returns the solution to the linear system A*x = b, % using a supernodal LU
www.eeworm.com/read/407093/11429522

m verbose.m

% VERBOSE Set the sparse monitor flag to verbose. spparms('spumoni', 1);
www.eeworm.com/read/347943/11626696

c ordmmdmex.c

/* perm = ordmmdmex(X) Computes multiple-minimum-degree permutation, for sparse Cholesky. X is a sparse symmetric matrix; only its off- diagonal sparsity structure is used. Invokes