fdej

27 ms·

211.
by fdej 12y ago
As an author, the added value is the name of the journal. The pedigree of the journals you have published in is one of the primary qualities that grant and hiring committees look at. The whole system is obviously a scam, but you have to pl
212.
by fdej 12y ago
"There is some recent confusion" is such a wonderful euphemism.
213.
by fdej 12y ago
That's good to know!
214.
by fdej 12y ago
Julia's non-incremental stop-the-world garbage collector is quite bad. I ran into problems with this when trying to implement an algorithm that creates and destroys lots of temporary objects, where each object is a wrapped C struct tha
215.
by fdej 12y ago
Every few years, a new generation of design graduates will enter the industry and "rewrite the rulebook" by simply doing the opposite of what the previous generation did. We will thus have to live with the five-year flat/unfl
216.
by fdej 12y ago
This would slow down the general case where the size is variable, but you could combine it with __builtin_constant_p in GCC.
217.
by fdej 12y ago
Yeah, I don't know what's up with that. I got the number from openhub. But sloccount tells me that sage-6.2 only has 570K lines of code. And sloccount says that Singular has 280K lines of code.
218.
by fdej 12y ago
I somehow doubt the amount of code in Sage itself is close to the sum of its mathematical components, though Sage does contain a huge amount of new code (most importantly a lot of high level mathematical code not found anywhere else). Accor
219.
by fdej 12y ago
Relevant: http://reference.wolfram.com/language/tutorial/WhyYouDoNotUs...
220.
by fdej 12y ago
It depends on what you are trying to accomplish. Multiple precision integers are not necessarily slower than multiple precision floating point numbers. And if you're doing pure math research, chances are that you do care about result
221.
by fdej 12y ago
Maple isn't quite as much of a black box as Mathematica. Many of the library functions in Maple are written in Maple and you can easily read their source code.
222.
A Non-technical Overview of the SageMathCloud Project(sagemath.blogspot.com)
5 points by fdej 12y ago|0 comments
223.
by fdej 12y ago
Library genesis is the best thing that happened to research since Google (and a huge number of researchers use it, secretly). Being able to access any obscure technical book in the world in a few seconds is literally orders of magnitude mor
224.
by fdej 12y ago
Yes, it's basically dual numbers (or power series -- when considering inverses of infinitesimals, you get Laurent series) with different terminology.
225.
by fdej 12y ago
If you want to read any of the bot generated articles, just try http://sv.wikipedia.org/wiki/Special:Slumpsida I tried it 10 times and got 6 bot articles.
226.
SageMathCloud – History and Status(sagemath.blogspot.com)
5 points by fdej 12y ago|0 comments
227.
by fdej 12y ago
It's mostly a theoretical result. The previous FFT-based multiplication algorithms (including the one in GMP) all have almost linear complexity. For integers that can be stored within the observable universe, overhead and memory locali
228.
by fdej 12y ago
All asymptotically fast algorithms for integer multiplication basically reduce the problem to one or several polynomial multiplications. Polynomial multiplication can be done in subquadratic time using an evaluation-interpolation strategy:
229.
Even faster integer multiplication(arxiv.org)
94 points by fdej 12y ago|25 comments
230.
by fdej 12y ago
Yet enough people think it's a C compiler that if you try to use avant garde C99 features in your C project, someone will invariably complain that MSVC doesn't build it.
231.
by fdej 12y ago
Matrices can be everything between dense and extremely sparse, depending on the application (sometimes you have a structured matrix and can use sparse methods to reduce it to a dense system of much smaller size). But yes, dense matrices wit
232.
by fdej 12y ago
Fun story: Knuth claims in the 1997 edition of TAOCP vol. 2 that dense matrices of size larger than 250 "rarely occur in practice" and that asymptotically fast matrix multiplication is "strictly of theoretical interest".
233.
by fdej 12y ago
I was fully expecting the infinitely annoying background-photo-that-changes-when-you-scroll gimmick. Such a pleasant surprise.
234.
by fdej 12y ago
Since I'm being downvoted... please excuse my poor attempt at sarcasm. What I'm saying is that I sometimes get the impression that language designers randomly change up syntax just to make their language look different, and thus s
235.
by fdej 12y ago
> PS: next time you design a new language just make a random unique combination of the above. That's my impression whenever I see a new programming language too. Why would someone switch to your language if the syntax is just the sa
236.
by fdej 12y ago
I'm aware of the 53+3 bit algorithm for addition and subtraction, but I don't see how this could possibly work for multiplication. Could you please point me to a paper that explains how to compute a correctly rounded 53-bit produc
237.
by fdej 12y ago
Er, what? Floating point numbers do "round correctly" (in binary) -- that's pretty much the whole point of the IEEE standard. In particular, to compute a product of two 53-bit floating-point numbers with correct rounding (as
238.
by fdej 12y ago
Could you point to a paper that shows how to compute a correctly rounded 53-bit floating-point product without computing all 106 bits?
239.
by fdej 12y ago
Linux (sorry, GNU/Linux) is ample evidence to the contrary.
240.
by fdej 12y ago
This book had a big influence on me. I bought it right when I started university, and it contributed a great deal to my decision to switch study program from software engineering to physics/math after the first year. I never regretted

More ›