Search Results for "sparse matrices"
Sort By:
16 projects for "sparse matrices" with 2 filters applied:
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Streamline Azure Security with Palo Alto Networks VM-SeriesImprove your security posture and reduce incident response time. Use the VM-Series to natively analyze Azure traffic and dynamically drive policy updates based on workload changes.
-
1
librsb
A shared memory parallel sparse matrix library including Sparse BLAS.
librsb is a library for sparse matrix computations featuring the Recursive Sparse Blocks (RSB) matrix format. This format allows cache efficient and multi-threaded (that is, shared memory parallel) operations on large sparse matrices. The most common operations necessary to iterative solvers are available, e.g.: matrix-vector multiplication, triangular solution, rows/columns scaling, diagonal extraction / setting, blocks extraction, norm computation, formats conversion. ... -
2
Armadillo
fast C++ library for linear algebra & scientific computing
* Fast C++ library for linear algebra (matrix maths) and scientific computing * Easy to use functions and syntax, deliberately similar to Matlab / Octave * Uses template meta-programming techniques to increase efficiency * Provides user-friendly wrappers for OpenBLAS, Intel MKL, LAPACK, ATLAS, ARPACK, SuperLU and FFTW libraries * Useful for machine learning, pattern recognition, signal processing, bioinformatics, statistics, finance, etc. * Downloads:... -
3
SLAM++
high-performance nonlinear least squares solver for graph problems
SLAM++ is a minimalist implementation of incremental nonlinear least squares, containing lighting fast implementation of linear algebra on sparse block matrices. It is aimed for use in 3D reconstruction or robotics. -
4
ViennaCL
Linear algebra and solver library using CUDA, OpenCL, and OpenMP
ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects. -
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
5
LightSpMV
lightweight GPU-based sparse matrix-vector multiplication (SpMV)
LightSpMV is a novel CUDA-compatible sparse matrix-vector multiplication (SpMv) algorithm using the standard compressed sparse row (CSR) storage format. We have evaluated LightSpMV using various sparse matrices and further compared it to the CSR-based SpMV subprograms in the state-of-the-art CUSP and cuSPARSE. Performance evaluation reveals that on a single Tesla K40c GPU, LightSpMV is superior to both CUSP and cuSPARSE, with a speedup of up to 2.60 and 2.63 over CUSP, and up to 1.93 and 1.79 over cuSPARSE for single and double precision, respectively. -
6
Universal Java Matrix Package
sparse and dense matrix, linear algebra, visualization, big data
...Multi-dimensional matrices as well as generic matrices with a specified object type are supported and very large matrices can be handled even when they do not fit into memory. -
7
The library for utilization of Minimal Quadtree format for storing very large sparse matrices. Please see the paper referenced below for the description of a problem. Corresponding papers: Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices (I. Šimeček, D. Langr, P. Tvrdík), In Scalable Computing: Practice and Experience, volume 15, 2014. Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures (I. ...
-
8
ViennaCLBench
OpenCL linear algebra benchmark GUI for CPUs, GPUs, and MIC
ViennaCLBench provides a graphical user interface for collecting benchmark data for common OpenCL-accelerated linear algebra operations as implemented in the linear algebra library ViennaCL. -
9
Block Matrix library
Highly efficient implementation of BLAS for sparse block matrices.
Highly efficient implementation of BLAS for sparse block matrices. Accelerated using heavy-duty C++ meta-programming, SIMD instructions and GPU. -
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
10
The Meta Matrix Library is a modular designed collection of C libraries. It was developed to provide easy and consistent access to numerical linear algebra software for sparse and dense matrices.
-
11
Seldon is a C++ library for linear algebra. It provides vectors and matrices: full, sparse, triangular, hermitian, ... It includes interfaces to Blas, Lapack, Mumps, SuperLU and UmfPack. Seldon implements several solvers such as Gmres, BiCgSTAB, Qmr,
-
12
The Lidy project is a small cross-platform library under LPGL licence, written in C language. It has been designed in order to facilitate the sparse matrices handling.
-
13
I/O routines and tools for sparse matrices.
-
14
uBLAS is a C++ template class library that provides BLAS level 1, 2, 3 functionality for dense, packed and sparse matrices and many numerical algorithms for linear algebra.
-
15
Sparse is a direct method solver for the large sparse matrices that are associated with electrical circuit simulation. It uses LU factorization and handles both real and complex square matrices.It is intended to solve many matrices with the same structure
-
16
MatGen is a matrix generator. It outputs matrices in MatrixMarket file format, taking as input a file describing the matrices´ properties. Currently it supports only random sparse matrices.
- Previous
- You're on page 1
- Next
