• Home
  • History
  • Annotate
Name Date Size #Lines LOC

..03-May-2022-

R/H17-Feb-2021-2,0501,838

build/H03-May-2022-

data/H03-May-2022-

demo/H09-Nov-2018-146127

inst/H18-Feb-2021-10,69010,477

man/H18-Feb-2021-1,3851,303

src/H18-Feb-2021-9,3624,013

vignettes/H18-Feb-2021-377326

.RinstignoreH A D18-Mar-201213 21

DESCRIPTIONH A D18-Feb-20211.1 KiB2827

INDEXH A D06-Apr-20111.2 KiB2726

MD5H A D18-Feb-20212.9 KiB5857

NAMESPACEH A D17-Feb-20212.3 KiB6756

READMEH A D13-Mar-2012792 1712

README

1
2Versions of SparseM prior to 0.95 included a LICENSE file that described
3some uncertainties over the licensing status of the fortran
4code in src/cholesky.f.  As of 9 March 2012, original authors of cholesky.f,
5Esmond Ng and Barry Peyton,  have now, very kindly,  given permission to
6use cholesky.f under an open source license.  They have requested that
7their code be credited via the following two publications:
8
9   Esmond G. Ng and Barry W. Peyton, "Block sparse Cholesky algorithms
10   on advanced uniprocessor computers". SIAM J. Sci. Stat. Comput.
11   14  (1993), pp. 1034-1056.
12
13   John R. Gilbert, Esmond G. Ng, and Barry W. Peyton, "An efficient
14   algorithm to compute row and column counts for sparse Cholesky
15   factorization". SIAM J. Matrix Anal. Appl. 15 (1994), pp. 1075-1091.
16
17