Polynomial

This program returns the coefficients of the shifted Legendre polynomial P_n, given n. The result is a row vector with powers of x decreasing from left to right (standard MATLAB notation). Like for other polynomials, LegendreShiftPoly(n) can be evaluated at x by typing...

A polynomial is a mathematical expression involving a sum of powers in one or more variables multiplied by coefficients. A general multivariate polynomial is captured with the syntaxp = sum( c_i * prod( x_j^p_ij ) ) + kwhere the summation is over i, the product over j, and c_i is the set of...

The definition of Cluster Polynomials was given in Tech. Report DEMO2011/1 available athttp://cag.dat.demokritos.gr/publications/TR2011-1.pdfThere are two versions.binroots that was used to produce the images of the last four figures in the report above and a more advanced version that can be...


Platforms: Matlab

Thee purpose,1. Speed up the convergence of correcting for each points (By newton method).2. To find the first few points by this method instead of R.K. method.3. To apply for higher order polynomial fitting.


Platforms: Matlab

15th July, 2005 : Poly_POWER.m is now corrected !So, for most reasonable cases of Multiple Roots including Multiple Real Roots, this Programme should now work.For eg, Poly_POWER works successfully for :{ x^6 + (-12+18j)*x^5 + (-75-180j)*x^4 + (920+180j)*x^3 + (-1785+1800j)*x^2 + (-732-3582j )*x +...


Platforms: Matlab

POLYFIT can fit a polynomial of given ORDer to vectorial data, using as independent variable data index, rescaled between -1 and 1. Similarly, BIPFIT fits a bipolynomial of given orders (a matrix) to matrix data.POLYVAL can calculate the VALues of a POLYnomial on an equidistant abscissa x, scaled...


Platforms: Matlab

This program returns the coefficients of the Legendre polynomial P_n, given n. The result is a row vector with powers of x decreasing from left to right (standard MATLAB notation). Like for other polynomials, LegendrePoly(n) can be evaluated at x by typingpolyval(LegendrePoly(n),x).


Platforms: Matlab

Given a Legendre polynomial expansion where the coefficients are stored in a column vector, this script computes the expansion in terms of Chebyshev polynomials. Useful for spectral methods.


Platforms: Matlab

Given a Chebyshev polynomial expansion where the coefficients are stored in a column vector, this script computes the expansion in terms of Legendre polynomials. Useful for spectral methods.


Platforms: Matlab

Approx a point-defined function using Lagrange polinomial interpolation method


Platforms: Matlab

This function uses a non-linear interpolation (Lagrange) to estimate y given x, based on a set of observed x-y points. Coordinates will be sorted based on the x-value of the pair. The x-value provided by the user to calculate y will be estimated using two points left and two points right of the...


Platforms: Matlab

This m-file calculates any number of l-moments for given data vector X. It uses probability weighted moments (can actually edit the file to give any number of pwm's) and the coefficients of the shifted Legendre polynomial to calculate the l-moments.


Platforms: Matlab

POLYFIT_ROOTS Least-squares polynomial fit to data.[R,K] = POLYFIT_ROOTS(X, Y, N, TOL) finds the roots R and constant K so that the polynomial P(s) = K*(s-R(1))*(s-R(2))* ... *(s-R(N)) is the best least-squares fit to the data Y at points X.Argument TOL bounds the accuracy of the fit, and if...


Platforms: Matlab

Represent a wavefront as a sum of Zernike polynomials using a matrix inversion.This function attempts to solve the a_i's in equation, phi(rho,theta) = SUM(a_i * Z_i(rho,theta), i=1 to M),where the Z_i(rho,theta)'s are the Zernike polynomials from the zernfun.m file, phi is the wavefront to be...


Platforms: Matlab

Improved algorithms for finding the roots (direct method for first order quadratic, cubic and Quartic) are used for low order equations.Fadeev algorithm for finding the characteristic polynomial is implemented to ensure high accuracy.These files can be used as a replacement of original MATLAB...


Platforms: Matlab

Performs polynomial fits that pass through a specified point (x0,y0).The application is to give a least squares fit that is 'exact' at a desired data point, e.g. an equilibrium point in a nonlinear equation of motion implemented via polynomial approximation. Discussion of theory included in...


Platforms: Matlab

[M L] = routh_hurwitz(P,N)This function gives the Routh's array from a numerical or SYMBOLIC polynomial and includes two special cases: (1) the first element of the row is zero; (b) a row of zeros.P Numerical or symbolic array of coeficients. In the case of symbolic variables it is necesarry to...


Platforms: Matlab

[M, L] = jury(P,N)This function gives the Jury's array from a numerical or SYMBOLIC polynomial and includes the two special cases: (1) the first element of the second row of a block is zero; (b) a row of zeros (when there are roots on unit circle or reciprocal roots like (r,1/r). The symbolic...


Platforms: Matlab

POLYFIT3(X,Y,N,NUL,W) finds the coefficients of a polynomial P(X) of degree N that fits the data, P(X(I))~=Y(I), in a least-squares sense. Any of the coefficients can be forced to be zero, and data can be weighted.NUL is a vector with coefficients forced to be zero in usual order.W is a vector...


Platforms: Matlab

This library contains two classes. The one for Field representation and the second for the representation of Element. It's generally. Not only for binary fields. Irreducible polynomial generation included. (still only few comments in Czech inside)


Platforms: Matlab