search for: nx3

Is there a way to identify (for subsequent replacement) which rows in a matrix are comprised entirely of *integers*? I have a large set of *nx3 *matrices where each row either consists of a set of 3 integers or a set of 3 real numbers. A given matrix might looks something like this: [ ,1] [ ,2] [ ,3] [1, ] 121.0000 -98.0000 276.0000 [2, ] 10.1234 25.4573 -188....

i am trying to duplicate R's computation of standard errors but having some trouble. i loaded some data into R and ran summary(lm(y~x1+x2+x3+0, data=data)), but i am not sure how the "Std. Error" values are computed. let y be the nx1 vector of dependent variables and X be the nx3 matrix of independent variables. let T(.) denote the transpose of a matrix/vector, and let I(.) denote the inverse of a square matrix. then i'm able to correctly compute the coefficients and residual standard error using the following formulas: beta = I(T(X)*X) * y resid err = sqrt(T(y)*y -...

I sent an email out to freebsd-net without a response, soo this is my last attempt at getting any assistance here. I have a QLE3142-CU-CK (rebranded NetXen NX3-20GCU w/ NX3031 chipset) with no driver support in *BSD from anything I saw. I came across solaris's ntxn driver which seems to work appropriately but I have no use for solaris as a host o/s. Naturally I'll attempt at trying to get the driver to work myself, however I'm far from knowled...

Hello, I am in the process of setting up a server that is running to invocations of dovecot. One of the invocations is acting as a backend and the other as a Director. I believe I have most of the configuration complete but I keep running into the following error: Jul 01 14:17:04 lda(postmaster at mydomain.com: Error: user postmaster at mydomain.com: Initialization failed: namespace

Hello, in a three dimensional coordinate system, I'd like to find all my experimental data points that fall within an ellipsoid around a fixed coordinate. The fixed point is defined by (x.coord.point, y.coord.point, z.coord.point). The coordinates of the ellipsoid are given by the three vectors x,y,z. In a previous version of my code, I simply used a box instead of an ellipsoid to sort

DeaR list, I happily use eigen() to compute the eigenvalues and eigenvectors of a fairly large matrix (200x200, say), but it seems over-killed as its rank is limited to typically 2 or 3. I sort of remember being taught that numerical techniques can find iteratively decreasing eigenvalues and corresponding orthogonal eigenvectors, which would provide a nice alternative (once I have the

...t;()y3G;04Wo+;=*1;@ipS97Q+(QD%H7*|0_} zz0w<dU1}FMd(@6^SYD00X;@kTwui!3cu at e6Rr3n_S9;Ap6Un8CWJ;8=5(zl3oh(;O z<StF*rbIt;l+;@ir8J2`NoWM2iit+laX+eK$OJ;$ulxw}k%Kz0iS&@8(W_5ZYJZE9 zD at 7k9R`)^Vjt`Ous^+gmglDZ7MR4EGr?q;!C);q=FFlMPMcf{)sE=*(lfN~7xE`q~ zAbo`PMx6yVFnzS1FKrUbWVjoa$r9Mg`zJNsPaMh}=u2PnX38T(a=>i?QNDeh;I4g) zJ`TC1RrcMNeoZc1iCvR{B9 at u^$xVC;XGwWf+PA;yuS7r@<IE@$Pm*`X^KO at 8)KFj1 zPyy(=8oJ7$VU6CDCma8|UPg+PH)pv!X(xNEp4ot9GP^<9W||RF>cIEAyUp6WXgP8u zH47<CBosAbTIrH)vVKHHqtd642q#r3Pm?>-CMT~lKs5u{Ibjv0y2 at O|*nL}8+~qZA zX`A$S!#YO%o*3 at q^-oIpN>3{I41Usw&!8vEelO`K&g...