Issues in Scientific Computing, 2009
ISC_2009 is the homepage for material related to the course
Math/CS 4414, Issues in Scientific Computing, 12:20-1:10, MWF,
McBryde 329, which I team taught at Virginia Tech with Jeff Borggaard
in the Fall 2009 semester.
I gave talks on:
a classroom presentation on single linkage clustering,
presented 16 September 2009;
a classroom presentation on K-means clustering,
presented 21 September 2009;
a classroom presentation on clustering images,
presented 23 September 2009;
a classroom presentation on weighted clustering,
presented 25 September 2009;
a classroom presentation on clustering using Voronoi diagrams,
presented 28 September 2009;
a classroom presentation on probability, for Monte Carlo Methods,
presented 26-28-30 October 2009;
a classroom presentation on Monte Carlo Sampling Methods,
presented 02-04-06 November 2009;
a classroom presentation on Monte Carlo Simulation Methods,
presented 09-11-13 November 2009;
seeks a root of the function BETA_CDF(X) - 0.7 = 0.0.
an image of the dendrogram showing a clustering based on car data.
a "distance" table, indicating the perceived difference or
distance between various pairs of cars.
the car "distance" table, rewritten as a vector containing only
the data in the upper half of the distance matrix.
a MATLAB function which generates 20 random points in the unit square
and computes their center of mass.
a worksheet for the chain letter problem.
a MATLAB program for the chain letter problem.
the chain letter distance matrix, as output from the chain letter program.
a MATLAB function which carries out 20 steps of the centroidal Voronoi
algorithm on an M by N pixel array.
a map of the 30 regions, after 1 step of the centroidal Voronoi algorithm.
a map of the 30 regions, after 2 steps of the centroidal Voronoi algorithm.
a map of the 30 regions, after 3 steps of the centroidal Voronoi algorithm.
a map of the 30 regions, after 4 steps of the centroidal Voronoi algorithm.
a map of the 30 regions, after 5 steps of the centroidal Voronoi algorithm.
a map of the 30 regions, after 10 steps of the centroidal Voronoi algorithm.
a map of the 30 regions, after 15 steps of the centroidal Voronoi algorithm.
a map of the 30 regions, after 20 steps of the centroidal Voronoi algorithm.
a letter to the editor from Dawkins, discussing the idea that a chain
letter is a kind of "meme".
a MATLAB program which illustrates the use of FMINUNC for unconstrained
a PGM (Portable Gray Map) file containing an image.
a MATLAB program which estimates the integral of a function over a 2D domain.
a MATLAB program which estimates the integral of a function F(X,Y) over a circle.
a MATLAB function which calculates the inverse of an element B mod N.
a MATLAB function which tests INVMODN.
the output from running INVMODN_TEST.
a MATLAB function which carries out the K-Means clustering algorithm.
a MATLAB program which illustrates how a linear congruential generator
works, by illustrating how the line Y=13*X is folded back into the square
[0,31]x[0,31] by the MOD function.
chain letter "A".
chain letter "B".
chain letter "C".
chain letter "D".
chain letter "E".
chain letter "F".
chain letter "G".
chain letter "H".
chain letter "I".
chain letter "J".
chain letter "K".
a MATLAB function which compares the normal distribution and
a sum of uniform random values.
the coordinates of 9 points in the plane.
the image of 36 points in the plane.
the Voronoi diagram of 36 points in the plane.
the coordinates of 36 points in the plane.
a MATLAB script which shows how PDIST can compute a table of distances.
uses the P9.TXT data to estimate the areas of the regions nearest
to each of the points.
displays the areas of the regions nearest
to each of the points in the P9.TXT data.
a set of test scores.
an image of the dendrogram of simple data.
an image of the locations of the simple data values.
a set of simple data, just a list of 2D points.
a MATLAB function which computes a single linkage tree.
the main program for the fitting computation.
a function used for the fitting computation.
Last revised on 22 August 2011.