File: README

package info (click to toggle)
r-cran-quantreg 5.38-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster
  • size: 3,080 kB
  • sloc: fortran: 7,125; makefile: 2
file content (25 lines) | stat: -rw-r--r-- 1,188 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
Versions of quantreg between 3.70 and 4.75 were removed from the CRAN
archive due to uncertainties over the licensing status of the fortran
code in src/cholesky.f.  As of 9 March 2012, original authors of cholesky.f,  
Esmond Ng and Barry Peyton,  have now, very kindly,  given permission to 
use cholesky.f under an open source license.  They have requested that 
their code be credited via the following two publications:

   Esmond G. Ng and Barry W. Peyton, "Block sparse Cholesky algorithms
   on advanced uniprocessor computers". SIAM J. Sci. Stat. Comput.
   14  (1993), pp. 1034-1056.

   John R. Gilbert, Esmond G. Ng, and Barry W. Peyton, "An efficient
   algorithm to compute row and column counts for sparse Cholesky
   factorization". SIAM J. Matrix Anal. Appl. 15 (1994), pp. 1075-1091.

Use of the sparse Cholesky code in cholesky.f in quantreg is limited  to calls
to rqss() or to rq with method = "sfn".  

In the event that readers wish to access the intermediate versions of quantreg
that have been removed from CRAN, they will be available at:

	http://www.econ.uiuc.edu/~roger/research/rq/quantreg

Current versions are best accessed from CRAN and its many mirrors.