.\" Man page generated from reStructuredText.
.
.TH "GMTMATH" "1gmt" "May 21, 2019" "5.4.5" "GMT"
.SH NAME
gmtmath \- Reverse Polish Notation (RPN) calculator for data tables
.
.nr rst2man-indent-level 0
.
.de1 rstReportMargin
\\$1 \\n[an-margin]
level \\n[rst2man-indent-level]
level margin: \\n[rst2man-indent\\n[rst2man-indent-level]]
-
\\n[rst2man-indent0]
\\n[rst2man-indent1]
\\n[rst2man-indent2]
..
.de1 INDENT
.\" .rstReportMargin pre:
. RS \\$1
. nr rst2man-indent\\n[rst2man-indent-level] \\n[an-margin]
. nr rst2man-indent-level +1
.\" .rstReportMargin post:
..
.de UNINDENT
. RE
.\" indent \\n[an-margin]
.\" old: \\n[rst2man-indent\\n[rst2man-indent-level]]
.nr rst2man-indent-level -1
.\" new: \\n[rst2man-indent\\n[rst2man-indent-level]]
.in \\n[rst2man-indent\\n[rst2man-indent-level]]u
..
.SH SYNOPSIS
.sp
\fBgmtmath\fP [  \fB\-A\fP\fIt_f(t).d\fP[\fB+e\fP][\fB+s\fP|\fBw\fP] ]
[  \fB\-C\fP\fIcols\fP ]
[  \fB\-E\fP\fIeigen\fP ] [  \fB\-I\fP ]
[  \fB\-N\fP\fIn_col\fP[/\fIt_col\fP] ]
[  \fB\-Q\fP ] [  \fB\-S\fP[\fBf\fP|\fBl\fP] ]
[  \fB\-T\fP\fIt_min\fP/\fIt_max\fP/\fIt_inc\fP[\fB+n\fP]|\fItfile\fP ]
[  \fB\-V\fP[\fIlevel\fP] ]
[ \fB\-b\fPbinary ]
[ \fB\-d\fPnodata ]
[ \fB\-e\fPregexp ]
[ \fB\-f\fPflags ]
[ \fB\-g\fPgaps ]
[ \fB\-h\fPheaders ]
[ \fB\-i\fPflags ]
[ \fB\-o\fPflags ]
[ \fB\-s\fPflags ]
\fIoperand\fP [ \fIoperand\fP ] \fBOPERATOR\fP [ \fIoperand\fP ] \fBOPERATOR\fP ...
\fB=\fP [ \fIoutfile\fP ]
.sp
\fBNote:\fP No space is allowed between the option flag and the associated arguments.
.SH DESCRIPTION
.sp
\fBgmtmath\fP will perform operations like add, subtract, multiply, and
divide on one or more table data files or constants using Reverse Polish
Notation (RPN) syntax (e.g., Hewlett\-Packard calculator\-style).
Arbitrarily complicated expressions may therefore be evaluated; the
final result is written to an output file [or standard output]. Data
operations are element\-by\-element, not matrix manipulations (except
where noted). Some operators only require one operand (see below). If no
data tables are used in the expression then options \fB\-T\fP, \fB\-N\fP can
be set (and optionally \fB\-bo\fP to indicate the
data type for binary tables). If STDIN is given, the standard input will
be read and placed on the stack as if a file with that content had been
given on the command line. By default, all columns except the "time"
column are operated on, but this can be changed (see \fB\-C\fP).
Complicated or frequently occurring expressions may be coded as a macro
for future use or stored and recalled via named memory locations.
.SH REQUIRED ARGUMENTS
.INDENT 0.0
.TP
.B \fIoperand\fP
If \fIoperand\fP can be opened as a file it will be read as an ASCII (or
binary, see \fB\-bi\fP) table data file. If not
a file, it is interpreted as a numerical constant or a special
symbol (see below). The special argument STDIN means that \fIstdin\fP
will be read and placed on the stack; STDIN can appear more than
once if necessary.
.TP
.B \fIoutfile\fP
The name of a table data file that will hold the final result. If
not given then the output is sent to stdout.
.UNINDENT
.SH OPTIONAL ARGUMENTS
.INDENT 0.0
.TP
\fB\-A\fP\fIt_f(t).d\fP[\fB+e\fP][\fB+r\fP][\fB+s\fP|\fBw\fP]
Requires \fB\-N\fP and will partially initialize a table with values
from the given file containing \fIt\fP and \fIf(t)\fP only. The \fIt\fP is
placed in column \fIt_col\fP while \fIf(t)\fP goes into column \fIn_col\fP \- 1
(see \fB\-N\fP).  Append \fB+r\fP to only place \fIf(t)\fP and leave the left
hand side of the matrix equation alone.  If used with operators LSQFIT and SVDFIT you can
optionally append the modifier \fB+e\fP which will instead evaluate
the solution and write a data set with four columns: t, f(t), the
model solution at t, and the the residuals at t, respectively
[Default writes one column with model coefficients].  Append \fB+w\fP
if \fIt_f(t).d\fP has a third column with weights, or append \fB+s\fP if
\fIt_f(t).d\fP has a third column with 1\-sigma.  In those two cases we
find the weighted solution.  The weights (or sigmas) will be output
as the last column when \fB+e\fP is in effect.
.UNINDENT
.INDENT 0.0
.TP
\fB\-C\fP\fIcols\fP
Select the columns that will be operated on until next occurrence of
\fB\-C\fP\&. List columns separated by commas; ranges like 1,3\-5,7 are
allowed. \fB\-C\fP (no arguments) resets the default action of using
all columns except time column (see \fB\-N\fP). \fB\-Ca\fP selects all
columns, including time column, while \fB\-Cr\fP reverses (toggles) the
current choices.  When \fB\-C\fP is in effect it also controls which
columns from a file will be placed on the stack.
.UNINDENT
.INDENT 0.0
.TP
\fB\-E\fP\fIeigen\fP
Sets the minimum eigenvalue used by operators LSQFIT and SVDFIT [1e\-7].
Smaller eigenvalues are set to zero and will not be considered in the
solution.
.UNINDENT
.INDENT 0.0
.TP
\fB\-I\fP
Reverses the output row sequence from ascending time to descending [ascending].
.UNINDENT
.INDENT 0.0
.TP
\fB\-N\fP\fIn_col\fP[/\fIt_col\fP]
Select the number of columns and optionally the column number that
contains the "time" variable [0]. Columns are numbered starting at 0
[2/0]. If input files are specified then \fB\-N\fP will add any missing
columns.
.UNINDENT
.INDENT 0.0
.TP
\fB\-Q\fP
Quick mode for scalar calculation. Shorthand for \fB\-Ca\fP \fB\-N\fP1/0  \fB\-T\fP0/0/1.
In this mode, constants may have plot units (i.e., c, i, p) and if so the final
answer will be reported in the unit set by PROJ_LENGTH_UNIT\&.
.UNINDENT
.INDENT 0.0
.TP
\fB\-S\fP[\fBf\fP|\fBl\fP]
Only report the first or last row of the results [Default is all
rows]. This is useful if you have computed a statistic (say the
\fBMODE\fP) and only want to report a single number instead of
numerous records with identical values. Append \fBl\fP to get the last
row and \fBf\fP to get the first row only [Default].
.UNINDENT
.INDENT 0.0
.TP
\fB\-T\fP\fIt_min\fP/\fIt_max\fP/\fIt_inc\fP[\fB+n\fP]|\fItfile\fP
Required when no input files are given. Sets the t\-coordinates of
the first and last point and the equidistant sampling interval for
the "time" column (see \fB\-N\fP). Append \fB+n\fP if you are specifying
the number of equidistant points instead. If there is no time column
(only data columns), give \fB\-T\fP with no arguments; this also
implies \fB\-Ca\fP\&. Alternatively, give the name of a file whose first
column contains the desired t\-coordinates which may be irregular.
.UNINDENT
.INDENT 0.0
.TP
\fB\-V\fP[\fIlevel\fP] (more ...)
Select verbosity level [c].  
.UNINDENT
.INDENT 0.0
.TP
\fB\-bi\fP[\fIncols\fP][\fBt\fP] (more ...)
Select native binary input.  
.UNINDENT
.INDENT 0.0
.TP
\fB\-bo\fP[\fIncols\fP][\fItype\fP] (more ...)
Select native binary output. [Default is same as input, but see \fB\-o\fP]
.UNINDENT
.INDENT 0.0
.TP
\fB\-d\fP[\fBi\fP|\fBo\fP]\fInodata\fP (more ...)
Replace input columns that equal \fInodata\fP with NaN and do the reverse on output.  
.UNINDENT
.INDENT 0.0
.TP
\fB\-e\fP[\fB~\fP]\fI"pattern"\fP \fB|\fP \fB\-e\fP[\fB~\fP]/\fIregexp\fP/[\fBi\fP] (more ...)
Only accept data records that match the given pattern.  
.UNINDENT
.INDENT 0.0
.TP
\fB\-f\fP[\fBi\fP|\fBo\fP]\fIcolinfo\fP (more ...)
Specify data types of input and/or output columns.  
.UNINDENT
.INDENT 0.0
.TP
\fB\-g\fP[\fBa\fP]\fBx\fP|\fBy\fP|\fBd\fP|\fBX\fP|\fBY\fP|\fBD\fP|[\fIcol\fP]\fBz\fP[+|\-]\fIgap\fP[\fBu\fP] (more ...)
Determine data gaps and line breaks.  
.UNINDENT
.INDENT 0.0
.TP
\fB\-h\fP[\fBi\fP|\fBo\fP][\fIn\fP][\fB+c\fP][\fB+d\fP][\fB+r\fP\fIremark\fP][\fB+r\fP\fItitle\fP] (more ...)
Skip or produce header record(s).  
.UNINDENT
.INDENT 0.0
.TP
\fB\-i\fP\fIcols\fP[\fB+l\fP][\fB+s\fP\fIscale\fP][\fB+o\fP\fIoffset\fP][,\fI\&...\fP] (more ...)
Select input columns and transformations (0 is first column).
.UNINDENT
.INDENT 0.0
.TP
\fB\-o\fP\fIcols\fP[,...] (more ...)
Select output columns (0 is first column).
.UNINDENT
.INDENT 0.0
.TP
\fB\-s\fP[\fIcols\fP][\fBa\fP|\fBr\fP] (more ...)
Set handling of NaN records.
.UNINDENT
.INDENT 0.0
.TP
\fB\-^\fP or just \fB\-\fP
Print a short message about the syntax of the command, then exits (NOTE: on Windows just use \fB\-\fP).
.TP
\fB\-+\fP or just \fB+\fP
Print an extensive usage (help) message, including the explanation of
any module\-specific option (but not the GMT common options), then exits.
.TP
\fB\-?\fP or no arguments
Print a complete usage (help) message, including the explanation of all options, then exits.
.UNINDENT
.SH OPERATORS
.sp
Choose among the following 185 operators. "args" are the number of input
and output arguments.
.TS
center;
|l|l|l|.
_
T{
Operator
T}	T{
args
T}	T{
Returns
T}
_
T{
\fBABS\fP
T}	T{
1 1
T}	T{
abs (A)
T}
_
T{
\fBACOS\fP
T}	T{
1 1
T}	T{
acos (A)
T}
_
T{
\fBACOSH\fP
T}	T{
1 1
T}	T{
acosh (A)
T}
_
T{
\fBACSC\fP
T}	T{
1 1
T}	T{
acsc (A)
T}
_
T{
\fBACOT\fP
T}	T{
1 1
T}	T{
acot (A)
T}
_
T{
\fBADD\fP
T}	T{
2 1
T}	T{
A + B
T}
_
T{
\fBAND\fP
T}	T{
2 1
T}	T{
B if A == NaN, else A
T}
_
T{
\fBASEC\fP
T}	T{
1 1
T}	T{
asec (A)
T}
_
T{
\fBASIN\fP
T}	T{
1 1
T}	T{
asin (A)
T}
_
T{
\fBASINH\fP
T}	T{
1 1
T}	T{
asinh (A)
T}
_
T{
\fBATAN\fP
T}	T{
1 1
T}	T{
atan (A)
T}
_
T{
\fBATAN2\fP
T}	T{
2 1
T}	T{
atan2 (A, B)
T}
_
T{
\fBATANH\fP
T}	T{
1 1
T}	T{
atanh (A)
T}
_
T{
\fBBCDF\fP
T}	T{
3 1
T}	T{
Binomial cumulative distribution function for p = A, n = B, and x = C
T}
_
T{
\fBBPDF\fP
T}	T{
3 1
T}	T{
Binomial probability density function for p = A, n = B, and x = C
T}
_
T{
\fBBEI\fP
T}	T{
1 1
T}	T{
bei (A)
T}
_
T{
\fBBER\fP
T}	T{
1 1
T}	T{
ber (A)
T}
_
T{
\fBBITAND\fP
T}	T{
2 1
T}	T{
A & B (bitwise AND operator)
T}
_
T{
\fBBITLEFT\fP
T}	T{
2 1
T}	T{
A << B (bitwise left\-shift operator)
T}
_
T{
\fBBITNOT\fP
T}	T{
1 1
T}	T{
~A (bitwise NOT operator, i.e., return two\(aqs complement)
T}
_
T{
\fBBITOR\fP
T}	T{
2 1
T}	T{
A | B (bitwise OR operator)
T}
_
T{
\fBBITRIGHT\fP
T}	T{
2 1
T}	T{
A >> B (bitwise right\-shift operator)
T}
_
T{
\fBBITTEST\fP
T}	T{
2 1
T}	T{
1 if bit B of A is set, else 0 (bitwise TEST operator)
T}
_
T{
\fBBITXOR\fP
T}	T{
2 1
T}	T{
A ^ B (bitwise XOR operator)
T}
_
T{
\fBCEIL\fP
T}	T{
1 1
T}	T{
ceil (A) (smallest integer >= A)
T}
_
T{
\fBCHICRIT\fP
T}	T{
2 1
T}	T{
Chi\-squared distribution critical value for alpha = A and nu = B
T}
_
T{
\fBCHICDF\fP
T}	T{
2 1
T}	T{
Chi\-squared cumulative distribution function for chi2 = A and nu = B
T}
_
T{
\fBCHIPDF\fP
T}	T{
2 1
T}	T{
Chi\-squared probability density function for chi2 = A and nu = B
T}
_
T{
\fBCOL\fP
T}	T{
1 1
T}	T{
Places column A on the stack
T}
_
T{
\fBCOMB\fP
T}	T{
2 1
T}	T{
Combinations n_C_r, with n = A and r = B
T}
_
T{
\fBCORRCOEFF\fP
T}	T{
2 1
T}	T{
Correlation coefficient r(A, B)
T}
_
T{
\fBCOS\fP
T}	T{
1 1
T}	T{
cos (A) (A in radians)
T}
_
T{
\fBCOSD\fP
T}	T{
1 1
T}	T{
cos (A) (A in degrees)
T}
_
T{
\fBCOSH\fP
T}	T{
1 1
T}	T{
cosh (A)
T}
_
T{
\fBCOT\fP
T}	T{
1 1
T}	T{
cot (A) (A in radians)
T}
_
T{
\fBCOTD\fP
T}	T{
1 1
T}	T{
cot (A) (A in degrees)
T}
_
T{
\fBCSC\fP
T}	T{
1 1
T}	T{
csc (A) (A in radians)
T}
_
T{
\fBCSCD\fP
T}	T{
1 1
T}	T{
csc (A) (A in degrees)
T}
_
T{
\fBDDT\fP
T}	T{
1 1
T}	T{
d(A)/dt Central 1st derivative
T}
_
T{
\fBD2DT2\fP
T}	T{
1 1
T}	T{
d^2(A)/dt^2 2nd derivative
T}
_
T{
\fBD2R\fP
T}	T{
1 1
T}	T{
Converts Degrees to Radians
T}
_
T{
\fBDENAN\fP
T}	T{
2 1
T}	T{
Replace NaNs in A with values from B
T}
_
T{
\fBDILOG\fP
T}	T{
1 1
T}	T{
dilog (A)
T}
_
T{
\fBDIFF\fP
T}	T{
1 1
T}	T{
Forward difference between adjacent elements of A (A[1]\-A[0], A[2]\-A[1], ..., NaN)
T}
_
T{
\fBDIV\fP
T}	T{
2 1
T}	T{
A / B
T}
_
T{
\fBDUP\fP
T}	T{
1 2
T}	T{
Places duplicate of A on the stack
T}
_
T{
\fBECDF\fP
T}	T{
2 1
T}	T{
Exponential cumulative distribution function for x = A and lambda = B
T}
_
T{
\fBECRIT\fP
T}	T{
2 1
T}	T{
Exponential distribution critical value for alpha = A and lambda = B
T}
_
T{
\fBEPDF\fP
T}	T{
2 1
T}	T{
Exponential probability density function for x = A and lambda = B
T}
_
T{
\fBERF\fP
T}	T{
1 1
T}	T{
Error function erf (A)
T}
_
T{
\fBERFC\fP
T}	T{
1 1
T}	T{
Complementary Error function erfc (A)
T}
_
T{
\fBERFINV\fP
T}	T{
1 1
T}	T{
Inverse error function of A
T}
_
T{
\fBEQ\fP
T}	T{
2 1
T}	T{
1 if A == B, else 0
T}
_
T{
\fBEXCH\fP
T}	T{
2 2
T}	T{
Exchanges A and B on the stack
T}
_
T{
\fBEXP\fP
T}	T{
1 1
T}	T{
exp (A)
T}
_
T{
\fBFACT\fP
T}	T{
1 1
T}	T{
A! (A factorial)
T}
_
T{
\fBFCDF\fP
T}	T{
3 1
T}	T{
F cumulative distribution function for F = A, nu1 = B, and nu2 = C
T}
_
T{
\fBFCRIT\fP
T}	T{
3 1
T}	T{
F distribution critical value for alpha = A, nu1 = B, and nu2 = C
T}
_
T{
\fBFLIPUD\fP
T}	T{
1 1
T}	T{
Reverse order of each column
T}
_
T{
\fBFLOOR\fP
T}	T{
1 1
T}	T{
floor (A) (greatest integer <= A)
T}
_
T{
\fBFMOD\fP
T}	T{
2 1
T}	T{
A % B (remainder after truncated division)
T}
_
T{
\fBFPDF\fP
T}	T{
3 1
T}	T{
F probability density function for F = A, nu1 = B, and nu2 = C
T}
_
T{
\fBGE\fP
T}	T{
2 1
T}	T{
1 if A >= B, else 0
T}
_
T{
\fBGT\fP
T}	T{
2 1
T}	T{
1 if A > B, else 0
T}
_
T{
\fBHYPOT\fP
T}	T{
2 1
T}	T{
hypot (A, B) = sqrt (A*A + B*B)
T}
_
T{
\fBI0\fP
T}	T{
1 1
T}	T{
Modified Bessel function of A (1st kind, order 0)
T}
_
T{
\fBI1\fP
T}	T{
1 1
T}	T{
Modified Bessel function of A (1st kind, order 1)
T}
_
T{
\fBIFELSE\fP
T}	T{
3 1
T}	T{
B if A != 0, else C
T}
_
T{
\fBIN\fP
T}	T{
2 1
T}	T{
Modified Bessel function of A (1st kind, order B)
T}
_
T{
\fBINRANGE\fP
T}	T{
3 1
T}	T{
1 if B <= A <= C, else 0
T}
_
T{
\fBINT\fP
T}	T{
1 1
T}	T{
Numerically integrate A
T}
_
T{
\fBINV\fP
T}	T{
1 1
T}	T{
1 / A
T}
_
T{
\fBISFINITE\fP
T}	T{
1 1
T}	T{
1 if A is finite, else 0
T}
_
T{
\fBISNAN\fP
T}	T{
1 1
T}	T{
1 if A == NaN, else 0
T}
_
T{
\fBJ0\fP
T}	T{
1 1
T}	T{
Bessel function of A (1st kind, order 0)
T}
_
T{
\fBJ1\fP
T}	T{
1 1
T}	T{
Bessel function of A (1st kind, order 1)
T}
_
T{
\fBJN\fP
T}	T{
2 1
T}	T{
Bessel function of A (1st kind, order B)
T}
_
T{
\fBK0\fP
T}	T{
1 1
T}	T{
Modified Kelvin function of A (2nd kind, order 0)
T}
_
T{
\fBK1\fP
T}	T{
1 1
T}	T{
Modified Bessel function of A (2nd kind, order 1)
T}
_
T{
\fBKN\fP
T}	T{
2 1
T}	T{
Modified Bessel function of A (2nd kind, order B)
T}
_
T{
\fBKEI\fP
T}	T{
1 1
T}	T{
kei (A)
T}
_
T{
\fBKER\fP
T}	T{
1 1
T}	T{
ker (A)
T}
_
T{
\fBKURT\fP
T}	T{
1 1
T}	T{
Kurtosis of A
T}
_
T{
\fBLCDF\fP
T}	T{
1 1
T}	T{
Laplace cumulative distribution function for z = A
T}
_
T{
\fBLCRIT\fP
T}	T{
1 1
T}	T{
Laplace distribution critical value for alpha = A
T}
_
T{
\fBLE\fP
T}	T{
2 1
T}	T{
1 if A <= B, else 0
T}
_
T{
\fBLMSSCL\fP
T}	T{
1 1
T}	T{
LMS scale estimate (LMS STD) of A
T}
_
T{
\fBLMSSCLW\fP
T}	T{
2 1
T}	T{
Weighted LMS scale estimate (LMS STD) of A for weights in B
T}
_
T{
\fBLOG\fP
T}	T{
1 1
T}	T{
log (A) (natural log)
T}
_
T{
\fBLOG10\fP
T}	T{
1 1
T}	T{
log10 (A) (base 10)
T}
_
T{
\fBLOG1P\fP
T}	T{
1 1
T}	T{
log (1+A) (accurate for small A)
T}
_
T{
\fBLOG2\fP
T}	T{
1 1
T}	T{
log2 (A) (base 2)
T}
_
T{
\fBLOWER\fP
T}	T{
1 1
T}	T{
The lowest (minimum) value of A
T}
_
T{
\fBLPDF\fP
T}	T{
1 1
T}	T{
Laplace probability density function for z = A
T}
_
T{
\fBLRAND\fP
T}	T{
2 1
T}	T{
Laplace random noise with mean A and std. deviation B
T}
_
T{
\fBLSQFIT\fP
T}	T{
1 0
T}	T{
Let current table be [A | b] return least squares solution x = A \e b
T}
_
T{
\fBLT\fP
T}	T{
2 1
T}	T{
1 if A < B, else 0
T}
_
T{
\fBMAD\fP
T}	T{
1 1
T}	T{
Median Absolute Deviation (L1 STD) of A
T}
_
T{
\fBMADW\fP
T}	T{
2 1
T}	T{
Weighted Median Absolute Deviation (L1 STD) of A for weights in B
T}
_
T{
\fBMAX\fP
T}	T{
2 1
T}	T{
Maximum of A and B
T}
_
T{
\fBMEAN\fP
T}	T{
1 1
T}	T{
Mean value of A
T}
_
T{
\fBMEANW\fP
T}	T{
2 1
T}	T{
Weighted mean value of A for weights in B
T}
_
T{
\fBMEDIAN\fP
T}	T{
1 1
T}	T{
Median value of A
T}
_
T{
\fBMEDIANW\fP
T}	T{
2 1
T}	T{
Weighted median value of A for weights in B
T}
_
T{
\fBMIN\fP
T}	T{
2 1
T}	T{
Minimum of A and B
T}
_
T{
\fBMOD\fP
T}	T{
2 1
T}	T{
A mod B (remainder after floored division)
T}
_
T{
\fBMODE\fP
T}	T{
1 1
T}	T{
Mode value (Least Median of Squares) of A
T}
_
T{
\fBMODEW\fP
T}	T{
2 1
T}	T{
Weighted mode value (Least Median of Squares) of A for weights in B
T}
_
T{
\fBMUL\fP
T}	T{
2 1
T}	T{
A * B
T}
_
T{
\fBNAN\fP
T}	T{
2 1
T}	T{
NaN if A == B, else A
T}
_
T{
\fBNEG\fP
T}	T{
1 1
T}	T{
\-A
T}
_
T{
\fBNEQ\fP
T}	T{
2 1
T}	T{
1 if A != B, else 0
T}
_
T{
\fBNORM\fP
T}	T{
1 1
T}	T{
Normalize (A) so max(A)\-min(A) = 1
T}
_
T{
\fBNOT\fP
T}	T{
1 1
T}	T{
NaN if A == NaN, 1 if A == 0, else 0
T}
_
T{
\fBNRAND\fP
T}	T{
2 1
T}	T{
Normal, random values with mean A and std. deviation B
T}
_
T{
\fBOR\fP
T}	T{
2 1
T}	T{
NaN if B == NaN, else A
T}
_
T{
\fBPCDF\fP
T}	T{
2 1
T}	T{
Poisson cumulative distribution function for x = A and lambda = B
T}
_
T{
\fBPERM\fP
T}	T{
2 1
T}	T{
Permutations n_P_r, with n = A and r = B
T}
_
T{
\fBPPDF\fP
T}	T{
2 1
T}	T{
Poisson distribution P(x,lambda), with x = A and lambda = B
T}
_
T{
\fBPLM\fP
T}	T{
3 1
T}	T{
Associated Legendre polynomial P(A) degree B order C
T}
_
T{
\fBPLMg\fP
T}	T{
3 1
T}	T{
Normalized associated Legendre polynomial P(A) degree B order C (geophysical convention)
T}
_
T{
\fBPOP\fP
T}	T{
1 0
T}	T{
Delete top element from the stack
T}
_
T{
\fBPOW\fP
T}	T{
2 1
T}	T{
A ^ B
T}
_
T{
\fBPQUANT\fP
T}	T{
2 1
T}	T{
The B\(aqth quantile (0\-100%) of A
T}
_
T{
\fBPQUANTW\fP
T}	T{
3 1
T}	T{
The C\(aqth weighted quantile (0\-100%) of A for weights in B
T}
_
T{
\fBPSI\fP
T}	T{
1 1
T}	T{
Psi (or Digamma) of A
T}
_
T{
\fBPV\fP
T}	T{
3 1
T}	T{
Legendre function Pv(A) of degree v = real(B) + imag(C)
T}
_
T{
\fBQV\fP
T}	T{
3 1
T}	T{
Legendre function Qv(A) of degree v = real(B) + imag(C)
T}
_
T{
\fBR2\fP
T}	T{
2 1
T}	T{
R2 = A^2 + B^2
T}
_
T{
\fBR2D\fP
T}	T{
1 1
T}	T{
Convert radians to degrees
T}
_
T{
\fBRAND\fP
T}	T{
2 1
T}	T{
Uniform random values between A and B
T}
_
T{
\fBRCDF\fP
T}	T{
1 1
T}	T{
Rayleigh cumulative distribution function for z = A
T}
_
T{
\fBRCRIT\fP
T}	T{
1 1
T}	T{
Rayleigh distribution critical value for alpha = A
T}
_
T{
\fBRINT\fP
T}	T{
1 1
T}	T{
rint (A) (round to integral value nearest to A)
T}
_
T{
\fBRMS\fP
T}	T{
1 1
T}	T{
Root\-mean\-square of A
T}
_
T{
\fBRMSW\fP
T}	T{
1 1
T}	T{
Weighted root\-mean\-square of A for weights in B
T}
_
T{
\fBRPDF\fP
T}	T{
1 1
T}	T{
Rayleigh probability density function for z = A
T}
_
T{
\fBROLL\fP
T}	T{
2 0
T}	T{
Cyclicly shifts the top A stack items by an amount B
T}
_
T{
\fBROTT\fP
T}	T{
2 1
T}	T{
Rotate A by the (constant) shift B in the t\-direction
T}
_
T{
\fBSEC\fP
T}	T{
1 1
T}	T{
sec (A) (A in radians)
T}
_
T{
\fBSECD\fP
T}	T{
1 1
T}	T{
sec (A) (A in degrees)
T}
_
T{
\fBSIGN\fP
T}	T{
1 1
T}	T{
sign (+1 or \-1) of A
T}
_
T{
\fBSIN\fP
T}	T{
1 1
T}	T{
sin (A) (A in radians)
T}
_
T{
\fBSINC\fP
T}	T{
1 1
T}	T{
sinc (A) (sin (pi*A)/(pi*A))
T}
_
T{
\fBSIND\fP
T}	T{
1 1
T}	T{
sin (A) (A in degrees)
T}
_
T{
\fBSINH\fP
T}	T{
1 1
T}	T{
sinh (A)
T}
_
T{
\fBSKEW\fP
T}	T{
1 1
T}	T{
Skewness of A
T}
_
T{
\fBSQR\fP
T}	T{
1 1
T}	T{
A^2
T}
_
T{
\fBSQRT\fP
T}	T{
1 1
T}	T{
sqrt (A)
T}
_
T{
\fBSTD\fP
T}	T{
1 1
T}	T{
Standard deviation of A
T}
_
T{
\fBSTDW\fP
T}	T{
2 1
T}	T{
Weighted standard deviation of A for weights in B
T}
_
T{
\fBSTEP\fP
T}	T{
1 1
T}	T{
Heaviside step function H(A)
T}
_
T{
\fBSTEPT\fP
T}	T{
1 1
T}	T{
Heaviside step function H(t\-A)
T}
_
T{
\fBSUB\fP
T}	T{
2 1
T}	T{
A \- B
T}
_
T{
\fBSUM\fP
T}	T{
1 1
T}	T{
Cumulative sum of A
T}
_
T{
\fBTAN\fP
T}	T{
1 1
T}	T{
tan (A) (A in radians)
T}
_
T{
\fBTAND\fP
T}	T{
1 1
T}	T{
tan (A) (A in degrees)
T}
_
T{
\fBTANH\fP
T}	T{
1 1
T}	T{
tanh (A)
T}
_
T{
\fBTAPER\fP
T}	T{
1 1
T}	T{
Unit weights cosine\-tapered to zero within A of end margins
T}
_
T{
\fBTN\fP
T}	T{
2 1
T}	T{
Chebyshev polynomial Tn(\-1<A<+1) of degree B
T}
_
T{
\fBTCRIT\fP
T}	T{
2 1
T}	T{
Student\(aqs t distribution critical value for alpha = A and nu = B
T}
_
T{
\fBTPDF\fP
T}	T{
2 1
T}	T{
Student\(aqs t probability density function for t = A, and nu = B
T}
_
T{
\fBTCDF\fP
T}	T{
2 1
T}	T{
Student\(aqs t cumulative distribution function for t = A, and nu = B
T}
_
T{
\fBUPPER\fP
T}	T{
1 1
T}	T{
The highest (maximum) value of A
T}
_
T{
\fBVAR\fP
T}	T{
1 1
T}	T{
Variance of A
T}
_
T{
\fBVARW\fP
T}	T{
2 1
T}	T{
Weighted variance of A for weights in B
T}
_
T{
\fBWCDF\fP
T}	T{
3 1
T}	T{
Weibull cumulative distribution function for x = A, scale = B, and shape = C
T}
_
T{
\fBWCRIT\fP
T}	T{
3 1
T}	T{
Weibull distribution critical value for alpha = A, scale = B, and shape = C
T}
_
T{
\fBWPDF\fP
T}	T{
3 1
T}	T{
Weibull density distribution P(x,scale,shape), with x = A, scale = B, and shape = C
T}
_
T{
\fBXOR\fP
T}	T{
2 1
T}	T{
B if A == NaN, else A
T}
_
T{
\fBY0\fP
T}	T{
1 1
T}	T{
Bessel function of A (2nd kind, order 0)
T}
_
T{
\fBY1\fP
T}	T{
1 1
T}	T{
Bessel function of A (2nd kind, order 1)
T}
_
T{
\fBYN\fP
T}	T{
2 1
T}	T{
Bessel function of A (2nd kind, order B)
T}
_
T{
\fBZCDF\fP
T}	T{
1 1
T}	T{
Normal cumulative distribution function for z = A
T}
_
T{
\fBZPDF\fP
T}	T{
1 1
T}	T{
Normal probability density function for z = A
T}
_
T{
\fBZCRIT\fP
T}	T{
1 1
T}	T{
Normal distribution critical value for alpha = A
T}
_
T{
\fBROOTS\fP
T}	T{
2 1
T}	T{
Treats col A as f(t) = 0 and returns its roots
T}
_
.TE
.SH SYMBOLS
.sp
The following symbols have special meaning:
.TS
center;
|l|l|.
_
T{
\fBPI\fP
T}	T{
3.1415926...
T}
_
T{
\fBE\fP
T}	T{
2.7182818...
T}
_
T{
\fBEULER\fP
T}	T{
0.5772156...
T}
_
T{
\fBEPS_F\fP
T}	T{
1.192092896e\-07 (sgl. prec. eps)
T}
_
T{
\fBEPS_D\fP
T}	T{
2.2204460492503131e\-16 (dbl. prec. eps)
T}
_
T{
\fBTMIN\fP
T}	T{
Minimum t value
T}
_
T{
\fBTMAX\fP
T}	T{
Maximum t value
T}
_
T{
\fBTRANGE\fP
T}	T{
Range of t values
T}
_
T{
\fBTINC\fP
T}	T{
t increment
T}
_
T{
\fBN\fP
T}	T{
The number of records
T}
_
T{
\fBT\fP
T}	T{
Table with t\-coordinates
T}
_
T{
\fBTNORM\fP
T}	T{
Table with normalized t\-coordinates
T}
_
T{
\fBTROW\fP
T}	T{
Table with row numbers 1, 2, ..., N\-1
T}
_
.TE
.SH ASCII FORMAT PRECISION
.sp
The ASCII output formats of numerical data are controlled by parameters
in your gmt.conf file. Longitude and latitude are formatted
according to FORMAT_GEO_OUT, absolute time is
under the control of FORMAT_DATE_OUT and
FORMAT_CLOCK_OUT, whereas general floating point values are formatted
according to FORMAT_FLOAT_OUT\&. Be aware that the format in effect
can lead to loss of precision in ASCII output, which can lead to various
problems downstream. If you find the output is not written with enough
precision, consider switching to binary output (\fB\-bo\fP if available) or
specify more decimals using the FORMAT_FLOAT_OUT setting.
.SH NOTES ON OPERATORS
.sp
1. The operators \fBPLM\fP and \fBPLMg\fP calculate the associated Legendre
polynomial of degree L and order M in x which must satisfy \-1 <= x <= +1
and 0 <= M <= L. x, L, and M are the three arguments preceding the
operator. \fBPLM\fP is not normalized and includes the Condon\-Shortley
phase (\-1)^M. \fBPLMg\fP is normalized in the way that is most commonly
used in geophysics. The C\-S phase can be added by using \-M as argument.
\fBPLM\fP will overflow at higher degrees, whereas \fBPLMg\fP is stable
until ultra high degrees (at least 3000).
.sp
2. Files that have the same names as some operators, e.g., \fBADD\fP,
\fBSIGN\fP, \fB=\fP, etc. should be identified by prepending the current
directory (i.e., ./).
.INDENT 0.0
.IP 3. 3
The stack depth limit is hard\-wired to 100.
.UNINDENT
.sp
4. All functions expecting a positive radius (e.g., \fBLOG\fP, \fBKEI\fP,
etc.) are passed the absolute value of their argument.
.INDENT 0.0
.IP 5. 3
The \fBDDT\fP and \fBD2DT2\fP functions only work on regularly spaced data.
.UNINDENT
.sp
6. All derivatives are based on central finite differences, with
natural boundary conditions.
.INDENT 0.0
.IP 7. 3
\fBROOTS\fP must be the last operator on the stack, only followed by \fB=\fP\&.
.UNINDENT
.SH STORE, RECALL AND CLEAR
.sp
You may store intermediate calculations to a named variable that you may
recall and place on the stack at a later time. This is useful if you
need access to a computed quantity many times in your expression as it
will shorten the overall expression and improve readability. To save a
result you use the special operator \fBSTO\fP@\fIlabel\fP, where \fIlabel\fP
is the name you choose to give the quantity. To recall the stored result
to the stack at a later time, use [\fBRCL\fP]@\fIlabel\fP, i.e., \fBRCL\fP
is optional. To clear memory you may use \fBCLR\fP@\fIlabel\fP\&. Note that
\fBSTO\fP and \fBCLR\fP leave the stack unchanged.
.sp
8. The bitwise operators
(\fBBITAND\fP, \fBBITLEFT\fP, \fBBITNOT\fP, \fBBITOR\fP, \fBBITRIGHT\fP,
\fBBITTEST\fP, and \fBBITXOR\fP) convert a tables\(aqs double precision values
to unsigned 64\-bit ints to perform the bitwise operations. Consequently,
the largest whole integer value that can be stored in a double precision
value is 2^53 or 9,007,199,254,740,992. Any higher result will be masked
to fit in the lower 54 bits.  Thus, bit operations are effectively limited
to 54 bits.  All bitwise operators return NaN if given NaN arguments or
bit\-settings <= 0.
.sp
9. TAPER will interpret its argument to be a width in the same units as
the time\-axis, but if no time is provided (i.e., plain data tables) then
the width is taken to be given in number of rows.
.SH MACROS
.sp
Users may save their favorite operator combinations as macros via the
file \fIgmtmath.macros\fP in their current or user directory. The file may contain
any number of macros (one per record); comment lines starting with # are
skipped. The format for the macros is \fBname\fP = \fBarg1 arg2 ... arg2\fP
[ : \fIcomment\fP] where \fBname\fP is how the macro will be used. When this
operator appears on the command line we simply replace it with the
listed argument list. No macro may call another macro. As an example,
the following macro expects that the time\-column contains seafloor ages
in Myr and computes the predicted half\-space bathymetry:
.sp
\fBDEPTH\fP = \fBSQRT 350 MUL 2500 ADD NEG\fP : \fIusage: DEPTH to return
half\-space seafloor depths\fP
.sp
Note: Because geographic or time constants may be present in a macro, it
is required that the optional comment flag (:) must be followed by a space.
As another example, we show a macro \fBGPSWEEK\fP which determines which GPS week
a timestamp belongs to:
.sp
\fBGPSWEEK\fP = 1980\-01\-06T00:00:00 SUB 86400 DIV 7 DIV FLOOR : GPS week without rollover
.SH ACTIVE COLUMN SELECTION
.sp
When \fB\-C\fP\fIcols\fP is set then any operation, including loading of data from files, will
restrict which columns are affected.
To avoid unexpected results, note that if you issue a \fB\-C\fP\fIcols\fP option before you load
in the data then only those columns will be updated, hence the unspecified columns will be zero.
On the other hand, if you load the file first and then issue \fB\-C\fP\fIcols\fP then the unspecified
columns will have been loaded but are then ignored until you undo the effect of \fB\-C\fP\&.
.SH EXAMPLES
.sp
To add two plot dimensions of different units, we can run
.INDENT 0.0
.INDENT 3.5
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
length=\(gagmt math \-Q 15c 2i SUB =\(ga
.ft P
.fi
.UNINDENT
.UNINDENT
.UNINDENT
.UNINDENT
.sp
To take the square root of the content of the second data column being
piped through \fBgmtmath\fP by process1 and pipe it through a 3rd process, use
.INDENT 0.0
.INDENT 3.5
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
process1 | gmt math STDIN SQRT = | process3
.ft P
.fi
.UNINDENT
.UNINDENT
.UNINDENT
.UNINDENT
.sp
To take log10 of the average of 2 data files, use
.INDENT 0.0
.INDENT 3.5
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
gmt math file1.d file2.d ADD 0.5 MUL LOG10 = file3.d
.ft P
.fi
.UNINDENT
.UNINDENT
.UNINDENT
.UNINDENT
.sp
Given the file samples.d, which holds seafloor ages in m.y. and seafloor
depth in m, use the relation depth(in m) = 2500 + 350 * sqrt (age) to
print the depth anomalies:
.INDENT 0.0
.INDENT 3.5
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
gmt math samples.d T SQRT 350 MUL 2500 ADD SUB = | lpr
.ft P
.fi
.UNINDENT
.UNINDENT
.UNINDENT
.UNINDENT
.sp
To take the average of columns 1 and 4\-6 in the three data sets sizes.1,
sizes.2, and sizes.3, use
.INDENT 0.0
.INDENT 3.5
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
gmt math \-C1,4\-6 sizes.1 sizes.2 ADD sizes.3 ADD 3 DIV = ave.d
.ft P
.fi
.UNINDENT
.UNINDENT
.UNINDENT
.UNINDENT
.sp
To take the 1\-column data set ages.d and calculate the modal value and
assign it to a variable, try
.INDENT 0.0
.INDENT 3.5
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
gmt set mode_age = \(gagmt math \-S \-T ages.d MODE =\(ga
.ft P
.fi
.UNINDENT
.UNINDENT
.UNINDENT
.UNINDENT
.sp
To evaluate the dilog(x) function for coordinates given in the file t.d:
.INDENT 0.0
.INDENT 3.5
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
gmt math \-Tt.d T DILOG = dilog.d
.ft P
.fi
.UNINDENT
.UNINDENT
.UNINDENT
.UNINDENT
.sp
To demonstrate the use of stored variables, consider this sum of the
first 3 cosine harmonics where we store and repeatedly recall the
trigonometric argument (2*pi*T/360):
.INDENT 0.0
.INDENT 3.5
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
gmt math \-T0/360/1 2 PI MUL 360 DIV T MUL STO@kT COS @kT 2 MUL COS ADD \e
            @kT 3 MUL COS ADD = harmonics.d
.ft P
.fi
.UNINDENT
.UNINDENT
.UNINDENT
.UNINDENT
.sp
To use \fBgmtmath\fP as a RPN Hewlett\-Packard calculator on scalars (i.e., no
input files) and calculate arbitrary expressions, use the \fB\-Q\fP option.
As an example, we will calculate the value of Kei (((1 + 1.75)/2.2) +
cos (60)) and store the result in the shell variable z:
.INDENT 0.0
.INDENT 3.5
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
set z = \(gagmt math \-Q 1 1.75 ADD 2.2 DIV 60 COSD ADD KEI =\(ga
.ft P
.fi
.UNINDENT
.UNINDENT
.UNINDENT
.UNINDENT
.sp
To use \fBgmtmath\fP as a general least squares equation solver, imagine
that the current table is the augmented matrix [ A | b ] and you want
the least squares solution x to the matrix equation A * x = b. The
operator \fBLSQFIT\fP does this; it is your job to populate the matrix
correctly first. The \fB\-A\fP option will facilitate this. Suppose you
have a 2\-column file ty.d with \fIt\fP and \fIb(t)\fP and you would like to fit
a the model y(t) = a + b*t + c*H(t\-t0), where H is the Heaviside step
function for a given t0 = 1.55. Then, you need a 4\-column augmented
table loaded with t in column 1 and your observed y(t) in column 3. The
calculation becomes
.INDENT 0.0
.INDENT 3.5
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
gmt math \-N4/1 \-Aty.d \-C0 1 ADD \-C2 1.55 STEPT ADD \-Ca LSQFIT = solution.d
.ft P
.fi
.UNINDENT
.UNINDENT
.UNINDENT
.UNINDENT
.sp
Note we use the \fB\-C\fP option to select which columns we are working on,
then make active all the columns we need (here all of them, with
\fB\-Ca\fP) before calling \fBLSQFIT\fP\&. The second and fourth columns (col
numbers 1 and 3) are preloaded with t and y(t), respectively, the other
columns are zero. If you already have a pre\-calculated table with the
augmented matrix [ A | b ] in a file (say lsqsys.d), the least squares
solution is simply
.INDENT 0.0
.INDENT 3.5
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
gmt math \-T lsqsys.d LSQFIT = solution.d
.ft P
.fi
.UNINDENT
.UNINDENT
.UNINDENT
.UNINDENT
.sp
Users must be aware that when \fB\-C\fP controls which columns are to be
active the control extends to placing columns from files as well.
Contrast the different result obtained by these very similar commands:
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
echo 1 2 3 4 | gmt math STDIN \-C3 1 ADD =
1    2    3    5
.ft P
.fi
.UNINDENT
.UNINDENT
.sp
versus
.INDENT 0.0
.INDENT 3.5
.sp
.nf
.ft C
echo 1 2 3 4 | gmt math \-C3 STDIN 1 ADD =
0    0    0    5
.ft P
.fi
.UNINDENT
.UNINDENT
.SH REFERENCES
.sp
Abramowitz, M., and I. A. Stegun, 1964, \fIHandbook of Mathematical
Functions\fP, Applied Mathematics Series, vol. 55, Dover, New York.
.sp
Holmes, S. A., and W. E. Featherstone, 2002, A unified approach to the
Clenshaw summation and the recursive computation of very high degree and
order normalized associated Legendre functions. \fIJournal of Geodesy\fP,
76, 279\-299.
.sp
Press, W. H., S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery,
1992, \fINumerical Recipes\fP, 2nd edition, Cambridge Univ., New York.
.sp
Spanier, J., and K. B. Oldman, 1987, \fIAn Atlas of Functions\fP, Hemisphere
Publishing Corp.
.SH SEE ALSO
.sp
gmt,
grdmath
.SH COPYRIGHT
2019, P. Wessel, W. H. F. Smith, R. Scharroo, J. Luis, and F. Wobbe
.\" Generated by docutils manpage writer.
.