Displaying 20 results from an estimated 200 matches similar to: "R and Excel disagreement - Goal Seek versus uniroot"
2011 Jan 20
4
How to reshape wide format data.frame to long format?
Dear list,
I need to convert this data.frame
> names(codesM)
[1] "key" "AMR.pa1.M" "AMR.pa2.M" "AMR.pa3.M" "AMR.pa4.M"
[6] "AMR.pa5.M" "AMR.pa6.M" "AMR.pa7.M" "AMR.pa8.M" "AMR.pa9.M"
[11] "AMR.pa10.M" "AMR.ta1.M" "AMR.ta2.M" "AMR.ta3.M"
2013 Feb 01
0
Hi
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xmlns:msgr="http://messenger.live.com/2009/ui-tags" xml:lang="en" xmlns:wl="http://apis.live.net/js/2010">
<head>
<title>Email
2013 Aug 16
1
Disagreement on where mail goes.
My virtual users have their mail stored in /usr/local/virtual/user at example.com/
dovecot wants to read the mail from /usr/local/virtual/user at example.com/Maildir which is causing problems since all new mail is being written in /usr/local/virtual/user at example.com/new and dovecot is looking in /usr/local/virtual/user at example.com/Maildir/new
For the local users, /home/user/Maildir is the
2012 May 10
0
disagreement in loglikelihood and deviace in GLM with weights leads to different models selected using step()
In species distribution modeling where one uses a large sample of
background points to capture background variation in
presence\pseudo-absence or use\available models (0\1 response) it is
frequently recommended that one weight the data so the sum of the absence
weights is equal to the sum of presence weights so that the model isn?t
swamped by an overwhelming and arbitrary number of background
2008 Jul 15
2
Maildir folder renaming disagreement among IMAP clients
A user alerted me to a problem when he renamed an upper level mail
folder and lost access to a lower level folder under it.
I tried with and without listescape, it didn't seem to make a
difference, and I saw no errors in the dovecot log.
Symptoms are if a client has a maildir folder tree .a and .a.b and
renames a to c in their client, Thunderbird shows c/b but b is
inaccessible since it
2008 Nov 26
2
Chi-Square Test Disagreement
I was asked by my boss to do an analysis on a large data set, and I am
trying to convince him to let me use R rather than SPSS. I think Sweave
could make my life much much easier. To get me a little closer to this
goal, I ran my analysis through R and SPSS and compared the resulting
values. In all but one case, they were the same. Given the matrix
[,1] [,2]
[1,] 110 358
[2,] 71 312
[3,]
2002 Oct 08
3
repeated measures help; disagreement with SPSS
Hi, all.
I have a simple design I'm comparing to output from SPSS.
the design is 1 repeated measure (session) and 1 between measure
(cond). my dependent measure is rl. here is the data I'm using (in a
data.frame):
mig <- data.frame(subj=factor(rep(subj,3)),
cond=factor(rep(cond,3)),
session=factor(c(rep(1,nsubj),rep(2,nsubj),rep(3,nsubj))),
2008 Jun 11
0
Polynomial Goal Programming
Hello R,
Is there a package to perform Polynomial goal programming in R?
BR, Shubha
Shubha Karanth | Amba Research
Ph +91 80 3980 8031 | Mob +91 94 4886 4510
Bangalore * Colombo * London * New York * San José * Singapore * www.ambaresearch.com
This e-mail may contain confidential and/or privileged i...{{dropped:13}}
2013 Nov 10
1
[LLVMdev] [cfe-dev] Goal for 3.5: Library-friendly headers
On 10/11/2013 14:26, Joerg Sonnenberger wrote:
> On Sun, Nov 10, 2013 at 01:42:24PM +0000, Alp Toker wrote:
>> |#undef NetBSD||
>> ||#undef mips||
>> ||#undef sparc||
>> ||#undef INT64_MAX||
>> ||#undef alloca|
>>
>> This is not OK to do globally -- even if LLVM doesn't care about the
>> definition, maybe embedding applications or OS headers
2013 Nov 11
0
[LLVMdev] [cfe-dev] Goal for 3.5: Library-friendly headers
2013/11/10 Alp Toker <alp at nuanti.com>:
> #ifndef NDEBUG
>
> This is the biggest violation. NDEBUG should only ever be used in source
> files. That way if something is crashing we can swap in a debug build
> without rebuilding every single dependent application. Win!
I wish;
- NDEBUG may not modify API. class structure (member offset, vtables)
should be stable and
2013 Nov 11
0
[LLVMdev] [cfe-dev] Goal for 3.5: Library-friendly headers
On Nov 11, 2013, at 9:56 AM, Alp Toker <alp at nuanti.com> wrote:
> Done :-)
>
> The patchset is 532K so I've put it online:
>
> http://www.nuanti.com/tmp/llvm-api-stability/
>
> The bulk edits are split out and noted. They were refactored with an internal tool, so it's not a big hassle to keep this up to date until 3.4 is out the door.
>
> A handful
2005 Jun 30
0
vecortizing uniroot() for numerical solutions
# Hi All,
#
# I need to solve a somewhat complex equation at many parameter
values for
# a number of different parameters.
# A simplified version of the equation is: 0= (d1/(h1^2))-(h2*(d2^2))
# I'd like to solve it across a parameter space of d1 and d2, holding
# h1 and h2 constant.
# It seems that uniroot() can do it, but I don't see how to
vectorize it.
#
2011 Apr 27
1
applying uniroot function to each element in vector
If I have a vector of n elements, e.g. a vector of length 4 with elements 10,
20, 30, 40 and want to find the different values of x such that x^2=10,
x^2=20, x^30 and x^2=40, how could I do this in R? I'm thinking of using the
uniroot function, but am finding difficult applying it to a vector. Thanks
--
View this message in context:
2006 Jul 30
0
re 11. uniroot and function opposite signs warning
Nurza,
Try running a while loop steping out until you have a start and finish
thats the function is opposite in sign. You need a "start" and "finish"
where F is + and - on either side of the loop. Graphing F might help.
step<-10
checkme<-F(start)*F(finish+step)
while(checkme>0){
initialstep<-initialstep*2
checkme<-F(start)*F(finish+step)
}
2000 Feb 24
1
fisher.test() in ctest or perhaps uniroot() (PR#455)
fisher.test(matrix(c(1,20,246,6873),2),hybrid=F)
Error in if (f(lower, ...) * f(upper, ...) >= 0) stop("f() values at end
points not of opposite sign") :
missing value where logical needed
Thomas Lumley
Assistant Professor, Biostatistics
University of Washington, Seattle
-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-
r-devel mailing list --
2006 Apr 05
0
uniroot warning (lack of) (PR#8750)
Full_Name: Chris Andrews
Version: 2.2.1
OS: Windows
Submission from: (NULL) (128.205.94.95)
The function page for uniroot indicates
If the algorithm does not converge in 'maxiter' steps, a warning
is printed and the current approximation is returned.
I have not been able to get a warning message even when I think I should get one
(see code below).
Perhaps the bug is in the
2006 Oct 27
1
making uniroot a bit more robust?
Hi,
I wonder if it would make sense to make uniroot detect zeros at the
endpoints, eg
if f(lower)==0, return lower as the root, else
if f(upper)==0, return upper as the root, else
stop if f(upper)*f(lower) > 0 (currently it stops if >=), else
proceed to the algorithm proper.
Currently I am using a wrapper function to implement this, and I found
it useful. But I didn't want to send a
2008 Dec 31
1
uniroot() problem
I have a strange problem with uniroot() function. Here is the result :
> uniroot(th, c(-20, 20))
$root
[1] 4.216521e-05
$f.root
[1] 16.66423
$iter
[1] 27
$estim.prec
[1] 6.103516e-05
Pls forgive for not reproducing whole code, here my question is how "f.root"
can be 16.66423? As it is finding root of a function, it must be near Zero.
Am I missing something?
--
View this message
2011 Apr 02
1
uniroot speed and vectorization?
curiosity---given that vector operations are so much faster than
scalar operations, would it make sense to make uniroot vectorized? if
I read the uniroot docs correctly, uniroot() calls an external C
routine which seems to be a scalar function. that must be slow. I am
thinking a vectorized version would be useful for an example such as
of <- function(x,a) ( log(x)+x+a )
uniroot( of, c(
2011 May 27
0
stinterp/spline - uniroot problem
Dear all,
I would like to fit growth data to a smooth curve (preferably using a
Stineman interpolation).
Then I would like to find the intersection of the curve with a horizontal
line (e.g. 0). See below for a coding example.
The root finding using 'uniroot' works fine if I fit the data with
'smooth.spline', but not if I fit the data with 'stinterp' (stinepack) or