代码搜索:sparse

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

代码结果 3,324
www.eeworm.com/read/343744/11930756

m qls.m

function x = qls(A,b) %SSNE Solution of sparse linear least squares problems. % @(#)qls.m Version 1.6 6/23/93 % Pontus Matstoms, Linkoping University. % e-mail: pomat@math.liu.se % %
www.eeworm.com/read/343227/11962901

m issparse.m

function t = issparse(x) %issparse Returns 0 (introduced for MATLAB compatibility), assuming all % matrices are non-sparse. % H2M/cnt Toolbox, Version 2.0 % Olivier Capp
www.eeworm.com/read/153823/12004265

m tri2adj.m

function A = tri2adj(T) %TRI2ADJ Triangle indices to adjacency matrix representation. % A = tri2adj(T) % T = n x 3 matrix, where each row defines indices for one of n % triangles
www.eeworm.com/read/341326/12093265

m ldpc_bp_decode.m

function [yo] = BP_decode(y,N0,H,m,n,max_iter) % decoding of binary LDPC as in Elec. Letters by MacKay&Neal 13March1997 % For notations see the same reference. % function [x_hat, success, k] = ldpc
www.eeworm.com/read/233414/14154672

c make-ldpc.c

/* MAKE-LDPC.C - Make a Low Density Parity Check code's parity check matrix. */ /* Copyright (c) 2000, 2001, 2006 by Radford M. Neal and Peter Junteng Liu * * Permission is granted for anyone to co
www.eeworm.com/read/226406/14476182

m ldpc_generate.m

function [H] = generate(M,N,t,q,seed) %[H] = generate(M,N,t,q,seed) % generates sparse LDPC parity check matrix over GFq % (first H for GF2 is generated, then elements of GFq are created at random)
www.eeworm.com/read/123705/14616027

m genmat3.m

function [A,B,b]=genmat3(xyz,el,a,b,s) %GENMAT3 Generates FEM3 matrices. % [A,B,b] = GENMAT3(NOD2XYZ,EL2NOD,ALPHA,BETA,S) % where NOD2XYZ contains the node points % and EL2NOD contains the tetr
www.eeworm.com/read/217365/14968360

m bp_decode.m

function [yo] = BP_decode(y,N0,H,m,n,max_iter) % decoding of binary LDPC as in Elec. Letters by MacKay&Neal 13March1997 % For notations see the same reference. % function [x_hat, success, k] = ldpc
www.eeworm.com/read/116163/14986570

java plus_spar.java

/* 用三元组表的方式实现两个矩阵的加法运算 */ public class plus_spar { //已知的两个矩阵A和B public int A[][]; public int B[][]; public void plus() { //入口判断,若A和B不同形,则不能进行加法运算 if (A.length!=B.l
www.eeworm.com/read/216463/15006100

c make-ldpc.c

/* MAKE-LDPC.C - Make a Low Density Parity Check code's parity check matrix. */ /* Copyright (c) 2000, 2001, 2006 by Radford M. Neal and Peter Junteng Liu * * Permission is granted for anyone to co