| Active Operators in CalcLib Build 2^(-4) * 5^(-3) * 4046101 | |
|---|---|
Operator | A simple description of the actions of each operator |
| ! | Unary conventional factorial operator |
| !! | Unary parity factorial operator |
| # | Array indexing operation implemented as a binary operator |
| #! | Primorial function on integer prime index |
| ## | Binomial coefficient operator (n ## k) |
| #$# | Bells Triangle operator (n #$# m) |
| #%# | Euler numbers operator (n #%# m) |
| #*^ | Evaluate an Euler polynomial defined by a specified order |
| #/ | Binary Factorial falling operator |
| #/# | Arithmetic division operator (expressed as fraction) |
| $! | Subfactorial function on integer parameter |
| $# | Mark function call for Trapezoidal integral approximation |
| $$ | Stirling numbers (first) operator (n $$ k) |
| $$$ | Stirling numbers (second) operator (n $$$ k) |
| $% | Mark function call for adjustment for brute force approximation |
| $@ | Mark function call for Clenshaw-Curtis integral approximation |
| $| | Mark function call for Tanh-Sinh integral approximation |
| % | Binary conventional remainder operator n%m; integer only |
| & | Logical AND |
| ' | Mark function call for first derivative approximation |
| '' | Mark function call for second derivative approximation |
| * | Arithmetic multiplication operator |
| *%* | Cross product of two arrays; lengths of arrays must match |
| ** | Binary conventional exponentiation operator x**y |
| *@* | Dot product of two arrays; lengths of arrays must match |
| *\ | Binary root operator (left [times root of] right) |
| *^# | Evaluate an exponential ( a * exp (b * x) ) defined by an array containing (a : b) |
| *^* | Compute tensor product of two matrices |
| + | Arithmetic addition operator |
| +#* | Evaluate a harmonic series defined by an array of coefficients ( c0 + c1*cos(x) + c2*cos(2x) + ... ) |
| +*^ | Evaluate a polynomial defined by an array of coefficients ( c0 + c1*x + c2*x^2 + ... ) |
| +*^' | Evaluate a polynomial derivative defined by an array of coefficients ( c0 + c1*x + c2*x^2 + ... ) |
| +*^'' | Evaluate a polynomial second derivative defined by an array of coefficients ( c0 + c1*x + c2*x^2 + ... ) |
| +|- | Plus or Minus operator |
| - | Arithmetic (binary) subtraction or (unary) negate operator |
| -# | Matrix indexing operation selecting row vector |
| -> | Lambda anonymous function declarative expression |
| -|+ | Minus or Plus operator |
| . | Dot product of two arrays; lengths of arrays must match |
| .. | Array range operation implemented as a binary operator |
| / | Arithmetic division operator |
| /# | Binary Factorial rising operator |
| /#+ | Pochhammer rising operator |
| /% | Divisor and remainder from operator |
| : | Choice based on condition code |
| < | Less than |
| <*> | Integral delta marker for presentation |
| << | Left shift operator |
| <<= | Logical implied by |
| <= | Less than or equal to |
| <> | Derivative approximation evaluated at left parameter using delta value in right parameter |
| <|| | Less than absolute value of |
| == | Equal to |
| =>> | Logical implies |
| > | Greater than |
| >= | Greater than or equal to |
| >> | Right shift operator |
| >|| | Greater than absolute value of |
| ? | Logical condition code set |
| @# | Evaluate function defined by array at X |
| @*^ | Evaluate a Chebyshev polynomial using Clenshaw's special case defined by an array of coefficients ( c0 + c1*T[1](x) + c2*T[2](x) + ... ) |
| @*^' | Evaluate a Chebyshev polynomial derivative using Clenshaw's special case defined by an array of coefficients,ClenshawPrime |
| @*^'' | Evaluate a Chebyshev polynomial second derivative using Clenshaw's special case defined by an array of coefficients |
| @| | Pointer dereference |
| ADJ | Compute adjugate of matrix |
| APPEND | Append a series of arrays into one long array |
| ARRAY | Collect values into array |
| ARRAYDER | Compute derivative of function described by array |
| ARRAYINT | Compute integral of function described by array |
| AUGMENTED | Construct augmented matrix from source matrix and additional column |
| BERNOULLI | Bernoulli function B(m) for second (n=1) Bernoulli numbers |
| CEIL | Ceiling function for a factored value |
| CHARACTERISTIC | Compute characteristic polynomial for matrix |
| CHEBDER | Compute derivative of Chebyshev T polynomial |
| CHEBDOM | Compute domain across given number of Chebyshev points |
| CHEBINTERP | Generate Chebyshev interpolation polynomial for function described by array |
| CHEBPTS | Compute given number of Chebyshev points |
| CHEBYSHEV | Apply Vandermonde matrix to solve for Chebyshev interpolation polynomial as curve of best fit |
| CLENQUAD | Compute integral of function described by Chebyshev polynomial |
| COFACTOR | Compute cofactor matrix from source |
| COL | Read column vector from matrix |
| COMATRIX | Compute comatrix matrix from source |
| CONCAT | Append a series of arrays into one long array |
| CONV | Compute product of polynomials |
| DECOMPOSE | Decompose a matrix using a linear algebra library instance |
| DECONV | Compute quotient of polynomials |
| DET | Compute determinant of matrix |
| DIVREM | Divisor and remainder from integer division |
| DOT | Dot product of two arrays; lengths of arrays must match |
| DYADIC | Compute dyadic product of 2 arrays |
| EIG | Compute Von Mises dominant eigen-pair |
| EVALSPLINE | Evaluate a VC31 spline function at specified parameter |
| FACTORS | Get an array of all prime factors of the parameter |
| FALSE | Logical FALSE |
| FITEXP | Apply non-linear (logarithmic) regression to find curve of best fit |
| FITHARMONIC | Apply harmonic series regression to find curve of best fit |
| FITLINE | Apply least squares regression to find line of best fit |
| FITPOLY | Apply Vandermonde matrix to solve for polynomial coefficients to find curve of best fit |
| FLOOR | Floor function for a factored value |
| FUDGE | Adjust blob factor to reduce representation size |
| GAUSSIAN | Solve linear equations with Gaussian elimination |
| GAUSSQUAD | Apply Gauss Quadrature to build an integral of an interpolated Lagrange polynomial |
| GCD | Common divisor of two integers |
| GCF | Greatest Common Factor of two integers |
| GENKNOT | Construct a zero knot for odd or even functions |
| GET | Get a component of a structure |
| HARMONIC | Harmonic function |
| HYPOT | Distance in multi-dimensional space; SQRT of sum of squares of array elements |
| IDENTITY | Compute identity matrix with specified size |
| INFINITY | Approximation to use for infinity |
| INTEGRAL | Sum of items of an array constructed based on delta terms; using traditional integral notation |
| INTEGRALC | Sum of items of an array constructed based on delta terms; using traditional contour integral notation |
| INTEGRALS | Sum of items of an array constructed based on delta terms; using traditional surface integral notation |
| INTEGRALV | Sum of items of an array constructed based on delta terms; using traditional volume integral notation |
| INTERPOLATE | Generate Lagrange interpolation polynomial for function described by array |
| INTERVAL | Select sub-list of elements for interval lo-hi |
| INV | Compute inverse of matrix |
| LAGRANGE | Apply Lagrange series to derive interpolation polynomial as curve of best fit |
| LCM | Least Common Multiple of two integers |
| LENGTH | Length of an array treated as a unary function |
| LOAD | Load a stored value |
| LUD | Decompose specified matrix using LU algorithm |
| LUDDET | Compute matrix determinant using LUD |
| LUDINV | Compute matrix inverse using LUD |
| LUXB | matrix,Solve LUx=b general case from assignment array=LUXB(L;U;b) |
| MATADD | Compute sum of two matrices |
| MATMUL | Compute product of two matrices |
| MATRIX | Construct matrix from array with dimensions |
| MAX | Maximum value found in array |
| MIN | Minimum value found in array |
| MINOR | Compute minor of matrix |
| MINUS | Arithmetic binary subtraction operator |
| MOD | Modulus of two integers |
| MODPOW | Modulus of exponentiation of two integers |
| NEGATE | Arithmetic unary negation operator |
| OMEGA | Omega counting function (with multiplicity) |
| PEARSON | Compute Pearson regression coefficient for X/Y data set pair |
| PI | Product of items of an array; traditional capital PI notation |
| PIF | PI counting function |
| PIVOT | Reorder a vector to a specified pattern |
| POLYADD | Compute sum of two polynomials |
| POLYDER | Compute derivative of polynomial |
| POLYHG | Compute coefficients of hyper geometric polynomial |
| POLYINT | Compute integral of polynomial |
| POLYMUL | Compute product of two polynomials |
| PRIMES | Get an array of all primes less than parameter |
| Pn | Nth prime number |
| QRD | Decompose specified matrix using QR algorithm |
| QRS | Compute solution to system given requested vector and QR decomposed matrix |
| REM | Remainder from division of two integers |
| ROOTS | Compute roots of polynomial |
| ROUND | Round function for a factored value |
| ROW | Read row vector from matrix |
| SIGMA | Sum of items of an array; traditional capital SIGMA notation |
| SOE | Solve a system of equations using a linear algebra library instance |
| SOLVE | Solve linear equations with column substitution |
| STACK | Append a series of arrays as rows into a matrix |
| STORE | Store a portable value |
| SUMMATION | Sum of items of an array; summation functionality using SIGMA notation |
| T | Riemann T counting function |
| TR | Compute trace of matrix |
| TRANSPOSE | Compute transpose of matrix |
| TRIL | Compute lower triangular matrix from source |
| TRIU | Compute upper triangular matrix from source |
| TRUE | Logical TRUE |
| VANCHE | Construct Vandermonde matrix for a Chebyshev interpolation |
| VC31 | Solve LUx=b using VC31LU to produce Chebyshev spline for function values |
| VERSION | software development version |
| \ | Binary root operator (left [root of] right) |
| \# | Matrix indexing operation selecting diag vector |
| ^ | Binary conventional exponentiation operator x^n; intended for small integer exponents |
| abs | ABS function value of parameter |
| ceil | Ceiling function |
| curl | Curl operator |
| div | Divergence operator |
| e | Epsilon base of natural log |
| ep | Euler Product function |
| exp | Exponentiation (anti-log) operator |
| floor | Floor function |
| floordiv | Floor function for quotient |
| gcf | Greatest common factor of two integers |
| grad | Gradient operator |
| lambda | Lambda parity counting function (1 even -1 odd) |
| lcm | Least common multiple of two integers |
| li | Logarithmic Integral as counting function |
| ln | Natural log function of complex value |
| mu | Mobius counting function { delta[OMEGA(n) omega(n)] * lambda(n) } |
| omega | Omega counting function (distinct factors) |
| pi | Symbol for the irrational value of pi |
| sgn | Sign SGN function value of parameter |
| sqrt | Unary square root operator |
| xLx | X ln X counting function |
| | | Logical OR |
| |# | Matrix indexing operation selecting column vector |
| || | Mark function call for interval evaluation |
| |~ | Logical XOR |
| ~ | Logical NOT |
| ~& | Logical NAND |
| ~<<= | Logical NOT implied by |
| ~= | Not equal to |
| ~=>> | Logical NOT implies |
| ~| | Logical NOR |
| ~|~ | Logical NOT XOR |