Fast non-allocating calculations of gradients, Jacobians, and Hessians with sparsity support

Sparse tensors in Julia and more! Datastructure-driven array programing language.

Calling the PARDISO library from Julia

Make available to Julia the sparse functionality in MKL

Direct solution of large sparse systems of linear algebraic equations in pure Julia

A Julia package for n-dimensional sparse tensors.

Coloring algorithms for sparse Jacobian and Hessian matrices

Julia interface for ColPack

Julia interface with MUMPS sparse parallel direct solver

Distributed Sparse Matrix Factorizations

The need to determine pseudoperipheral vertices arises from several graph-theoretical approaches for ordering sparse matrix equations. This package implements George-Liu algorithm for finding a pseudoperipheral vertex in a graph aiming at returning a vertex having a large eccentricity.

Simple arbitrary dimension sparse arrays

Sparse Distance Matrices

GraphOrdering.jl is a package focused on a problem of renumbering vertices of a graph such a way that the bandwidth of the sparse matrix is minimized. In other words: find a permutation of system of equations which minimized the fill-in of sparse matrix during matrix factorization. The functionality of the package corresponds to the symrcm funct…