InverseFourierTransform
The inverse Fourier transform under Wolfram's default convention — the two closed forms it documents unconditionally ( and a constant a scaled ), nothing more.
✓ checked against that system · ! checked, with disagreements (hover a chip)Wolfram Language
InverseFourierTransform!InverseFourierTransform(F, w, t) such that , for the two forms below.Typed signatures
| Type | Package | Applies |
|---|---|---|
(expression, expression, expression) -> expression | analytic | always |
Details
- Covered:
DiracDelta(w), and aw-free constant (the inverse ofFourierTransform's own constant rule). - Declined: everything else — no rational-function or trig table the way
InverseLaplaceTransformhas one, since the correspondingFourierTransformimages are themselves distributional (a sum ofDiracDeltas) rather than an algebraic shape to invert termwise here.
Examples
About
| Examples | 4 |
|---|---|
| Checked against | Wolfram Language 2 agree2 differ |
| Crosswalk | Wolfram Language |
Implementation
primitive · kernela kernel — an algorithm over mutable state that would not be readable as a tree
nativeengine
typescriptpackages/symbols/analysis/analytic/src/transforms.ts See also: FourierTransform, InverseLaplaceTransform