
modgcd
Uses the modular algorithm to return the greatest common divisor of two polynomials.
modgcd(Poly1,Poly2)
Example:
modgcd(x^4-1,(x-1)^2) gives x-1
mRow
Given an expression, a matrix, and an integer n, multiplies row n of the matrix by the expression.
mRow(Expr, Matrix, Integer)
Example:
mRow returns
mult_c_conjugate
If the given complex expression has a complex denominator, returns the expression after both the numerator
and the denominator have been multiplied by the complex conjugate of the denominator. If the given
complex expression does not have a complex denominator, returns the expression after both the numerator
and the denominator have been multiplied by the complex conjugate of the numerator.
mult_c_conjugate(Expr)
Example:
mult_c_conjugate returns
mult_conjugate
Takes an expression in which the numerator or the denominator contains a square root. If the denominator
contains a square root, returns the expression after both the numerator and the denominator have been
multiplied by the conjugate of the denominator. If the denominator does not contain a square root, returns
the expression after both the numerator and the denominator have been multiplied by the conjugate of the
numerator.
mult_conjugate(Expr)
Example:
mult_conjugate returns
nDeriv
Given an expression, a variable of dierentiation, and a real number h, returns an approximate value of the
derivative of the expression, using f’(x)=(f(x+h)–f(x+h))/(2*h).
Without a third argument, the value of h is set to 0.001; with a real as third argument, it is the value of h. With
a variable as the third argument, returns the expression above with that variable in place of h.
nDeriv(Expr,Var, Real) or nDeriv(Expr, Var1, Var2)
444 Chapter 22 Functions and commands
Komentarze do niniejszej Instrukcji