341 - 350 of 1421 for Mellin transform methodsSearch Results
View search results from all Wolfram sites (17060 matches)
NDTFourierTransform   (Fourier Series Package Symbol)
NDTFourierTransform[expr, n, \[Omega]] gives a numerical approximation to the discrete time Fourier transform of expr evaluated at the numerical value \[Omega], where expr is ...
NFourierCosTransform   (Fourier Series Package Symbol)
NFourierCosTransform[expr, t, \[Omega]] gives a numerical approximation to the Fourier cosine transform of expr evaluated at the numerical value \[Omega], where expr is a ...
NFourierSinTransform   (Fourier Series Package Symbol)
NFourierSinTransform[expr, t, \[Omega]] gives a numerical approximation to the Fourier sine transform of expr evaluated at the numerical value \[Omega], where expr is a ...
NFourierTransform   (Fourier Series Package Symbol)
NFourierTransform[expr, t, \[Omega]] gives a numerical approximation to the Fourier transform of expr evaluated at the numerical value \[Omega], where expr is a function of t.
NInverseDTFourierTransform   (Fourier Series Package Symbol)
NInverseDTFourierTransform[expr, \[Omega], n] gives a numerical approximation to the inverse discrete time Fourier transform of expr evaluated at the integer n, where expr is ...
NInverseFourierCosTransform   (Fourier Series Package Symbol)
NInverseFourierCosTransform[expr, \[Omega], t] gives a numerical approximation to the inverse Fourier cosine transform of expr evaluated at the numerical value t, where expr ...
NInverseFourierSinTransform   (Fourier Series Package Symbol)
NInverseFourierSinTransform[expr, \[Omega], t] gives a numerical approximation to the inverse Fourier sine transform of expr evaluated at the numerical value t, where expr is ...
NInverseFourierTransform   (Fourier Series Package Symbol)
NInverseFourierTransform[expr, \[Omega], t] gives a numerical approximation to the inverse Fourier transform of expr evaluated at the numerical value t, where expr is a ...
Diophantine Polynomial Systems   (Mathematica Tutorial)
A Diophantine polynomial system is an expression constructed with polynomial equations and inequalities combined using logical connectives and quantifiers where the variables ...
Times   (Built-in Mathematica Symbol)
x*y*z, x*y*z, or x y z represents a product of terms.
1 ... 32|33|34|35|36|37|38 ... 143 Previous Next

...