代码搜索：sparse

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

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

m burble.m

% BURBLE Set the sparse monitor flag to extremely verbose. spparms('spumoni', 3);
·
www.eeworm.com/read/347943/11626756

m fromsdpa.m

function [At,b,c,K]=fromsdpa(fname) % readsdpa Reads SDP problem from sparse SDPA-formatted input file. % [At,b,c,K] = readsdpa(fname) produces conic optimization problem % data, as can be used
·
www.eeworm.com/read/346528/11739395

m spnnchain.m

% spnnchain Defines a Hamiltonian with a(k)b(k+1) nearest-neighbor % interaction; sparse version. % spnnchain (a,b,n) defines a a(k)b(k+1) type Hamiltonian % with non-periodic bou
·
www.eeworm.com/read/157044/11743458

m contract.m

function [R,xyR] = contract(A,blocks,xyA) % CONTRACT : Condense a graph according to a given block structure. % % R = contract(A,blocks): % % Input: A is an n by n matrix representing a directed or
·
www.eeworm.com/read/259756/11768333

m supg.m

function mesh=SUPG(mesh, eps, a1, a2, b, f, g_D,g_N) % CDFM solve the 2-D convection-dominated diffusion equation % -\epslon\delta u +a*grad(u)+bu=0, % in the current mesh with boundary c
·
www.eeworm.com/read/259756/11768336

m wmcdfm.m

function mesh=WMCDFM(mesh, eps, a1, a2, b, f, g_D,g_N) % CDFM solve the 2-D convection-dominated diffusion equation % -\epslon\delta u +a*grad(u)+bu=0, % in the current mesh with boundary
·
www.eeworm.com/read/259756/11768351

asv supg.asv

function mesh=SUPG(mesh, eps, a1, a2, b, f, g_D,g_N) % CDFM solve the 2-D convection-dominated diffusion equation % -\epslon\delta u +a*grad(u)+bu=0, % in the current mesh with boundary c
·
www.eeworm.com/read/259756/11768378

m cdfm.m

function u =CDFM(mesh, eps,dta,a1, a2, b, f, g_D) % CDFM solve the 2-D convection-dominated diffusion equation % -\epslon\delta u +a*grad(u)+bu=0, % in the current mesh with boundary conditi
·
www.eeworm.com/read/343744/11930779

m augm.m

function x = augm(A,b,alpha,N) % AUGM Solution of sparse linear least squares problems. % % x=augm(A,b,alpha,N) solves the sparse linear least squares problem % min ||Ax-b||
·
www.eeworm.com/read/339239/12247860

m exm041523_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)
·