Search Results for "sparse"
Sort By:
Showing 40 open source projects for "sparse"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
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
A sparse matrix solver for electric power systems, based on the KLU library from University of Florida.
-
3
MLPACK is a C++ machine learning library with emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. * More info + downloads: https://mlpack.org * Git repo: https://github.com/mlpack/mlpack
-
4
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. -
Atera - an All-in-one platform for IT managementYour IT essentials, integrated & elevated. Take your IT management from automated to autonomous, download Atera's agent to start your free trial!
-
5
LaMa
LaMa - A Localization and Mapping library
LaMa is a C++11 software library for robotic localization and mapping developed at the Intelligent Robotics and Systems (IRIS) Laboratory at the University of Aveiro - Portugal. It includes a framework for 3D volumetric grids (for mapping), a localization algorithm based on scan matching, and two SLAM solutions (an Online SLAM and a Particle Filter SLAM). The main feature is efficiency. Low computational effort and low memory usage whenever possible. The minimum viable computer to run our... -
6
XIVO
X Inertial-aided Visual Odometry
...XIVO runs at 140FPS on stored data (here from a RealSense D435i sensor) or on live streams with a latency of around 1-7ms, depending on the hardware. It takes as input video frames from a calibrated camera and inertial measurements from an IMU and outputs a sparse point cloud with attribute features and 6 DOF pose of the camera. It performs auto-calibration of the relative pose between the camera and the IMU as well as the time-stamp alignment. -
7
A symbolic framework for C++, Python and Octave implementing automatic differentiation by source code transformation in forward and reverse modes on sparse matrix-valued computational graphs.
-
8
Polynomial System Solver
pss5 is a polynomial system solver, under development.
The objective of this project is to build a general-purpose polynomials system solver. While a few of those programs are available, this one will incorporate recent mathematical advances on mixed volume computations, sparse condition numbers and condition-metric homotopy. -
9
SparesPOP is a MATLAB implementation of a sparse semidefinite programming (SDP) relaxation method proposed for polynomial optimization problems (POPs). Please send a message to kojima-spop@is.titech.ac.jp if you have any question and/or request. We also release SparsePOPC++ and SparsePOPC++-windows. Both implementations are SparsePOP which does not use MATLAB, but only C++.
-
Compliant and Reliable File Transfers Backed by Top Security CertificationsStop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
-
10
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. -
11
DD-AVX ver.2
Library of High Precision Sparse Matrix Operations Accelerated by AVX
．．．．hogehoge -
12
MSU's Sparse Fourier Repository
The Home of DMSFT, AAFFT, GFFT, and MSFFT.
A collection of sparse Fourier transform codes developed by faculty at MSU. Currently codes for four different prototype sparse FFTs are here: 1.) DMSFT, implemented by Ruochuan Zhang. This is a fast, stable, noise robust, and *fully discrete* improvement on the ideas in GFFT below. It is THE BEST sparse FFT around!!! If you're looking for AAFFT, try this out first. 2.) -
13
WODA solver
A finite volume groundwater simulator
WODA (Well Outline and Design Aid) is a groundwater simulator developed at the Group for Numerical Analysis, Jaroslav Cerni Institute, Belgrade, Serbia. WODA does not have its own graphical user interface, but it can work with groundwater models constructed using the freely available Lizza interface, http://www.bioirc.ac.rs/index.php/groundwater-flow-software. -
14
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. -
15
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. -
16
Trowel - Sequencing Error Corrector
Error Correction Module for Illumina Sequencing Reads
...Jan. 2013 by Euncheon Lim in Prof. Dr. Detlef Weigel's Lab in Max-Planck Institute for Developmental Biology. First of all, you have to install the exact version of boost(>=1.53.0), google sparse hash(>=2.0.2), GCC(>=4.6), autoconf(=2.69), and automake(=1.13). -
17
Mumps Solver for Visual Studio
Visual studio C and C++ projects to build and use mumps sparse solver
Project consist of a WinForm to modify Mumps source files in order to compile and use them under the 64-bit or 32-bit windows environment and to create necessary VS 2010 projects/solution to compile the source code. On the code tab you can find the sample Mumps solver solution with 6 projects. Two projects are a mumps wrapper library - dynamic and static. And other four projects are testing projects - two are C++ (linking static or dynamic wrapper library) and two are C (again linking... -
18
LibMIA
Program using an extended Einstein notation with dense or sparse data.
This is currently a prelim version - most of lattice functionality has been completed, Dense multi-index array functionality is progressing well. -
19
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.
-
20
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. -
21
-
22
SL2
SL2 (= SLSL) - A Simple Linear Systems Library
SL2 is a C++ template library for solving systems of linear equations, providing the most common algorithms for dense and sparse systems. It uses OpenMP for parallelization and has no other dependencies. As the name suggests, SL2's implementation is staightforward with a focus on clear concepts, easy usage and understandable code. -
23
C++, Matlab and Python library for Hidden-state Conditional Random Fields. Implements 3 algorithms: LDCRF, HCRF and CRF. For Windows and Linux, 32- and 64-bits. Optimized for multi-threading. Works with sparse or dense input features.
-
24
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. -
25
KL1p
A portable C++ library for Compressed Sensing
KL1p is a portable C++ framework for handling sparse recovery of inverse problems of underdetermined linear systems, like in compressed sensing technique.
