search for: pcauchy

...h.Rout' to './method-dispatch.Rout.save' ... OK running code in 'd-p-q-r-tests.R' ...*** Error code 1 Stop in /usr/local/src/R-2.1.1/tests. *** Error code 1 Here is the tail of d-p-q-r-tests.Rout.fail: > ## for PR#7902: > ex <- -c(rev(1/x), ex) > All.eq(-x, qcauchy(pcauchy(-x))) [1] TRUE > All.eq(+x, qcauchy(pcauchy(+x, log=TRUE), log=TRUE)) [1] TRUE > All.eq(1/x, pcauchy(qcauchy(1/x))) [1] TRUE > All.eq(ex, pcauchy(qcauchy(ex, log=TRUE), log=TRUE)) [1] "`is.NA' value mismatches: 1 in current, 0 in target" Warning message: NaNs produced in: q...

Full_Name: Morten Welinder Version: 2.1.0 OS: src only Submission from: (NULL) (216.223.241.212) Now that pcauchy has been fixed, it is becoming clear that qcauchy suffers from the same problems. qcauchy(pcauchy(1e100,0,1,FALSE,TRUE),0,1,FALSE,TRUE) should yield 1e100 back, but I get 1.633178e+16. The code below does much better. Notes: 1. p need not be finite. -Inf is ok in the log_p case and R_Q_P0...

Full_Name: Morten Welinder Version: snapshot OS: Submission from: (NULL) (65.213.85.129) Two things are wrong. 1. There is nan test outside IEEE_754. 2. The meat part of the function should really be something like... if (!lower_tail) x = -x; if (fabs (x) > 1) { double temp = atan (1 / x) / M_PI; return (x > 0) ? R_D_Clog (temp) : R_D_val (-temp); } else

...dbinom.o dcauchy.o dchisq.o dexp.o df.o dgamma.o dgeom.o dhyper.o dlnorm.o dlogis.o dnbeta.o dnbinom.o dnchisq.o dnf.o dnorm.o dnt.o dpois.o dt.o dunif.o dweibull.o fmax2.o fmin2.o ftrunc.o gamma.o gamma_cody.o i1mach.o imax2.o imin2.o lbeta.o lgamma.o lgammacor.o mlutils.o pbeta.o pbinom.o pcauchy.o pchisq.o pexp.o pf.o pgamma.o pgeom.o phyper.o plnorm.o plogis.o pnbeta.o pnbinom.o pnchisq.o pnf.o pnmath.o pnorm.o pnt.o polygamma.o ppois.o pt.o ptukey.o punif.o pweibull.o qbeta.o qbinom.o qcauchy.o qchisq.o qexp.o qf.o qgamma.o qgeom.o qhyper.o qlnorm.o qlogis.o qnbeta.o qnbinom.o qn...

...es against the given distribution. That is: ##### BEGIN CODE SNIP ##### # Covert a distribution name to the related CDF function name distname2cdfname <- function( dist ) { if ( dist == "beta" ) { return( "pbeta" ); } if ( dist == "cauchy" ) { return( "pcauchy" ); } # many other and personalized (e.g. pareto, ...) distributions ... return( "" ); # fall-back case } # Performs some GoF tests (KS, Chi-Square, Anderson-Darling,...) # (the "..." list contains parameters for CDF function) goftests <- function( x, dist, ......

...te code is required for the tw= o=20 tails of the distributions to get round the problem. The fix for PR#8251 is a kludge and just moves the inaccuracies to examples= =20 with higher non-centrality parameters. pt(x,1) will overflow or return 0 for values < -2e154 for 64-bit=20 implementations. pcauchy works but I believe the pt function is also suppos= ed to work for=20 non integral degrees of freedom so making it work one degree of freedom via= =20 pcauchy is hardly much use. qnbinom(1e-10,1e3,1e-7,TRUE,FALSE) is slow and by varying the parameters,= =20 qnbinom can be made very slow indeed. I...

...o rgamma.o dbeta.o pbeta.o qbeta.o rbeta.o dunif.o punif.o qunif.o runif.o dnorm.o pnorm.o qnorm.o rnorm.o dlnorm.o plnorm.o qlnorm.o rlnorm.o df.o pf.o qf.o rf.o dnf.o dt.o pt.o qt.o rt.o dnt.o dchisq.o pchisq.o qchisq.o rchisq.o rnchisq.o dbinom.o pbinom.o qbinom.o rbinom.o rmultinom.o dcauchy.o pcauchy.o qcauchy.o rcauchy.o dexp.o pexp.o qexp.o rexp.o dgeom.o pgeom.o qgeom.o rgeom.o dhyper.o phyper.o qhyper.o rhyper.o dnbinom.o pnbinom.o qnbinom.o rnbinom.o dpois.o ppois.o qpois.o rpois.o dweibull.o pweibull.o qweibull.o rweibull.o dlogis.o plogis.o qlogis.o rlogis.o dnchisq.o pnchisq.o qnchis...

...inappropriate (and often fails) for variance function "mu(1-mu)". Here is a short demo to show it: ################################################# set.seed(666) dat <- data.frame(x = rep((-10):10, each = 5), w = rep(1:5, 21)) dat <- transform(dat, y = rbinom(x, size = w, prob = pcauchy(1 + 2*x))) modFit <- glm(y/w ~ x, quasi(link = cauchit, variance = "mu(1-mu)"), dat, weights = w, trace = T) Deviance = 309.2785 Iterations - 1 Deviance = 3257.501 Iterations - 2 Deviance = 1043.455 Iterations - 3 .. Deviance = 1733.824 Iterations - 24 Deviance = 16...

...<- function(mu) qcauchy(mu) linkinv <- function(eta) { thresh <- -qcauchy(.Machine$double.eps) - eta <- pmin(thresh, pmax(eta, -thresh)) + eta <- pmin(pmax(eta, -thresh), thresh) pcauchy(eta) } mu.eta <- function(eta) @@ -73,11 +73,11 @@ "cloglog" = { linkfun <- function(mu) log(-log(1 - mu)) linkinv <- function(eta) - pmax(.Machine$double.eps, -...

...cc -g -I../include -c rbeta.c -o rbeta.o gcc -g -I../include -c dbinom.c -o dbinom.o gcc -g -I../include -c pbinom.c -o pbinom.o gcc -g -I../include -c qbinom.c -o qbinom.o gcc -g -I../include -c rbinom.c -o rbinom.o gcc -g -I../include -c dcauchy.c -o dcauchy.o gcc -g -I../include -c pcauchy.c -o pcauchy.o gcc -g -I../include -c qcauchy.c -o qcauchy.o gcc -g -I../include -c rcauchy.c -o rcauchy.o gcc -g -I../include -c dchisq.c -o dchisq.o gcc -g -I../include -c pchisq.c -o pchisq.o gcc -g -I../include -c qchisq.c -o qchisq.o gcc -g -I../include -c rchisq.c -o rchisq.o gcc...

...ct -g -I../include -I../../src/include -c qbinom.c -o qbinom.o gcc -ieee_with_inexact -g -I../include -I../../src/include -c rbinom.c -o rbinom.o gcc -ieee_with_inexact -g -I../include -I../../src/include -c dcauchy.c -o dcauchy.o gcc -ieee_with_inexact -g -I../include -I../../src/include -c pcauchy.c -o pcauchy.o gcc -ieee_with_inexact -g -I../include -I../../src/include -c qcauchy.c -o qcauchy.o gcc -ieee_with_inexact -g -I../include -I../../src/include -c rcauchy.c -o rcauchy.o gcc -ieee_with_inexact -g -I../include -I../../src/include -c dexp.c -o dexp.o gcc -ieee_with_inexact -g -I....

...lude -c dbinom.c cc -ieee_with_inexact -g -I../../src/include -c pbinom.c cc -ieee_with_inexact -g -I../../src/include -c qbinom.c cc -ieee_with_inexact -g -I../../src/include -c rbinom.c cc -ieee_with_inexact -g -I../../src/include -c dcauchy.c cc -ieee_with_inexact -g -I../../src/include -c pcauchy.c cc -ieee_with_inexact -g -I../../src/include -c qcauchy.c cc -ieee_with_inexact -g -I../../src/include -c rcauchy.c cc -ieee_with_inexact -g -I../../src/include -c dexp.c cc -ieee_with_inexact -g -I../../src/include -c pexp.c cc -ieee_with_inexact -g -I../../src/include -c qexp.c cc -ieee_wi...

...nclude -I../../src/include -c qbinom.c -= o = qbinom.o gcc -ieee_with_inexact -g -I../include -I../../src/include -c rbinom.c -= o = rbinom.o gcc -ieee_with_inexact -g -I../include -I../../src/include -c dcauchy.c = -o = dcauchy.o gcc -ieee_with_inexact -g -I../include -I../../src/include -c pcauchy.c = -o = pcauchy.o gcc -ieee_with_inexact -g -I../include -I../../src/include -c qcauchy.c = -o = qcauchy.o gcc -ieee_with_inexact -g -I../include -I../../src/include -c rcauchy.c = -o = rcauchy.o gcc -ieee_with_inexact -g -I../include -I../../src/include -c dexp.c -o = dexp.o gcc -ieee_with_...

...ase. o Direct use of R INSTALL|REMOVE|BATCH|COMPILE|SHLIB is deprecated: use R CMD instead. o The gnome/GNOME graphics device is deprecated and will be removed in the next full release. BUG FIXES o pbinom(q, N, prob) is now more accurate when prob is close to 0. (PR#6757) o pcauchy(x, .., log.p) is now more accurate for large x, particularly when log.p = TRUE. (PR#6756) o pgeom(q, prob, lower.tail, log.p) is now (sometimes much) more accurate when prob is very small. (PR#6792) The code for pgeom(prob=1) assumed IEEE 754 arithmetic, and gave NaNs under gcc 3.4.0 -fPI...

...ase. o Direct use of R INSTALL|REMOVE|BATCH|COMPILE|SHLIB is deprecated: use R CMD instead. o The gnome/GNOME graphics device is deprecated and will be removed in the next full release. BUG FIXES o pbinom(q, N, prob) is now more accurate when prob is close to 0. (PR#6757) o pcauchy(x, .., log.p) is now more accurate for large x, particularly when log.p = TRUE. (PR#6756) o pgeom(q, prob, lower.tail, log.p) is now (sometimes much) more accurate when prob is very small. (PR#6792) The code for pgeom(prob=1) assumed IEEE 754 arithmetic, and gave NaNs under gcc 3.4.0 -fPI...

There is a problem with `rpois'. It does seem to take care about the order of the arguments. This is an example: > rpois(n=1,lambda=2) [1] 3 > rpois(lambda=2,n=1) [1] 2 0 It obviously uses the first argument as the number of samples to be drawn, which is wrong. I used Version 0.49 Beta (April 23, 1997). Fredrik

There is a problem with `rpois'. It does seem to take care about the order of the arguments. This is an example: > rpois(n=1,lambda=2) [1] 3 > rpois(lambda=2,n=1) [1] 2 0 It obviously uses the first argument as the number of samples to be drawn, which is wrong. I used Version 0.49 Beta (April 23, 1997). Fredrik

...../../src/include -c pbinom.c -o pbinom.o gcc -g -O2 -I../include -I../../src/include -c qbinom.c -o qbinom.o gcc -g -O2 -I../include -I../../src/include -c rbinom.c -o rbinom.o gcc -g -O2 -I../include -I../../src/include -c dcauchy.c -o dcauchy.o gcc -g -O2 -I../include -I../../src/include -c pcauchy.c -o pcauchy.o gcc -g -O2 -I../include -I../../src/include -c qcauchy.c -o qcauchy.o gcc -g -O2 -I../include -I../../src/include -c rcauchy.c -o rcauchy.o gcc -g -O2 -I../include -I../../src/include -c dexp.c -o dexp.o gcc -g -O2 -I../include -I../../src/include -c pexp.c -o pexp.o gcc -g -O2 -...

...../../src/include -c pbinom.c -o pbinom.o gcc -g -O2 -I../include -I../../src/include -c qbinom.c -o qbinom.o gcc -g -O2 -I../include -I../../src/include -c rbinom.c -o rbinom.o gcc -g -O2 -I../include -I../../src/include -c dcauchy.c -o dcauchy.o gcc -g -O2 -I../include -I../../src/include -c pcauchy.c -o pcauchy.o gcc -g -O2 -I../include -I../../src/include -c qcauchy.c -o qcauchy.o gcc -g -O2 -I../include -I../../src/include -c rcauchy.c -o rcauchy.o gcc -g -O2 -I../include -I../../src/include -c dexp.c -o dexp.o gcc -g -O2 -I../include -I../../src/include -c pexp.c -o pexp.o gcc -g -O2 -...

...aking rt.d from rt.c making dchisq.d from dchisq.c making pchisq.d from pchisq.c making qchisq.d from qchisq.c making rchisq.d from rchisq.c making dbinom.d from dbinom.c making pbinom.d from pbinom.c making qbinom.d from qbinom.c making rbinom.d from rbinom.c making dcauchy.d from dcauchy.c making pcauchy.d from pcauchy.c making qcauchy.d from qcauchy.c making rcauchy.d from rcauchy.c making dexp.d from dexp.c making pexp.d from pexp.c making qexp.d from qexp.c making rexp.d from rexp.c making dgeom.d from dgeom.c making pgeom.d from pgeom.c making qgeom.d from qgeom.c making rgeom.d from rgeom.c ma...