代码搜索:sparse
找到约 3,324 项符合「sparse」的源代码
代码结果 3,324
www.eeworm.com/read/147092/12587186
h check.h
/* CHECK.H - Interface to procedure for computing parity checks, etc. */
/* Copyright (c) 2001 by Radford M. Neal
*
* Permission is granted for anyone to copy, use, or modify this program
*
www.eeworm.com/read/201342/15409884
txt 06-14.txt
例6-14 用sparse函数将满矩阵转化为稀疏矩阵。
解:在命令窗口中输入如下命令,并按Enter键确认。
>> i=[5 2 4 7 1 3 2 6];
>> j=[2 4 3 7 2 5 1 8];
>> s=[8 1 0 5 1 2 4 3];
>> X=diag(s,-2)
X =
0 0 0 0 0 0
www.eeworm.com/read/200429/15433558
m mst.m
function [out1 out2 out3] = mst(A,varargin)
% MST Compute a minimum spanning tree for an undirected graph A.
%
% There are two ways to call MST.
% T = mst(A)
% [i j v] = mst(A)
% The first call
www.eeworm.com/read/200429/15433592
c biconnected_components_mex.c
/*
* ==============================================================
* bfs_mex.c The mex interface to the matlab bgl wrapper.
*
* David Gleich
* 20 April 20020
* ===========================
www.eeworm.com/read/200429/15433595
c clustering_coefficients_mex.c
/*
* ==============================================================
* clustering_coefficients_mex.c The mex interface to the matlab bgl wrapper.
*
* David Gleich
* 23 April 20020
* =======
www.eeworm.com/read/200429/15433601
c betweenness_centrality_mex.c
/*
* ==============================================================
* betweenness_centrality_mex.c The mex interface to the matlab bgl wrapper.
*
* David Gleich
* 23 April 2006
* =========
www.eeworm.com/read/289743/8529943
c find_nn.c
#include "mex.h"
#include
void mexFunction(
int nlhs, mxArray *plhs[],
int nrhs, const mxArray *prhs[]
)
{
/* Declare variables. */
int *
www.eeworm.com/read/188426/8541354
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/188426/8541379
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/431224/8695239
m gcall.m
function gcall(a)
global DAE
if ~a.n, return, end
V = DAE.y(a.vbus);
B = a.u.*bsvc(a);
DAE.g = DAE.g ...
- sparse(a.vbus,1,DAE.y(a.q),DAE.m,1) ...
+ sparse(a.q,1,B.*V.*V-DAE.y(a.q)