Full Command and Function Reference 3-83
two, and the resulting algorithms are called the fast Fourier transform (FFT) and inverse fast
Fourier transform (IFFT).
The IFFT command uses truncated 15-digit arithmetic and intermediate storage, then rounds the
result to 12-digit precision.
Access: !´L
FFT IFFT ( ´ is the left-shift of the Pkey).
Input/Output:
Level 1/Argument 1 Level 1/Item 1
[ array ]
1
→
[ array ]
2
See also: FFT
IFT
Type: Command
Description: IF-THEN Command: Executes obj if T/F is nonzero. Discards obj if T/F is zero.
IFT lets you execute in stack syntax the decision-making process of the IF … THEN … END
conditional structure. The “true clause” is obj in argument 2 (level 1).
Access: !°
BRANCH IFT ( °is the left-shift of the Nkey).
Input/Output:
Level 2/Argument 1 Level 1/Argument 2 Level 1/Item 1
T/F obj
→
It depends!
See also: IFTE
IFTE
Type: Function
Description: IF-THEN-ELSE Function: Executes the obj in argument 2 or level 2 if T/F is nonzero. Executes
the obj in argument 3 or level 1 if T/F is zero.
IFTE lets you execute in stack syntax the decision-making process of the IF … THEN … ELSE
… END conditional structure. The “true clause” is obj
true
in argument 2 or level 2. The “false
clause” is obj
false
in argument 3 or level 1.
IFTE is also allowed in algebraic expressions, with the following syntax:
IFTE(test,true-clause,false-clause)
When an algebraic containing IFTE is evaluated, its first argument test is evaluated to a test result.
If it returns a nonzero real number, true-clause is evaluated. If it returns zero, false-clause is
evaluated.
Access: !°
BRANCH LIFTE ( °is the left-shift of the Nkey).
Input/Output:
Level 3/Argument 1 Level 2/Argument 2 Level 1/Argument 3 Level 1/Item 1
T/F obj
true
obj
false
→
It depends!
See also: IFT
ILAP
CAS: Return the inverse Laplace transform of an expression that evaluates to a rational fraction.
IM
Type: Function
Description: Imaginary Part Function: Returns the imaginary part of its complex argument.