Timeline for Approximating with translated Gaussians and low-frequency trig functions
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 9, 2010 at 16:48 | vote | accept | Axel Boldt | ||
| Feb 3, 2010 at 5:12 | answer | added | gondolier | timeline score: 2 | |
| Dec 20, 2009 at 6:39 | answer | added | Mark Lewko | timeline score: 5 | |
| Dec 17, 2009 at 4:59 | answer | added | Greg Kuperberg | timeline score: 7 | |
| Dec 17, 2009 at 3:57 | history | edited | Axel Boldt | CC BY-SA 2.5 |
giving proof idea, adding question about folklore
|
| Dec 16, 2009 at 21:00 | comment | added | Yemon Choi | While I don't have an answer to your question: any time one sees a family having dense linear span in a function space, it's natural to wonder if this isn't a case of "approximation by convolution with a suitable kernel". E.g. trig polys are dense in C(T) - convolve with Fejer kernel. Of course the striking thing in your result is that one doesn't need to dilate/shrink the Gaussians, so I'm not sure if what I've said is all that relevant | |
| Dec 16, 2009 at 16:35 | history | edited | Axel Boldt |
added two tags
|
|
| Dec 15, 2009 at 18:12 | history | asked | Axel Boldt | CC BY-SA 2.5 |