Skip to content
A concise library for solving sparse linear systems with direct methods.
Branch: master
Clone or download
Latest commit 6777851 Apr 29, 2019
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
CSparse.Tests Remove UTF-8 BOM from source files. Apr 29, 2019
CSparse Bump version. Apr 29, 2019
.gitignore Update .gitignore. Mar 1, 2018
CSparse.sln Convert to project net standard. Apr 29, 2019
LICENSE Initial commit Jun 8, 2015
README.md Update README.md Apr 29, 2019

README.md

CSparse.NET

A concise library for solving sparse linear systems with direct methods. The code is a C# port of CSparse, written by Tim Davis and part of the SuiteSparse project.

Build status Nuget downloads

Features

  • Sparse LU, Cholesky and QR decomposition of real and complex systems
  • Fill-reducing orderings
  • Dulmage-Mendelsohn decomposition

All methods are described in detail in the excellent textbook Direct Methods for Sparse Linear Systems, SIAM, Philadelphia, PA, 2006 by Tim Davis.

Examples

License

CSparse: a Concise Sparse Matrix package.

Copyright (c) 2006-2017, Timothy A. Davis.

This library is free software; you can redistribute it and/or modify it under the
terms of the GNU Lesser General Public License as published by the Free Software
the Free Software Foundation; either version 2.1 of the License, or (at your option)
any later version.

This library is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
PARTICULAR PURPOSE.  See the GNU Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public License along
with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin
Street, Fifth Floor, Boston, MA  02110-1301 USA
You can’t perform that action at this time.