代码搜索：sparse
找到约 3,324 项符合「sparse」的源代码
代码结果 3,324
www.eeworm.com/read/384940/8832367
m gcall.m
function gcall(a)
global DAE
if ~a.n, return, end
V = DAE.y(a.vbus);
Dw = domega(a);
DAE.g = DAE.g + sparse(a.bus,1,a.u.*a.con(:,2).*(V.^a.con(:,3)).* ...
(1+Dw).^a.con(:,
www.eeworm.com/read/384940/8832505
m fm_call.m
function fm_call(flag)
%FM_CALL calls component equations
%
%FM_CALL(CASE)
% CASE '1' algebraic equations
% CASE 'pq' load algebraic equations
% CASE '3' differential equations
% CASE '1r' alg
www.eeworm.com/read/384940/8832729
m gycall.m
function Gycall(a)
global DAE
if ~a.n, return, end
DAE.Gy = DAE.Gy ...
- sparse(a.delta,a.delta,1,DAE.m,DAE.m) ...
- sparse(a.omega,a.omega,1,DAE.m,DAE.m);
www.eeworm.com/read/384940/8832825
m fxcall.m
function Fxcall(p)
global DAE
if ~p.n, return, end
alpha = DAE.x(p.alpha);
V1 = p.u.*DAE.y(p.v1);
V2 = p.u.*DAE.y(p.v2);
Tm = p.con(:,7);
Kp = p.con(:,8);
Ki = p.con(:,9);
Pref = p.con(:,10);
a_m
www.eeworm.com/read/384940/8832830
m gcall.m
function gcall(a)
global DAE
if ~a.n, return, end
Vf = a.u.*DAE.y(a.v1).*exp(i*DAE.y(a.bus1));
Vt = a.u.*DAE.y(a.v2).*exp(i*DAE.y(a.bus2));
y = admittance(a);
m = a.con(:,15).*exp(i*DAE.x(a.alpha
www.eeworm.com/read/384940/8832982
m gycall.m
function Gycall(a)
global DAE
if ~a.n, return, end
V1 = DAE.y(a.v1);
V2 = DAE.y(a.v2);
t1 = DAE.y(a.bus1);
t2 = DAE.y(a.bus2);
ss = sin(t1-t2);
cc = cos(t1-t2);
a1 = ss.*a.B;
a2 = cc.*a.B;
a3 = V1
www.eeworm.com/read/384940/8833020
m fxcall.m
function Fxcall(a)
global DAE Settings
if ~a.n, return, end
id = DAE.x(a.Id);
iq = DAE.x(a.Iq);
If = DAE.x(a.If);
ed = DAE.x(a.Edc);
eq = DAE.x(a.Eqc);
w = DAE.x(a.omega);
d = DAE.x(a.delta);
xd
www.eeworm.com/read/383950/8909279
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/427909/8913558
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/382751/9002986
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