Skip to main content
10 events
when toggle format what by license comment
Apr 13, 2017 at 12:19 history edited CommunityBot
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
Mar 24, 2016 at 22:57 comment added reuns @SilviaGhinassi : the wavelet transform is not so simple to compute, that's why I told you to look at the discrete (Haar) wavelet transform (the normal Haar wavelet transform for a function being constant on any $[2^{-k}n,2^{-k}(n+1)[$ interval) which has the same complexity as the discrete Fourier transform, and indeed the algorithms are very very close, and for both there exists the fast transforms (FFT and fast wavelet transform) which are even closer
Mar 24, 2016 at 21:20 history edited Silvia Ghinassi CC BY-SA 3.0
deleted 146 characters in body
Mar 24, 2016 at 21:13 history edited Silvia Ghinassi CC BY-SA 3.0
deleted 146 characters in body
Mar 24, 2016 at 21:06 history edited Silvia Ghinassi CC BY-SA 3.0
deleted 146 characters in body
Feb 20, 2016 at 9:10 answer added Jean Duchon timeline score: 1
Feb 18, 2016 at 14:20 comment added Silvia Ghinassi Let me say it better: I am attached to the simplicity of computation, because I am attached to the nice geometric interpretation I can give it. @JeanDuchon
Feb 18, 2016 at 14:03 comment added Silvia Ghinassi Yeah, I am in $\mathbb R$, and besides that, any coefficient that depends on something smoother (like Fourier ones), seems to me that the become much harder to compute (using the Haar system all you have to do is subtraction and division of some values of my function). But, maybe I am wrong, and my problem is exactly insisting in Haar wavelets.
Feb 18, 2016 at 12:17 comment added Jean Duchon You seem to insist at expressing (or framing) some norm of $f''$ as a sum of wavelet coefficients, and this is certainly possible with any smooth enough wavelet (not just the Haar system, then). But why not just use the Fourier base on an interval ? Or do you mean $L^2(\mathbb R)$ ?
Feb 17, 2016 at 23:25 history asked Silvia Ghinassi CC BY-SA 3.0