代码搜索：sparse

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

代码结果 3,324
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/457742/7318229

m l2_triangulation_loop.m

function hh=l2_triangulation_loop(Pt,rect_yL,rect_yU,xL,xU,yLB,yUB); nbrimages=length(Pt); P0=Pt{1}; %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%
·
www.eeworm.com/read/456193/7354705

m fm_tcsc.m

function fm_tcsc(flag) % FM_TCSC defines Synchronous Machines % % FM_TCSC(FLAG) % FLAG = 0 initializations % FLAG = 1 algebraic equations % FLAG = 2 algebraic Jacobians % FLAG
·
www.eeworm.com/read/456193/7355030

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/449504/7502431

txt wmat.txt

% documentation for wmat.dat % 1st order contiguity matrix for % Anselin's Columbus crime dataset % stored in sparse matrix format [i, j, s] = find(W); % so that W = sparse(i,j,s); reconstructs
·
www.eeworm.com/read/444599/7611011

m leigs.m

function [E,V] = leigs(DATA, TYPE, PARAM, NE) % --- leigs function for Laplacian eigenmap. % Written by Belkin & Niyogi, 2002. n = size(DATA,1); A = sparse(n,n); step = 100; for i1=1:step:n
·
www.eeworm.com/read/441325/7671843

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/441325/7671889

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/437681/7743092

m bp_decode.m

function [yo] = BP_decode(y,N0,H,m,n,max_iter) % decoding of binary LDPC as in Elec. Letters by MacKay&Neal 13March1997 % For notations see the same reference. % function [x_hat, success, k] = ldpc
·
www.eeworm.com/read/299178/7881237

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/433808/7908142

m repliche.m

function [Gnew, Pnew]=repliche(G, P); %repliche: Bayesian Variable Selection % Search for replicates %*********************************************************************** %INPUTS: % G, matrix
·