Skip to content
❗️ This is a read-only mirror of the CRAN R package repository. quantreg — Quantile Regression. Homepage: https://www.r-project.org
Fortran R C
Branch: master
Clone or download
Roger Koenker and cran-robot version 5.51
Latest commit 595fc29 Aug 7, 2019
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
R version 5.41 Jun 28, 2019
build version 5.51 Aug 7, 2019
data version 5.18 Aug 16, 2015
demo version 5.35 Feb 2, 2018
inst version 5.51 Aug 7, 2019
man version 5.51 Aug 7, 2019
src version 5.51 Aug 7, 2019
tests version 5.35 Feb 2, 2018
vignettes version 5.42 Jul 15, 2019
.Rinstignore version 4.78 Mar 22, 2012
DESCRIPTION version 5.51 Aug 7, 2019
MD5 version 5.51 Aug 7, 2019
NAMESPACE version 5.41 Jun 28, 2019
README version 4.77 Mar 14, 2012

README

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.

You can’t perform that action at this time.