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[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[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[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[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[expr, \[Omega], t] gives a numerical approximation to the inverse Fourier cosine transform of expr evaluated at the numerical value t, where expr ...
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[expr, \[Omega], t] gives a numerical approximation to the inverse Fourier transform of expr evaluated at the numerical value t, where expr is a ...
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.