代码搜索：sparse
找到约 3,324 项符合「sparse」的源代码
代码结果 3,324
www.eeworm.com/read/347945/11625827
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/261198/11659548
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/261198/11659863
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/156956/11750290
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/156956/11750497
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/156874/11757866
txt 06-14.txt
例6-14 用sparse函数将满矩阵转化为稀疏矩阵。
解：在命令窗口中输入如下命令，并按Enter键确认。
>> i=[5 2 4 7 1 3 2 6];
>> j=[2 4 3 7 2 5 1 8];
>> s=[8 1 0 5 1 2 4 3];
>> X=diag(s,-2)
X =
0 0 0 0 0 0
www.eeworm.com/read/259756/11768402
m bijiao.m
function u=bijiao
u=sparse(5,2);
for i=1:5
mesh=getmesh([0 0;1 0;1 1;0 1],[1 2 3;3 4 1],[1 2;2 3;3 4;4 1],[]);
mesh=uniformrefine(mesh,i);
A=MCDFM(mes
www.eeworm.com/read/259727/11770685
m consfmin.m
function [g, geq, dg, dgeq] = consfmin(x, baseMVA, bus, gen, gencost, branch, areas, Ybus, Yf, Yt, mpopt, parms, ccost, N, fparm, H, Cw)
%CONSFMIN Evaluates nonlinear constraints and their Jacobian f
www.eeworm.com/read/259727/11770844
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/257911/11907369
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