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.
Implementation of Valiaho's algorithm to determine the handicap based on paper
H. Valiaho. Determining the handicap of a sufficient matrix. Linear Algebra and Its Applications, 253:279-298, 1997.
This is a GUI for DTMF generator-decoder using Goertzel's algorithm.Has options to change Number of samples and Noise power that could be added at the generator.Suggestions and comments is always welcome.Now i am working on medical image pattern...
Solves the linear least squares problem with nonnegative variables using the newton's algorithm in: Portugal, Judice and Vicente, A comparison of block pivoting and interior point algorithms for linear least squares problems with nonnegative...
Kruskal's algorithm is used to find the branches of a ''tree'' having the minimum weight in a system of branches. The application of this algorithm is wide. One example is in finding the shortest (and cheapest) path of interconnecting several...
DIJKSTRA Calculate Minimum Costs and Paths using Dijkstra's Algorithm
Inputs: [AorV] Either A or V where A is a NxN adjacency matrix, where A(I,J) is nonzero if and only if an edge connects point I to point J NOTE:...
Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected un directed weighted graph
The zip file contains
kruskal.m iscycle.m fysalida.m connected.m
If we want to find...
Implementation of a Reed-Solomon decoder using RiBM, Chien search, and modified Forney's algorithm.
RiBM algorithm: (Reformulated inversionless Berlekamp-Massey) see "High-Speed Architectures for Reedd-deOCtSolomon Decoders"...
CiviCluster's algorithm is now built into CiviCRM 1.8.
CiviCluster provides duplicate detection and merging functionality to CiviCRM in the form of a block that displays likely duplicates and links to the merging utility. While this...
This tutorial teaches you how to run the Horner's algorithm, for number convertion. It converts numbers from specified numeric system into decimal, without using powers, which makes the whole process faster.
This code snippet is the implementation of Dijkstra's algorithm.
An implementation of Butcher's Algorithm for determining the date of Easter for the Western church. Works for any date in the Gregorian calendar (1583 and onward). Returns a date object.
Globalmin is a very simple m-code which implements the very efficient Brent's algorithm. It looks like fminbnd without any options and finds with a guaranteed precision a global minimum of a function under bounds constraints. This goal...
This little function computes the date of Easter Sunday for present year or specific years, using Oudin's algorithm. It works for the entire Julian calendar (starting 325 AD) and Gregorian calendar (after 1583 AD).
Easter day is usefull...
The Peach Validator is a small program used verify the application of the Lhun's algorithm to s.i.n numbers. This program is designed to offer some insight into writting program wrappers or GUI applications with python.
This function is based on Yen's k-Shortest Path algorithm (1971) It retuns: 1) [shortestPaths]: the list of K shortest paths (in cell array 1xK) 2) [totalCosts] : costs of the K shortest paths (in array 1xK) Yen's algorithm...
Function to generate soundex code for any string (usually a name). Conforms to Knuth's algorithm and the common Perl implementation.
Implementation of Nicholas J. Higham's algorithm "Computing the Nearest Correlation Matrix - A Problem from Finance", 2002.
http://eprints.ma.man.ac.uk/232/01/covered...S_ep2006_70.pdf
The function's algorithm uses Gaussian integer factorization and variable precision integers.
Usage: [mfTutteMap] = TutteMap(mnTriangulation)
Maintaining the existing triangulation, this function maps a surface mesh onto a planar unit circle. Tutte's algorithm [1] is used. The simple technique for finding point locations is from... |