Search Results for "sparse"
Sort By:
Showing 44 open source projects for "sparse"
View related business solutions-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
1
SuiteSparseGraphBLAS.jl
Sparse, General Linear Algebra for Graphs
A fast, general sparse linear algebra and graph computation package, based on SuiteSparse:GraphBLAS. -
2
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. ... -
3
-
4
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:... -
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
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
-
6
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.
-
7
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. -
8
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++.
-
9
DD-AVX ver.2
Library of High Precision Sparse Matrix Operations Accelerated by AVX
．．．．hogehoge -
Auth0 B2B Essentials: SSO, MFA, and RBAC Built InAuth0's B2B Essentials plan gives you everything you need to ship secure multi-tenant apps. Unlimited orgs, enterprise SSO, RBAC, audit log streaming, and higher auth and API limits included. Add on M2M tokens, enterprise MFA, or additional SSO connections as you scale.
-
10
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.) -
11
riboshape
Predicting ribosome footprint profile shapes from transcript sequences
Riboshape is a suite of algorithms to predict ribosome footprint profile shapes from transcript sequences. It applies kernel smoothing to codon sequences to build predictive features, and uses these features to builds a sparse regression model to predict the ribosome footprint profile shapes. Reference: Liu, T.-Y. and Song, Y.S. Prediction of ribosome footprint profile shapes from transcript sequences. Proceedings of ISMB 2016, Bioinformatics, Vol. 32 No. 12 (2016) i183-i191. -
12
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. -
13
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. -
14
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... -
15
Universal Java Matrix Package
sparse and dense matrix, linear algebra, visualization, big data
The Universal Java Matrix Package (UJMP) is an open source Java library which provides sparse and dense matrix classes, as well as a large number of calculations for linear algebra such as matrix multiplication or matrix inverse. Operations such as mean, correlation, standard deviation, replacement of missing values or the calculation of mutual information are supported, too. The Universal Java Matrix Package provides various visualization methods, import and export filters for a large number of file formats, and even the possibility to link to JDBC databases. ... -
16
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. -
17
Immutable Sparse Wave Trees (WaveTree)
Realtime bigdata tool for bit strings up to 2^63 based on AVL forest
...All those operations can be done millions of times per second regardless of size because the AVL forest reuses existing branches recursively. Theres a scalar (originally for copy/pasting subranges of sounds) and a bit Java package. Sparse n dimensional matrix. -
18
LRPR
Low Rank Page Rank: A matlab project in sparse matrix computation
The problem of Pagerank is a simple one to state: Given a collection of websites, how do we rank them? The primary way of formulating this utilizes a transition matrix which relates how web pages interact with each other. We investigate what the effect of a low rank approximation for the transition matrix has on the power method and an inner-outer iteration for solving the Pagerank problem. The purpose of the low rank approximation is two fold: (1) to reduce memory requirements (2) to... -
19
-
20
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. -
21
Colt provides a set of Open Source Libraries for High Performance Scientific and Technical Computing in Java http://acs.lbl.gov/~hoschek/colt/ This project starteda as a port of the Colt core library to C#, but contains additional features.
-
22
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. -
23
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. -
24
ANGEL-Automatic differentiation Nested Graph Elimination Library is a template library using the Boost Graph Library and the Standard C++ Library; it provides sparse representations of c-graphs their dual line graphs and vertex, edge and face elimina
-
25
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.
