gmtmath (1) - Linux Man Pages
gmtmath: Reverse Polish Notation (RPN) calculator for data tables
NAMEgmtmath - Reverse Polish Notation (RPN) calculator for data tables
gmtmath [ t_f(t).d[+e][+s|w] ] [ cols ] [ eigen ] [ ] [ n_col[/t_col] ] [ ] [ [f|l] ] [ t_min/t_max/t_inc[+]|tfile ] [ [level] ] [ -b<binary> ] [ -d<nodata> ] [ -f<flags> ] [ -g<gaps> ] [ -h<headers> ] [ -i<flags> ] [ -o<flags> ] [ -s<flags> ] operand [ operand ] OPERATOR [ operand ] OPERATOR ... = [ outfile ]
gmtmath 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 -T, -N can be set (and optionally -bo 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 -C). Complicated or frequently occurring expressions may be coded as a macro for future use or stored and recalled via named memory locations.
- If operand can be opened as a file it will be read as an ASCII (or binary, see -bi) 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 stdin will be read and placed on the stack; STDIN can appear more than once if necessary.
- The name of a table data file that will hold the final result. If not given then the output is sent to stdout.
- Requires -N and will partially initialize a table with values from the given file containing t and f(t) only. The t is placed in column t_col while f(t) goes into column n_col - 1 (see -N). If used with operators LSQFIT and SVDFIT you can optionally append the modifier +e 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 +w if t_f(t).d has a third column with weights, or append +s if t_f(t).d 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 +e is in effect.
- Select the columns that will be operated on until next occurrence of -C. List columns separated by commas; ranges like 1,3-5,7 are allowed. -C (no arguments) resets the default action of using all columns except time column (see -N). -Ca selects all columns, including time column, while -Cr reverses (toggles) the current choices. When -C is in effect it also controls which columns from a file will be placed on the stack.
- 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.
- Reverses the output row sequence from ascending time to descending [ascending].
- Select the number of columns and optionally the column number that contains the "time" variable . Columns are numbered starting at 0 [2/0]. If input files are specified then -N will add any missing columns.
- Quick mode for scalar calculation. Shorthand for -Ca -N1/0 -T0/0/1.
- 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 MODE) and only want to report a single number instead of numerous records with identical values. Append l to get the last row and f to get the first row only [Default].
- 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 -N). Append + if you are specifying the number of equidistant points instead. If there is no time column (only data columns), give -T with no arguments; this also implies -Ca. Alternatively, give the name of a file whose first column contains the desired t-coordinates which may be irregular.
- -V[level] (more ...)
- Select verbosity level [c].
- -bi[ncols][t] (more ...)
- Select native binary input.
- -bo[ncols][type] (more ...)
- Select native binary output. [Default is same as input, but see -o]
- -d[i|o]nodata (more ...)
- Replace input columns that equal nodata with NaN and do the reverse on output.
- -f[i|o]colinfo (more ...)
- Specify data types of input and/or output columns.
- -g[a]x|y|d|X|Y|D|[col]z[+|-]gap[u] (more ...)
- Determine data gaps and line breaks.
- -h[i|o][n][+c][+d][+rremark][+rtitle] (more ...)
- Skip or produce header record(s).
- -icols[l][sscale][ooffset][,...] (more ...)
- Select input columns (0 is first column).
- -ocols[,...] (more ...)
- Select output columns (0 is first column).
- -s[cols][a|r] (more ...)
- Set handling of NaN records.
- -^ or just -
- Print a short message about the syntax of the command, then exits (NOTE: on Windows use just -).
- -+ or just +
- Print an extensive usage (help) message, including the explanation of any module-specific option (but not the GMT common options), then exits.
- -? or no arguments
- Print a complete usage (help) message, including the explanation of options, then exits.
- Print GMT version and exit.
- Print full path to GMT share directory and exit.
Choose among the following 146 operators. "args" are the number of input and output arguments.
A + B
B if A == NaN, else A
atan2 (A, B)
Binomial cumulative distribution function for p = A, n = B, and x = C
Binomial probability density function for p = A, n = B, and x = C
A & B (bitwise AND operator)
A << B (bitwise left-shift operator)
~A (bitwise NOT operator, i.e., return two's complement)
A | B (bitwise OR operator)
A >> B (bitwise right-shift operator)
1 if bit B of A is set, else 0 (bitwise TEST operator)
A ^ B (bitwise XOR operator)
ceil (A) (smallest integer >= A)
Chi-squared distribution critical value for alpha = A and nu = B
Chi-squared cumulative distribution function for chi2 = A and nu = B
Chi-squared probability density function for chi2 = A and nu = B
Places column A on the stack
Combinations n_C_r, with n = A and r = B
Correlation coefficient r(A, B)
cos (A) (A in radians)
cos (A) (A in degrees)
cot (A) (A in radians)
cot (A) (A in degrees)
csc (A) (A in radians)
csc (A) (A in degrees)
d(A)/dt Central 1st derivative
d^2(A)/dt^2 2nd derivative
Converts Degrees to Radians
Replace NaNs in A with values from B
Difference between adjacent elements of A (A-A, A-A, ..., 0)
A / B
Places duplicate of A on the stack
Exponential cumulative distribution function for x = A and lambda = B
Exponential distribution critical value for alpha = A and lambda = B
Exponential probability density function for x = A and lambda = B
Error function erf (A)
Complementary Error function erfc (A)
Inverse error function of A
1 if A == B, else 0
Exchanges A and B on the stack
A! (A factorial)
F cumulative distribution function for F = A, nu1 = B, and nu2 = C
F distribution critical value for alpha = A, nu1 = B, and nu2 = C
Reverse order of each column
floor (A) (greatest integer <= A)
A % B (remainder after truncated division)
F probability density function for F = A, nu1 = B, and nu2 = C
1 if A >= B, else 0
1 if A > B, else 0
hypot (A, B) = sqrt (A*A + B*B)
Modified Bessel function of A (1st kind, order 0)
Modified Bessel function of A (1st kind, order 1)
B if A != 0, else C
Modified Bessel function of A (1st kind, order B)
1 if B <= A <= C, else 0
Numerically integrate A
1 / A
1 if A is finite, else 0
1 if A == NaN, else 0
Bessel function of A (1st kind, order 0)
Bessel function of A (1st kind, order 1)
Bessel function of A (1st kind, order B)
Modified Kelvin function of A (2nd kind, order 0)
Modified Bessel function of A (2nd kind, order 1)
Modified Bessel function of A (2nd kind, order B)
Kurtosis of A
Laplace cumulative distribution function for z = A
Laplace distribution critical value for alpha = A
1 if A <= B, else 0
LMS scale estimate (LMS STD) of A
log (A) (natural log)
log10 (A) (base 10)
log (1+A) (accurate for small A)
log2 (A) (base 2)
The lowest (minimum) value of A
Laplace probability density function for z = A
Laplace random noise with mean A and std. deviation B
Let current table be [A | b] return least squares solution x = A \ b
1 if A < B, else 0
Median Absolute Deviation (L1 STD) of A
Maximum of A and B
Mean value of A
Median value of A
Minimum of A and B
A mod B (remainder after floored division)
Mode value (Least Median of Squares) of A
A * B
NaN if A == B, else A
1 if A != B, else 0
Normalize (A) so max(A)-min(A) = 1
NaN if A == NaN, 1 if A == 0, else 0
Normal, random values with mean A and std. deviation B
NaN if B == NaN, else A
Poisson cumulative distribution function for x = A and lambda = B
Permutations n_P_r, with n = A and r = B
Poisson distribution P(x,lambda), with x = A and lambda = B
Associated Legendre polynomial P(A) degree B order C
Normalized associated Legendre polynomial P(A) degree B order C (geophysical convention)
Delete top element from the stack
A ^ B
The B'th Quantile (0-100%) of A
Psi (or Digamma) of A
Legendre function Pv(A) of degree v = real(B) + imag(C)
Legendre function Qv(A) of degree v = real(B) + imag(C)
R2 = A^2 + B^2
Convert Radians to Degrees
Uniform random values between A and B
Rayleigh cumulative distribution function for z = A
Rayleigh distribution critical value for alpha = A
rint (A) (round to integral value nearest to A)
Rayleigh probability density function for z = A
Cyclicly shifts the top A stack items by an amount B
Rotate A by the (constant) shift B in the t-direction
sec (A) (A in radians)
sec (A) (A in degrees)
sign (+1 or -1) of A
sin (A) (A in radians)
sinc (A) (sin (pi*A)/(pi*A))
sin (A) (A in degrees)
Skewness of A
Standard deviation of A
Heaviside step function H(A)
Heaviside step function H(t-A)
A - B
Cumulative sum of A
tan (A) (A in radians)
tan (A) (A in degrees)
Unit weights cosine-tapered to zero within A of end margins
Chebyshev polynomial Tn(-1<A<+1) of degree B
Student's t distribution critical value for alpha = A and nu = B
Student's t probability density function for t = A, and nu = B
Student's t cumulative distribution function for t = A, and nu = B
The highest (maximum) value of A
Weibull cumulative distribution function for x = A, scale = B, and shape = C
Weibull distribution critical value for alpha = A, scale = B, and shape = C
Weibull density distribution P(x,scale,shape), with x = A, scale = B, and shape = C
B if A == NaN, else A
Bessel function of A (2nd kind, order 0)
Bessel function of A (2nd kind, order 1)
Bessel function of A (2nd kind, order B)
Normal cumulative distribution function for z = A
Normal probability density function for z = A
Normal distribution critical value for alpha = A
Treats col A as f(t) = 0 and returns its roots
The following symbols have special meaning:
1.192092896e-07 (sgl. prec. eps)
2.2204460492503131e-16 (dbl. prec. eps)
Minimum t value
Maximum t value
Range of t values
The number of records
Table with t-coordinates
Table with normalized t-coordinates
Table with row numbers 1, 2, ..., N-1
ASCII FORMAT PRECISION
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, whereas other values are formatted according to FORMAT_FLOAT_OUT. Be aware that the format in effect can lead to loss of precision in the output, which can lead to various problems downstream. If you find the output is not written with enough precision, consider switching to binary output (-bo if available) or specify more decimals using the FORMAT_FLOAT_OUT setting.
NOTES ON OPERATORS
1. The operators PLM and PLMg 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. PLM is not normalized and includes the Condon-Shortley phase (-1)^M. PLMg is normalized in the way that is most commonly used in geophysics. The C-S phase can be added by using -M as argument. PLM will overflow at higher degrees, whereas PLMg is stable until ultra high degrees (at least 3000).
2. Files that have the same names as some operators, e.g., ADD, SIGN, =, etc. should be identified by prepending the current directory (i.e., ./).
The stack depth limit is hard-wired to 100.
4. All functions expecting a positive radius (e.g., LOG, KEI, etc.) are passed the absolute value of their argument.
The DDT and D2DT2 functions only work on regularly spaced data.
6. All derivatives are based on central finite differences, with natural boundary conditions.
- ROOTS must be the last operator on the stack, only followed by =.
STORE, RECALL AND CLEAR
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 STO@label, where label is the name you choose to give the quantity. To recall the stored result to the stack at a later time, use [RCL]@label, i.e., RCL is optional. To clear memory you may use CLR@label. Note that STO and CLR leave the stack unchanged.
8. The bitwise operators (BITAND, BITLEFT, BITNOT, BITOR, BITRIGHT, BITTEST, and BITXOR) convert a tables's 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.
Users may save their favorite operator combinations as macros via the file gmtmath.macros 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 name = arg1 arg2 ... arg2 [ : comment] where name 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:
DEPTH = SQRT 350 MUL 2500 ADD NEG : usage: DEPTH to return half-space seafloor depths
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 GPSWEEK which determines which GPS week a timestamp belongs to:
To take the square root of the content of the second data column being piped through gmtmath by process1 and pipe it through a 3rd process, use
process1 | gmt math STDIN SQRT = | process3
To take log10 of the average of 2 data files, use
gmt math file1.d file2.d ADD 0.5 MUL LOG10 = file3.d
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:
gmt math samples.d T SQRT 350 MUL 2500 ADD SUB = | lpr
To take the average of columns 1 and 4-6 in the three data sets sizes.1, sizes.2, and sizes.3, use
gmt math -C1,4-6 sizes.1 sizes.2 ADD sizes.3 ADD 3 DIV = ave.d
To take the 1-column data set ages.d and calculate the modal value and assign it to a variable, try
gmt set mode_age = `gmt math -S -T ages.d MODE =`
To evaluate the dilog(x) function for coordinates given in the file t.d:
gmt math -Tt.d T DILOG = dilog.d
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):
gmt math -T0/360/1 2 PI MUL 360 DIV T MUL STO@kT COS @kT 2 MUL COS ADD \ @kT 3 MUL COS ADD = harmonics.d
To use gmtmath as a RPN Hewlett-Packard calculator on scalars (i.e., no input files) and calculate arbitrary expressions, use the -Q 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:
set z = `gmt math -Q 1 1.75 ADD 2.2 DIV 60 COSD ADD KEI =`
To use gmtmath 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 LSQFIT does this; it is your job to populate the matrix correctly first. The -A option will facilitate this. Suppose you have a 2-column file ty.d with t and b(t) 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
gmt math -N4/1 -Aty.d -C0 1 ADD -C2 1.55 STEPT ADD -Ca LSQFIT = solution.d
Note we use the -C option to select which columns we are working on, then make active all the columns we need (here all of them, with -Ca) before calling LSQFIT. 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
gmt math -T lsqsys.d LSQFIT = solution.d
Users must be aware that when -C 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:
echo 1 2 3 4 | gmt math STDIN -C3 1 ADD = 1 2 3 5
echo 1 2 3 4 | gmt math -C3 STDIN 1 ADD = 0 0 0 5
Abramowitz, M., and I. A. Stegun, 1964, Handbook of Mathematical Functions, Applied Mathematics Series, vol. 55, Dover, New York.
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. Journal of Geodesy, 76, 279-299.
Press, W. H., S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, 1992, Numerical Recipes, 2nd edition, Cambridge Univ., New York.
COPYRIGHT2015, P. Wessel, W. H. F. Smith, R. Scharroo, J. Luis, and F. Wobbe