similar to: bug in qr.coef() and (therefore) in qr.solve (PR#8476)

On two laptops running 32-bit kubuntu, I have found that svd(), invoked within R 2.9.1 as supplied with the current ubuntu package, returns very incorrect results when presented with complex-valued input. One of the laptops is a Dell D620, the other a MacBook Pro. I've also verified the problem on a 32-bit desktop. On these same systems, R compiled from source provides apparently

Hi, I'm responding to a post about finding roots of a cubic or quartic equation non-iteratively. One obviously could create functions using the explicit algebraic solutions. One post on the subject noted that the square-roots in those solutions also require iteration, and one post claimed iterative solutions are more accurate than the explicit solutions. This post, however, is about

Dear R Development Team, I have encountered the following difficulty in using the function polyroot under either NT4.0 (R version 1.2.1) or linux (R version 0.90.1). In the provided example, the non-zero root of c(0,0,0,1) depends on the results of the previous call of polyroot. R : Copyright 2001, The R Development Core Team Version 1.2.1 (2001-01-15) R is free software and comes with

Package: xen-utils-3.0.3-1 Version: 3.0.3-0-2 I think a Xen user expects to have lomount available as it's standard part of the upstream distribution. It's quite useful to access images created on fedora, or netbsd domU installations. Currently it's put somewhere deep in /usr/lib/xen-utils*/.../bin I also don't understand why the bins are placed there and an extra wrapper

Hi! I just started this course and just installed R and RStudio but I got this warning/error messages when I open R and RStudio: During startup - Warning messages: 1: Setting LC_CTYPE failed, using "C" 2: Setting LC_COLLATE failed, using "C" 3: Setting LC_TIME failed, using "C" 4: Setting LC_MESSAGES failed, using "C" 5: Setting LC_MONETARY failed,

I've now done two rebuilds of R-1.7.0 on NetBSD 1.6, one with the --without-zlib configure option, and one without. Both builds use the recently-installed gcc-3.2.3 compiler. As before, the one built normally gets a segment violation, whereas the one built with the --without-zlib option works. The odd thing is that neither uses shared libraries for zlib: % ldd /usr/local/lib/R/bin/R.bin

Full_Name: Rick Sayre Version: 2.8.0 OS: windows, linux, os x Submission from: (NULL) (138.72.153.166) PR#8476 and PR#8478 http://bugs.r-project.org/cgi-bin/R/Models-fixed?id=8478 http://bugs.r-project.org/cgi-bin/R/Models-fixed?id=8476 discuss fixing qr.coef to handle complex matrices correctly But it appears the solution now "shipping" only handles square matrices. In 2.8.0 [linux,

https://bugzilla.mindrot.org/show_bug.cgi?id=2415 Bug ID: 2415 Summary: Public key failures are not counted and therefore not logged into syslog Product: Portable OpenSSH Version: 6.8p1 Hardware: Other OS: Linux Status: NEW Severity: normal Priority: P5 Component:

The bug I submitted yesterday (It's not entered in the bug data base, so I have no ID for it) included a suggested fix that is not correct. It worked for the examples I gave because there was no pivoting in fact, or only pivot permutations that were idempotent. A correction that works in general on the examples I gave makes these two changes in qr.coef(): ## coef[qr$pivot, ]

Hi I am having difficulty with eigen() on R-devel_2006-01-05.tar.gz Specifically, in R-2.2.0 I get expected behaviour: > eigen(matrix(1:100,10,10),FALSE,TRUE)$values [1] 5.208398e+02+0.000000e+00i -1.583980e+01+0.000000e+00i [3] -4.805412e-15+0.000000e+00i 1.347691e-15+4.487511e-15i [5] 1.347691e-15-4.487511e-15i -4.269863e-16+0.000000e+00i [7] 1.364748e-16+0.000000e+00i

Hi, All: Is there a simple way to detect complex conjugates in the roots returned by 'polyroot'? The obvious comparison of each root with the complex conjugate of the next sometimes produces roundoff error, and I don't know how to bound its magnitude: (tst <- polyroot(c(1, -.6, .4))) tst[-1]-Conj(tst[-2]) [1] 3.108624e-15+2.22045e-16i

Hi, with small matrices eigen works as expected: > eigen(cbind(c(1,4),c(4,7)), only.values = TRUE) $values [1] 9 -1 $vectors NULL > eigen(cbind(c(1,4),c(4,7))) $values [1] 9 -1 $vectors [,1] [,2] [1,] 0.4472136 -0.8944272 [2,] 0.8944272 0.4472136 > eigen(cbind(c(1,-1),c(1,-1))) $values [1] -3.25177e-17+1.570092e-16i -3.25177e-17-1.570092e-16i $vectors

I have a symmetric matrix B (17x17), and a (17x17) square matrix A. If do the following matrix multiplication I SHOULD get a symmetric matrix, however i don't. The computation required is: C = t(A)%*%B%*%A here are some checks for symmetry > (max(abs(B - t(B)))) [1] 0 > C = t(A)%*%B%*%A > (max(abs(C - t(C)))) [1] 3.552714e-15 Any help on the matter would be very much appreciated.

Can anyone explain this? I have a matrix with double components. It's taking up a lot of memory, so I want to multiply then turn it to integers. I'm pretty certain that there are only 2 decimal places, but I wanted to check by using modulo. E.g. mat = matrix(11:50/100, ncol=4,nrow=10) #Matrix with values out to the hundredths any((mat * 100)%%1!=0) But oddly enough it doesn't work.

On 12-Feb-06 benphalan at gmail.com wrote: > Full_Name: Ben Phalan > Version: 2.2.1 > OS: Win XP > Submission from: (NULL) (131.111.111.231) > > > I have noticed that floor returns the wrong number when there are more > than 15 > decimal places: > >> floor(6.999999999999999) > [1] 6 >> floor(6.9999999999999999) > [1] 7 > > There is a

Hi, I sometimes play around with extreme parameters for distributions and found that qbeta is not always monotone as the following example shows. I don't know whether this is serious enough to submit a bug report (as this example is near to the limitations of floating point arithmetic). Josef > x <- qbeta((0:100)/100,0.01,5) > x [1] 0.000000e+00 1.253990e-201 1.589622e-171

Full_Name: Jeremiah Cohen Version: 2.9.0 OS: Windows XP Submission from: (NULL) (129.59.230.235) I believe there is a bug in the seq() function for certain values of the "from" argument. Here are examples: > seq(-.2, .1, .1) [1] -0.2 -0.1 0.0 0.1 > seq(-.3, .1, .1) [1] -3.000000e-01 -2.000000e-01 -1.000000e-01 5.551115e-17 1.000000e-01 > seq(-.4, .1, .1) [1] -0.4 -0.3

Just to avoid possible confusion, let me correct a typo (at step [2] in the example below). Apologies! -----FW: <XFMail.111023084327.ted.harding at wlandres.net>----- Date: Sun, 23 Oct 2011 08:43:27 +0100 (BST) Sender: r-help-bounces at r-project.org From: (Ted Harding) <ted.harding at wlandres.net> To: r-help at r-project.org Subject: Re: [R] symmetric matrix multiplication On

Hi all, Would anybody care to suggest a third party SATA-RAID card that works out of the box with CentOS 6, without having to jump through hoops to make it work? The card should preferably be able to connect ten harddrives, but I guess three four-port cards should work as well. There's no need for anything fancy really, as long as I can create a single big software-raid on it at CentOS

Hi, is it save to use ext2 / ext3 hashed b-trees feature with linux kernel >= 2.4.25 ? thanx, Gregor -- echo '16i[q]sa[ln0=aln100%Pln100/snlbx]sbA0D3F204445524F42snlbxq'|dc