An Entity of Type : yago:WikicatDynamicalSystems, within Data Space : dbpedia.org associated with source document(s)

In mathematics, the convolution theorem states that under suitableconditions the Fourier transform of a convolution is the pointwise product of Fourier transforms. In other words, convolution in one domain (e.g., time domain) equals point-wise multiplication in the other domain (e.g., frequency domain). Versions of the convolution theorem are true for various Fourier-related transforms.Let and be two functions with convolution . (Note that the asterisk denotes convolution in this context, and not multiplication. The tensor product symbol is sometimes used instead.)Let and and , respectively.Then and:

AttributesValues
rdf:type
rdfs:label
• Convolution theorem
rdfs:comment
• In mathematics, the convolution theorem states that under suitableconditions the Fourier transform of a convolution is the pointwise product of Fourier transforms. In other words, convolution in one domain (e.g., time domain) equals point-wise multiplication in the other domain (e.g., frequency domain). Versions of the convolution theorem are true for various Fourier-related transforms.Let and be two functions with convolution . (Note that the asterisk denotes convolution in this context, and not multiplication. The tensor product symbol is sometimes used instead.)Let and and , respectively.Then and:
sameAs
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
foaf:isPrimaryTopicOf
prov:wasDerivedFrom
has abstract
• In mathematics, the convolution theorem states that under suitableconditions the Fourier transform of a convolution is the pointwise product of Fourier transforms. In other words, convolution in one domain (e.g., time domain) equals point-wise multiplication in the other domain (e.g., frequency domain). Versions of the convolution theorem are true for various Fourier-related transforms.Let and be two functions with convolution . (Note that the asterisk denotes convolution in this context, and not multiplication. The tensor product symbol is sometimes used instead.)Let denote the Fourier transform operator, so and are the Fourier transforms of and , respectively.Then where denotes point-wise multiplication. It also works the other way around: By applying the inverse Fourier transform , we can write: and: Note that the relationships above are only valid for the form of the Fourier transform shown in the section below. The transform may be normalized in other ways, in which case constant scaling factors (typically or ) will appear in the relationships above. This theorem also holds for the Laplace transform, the two-sided Laplace transform and, when suitably modified, for the Mellin transform and Hartley transform (see Mellin inversion theorem). It can be extended to the Fourier transform of abstract harmonic analysis defined over locally compact abelian groups. This formulation is especially useful for implementing a numerical convolution on a computer: The standard convolution algorithm has quadratic computational complexity. With the help of the convolution theorem and the fast Fourier transform, the complexity of the convolution can be reduced from O(n²) to O(n log n). This can be exploited to construct fast multiplication algorithms.
http://purl.org/voc/vrank#hasRank
is Link from a Wikipage to another Wikipage of
Faceted Search & Find service v1.17_git45 as of Sep 05 2017

Alternative Linked Data Documents: iSPARQL | ODE     Content Formats:       RDF       ODATA       Microdata      About

OpenLink Virtuoso version 07.20.3232 as of Oct 29 2019, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (378 GB total memory)