Re: caching of transforms used for large multiplications
Daniel Lichtblau writes: I simply have no idea why you would choose to take such offense. If it serves any purpose, it is one I quite fail to see. That said, I'll not trouble you with further communication. If you cannot assume a professional attitude on the GMP lists, but instead use them to express personal dislike, then you should indeed stay away. If on the other hand, you stick to technical issues around GMP, then you are as welcome to use these lists as anybody. (I will provide no further comment on this debacle on this list.) -- Torbjörn ___ gmp-devel mailing list gmp-devel@gmplib.org http://gmplib.org/mailman/listinfo/gmp-devel
Re: caching of transforms used for large multiplications
On 06/14/2013 02:27 PM, Torbjorn Granlund wrote: Daniel Lichtblau writes: If you do not manage to locate them I can scan and send a pdf. (Least I can do for someone who shared a room for two months with that Torbjörn fellow..) I started to write a reply, but decided against sending it after I read this unprovoked highly offensive comment. You're using your Wolfram Research address for this awful comment. Is that in line with Wolfram Research corporate policies? Note to innocent bystanders: I met Daniel Lichtblau at ICMS 2006 and chatted with him perhaps 10 minutes, with several other people around, including Niels. We don't know each other. Actually we do know each other. We also met at ISSAC in 2007, sat together along with 4-5 others at the conference dinner, and also spoke for an hour or so after the conference ended, along with a couple of other people who are active with GMP (you may recall that, for our respective reasons, neither of us joined the post-conference tour of MapleSoft). You were a visitor here later in 2007; arranging for this at our end was in part at my request. You spent some time, (half an hour?) in my office. We've had some amount of email correspondence since that time, in 2008-09. Not much, but some. So this is, to say the least, a peculiar statement on your part. Let me address concerns you raise. First, I'm fairly sure readers will understand that no offense was intended. While I actually possess a separate account, I use my company email for pretty much everything; I'm maybe 2-3 decades behind modernity in terms of social networking, electronic technology, and the like. Given the particulars of the correspondence in question, I doubt corporate policy would have much bearing (try to put yourself in the shoes of a manager at any company, research institute, government lab, etc.). Actually, over the years, I've received some amount of correspondence from sci.math.symbolic and comp.soft-sys.math.mathematica readers telling me how remarkably mild I have been in certain threads of a flame-bait nature. I simply have no idea why you would choose to take such offense. If it serves any purpose, it is one I quite fail to see. That said, I'll not trouble you with further communication. Daniel Lichtblau ___ gmp-devel mailing list gmp-devel@gmplib.org http://gmplib.org/mailman/listinfo/gmp-devel
Re: caching of transforms used for large multiplications
On 06/14/2013 12:02 PM, Philip McLaughlin wrote: Daniel Lichtblau wrote: That said, I confess I am not sure there is much need for this outside of subquadratic gcd code. If it is not more generally useful, then I guess this automation would only be of benefit to a limited set of users. (Like, maybe four of us.) Years ago I published a paper in Math. Comp. which showed (Variation 2.) how to use both cyclic and negacyclic transforms in the context of Montgomery multiplication. The re-use of forward transforms, for example in powering algoorithms, was specifically mentioned. See http://www.ams.org/journals/mcom/2004-73-246/S0025-5718-03-01543-6/S0025-5718-03-01543-6.pdf Unfortunately I've never had the time to actually implement the method so I don't know how useful it might be in practice. Regards, Phil McLaughlin Thanks, I'll have a look at that reference. Daniel Lichtblau ___ gmp-devel mailing list gmp-devel@gmplib.org http://gmplib.org/mailman/listinfo/gmp-devel
Re: caching of transforms used for large multiplications
Daniel Lichtblau writes: If you do not manage to locate them I can scan and send a pdf. (Least I can do for someone who shared a room for two months with that Torbjörn fellow..) I started to write a reply, but decided against sending it after I read this unprovoked highly offensive comment. You're using your Wolfram Research address for this awful comment. Is that in line with Wolfram Research corporate policies? Note to innocent bystanders: I met Daniel Lichtblau at ICMS 2006 and chatted with him perhaps 10 minutes, with several other people around, including Niels. We don't know each other. -- Torbjörn ___ gmp-devel mailing list gmp-devel@gmplib.org http://gmplib.org/mailman/listinfo/gmp-devel
Re: caching of transforms used for large multiplications
Daniel Lichtblau wrote: > That said, I confess I am not sure there is much need for this outside > of subquadratic gcd code. If it is not more generally useful, then I > guess this automation would only be of benefit to a limited set of > users. (Like, maybe four of us.) Years ago I published a paper in Math. Comp. which showed (Variation 2.) how to use both cyclic and negacyclic transforms in the context of Montgomery multiplication. The re-use of forward transforms, for example in powering algoorithms, was specifically mentioned. See http://www.ams.org/journals/mcom/2004-73-246/S0025-5718-03-01543-6/S0025-5718-03-01543-6.pdf Unfortunately I've never had the time to actually implement the method so I don't know how useful it might be in practice. Regards, Phil McLaughlin ___ gmp-devel mailing list gmp-devel@gmplib.org http://gmplib.org/mailman/listinfo/gmp-devel
