代码搜索：sparse
找到约 3,324 项符合「sparse」的源代码
代码结果 3,324
www.eeworm.com/read/298099/7974567
m ex0220.m
%产生稀疏矩阵并转变为全元素矩阵，得出的稀疏矩阵分布图
a=eye(3);
a(4,:)=[-5 -2 -3]
b=sparse(a) %创建稀疏矩阵
b=sparse([1 4 2 4 3 4],[1 1 2 2 3 3],[1 -5 1 -2 1 -3]) %创建与b相同的稀疏矩阵
full(b)
D=[3 2 9;2 4 9;1 1 4]
d=[0 1 2]
s=spdia
www.eeworm.com/read/297009/8065810
c prepare.c
/*
** 2005 May 25
**
** The author disclaims copyright to this source code. In place of
** a legal notice, here is a blessing:
**
** May you do good and not evil.
** May you find forgiveness fo
www.eeworm.com/read/296909/8072842
m ex_simple_sparseformat.m
%----------------------------------------------------------------------
%
% SIMPLE GP EXAMPLE 1
%
%----------------------------------------------------------------------
%
% minimize: x^2 +
www.eeworm.com/read/295984/8130112
m sparfull.m
n=1000;
b=[1:n]';
a1=sparse(1:n,1:n,1,n,n);
a2=sparse(2:n,1:n-1,1,n,n);
a=a1+a2+a2';
tic;
x=a\b;
t1=toc;
aa=full(a);
tic;
xx=aa\b;
t2=toc;
y=sum(x);
yy=sum(xx);
tic;
eig(a);
t3=toc
ti
www.eeworm.com/read/145339/12735070
m exd3.m
% example exd3
%----------------------------------------------------------------
% PURPOSE
% Structural Dynamics, time integration, reduced system.
%
% Note: example exd1.m must be run first.
%
www.eeworm.com/read/144399/12797606
m compsplintflops.m
function compSplintFlops
% compSplintFlops Show flops savings due to sparse storage in spline interp
%
% Synopsis: compSplintFlops
%
% Input: None
%
% Output: Table of flops to compute spli
www.eeworm.com/read/143706/12850199
m mis.m
% Modified Improved Iterative Scaling Algorithm
%
% function run = mis(input_file, max_iter, scale_flag, sparse_flag, newtonmethod, smooth_flag, alpha)
%
% input_file: input filename, string
% m
www.eeworm.com/read/244502/12859598
m exd3.m
% example exd3
%----------------------------------------------------------------
% PURPOSE
% Structural Dynamics, time integration, reduced system.
%
% Note: example exd1.m must be run first.
%
www.eeworm.com/read/330173/12908231
m ldpc_decode.m
function [QQ,x_hat, success, k] = ldpc_decode(f,H,qq)
if qq==2 % binary case first, just use the old code
[m,n] = size(H); if m>n, H=H'; [m,n] = size(H); end
if ~issparse(H) % make H s
www.eeworm.com/read/142703/12930160
m udisomapgeodistancek.m
function [GeoD,D]=udIsomapGeoDistanceK(X, NeighborsNum);
% 计算Isomap算法的测地线距离
% Input:
% X = D x N matrix of input points (where D is the dimensionality of points, N is the number of data point