COLLECTED BY
Organization:
Internet Archive
Focused crawls are collections of frequently-updated webcrawl data from narrow (as opposed to broad or wide) web crawls, often focused on a single domain or subdomain.
The Wayback Machine - https://web.archive.org/web/20200722104548/https://github.com/topics/sparse-linear-systems
Here are
38 public repositories
matching this topic...
Updated
Jul 20, 2020
OCaml
C++ library for solving large sparse linear systems with algebraic multigrid method
sparse linear algebra library for rust
Updated
Jul 20, 2020
Rust
Numerical linear algebra software package
Sparse matrix formats for linear algebra supporting scientific and machine learning applications
Numerical computation in native Haskell
Updated
Sep 28, 2019
Haskell
sparse matrix pre-processing library
Structured Matrix Package (LBNL)
Algebraic Multigrid in Julia
Updated
Jun 11, 2020
Julia
A free LDL factorisation routine
Algorithms from circuit theory to predict connectivity in heterogeneous landscapes
Updated
Jun 24, 2020
Julia
SuiteSparse: a suite of sparse matrix packages by T. A. Davis et al. (This repository contains copies of the official versions.)
Fortran wrapper for AMGCL with OpenMP/OpenCL support
Best Subset Selection algorithm for Regression, Classification, Count, Survival analysis
Scalable sparse Bayesian learning for large CS recovery problems
Updated
May 18, 2019
MATLAB
A library for encoding and decoding sparse network codes
best CPU/GPU sparse solver for large sparse matrices
PyRSB: a Python interface to the librsb Sparse Matrix library
Updated
May 30, 2020
Python
NASOQ:Numerically Accurate Sparsity Oriented QP Solver
Algebraic Multigrid (AMG) Solver Library
Matrix Pencil Sparse Fourier Transform
Updated
Sep 3, 2017
Jupyter Notebook
Golang implementation of lis
Python bindings for the MUMPS package MUMPS: a parallel sparse direct solver
Updated
Nov 14, 2017
Python
A sparse KLU solver for PyTorch.
Updated
Jun 29, 2020
Python
A neural network implementation that predicts what the solution to a sparse matrix equation will be. The prediction is then fed into a solver (using methods such as Gauss-Seidel, Jacobi, etc.) as the initial guess solution vector. The initial guess is close to the solution and therefore the amount of iterations required for convergence is reduced.
Updated
Jul 10, 2018
Python
ITerative SOLvers package
SuiteSparse - Owl Interface
A complete example of batched refactorization in cuSOLVER.
Python wrapper for the sparse QR decomposition in SuiteSparseQR.
Updated
Aug 31, 2017
Python
Improve this page
Add a description, image, and links to the
sparse-linear-systems
topic page so that developers can more easily learn about it.
Curate this topic
Add this topic to your repo
To associate your repository with the
sparse-linear-systems
topic, visit your repo's landing page and select "manage topics."
Learn more
You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session.
You signed out in another tab or window. Reload to refresh your session.