Difference between revisions of "Proposals:Sparse Linear Solvers"

From KitwarePublic
Jump to navigationJump to search
Line 23: Line 23:
! Name !! License !! Size !! Support Sparse !! Language !! Coverage || Valgrind ||
! Name !! License !! Size !! Support Sparse !! Language !! Coverage || Valgrind ||
|-
|-
| [http://www.cise.ufl.edu/research/sparse/SuiteSparse SuiteSparse] || LGPL ||  ||    ||   ||
| [http://www.cise.ufl.edu/research/sparse/SuiteSparse SuiteSparse] || LGPL ||  ||    || || Unknown ||  Unknown ||
|-
|-
| [http://code.google.com/p/taucs/ TAUCS] || MIT ||  ||    || C  ||
| [http://code.google.com/p/taucs/ TAUCS] || MIT ||  ||    || C  ||

Revision as of 13:48, 3 February 2010

The Problem

ITK requires functionalities for solving large sparse linear systems.

The current solution obtained though VXL must be replaced because it relies internally on code whose Copyright is held by ACM, and is subject to a license that precludes commercial use.

Previous Review

Tom Vercauteren previously gathered the following list of options.

ITK_Release_4.0#3rd_Party_Libraries


Options

Comparative Table

Name License Size Support Sparse Language Coverage Valgrind
SuiteSparse LGPL Unknown Unknown
TAUCS MIT C
SuperLU BSD
Eigen LGPL C++
Boost Numeric Bindings
ARPACK++ C++
MUMPS
clapack BSD 22 Mb ?? C 80% ??

SuiteSparse

TAUCS

SuperLU

Eigen

MUMPS

Boost Numeric Bindings

ARPACK++

clapack