代码搜索：sparse

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

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

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/298590/7950410

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/298568/7950828

m ldpc_generate.m

function [H] = generate(M,N,t,q,seed) %[H] = generate(M,N,t,q,seed) % generates sparse LDPC parity check matrix over GFq % (first H for GF2 is generated, then elements of GFq are created at random)
·
www.eeworm.com/read/296847/8075063

m run_nmf.m

function [out eucl_dist] = run_nmf(K, alg, maxiter, norm, dataset) %%%%%%%%%%%%%%%%%%%%%%% % load data %%%%%%%%%%%%%%%%%%%%%%% addpath ../ if strcmp('email', dataset) load exp_data_ema
·
www.eeworm.com/read/244247/12876940

m decode.m

function [x_hat, success, k] = decode(f,H,maxiter) % 以下程序针对二进制情况进行处理 % 本程序方法可参照MacMay1999年发表于IEEE TRANSACTIONS.VOL.45.NO.2的 % Good Error-Correcting Codes Based on Very Sparse Matrices % We assum
·
www.eeworm.com/read/330332/12900775

h bitmat.h

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

m ldpc_generate.m

function [H] = generate(M,N,t,q,seed) %[H] = generate(M,N,t,q,seed) % generates sparse LDPC parity check matrix over GFq % (first H for GF2 is generated, then elements of GFq are created at random)
·
www.eeworm.com/read/140851/13058593

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/140851/13058921

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/241396/13147469

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
·