代码搜索：sparse
找到约 3,324 项符合「sparse」的源代码
代码结果 3,324
www.eeworm.com/read/219695/14869434
cc sparse_mult.cc
#include "mtl/matrix.h"
#include "mtl/mtl.h"
#include "mtl/utils.h"
int random(int range) {
return rand() % (range -1) + 1;
}
int
main(int argc, char* argv[])
{
if (argc < 2) {
std::cerr
www.eeworm.com/read/219695/14869447
cc sparse_copy.cc
#include "mtl/matrix.h"
#include "mtl/mtl.h"
#include "mtl/utils.h"
/*
Sample Out:
A
10x10
[
[0,0,2,0,4,0,6,0,8,0],
[10,0,12,0,14,0,16,0,18,0],
[20,0,22,0,24,0,26,0,28,0],
[30,0,32,0,34,0,36,0,38,0
www.eeworm.com/read/219695/14869617
h sparse_iterator.h
// -*- c++ -*-
//
// Copyright 1997, 1998, 1999 University of Notre Dame.
// Authors: Andrew Lumsdaine, Jeremy G. Siek, Lie-Quan Lee
//
// This file is part of the Matrix Template Library
//
// You sh
www.eeworm.com/read/218623/14911980
data sparse_example.data
188_1+1,MUSK-188,1,1:42,2:-198,3:-109,4:-75,5:-117,6:11,7:23,8:-88,9:-28,10:-27,11:-232,12:-212,13:-66,14:-286,15:-287,16:-300,17:-57,18:-75,19:-192,20:-184,21:-66,22:-18,23:-50,24:111,25:110,26:18,27
www.eeworm.com/read/116163/14986572
java sparse1.java
/* 定义一个三元组表及其一些相关的方法
*/
public class Sparse1 extends SparseNode
{
//用一个三元表的数组记录稀疏矩阵
protected SparseNode table[];
//创建一个矩阵的三元组表形式，并同时输出该矩阵
public Sparse1(int mat[][])
{
www.eeworm.com/read/216463/15005979
html sparse-lu.html
Sparse LU Decomposition Methods
Sparse LU Decomposition Methods
The sparse modulo-2 matrix LU decomposition routine
www.eeworm.com/read/216463/15006002
pdf sparse-encode.pdf
www.eeworm.com/read/215241/15066436
cpp sparse_2.cpp
//=================================================================
// =
// 大型稀疏线性方程组的求解 A*X=b =
//
www.eeworm.com/read/212602/15152108
bmp mat_sparse.bmp
www.eeworm.com/read/207046/15283494
m y_sparse.m
function [Y,nSW,nPV,nPQ,SB] = y_sparse(bus,line)
% Syntax: [Y,nSW,nPV,nPQ,SB] = y_sparse(bus,line)
%
% Purpose: build sparse admittance matrix Y from the line data
%
% Input: bus -