Algorithms from circuit theory to predict connectivity in heterogeneous landscapes
-
Updated
Apr 3, 2024 - Julia
Algorithms from circuit theory to predict connectivity in heterogeneous landscapes
Algebraic Multigrid in Julia
Hierarchical solvers is an approximate sparse direct solver, written entirely in Julia.
Contains a wide-ranging collection of compressed sensing and feature selection algorithms. Examples include matching pursuit algorithms, forward and backward stepwise regression, sparse Bayesian learning, and basis pursuit.
Add a description, image, and links to the sparse-linear-systems topic page so that developers can more easily learn about it.
To associate your repository with the sparse-linear-systems topic, visit your repo's landing page and select "manage topics."