Contents Previous Next

Every integer, real, double-precision or complex vector corresponds to a descending polynomial . In addition, if it is a column vector, it corresponds to a polynomial stored in ascending order. Some of the routines below operate on polynomials stored in ascending order while others operate on polynomials stored in descending order. The routine reverse can be used to convert from one ordering to the other.

Ascending Polynomial Routines
pol2asc Displaying A Polynomial
polval Evaluating A Polynomial
poladd Adding Polynomials
polmul Polynomial Multiplication
polcomp Composition Of Polynomials As Functions
polder Computing the Derivative of a Polynomial
zero2pol Converting A Set Of Roots To A Polynomial
pol2zero Using Laguerre's Method to Find The Roots of a Polynomial
polcheb Computing Chebyshev Polynomial Coefficients
polyfit Least Squares Fit of a Descending Polynomial to Data

Descending Polynomial Routines
polyval Evaluating A Descending Polynomial
polyvalm Evaluating A Descending Polynomial Using Matrix Multiplication
poly Converting A Set Of Roots To A Descending Polynomial
polyreduce Remove Leading Zero Coefficients from a Descending Polynomial
roots Finding Roots of a Descending Polynomial
conv Convolution of Vectors (Mlmode)
deconv Deconvolution or Descending Polynomial Division
residue Calculate the Residues for a Rational Function in Complex Plane
compan Compute the companion matrix corresponding to polynomial

Other Routines
monomial Evaluating A Multiple Dimension Monomial And Its Derivatives