summaryrefslogtreecommitdiff
path: root/academic
diff options
context:
space:
mode:
authorB. Watson <yalhcru@gmail.com>2020-10-12 15:08:37 -0400
committerWilly Sudiarto Raharjo <willysr@slackbuilds.org>2020-10-17 09:37:34 +0700
commit09580bf3627122e349f4933c73d714257427f5ed (patch)
tree2cdc3e073d3ce4e97bb2680f20fa9d5b517148bc /academic
parenta4398d10d22b1f78e1f659e29b1971c71c00c94f (diff)
downloadslackbuilds-09580bf3627122e349f4933c73d714257427f5ed.tar.gz
academic/ldl: Fix README.
Signed-off-by: B. Watson <yalhcru@gmail.com> Signed-off-by: Willy Sudiarto Raharjo <willysr@slackbuilds.org>
Diffstat (limited to 'academic')
-rw-r--r--academic/ldl/README13
1 files changed, 7 insertions, 6 deletions
diff --git a/academic/ldl/README b/academic/ldl/README
index b3628fc188..ce58f1983d 100644
--- a/academic/ldl/README
+++ b/academic/ldl/README
@@ -1,11 +1,12 @@
LDL is a set of concise routines for factorizing symmetric
positive-definite sparse matrices, with some applicability to symmetric
-indefinite matrices. Its primary purpose is to illustrate much of the
-basic theory of sparse matrix algorithms in as concise a code as possible,
-including an elegant new method of sparse symmetric factorization that
-computes the factorization row-by-row but stores it column-by-column.
+indefinite matrices. Its primary purpose is to illustrate much of
+the basic theory of sparse matrix algorithms in as concise a code
+as possible, including an elegant new method of sparse symmetric
+factorization that computes the factorization row-by-row but stores it
+column-by-column.
This package is part of SuiteSparse.
-AMD is an optional dependency and will be used if found.
-It is primarily used for this package's test suite.
+AMD is an optional dependency and will be used if found. It is
+primarily used for this package's test suite.