Search Results for "sparse matrices"
Sort By:
Showing 13 open source projects for "sparse matrices"
View related business solutions-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
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:... -
2
BitMagic Library
Compressed bit-sets, sparse bit matrices and algorithms
BitMagic - C and C++ library implementing dynamic bitvectors and bit-set algorithms with several types of on-the-fly, adaptive compression. Designed for use in databases, search systems, data-mining algorithms, scientific projects. The core of the library is C++, but it provides C-compatibility wrappers and can be compiled without C++ runtime. Optimizations for Intel SSE2, SSE4.2 and AVX2. -
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. -
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.
-
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
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. ...
-
7
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. -
8
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. -
9
TifaMMy isn't the fastest Matrix Multiplication yet! A library for cache oblivious matrix operations using the space filling Peano curve. Aim is for BLAS / LAPACK functionality (but with an intuitive C++ API).
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
10
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,
-
11
I/O routines and tools for sparse matrices.
-
12
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.
-
13
femke
Finite Element Method Kernel Engine
...This project depends heavily on (not included): - OpenCASCADE (2D/3D modelling) - NetGen (2D/3D meshing) - NgSolve (assembling of system marices) - GetFEM++ (assembling of system marices) - OpenBLAS (Optimized Linear Algebra Routines) - SparseSuite (Solving sparse matrices) - MuParser (Expression interpreter)
- Previous
- You're on page 1
- Next
