search for: unsymmetric

There is some historical precedence for fixing the problem with VS lower_bound by changing the LLVM source - when I first got LLVM to compile with Visual Studio, patches for unsymmetric operator < were accepted into the LLVM repo, and I believe it's been done several times after that as well. m. >From: Ahmed Bougacha >Sent: Friday, July 05, 2013 1:43 AM >To: Benoit Perrot >Cc: cfe-dev at cs.uiuc.edu ; llvmdev at cs.uiuc.edu >Subject: Re: [LLVMdev] [cfe-de...

Dear R-Help list: I'm using the Matrix library to operate on 600 X ~5000 element unsymmetrical sparse arrays. So far, so good, but if I find I need more speed or functionality, how hard would it be to utilize other sparse matrix toolsets from within R, say MUMPS, PARDISO or UMFPACK, that do not have explicit R interfaces? More information on these is available here www.cise.ufl.edu/res...

...d On Sat, Jul 6, 2013 at 1:02 AM, Tim Northover <t.p.northover at gmail.com> wrote: > > > There is some historical precedence for fixing the problem with VS > > lower_bound by changing the LLVM source - when I first got LLVM to compile > > with Visual Studio, patches for unsymmetric operator < were accepted into > > the LLVM repo, and I believe it's been done several times after that as > > well. > > In the C++11 discussion back in January > (http://llvm.1065342.n5.nabble.com/Using-C-11-language-features-in-LLVM-itself-td53319.html) > there seeme...

Hello, I have just updated my svn copy of the llvm/clang repositories after quite a long time of inactivity, and found it not compiling on Windows with Visual Studio 2008. The incriminated file is: llvm/lib/MC/MCModule.cpp Where several calls to "std::lower_bound" are made, like: atom_iterator I = std::lower_bound(atom_begin(), atom_end(),

...penSSH Version: 6.5p1 Hardware: All OS: All Status: NEW Severity: trivial Priority: P5 Component: ssh Assignee: unassigned-bugs at mindrot.org Reporter: sf at 9by6.org The key fingerprint headline has unsymmetrical braces for ED25519 in 6.6p1: +--[ED25519 256--+ | ... | Seems like in key.c:561, snprintf aborts before being able to put the final ']'. Note, that there's an unnecessary ' ' in there because of ED25519's short key_size. Reducing the minimum field width for...

..., 2013 at 1:02 AM, Tim Northover <t.p.northover at gmail.com> wrote: >> >> > There is some historical precedence for fixing the problem with VS >> > lower_bound by changing the LLVM source - when I first got LLVM to compile >> > with Visual Studio, patches for unsymmetric operator < were accepted into >> > the LLVM repo, and I believe it's been done several times after that as >> > well. >> >> In the C++11 discussion back in January >> (http://llvm.1065342.n5.nabble.com/Using-C-11-language-features-in-LLVM-itself-td53319.ht...

...es in the solution of some of the linear algebra problems that may arise. It looks like Jim Ramsay used a quick and dirty approach to the generalized eigenproblem by using B^(-1) %*% A, which is usually not too successful due to issues with condition of B and making a symmetric/Hermitian problem unsymmetric. In short, the problem is stated as follows: Find the eigenvalues e and vectors v that satisfy A v = e B v There is a matrix form (I think A V = B V E is usual, though I tend to work on them one at a time in my mind.) The real trouble is that A and B can have different forms e.g....

Full_Name: Antoine Lucas Version: 1.7.0 (2003-04-16) OS: Linux Submission from: (NULL) (193.51.197.253) I have a problem using read.table: If in a dataframe, we have a string containing a dot, write.table will not write any file while using option "dec=','". Example > m <- "1.5" > write.table(m,dec=',') Error in if (n%%nrowv == 0) value <-

Before I reinvent the wheel, I have need for a relatively straightforward crosstabulation (2 x n) function. I know that R has table(), ftable(), xtabs(), and summary(xtabs()), but none of these produce a fully "tricked" out cross-tabulation with marginal totals, expected cell frequencies, and an array of statistics about the contingency table. Is there a more complete (something