Proposals:Sparse Linear Solvers: Difference between revisions

From KitwarePublic
Jump to navigationJump to search
Line 89: Line 89:
** svn co http://icl.cs.utk.edu/svn/lapack-dev/lapack/trunk
** svn co http://icl.cs.utk.edu/svn/lapack-dev/lapack/trunk
** svn co http://icl.cs.utk.edu/svn/scalapack-dev
** svn co http://icl.cs.utk.edu/svn/scalapack-dev
** svn co https://icl.cs.utk.edu/svn/lapack-dev/lapack/trunk lapack                                                                                                      
** svn co https://icl.cs.utk.edu/svn/lapack-dev/lapack/trunk lapack
 
* Dashboard: http://my.cdash.org/index.php?project=LAPACK


== clapack ==
== clapack ==

Revision as of 23:23, 9 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 CMakeified
SuiteSparse LGPL Unknown Unknown
TAUCS MIT C Unknown Unknown
SuperLU BSD Unknown Unknown
Eigen LGPL C++ Unknown Unknown
Boost Numeric Bindings Unknown Unknown
ARPACK++ C++ Unknown Unknown
MUMPS Public Domain 11 Mb Unknown Unknown
lapack BSD 86 Mb Fortran ?? Unknown Yes
clapack BSD 22 Mb ?? C 80% Unknown Yes
PLASMA BSD 13 Mb C + FORTRAN Yes

SuiteSparse

TAUCS

SuperLU

Eigen

MUMPS

Boost Numeric Bindings

ARPACK++

lapack

clapack

PLASMA