代码搜索：sparse
找到约 3,324 项符合「sparse」的源代码
代码结果 3,324
www.eeworm.com/read/418304/10955773
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 = btcsc(a);
P1
www.eeworm.com/read/272243/10964574
h check.h
/* CHECK.H - Interface to procedure for computing parity checks, etc. */
/* Copyright (c) 2001 by Radford M. Neal
*
* Permission is granted for anyone to copy, use, or modify this program
* for
www.eeworm.com/read/272243/10964618
h check.h
/* CHECK.H - Interface to procedure for computing parity checks, etc. */
/* Copyright (c) 2001 by Radford M. Neal
*
* Permission is granted for anyone to copy, use, or modify this program
* for
www.eeworm.com/read/255778/6933837
m etp.m
%%***********************************************************
%% etp: Education testing problem.
%%
%% (D) maximize e'*d
%% subject to B - diag(d) >= 0
%% d >= 0
%%
%% (P) m
www.eeworm.com/read/469416/6976259
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
www.eeworm.com/read/427515/7095567
m design.m
function y=design(x)
% DESIGN
% DESIGN(x) creates a matrix of 1 and 0 corresponding to x
% y: Rows(x) x Max(x)
i=1:1:rows(x);
k=ones(rows(x),1);
s=sparse(i,x,k,rows(x),max(x));
y=full(
www.eeworm.com/read/219035/7147318
m non_trivial.m
% find a non_trivial solution to A*x = 0;
function [err,sol] = non_trivial(mZ, mBNegate, varargin)
if ~isempty(varargin{:})
opts.v0 = varargin{:};
end
opts.p = 5;
opts.tol = 1e-2;
opts.
www.eeworm.com/read/463384/7182664
m glpksparse.m
disp('3rd problem');
s=1;
c=[0 0 0 -1 -1]';
a=sparse([-2 0 0 1 0;...
0 1 0 0 2;...
0 0 1 3 2]);
b=[4 12 18]';
ctype=['S','S','S']';
lb=[0,0,0,0,0]'; ub=[];
vartype=['C','C','C','C','C']';
para
www.eeworm.com/read/458493/7295788
m compsplintflops.m
function compSplintFlops
% compSplintFlops Show flops savings due to sparse storage in spline interp
%
% Synopsis: compSplintFlops
%
% Input: None
%
% Output: Table of flops to compute spli
www.eeworm.com/read/458488/7296164
m compsplintflops.m
function compSplintFlops
% compSplintFlops Show flops savings due to sparse storage in spline interp
%
% Synopsis: compSplintFlops
%
% Input: None
%
% Output: Table of flops to compute spli