代码搜索：sparse

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

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

m dsbr_dv.m

function [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, St] = dSbr_dV(branch, Yf, Yt, V) %DSBR_DV Computes partial derivatives of power flows w.r.t. voltage. % [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, S
·
www.eeworm.com/read/147681/12539794

m pare_marq_step.m

function [x, lambda] = pare_marq_step(X, x, lambda); %PARE_MARQ_STEP Gauss-Newton step with Marquardt % % [x, lambda] = pare_marq_step(X, x, lambda); % makes basic step for this x with marquar
·
www.eeworm.com/read/334923/12562417

m dsbr_dv.m

function [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, St] = dSbr_dV(branch, Yf, Yt, V) %DSBR_DV Computes partial derivatives of power flows w.r.t. voltage. % [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, S
·
www.eeworm.com/read/147092/12587144

h make-gen.h

/* MAKE-GEN.h - Make generator matrix from parity-check matrix. */ /* Copyright (c) 2000, 2001 by Radford M. Neal * * Permission is granted for anyone to copy, use, or modify this program *
·
www.eeworm.com/read/132706/14077953

m dsbr_dv.m

function [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf, St] = dSbr_dV(branch, Yf, Yt, V) %DSBR_DV Computes partial derivatives of power flows w.r.t. voltage. % [dSf_dVa, dSf_dVm, dSt_dVa, dSt_dVm, Sf,
·
www.eeworm.com/read/132706/14078008

m opf_slvr.m

function code = opf_slvr(alg) %OPF_SLVR Which OPF solver is used by alg. % code = opf_slvr(alg) returns a solver code given an algorithm code. % The codes are: % 0 - 'constr' from Optimizati
·
www.eeworm.com/read/200429/15433517

m clustering_coefficients.m

function ccfs = clustering_coefficients(A,varargin) % CLUSTERING_COEFFICIENTS Compute the clustering coefficients for vertices. % % ccfs = clustering_coefficients(A) returns the clustering coeffici
·
www.eeworm.com/read/200429/15433535

m dfs.m

function [d dt ft pred] = dfs(A,u,varargin) % DFS Compute the depth first search times. % % [d dt ft pred] = dfs(A,u) returns the distance (d), the discover (dt) and % finish time (ft) for each ve
·
www.eeworm.com/read/200429/15433564

m bfs.m

function [d dt pred] = bfs(A,u,varargin) % BFS Compute the breadth first search order. % % [d dt pred] = bfs(A,u) returns the distance to each vertex (d) and the % discover time (dt) in a breadt
·
www.eeworm.com/read/200429/15433608

c components_mex.c

/* * ============================================================== * components_mex.c The mex interface to the matlab bgl wrapper. * * David Gleich * 21 April 20020 * ====================
·