# Selectionsorting array in c

The following C project contains the C source code and C examples used for selectionsorting array. A simple Selection Sort that let you see the swapping process per line

The following Matlab project contains the source code and Matlab examples used for routh array.
You can enter the coefficients of a given characteristic equation to check the stability of the system.

The following Matlab project contains the source code and Matlab examples used for chebyshev to legendre conversion.
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.

The following Matlab project contains the source code and Matlab examples used for legendre to chebyshev conversion.
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.

The following Matlab project contains the source code and Matlab examples used for more flexible sorting and multiplicity of roots of a polynomial.
Imagine a function that can pair the Complex Conjugate Roots of a Polynomial, and also tell us how many Roots are Real, and how many are Complex ; imagine further, that this function should also be able to give us the multiplicity of the roots ; and imagine further, that this function should be able to do all this even if not all the Complex Roots of the Polynomial are Conjugate Pairs.

The following Matlab project contains the source code and Matlab examples used for multi-dimensional polynomial interpolation functions .
Tools for Multidimensional Polynomial Interpolation and Approximation
- polymake.

The following Matlab project contains the source code and Matlab examples used for faddeev leverrier algorithm.
The code implements the so called Faddeev-Leverrier algorithm to compute the coefficients of the characteristic polynomial of a given matrix and to get the inverse of the matrix without extra cost.

The following Matlab project contains the source code and Matlab examples used for factoring a multiple root polynomial.
A given multiple-root polynomial is factored into lower-degree distict-root polynomials with natual-order-integer powers.

The following Matlab project contains the source code and Matlab examples used for routh hurwitz criteria using user defined function.
RA=ROUTH(R,EPSILON) returns the symbolic Routh array RA for polynomial.

The following Matlab project contains the source code and Matlab examples used for exact gcd of integer polynomials.
The polynomial GCD of two given polynomials can be found exactly if the polynomial coefficients are all integers.

The following Matlab project contains the source code and Matlab examples used for gcd of polynomials.
In the longhand polynomial division given as
P(k) = P(k-2) - P(k-1)*Q(k)
The quotient Q(k) and the remainder P(k) are obtained from dividing the dividend P(k-2) by the divisor P(k-1).

The following Matlab project contains the source code and Matlab examples used for polynomial square root.
It returns a vector POL, if it exists, such that conv(POL,POL) = P. P is a vector whose elements are the coefficients of a polynomial in descending powers

The following Matlab project contains the source code and Matlab examples used for matrix polynomial fraction.
These functions show some advances about MPF (Matrix Polynomial Fraction) using for represent multivariable models and design multivariable control system.

The following Matlab project contains the source code and Matlab examples used for routh hurwitz stability criterion with gui matlab v3.3.
Features:
1-Calculate Exactly & Display Table Of Routh Hurwitz In Listbox
Similar Project Can't Solve Accurate Routh-Hurwitz Stability Criterion
For Example This Equation [1 1 3 3 3 2 1] Have All Element And First
Element Zero Simultaneity And I Test Any Project And None Solve It
2-Determine Where First Element Or All Element Is Zero Graphically(Change Own Row Color Voluntary)

The following Matlab project contains the source code and Matlab examples used for hermite polynomials.
Compute Hermite polynomials.

The following Matlab project contains the source code and Matlab examples used for hermite cubic interpolating polynomial with specified derivatives.
PP = PCHIPD(X,Y,D) provides the piecewise cubic polynomial which interpolates values Y and derivatives D at the sites X.

The following Matlab project contains the source code and Matlab examples used for manipulate and solve systems of multivariate polynomial equations by computing the groebner basis .
Example: simplify the system of equations
{x^2+2xy^2=0, xy+2y^3=1}
>> groebner({'x^2+2*x*y^2','x*y+2*y^3-1'},'lex',{'x','y'})
returns {'y^3-0.

The following Matlab project contains the source code and Matlab examples used for legendre polynomials.
The built-in legendre() calculates the Legendre polynomials calculated ALL the orders for a given degree.

The following Matlab project contains the source code and Matlab examples used for legendre polynomials.
Instead of returning the value of a Legendre polynomial for specified values of x, this function returns the polynomial coefficients.

The following Matlab project contains the source code and Matlab examples used for hermite polynomials.
Computes the Hermite polynomials of order N (positive integer(s)) at location(s) X (X real).

The following Matlab project contains the source code and Matlab examples used for polynomial division derived form covolution.
For the division of univariate polynomials, given the dividend b(x) of degree n and the divisor a(x) of degree m, such that b(x) = q(x)*a(x) + r(x), the quotient q(x) of degree n-m and the remainder r(x) of degree m-1 are then obtained.

The following Matlab project contains the source code and Matlab examples used for sylvester matrix.
S = SYLVESTER(P,Q) returns the Sylvester matrix S that is associated with the two polynomial representations P and Q, of degree Dp and Dq, respectively.

The following Matlab project contains the source code and Matlab examples used for newton form for interpolating polynomials.
It gets any equation and the degree of the its interpolating polynomial as well as the interpolation interval and returns the symbolic newton form of the polynomial.

The following Matlab project contains the source code and Matlab examples used for chebychev polynomial of first, second, third and fourth kinds .
Function to calculate the first, second, third or fourth kinds of Chebychev orthogonal polynomials; polynomial coefficients are also provided by the function.

The following Matlab project contains the source code and Matlab examples used for legendre polynomial .
Function to calculate Legendre orthogonal polynomials; polynomial coefficients are also provided by the function. Input argument X can be of any dimension, but the function provides only the polynomial of requested order.

The following Matlab project contains the source code and Matlab examples used for hermite polynomial h of ordder n and argument x .
Function to calculate the Hermite orthogonal polynomials H; polynomial coefficients are also provided by the function. Input argument X can be of any dimension, but the function provides only the polynomial of requested order.

The following Matlab project contains the source code and Matlab examples used for laguerre polynomial for order n and argument x. .
Function to calculate the Laguerre orthogonal polynomials; polynomial coefficients are also provided by the function. Input argument X can be of any dimension, but the function provides only the polynomial of requested order.

The following Matlab project contains the source code and Matlab examples used for matrix polynomial.
This is a variation of MATLAB's polyvalm function, with a more efficient implementation. For a polynomial of order p, the number of matrix multiplies is approximately 2*(sqrt(p+1)-1).
[See also polyvalm2, File ID: #25780.]

The following Matlab project contains the source code and Matlab examples used for polynomials with multiple roots solved.
A given polynomial having multiple roots is solved by the routine
Z = poly_roots(p)
where
Input p: polynomial coefficient vector
Output Z: root-multiplicity pairs
The MATLAB source code is very simple and compact (fewer then 50 lines) and amazingly gives the expected results for any test polynomials of very high degree and multiplicities.

The following Matlab project contains the source code and Matlab examples used for highest row degree coefficient matrix of a polynomial matrix t(s).
Very useful in polynomial matrix theory which is directly connected with linear multivariable control systems
For example if we in put the matrix
[ s^2+3*s, s+1]
T= [ 5*s, s^4]
[ 5*s^6, s^2]
[ 3*s^3+6, s^3+5] we'll get
ans =
1 0
0 1
5 0
3 1.