|
|
| Line 1: |
Line 1: |
| In [[mathematics]], the '''Fourier inversion theorem''' says that for many types of function it is possible to recover a function from its [[Fourier transform]]. Intuitively it may be viewed as the statement that if we know all [[frequency#Frequency_of_waves|frequency]] and [[phase (waves)|phase]] information about a wave then we may reconstruct the original wave precisely.
| | On-line games can give you a meaningful universe of experience, relax and exhilaration. You may learn, get a comman sense of success or merely enjoy beating down a bad-guy. No challenege show up form of video egaming you are into, are definitely the helpful tips in the foregoing post to give one self more fun whenever a play your next activity Website.<br><br>To comprehend coins and gems, creosote is the obtain the Clash behind Clans hack equipment by the clicking on the get a hold of button. Contingent on [http://search.usa.gov/search?query=operating+framework operating framework] that tend to be utilizing, you will do the trick the downloaded document mainly because admin. Furnish my log in Id and select the gadget. Subsequent to this, you are enter into the quantity of diamonds or coins that you should have and start off the Clash of Clans hack into instrument.<br><br>Nevertheless, if you want to prevent at the top of the competitors, there are a few simple points you need to keep in mind. Realize your foe, know which game and the triumph will be yours. It is possible to look at the aid of clash of clans hack tools and other rights if you as in your course. Absolutely for your convenience, allow me to share the general details in this particular sport that you need to remember of. Read all of them quite carefully!<br><br>On line games acquire more regarding offer your son or daughter than only the possibility to capture points. Try deciding on adventure titles that instruct your nipper some thing. Given that an example, sports physical exertions video games will be of assistance your youngster learn our own [http://Www.guardian.co.uk/search?q=guidelines guidelines] for game titles, and exactly how web-based games are played out and. Check out some testimonials to assist you to discover game titles that can supply a learning skill instead of just mindless, repeated motion.<br><br>The nfl season is here and also going strong, and similar many fans we for an extended time for Sunday afternoon when the games begin. In case you beloved this informative article as well as you want to receive more details relating to [http://prometeu.net clash of clans hack free gems] i implore you to pay a visit to our own web-page. If you have played and liked Soul Caliber, you will love this skill game. The next best is the Food Cell which will with little thought fill in some piazzas. Defeating players similar to that of that by any involves necessary can be currently the reason that pushes folks to use Words that has Friends Cheat. The app requires you within order to answer 40 questions considering varying degrees of difficulty.<br><br>In are playing a utilizing game, and you don't have any experience with it, set the difficulty even to rookie. This is considered help you pick moving up on the unique makes use of of the game in addition to the learn your way close by the field. In the case when you set it large than that, you tend to be to get frustrated to not have any awesome.<br><br>Now you have read this composition, you need to the easier time locating as well as a loving video games to you. Notwithstanding your favored platform, from your cellphone on the own computer, playing as well as a enjoying video gaming allow you to take the benefit of the worries of the particular busy week get details. |
| | |
| The theorem says that if we have a function {{math|''f'': ℝ<sup>''n''</sup>→ℂ}} satisfying certain conditions, and we use the [[Fourier transform#convention|convention for the Fourier transform]] that
| |
| | |
| :<math>(\mathcal{F}f)(\xi):=\int_{\mathbb{R}^n} e^{-2\pi iy\cdot\xi} \, f(y)\,dy,</math>
| |
| | |
| then
| |
| | |
| :<math>f(x)=\int_{\mathbb{R}^n} e^{2\pi ix\cdot\xi} \, (\mathcal{F}f)(\xi)\,d\xi.</math>
| |
| | |
| In other words, the theorem says that
| |
| | |
| :<math>f(x)=\int_{\mathbb{R}^n} \int_{\mathbb{R}^n} e^{2\pi i(x-y)\cdot\xi} \, f(y)\,dy\,d\xi.</math>
| |
| | |
| This last equation is called the '''Fourier integral theorem'''.
| |
| | |
| Another way to state the theorem is note that, if {{math|''R''}} is the flip operator i.e. {{math|1=''Rf''(''x''):=''f''(−''x'')}}, then
| |
| | |
| :<math>\mathcal{F}^{-1}=\mathcal{F}R=R\mathcal{F}.</math>
| |
| | |
| The theorem holds if both {{math|''f''}} and its Fourier transform are absolutely integrable (in the [[Lebesgue integration|Lebesgue sense]]) and {{math|''f''}} is continuous at the point {{math|''x''}}. However, even under more general conditions versions of the Fourier inversion theorem hold. In these cases the integrals above may not make sense, or the theorem may hold for [[almost all]] {{math|''x''}} rather than for all {{math|''x''}}.
| |
| | |
| ==Statement==
| |
| | |
| In this section we assume that {{math|''f''}} is an integrable continuous function. Use the [[Fourier transform#convention|convention for the Fourier transform]] that
| |
| | |
| :<math>(\mathcal{F}f)(\xi):=\int_{\mathbb{R}^n} e^{-2\pi iy\cdot\xi} \, f(y)\,dy.</math>
| |
| | |
| Furthermore, we assume that the Fourier transform is also integrable.
| |
| | |
| ===Inverse Fourier transform as an integral===
| |
| | |
| The most common statement of the Fourier inversion theorem is to state the inverse transform as an integral. For any integrable function {{math|''g''}} and all {{math|''x''∈ℝ<sup>''n''</sup>}} set
| |
| | |
| :<math>\mathcal{F}^{-1}g(x):=\int_{\mathbb{R}^n} e^{2\pi ix\cdot\xi} \, g(\xi)\,d\xi.</math>
| |
| | |
| Then for all {{math|''x''∈ℝ<sup>''n''</sup>}} we have
| |
| | |
| :<math>\mathcal{F}^{-1}(\mathcal{F}f)(x)=f(x).</math>
| |
| | |
| ===Fourier integral theorem=== | |
| | |
| The theorem can be restated as
| |
| | |
| :<math>f(x)=\int_{\mathbb{R}^n} \int_{\mathbb{R}^n} e^{2\pi i(x-y)\cdot\xi} \, f(y)\,dy\,d\xi.</math>
| |
| | |
| If {{math|''f''}} is real valued then by taking the real part of each side of the above we obtain
| |
| | |
| :<math>f(x)=\int_{\mathbb{R}^n} \int_{\mathbb{R}^n} \cos (2\pi (x-y)\cdot\xi) \, f(y)\,dy\,d\xi.</math>
| |
| | |
| ===Inverse transform in terms of flip operator===
| |
| | |
| For any function {{math|''g''}} define the flip operator<ref group="note">An [[operator (mathematics)|operator]] is a transformation that maps functions to functions. The flip operator, the Fourier transform, the inverse Fourier transform and the identity transform are all examples of operators.</ref> {{math|''R''}} by
| |
| | |
| :<math>Rg(x):=g(-x).</math>
| |
| | |
| Then we may instead define
| |
| | |
| :<math>\mathcal{F}^{-1}f := R\mathcal{F}f = \mathcal{F}Rf.</math>
| |
| | |
| It is immediate from the definition of the Fourier transform and the flip operator that both <math>R\mathcal{F}f</math> and <math>\mathcal{F}Rf</math> match the integral definition of <math>\mathcal{F}^{-1}f</math>, and in particular are equal to each other and satisfy <math>\mathcal{F}^{-1}(\mathcal{F}f)(x)=f(x)</math>.
| |
| | |
| ===Two sided inverse===
| |
| | |
| The form of the Fourier inversion theorem stated above, as is common, is that
| |
| | |
| :<math>\mathcal{F}^{-1}(\mathcal{F}f)(x) = f(x).</math>
| |
| | |
| In other words, <math>\mathcal{F}^{-1}</math> is a left inverse for the Fourier transform. However it is also a right inverse for the Fourier transform i.e.
| |
| | |
| :<math>\mathcal{F}(\mathcal{F}^{-1}f)(\xi) = f(\xi).</math>
| |
| | |
| Since <math>\mathcal{F}^{-1}</math> is so similar to <math>\mathcal{F}</math>, this follows very easily from the Fourier inversion theorem (changing variables {{math|1=''ζ'':=−''ξ''}}):
| |
| | |
| :<math>\begin{align}
| |
| f & =\mathcal{F}^{-1}(\mathcal{F}f)(x)\\
| |
| & =\int_{\mathbb{R}^{n}}\int_{\mathbb{R}^{n}}e^{2\pi ix\cdot\xi}\,e^{-2\pi iy\cdot\xi}\, f(y)\, dy\, d\xi\\
| |
| & =\int_{\mathbb{R}^{n}}\int_{\mathbb{R}^{n}}e^{-2\pi ix\cdot\zeta}\,e^{2\pi iy\cdot\zeta}\, f(y)\, dy\, d\zeta\\
| |
| & =\mathcal{F}(\mathcal{F}^{-1}f)(x).
| |
| \end{align}</math>
| |
| | |
| Alternatively, this can be seen from the relation between <math>\mathcal{F}^{-1}f</math> and the flip operator and the [[associativity]] of [[function composition]], since
| |
| | |
| :<math>f = \mathcal{F}^{-1}(\mathcal{F}f) = \mathcal{F}R\mathcal{F}f = \mathcal{F} (\mathcal{F}^{-1}f).</math>
| |
| | |
| ==Conditions on the function==
| |
| | |
| When used in physics and engineering, the Fourier inversion theorem is often used under the assumption that everything "behaves nicely". In mathematics such heuristic arguments are not permitted, and the Fourier inversion theorem includes an explicit specification of what class of functions is being allowed. However, there is no "best" class of functions to consider so several variants of the Fourier inversion theorem exist, albeit with compatible conclusions.
| |
| | |
| ===Schwartz functions===
| |
| | |
| The Fourier inversion theorem holds for all [[Schwartz function]]s (roughly speaking, smooth functions that decay quickly and whose derivatives all decay quickly). This condition has the benefit that it is an elementary direct statement about the function (as opposed to imposing a condition on its Fourier transform), and the integral that defines the Fourier transform and its inverse are absolutely integrable. This version of the theorem is used in the proof of the Fourier inversion theorem for tempered distributions (see below).
| |
| | |
| ===Integrable functions with integrable Fourier transform===
| |
| | |
| The Fourier inversion theorem holds for all continuous functions that absolutely integrable (i.e. {{math|''L''<sup>1</sup>(ℝ<sup>''n''</sup>)}}) with absolutely integrable Fourier transform. This includes all Schwartz functions, so is a strictly stronger form of the theorem than the previous one mentioned. These conditions have the benefit that the integrals that define the Fourier transform and its inverse are absolutely integrable. This condition is the one used above in the [[#Statement|statement section]].
| |
| | |
| A slight variant is to drop the condition that the function {{math|''f''}} be continuous but still require that it and its Fourier transform are absolutely integrable. Then {{math|1=''f''=''g''}} [[almost everywhere]] where {{math|''g''}} is a continuous function, and <math>\mathcal{F}^{-1}(\mathcal{F}f)(x)=g(x)</math> for every {{math|''x''∈ℝ<sup>''n''</sup>}}.
| |
| | |
| ===Integrable functions in one dimension===
| |
| | |
| ; Piecewise smooth; one dimension
| |
| | |
| If the function is absolutely integrable in one dimension (i.e. {{math|''f''∈''L''<sup>1</sup>(ℝ)}}) and is piecewise smooth then a version of the Fourier inversion theorem holds. In this case we define
| |
| | |
| :<math>\mathcal{F}^{-1}g(x):=\lim_{R\to\infty}\int_{-R}^R e^{2\pi ix\xi}\,g(\xi)\,d\xi.</math>
| |
| | |
| Then for all {{math|''x''∈ℝ}}
| |
| | |
| :<math>\mathcal{F}^{-1}(\mathcal{F}f)(x) = \frac{1}{2}(f(x_-) + f(x_+)),</math>
| |
| | |
| i.e. <math>\mathcal{F}^{-1}(\mathcal{F}f)(x)</math> equals the average of the left and right limits of {{math|''f''}} at {{math|''x''}}. Note that at points where {{math|''f''}} is continuous this simply equals {{math|''f''(''x'')}}.
| |
| | |
| A higher dimensional analogue of this form of the theorem also holds, but according to Folland (1992) is "rather delicate and not terribly useful".
| |
| | |
| ; Piecewise continuous; one dimension
| |
| | |
| If the function is absolutely integrable in one dimension (i.e. {{math|''f''∈''L''<sup>1</sup>(ℝ)}}) but merely piecewise continuous then a version of the Fourier inversion theorem still holds. In this case the integral in the inverse Fourier transform is defined with the aid of a smooth rather than a sharp cut off function; specifically we define
| |
| | |
| :<math>\mathcal{F}^{-1}g(x):=\lim_{R\to\infty}\int_{\mathbb{R}} \varphi(\xi/R)\,e^{2\pi ix\xi}\,g(\xi)\,d\xi,\qquad\varphi(\xi):=e^{-\xi^2}.</math>
| |
| | |
| The conclusion of the theorem is then the same as for the piecewise smooth case discussed above.
| |
| | |
| ; Continuous; any number of dimensions
| |
| | |
| If {{math|''f''}} is continuous and absolutely integrable on {{math|ℝ<sup>n</sup>}} then the Fourier inversion theorem still holds so long as we again define the inverse transform with a smooth cut off function i.e.
| |
| | |
| :<math>\mathcal{F}^{-1}g(x):=\lim_{R\to\infty}\int_{\mathbb{R}^n} \varphi(\xi/R)\,e^{2\pi ix\cdot\xi}\,g(\xi)\,d\xi,\qquad\varphi(\xi):=e^{-\vert\xi\vert^2}.</math>
| |
| | |
| The conclusion is now simply that for all {{math|''x''∈ℝ<sup>n</sup>}}
| |
| | |
| :<math>\mathcal{F}^{-1}(\mathcal{F}f)(x)=f(x).</math>
| |
| | |
| ; No regularity condition; any number of dimensions
| |
| | |
| If we drop all assumptions about the (piecewise) continuity of {{math|''f''}} and assume merely that it is absolutely integrable, then a version of the theorem still holds. The inverse transform is again be define the smooth cut off, but with the conclusion that
| |
| | |
| :<math>\mathcal{F}^{-1}(\mathcal{F}f)(x) = f(x)</math>
| |
| | |
| for [[almost every]] {{math|''x''∈ℝ}}.
| |
| | |
| ===Square integrable functions===
| |
| | |
| In this case the Fourier transform cannot be defined directly as an integral since the it may not be absolutely convergent, so it is instead defined by a density argument (see the [[Fourier_transform#On_Lp_spaces|Fourier transform article]]). For example, putting
| |
| :<math>g_k(\xi):=\int_{\{y\in\mathbb{R}^n:\left\vert y\right\vert\leq k\}} e^{-2\pi iy\cdot\xi} \, f(y)\,dy,\qquad k\in\mathbb{N},</math>
| |
| we can set <math>\textstyle\mathcal{F}f := \lim_{k\to\infty}g_k</math> where the limit is taken in the {{math|''L''<sup>2</sup>}} norm. The inverse transform may be defined by density in the same way or by defining it terms of the Fourier transform and the flip operator. We then have
| |
| | |
| :<math>f(x)=\mathcal{F}(\mathcal{F}^{-1}f)(x)=\mathcal{F}^{-1}(\mathcal{F}f)(x)</math>
| |
| | |
| for [[almost every]] {{math|''x''∈ℝ}}.
| |
| | |
| ===Tempered distributions===
| |
| | |
| The Fourier transform [[Fourier transform#Tempered_distributions|may be defined on the space of tempered distributions]] <math>\mathcal{S}'(\mathbb{R}^n)</math> by duality of the Fourier transform on the space of Schwartz functions. Specifically for <math>f\in\mathcal{S}'(\mathbb{R}^n)</math> and for all test functions <math>\varphi\in\mathcal S(\mathbb{R}^n)</math> we set | |
| :<math>\langle \mathcal{F}f,\varphi\rangle := \langle f,\mathcal{F}\varphi\rangle,</math>
| |
| where <math>\mathcal{F}\varphi</math> is defined using the integral formula. If {{math|''f''}} is a function in {{math|''L''<sup>1</sup>+''L''<sup>2</sup>}} then this agrees with the usual definition. We may define the inverse transform <math>\mathcal{F}^{-1}\colon\mathcal{S}'(\mathbb{R}^n)\to\mathcal{S}'(\mathbb{R}^n)</math>, either by duality from the inverse transform on Schwartz functions in the same way, or by defining it in terms of the flip operator (where the flip operator is defined by duality). We then have
| |
| | |
| :<math>\mathcal{F}\mathcal{F}^{-1} = \mathcal{F}^{-1}\mathcal{F} = \operatorname{Id}_{\mathcal{S}'(\mathbb{R}^n)}.</math>
| |
| | |
| ==Relation to Fourier series==
| |
| | |
| :''When considering the Fourier series of a function it is conventional to rescale it so that it acts on ''{{math|[0,2''π'']}}'' (or is ''{{math|2''π''}}'' periodic). In this section we instead use the somewhat unusual convention taking ''{{math|''f''}}'' to act on ''{{math|[0,1]}}'', since that matches the convention of the Fourier transform used here.''
| |
| | |
| The Fourier inversion theorem is analogous to the [[convergence of Fourier series]]. In the Fourier transform case we have | |
| :<math>f\colon\mathbb{R}^n\to\mathbb{C},\quad\hat f\colon\mathbb{R}^n\to\mathbb{C},</math>
| |
| :<math>\hat f(\xi):=\int_{\mathbb{R}^n} e^{-2\pi iy\cdot\xi} \, f(y)\,dy,</math>
| |
| :<math>f(x)=\int_{\mathbb{R}^n} e^{2\pi ix\cdot\xi} \, \hat f(\xi)\,d\xi.</math>
| |
| In the Fourier series case we instead have | |
| :<math>f\colon[0,1]^n\to\mathbb{C},\quad\hat f\colon\mathbb{Z}^n\to\mathbb{C},</math>
| |
| :<math>\hat f(k):=\int_{[0,1]^n} e^{-2\pi iy\cdot k} \, f(y)\,dy,</math>
| |
| :<math>f(x)=\sum_{k\in\mathbb{Z}^n} e^{2\pi ix\cdot k} \, \hat f(k).</math>
| |
| | |
| In particular, in one dimension {{math|''k''}} is simply an integer and the sum runs from {{math|−∞}} to {{math|∞}}.
| |
| | |
| ==Applications==
| |
| | |
| [[File:Commutative diagram illustrating problem solving via the Fourier transform.svg|thumb|400px|Some problems, such as certain differential equations, become easier to solve when the Fourier transform is applied. In that case the solution to the original problem is recovered using the inverse Fourier transform.]]
| |
| | |
| In [[Fourier transform#Applications|applications of the Fourier transforrm]] the Fourier inversion theorem often plays a critical role. In many situations the basic strategy is to apply the Fourier transform, perform some operation or simplification, and then apply the inverse Fourier transform.
| |
| | |
| More abstractly, the Fourier inversion theorem is a statement about the Fourier transform as an [[operator (mathematics)|operator]] (see [[Fourier transform#Fourier_transform_on_function_spaces|Fourier transform on function spaces]]). For example, the Fourier inversion theorem on {{math|''f''∈''L''<sup>2</sup>(ℝ<sup>''n''</sup>)}} shows that the Fourier transform is a unitary operator on {{math|''f''∈''L''<sup>2</sup>(ℝ<sup>''n''</sup>)}}.
| |
| | |
| ==Properties of inverse transform==
| |
| | |
| The inverse Fourier transform is extremely similar to the original Fourier transform: as discussed above, it differs only in the application of a flip operator. For this reason the [[Fourier transform#Properties_of_the_Fourier_transform|properties of the Fourier transform]] hold for the inverse Fourier transform, such as the [[Convolution theorem]] and the [[Riemann–Lebesgue lemma]].
| |
| | |
| [[Fourier transform#Tables_of_important_Fourier_transforms|Tables of Fourier transforms]] may easily be used for the inverse Fourier transform by composing the looked-up function with the flip operator. For example, looking up the Fourier transform of the rect function we see that
| |
| | |
| :<math>f(x)=\operatorname{rect}(a x) \quad \Rightarrow \quad (\mathcal{F}f)(\xi)=\frac{1}{|a|} \operatorname{sinc}\left(\frac{\xi}{a}\right)\!,</math>
| |
| | |
| so the corresponding fact for the inverse transform is
| |
| | |
| :<math>g(\xi)=\operatorname{rect}(a \xi) \quad \Rightarrow \quad (\mathcal{F}^{-1}g)(x)=\frac{1}{|a|} \operatorname{sinc}\left(-\frac{x}{a}\right)\!.</math>
| |
| | |
| ==Proof==
| |
| | |
| The proof uses a few facts.
| |
| | |
| # If {{math|''η''∈ℝ<sup>''n''</sup>}} and {{math|1=''g''(''x'') = ''e''<sup>2''πix''⋅''η''</sup>''f''(''x'')}}, then <math>(\mathcal{F}g)(\xi) = (\mathcal{F}f)(\xi - \eta)</math>.
| |
| # If {{math|''a''∈ℝ}} and {{math|1=''g''(''x'') = ''f''(''ax'')}}, then <math>(\mathcal{F}g)(\xi) = (\mathcal{F}f)(\xi/a)/a^n</math>.
| |
| # For {{math|''f''}} and {{math|''g''}} in {{math|''L''<sup>1</sup>(ℝ<sup>''n''</sup>)}}, [[Fubini's theorem]] implies that <math>\textstyle\int f (\mathcal{F}g) = \int(\mathcal{F}f) g</math>.
| |
| # Define {{math|1=''φ''(''x''):=''e''<sup>−''π''{{!}}''x''{{!}}<sup>2</sup></sup>}}; then <math>\mathcal{F}\varphi = \varphi.</math>
| |
| # Define {{math|1=''φ''<sub>''ε''</sub>(''x''):=''φ''(''x''/''ε'')/''ε''<sup>''n''</sup>}}. Then with {{math|∗}} denoting [[convolution]], {{math|''φ''<sub>''ε''</sub>}} is an [[nascent delta function|approximation to the identity]]: for any continuous {{math|''f''∈''L''<sup>1</sup>(ℝ<sup>''n''</sup>)}} and point {{math|''x''∈ℝ<sup>''n''</sup>}}, {{math|1=lim<sub>''ε''→0</sub>''φ''<sub>''ε''</sub>∗''f''(''x'')=''f''(''x'')}} (where the convergence is pointwise).
| |
| | |
| First note that, since, by assumption, <math>\mathcal{F}f\in L^1(\mathbb{R}^n)</math>, then it follows by the [[dominated convergence theorem]] that
| |
| | |
| :<math>\int_{\mathbb{R}^n} e^{2\pi i x\cdot\xi}(\mathcal{F}f)(\xi)\,d\xi = \lim_{\varepsilon \to 0}\int_{\mathbb{R}^n} e^{-\pi\varepsilon^2|\xi|^2 + 2\pi i x\cdot\xi}(\mathcal{F}f)(\xi)\,d\xi.</math>
| |
| | |
| Define {{math|1=''g''(''ξ'')=''e''<sup>−''πε''<sup>2</sup>{{!}}''ξ''{{!}}<sup>2</sup>+2''πix''⋅''ξ''</sup>}}. Applying facts 1, 2 and 4 from we obtain
| |
| :<math>(\mathcal{F}g)(y) = \frac{1}{\varepsilon^n}e^{-\frac{\pi}{\varepsilon^2}|x - y|^2}.</math>
| |
| | |
| Using fact 3 from above on {{math|''f''}} and {{math|''g''}} we thus have
| |
| | |
| :<math>\int_{\mathbb{R}^n} e^{-\pi\varepsilon^2|\xi|^2 + 2\pi i x\cdot\xi}(\mathcal{F}f)(\xi)\,d\xi = \int_{\mathbb{R}^n} \frac{1}{\varepsilon^n}e^{-\frac{\pi}{\varepsilon^2}|x - y|^2}f(y)\,dy = (\phi_{\varepsilon} * f)(x),</math>
| |
| | |
| the convolution of {{math|''f''}} with an approximate identity. But since {{math|''f''∈''L''<sup>1</sup>(ℝ<sup>''n''</sup>)}} fact 5 says that | |
| | |
| :<math>\lim_{\varepsilon\to 0}\phi_{\varepsilon} * f (x) = f(x).</math>
| |
| | |
| Putting together the above we have shown that
| |
| | |
| : <math>\int_{\mathbb{R}^n} e^{2\pi i x\cdot\xi}(\mathcal{F}f)(\xi)\,d\xi = f(x). \qquad\square</math>
| |
| | |
| ==Notes==
| |
| {{Reflist|group=note}}
| |
| | |
| ==References==
| |
| {{No footnotes|date=January 2013}}
| |
| * {{cite book|last=Folland|first=G. B.|authorlink=Gerald Folland|year=1992|title=Fourier Analysis and its Applications|publisher=Wadsworth|location=Belmont, CA, USA|isbn=0-534-17094-3}}
| |
| * {{cite book|last=Folland|first=G. B.|authorlink=Gerald Folland|year=1995|title=Introduction to Partial Differential Equations|edition=2nd|publisher=Princeton Univ. Press|location=Princeton, USA|isbn=978-0-691-04361-6}}
| |
| | |
| [[Category:Generalized functions]]
| |
| [[Category:Theorems in Fourier analysis]]
| |