Polynomials

Contains two functions. The one function computes the greatest common divisor (gcd) of two polynomials a(x) and b(x) over GF(2^m). The other function performs the extended Euclidean algorithm where two polynomials u(x) and v(x) is calculated in addition to the gcd of a(x) and b(x) such that gcd =...

The built-in legendre() calculates the Legendre polynomials calculated ALL the orders for a given degree. If you only need a given order, this is a waste of memory and computing time (especially for large blocks of data). The function legendreP(l,m,x) is a drop-in substitute for legendre(l,x),...

ZERNFUN.m and ZERNFUN2.m compute the Zernike functions Znm(r,theta). These functions, which form an orthogonal basis on the unit circle, are used in disciplines such as astronomy, optics, optometry, and ophthalmology to characterize functions and data on a circular domain. ZERNPOL.m computes the...


Platforms: Matlab

NTL is a high-performance, portable C++ library providing data structures and algorithms for manipulating signed, arbitrary length integers, and for vectors, matrices, and polynomials over the integers and over finite fields. NTL provides high quality implementations of state-of-the-art...


Platforms: Linux

NTL is a high-performance, portable C++ library providing data structures and algorithms for manipulating signed, arbitrary length integers, and for vectors, matrices, and polynomials over the integers and over finite fields. NTL provides high quality implementations of state-of-the-art...


Platforms: Windows

The standard polynomials are not used to make it more flexible.User provide data stream and generator polynomial.


Platforms: Matlab

It takes the input in the form of two Polynomials and output in the form of Quotient . The Quotient's are stored in an array.We can also specify, that how many times the synthetic Division is required.


Platforms: Matlab

pypol is a Python library that allows you to manipulate polynomials. This is the main page of the documentation.


Platforms: *nix

Java archive containig classes for calculations with polynomials, matrices and vectors + several applets using these classes.


Platforms: ALL

Maxima is a system for the manipulation of symbolic and numerical expressions, including differentiation, integration, Taylor series, Laplace transforms, ordinary differential equations, systems of linear equations, polynomials, and sets, lists, vectors, matrices, and tensors. Maxima yields high...


Platforms: Mac, Linux

Maxima is a system for the manipulation of symbolic and numerical expressions, including differentiation, integration, Taylor series, Laplace transforms, ordinary differential equations, systems of linear equations, polynomials, and sets, lists, vectors, matrices, and tensors. Maxima yields high...


Platforms: Windows

MathGL++ is a class library for fast C++ maths for use in OpenGL C++ projects. Easy to use and similar to the OpenGL API. Matricies, Vectors, Quaternions, Linear polynomials with eigen systems are all going to be included.


Platforms: *nix

A Python module to easy manage monomials and polynomials.


Platforms: Windows, Mac, Linux

Provides efficient, effective implementations of 32- and 64-bit hash functions based on Rabin fingerprints / irreducible polynomials, in Java. Also provides integration with java.security.MessageDigest API.


Platforms: Windows, Mac, Solaris, Linux

This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3-link (redundant) robotarm. The objective function for the proposed GA is to minimizing traveling time and space, while not exceeding a maximumpre-defined torque, without collision with any...


Platforms: Matlab

Determinantal matrix representations of hyperbolic polynomials are a current topic of interest and research among those working with LMI's (Linear Matrix Inequalities) and SDP (semi-definite programming). This toolbox was used to demonstrate some of the theorems presented in the author's Ph.D....


Platforms: Matlab

This code was written to deal with "Zernike polynomials" code graciously donated by Paul Fricker via file exchange.Here you will find a practical example of a function decomposition byZernike basis.The function is F below, feel free to modifyUnlike Paul's example found in 'zernfun2.m' here the...


Platforms: Matlab

Given a continuous-time system with parameters, can we find the range (or intervals) of the parameters where the system is stable?When the system model is written with the Laplacian transform, the question is equivalent to finding all the roots of a parameterized polynomial where the real parts...


Platforms: Matlab

For given p(x) = PROD[i=1,m]{SUM[j=2,n+2]{(A(i,j)*x^(j-2))^A(i,1)}} we shall get p(x) = SUM[s=1,N+1]{p(s)^(N+1-s)} For example If p(x) = (x-4)^5 * (3x^6-7x^3+5x+2)^2 * (x^3+8)^3 * x^2 or A = [ 5 -4 1 0 0 0 0 0 2 2 5 0 -7 0 0 3 3 8 0 0 1 0 0 0 1 0 0 1 0 0 0 0 ] then from p = polyget(A) we get p =...


Platforms: Matlab

This function do the Euclid's algorithm. As a matter of fact, for two given polynomials n, m (which are the polynomials of the symbolicvariable "s") it gives two other polynomials x, y such that nx+my=1.


Platforms: Matlab