Keywords - Function groups - @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Mathematical Functions

Common Functions

abs Computes the absolute values of the elements of an array.
ceil Returns the smallest integer value greater or equal to each element of an array.
floor floor gives the next smaller integer value of the elements of an array.
rint rint gives the next nearest integer value of the elements of an array.
sqrt sqrt computes the square root of the elements of an array.

Trigonometric Functions

acos Returns the arccosine of the elements of an array.
acosh Returns the inverse hyperbolic cosine of the elements of an array.
asin Returns the arcsine of the elements of an array.
asinh Returns the inverse hyperbolic sine of the elements of an array.
atan Returns the arctangent in radian of the elements of an array.
atan2 Returns the angle in radian between the positive part of the x-axis and the line with origin in (0,0) which contains the point (x, y).
atanh Returns the inverse hyperbolic tangent of the elements of an array.
cos Returns the cosine in radian of the elements of an array.
cosh Returns the hyperbolic cosine of the elements of an array.
sin Returns the sine in radian of the elements of an array.
sinh Returns the hyperbolic sinus of the elements of an array.
tan Returns the tangent in radian of the elements of an array.
tanh Returns the hyperbolic tangent of the elements of an array.

Fourier and Wavelet transforms

dwt dwt computes the Discrete Wavelet Transformation of a vector.
fft fft computes the Fast Fourier Transformation of a complex vector.
fwt fwt computes the Fast Wavelet Transformation of a vector.
fwt2 The algorithm fwt2 is designed for 2 dimensional wavelet transformation. It mainly corresponds to dwt for the one dimensional case. If wished it works with the tensor product of one dimensional wavelet transforms.
fwtin fwtin computes the Fast Wavelet Transformation of all circular shifts of the vector x.
fwtinshift fwtinshift retrieves the wavelet coefficients for a given shift of the Fast Wavelet Transformation of all circular shifts (fwtin) of a vector.
invdwt invdwt computes the inverse Discrete Wavelet Transformation of a vector.
invfft invfft computes the Inverse Fast Fourier Transformation of a complex vector.
invfwt invfwt computes the Fast Wavelet Transformation of a vector.
invfwt2 The algorithm invfwt2 is designed for 2 dimensional inverse wavelet transformation. The wavelet coefficients are stored in the matrix c.
invfwtin fwtin computes the inverse Fast Wavelet Transformation of all circular shifts from ti.

Exponential and Logarithmic Functions

exp exp produces the exponentation to base e=2.7181... of the elements in an array.
expm1 expm1 computes e^(x-1) accurately even for tiny x.
lgamma lgamma computes logarithm of the gamma function.

log log returns the natural logarithm of the elements of an array.
log10 log10 returns the logarithm base 10 of the elements of an array.
log1p log1p computes the natural logarithm of (1+x) accurately even for tiny x.

Integration

simpsonint simpsonint computes the integral of a given realvalued function about a d-dimensional cube [a_1,b_1] x ... x [a_d,b_d]. The method of simpson is used.

Keywords - Function groups - @ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

(C) MD*TECH Method and Data Technologies, 17.8.2000