cg, a library which implements a simple version of the conjugate gradient (CG) method for solving a system of linear equations of the form A*x=b, suitable for situations in which the matrix A is positive definite (only real, positive eigenvalues) and symmetric.
cg_distributed, a program which implements a version of the NAS conjugate gradient (CG) benchmark, using distributed memory.
cg_lab_triangles, a collection of programs associated with a computer lab assignment on computational geometry and triangles;
cg_rc, a library which implements the conjugate gradient (CG) method for solving a positive definite sparse linear system A*x=b, using reverse communication (RC).
chain_letter_tree, a program which analyzes a similarity matrix for 11 versions of a single chain letter and produces a dendrogram or tree diagram that suggests the degrees of relatedness and the evolutionary history of the letters.
change_making, a library which considers the change making problem, in which a given sum is to be formed using coins of various denominations.
chebyshev, a library which computes the Chebyshev interpolant/approximant to a given function over an interval.
chebyshev_interp_1d, a library which determines the combination of Chebyshev polynomials which interpolates a set of data, so that p(x(i)) = y(i).
chebyshev_polynomial, a library which considers the Chebyshev polynomials T(i,x), U(i,x), V(i,x) and W(i,x). Functions are provided to evaluate the polynomials, determine their zeros, produce their polynomial coefficients, produce related quadrature rules, project other functions onto these polynomial bases, and integrate double and triple products of the polynomials.
chebyshev_series, a library which can evaluate a Chebyshev series approximating a function f(x), while efficiently computing one, two or three derivatives of the series, which approximate f'(x), f''(x), and f'''(x), by Manfred Zimmer.
chebyshev1_rule, a program which computes and writes out a Gauss-Chebyshev type 1 quadrature rule of given order.
chebyshev2_rule, a program which computes and writes out a Gauss-Chebyshev type 2 quadrature rule of given order.
chrpak, a library which manipulates characters and strings;
circle_arc_grid, a program which computes grid points along a circular arc.
circle_grid_display a program which reads a matrix of integers, and draws a corresponding grid of circles filled with color.
circle_integrals, a library which returns the exact value of the integral of any monomial over the circumference of the unit circle in 2D.
circle_monte_carlo, a library which applies a Monte Carlo method to estimate the integral of a function along the circumference of the unit circle in 2D;
circle_rule, a library which computes quadrature rules for the unit circle in 2D, that is, the circumference of the circle of radius 1 and center (0,0).
circle_segment, a library which carries out computations associated with a circle segment, including height, angle, area, centroid, sampling, and quadrature.
circles, a library which can be used, when creating graphics, to draw one or more circles, while controlling the center locations, radii, colors, edge colors, and transparency, by Chad Greene.
cities, a library which works with city-to-city distance matrices;
clausen, a library which evaluates a Chebyshev interpolant to the Clausen function Cl2(x).
clenshaw_curtis_rule, a program which implements a Clenshaw Curtis quadrature rule;
cnoise, a library which generates samples of noise obeying a 1/f^alpha power law, by Miroslav Stoyanov.
coin_simulation, a library which looks at ways of simulating or visualizing the results of many tosses of a fair or biased coin.
collatz, a library which computes and analyzes the Collatz sequence, also known as the hailstone sequence or 3n+1 sequence;
collatz_parfor, a program which seeks the maximum Collatz sequence between 1 and N; it runs in parallel using MATLAB's parfor facility.
collatz_recursive, a library which demonstrates recursive programming by considering the simple Collatz 3n+1 problem.
collocation, a library which demonstrates some simple examples of the use of collocation to produce a function g(x) that satisfies the same constraints as a function f(x), but only at a discrete set of points.
color_remote, a program which carries out the color segmentation of an image in parallel, using MATLAB's spmd facility; this includes instructions on how to run the job, via MATLAB's batch facility, on a remote system such as Virginia Tech's ithaca cluster.
colored_noise, a library which generates samples of noise obeying a 1/f^alpha power law.
combination_lock, a program which simulates the process of determining the secret combination of a lock.
combo, a library which includes routines for ranking, unranking, enumerating and randomly selecting balanced sequences, cycles, graphs, Gray codes, subsets, partitions, permutations, restricted growth functions, Pruefer codes and trees.
compass_search, a library which seeks the minimizer of a scalar function of several variables using compass search, a direct search algorithm that does not use derivatives.
complex_numbers, a program which demonstrates some simple features involved in the use of complex numbers in programming.
complexity, programs which measure the complexity of a few simple algorithms with increasing problem size.
condition, a library which implements methods of computing or estimating the condition number of a matrix.
continuation, a library which implements the continuation method for a simple 2D problem, which involves finding a point on the unit circle, and then finding a sequence of nearby points which trace out the full curve, using only the information available in the implicit definition of the curve from the function f(x,y)=x^2+y^2-1.
contour_gradient, a program which displays contours and gradient vectors for a function f(x,y).
contour_gradient_3d, a program which displays contours and gradient vectors for a function f(x,y) in a 3D display.
contour_sequence4, a program which creates images suitable for animation from one XY file and a sequence of u(x,y) data files;
contrast_spmd, a program which demonstrates spmd parallel programming for image operations; the client reads an image, the workers heighten contrast over portions of it, and the client assembles and displays the results.
contrast2_spmd, a program which demonstrates spmd parallel programming for image operations; it improves on contrast_spmd by allowing the workers to communicate, and so eliminates artificial seams that would otherwise appear in the processed image.
convex_hull, a program which demonstrates the computation of the convex hull of a set of 2D points.
coordinate_search, a program which seeks the minimizer of a scalar function of several variables, by Jeff Borggaard.
cordic, a library which computes a few special functions using the CORDIC algorithm.
correlation, a library which contains examples of statistical correlation functions.
correlation_chebfun, a library which uses the chebfun library to compute truncated Karhunen-Loeve expansions of stochastic processes with a given correlation function.
cosine_transform, a library which demonstrates some simple properties of the discrete cosine transform (DCT).
cube_arbq_rule, a library which returns quadrature rules, with exactness up to total degree 15, over the interior of the symmetric cube in 3D, by Hong Xiao and Zydrunas Gimbutas.
cube_exactness, a library which investigates the polynomial exactness of quadrature rules over the interior of a cube in 3D.
cube_felippa_rule, a library which returns Felippa's quadratures rules for approximating integrals over the interior of a cube in 3D.
cube_grid, a library which computes a grid of points over the interior of a cube in 3D.
cube_integrals, a library which returns the exact value of the integral of any monomial over the interior of the unit cube in 3D.
cube_monte_carlo, a library which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit cube in 3D.
cvt, a library which computes an N-point Centroidal Voronoi Tessellation (CVT) in M dimensions;
cvt_1d_lloyd, a program which computes an N-point Centroidal Voronoi Tessellation (CVT) within the interval [0,1], under a uniform density, using Lloyd's method to compute the Voronoi regions exactly.
cvt_1d_lumping, a program which allows the user to carry out a lumped version of Lloyd's iterative algorithm for a centroidal Voronoi Tessellation (CVT() in the interval [-1,+1], and is applied to investigate a relationship between CVT's and the Chebyshev Zero nodes.
cvt_1d_nonuniform, a program which computes an N-point Centroidal Voronoi Tessellation (CVT) in 1 dimension, under a nonuniform density, and plots the evolution of the locations of the generators during the iteration;
cvt_1d_sampling, a program which computes an N-point Centroidal Voronoi Tessellation (CVT) within the interval [0,1], under a uniform density, using sampling to estimate the Voronoi regions.
cvt_2d_lumping, a program which computes an N-point Centroidal Voronoi Tessellation (CVT) within the unit square [-1,1]^2, under a Chebyshev density, using weighted sampling ("lumping") to estimate the Voronoi regions.
cvt_2d_sampling, a program which computes an N-point Centroidal Voronoi Tessellation (CVT) within the unit square [0,1]x[0,1], under a uniform density, using sampling to estimate the Voronoi regions.
cvt_3d_lumping, a program which computes an N-point Centroidal Voronoi Tessellation (CVT) within the unit cube [-1,1]^3, under a Chebyshev density, using weighted sampling ("lumping") to estimate the Voronoi regions.
cvt_3d_sampling, a program which computes an N-point Centroidal Voronoi Tessellation (CVT) within the unit cube [0,1]x[0,1]x[0,1], under a uniform density, using sampling to estimate the Voronoi regions.
cvt_circle_nonuniform, a program which demonstrates the computation of a centroidal Voronoi Tessellation (CVT) over a circular region, using a nonuniform density.
cvt_circle_uniform, a program which demonstrates the computation of a centroidal Voronoi Tessellation (CVT) over a circular region, using a uniform density.
cvt_corn, a program which studies a 2D model of the growth of a corn kernel, by treating the surface and interior biological cells as points to be organized by a Centroidal Voronoi Tessellation (CVT) with a nonuniform density; during a sequence of growth steps, new biological cells are randomly added to the surface and interior.
cvt_dataset, a program which creates a Centroidal Voronoi Tessellation (CVT) dataset;
cvt_ellipse_uniform, a program which iteratively calculates a Centroidal Voronoi Tessellation (CVT) over an ellipse, with a uniform density.
cvt_example_fifty_points, a program which illustrates the steps involved in the calculation of a Centroidal Voronoi Tessellation (CVT) of the unit square, with 50 generator points.
cvt_example_five_points, a program which illustrates the steps involved in the calculation of a Centroidal Voronoi Tessellation (CVT) of the unit square, with 5 generator points.
cvt_metric, a program which computes a Centroidal Voronoi Tessellation (CVT) under a spatially varying metric;
cvt_movie, a program which creates an animation of the evolution of a Centroidal Voronoi Tessellation (CVT);
cvt_movie2, a program which creates a Centroidal Voronoi Tessellation (CVT) movie;
cvt_movie3, a program which creates a Centroidal Voronoi Tessellation (CVT) movie in a region of unusual shape;
cvt_movie4, a program which creates a Centroidal Voronoi Tessellation (CVT) movie in a square, with a density function that drives points to the corners;
cvt_movie5, a program which repeats cvt_movie3, but with hexagonal grid initialization, fixed points, and boundary projection;
cvt_square_nonuniform, a program which iteratively calculates a Centroidal Voronoi Tessellation (CVT) over a square, with a nonuniform density.
cvt_square_pdf_discrete, a program which iteratively calculates a Centroidal Voronoi Tessellation (CVT) over a square, with a density determined from a discrete PDF.
cvt_square_uniform, a program which iteratively calculates a Centroidal Voronoi Tessellation (CVT) over a square, with a uniform density.
cvt_triangle_uniform, a program which iteratively calculates a Centroidal Voronoi Tessellation (CVT) over a triangle, with a uniform density.
cvtm_1d, a program which estimates a mirror-periodic centroidal Voronoi Tessellation (CVTM) in the periodic interval [0,1], using a version of Lloyd's iteration.
cvtp, a library which creates a CVTP dataset, that is, a Centroidal Voronoi Tessellation on a periodic region.
cvtp_1d, a program which estimates a periodic centroidal Voronoi Tessellation (CVTP) in the periodic interval [0,1], using a version of Lloyd's iteration.
cycle_brent, a library which carries out an iterated function evaluation, and seeks to determine the nearest element of a cycle, and the cycle's length, using Brent's method.
cycle_floyd, a library which carries out an iterated function evaluation, and seeks to determine the nearest element of a cycle, and the cycle's length, using Floyd's method.
cyclic_reduction, a library which solves a tridiagonal linear system using cyclic reduction;
dfield8, a program which interactively displays the direction field of an ordinary differential equation (ODE), by John Polking.
diaphony, a program which reads a file of N points in M dimensions and computes its diaphony, a measure of point dispersion.
dice_simulation, a program which simulates N tosses of M dice, making a histogram of the results.
dictionary_code, a library which demonstates how a text file can be compressed and decompressed using a dictionary code.
differ, determines the finite difference coefficients necessary in order to combine function values at known locations to compute an approximation of given accuracy to a derivative of a given order.
dijkstra, a library which implements a simple version of Dijkstra's minimum distance algorithm for graphs.
dijkstra_spmd, a program which uses the spmd feature to parallelize a simple example of Dijkstra's minimum distance algorithm for graphs.
disk_grid, a library which computes grid points within the interior of a disk of user specified radius and center in 2D, using GNUPLOT to create an image of the grid.
disk_integrals, a library which returns the exact value of the integral of any monomial over the interior of the unit disk in 2D.
disk_monte_carlo, a library which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit disk in 2D;
disk_quarter_monte_carlo, a library which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit quarter disk in 2D;
disk_rule, a library which computes quadrature rules for the general disk in 2D, that is, the interior of the circle of radius RC and center (XC,YC).
disk01_quarter_rule, a program which computes a quadrature rule for the unit quarter disk in 2D, that is, the interior of the circle of radius 1 and center (0,0).
disk01_rule, a library which computes quadrature rules for the unit disk in 2D, that is, the interior of the circle of radius 1 and center (0,0).

 alpert_rule, a library which can set up an Alpert quadrature rule for functions which are regular, log(x) singular, or 1/sqrt(x) singular.
analemma, a program which evaluates the equation of time, a formula for the difference between the uniform 24 hour day and the actual position of the sun, based on a C program by Brian Tung.
area_under_curve, a function which displays the area under a curve, that is, the points (x,y) between the x axis and the curve y=f(x).
args, a program which shows how to count and report command line arguments;
arpack, a library which computes eigenvalues and eigenvectors of large sparse matrices, accessible via MATLAB's built-in eigs() command;
asa005, a library which evaluates the lower tail of the noncentral Student's T distribution, by BE Cooper. This is a version of Applied Statistics Algorithm 5;
asa006, a library which computes the Cholesky factor of a positive definite symmetric matrix, by Michael Healy; This is a version of Applied Statistics Algorithm 6;
asa007, a library which computes the inverse of a positive definite symmetric matrix, by Michael Healy; This is a version of Applied Statistics Algorithm 7.
asa032, a library which evaluates the incomplete Gamma function, by G Bhattacharjee. This is a version of Applied Statistics Algorithm 32;
asa047, a library which minimizes a scalar function of several variables using the Nelder-Mead algorithm, by R ONeill. This is a version of Applied Statistics Algorithm 47;
asa053, a library which produces sample matrices from the Wishart distribution, by William Smith and Ronald Hocking. This is a version of Applied Statistics Algorithm 53.
asa058, a library which carries out clustering of data, by David Sparks. This is a version of Applied Statistics Algorithm 58;
asa063, a library which evaluates the incomplete Beta function, by KL Majumder and G Bhattacharjee. This is a version of Applied Statistics Algorithm 63;
asa066, a library which computes the cumulative density function (CDF) of the standard normal distribution, by David Hill. This is a version of Applied Statistics Algorithm 66;
asa076, a library which evaluates Owen's T function, by Young and Minder. This is a version of Applied Statistics Algorithm 76;
asa091, a library which computes the percentage points of the Chi-square distribution, by Best and Roberts. This is a version of Applied Statistics Algorithm 91;
asa103, a library which evaluates the digamma or psi function, by Jose Bernardo. This is a version of Applied Statistics Algorithm 103;
asa109 a library which inverts the incomplete Beta function, by Cran, Martin and Thomas. This is a version of Applied Statistics Algorithm 109;
asa111 a library which evaluates the percentage points of the normal distribution, by Beasley and Springer. This is a version of Applied Statistics Algorithm 111;
asa113 a library which clusters data using a transfer and swap algorithm, by Banfield and Bassill; This is a version of Applied Statistics Algorithm 113;
asa121, a library which evaluates the trigamma function, by BE Schneider. This is a version of Applied Statistics Algorithm 121;
asa136, a library which implements a clustering algorithm, by Hartigan and Wong. This is a version of Applied Statistics Algorithm 136;
asa144, a library which randomly generates tables with given row and column sums, by James Boyett. This is a version of Applied Statistics Algorithm 144;
asa147, a library which evaluates the incomplete Gamma function, by Chi Leung Lau. This is a version of Applied Statistics Algorithm 147;
asa152, a library which evaluates the probability density function (PDF) and cumulative density function (CDF) associated with the hypergeometric distribution, by Richard Lund; This is a version of Applied Statistics Algorithm 152;
asa159, a library which computes a random table with given row and column sums, by Michael Patefield; This is a version of Applied Statistics Algorithm 159;
asa172, a library which generates all M dimensional indices in a given range, simulating the behavior of an arbitrary number of nested loops, by OFlaherty and MacKenzie; this is a version of Applied Statistics Algorithm 172;
asa183, a library which implements a random number generator (RNG), by Wichman and Hill; this is a version of Applied Statistics Algorithm 183;
asa226, a library which evaluates the noncentral incomplete Beta function, by Russell Lenth; this is a version of Applied Statistics Algorithm 226;
asa239, a library which evaluates the incomplete Gamma function, by Shea; this is a version of Applied Statistics Algorithm 239;
asa241, a library which computes the inverse of the normal cumulative density function (CDF), by Michael Wichura; this is a version of Applied Statistics Algorithm 241;
asa243, a library which evaluates the lower tail of the noncentral Student's T distribution, by Russell Lenth; this is a version of Applied Statistics Algorithm 243;
asa245, a library which evaluates the logarithm of the Gamma function, by Allan Mcleod; this is a version of Applied Statistics Algorithm 245;
asa266, a library which evaluates various properties of the Dirichlet probability density function (PDF); this is a version of Applied Statistics Algorithm 266;
asa299, a library which computes the lattice points (integer coordinates) in an M dimensional simplex, by Chasalow and Brand; this is a version of Applied Statistics Algorithm 299;
asa310, a library which evaluates the noncentral incomplete Beta function, by Chattamvelli and Shanmugam. This is a version of Applied Statistics Algorithm 310;
asa314, a library which computes the inverse of a matrix whose elements are subject to modulo arithmetic, by Roger Payne. This is a version of Applied Statistics Algorithm 314.
atbash, a library which applies the Atbash substitution cipher to a string of text.
backtrack_binary_rc, a library which carries out a backtrack search for a set of binary decisions, using reverse communication (RC).
ball_and_stick_display, a program which demonstrates the creation of a 3D image constructed from balls and sticks;
ball_grid, a library which computes a grid of points over the interior of the unit ball in 3D.
ball_integrals, a library which returns the exact value of the integral of any monomial over the interior of the unit ball in 3D.
ball_monte_carlo, a library which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit ball in 3D;
bank, a library which computes the check digit associated with a US Bank Routing Number check digit, or reports whether a 9-digit code is actually valid.
barycentric_interp_1d, a library which defines and evaluates the barycentric Lagrange polynomial p(x) which interpolates a set of data, so that p(x(i)) = y(i). The barycentric approach means that very high degree polynomials can safely be used.
bellman_ford, a library which implements the Bellman-Ford algorithm for finding the shortest distance from a given node to all other nodes in a directed graph whose edges have been assigned real-valued lengths.
bernstein_approximation, a library which looks at some simple cases of approximation of a function f(x) by a Bernstein polynomial.
bernstein_polynomial, a library which evaluates the Bernstein polynomials;
besselj, a library which evaluates Bessel J functions of noninteger order;
beta_nc, a library which evaluates the cumulative density function (CDF) of the noncentral Beta distribution;
bezier_surface, a library which reads, writes, prints and manipulates the data that defines a Bezier surface;
bezier_surface_display, a program which displays a Bezier surface;
birthday_remote, a program which runs a Monte Carlo simulation of the birthday paradox, and includes instructions on how to run the job, via MATLAB's batch facility, on a remote system such as Virginia Tech's Ithaca cluster.
bisection_integer, a library which seeks an integer solution to the equation F(X)=0, using bisection within a user-supplied change of sign interval [A,B].
bisection_rc, a library which seeks a solution to the equation F(X)=0 using bisection within a user-supplied change of sign interval [A,B]. The procedure is written using reverse communication (RC).
black_scholes, a library which implements some simple approaches to the Black-Scholes option valuation theory, by Desmond Higham.
blas, a library which contains the Basic Linear Algebra Subprograms (BLAS) for level 1, 2 and 3, for single and double precision, and for real and complex arithmetic.
blas0, a library which contains auxilliary functions for the Basic Linear Algebra Subprograms (BLAS).
blas1, a library which contains the Basic Linear Algebra Subprograms (BLAS) for level 1 (vector-vector operations), for single and double precision, and for real and complex arithmetic.
blas1_c, a library which implements the Level 1 Basic Linear Algebra Subprograms (BLAS), using single precision complex arithmetic;
blas1_d, a library which implements the Level 1 Basic Linear Algebra Subprograms (BLAS), using double precision real arithmetic;
blas1_s, a library which implements the Level 1 Basic Linear Algebra Subprograms (BLAS), using single precision real arithmetic;
blas1_z, a library which implements the Level 1 Basic Linear Algebra Subprograms (BLAS), using double precision complex arithmetic;
blas2, a library which contains the Level 2 Basic Linear Algebra Subprograms (BLAS) for matrix-vector operations;
blas3, a library which contains the Level 3 Basic Linear Algebra Subprograms (BLAS) for matrix-matrix operations.
blend, a library which carries out 1D/2D/3D blending interpolation;
blsprice, programs which demonstrate the use of the BLSPRICE function, for Black-Scholes option pricing, from the MATLAB Financial Mathematics toolbox.
box_behnken, a library which computes a Box-Behnken design, that is, a set of arguments to sample the behavior of a function of multiple parameters;
box_display, a program which displays a box plot, over integer pairs of data, of a function defined by two formulas.
box_plot, a program which displays a box plot of data that consists of pairs of integers;
brain_sensor_pod, a program which applies the method of Proper Orthogonal Decomposition (POD) to seek underlying patterns in sets of 40 sensor readings of brain activity.
brent, a library which contains routines for finding zeroes or minima of a scalar function of a scalar variable, without the use of derivative information, including a reverse communication (RC) option, by Richard Brent.
brownian_motion_simulation, a library which simulates Brownian motion in an M dimensional region.
buckling_spring, a program which plots solutions of the buckling spring equations.
burgers_solution, a library which evaluates exact solutions of the time-dependent 1D viscous Burgers equation.
burgers_steady_viscous, a library which solves the steady (time-independent) viscous Burgers equation using the finite difference method (FDM) applied to the conservative form of the equation, using Newton's method to solve the resulting nonlinear system.
burgers_time_inviscid, a library which solves the time-dependent inviscid Burgers equation using the finite difference method (FDM), and one of six solution methods selected by the user.
burgers_time_viscous, a library which solves the time-dependent viscous Burgers equation using the finite difference method (FDM) applied to the conservative form of the equation.
bvec, a library which demonstrates how signed integers can be stored as binary vectors, and arithmetic can be performed on them.
bvp4c, programs which illustrate how to use the MATLAB command bvp4c(), which can solve boundary value problems (BVP's) in one spatial dimension.
c4lib, a library which implements certain elementary functions for single precision complex ("C4") variables;
c8lib, a library which implements certain elementary functions for double precision complex ("C8") variables;
caesar, a library which can apply a Caesar Shift Cipher to a string of text.
calendar_nyt, a library which shows the correspondence between dates and the New York Times volume and issue number;
calpak, a library which makes various calendar calculations;
cauchy_principal_value, a library which uses Gauss-Legendre quadrature to estimate the Cauchy Principal Value (CPV) of certain singular integrals.
cavity_flow_display, a library which displays a single velocity field solution for the driven cavity;
cavity_flow_movie, a library which animates the velocity solutions for the driven cavity;
cc_display, a program which displays the points used in a 2D Clenshaw-Curtis quadrature rule;
cc_io a library which reads and writes sparse linear systems stored in the Compressed Column (CC) format.
cc_project, a library which investigates generalized Clenshaw-Curtis quadrature rules for semi-infinite and infinite intervals, by John Boyd.
cc_to_st a library which converts a sparse matrix from compressed column (CC) to sparse triplet (ST) format.
ccl, a program which estimates the Lebesgue constants for sets of points in [-1,+1] computed in several ways. The program is probably of limited interest except as an example of an application of the lebesgue_constant() function.
ccn_rule, a program which defines a Clenshaw Curtis Nested (CCN) quadrature rule.
ccvt_box, a program which calculates a Constrained Centroidal Voronoi Tessellation (CCVT) for points constrained to lie in a box, with some points moved to the boundary;
ccvt_reflect, a program which calculates a Constrained Centroidal Voronoi Tessellation (CCVT) for points constrained to lie in a box, with some points pushed towards the boundary;
cell, a library which defines a cell array, a generalization of an array which can compactly store and retrieve vector or matrix data of varying size, such as the rows of a triangular matrix.
cell_detection_tasks, a program which creates modified versions of a sequence of gray-scale tagged image files (TIF's) containing images of biological cells; the process of each file is carried out independently, using the task feature of MATLAB's parallel computing toolbox.
cellular_automaton, a program which demonstrates the 1D Cellular Automaton known as rule #30.
centralize, a library which estimates the centroid and radius of a shape, or a set of data points, in a space of arbitrary dimension.