« first day (26 days earlier)      last day (4459 days later) » 
01:00 - 18:0018:00 - 23:00

1:13 AM
I don't think I mentioned this already... I finally got around to turning the symbol list I'd written up for a now-deleted question into a blog post
 
@DavidZaslavsky for the longest time, postfix notation was my preferred form, and it still largely is. I treated it as a succession of transformations of the initial data.
 
@rcollyer I still tend to think that way about things like N and FullSimplify
 
@DavidZaslavsky yes, definitely.
In other news, we're on the first page of hottest Area51 proposals, again. I doubt we'll ever get back to number one, but it is nice to see.
 
1:28 AM
I would imagine there's some penalty for having launched, so that the front page is taken up mostly by upcoming proposals (that actually need the support) rather than existing sites
 
true, and beta sites tend to drop down any way. The fervor of making it passed commitment isn't translated into progress in beta.
 
1:43 AM
0
Q: Why isn't each proposal given a chat room?

rcollyerOne of the advantages of the Mathematica proposal was our ability to regularly communicate within the StackOverflow Mathematica chatroom. This allowed us to build and maintain a core group of users. It is this core group, that I believe helped us quickly pass through to beta after the original pr...

 
2:15 AM
@rcollyer I think we have been on the hotness front page the whole time, but sometimes a few screenfuls down.
 
@Verbeia Hmm, allow me to rephrase: were the 15th hottest proposal out there, which puts us back on the first page with the minimum 15 proposals per page.
 
oh right - I view at 50/page :-s
 
Of course, we're the hottest public beta out there, too. :)
I think the great outdoors beat us once.
And, as always, we're hotter than sex was.
 
@rcollyer Poker is not doing well - I am surprised and I'm sure its proposers are disappointed.
 
2:30 AM
Yeah, only 91 questions.
Any bets on our first tag badge?
Heike is the only one that has over 100 in any tag, thus far. Plus, she's close on one other, too.
 
Without even looking, I'm going to say either Heike on or Leonid on
 
Leonid on is better. Nearly 100, but only 9 answers. So, it will be a little while for him. I think Mr. Wizard has a better shot at .
And, despite having 45 questions, 's highest rated user only has 50 upvotes.
 
The first Enthusiast badges will get handed out in a couple of days.
 
@Szabolcs yup, that's the one I use. I posted it in the SO chat back then. You can also add an optional size parameter as:
getGravatar[email_String, size_Integer: 32] :=
 Import["http://www.gravatar.com/avatar/" <>
   IntegerString[Hash[email, "MD5"], 16, 32] <> "?s=" <>
   ToString@size <> "&d=identicon"]
 
Here's another one - who'll be the first to get Generalist? (my money's on Szabolcs)
 
2:46 AM
Good point, but those can't be handed out until the top 40 tags have 200 questions each. So, we've got a long while until that happens.
 
I do find it a bit weird that we have one Necromancer badge and we're not even 30 days into beta, yet.
 
I find this admission by Mr.W very disturbing
@rcollyer hail old migrations!
 
Seriously.
@yoda disturbing? in what way?
 
He's admitting to forcing 500 to accept Heike's answer because earlier in the day, she happened to lose an accepted answer when he unknowingly wrote the same duplicate answer... and also because he believes that Heike used his answer from SO, which cannot be beat
And this is after just 2 hours of the question being posted
 
2:55 AM
The 2 hours is disturbing to me. The rest, just indicates that he has a conscience. (The first time I spelled that word without spellcheck going crazy.)
 
You don't show you have a conscience by badgering someone to hurriedly accept an answer on a different question!
 
Six of one. Maybe the diamond has gone to his head.
 
I wouldn't go that far...
 
it was a joke.
I doubt any of our mods do not take the job seriously.
 
Hmm... never mind. I read his comments in the moderator chatroom. He probably just didn't realize the gravity of his words... especially with the diamond (which takes a bit of getting used to)
 
3:00 AM
@yoda it was Simon's recent answer to my "undocumented options" question.
That's now CW, but I seem to have rep from it. Would that go in a recalc?
 
@yoda for everybody. we have to get used to them having extra power.
@Verbeia no, what you gained prior to it being cw stays with you.
the same thing happened with the toolbag question.
 
gotcha, thanks.
 
@rcollyer certainly.
@Verbeia free rep! =))
 
I am still pretty amazed how how some of my questions and answers have been upvoted so much
@yoda =)
 
Vote early, vote often!
 
3:04 AM
voting has been slipping. you got to beat the drum more often
 
I suspect our the avg number of votes will start to drop as beta progresses, though.
Jinks.
 
we are overachieving on high-rep users relative to most other new sites
Interesting, some of my most recent posts have scored particularly highly
 
Truly. But, they're all overachievers anyway.
Part of the problem is that there are questions I have never seen before, already.
So, it is tough to vote for something that I haven't read.
 
lunch is over, back to work - see you alter
 
@Verbeia Later.
I should go, also. Night.
 
 
1 hour later…
4:37 AM
@yoda holy cow I had no idea this was going to be taken that way. I hope I don't regret volunteering to be a moderator sooner rather than later. Yoda, I cannot make you or anyone else believe me but flatly, you have it all wrong. None of what you described motivated me. Most importantly I was not mindful of the diamond next to my name and I did not mean anything official in what I wrote.
I also did not mean to imply that because Heike had used a method that I was also fond of, which I most certainly did not invent, that somehow the answer could not be beat. In fact I specifically allowed for the probability that it could be beat if Leonid posted.
If all my comments are going to be put to this kind of scrutiny and suspicion I want no part in moderation.
In the past when I have had similar exchanges no one complained, and as far as I know the people involved were at least cordial to me. I am quite shocked that this has changed so suddenly.
 
It may not entirely be due to moderation... IMO any time someone writes "please accept <specific answer>" it's likely to rub some people the wrong way.
 
I don't know if it is the fact that I have been made a moderator that is bothering people, or if the fact that I am a moderator is simply causing people to express how they already felt. One way or another I want to, need to understand this.
 
I can't really say anything about this specific incident, having not been involved in it, but FWIW everybody has some hiccups when starting out as a moderator. I've seen moderators do worse things and get over it.
 
@DavidZ At the time I wrote that there were only two answers, mine and Heike's. I meant it only graciously, I had no ulterior motive, and I in no way was trying to force his hand.
I am quite certain that I have previously done similar on StackOverflow and that nothing bad that I was made aware of resulted.
I certainly would appreciate any guidance you can give me in this situation; I feel blindsided.
 
Yeah, I personally understand where you're coming from, and I wouldn't have complained. But that means I can't speak for what the people who were complaining were thinking at the time, other than what has been posted in comments.
 
4:47 AM
@MrWizard I never took it that way until you confirmed in the comments that indeed that was your intention... In any case, what really took me by surprise was the fact that you were the one who regularly commented to new users (and especially to 500) that they ought to wait for 2 days to accept an answer so as to not discourage others from attempting to answer
I will not deny that I was very surprised to see you rushing to convince him to accept an answer...
@MrWizard You know that is not true because we all overwhelmingly supported you and all the other nominees
I'm absolutely positive we've got the best mod team... I was (and as you can see Sjoerd from the TL comment, rcollyer, JM and I don't know who else) surprised because this was exactly the polar opposite of the Mr.Wizard I've known
 
@yoda thank you for discussing this. regarding "You know that is not true" that certainly would seem to be the case which is why I feel all the more blindsided. I would not have recommended he accept that answer if he had not already accepted (my version of) that answer for the nearly-identical previous question.
By the way R.M has flagged the comments under that answer for moderator cleanup but I am scared to take action myself lest it somehow be seen as evil.
 
@MrWizard What I would advise you to remember is that in the long term this is not that big a deal as long as you learn from it. New mods always make mistakes and they are easily forgiven with time. As yoda said, you have a lot of support from the community, perhaps more so than the moderators on the average beta site.
 
@MrWizard To echo what David said, this is a site that grew from an existing community and we all trust you guys, a hell lot more than on an average site, where the mods and the users are only getting to know each other. Hell, you, Sjoerd and JM go a long way back on MathGroup too, so it even precedes SO by a good 10 years! I (and I believe everyone else too) fully trust all 3 of you
 
Thank you, that is good to hear. I am sorry that I let you down and I will learn from my mistakes if they are made clear to me.
 
My concern was mainly because I felt that you were making erratic comments because of the events that played out earlier in the day, re: the PadRight answer. For no fault of yours, you were put in a position that is not enviable.
I felt that you were trying to overcompensate because you felt bad about one incident... I guess the larger point I was trying to make was that it's life... sometimes people make mistakes like accidentally writing a near duplicate answer (it has happened to me several times) and sometimes, the OP ends up accepting that
There is no need to feel bad about it.
 
4:58 AM
I am not used to my comments (often tongue in cheek) being connected to authority. If nothing else I have already learned that I will have to conduct myself differently (which is sad, as I have enjoyed being able to take a lighthearted approach to SE).
 
lol... you can make tongue in cheek/jerk/nasty comments all you want... have you ever come across Will/Wont on SO/Meta? :)
 
I cannot say I know specifically of what you speak, but Meta is a little different.
 
@MrWizard If my experience is any indication, with time, you and the community come to some sort of equilibrium, and you'll get to know when it's appropriate to make jokes (e.g. in TL) and when it's not.
 
@MrWizard Let me just be clear that I would've brought this up with you even if you were not a moderator... it was not the comment in isolation that was the concern; it was the comment seen in light of earlier events (especially since you took it to heart) that was concerning. Again the concern was not that you're abusing your powers (you're not!) but rather that you might be taking things a bit too seriously...
 
"rather that you might be taking things a bit too seriously..." When then I guess I've really put my foot in it now.
 
5:07 AM
There might be legitimate reasons to request that an OP change answer, but it always ends up grating someone the wrong way. Recently, I did ask someone to change their answer to a more well rounded answer with examples (and I did not have any stake in the game... strictly a 3rd party), and I don't think it came off very well to the other person...
 
I shall remember that.
 
I feel bad now for causing this and dragging you in... I intend to be even more distanced from meta than I have been now
 
CHM
5:38 AM
@yoda Are you SE staff? I see you're not on the user list for this beta, but seem to know everybody here.
 
5:49 AM
@CHM no, I'm not SE staff. Spending a lot of time in this chatroom helps =)
pretty sure am chatty :) Only rcollyer and Szabolcs have me beat
 
CHM
Hehe
That's the number of lines you have written?
 
yup
 
CHM
ok
see you later. Homework needs to be done, gneh.
night
 
good night
 
 
2 hours later…
7:26 AM
@yoda Cripes, you're making me feel even older than I used to feel... :P
 
8:16 AM
@JM lol
 
 
2 hours later…
9:54 AM
@yoda Do you see the pinned message about the syntax highlighter on the right? I don't see it here on the right. When I search for it, the system says it's already pinned.
 
@Szabolcs Pinned chats automatically fall off after 2 weeks...
 
@yoda And it's not possible to re-pin them?
 
@Szabolcs I'm looking at it..
 
Jan 29 at 9:13, by Szabolcs
Click here to install and test @halirutan's syntax highlighter on Mma.SE. With Firefox, you need to install Greasemonkey first, with Chrome it works out of the box. Please test, this will eventually become part of the site! Problem reports go here.
@yoda there's the link ^
 
gaaah! It's being stubborn. While I figure it out, we'll have this:
Click here to install and test @halirutan's syntax highlighter on Mma.SE. With Firefox, you need to install Greasemonkey first, with Chrome it works out of the box. Please test, this will eventually become part of the site! Problem reports go here
8
problem solved =)
 
10:09 AM
@yoda We should find better pins then.
 
10:21 AM
I finally found a decent application of DynamicWrapper in the wild (It's super effective)
 
Yeah, that was very nice. Didn't think you could coerce CurrentValue to return what you really want...
 
Tsk, ReliefImage[] is not as straightforward to apply as I thought...
...silly me didn't take ColorFunction into account.
 
@yoda I figured that since font attributes are really a front end affair I should let the front end figure out what the right value was instead of the kernel by wrapping it in Dynamic.
 
acl
@MrWizard without wanting to enter this whole mess (I personally did not find your comments particularly inappropriate, but I can see why yoda got worried), let me encourage you to experiment with Compile in v7. It is actually trivial to get something much faster than what Heike and you did if you use imperative code and compile (as you can see in the other answers), even if you do not compile to C.
(hi @Heike and @yoda :) )
 
Hi acl
@acl It looks like I missed a relevant discussion.
 
10:34 AM
@acl thank you. Sooner or later I shall have to get past it but I like Mathematica because I don't have to write that kind of code.
Hello Heike.
 
Hi Mr.Wizard
Sorry for causing a mess.
 
Hardly your doing. :-)
 
acl
@MrWizard indeed, but if what you need is speed, it is often possible to avoid coding C by using compile. It's not an alternative to mathematica but an alternative to explicit C
 
Quite right. I simply don't often need that kind of speed, but if I am going to continue to give good answers I shall have to learn more about it.
 
A quickie for you guys: nothing more compact than f @@@ Partition[{a, b, c, d}, 2, 1] for producing {f[a, b], f[b, c], f[c, d]}, no? (No, I don't want to use Developer`PartitionMap[].)
 
10:40 AM
What's a simple way to evaluate to do the following for generic a f[x]? Let f[x_]:=Sin[x] and x=1. I would like to start with HoldForm[f[x]] and end up with HoldForm[Sin[x]]
It needs to work for any f[x], and the variable needs to be x. It has to work even if x has a value.
It's just for formatting.
@JM That's what I'd use.
 
@JM Nothing I can think of off the top of my head
 
Okay, thanks Heike and Szabolcs.
 
This is so convoluted: Module[{z, g}, Block[{x}, HoldForm[g] /. g -> f[z] /. z -> x]]
 
@Szabolcs Maybe something like Module[{z}, HoldForm[#] /. z -> x &@f[z]] ?
 
If the definition were f = Sin, there's something that could work...
Oh wait... it works with the definition you have, too.
f[x_] := Sin[x]; x = 1; Operate[ReleaseHold, First[Map[HoldForm, MapAt[Hold, Hold[f[x]], {1, 0}], {2}]]] (thank Roman Maeder!)
 
11:03 AM
@JM Looks like a juggling pattern
 
@Heike Yeah, I just adapted Maeder's trick to Szabolcs's circumstances...
 
@JM Hmm, I think I misunderstood the question.
 
Okay, so what actually comes out is Sin[HoldForm[x]], but that's fixable...
 
J.M. not more compact, but faster: Inner[f, Most@#, Rest@#, List] &
Or, make f Listable, then simply f[Most@#, Rest@#] &
 
@MrWizard Works nicely for lists with atomic elements, thanks. It chokes for a list of lists, but I think I see how to massage that function...
 
11:12 AM
@Heike Thanks!
Stupid question ... which option controls the front size in a PlotLabel?
 
Hi all!
 
Hi Leonid!
 
BaseStyle does not and LabelStyle does not ...
 
@Szabolcs What about HoldForm[f[x]]/.DownValues[f]?
 
@Szabolcs I'd just feed a Style[] object to PlotLabel myself for safety...
 
11:13 AM
@LeonidShifrin looks great
 
Hi J.M.!
 
I hate graphics options...
 
@JM That's what I do
 
Szabolcs, I probably don't understand the question, but how about:
/. h_@_@HoldPattern@x :> h@Sin@x
Hello Leonid. I rarely see you here.
 
Hi Mr.Wizard. I rarely stop by.
 
11:20 AM
hello @LeonidShifrin :)
 
Hello yoda
Hello @yoda
 
you can edit your previous message (within 2 mins of posting) by pressing the up arrow :)
 
Good to know, thanks.
 
There is a rather precipitous drop in total page views the last couple of days. Any thoughts on that?
 
11:39 AM
It could be that the initial excitement is sort of over, most active people may be a little burned out, and generally this may be a start of the next phase, perhaps going to a steady-state. This has to happen at some point anyways, IMO. But it is hard to judge by only a couple of days, particularly weekend.
 
The guys who hang around at SO still try to point to here, no?
 
Must be going now... will rejoin later...
 
@JM There are hardly any mathematica questions being asked on SO lately
 
Somebody's asking me how to remove the CDF player in Linux. I tried searching at wolfram.com, but I can't seem to see relevant docs. Any help?
 
The whole player or just the plugin for browsers?
 
11:48 AM
The entire thing.
 
Delete the install-path and the symbolic links
 
They would be usually located where?
 
There is no browser-plugin for Linux, is there?
Under /usr/local/Wolfram/
But I'm not home currently and cannot check
 
I'll pass it on; thanks.
 
@halirutan I don't know, I'm on OS X
 
11:51 AM
@Heike I'm on OSX here too in the university.
 
You have Macs at the university?
 
Yes, we are a separate department and are equipped with Macs.
 
Lucky you
What department are you in?
 
Funny, I wouldn't have associated medicin with Macs
 
11:57 AM
@Heike it's even better, because since I'm in image-processing I got not only a ...mac..., I got a MAAAC, if you know what I mean.
 
@halirutan One of those 27 inch monsters?
 
@halirutan You live a charmed life... :)
 
I know a married couple who work for the same department. Every time one of them buys a new mac the other one has to get one slightly better.
 
@Heike I have 2 of them, yes. And be sure, I know how lucky I am that I have such working conditions.
 
@halirutan are you a postdoc there?
 
12:06 PM
@Szabolcs It's complicated, but no.
 
@halirutan Aaah you worked with Jens-Peer Kuska
 
@Szabolcs We are the image-processing unit of the dep. working interdisciplinarily with all the biological/medical experimenters there.
 
"Jens-Peer Kuska" - ah... that's a name I remember...
 
@Szabolcs yep, that's why it's complicated.
I try to put my diss together with the help of the physics-dep because otherwise I would have no mentor.
 
mathematica.stackexchange.com/questions/1643/… <---- I wonder why this got a downvote. True, it is a duplicate, and it needed to be closed, but it is a reasonable question. Downvotes and close votes shouldn't be mixed.
 
12:16 PM
Odd...
 
Finaly.. I got Eclipse, Workbench-plugin, CTD, Subclipse and cmake support working nicely together.
 
@halirutan sounds nasty
 
Now I have code-analysis for C++ which was not working, since I'm using CMake. Yesterday I had enough and looked everything up
 
@halirutan Here's a somewhat unusual example where both default patterns and named patterns are used. It is highlighted perfectly. mathematica.stackexchange.com/a/1572/12
 
12:40 PM
I know I am going to need 8 point type in the majority of figures. SetOptions[Graphics, BaseStyle -> {FontSize -> 8}] does not seem to affect any plotting functions such as Plot. Do I really need to either SetOptions on all plotting functions or give an explicit BaseStyle for all my plots?
 
@Szabolcs If the next 2 weeks nothing really buggy shows up, I'll write Mike Samuel again and ask whether we can include it in prettify.
 
@halirutan Sounds great! Did you say you wrote him but he didn't reply in email yet? If that's the case perhaps he's not reading the email address you wrote to.
 
@Szabolcs But we already communicated over this address. But have to admin, my second email was quite long (Leonid style ;-) and I tend sometimes too, to ignore looong emais a while.
 
@Szabolcs Sounds like a good question for main...
 
@JM I think this came up before, I should do my homework and research it ... but right now it's simpler to just copy and paste BaseStyle everywhere, as ugly as that is
 
1:10 PM
Wow, that question took long to construct... I sure hope it's not dumb.
 
1:21 PM
@JM What is a scratch array?
 
@Szabolcs :
SetOptions[
 $FrontEnd,
 GraphicsBoxOptions ->
  {BaseStyle -> {FontSize -> 8}}
]
If you want to post a question be my guest. :D
 
@Szabolcs Well, the scratch array is what stands for the two-dimensional array in the triangular recursion.
If you look at the general formula, you have three quantities that always form a triangle in the array. The clever idea is that instead of using an explicit two-dimensional array like the one depicted, you have a one-dimensional array that is gradually overwritten by "lower left-upper right" diagonals as the algorithm proceeds.
 
1:37 PM
sorry, I was called away
Ah, got some work to do, maybe i the afternoon ...
 
Does that Option do what you want?
J.M. that is an interesting question. I cannot think of a better general way to do that besides the Do loops.
 
@MrWizard I realized that SetOptions[Graphics, BaseStyle -> ...] does work in most of the cases
 
@MrWizard I've been thinking about those algorithms, on and off, for the past five years. A good solution would be quite useful, as you might surmise from the examples I gave.
 
1:56 PM
Time to sleep. G'night all.
 
@MrWizard Come on, it's 3 o'clock in the afternoon! ;-)
@MrWizard Good night.
 
See ya, Wizard!
 
2:48 PM
@JM Do you consider mine as something that uses a 2D array too? (It doesn't, but it keep re-allocating, so it's just as bad)
(not storage wise, but for speed)
@JM It's always possible to package up the recursion into a function (like what I did), but it is not necessarily pretty.
 
Triangular methods always take $O(n^2)$ effort, so the speed is probably not something to be too concerned about.
 
(I mean the function is not pretty inside)
 
@Szabolcs Yeah, it seems to recreate a new list with every pass of Nest[], no?
(Am I supposed to chalk this up as a triumph of procedural programming?)
 
@JM Yes, it re-allocates. But that is quite common in Mathematica, one could say it's the usual way of working.
Yes..
I guess
 
...'cause this is actually one of the simplest two-index recursions I'm studying. Only three terms.
 
2:53 PM
@JM Well, "functional" means that we transform the whole expression in one go instead of changing elements of a mutable array one by one. We could try to write the whole thing in a way that it could be directly translated to something that doesn't require re-allocation of arrays, but I don't think it's worth it since we don't know what Mathematica does in the background
for example, does f /@ list re-allocate list, or does it replace it with the result?
if list is not used anywhere else, it could just be smart an replace instead of make a new list, copy results, then destroy the old list
But I don't know if Mathematica is smart enough to do that, and when using this style of programming I guess we don't have much control over whether the system/compiler will do that or not
 
@Szabolcs Hmm, you're right... *sigh*.
 
@JM Check out the code I use in creating a RationalInterpolation via Baker. It isn't the speediest thing in the world, and I don't recommend it, in general, but it isn't a bad starting point.
 
It just feels funny that my Mathematica implementations are direct translations of old code I wrote in more "traditional" languages...
@rcollyer Ah, that's the next complicated thing after triangular recursions.
The general terminology is "lozenge recursion" or "rhomboidal recursion".
 
@JM in this case, it uses a triangular recursion, so insights into how it is sped up should work.
 
You now have four terms in the array joined in a rhombus, as opposed to three terms joined in a triangle.
 
2:57 PM
@JM If you show me that recursion formula with the nice triangular table, I tend to write something like the Nest in my answer when using Mathematica. If you show me the code only, I'd tend to write Do loops as well.
 
@Szabolcs You think I should have included the actual mathematical formulae as well? I thought it was in the links I gave...
 
What I find particularly interesting is that if you look at the RationalInterpolation` package, you find that they do it via a least squares fit. So, I think that logic may be extendable to more general recursive forms.
 
@rcollyer You know of Wynn's algorithm, don't you?
 
@JM No, you misunderstood me. I was just trying to explain how I think. When I see something similar to that general recursion formula you included, I am likely to write Nest.
 
@JM I've run across it, I think, but I didn't look into it very deeply.
 
3:01 PM
@Szabolcs Ah. I was going for a generic method, since the two terms producing the third term can be combined in rather complicated ways.
@rcollyer Wynn's algorithm is pretty much one of the simplest methods for generating Padé approximants.
 
Yes. I translated that generic one, so you only need to supply f.
Let me extend my answer with the other two algorithms inplemented as well.
 
@rcollyer You might mostly know it as one of the methods NSum[] supports, but it's in fact a way to transform series to Padé approximants.
@Szabolcs Thanks. :)
 
@JM Definitely seen it. The algorithm in Baker comes from Thiel, but covers very similar ground. The method in the package is somewhat different, though.
 
Aha. Thiele rational interpolation is the one that uses reciprocal differences, no? That's a lozenge recursion, too.
 
I have to look at it again, but I thought it was just triangular.
 
3:08 PM
Here is a mathematical description of reciprocal differences, for Thiele interpolation.
Note that there are four $\rho$ terms. If you depict them in an array similar to the one in my question, they form the corners of a lozenge.
Wynn is in fact a bit more stripped down than that. Let me look for my Mathematica implementation...
 
So they do. Oh well, the advice of looking at the RationalInterpolation` package is still good though.
 
Yes, I'll do a comparison with how I do lozenge recursions. Thanks for the pointer. :)
Ah, here it is.
Richardson extrapolation is still another example of a triangular recursion.
 
Absolutely. I remember coding that up in c++ for my numerical analysis class.
matlab? who's posting a matlab question here?
 
If you delete the checks for zero denominator, you have essentially a compact way to produce Padé approximants in wynnEpsilon[]. (Reminds me, I should write up something sometime...)
 
@JM A colleague sent me his code for an approximation I was attempting to use (won't finish it in time to graduate :( ), but it includes some notes on least squares fitting for Pade. Would you like a copy of the notes?
 
3:17 PM
@rcollyer That'd be swell. My e-mail's in my profile. :)
Is it a Toeplitz method, or something else?
 
I'm not sure, I haven't read it that close.
 
:3383433 User name's right; domain is wrong in the second letter.
 
you're right. I didn't flip it.
@JM domain name failure. is this correct: tnzro.xln?
 
Yay, I'm a trusted user.
 
@rcollyer Yep, you got it.
 
3:26 PM
@Heike what are you going to do with all the power?
@JM That came up with a dns error.
 
@rcollyer Haven't decided yet.
 
@Heike terrorizing small villages is always a valid option.
 
That's odd...
...and it's supposed to be such a reliable company, too.
 
this is via my school account, so it is through gmail.
 
@rcollyer Reminds me of a spongebob episode
 
3:29 PM
@Heike I've only watched a couple of episodes, so I'm afraid I'm lost.
 
@rcollyer One of the characters in spongebob is a amoeba trying to take over the world
 
@JM running what I had through that gives me a something readable in english. correct?
 
@rcollyer definitely.
 
@Heike I preferred Pinky and the Brain.
 
@rcollyer I like pinky and the brain, but the absurdity of Spongebob really appeals to me for some reason.
 
3:34 PM
@JM sent. let me know if you get it.
@Heike I can understand that.
 
Can't relate; The Fairly Oddparents was the one cartoon that made me both laugh and think... :D
 
@JM I like Fairly Oddparents as well.
 
Never watched it.
 
@rcollyer Ah, so he did have to solve a Toeplitz linear system...
 
@JM Is that soluble via FFT, or am I thinking of circulant matrices?
 
3:40 PM
@rcollyer Circulant matrices are a very special kind of Toeplitz matrix. I do remember research in FFT methods for general Toeplitz systems, but they always have one little trip up or two.
...but circulant matrices, no problem.
 
So, at least my memory was in the ball park.
 
(I think there were at least two articles in SIAM Review that attempted to do a general analysis of FFT methods for Toeplitz systems.)
 
My membership in SIAM lapsed, apparently I've spent to long in grad school to continue to qualify for reduced cost. I'll have to rejoin just for the SIAM Review.
 
...your institution doesn't have a SIAM subscription? How about JStor?
 
@JM it does. Just with the student membership, I got a print copy. I prefer print to online.
 
3:45 PM
Ah, I can understand that. :) I always have to print things out these days myself...
 
what are we doing with Toeplitz matrices now?
 
I have ~6-8 paper boxes full of papers from my office for my research. So, there's an argument to be made for online, too. But, nothing beats paper for note taking, like outlining a particularly odd line and writing "wtf?" on the page.
 
@yoda Well, rcollyer brought up Padé approximants and rational interpolation. I said that the recursions for those are "lozenge recursions" (four terms) instead of "triangular recursions" (three terms).
...and since you can also get the coefficients of a Padé approximant by solving a Toeplitz system... yeah, the math is intricate, I have to agree. :D
...anyway, I will have to look at rcollyer's code; if anything, I might be able to adapt it for a possibly better implementation of Wynn $\epsilon$.
 
NestWhile is the cause of the exponential time for my code. So, if you can find a way to eliminate that, you probably will have a decent speed code.
 
(Okay, I'll throw in a confession: I was planning to ask about lozenge recurrences next if the triangular recursion question was wildly successful...)
 
3:53 PM
@JM So, I just need to talk about their relationship to Toeplitz matrices, and I'll get votes?!? Then, !!Profit!!
 
@rcollyer That would be a sticking point, yes. Triangular and lozenge recursions are supposed to be only $O(n^2)$.
 
Timings of it showed a straight line on a log-log plot, so yes it was icky.
 
@rcollyer You've seen how thick Baker's book is, no? ;) Or that that wasn't the only book he wrote (also with Graves-Morris)... >:)
The relationship is so intricate, they managed to write a whole gorram set of books...
 
@JM The book on pade approximations is only just over 300 pages, so quite short.
I meant to include the link.
 
Ah. That's the "lite" version of that thing he wrote with Graves-Morris. :)
 
3:57 PM
Oh God. I can't imagine.
Now I can: 700+ pages. ick.
 
I might sound like I've already done a lot with these things, but I'm sure there's still a lot of hidden chestnuts in those... that I still don't have an effing clue.
 
Probably as bad as reading Jackson.
@JM you're a hobbyist after all ... :P
 
@rcollyer :D
 
Have you ever published in the math literature?
Or, the chem lit for that matter?
 
@rcollyer For math, there was this math.SE question that led to a joint paper...
@rcollyer Chem, not really. I've mostly been limited to company-only tech reports.
 
4:00 PM
@JM cool. reference?
@JM I understand how that goes.
 
@rcollyer it's still being reviewed by a referee, last I checked. But there's a preprint floating around the 'net...
 
Incidentally, that matlab question got labelled mma on SO. I fixed that real fast.
@JM gotta love referees.
 
@rcollyer Thanks. :) Apparently migrating won't let you comment afterwards...
 
@JM to horribly disfigure a quote: "we don't need no stinking matlab!"
 
Mmm-hmmm...
 
4:04 PM
Well I should get some work done here. Glad the notes seemed useful.
Later.
 
@rcollyer See ya.
@Szabolcs: now that I think about it, your method would indeed quickly apply to Akiyama-Tanigawa and de Casteljau. Most of the other triangular recursions would indeed be slightly problematic, though, since the multipliers depend on both loop indices.
 
@JM I made an update with de Casteljau, I got something wrong in the interpolation though
 
@Szabolcs I'm rendering something at the moment, so I might only be able to test later. Thanks for the attention!
 
@JM You can start a second kernel :) If your license lets you :(
 
@Szabolcs Even if I could, I don't think my netbook will bear it properly. Firefox is also taking up quite a bit of CPU time...
:)
 
4:17 PM
Anyway, starting a new kernel in the same front end is not always a good idea while a long computation is ongoing
too easy to mess something up and ruin the calculation (e.g. Dynamic freezing up the FE)
 
yeah...
 
5:03 PM
0
Q: LaTeX, $\LaTeX$ or $\mathrm{\LaTeX}$?

celtschkWhat is the preferred way to write the name "LaTeX" on this site? A few questions use $\LaTeX$ in order to get the LaTeX name; however that looks wrong to me because it makes the letters italics, which isn't the case with the "proper" typeset name. You can get that name with $\mathrm{\LaTeX}$ whi...

 
5:21 PM
hello @SjoerdCdeVries
busy these days?
 
5:59 PM
@yoda Hi Yoda. Yes, I've got less free time to spend here than I used to. You can see it in my rep.
 
01:00 - 18:0018:00 - 23:00

« first day (26 days earlier)      last day (4459 days later) »