代码搜索：sparse
找到约 3,324 项符合「sparse」的源代码
代码结果 3,324
www.eeworm.com/read/349479/10825274
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/418304/10954367
m fm_nrlf.m
function conv = fm_nrlf(iter_max, tol, Show)
% FM_NRLF solve power flow with locked ste variables
%
% CONV = FM_NRLF(ITERMAX,TOL)
% ITERMAX = max number of iterations
% TOL = convergenc
www.eeworm.com/read/418304/10954441
m fm_limit.m
function fm_limit
% FM_LIMIT compute Limit-Induced Bifurcation (LIB)
% by means of a Newton-Raphson routine.
%
% FM_LIMIT
%
% LIB.type: 1 = 'Vmax' for maximum voltage limit
%
www.eeworm.com/read/418304/10955075
m fm_thload.m
function fm_thload(flag)
% FM_THLOAD defines Thermostatically Controlled Loads
%
% FM_THLOAD(FLAG)
% FLAG = 0 initialization
% FLAG = 1 algebraic equations
% FLAG = 2 algebraic Jaco
www.eeworm.com/read/418304/10955163
m fm_opfm.m
function fm_opfm
%FM_OPFMR solves the OPF-based electricity market problem by means of
% an Interior Point Method with a Merhotra Predictor-Corrector
% or Newton direction technique.
www.eeworm.com/read/417350/10993327
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/470858/6901178
h bitmat.h
/*----------------------------------------------------------------------
File : bitmat.h
Contents: bit matrix management
Author : Christian Borgelt
History : 2002.06.09 file created
www.eeworm.com/read/255778/6933821
m control.m
%%******************************************************
%% control: a SDP problem from control theory.
%%
%% (D) max t
%% s.t Bk'*P + P*Bk
www.eeworm.com/read/469416/6976172
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/469416/6976316
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