代码搜索：sparse

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

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

h dec.h

/* DEC.H - Interface to decoding procedures. */ /* Copyright (c) 2000 by Radford M. Neal * * Permission is granted for anyone to copy, use, or modify this program * for purposes of research or e
·
www.eeworm.com/read/148256/12480119

m q46.m

%《MATLAB及在电子信息课程中的应用》第四章第六节演示程序q46 % 稀疏矩阵函数 % 电子工业出版社出版 陈怀琛 吴大正 高西全合著 2001年10月初版，2003年7月第二版 % x = [ 0 0 0 0 0 ;... 0 0 0 0.1302
·
www.eeworm.com/read/148255/12480929

m ex46.m

%《MATLAB及其在理工课程中的应用指南》第四章第六节演示程序 % 西安电子科技大学出版社出版 陈怀琛编著 1999年10月初版，2004年11月第二版 % x = [ 0 0 0 0 0 ;... 0 0 0 0.1302 0 ;...
·
www.eeworm.com/read/335571/12514446

m grad_ccv.m

function [df, dg] = grad_ccv(x, baseMVA, bus, gen, gencost, branch, Ybus, Yf, Yt, V, ref, pv, pq, mpopt) %GRAD_CCV Evaluates gradients of objective function & constraints for OPF. % [df, dg] = gr
·
www.eeworm.com/read/334923/12562467

m t_jacobian.m

function t_jacobian(quiet) %T_JACOBIAN Numerical tests of partial derivative code. % MATPOWER % $Id: t_jacobian.m,v 1.3 2005/07/08 18:58:38 ray Exp $ % by Ray Zimmerman, PSERC Cornell % Copy
·
www.eeworm.com/read/334923/12562560

m grad_ccv.m

function [df, dg] = grad_ccv(x, baseMVA, bus, gen, gencost, branch, Ybus, Yf, Yt, V, ref, pv, pq, mpopt) %GRAD_CCV Evaluates gradients of objective function & constraints for OPF. % [df, dg] = grad
·
www.eeworm.com/read/147092/12587136

h dec.h

/* DEC.H - Interface to decoding procedures. */ /* Copyright (c) 2000, 2001 by Radford M. Neal * * Permission is granted for anyone to copy, use, or modify this program * for purposes of re
·
www.eeworm.com/read/300378/13916920

m program_20_1.m

% 本程序实现小波在矩阵方程求解中的应用 clear;clc; % 构造小波矩阵 [h,g]= wfilters('db7','d'); % 分解低通和高通滤波器 N=512; % 矩阵维数(大小为2的整数幂次) L=length(h); % 滤波器长度 rank_max=log2(N); % 最大层数 rank_m
·
www.eeworm.com/read/133875/14019422

m exm051523_1.m

%exm051523_1.m n=5; SM1=sparse(1:n,1:n,-2*ones(1,n),n,n,n); SM2=sparse(2:n,1:n-1,ones(1,n-1),n,n,n-1); S1=SM1+SM2+SM2' e=ones(n,1); S2=spdiags([e,-2*e,e],[-1,0,1],n,n), SF=full(S1)
·
www.eeworm.com/read/235928/14041439

m som_neighbors.m

function Ne = som_neighbors(sM,neigh) % Ne = som_neighbors(sM,neigh) % % sM (struct) map or data struct % (matrix) data matrix, size n x dim % [neigh] (string) 'kNN' or 'Nk' (which is va
·