代码搜索：Sparse
找到约 3,324 项符合「Sparse」的源代码
代码结果 3,324
www.eeworm.com/read/263516/11359702
m fxcall.m
function Fxcall(a)
global DAE Bus Pod
if ~a.n, return, end
V1 = DAE.V(a.bus1);
V2 = DAE.V(a.bus2);
t1 = DAE.a(a.bus1);
t2 = DAE.a(a.bus2);
ss = sin(t1-t2);
cc = cos(t1-t2);
Tr = a.con(:
www.eeworm.com/read/263516/11359704
m gcall.m
function gcall(a)
global Bus DAE
if ~a.n, return, end
V1 = DAE.V(a.bus1);
V2 = DAE.V(a.bus2);
t1 = DAE.a(a.bus1);
t2 = DAE.a(a.bus2);
ss = sin(t1-t2);
cc = cos(t1-t2);
% update B
B =
www.eeworm.com/read/408917/11365301
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/407093/11429521
m mexsuperlu.m
function [L,U,prow,pcol] = mexsuperlu(A,psparse);
% MEXSUPERLU : Supernodal LU factorization
%
% MEXSUPERLU is the mex-file version of the supernodal factorization.
% The user will normally call SUP
www.eeworm.com/read/401272/11559986
m clucent.m
% function x = clucent(cpm,cl)
%
% Copyright (c) 1998-2002 by Alexander Strehl
function x = clucent(cpm,cl)
x = sparse(max(cl),size(cpm,2));
for i=1:max(cl)
x(i,:) = mean(cpm(find(cl==i)
www.eeworm.com/read/347945/11624439
m double.m
function sys=double(X)
%DOUBLE Returns current numerical value
% Author Johan L鰂berg
% $Id: double.m,v 1.1 2005/10/12 16:05:54 joloef Exp $
sys = sparse(X.iX,X.jX,X.sX,X.n,X.m);
%X.basis;
www.eeworm.com/read/347945/11624832
m see.m
function see(X,showfull)
%SEE Displays internal structure of variable
%
% Shows the base matrices that build up the variable
%
% X = X0+x_1*X1+x_2*X2+...
%
% SEE(X) Disp
www.eeworm.com/read/158283/11627625
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/158241/11630862
m ex0220.m
%产生稀疏矩阵并转变为全元素矩阵，得出的稀疏矩阵分布图
a=eye(3);
a(4,:)=[-5 -2 -3]
b=sparse(a) %创建稀疏矩阵
b=sparse([1 4 2 4 3 4],[1 1 2 2 3 3],[1 -5 1 -2 1 -3]) %创建与b相同的稀疏矩阵
full(b)
D=[3 2 9;2 4 9;1 1 4]
d=[0 1 2]
s=spdia
www.eeworm.com/read/261198/11659758
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 that