Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
dbForge Studio for PostgreSQL 2.3.212
HTMLPad 2020 16.2
WeBuilder 2020 16.2
Rapid CSS 2020 16.2
Rapid PHP 2020 16.2
C# HTML to PDF 2020.8.1
Flowrigami 1.0.0.1
Vue Injector 3.3
Spectrum Analyzer pro Live 2019
Devart Excel Add-in for HubSpot 2.1
RentALLScript - Airbnb clone 2.2
SuiteCRM Theme Customization 7.11.6
iScripts NetMenus 3.1
iScripts EasyIndex 2.2
iScripts EasySnaps 2.0
Top Code
Uber Clone with Safety Measure Addons 2.0
Answers phpSoftPro 3.12
phpEnter 5.1.
Quick Maps For Dynamics CRM 3.1
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Apphitect Airbnb Clone Script 1.0
Deals and Discounts Website Script 1.0.2
Pro MLM 1
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
Related Code
Adding Polynomials
Addition Of Polynomials
Polynomials Roots
Program For Multiplication Of Two Polynomials
Enter Polynomials In C
Add Polynomials
Division Of Polynomials
Addition Of Two Polynomials In Java
Polynomials Multiplication
How To Solve Polynomials At A Given Point
Mul Of Polynomials Using Linked Lists
Polynomials Using Linked Lists
Multiplication Of Polynomials
Addition Of Two Polynomials
Addition Of Two Polynomials Using Linked Lista
Polynomials
All | Freeware

Code 1-18 of 18   






Euler spiral is generated by evaluating Fresnel integral.
By changing some of the parameters different types of
spirals are generated.This script can generate 18 different spirals.

When this script is executed a list dialog appears with 18 different
polynomials, select any one to generate one of these spirals.



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...



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.



GSP is a graphical user interface which takes x and y points as inputs, along with the order m, then outputs mth order splines between each of the x points. In most cases additional constraints are to be entered as well.

Example:



The Mandelbrot set has its place in complex dynamics, a field first investigated by the French mathematicians Pierre Fatou and Gaston Julia at the beginning of the 20th century. The first pictures of it were drawn in 1978 by Brooks and Matelski as...



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.



This video describes working with complex numbers and polynomials in MATLAB in the Czech language. It's the fourth part of complete video tutorial about MATLAB and SIMULINK.
AVI file is compressed by WinZIP, TechSmith Screen Capture Codec...



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...



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.



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...



This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3-link (redundant) robot
arm. The objective function for the proposed GA is to minimizing traveling time and space, while not exceeding a...



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...



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



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



This document is designed to perimiter in a few hours a minimal knowledge of the main features of Matlab. All the basic topics are covered in Matlab:
- Generation of vectors and matrices
- Handling of arrays and indices
- Functions...



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...



This script performs convolution of multiple polynomials and gives a final result.

Eg : multiconv([1 2],[1 2],[1 2])
= [1 6 12 8]



This .zip file contains 3 mfiles for computing the nodes and weights for Legendre Laguerre and Hermite - Gauss Quadrature of any order n.

Contrary to most of the files in use, the included files are all based on a symmetrical companion...