• Aztec

  • Referenced in 84 articles [sw12817]
  • efficiently. If the input matrix is suitably partitioned, the efficiency can be further enhanced ... within domains). Aztec supports two different sparse matrix notations: a) a point-entry modified sparse...
  • ViennaCL

  • Referenced in 21 articles [sw06444]
  • ViennaCL library, we investigate a partitioning approach for one of the standard benchmark problems ... namely the dense matrix-matrix product. We apply this partitioning approach to problems exceeding...
  • GEMM

  • Referenced in 30 articles [sw02792]
  • general matrix multiply and add operation. With suitable partitioning, all the other level 3 BLAS...
  • cl1ck

  • Referenced in 3 articles [sw09879]
  • Knowledge-based automatic generation of partitioned matrix expressions. ... In this paper we focus ... process, the automatic generation of Partitioned Matrix Expressions. In particular, we discuss the steps leading...
  • yaSpMV

  • Referenced in 7 articles [sw17482]
  • further improve this format by partitioning the matrix into vertical slices to enhance the cache...
  • MC73

  • Referenced in 7 articles [sw12394]
  • applications in areas that include matrix reordering, graph partitioning, protein analysis, data mining, machine learning...
  • hapod

  • Referenced in 12 articles [sw40605]
  • singular values of a matrix) hierarchically for (column-wise partitioned) large-scale matrices, allowing...
  • DSJM

  • Referenced in 6 articles [sw12532]
  • DSJM implements a greedy partitioning algorithm after the sparse matrix has been preprocessed with ordering ... their efficient implementation for sparse Jacobian matrix determination, Disc. Appl. Math ... that DSJM consistently produced better timing and partitions compared with similar software...
  • SCASY

  • Referenced in 12 articles [sw03251]
  • ways of introducing blocking for solving matrix equations in reduced (quasi-triangular) form are reviewed ... common is to perform a fix block partitioning of the matrices involved and rearrange ... that the computations are performed on submatrices (matrix blocks). Another successful approach is to combine...
  • Isorropia

  • Referenced in 13 articles [sw10746]
  • allow for more efficient computations. Isorropia partitions matrices by rows, and produces good maps ... graphs). Isorropia should be called after the matrix (graph) is filled, so the sparsity pattern...
  • LILIX

  • Referenced in 13 articles [sw00520]
  • partition. Subroutine RENORM helps conserving the linear independence of various vectors in the solution matrix...
  • RNAfold

  • Referenced in 5 articles [sw10505]
  • also computes the partition function (pf) and base pairing probability matrix, and prints the free...
  • recsy

  • Referenced in 7 articles [sw04139]
  • ways of introducing blocking for solving matrix equations in reduced (quasi-triangular) form are reviewed ... common is to perform a fix block partitioning of the matrices involved and rearrange ... that the computations are performed on submatrices (matrix blocks). Another successful approach is to combine...
  • WGPP

  • Referenced in 1 article [sw33236]
  • WGPP: Watson Graph Partitioning (and Sparse Matrix Ordering) Package...
  • LCE

  • Referenced in 5 articles [sw25277]
  • this problem by automatically combining multiple data partitions from different clusterings to improve both ... many existing ensemble techniques use an association matrix to summarize sample-cluster co-occurrence statistics...
  • pdist

  • Referenced in 1 article [sw14591]
  • pdist: Partitioned Distance Function. Computes the euclidean distance between rows of a matrix...
  • PoLAPACK

  • Referenced in 1 article [sw01596]
  • implemented with block-partitioned algorithms in order to perform matrix-matrix operations, that...
  • Mongoose

  • Referenced in 1 article [sw35947]
  • Mongoose, a graph coarsening and partitioning library. Partitioning graphs is a common and useful operation ... sparse matrix algorithms. In this article, we introduce Mongoose, a multilevel hybrid graph partitioning algorithm...
  • SA-cluster

  • Referenced in 9 articles [sw06867]
  • goal of graph clustering is to partition vertices in a large graph into clusters based ... unified distance measure. SA-Cluster performs matrix multiplication to calculate the random walk distances between...
  • ASKIT

  • Referenced in 11 articles [sw17470]
  • factoring off-diagonal blocks of the kernel matrix using approximate nearest neighbor information. In this ... adaptively selecting approximation ranks and correctly partition the nearest neighbor information, both of which improve...