代码搜索：sparse
找到约 3,324 项符合「sparse」的源代码
代码结果 3,324
www.eeworm.com/read/13871/284498
c junk.c
m = mxGetM(prhs[0]);
n = mxGetN(prhs[0]);
pr = mxGetPr(prhs[0]);
pi = mxGetPi(prhs[0]);
cmplx = (pi == NULL ? 0 : 1);
/* Allocate space for sparse matrix.
* NOTE: Assume a
www.eeworm.com/read/232874/4695978
m regex04.m
function RegEx04(X,y,b,zn)
% Plots results for Orthogonial Matching Pursuit Algorithm against the true
% underlying model.
%Find sparse solutions, with true model unknown
[bhatOMP, iters activ
www.eeworm.com/read/304358/3799804
m dep.m
function [A,b] = dep(A,tol,b);
%DEP Remove dependent rows from the sparse system Ax = b.
%
% [A,b] = DEP(A,tol,b) by repeatedly applying lu-factorization
% to A', where A has more cols
www.eeworm.com/read/304358/3799812
m preaug.m
% $Revision: 1.2 $
function[L,U,P,pcol] = preaug(H,pcf,A);
%PREAUG example preconditioner of augmented matrix
%
% [L,U,P,pcol] = PREAUG(H,pcf,A) computes a sparse
% factorization of the LU-facto
www.eeworm.com/read/417857/2098488
hits rocon.hits
> Q9YBD5^.^11^105^.^54894^Class 1^.^.^Fold 1^Superfamily 1^Family 1^SPARSE^61.50^0.000e+00^4.000e-10
VRKIRSGVVIDHIPPGRAFTMLKALGLLPPRGYRWRIAVVINAESSKLGRKDILKIEGYKPRQRDLEVLGIIAPGATFNVIEDYKVVEKVKLKLP
> Q
www.eeworm.com/read/417857/2098517
dhf rocon.dhf
> Q9YBD5^.^11^105^SCOP^.^54894^Class 1^.^.^Fold 1^Superfamily 1^Family 1^SPARSE^61.50^0.000e+00^4.000e-10
VRKIRSGVVIDHIPPGRAFTMLKALGLLPPRGYRWRIAVVINAESSKLGRKDILKIEGYKPRQRDLEVLGIIAPGATFNVIEDYKVVEKVKLKL
www.eeworm.com/read/258350/4355068
doc bigtable.doc
/*
$Id: qt/bigtable.doc 3.3.5 edited May 27 2003 $
*/
/*! \page bigtable-example.html
\ingroup table-examples
\title How to create a large, sparse QTable
This example shows a sp
www.eeworm.com/read/394381/8227774
m dep.m
function [A,b] = dep(A,tol,b);
%DEP Remove dependent rows from the sparse system Ax = b.
%
% [A,b] = DEP(A,tol,b) by repeatedly applying lu-factorization
% to A', where A has more cols
www.eeworm.com/read/294317/8240550
cpp smatrix.cpp
// test formula based sparse matrix class
#include
#include "smatrix.h"
void main(void)
{
SparseMatrix A(20), B(20), C(20);
cin >> A;
cout
www.eeworm.com/read/334860/12568212
m dep.m
function [A,b] = dep(A,tol,b);
%DEP Remove dependent rows from the sparse system Ax = b.
%
% [A,b] = DEP(A,tol,b) by repeatedly applying lu-factorization
% to A', where A has more cols