Alan Edelman
Alan Edelman
Your assertions 1 and 2 are true, your conclusion is not.
fft's are not any more difficult to verify numerically than anything else
can we have a download and upload to YouTube / GitHub?
We must have a yamper  as well as a philip
in my view, it's more than using computers to model mathematics, it's ideally how computer language leverages ones abilities in this direction so it's more than engineering which is about...
Cute On Jan 10, 2015 6:00 PM, "Jiahao Chen" [email protected] wrote: > ... is in complex arithmetic. > > Should Complex(Inf, 0.0) == Complex(Inf, Inf)? > > Sometimes, people want...
Does this appear anywhere? 
i would start with adding two GUE's and doing an extended Airy process with two time points for example, from https://www.emis.de/journals/EJP-ECP/article/download/1074/1074-3531-1-PB.pdf take m=2 in Section II
add to dimitris notebook
i'd love for performance guidance right on top of when an svd from elemental might be beneficial --- example a statement that suggests that at least on one machine with...