代码搜索:sparse

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

代码结果 3,324
www.eeworm.com/read/163958/10137248

htm text2-11.htm

Untitled Document
www.eeworm.com/read/200336/10247204

m consfmin.m

function [g, geq, dg, dgeq] = consfmin(x, baseMVA, bus, gen, gencost, branch, areas, Ybus, Yf, Yt, mpopt, parms, ccost) %CONSFMIN Evaluates nonlinear constraints and their Jacobian for OPF. % [g, g
www.eeworm.com/read/200336/10247250

m dcopf.m

function [buso, geno, brancho, f, success, info, et] = dcopf(baseMVA, ... bus, gen, branch, areas, gencost, mpopt) %DCOPF Solves a DC optimal power flow. % % [bus, gen, branch, f
www.eeworm.com/read/281001/10273350

h bitmat.h

/*---------------------------------------------------------------------- File : bitmat.h Contents: bit matrix management Author : Christian Borgelt History : 2002.06.09 file created
www.eeworm.com/read/353831/10414957

m dcopf.m

function [buso, geno, brancho, f, success, info, et] = dcopf(baseMVA, ... bus, gen, branch, areas, gencost, mpopt) %DCOPF Solves a DC optimal power flow. % % [bus, gen, branch, f
www.eeworm.com/read/349646/10808564

c rectintsparseloopc.c

/* This is based on http://www.mathworks.com/access/helpdesk/help/techdoc/matlab_external/ch04cr12.shtml See rectintSparse.m for the matlab version of this code. */ #include /* Need
www.eeworm.com/read/349646/10808879

c junk.c

m = mxGetM(prhs[0]); n = mxGetN(prhs[0]); pr = mxGetPr(prhs[0]); pi = mxGetPi(prhs[0]); cmplx = (pi == NULL ? 0 : 1); /* Allocate space for sparse matrix. * NOTE: Assume a
www.eeworm.com/read/349646/10809355

c rectintsparseloopc.c

/* This is based on http://www.mathworks.com/access/helpdesk/help/techdoc/matlab_external/ch04cr12.shtml See rectintSparse.m for the matlab version of this code. */ #include /* Need
www.eeworm.com/read/349646/10809924

c junk.c

m = mxGetM(prhs[0]); n = mxGetN(prhs[0]); pr = mxGetPr(prhs[0]); pi = mxGetPi(prhs[0]); cmplx = (pi == NULL ? 0 : 1); /* Allocate space for sparse matrix. * NOTE: Assume a
www.eeworm.com/read/349479/10825190

m consfmin.m

function [g, geq, dg, dgeq] = consfmin(x, baseMVA, bus, gen, gencost, branch, areas, Ybus, Yf, Yt, mpopt, parms, ccost) %CONSFMIN Evaluates nonlinear constraints and their Jacobian for OPF. % [g, g