<h1 align = "center">
C++ Source Codes
</h1>
<hr>
<p>
<ol>
<li>
<a href = "anagram/anagram.html">
anagram</a>,
a program which
determines anagrams of a string, by James Cherry;
</li>
<li>
<a href = "ann/ann.html">
ann</a>,
a library which
computes Approximate Nearest Neighbors, by David Mount and Sunil Arya;
</li>
<li>
<a href = "ann_test/ann_test.html">
ann_test</a>,
a program which
uses the ann library to approximate the nearest
neighbors of a set of points stored in a file;
</li>
<li>
<a href = "ann_to_fig/ann_to_fig.html">
ann_to_fig</a>,
a program which
plots the search tree used by the ann library, while seeking the
approximate nearest neighbors of a set of points;
</li>
<li>
<a href = "args/args.html">
args</a>,
a program which
reports the command line arguments with
which it was invoked;
</li>
<li>
<a href = "asa005/asa005.html">
asa005</a>,
a library which
evaluates the lower tail of the noncentral Student's T distribution,
by BE Cooper.
This is a C++ version of Applied Statistics Algorithm 5;
</li>
<li>
<a href = "asa006/asa006.html">
asa006</a>,
a library which
computes the Cholesky factor of a positive definite symmetric matrix,
by Michael Healy.
This is a C++ version of Applied Statistics Algorithm 6;
</li>
<li>
<a href = "asa007/asa007.html">
asa007</a>,
a library which
computes the inverse of a positive definite symmetric matrix,
by Michael Healy.
This is a C++ version of Applied Statistics Algorithm 7.
</li>
<li>
<a href = "asa032/asa032.html">
asa032</a>,
a library which
evaluates the incomplete Gamma function,
by G Bhattacharjee.
This is a C++ version of Applied Statistics Algorithm 32;
</li>
<li>
<a href = "asa047/asa047.html">
asa047</a>,
a library which
minimizes a scalar function of several variables using the Nelder-Mead algorithm,
by R ONeill.
This is a C++ version of Applied Statistics Algorithm 47;
</li>
<li>
<a href = "asa058/asa058.html">
asa058</a>,
a library which
carries out K-means clustering of data,
by David Sparks.
This is a C++ version of Applied Statistics Algorithm 58;
</li>
<li>
<a href = "asa063/asa063.html">
asa063</a>,
a library which
evaluates the incomplete Beta function,
by KL Majumder and G Bhattacharjee.
This is a C++ version of Applied Statistics Algorithm 63;
</li>
<li>
<a href = "asa066/asa066.html">
asa066</a>,
a library which
computes the cumulative density function (CDF)
of the standard normal distribution,
by David Hill.
This is a C++ version of Applied Statistics Algorithm 66;
</li>
<li>
<a href = "asa076/asa076.html">
asa076</a>,
a library which
evaluates Owen's T function,
by Young and Minder.
This is a C++ version of Applied Statistics Algorithm 76;
</li>
<li>
<a href = "asa091/asa091.html">
asa091</a>,
a library which
computes the percentage points of the Chi-square distribution,
by Best and Roberts.
This is a C++ version of Applied Statistics Algorithm 91;
</li>
<li>
<a href = "asa103/asa103.html">
asa103</a>,
a library which
evaluates the digamma or psi function,
by Jose Bernardo.
This is a C++ version of Applied Statistics Algorithm 103;
</li>
<li>
<a href = "asa109/asa109.html">
asa109</a>,
a library which
inverts the incomplete Beta function,
by Cran, Martin and Thomas.
This is a C++ version of Applied Statistics Algorithm 109;
</li>
<li>
<a href = "asa111/asa111.html">
asa111</a>,
a library which
evaluates the percentage points of the normal distribution,
by Beasley and Springer.
This is a C++ version of Applied Statistics Algorithm 111;
</li>
<li>
<a href = "asa113/asa113.html">
asa113</a>,
a library which
clusters data using a transfer and swap algorithm,
by Banfield and Bassill.
This is a C++ version of Applied Statistics Algorithm 113;
</li>
<li>
<a href = "asa121/asa121.html">
asa121</a>,
a library which
evaluates the trigamma function,
by BE Schneider.
This is a C++ version of Applied Statistics Algorithm 121;
</li>
<li>
<a href = "asa136/asa136.html">
asa136</a>,
a library which
implements a clustering algorithm,
by Hartigan and Wong.
This is a C++ version of Applied Statistics Algorithm 136;
</li>
<li>
<a href = "asa144/asa144.html">
asa144</a>,
a library which
randomly generates tables with given row and column sums,
by James Boyett.
This is a C++ version of Applied Statistics Algorithm 144;
</li>
<li>
<a href = "asa147/asa147.html">
asa147</a>,
a library which
evaluates the incomplete Gamma function,
by Chi Leung Lau.
This is a C++ version of Applied Statistics Algorithm 147;
</li>
<li>
<a href = "asa152/asa152.html">
asa152</a>,
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 C++ version of Applied Statistics Algorithm 152;
</li>
<li>
<a href = "asa159/asa159.html">
asa159</a>,
a library which
computes a random table with given row
and column sums,
by Michael Patefield.
This is a C++ version of Applied Statistics Algorithm 159;
</li>
<li>
<a href = "asa172/asa172.html">
asa172</a>,
a library which
generates all multidimensional indices in a given range,
simulating the behavior of an arbitrary number of nested loops,
by OFlaherty and MacKenzie.
This is a C++ version of Applied Statistics Algorithm 172;
</li>
<li>
<a href = "asa183/asa183.html">
asa183</a>,
a library which
implements a pseudorandom number generator,
by Wichman and Hill.
This is a C++ version of Applied Statistics Algorithm 183;
</li>
<li>
<a href = "asa226/asa226.html">
asa226</a>,
a library which
evaluates the noncentral incomplete Beta function,
by Russell Lenth.
this is a C++ version of Applied Statistics Algorithm 226;
</li>
<li>
<a href = "asa239/asa239.html">
asa239</a>,
a library which
evaluates the incomplete Gamma function,
by Shea.
this is a C++ version of Applied Statistics Algorithm 239;
</li>
<li>
<a href = "asa241/asa241.html">
asa241</a>,
a library which
computes the inverse of the normal cumulative density function (CDF),
by Michael Wichura;
this is a C++ version of Applied Statistics Algorithm 241;
</li>
<li>
<a href = "asa243/asa243.html">
asa243</a>,
a library which
evaluates the lower tail of the noncentral Student's T distribution,
by Russell Lenth;
this is a C++ version of Applied Statistics Algorithm 243;
</li>
<li>
<a href = "asa245/asa245.html">
asa245</a>,
a library which
evaluates the logarithm of the Gamma function,
by Allan Mcleod;
this is a C++ version of Applied Statistics Algorithm 245;
</li>
<li>
<a href = "asa299/asa299.html">
asa299</a>,
a library which
computes the lattice points
(integer coordinates) in an M-dimensional simplex,
by Chasalow and Brand;
this is a C++ version of Applied Statistics Algorithm 299;
</li>
<li>
<a href = "asa310/asa310.html">
asa310</a>,
a library which
evaluates the noncentral incomplete Beta function,
by Chattamvelli and Shanmugam;
this is a C++ version of Applied Statistics Algorithm 310;
</li>
<li>
<a href = "ball_grid/ball_grid.html">
ball_grid</a>,
a library which
computes grid points inside a 3D ball.
</li>
<li>
<a href = "ball_volume_monte_carlo/ball_volume_monte_carlo.html">
ball_volume_monte_carlo</a>,
a program which
applies a Monte Carlo procedure to estimate the volume of the
M-dimensional unit ball;
</li>
<li>
<a href = "barycentric_interp_1d/barycentric_interp_1d.html">
barycentric_interp_1d</a>,
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.
</li>
<li>
<a href = "bernstein/bernstein.html">
bernstein</a>,
a library which
evaluates the Bernstein polynomials;
</li>
<li>
<a href = "beta_nc/beta_nc.html">
beta_nc</a>,
a library which
evaluates the cumulative density function (CDF) of the noncentral Beta distribution;
</li>
<li>
<a href = "bins/bins.html">
bins</a>,
a library which
handles geometric data partially sorted into bins;
</li>
<li>
<a href = "bisection_integer/bisection_integer.html">
bisection_integer</a>,
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].
</li>
<li>
<a href = "bits_to_ui/bits_to_ui.html">
bits_to_ui</a>,
a program which
reads a text file of bits and writes a binary file in which groups of 32 bits
have been interpreted as an unsigned integer;
</li>
<li>
<a href = "black_scholes/black_scholes.html">
black_scholes</a>,
a library which
implements some simple approaches to
the Black-Scholes option valuation theory,
by Desmond Higham.
</li>
<li>
<a href = "blas1/blas1.html">
blas1</a>,
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,
by Charles Lawson, Richard Hanson, David Kincaid, Fred Krogh.
</li>
<li>
<a href = "blas1_c/blas1_c.html">
blas1_c</a>,
a library which
constitutes the Level 1 Basic Linear Algebra Subprograms (BLAS),
using single precision complex arithmetic,
by Charles Lawson, Richard Hanson, David Kincaid, Fred Krogh.
</li>
<li>
<a href = "blas1_d/blas1_d.html">
blas1_d</a>,
a library which
constitutes the Level 1 Basic Linear Algebra Subprograms (BLAS),
using double precision real arithmetic,
by Charles Lawson, Richard Hanson, David Kincaid, Fred Krogh.
</li>
<li>
<a href = "blas1_s/blas1_s.html">
blas1_s</a>,
a library which
constitutes the Level 1 Basic Linear Algebra Subprograms (BLAS),
using single precision real arithmetic,
by Charles Lawson, Richard Hanson, David Kincaid, Fred Krogh.
</li>
<li>
<a href = "blas1_z/blas1_z.html">
blas1_z</a>,
a library which
constitutes the Level 1 Basic Linear Algebra Subprograms (BLAS),
using double precision complex arithmetic,
by Charles Lawson, Richard Hanson, David Kincaid, Fred Krogh.
</li>
<li>
<a href = "blend/blend.html">
blend</a>,
a library which
uses transfinite interpolation to fill in
data within a square or a cube based on boundary values;
</li>
<li>
<a href = "bmp_io/bmp_io.html">
bmp_io</a>,
a library which
reads and writes graphics information stored
in a Microsoft BMP file;
</li>
<li>
<a href = "bmp_to_ppma/bmp_to_ppma.html">
bmp_to_ppma</a>,
a program which
converts a Microsoft BMP file to an ASCII Portable Pixel Map (PPM) file;
</li>
<li>
<a href = "bmp_to_ppmb/bmp_to_ppmb.html">
bmp_to_ppmb</a>,
a program which
converts a Microsoft BMP file to a binary Portable Pixel Map (PPM) file;
</li>
<li>
<a href = "boost/boost.html">
boost</a>,
programs which
illustrate the use of some of the Boost libraries;
</li>
<li>
<a href = "box_behnken/box_behnken.html">
box_behnken</a>,
a library which
computes a Box-Behnken design,
that is, a set of arguments to sample the behavior
of a function of multiple parameters;
</li>
<li>
<a href = "brent/brent.html">
brent</a>,
a library which
contains routines for finding zeroes or minima of a scalar
function of a scalar variable, without the use of derivative information,
by Richard Brent. The C++ version includes some customizations by John Denker.
</li>
<li>
<a href = "brent_old/brent_old.html">
brent_old</a>,
a library which
contains routines for finding zeroes or minima of a scalar
function of a scalar variable, without the use of derivative information,
by Richard Brent.
</li>
<li>
<a href = "brownian_motion_simulation/brownian_motion_simulation.html">
brownian_motion_simulation</a>,
a library which
simulates Brownian motion in an M-dimensional region.
</li>
<li>
<a href = "burgers_solution/burgers_solution.html">
burgers_solution</a>,
a library which
evaluates an exact solution of the time-dependent 1D viscous Burgers equation.
</li>
<li>
<a href = "c++_calls_f77/c++_calls_f77.html">
c++_calls_f77</a>,
programs which
illustrate a C++ program calling a FORTRAN77 subroutine.
</li>
<li>
<a href = "c++_calls_f90/c++_calls_f90.html">
c++_calls_f90</a>,
programs which
illustrate a C++ program calling a FORTRAN90 subroutine.
</li>
<li>
<a href = "c4lib/c4lib.html">
c4lib</a>,
a library which
implements a basic level of single precision complex (C4) arithmetic.
</li>
<li>
<a href = "c8_complex_lib/c8_complex_lib.html">
c8_complex_lib</a>,
a C++ class for double precision complex (C8) numbers;
</li>
<li>
<a href = "c8lib/c8lib.html">
c8lib</a>,
a library which
implements certain elementary functions for double precision complex (C8) variables;
</li>
<li>
<a href = "calendar_rd/calendar_rd.html">
calendar_rd</a>,
a program which computes the representation of a given date in a
number of calendrical systems,
by Edward Reingold and Nachum Dershowitz.
</li>
<li>
<a href = "calpak/calpak.html">
calpak</a>,
a library which
makes various calendar calculations;
</li>
<li>
<a href = "catalog/catalog.html">
catalog</a>,
a program which
extracts routine definition lines
from a marked-up C, C++, FORTRAN77 or FORTRAN90 file;
</li>
<li>
<a href = "caustic_opengl/caustic_opengl.html">
caustic_opengl</a>,
a program which computes a caustic curve and displays it using OpenGL.
</li>
<li>
<a href = "ccn_rule/ccn_rule.html">
ccn_rule</a>,
a program which
defines a nested Clenshaw Curtis quadrature rule.
</li>
<li>
<a href = "ccvt_box/ccvt_box.html">
ccvt_box</a>,
a program which
carries out a Centroidal Voronoi Tessellation (CVT) calculation
constrained to a box region,
with points projected to the boundary;
</li>
<li>
<a href = "cell/cell.html">
cell</a>,
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.
</li>
<li>
<a href = "chebyshev/chebyshev.html">
chebyshev</a>,
a library which
computes the Chebyshev interpolant/approximant to a given function
over an interval.
</li>
<li>
<a href = "chebyshev_interp_1d/chebyshev_interp_1d.html">
chebyshev_interp_1d</a>,
a library which
determines the combination of Chebyshev polynomials which
interpolates a set of data, so that p(x(i)) = y(i).
</li>
<li>
<a href = "chebyshev_polynomial/chebyshev_polynomial.html">
chebyshev_polynomial</a>,
a library which
evaluates the Chebyshev polynomial and associated functions.
</li>
<li>
<a href = "chebyshev1_rule/chebyshev1_rule.html">
chebyshev1_rule</a>,
a program which
computes and writes out a Gauss-Chebyshev type 1 quadrature rule of given order.
</li>
<li>
<a href = "chebyshev2_rule/chebyshev2_rule.html">
chebyshev2_rule</a>,
a program which
computes and writes out a Gauss-Chebyshev type 2 quadrature rule of given order.
</li>
<li>
<a href = "chrpak/chrpak.html">
chrpak</a>,
a library which
can manipulate characters and strings;
</li>
<li>
<a href = "circle_arc_grid/circle_arc_grid.html">
circle_arc_grid</a>,
a program which
computes grid points along a circular arc.
</li>
<li>
<a href = "circle_grid/circle_grid.html">
circle_grid</a>,
a library which
computes grid points inside a circle.
</li>
<li>
<a href = "cities/cities.html">
cities</a>,
a library which
works with city-to-city distance matrices;
</li>
<li>
<a href = "clenshaw_curtis_rule/clenshaw_curtis_rule.html">
clenshaw_curtis_rule</a>,
a program which
implements a Clenshaw Curtis quadrature rule;
</li>
<li>
<a href = "cnf_io/cnf_io.html">
cnf_io</a>,
a library which
reads or writes Conjunctive Normal Form (CNF) data files,
used to store boolean formulas.
</li>
<li>
<a href = "collatz_recursive/collatz_recursive.html">
collatz_recursive</a>,
a library which
demonstrates recursive programming by considering the simple Collatz 3n+1 problem.
</li>
<li>
<a href = "colored_noise/colored_noise.html">
colored_noise</a>,
a library which
generates samples of noise obeying a 1/f^alpha power law.
</li>
<li>
<a href = "combination_lock/combination_lock.html">
combination_lock</a>,
a program which
simulates the process of determining the secret combination of a lock.
</li>
<li>
<a href = "combo/combo.html">
combo</a>,
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.
</li>
<li>
<a href = "communicator_mpi/communicator_mpi.html">
communicator_mpi</a>,
a program which
creates new communicators involving a subset of initial
set of MPI processes in the default communicator MPI_COMM_WORLD.
</li>
<li>
<a href = "compass_search/compass_search.html">
compass_search</a>,
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.
</li>
<li>
<a href = "complex_numbers/complex_numbers.html">
complex_numbers</a>,
a program which
demonstrates some simple features involved in the use of
complex numbers in C programming.
</li>
<li>
<a href = "condition/condition.html">
condition</a>,
a library which
implements methods of computing or estimating the condition number of a matrix.
</li>
<li>
<a href = "cordic/cordic.html">
cordic</a>,
a library which
computes a few special functions using the CORDIC algorithm.
</li>
<li>
<a href = "correlation/correlation.html">
correlation</a>,
a library which
contains examples of statistical correlation functions.
</li>
<li>
<a href = "cpp/cpp.html">
cpp</a>,
programs which
illustrate some features of the C++ language;
</li>
<li>
<a href = "cpp_arrays/cpp_arrays.html">
cpp_arrays</a>,
programs which
illustrate the use of vectors, matrices and tensors.
</li>
<li>
<a href = "cpp_intrinsics/cpp_intrinsics.html">
cpp_intrinsics</a>,
a program which
illustrates the use of intrinsic functions supplied by the C++ language.
</li>
<li>
<a href = "cpp_random/cpp_random.html">
cpp_random</a>,
programs which
illustrate the use of the C++ random number generator routines.
</li>
<li>
<a href = "cr2crlf/cr2crlf.html">
cr2crlf</a>,
a program which
converts carriage returns to carriage returns + linefeeds in a file;
</li>
<li>
<a href = "cr2lf/cr2lf.html">
cr2lf</a>,
a program which
converts carriage returns to linefeeds in a file;
</li>
<li>
<a href = "crc/crc.html">
crc</a>,
a library which
computes the cyclic redundancy checksum (CRC) as used by the
PNG data format.
</li>
<li>
<a href = "crrm/crrm.html">
crrm</a>,
a program which
removes carriage returns from a file;
</li>
<li>
<a href = "cvt/cvt.html">
cvt</a>,
a library which
computes an N point CVT Centroidal Voronoi Tessellation (CVT) in M dimensions;
</li>
<li>
<a href = "cvt_dataset/cvt_dataset.html">
cvt_dataset</a>,
a program which
creates a Centroidal Voronoi Tessellation (CVT) dataset;
</li>
<li>
<a href = "cycle_brent/cycle_brent.html">
cycle_brent</a>,
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.
</li>
<li>
<a href = "cycle_floyd/cycle_floyd.html">
cycle_floyd</a>,
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.
</li>
<li>
<a href = "cyclic_reduction/cyclic_reduction.html">
cyclic_reduction</a>,
a library which
solves a tridiagonal linear system using cyclic reduction;
</li>
<li>
<a href = "dcdflib/dcdflib.html">
dcdflib</a>,
a library which
evaluates and inverts the cumulative density function (CDF) associated
with various probability distributions;
</li>
<li>
<a href = "deblank/deblank.html">
deblank</a>,
a program which
removes all blank lines from a file;
</li>
<li>
<a href = "decomment/decomment.html">
decomment</a>,
a program which
removes from a file every line
that begins with "#" (a common convention for indicating comments);
</li>
<li>
<a href = "delaunay_tree_2d/delaunay_tree_2d.html">
delaunay_tree_2d</a>,
a program which
computes the Delaunay triangulation of a 2D dataset,
by Olivier Devillers.
</li>
<li>
<a href = "detroff/detroff.html">
detroff</a>,
a program which
removes from a file every occurrence of the troff overprint
pair character+backspace, which can make a MAN page printable;
</li>
<li>
<a href = "diaphony/diaphony.html">
diaphony</a>,
a program which
reads a file of N points in M dimensions and computes its diaphony, a measure
of point dispersion.
</li>
<li>
<a href = "dijkstra/dijkstra.html">
dijkstra</a>,
a program which
runs a simple example of Dijkstra's minimum distance algorithm for graphs.
</li>
<li>
<a href = "dijkstra_openmp/dijkstra_openmp.html">
dijkstra_openmp</a>,
a program which
uses OpenMP to parallelize a simple example of Dijkstra's
minimum distance algorithm for graphs.
</li>
<li>
<a href = "discrete_pdf_sample/discrete_pdf_sample.html">
discrete_pdf_sample</a>,
a program which
demonstrates how to construct a Probability Density Function (PDF)
from a table of sample data, and then to use that PDF to create new samples.
</li>
<li>
<a href = "dislin/dislin.html">
dislin</a>,
programs which
illusrate the use of DISLIN, a scientific plotting package;
</li>
<li>
<a href = "divdif/divdif.html">
divdif</a>,
a library which
uses divided differences to compute the polynomial interpolant
to a given set of data.
</li>
<li>
<a href = "doomsday/doomsday.html">
doomsday</a>,
a library which
is given the year, month and day of a date, and uses
John Conway's doomsday algorithm to determine the corresponding day of the week.
</li>
<li>
<a href = "duel_simulation/duel_simulation.html">
duel_simulation</a>,
a program which
simulates N repetitions of a duel between two players, each of
whom has a known firing accuracy.
</li>
<li>
<a href = "dunavant/dunavant.html">
dunavant</a>,
a library which
defines Dunavant quadrature rules in a triangle;
</li>
<li>
<a href = "eispack/eispack.html">
eispack</a>,
a library which
carries out eigenvalue computations.
It includes a function to compute the singular value decomposition (SVD)
of a rectangular matrix.
This library was superseded by LAPACK;
</li>
<li>
<a href = "ellipse_grid/ellipse_grid.html">
ellipse_grid</a>,
a library which
computes grid points inside an ellipse.
</li>
<li>
<a href = "ellipsoid_grid/ellipsoid_grid.html">
ellipsoid_grid</a>,
a library which
computes grid points inside a 3D ellipsoid.
</li>
<li>
<a href = "emps/emps.html">
emps</a>,
a program which
expands a compressed MPS linear programming file,
by David Gay.
</li>
<li>
<a href = "faure/faure.html">
faure</a>,
a library which
computes elements of the Faure
M-dimensional quasirandom sequence;
</li>
<li>
<a href = "faure_dataset/faure_dataset.html">
faure_dataset</a>,
a program which
creates a Faure quasirandom dataset;
</li>
<li>
<a href = "fd_predator_prey/fd_predator_prey.html">
fd_predator_prey</a>,
a program which
solves a pair of predator prey ordinary differential equations (ODE's)
using a finite difference approximation.
</li>
<li>
<a href = "fd1d_burgers_lax/fd1d_burgers_lax.html">
fd1d_burgers_lax</a>,
a program which
applies the finite difference method and the Lax Wendroff method
to solve the non-viscous time-dependent Burgers equation in one spatial dimension.
</li>
<li>
<a href = "fd1d_burgers_leap/fd1d_burgers_leap.html">
fd1d_burgers_leap</a>,
a program which
applies the finite difference method and the leapfrog approach
to solve the non-viscous time-dependent Burgers equation in one spatial dimension.
</li>
<li>
<a href = "fd1d_bvp/fd1d_bvp.html">
fd1d_bvp</a>,
a program which
applies the finite difference method
to a two point boundary value problem in one spatial dimension.
</li>
<li>
<a href = "fd1d_heat_explicit/fd1d_heat_explicit.html">
fd1d_heat_explicit</a>,
a library which
implements a finite difference solution, explicit in time, of the
time dependent 1D heat equation;
</li>
<li>
<a href = "fd1d_heat_implicit/fd1d_heat_implicit.html">
fd1d_heat_implicit</a>,
a program which
implements a finite difference solution, implicit in time, of the
time dependent 1D heat equation;
</li>
<li>
<a href = "fd1d_heat_steady/fd1d_heat_steady.html">
fd1d_heat_steady</a>,
a program which
implements a finite difference solution for the steady
(time independent) 1D heat equation;
</li>
<li>
<a href = "fd1d_wave/fd1d_wave.html">
fd1d_wave</a>,
a program which
applies the finite difference method to solve the time-dependent
wave equation utt = c * uxx in one spatial dimension.
</li>
<li>
<a href = "fair_dice_simulation/fair_dice_simulation.html">
fair_dice_simulation</a>,
a program which
simulates N tosses of 2 dice, making a histogram of the results.
</li>
<li>
<a href = "fekete/fekete.html">
fekete</a>,
a library which
sets up one of seven Fekete rules for interpolation
or quadrature in a triangle;
</li>
<li>
<a href = "felippa/felippa.html">
felippa</a>,
a library which
defines quadrature rules for lines, triangles, quadrilaterals,
pyramids, wedges, tetrahedrons and hexahedrons.
</li>
<li>
<a href = "fem_basis/fem_basis.html">
fem_basis</a>,
a library which
can define and evaluate basis functions for any degree
in an M-dimensional simplex (1D interval, 2D triangle,
3D tetrahedron, and higher dimensional generalizations.)
</li>
<li>
<a href = "fem_io/fem_io.html">
fem_io</a>,
a library which
reads or writes FEM files
(three text files describing a finite element model);
</li>
<li>
<a href = "fem_to_mesh/fem_to_mesh.html">
fem_to_mesh</a>,
a program which
reads a pair of FEM files defining node coordinates and elements,
and creates a corresponding MESH file.
</li>
<li>
<a href = "fem1d/fem1d.html">
fem1d</a>,
a program which
applies the finite element method,
using piecewise linear basis functions, to a linear
two point boundary value problem in 1D;
</li>
<li>
<a href = "fem1d_adaptive/fem1d_adaptive.html">
fem1d_adaptive</a>,
a program which
uses an adaptive mesh when applying the finite element method,
with piecewise linear basis functions, to a linear
two point boundary value problem in 1D;
</li>
<li>
<a href = "fem1d_bvp_linear/fem1d_bvp_linear.html">
fem1d_bvp_linear</a>,
a program which
applies the finite element method, with piecewise linear elements,
to a two point boundary value problem in one spatial dimension,
and compares the computed and exact solutions
with the L2 and seminorm errors.
</li>
<li>
<a href = "fem1d_heat_steady/fem1d_heat_steady.html">
fem1d_heat_steady</a>,
a program which
implements the finite element method for the steady
(time independent) 1D heat equation;
</li>
<li>
<a href = "fem1d_nonlinear/fem1d_nonlinear.html">
fem1d_nonlinear</a>,
a program which
applies the finite element method, with piecewise linear basis functions, to a nonlinear
two point boundary value problem in 1D;
</li>
<li>
<a href = "fem1d_pack/fem1d_pack.html">
fem1d_pack</a>,
a library which
contains utilities for 1D finite element calculations.
</li>
<li>
<a href = "fem1d_pmethod/fem1d_pmethod.html">
fem1d_pmethod</a>,
a program which
applies the p-method version of the finite element method to a linear
two point boundary value problem in 1D;
</li>
<li>
<a href = "fem1d_project/fem1d_project.html">
fem1d_project</a>,
a program which
projects data into a finite element space, including the least squares
approximation of data, or the projection of a finite element solution
from one mesh to another.
</li>
<li>
<a href = "fem1d_sample/fem1d_sample.html">
fem1d_sample</a>,
a program which
samples a scalar or vector finite element function of one variable,
defined by FEM files,
returning interpolated values at the sample points.
</li>
<li>
<a href = "fem2d_heat/fem2d_heat.html">
fem2d_heat</a>,
a program which
applies the finite element method
to solve the time-dependent heat equation in an
arbitrary triangulated region in 2D;
</li>
<li>
<a href = "fem2d_heat_rectangle/fem2d_heat_rectangle.html">
fem2d_heat_rectangle</a>,
a program which
applies the finite element method
to solve the time dependent heat equation on a square in 2D;
</li>
<li>
<a href = "fem2d_heat_square/fem2d_heat_square.html">
fem2d_heat_square</a>,
a library which
defines the geometry of a square region, as well as boundary and initial
conditions for a given heat problem, and is called by fem2d_heat
as part of a solution procedure.
</li>
<li>
<a href = "fem2d_navier_stokes/fem2d_navier_stokes.html">
fem2d_navier_stokes</a>,
a program which
applies the finite element method
to solve the steady incompressible Navier Stokes equations
in an arbitrary triangulated region in 2D;
</li>
<li>
<a href = "fem2d_navier_stokes_cavity/fem2d_navier_stokes_cavity.html">
fem2d_navier_stokes_cavity</a>,
a library which
contains the user-supplied routines necessary to run
fem2d_navier_stokes on the cavity problem.
</li>
<li>
<a href = "fem2d_navier_stokes_channel/fem2d_navier_stokes_channel.html">
fem2d_navier_stokes_channel</a>,
a library which
contains the user-supplied routines necessary to run
fem2d_navier_stokes on the channel problem.
</li>
<li>
<a href = "fem2d_navier_stokes_inout/fem2d_navier_stokes_inout.html">
fem2d_navier_stokes_inout</a>,
a library which
contains the user-supplied routines necessary to run
fem2d_navier_stokes on the inout problem.
</li>
<li>
<a href = "fem2d_pack/fem2d_pack.html">
fem2d_pack</a>,
a library which
implements various 2D finite element calculations;
</li>
<li>
<a href = "fem2d_poisson/fem2d_poisson.html">
fem2d_poisson</a>,
a program which
applies the finite element method
to solve Poisson's equation in an arbitrary triangulated region in 2D;
</li>
<li>
<a href = "fem2d_poisson_ell/fem2d_poisson_ell.html">
fem2d_poisson_ell</a>,
a library which
defines the geometry of an L-shaped region, as well as boundary
conditions for a given Poisson problem, and is called by
fem2d_poisson as part of a solution procedure.
</li>
<li>
<a href = "fem2d_poisson_lake/fem2d_poisson_lake.html">
fem2d_poisson_lake</a>,
a library which
defines the geometry of a lake-shaped region, as well as boundary
conditions for a given Poisson problem, and is called by
fem2d_poisson as part of a solution procedure.
</li>
<li>
<a href = "fem2d_poisson_rectangle/fem2d_poisson_rectangle.html">
fem2d_poisson_rectangle</a>,
a program which
solves the 2D Poisson equation on a rectangle,
using the finite element method,
and piecewise quadratic triangular elements.
</li>
<li>
<a href = "fem2d_poisson_rectangle_linear/fem2d_poisson_rectangle_linear.html">
fem2d_poisson_rectangle_linear</a>,
a program which
solves the 2D Poisson equation on a rectangle,
using the finite element method,
and piecewise linear triangular elements.
</li>
<li>
<a href = "fem2d_poisson_sparse/fem2d_poisson_sparse.html">
fem2d_poisson_sparse</a>,
a program which
uses the finite element method to solve
Poisson's equation on an arbitrary triangulated region in 2D;
(This is a version of fem2d_poisson which replaces
the banded storage and direct solver by a sparse storage format
and an iterative solver.)
</li>
<li>
<a href = "fem2d_poisson_sparse_ell/fem2d_poisson_sparse_ell.html">
fem2d_poisson_sparse_ell</a>,
a library which
defines the geometry of an L-shaped region, as well as boundary
conditions for a given Poisson problem, and is called by
fem2d_poisson_sparse
as part of a solution procedure.
</li>
<li>
<a href = "fem2d_poisson_sparse_lake/fem2d_poisson_sparse_lake.html">
fem2d_poisson_sparse_lake</a>,
a library which
defines the geometry of a lake-shaped region, as well as boundary
conditions for a given Poisson problem, and is called by
fem2d_poisson_sparse
as part of a solution procedure.
</li>
<li>
<a href = "fem2d_project/fem2d_project.html">
fem2d_project</a>,
a program which
projects a function f(x,y), given as data,
into a given finite element space
of piecewise linear triangular elements.
</li>
<li>
<a href = "fem2d_project_function/fem2d_project_function.html">
fem2d_project_function</a>,
a program which
projects a function f(x,y), given as a formula,
into a given finite element space
of piecewise linear triangular elements.
</li>
<li>
<a href = "fem2d_sample/fem2d_sample.html">
fem2d_sample</a>,
a program which
samples a finite element
function, defined by FEM files,
(three text files describing the nodes, triangles, and coefficients);
at arbitrary points.
</li>
<li>
<a href = "fem2d_stokes/fem2d_stokes.html">
fem2d_stokes</a>,
a program which
applies the finite element method
to solve the steady incompressible Stokes's equations
in an arbitrary triangulated region in 2D;
</li>
<li>
<a href = "fem2d_stokes_cavity/fem2d_stokes_cavity.html">
fem2d_stokes_cavity</a>,
a library which
contains the user-supplied routines necessary to run fem2d_stokes
on the cavity problem.
</li>
<li>
<a href = "fem2d_stokes_channel/fem2d_stokes_channel.html">
fem2d_stokes_channel</a>,
a library which
contains the user-supplied routines necessary to run fem2d_stokes
on the channel problem.
</li>
<li>
<a href = "fem2d_stokes_inout/fem2d_stokes_inout.html">
fem2d_stokes_inout</a>,
a library which
contains the user-supplied routines necessary to run fem2d_stokes
on the inout problem.
</li>
<li>
<a href = "fem3d_pack/fem3d_pack.html">
fem3d_pack</a>,
a library which
contains utilities for 3D finite element method (FEM) calculations.
</li>
<li>
<a href = "fem3d_project/fem3d_project.html">
fem3d_project</a>,
a program which
projects a function f(x,y,z), given as a data,
into a given finite element space
of piecewise linear tetrahedral elements.
</li>
<li>
<a href = "fem3d_sample/fem3d_sample.html">
fem3d_sample</a>,
a program library which
evaluates a finite element function defined on a 3D tetrahedral mesh.
</li>
<li>
<a href = "fern_opengl/fern_opengl.html">
fern_opengl</a>,
a program which
uses OpenGL to display the Barnsley fractal fern.
</li>
<li>
<a href = "feynman_kac_1d/feynman_kac_1d.html">
feynman_kac_1d</a>,
a program which
demonstrates the use of the Feynman-Kac algorithm
to solve Poisson's equation in a 1D interval by averaging
stochastic paths to the boundary.
</li>
<li>
<a href = "feynman_kac_2d/feynman_kac_2d.html">
feynman_kac_2d</a>,
a program which
demonstrates the use of the Feynman-Kac algorithm
to solve Poisson's equation in a 2D ellipse by averaging
stochastic paths to the boundary.
</li>
<li>
<a href = "feynman_kac_3d/feynman_kac_3d.html">
feynman_kac_3d</a>,
a program which
demonstrates the use of the Feynman-Kac algorithm
to solve Poisson's equation in a 3D ellipsoid by averaging
stochastic paths to the boundary.
</li>
<li>
<a href = "fft_openmp/fft_openmp.html">
fft_openmp</a>,
a program which
demonstrates the computation of a Fast Fourier Transform (FFT)
in parallel, using OpenMP.
</li>
<li>
<a href = "fft_serial/fft_serial.html">
fft_serial</a>,
a program which
computes a Fast Fourier Transform (FFT), and is intended as
a starting point for implementing an OpenMP parallel version.
</li>
<li>
<a href = "file_name_sequence/file_name_sequence.html">
file_name_sequence</a>,
a program which
demonstrates ways to generate a sequence of filenames, which can
be useful when generating a sequence of still snapshots to be animated later.
</li>
<li>
<a href = "filum/filum.html">
filum</a>,
a library which
performs various operations with files;
</li>
<li>
<a href = "floyd/floyd.html">
floyd</a>,
a library which
implements Floyd's algorithm for finding the shortest distance
between pairs of nodes on a directed graph.
</i>
<li>
<a href = "fn/fn.html">
fn</a>,
a library which
evaluates elementary and special functions,
by Wayne Fullerton.
</li>
<li>
<a href = "fsu_dakota/fsu_dakota.html">
fsu_dakota</a>,
a library which
implements a variety of methods
for the generation of quasirandom numbers, submitted for
inclusion in the Sandia Labs DAKOTA package;
</li>
<li>
<a href = "g++_intrinsics/g++_intrinsics.html">
g++_intrinsics</a>,
a program which
tests or demonstrates some of the intrinsic functions
provided by the Gnu G++ compiler for C++.
</li>
<li>
<a href = "g++_quadmath/g++_quadmath.html">
g++_quadmath</a>,
a program which
illustrates the use of quadruple precision real arithmetic,
as provided on some systems by the Gnu g++ compiler for C++.
</li>
<li>
<a href = "gegenbauer_rule/gegenbauer_rule.html">
gegenbauer_rule</a>,
a program which
computes and writes out a Gauss-Gegenbauer quadrature rule of given order.
</li>
<li>
<a href = "gen_hermite_rule/gen_hermite_rule.html">
gen_hermite_rule</a>,
a program which
computes and writes out a generalized Gauss-Hermite quadrature rule of given order
and parameter value.
</li>
<li>
<a href = "gen_laguerre_rule/gen_laguerre_rule.html">
gen_laguerre_rule</a>,
a program which
computes and writes out a generalized Gauss-Laguerre quadrature rule of given order
and parameter value.
</li>
<li>
<a href = "geometry/geometry.html">
geometry</a>,
a library which
carries out geometrical algorithms for 2D, 3D, ND;
</li>
<li>
<a href = "geompack/geompack.html">
geompack</a>,
a library which
computes the Delaunay triangulation of 2D data,
by Barry Joe;
</li>
<li>
<a href = "gm_rule/gm_rule.html">
gm_rule</a>,
a library which
defines Grundmann-Moeller quadratures rules for an M-dimensional simplex.
</li>
<li>
<a href = "gnuplot_i_examples/gnuplot_i_examples.html">
gnuplot_i_examples</a>,
programs which
demonstrate the use of the gnuplot_i library for interactive
runtime gnuplot graphics.
</li>
<li>
<a href = "gprof/gprof.html">
gprof</a>,
programs which
illustrate the use of the gprof program performance monitor;
</li>
<li>
<a href = "graphics_examples/graphics_examples.html">
graphics_examples</a>,
programs which
illustrate how various kinds of data can be displayed and analyzed graphically.
</li>
<li>
<a href = "grf_display_opengl/grf_display_opengl.html">
grf_display_opengl</a>,
a program which
reads a GRF file defining a mathematical graph and
displays it in the OpenGL graphics window.
</li>
<li>
<a href = "grf_io/grf_io.html">
grf_io</a>,
a library which
reads or writes a GRF file;
</li>
<li>
<a href = "grid/grid.html">
grid</a>,
a library which
generates N random points on an
M-dimensional uniform grid;
</li>
<li>
<a href = "grid_dataset/grid_dataset.html">
grid_dataset</a>,
a program which
creates a file of grid values;
</li>
<li>
<a href = "grid_to_bmp/grid_to_bmp.html">
grid_to_bmp</a>,
a program which reads a text file of data on a rectangular grid
and creates a BMP file containing a color image of the data.
</li>
<li>
<a href = "gsl/gsl.html">
gsl</a>,
programs which
illustrate the use of the Gnu Scientific Library (GSL);
</li>
<li>
<a href = "haar/haar.html">
haar</a>,
a library which
computes the Haar transform of data.
</li>
<li>
<a href = "halton/halton.html">
halton</a>,
a library which
computes elements of the Halton M-dimensional quasirandom sequence;
</li>
<li>
<a href = "halton_dataset/halton_dataset.html">
halton_dataset</a>,
a program which
creates a Halton quasirandom sequence;
</li>
<li>
<a href = "hammersley/hammersley.html">
hammersley</a>,
a library which
computes elements of the Hammersley M-dimensional quasirandom sequence;
</li>
<li>
<a href = "hammersley_dataset/hammersley_dataset.html">
hammersley_dataset</a>,
a program which
creates a Hammersley quasirandom sequence;
</li>
<li>
<a href = "hb_io/hb_io.html">
hb_io</a>,
a library which
reads and writes matrices in the Harwell Boeing (HB) sparse matrix format;
</li>
<li>
<a href = "heat_mpi/heat_mpi.html">
heat_mpi</a>,
a program which
demonstrates the use of MPI, by
solving the 1D time dependent heat equation.
</li>
<li>
<a href = "heated_plate/heated_plate.html">
heated_plate</a>,
a program which
solves the steady state heat equation in a 2D
rectangular region, and is intended as
a starting point for implementing an OpenMP parallel version.
</li>
<li>
<a href = "heated_plate_openmp/heated_plate_openmp.html">
heated_plate_openmp</a>,
a program which
solves the steady (time independent) heat equation in a 2D
rectangular region, using OpenMP to run in parallel.
</li>
<li>
<a href = "hello/hello.html">
hello</a>,
a program which
prints out "Hello, world!".
</li>
<li>
<a href = "hello_mpi/hello_mpi.html">
hello_mpi</a>,
a program which
prints out "Hello, world!" using MPI for parallel programming.
</li>
<li>
<a href = "hello_openmp/hello_openmp.html">
hello_openmp</a>,
a program which
prints out "Hello, world!" within the OpenMP parallel programming
environment.
</li>
<li>
<a href = "hermite/hermite.html">
hermite</a>,
a library which
computes the Hermite interpolant, a polynomial that matches function values
and derivatives.
</li>
<li>
<a href = "hermite_cubic/hermite_cubic.html">
hermite_cubic</a>,
a library which
can compute the value, derivatives or integral of a Hermite cubic polynomial,
or manipulate an interpolating function made up of piecewise Hermite cubic
polynomials.
</li>
<li>
<a href = "hermite_polynomial/hermite_polynomial.html">
hermite_polynomial</a>,
a library which
evaluates the physicist's Hermite polynomial, the probabilist's Hermite polynomial,
the Hermite function, and related functions.
</li>
<li>
<a href = "hermite_rule/hermite_rule.html">
hermite_rule</a>,
a program which
computes and writes out a Gauss-Hermite quadrature rule of given order.
</li>
<li>
<a href = "hex_grid/hex_grid.html">
hex_grid</a>,
a library which
creates a hexagonal grid of points in the unit square or an arbitrary rectangle;
</li>
<li>
<a href = "hex_grid_dataset/hex_grid_dataset.html">
hex_grid_dataset</a>,
a program which
creates a hexagonal grid of points, using the hex_grid library;
</li>
<li>
<a href = "hexdump/hexdump.html">
hexdump</a>,
a program which
produces a hexadecimal dump of a file;
</li>
<li>
<a href = "htmlindex/htmlindex.html">
htmlindex</a>,
a program which
creates a skeleton HTML page for a marked-up C, C++ or FORTRAN file;
</li>
<li>
<a href = "i2_binary_to_ascii/i2_binary_to_ascii.html">
i2_binary_to_ascii</a>,
a program which
converts a file of short int (I2) data from binary to ASCII format.
</li>
<li>
<a href = "i4lib/i4lib.html">
i4lib</a>,
a library which
contains many utility routines, using single precision integer (I4)
arithmetic.
</li>
<li>
<a href = "i8lib/i8lib.html">
i8lib</a>,
a library which
contains many utility routines, using double precision integer (I8)
arithmetic.
</li>
<li>
<a href = "ice_io/ice_io.html">
ice_io</a>,
a library which
reads or writes ICE grid files stored in netcdf format.
</li>
<li>
<a href = "ice_to_mesh/ice_to_mesh.html">
ice_to_mesh</a>,
a program which
reads a netcdf file containing an ICE dataset and rewrites the
information as a MESH file.
</li>
<li>
<a href = "ihs/ihs.html">
ihs</a>,
a library which
computes elements of the Improved Hypercube Sampling (IHS)
M-dimensional quasirandom sequence;
</li>
<li>
<a href = "ihs_dataset/ihs_dataset.html">
ihs_dataset</a>,
a program which
creates an Improved Hypercube Sampling (IHS) dataset;
</li>
<li>
<a href = "image_components/image_components.html">
image_components</a>,
a library which
seeks the connected nonzero or nonblack components of an image or integer array.
</li>
<li>
<a href = "image_denoise/image_denoise.html">
image_denoise</a>,
a library which
applies simple filtering operations to a noisy image.
</li>
<li>
<a href = "image_edge/image_edge.html">
image_edge</a>,
a library which
demonstrates a simple procedure for edge detection in images.
</li>
<li>
<a href = "index/index.html">
index</a>,
a library which
converts a multidimensional vector index to a one-dimensional vector index;
it can handle zero and one based indexing schemes, as well as column major
and row major conventions.
</li>
<li>
<a href = "int_exactness/int_exactness.html">
int_exactness</a>,
a program which
tests the polynomial exactness of a 1D quadrature rule for a finite interval;
</li>
<li>
<a href = "int_exactness_chebyshev1/int_exactness_chebyshev1.html">
int_exactness_chebyshev1</a>,
a program which
tests the polynomial exactness of Gauss-Chebyshev type 1 quadrature rules.
</li>
<li>
<a href = "int_exactness_chebyshev2/int_exactness_chebyshev2.html">
int_exactness_chebyshev2</a>,
a program which
tests the polynomial exactness of Gauss-Chebyshev type 2 quadrature rules.
</li>
<li>
<a href = "int_exactness_gegenbauer/int_exactness_gegenbauer.html">
int_exactness_gegenbauer</a>,
a program which
tests the polynomial exactness of Gauss-Gegenbauer quadrature rules.
</li>
<li>
<a href = "int_exactness_gen_hermite/int_exactness_gen_hermite.html">
int_exactness_gen_hermite</a>,
a program which
tests the polynomial exactness of generalized Gauss-Hermite quadrature rules.
</li>
<li>
<a href = "int_exactness_gen_laguerre/int_exactness_gen_laguerre.html">
int_exactness_gen_laguerre</a>,
a program which
tests the polynomial exactness of generalized Gauss-Laguerre quadrature rules.
</li>
<li>
<a href = "int_exactness_hermite/int_exactness_hermite.html">
int_exactness_hermite</a>,
a program which
tests the polynomial exactness of Gauss-Hermite quadrature rules.
</li>
<li>
<a href = "int_exactness_jacobi/int_exactness_jacobi.html">
int_exactness_jacobi</a>,
a program which
tests the polynomial exactness of Gauss-Jacobi quadrature rules.
</li>
<li>
<a href = "int_exactness_laguerre/int_exactness_laguerre.html">
int_exactness_laguerre</a>,
a program which
tests the polynomial exactness of Gauss-Laguerre quadrature rules.
</li>
<li>
<a href = "int_exactness_legendre/int_exactness_legendre.html">
int_exactness_legendre</a>,
a program which
tests the polynomial exactness of Gauss-Legendre quadrature rules.
</li>
<li>
<a href = "ising_2d_simulation/ising_2d_simulation.html">
ising_2d_simulation</a>,
a program which
simulates the evolution of a 2D array of positive and negative charges,
each of which is likely to flip to be in agreement with neighbors.
</li>
<li>
<a href = "ivcon/ivcon.html">
ivcon</a>,
a program which
converts between various 3D graphic file formats;
</li>
<li>
<a href = "jacobi/jacobi.html">
jacobi</a>,
a program which
implements the Jacobi iteration for linear systems.
</li>
<li>
<a href = "jacobi_polynomial/jacobi_polynomial.html">
jacobi_polynomial</a>,
a library which
evaluates the Jacobi polynomial and associated functions.
</li>
<li>
<a href = "jacobi_rule/jacobi_rule.html">
jacobi_rule</a>,
a program which
computes and writes out a Gauss-Jacobi quadrature rule of given order.
</li>
<li>
<a href = "keast/keast.html">
keast</a>,
a library which
defines Keast quadrature rules in a tetrahedron;
</li>
<li>
<a href = "kmeans/kmeans.html">
kmeans</a>,
a library which
handles the K-Means problem,
which organizes a set of N points in M dimensions into K clusters;
</li>
<li>
<a href = "kronrod/kronrod.html">
kronrod</a>,
a library which
can compute a Gauss and Gauss-Kronrod pair of quadrature rules
of arbitrary order,
by Robert Piessens, Maria Branders.
</li>
<li>
<a href = "lagrange_approx_1d/lagrange_approx_1d.html">
lagrange_approx_1d</a>,
a library which
defines and evaluates the Lagrange polynomial p(x) of degree m
which approximates a set of nd data points (x(i),y(i)).
</li>
<li>
<a href = "lagrange_interp_1d/lagrange_interp_1d.html">
lagrange_interp_1d</a>,
a library which
defines and evaluates the Lagrange polynomial p(x)
which interpolates a set of data depending on a 1D argument,
so that p(x(i)) = y(i).
</li>
<li>
<a href = "lagrange_interp_2d/lagrange_interp_2d.html">
lagrange_interp_2d</a>,
a library which
defines and evaluates the Lagrange polynomial p(x,y)
which interpolates a set of data depending on a 2D argument
that was evaluated on a product grid,
so that p(x(i),y(j)) = z(i,j).
</li>
<li>
<a href = "lagrange_interp_nd/lagrange_interp_nd.html">
lagrange_interp_nd</a>,
a library which
defines and evaluates the Lagrange polynomial p(x)
which interpolates a set of data depending on a multidimensional argument
that was evaluated on a product grid,
so that p(x(i)) = z(i).
</li>
<li>
<a href = "laguerre_polynomial/laguerre_polynomial.html">
laguerre_polynomial</a>,
a library which
evaluates the Laguerre polynomial, the generalized Laguerre polynomials,
and the Laguerre function.
</li>
<li>
<a href = "laguerre_rule/laguerre_rule.html">
laguerre_rule</a>,
a program which
computes and writes out a Gauss-Laguerre quadrature rule of given order.
</li>
<li>
<a href = "latin_center/latin_center.html">
latin_center</a>,
a library which
computes Latin Center Squares of N points in M dimensions;
</li>
<li>
<a href = "latin_center_dataset/latin_center_dataset.html">
latin_center_dataset</a>,
a program which
creates a Latin Center Hypercube dataset;
</li>
<li>
<a href = "latin_cover/latin_cover.html">
latin_cover</a>,
a library which
produces N Latin squares which cover an NxN square, or NxN Latin cubes
which cover an NxNxN cube.
</li>
<li>
<a href = "latin_edge/latin_edge.html">
latin_edge</a>,
a library which
computes Latin Edge Squares of N points in M dimensions;
</li>
<li>
<a href = "latin_edge_dataset/latin_edge_dataset.html">
latin_edge_dataset</a>,
a program which
creates a Latin Edge Hypercube dataset;
</li>
<li>
<a href = "latin_random/latin_random.html">
latin_random</a>,
a library which
computes Latin Random Squares of N points in M dimensions;
</li>
<li>
<a href = "latin_random_dataset/latin_random_dataset.html">
latin_random_dataset</a>,
a program which
creates a Latin Random Hypercube dataset;
</li>
<li>
<a href = "latinize/latinize.html">
latinize</a>,
a library which
adjusts N points in M dimensions to form a Latin Hypercube;
</li>
<li>
<a href = "lattice_rule/lattice_rule.html">
lattice_rule</a>,
a library which
returns lattice rules for M-dimensional integration;
</li>
<li>
<a href = "lcvt/lcvt.html">
lcvt</a>,
a library which
creates a Latinized Centroidal Voronoi Tessellation (CVT);
</li>
<li>
<a href = "lcvt_dataset/lcvt_dataset.html">
lcvt_dataset</a>,
a program which
creates a Latinized Centroidal Voronoi Tessellation (CVT);
</li>
<li>
<a href = "legendre_polynomial/legendre_polynomial.html">
legendre_polynomial</a>,
a library which
evaluates the Legendre polynomial and associated functions.
</li>
<li>
<a href = "legendre_rule/legendre_rule.html">
legendre_rule</a>,
a program which
writes out a Gauss-Legendre quadrature rule of given order.
</li>
<li>
<a href = "legendre_rule_fast/legendre_rule_fast.html">
legendre_rule_fast</a>,
a program which
uses a fast (order N) algorithm to compute a Gauss-Legendre quadrature rule of given order.
</li>
<li>
<a href = "lf2cr/lf2cr.html">
lf2cr</a>,
a program which
converts linefeeds to carriage returns in a file;
</li>
<li>
<a href = "lf2crlf/lf2crlf.html">
lf2crlf</a>,
a program which
converts linefeeds to carriage return + linefeeds in a file;
</li>
<li>
<a href = "lfrm/lfrm.html">
lfrm</a>,
a program which
removes all linefeed characters from a file;
</li>
<li>
<a href = "life_opengl/life_opengl.html">
life_opengl</a>,
a program which
uses OpenGL to display the evolution of John Conway's Game of Life.
</li>
<li>
<a href = "lights_out_opengl/lights_out_opengl.html">
lights_out_opengl</a>,
a program which
sets up a Lights Out game and allows the user to solve it,
using the OpenGL graphics window.
</li>
<li>
<a href = "linpack/linpack.html">
linpack</a>,
a library which
solves linear systems for a variety of matrix storage schemes,
real or complex arithmetic, and single or double precision,
by Jack Dongarra, Cleve Moler, Jim Bunch, Pete Stewart.
</li>
<li>
<a href = "linpack_bench/linpack_bench.html">
linpack_bench</a>,
a program which
is a version of the LINPACK benchmark program;
</li>
<li>
<a href = "linpack_c/linpack_c.html">
linpack_c</a>,
a library which
factors matrices in a variety of formats, and solving the
associated linear systems, using single precision complex arithmetic;
it includes a function to compute the singular value decomposition (SVD)
of a rectangular matrix.
This library is by Jack Dongarra, Cleve Moler, Jim Bunch, Pete Stewart.
</li>
<li>
<a href = "linpack_d/linpack_d.html">
linpack_d</a>,
a library which
factors matrices in a variety of formats, and solving the
associated linear systems, using double precision real arithmetic;
it includes a function to compute the singular value decomposition (SVD)
of a rectangular matrix.
This library is by Jack Dongarra, Cleve Moler, Jim Bunch, Pete Stewart.
</li>
<li>
<a href = "linpack_s/linpack_s.html">
linpack_s</a>,
a library which
factors matrices in a variety of formats, and solving the
associated linear systems, using single precision real arithmetic;
it includes a function to compute the singular value decomposition (SVD)
of a rectangular matrix.
This library is by Jack Dongarra, Cleve Moler, Jim Bunch, Pete Stewart.
</li>
<li>
<a href = "linpack_z/linpack_z.html">
linpack_z</a>,
a library which
factors matrices in a variety of formats, and solving the
associated linear systems, using double precision complex arithmetic;
it includes a function to compute the singular value decomposition (SVD)
of a rectangular matrix.
This library is by Jack Dongarra, Cleve Moler, Jim Bunch, Pete Stewart.
</li>
<li>
<a href = "linplus/linplus.html">
linplus</a>,
a library which
factors/solves/multiplies matrices in a variety of formats;
</li>
<li>
<a href = "lissajous_opengl/lissajous_opengl.html">
lissajous_opengl</a>,
a program which computes a Lissajous curve and displays it using OpenGL.
</li>
<li>
<a href = "llsq/llsq.html">
llsq</a>,
a library which
solves the simple linear least squares problem of finding the formula
of a straight line y=a*x+b which minimizes the root-mean-square error
to a set of N data points.
</li>
<li>
<a href = "lyness_rule/lyness_rule.html">
lyness_rule</a>,
a library which
returns Lyness-Jespersen quadrature rules for the triangle.
</li>
<li>
<a href = "machar/machar.html">
machar</a>,
a library which
dynamically computes the values of various machine characteristic constants
by William Cody;
</li>
<li>
<a href = "machine/machine.html">
machine</a>,
a library which
returns tabulated values of the constants associated with computer arithmetic
</li>
<li>
<a href = "makefiles/makefiles.html">
makefiles</a>,
programs which
illustrate the use of makefiles for maintaining a software project;
</li>
<li>
<a href = "mandelbrot/mandelbrot.html">
mandelbrot</a>,
a program which
generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot set;
</li>
<li>
<a href = "mandelbrot_openmp/mandelbrot_openmp.html">
mandelbrot_openmp</a>,
a program which
generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot fractal set,
using OpenMP for parallel execution;
</li>
<li>
<a href = "mandelbrot_ppm/mandelbrot_ppm.html">
mandelbrot_ppm</a>,
a program which
generates a binary Portable Pixel Map (PPM) image of the Mandelbrot set,
by Eric Weeks.
</li>
<li>
<a href = "matrix_exponential/matrix_exponential.html">
matrix_exponential</a>,
a library which
demonstrates some simple approaches to the problem of computing the
exponential of a matrix.
</li>
<li>
<a href = "md/md.html">
md</a>,
a program which
carries out a molecular dynamics simulation, and is intended as
a starting point for implementing an OpenMP parallel version.
</li>
<li>
<a href = "md_openmp/md_openmp.html">
md_openmp</a>,
a program which
carries out a molecular dynamics simulation in parallel using OpenMP.
</li>
<li>
<a href = "memory_test/memory_test.html">
memory_test</a>,
a program which
tests the memory available on the computer by declaring
and using big vectors.
</li>
<li>
<a href = "mesh_bandwidth/mesh_bandwidth.html">
mesh_bandwidth</a>,
a program which
returns the geometric bandwidth associated with a mesh of
elements of any order and in a space of M dimensions.
</li>
<li>
<a href = "mesh_display_opengl/mesh_display_opengl.html">
mesh_display_opengl</a>,
a program which
reads data defining a polygonal mesh and displays it using OpenGL.
</li>
<li>
<a href = "mesh_io/mesh_io.html">
mesh_io</a>,
a library which
can read or write MESH files, which can be used to define the geometry
of a finite element mesh in 2D or 3D, using triangles, quadrilaterals,
tetrahedrons or hexahedrons.
</li>
<li>
<a href = "mesh_to_ice/mesh_to_ice.html">
mesh_to_ice</a>,
a program which
reads the ICE dataset information from a MESH files and rewrites
it to a netcdf file.
</li>
<li>
<a href = "mgmres/mgmres.html">
mgmres</a>,
a library which
applies the restarted GMRES algorithm to a sparse linear system,
by Lili Ju;
</li>
<li>
<a href = "mgs/mgs.html">
mgs</a>,
a library which
is an example of legacy code, which the student is encouraged to
study, understand, and document. This example is due to Diane O'Leary.
</li>
<li>
<a href = "minesweeper/minesweeper.html">
minesweeper</a>,
a program which
is a text-based implementation of the Minesweeper game,
by Detelina Stoyanova.
</li>
<li>
<a href = "minpack/minpack.html">
minpack</a>,
a library which
solves linear and nonlinear least squares problems.
</li>
<li>
<a href = "mixed/mixed.html">
mixed</a>,
programs which
illustrate mixed language programming in which the main program
is written in C++;
</li>
<li>
<a href = "mpas_draw/mpas_draw.html">
mpas_draw</a>,
a program which
reads an MPAS netcdf file and allows the interactive user to select
grid and solution information to be displayed using OpenGL,
by Doug Jacobsen, John Burkardt, Geoff Womeldorff.
</li>
<li>
<a href = "mpas_grid_display_opengl/mpas_grid_display_opengl.html">
mpas_grid_display_opengl</a>,
programs which
can read an MPAS netcdf grid file and display the primary polygonal
mesh or the dual triangular mesh, using OpenGL.
</li>
<li>
<a href = "mpi/mpi.html">
mpi</a>,
programs which
illustrate the use of the MPI Message Passing Interface
library, for parallel programming;
</li>
<li>
<a href = "mpi_stubs/mpi_stubs.html">
mpi_stubs</a>,
a library which
may be used if a parallel program is to be compiled, loaded and run in a
serial machine;
</li>
<li>
<a href = "multigrid_poisson_1d/multigrid_poisson_1d.html">
multigrid_poisson_1d</a>,
a library which
applies the multigrid method to a discretized version of the
1D Poisson equation.
</li>
<li>
<a href = "multitask_mpi/multitask_mpi.html">
multitask_mpi</a>,
a program which
demonstrates how to multitask, that is, to execute several unrelated
and distinct tasks simultaneously, using MPI for parallel execution.
</li>
<li>
<a href = "multitask_openmp/multitask_openmp.html">
multitask_openmp</a>,
a program which
demonstrates how to multitask, that is, to execute several unrelated
and distinct tasks simultaneously, using OpenMP for parallel execution.
</li>
<li>
<a href = "mxm/mxm.html">
mxm</a>,
a program which
sets up a matrix multiplication problem A=B*C of arbitrary size,
and compares the time required for IJK, IKJ, JIK, JKI, KIJ and KJI orderings
of the loops.
</li>
<li>
<a href = "mxm_openmp/mxm_openmp.html">
mxm_openmp</a>,
a program which
computes a dense matrix product C=A*B,
using OpenMP for parallel execution.
</li>
<li>
<a href = "mxm_serial/mxm_serial.html">
mxm_serial</a>,
a program which
sets up a matrix multiplication problem A=B*C,
intended as a starting point for implementing a parallel version.
</li>
<li>
<a href = "mxv/mxv.html">
mxv</a>,
a program which
compares the performance of (for i, for j) loops and (for j, for i) loops
for computing the product of an MxN matrix A and an N vector X.
</li>
<li>
<a href = "mxv_openmp/mxv_openmp.html">
mxv_openmp</a>,
a program which
compares the performance of the matrix multiplication problem
y=A*x, with and without parallelization by OpenMP.
</li>
<li>
<a href = "my_calendar/my_calendar.html">
my_calendar</a>,
a program which
checks a calendar file and prints any line containing the current date;
</li>
<li>
<a href = "nas/nas.html">
nas</a>,
a program which
runs the NASA kernel benchmark.
</li>
<li>
<a href = "nast2d/nast2d.html">
nast2d</a>,
a program which
applies the 2D finite volume method to solve
transient Navier Stokes flow, by Griebel, Dornseifer and Neunhoffer;
</li>
<li>
<a href = "ncc_tetrahedron/ncc_tetrahedron.html">
ncc_tetrahedron</a>,
a library which
defines Newton-Cotes closed quadrature rules in a tetrahedron;
</li>
<li>
<a href = "ncc_triangle/ncc_triangle.html">
ncc_triangle</a>,
a library which
defines Newton-Cotes closed
quadrature rules in a triangle;
</li>
<li>
<a href = "nco_tetrahedron/nco_tetrahedron.html">
nco_tetrahedron</a>,
a library which
defines Newton-Cotes open quadrature rules in a tetrahedron;
</li>
<li>
<a href = "nco_triangle/nco_triangle.html">
nco_triangle</a>,
a library which
defines Newton-Cotes open quadrature rules in a triangle;
</li>
<li>
<a href = "nearest_interp_1d/nearest_interp_1d.html">
nearest_interp_1d</a>,
a library which
interpolates a set of data using a piecewise constant interpolant
defined by the nearest neighbor criterion.
</li>
<li>
<a href = "neighbors_to_metis_graph/neighbors_to_metis_graph.html">
neighbors_to_metis_graph</a>,
a program which
reads a file describing the neighbor
structure of a triangulation or tet mesh, and writes a metis graph
file suitable for input to one of the family of programs based
on metis;
</li>
<li>
<a href = "netcdf/netcdf.html">
netcdf</a>,
programs which
read and write netcdf files.
</li>
<li>
<a href = "netcdf_mpas/netcdf_mpas.html">
netcdf_mpas</a>,
a library which
reads MPAS grid data stored as a netcdf file.
</li>
<li>
<a href = "niederreiter/niederreiter.html">
niederreiter</a>,
a library which
computes elements of the Niederreiter
quasirandom M-dimensional sequence [arbitrary base];
</li>
<li>
<a href = "niederreiter2/niederreiter2.html">
niederreiter2</a>,
a library which
computes elements of the Niederreiter
M-dimensional quasirandom sequence using base 2;
</li>
<li>
<a href = "niederreiter2_dataset/niederreiter2_dataset.html">
niederreiter2_dataset</a>,
a program which
creates a Niederreiter quasirandom dataset with base 2;
</li>
<li>
<a href = "nint_exactness/nint_exactness.html">
nint_exactness</a>,
a program which
tests the polynomial exactness
of an M-dimensional quadrature rule
defined over a finite rectangular product region.
</li>
<li>
<a href = "nint_exactness_mixed/nint_exactness_mixed.html">
nint_exactness_mixed</a>,
a program which
measures the polynomial exactness of an M-dimensional quadrature rule
based on a mixture of 1D quadrature rule factors.
</li>
<li>
<a href = "nintlib/nintlib.html">
nintlib</a>,
a library which
implements approximate integration (quadrature) in M dimensions;
</li>
<li>
<a href = "normal/normal.html">
normal</a>,
a library which
generates pseudorandom normal numbers;
</li>
<li>
<a href = "normal_dataset/normal_dataset.html">
normal_dataset</a>,
a program which
creates a multivariate normal random dataset;
</li>
<li>
<a href = "obj_io/obj_io.html">
obj_io</a>,
a library which
reads and writes the data in an OBJ 3D graphics file;
</li>
<li>
<a href = "ode/ode.html">
ode</a>,
a library which
solves a system of ordinary differential equations,
by Shampine and Gordon;
</li>
<li>
<a href = "off2plc/off2plc.html">
off2plc</a>,
a program which
reads an OFF file describing a surface in 3D, and creates an equivalent
PLC file, by Alex Rand.
</li>
<li>
<a href = "opengl/opengl.html">
opengl</a>,
programs which
illustrate the use of the OpenGL graphics library;
</li>
<li>
<a href = "openmp/openmp.html">
openmp</a>,
programs which
illustrate the use of the OpenMP interface for
parallel programming shared memory system;
</li>
<li>
<a href = "openmp_stubs/openmp_stubs.html">
openmp_stubs</a>,
a library which
is a dummy implementation of the OpenMP routines,
and can be used to compile, load, and run a program using OpenMP on a
system which does not have OpenMP installed.
</li>
<li>
<a href = "optimize/optimize.html">
optimize</a>,
a program which
looks at the use of automatic optimization by the compiler
to make the executable code run faster.
</li>
<li>
<a href = "owens/owens.html">
owens</a>,
a library which
evaluates Owen's T function;
</li>
<li>
<a href = "pages/pages.html">
pages</a>,
a program which
counts the number of pages (sets of 60 lines) in a file;
</li>
<li>
<a href = "partition_problem/partition_problem.html">
partition_problem</a>,
a library which
seeks solutions of the partition problem, splitting a set of integers into
two subsets with equal sum.
</li>
<li>
<a href = "patterson_rule/patterson_rule.html">
patterson_rule</a>,
a program which
looks up and writes out a Gauss-Patterson quadrature rule of given order.
</li>
<li>
<a href = "pbma_io/pbma_io.html">
pbma_io</a>,
a library which
reads or writes an ASCII Portable Bit Map (PBM) graphics file;
</li>
<li>
<a href = "pbma_to_pbmb/pbma_to_pbmb.html">
pbma_to_pbmb</a>,
a program which
converts an ASCII Portable Bit Map (PBM) file to a binary PBM file;
</li>
<li>
<a href = "pbmb_io/pbmb_io.html">
pbmb_io</a>,
a library which
reads or writes a binary Portable Bit Map (PBM) graphics file;
</li>
<li>
<a href = "pbmb_to_pbma/pbmb_to_pbma.html">
pbmb_to_pbma</a>,
a program which
converts a binary Portable Bit Map (PBM) file to an ASCII PBM file;
</li>
<li>
<a href = "pce_burgers/pce_burgers.html">
pce_burgers</a>,
a program which
defines and solves a version of the time-dependent viscous Burgers equation,
with uncertain viscosity,
using a polynomial chaos expansion in terms of Hermite polynomials,
by Gianluca Iaccarino.
</li>
<li>
<a href = "pce_ode_hermite/pce_ode_hermite.html">
pce_ode_hermite</a>,
a program which
sets up a simple scalar ordinary differential equation (ODE)
for exponential decay with an uncertain
decay rate, using a polynomial chaos expansion in terms of Hermite polynomials.
</li>
<li>
<a href = "pcl_read/pcl_read.html">
pcl_read</a>,
a program which
reads a PCL file and extracts the numeric data;
</li>
<li>
<a href = "pgma_io/pgma_io.html">
pgma_io</a>,
a library which
reads or writes an ASCII Portable Gray Map (PGM) 2D graphics file;
</li>
<li>
<a href = "pgma_to_pgmb/pgma_to_pgmb.html">
pgma_to_pgmb</a>,
a program which
converts an ASCII Portable Gray Map (PGM) file to a binary PGM file;
</li>
<li>
<a href = "pgmb_io/pgmb_io.html">
pgmb_io</a>,
a library which
reads or writes a binary Portable Gray Map (PGM) 2D graphics file;
</li>
<li>
<a href = "pgmb_to_pgma/pgmb_to_pgma.html">
pgmb_to_pgma</a>,
a program which
converts a binary Portable Gray Map (PGM) file to an ASCII PGM file;
</li>
<li>
<a href = "piecewise_linear_product_integral/piecewise_linear_product_integral.html">
piecewise_linear_product_integral</a>,
a library which
calculates the exact value of the integral of the product of two
piecewise linear functions f(x) and g(x).
</li>
<li>
<a href = "pink_noise/pink_noise.html">
pink_noise</a>,
a library which
computes a pink noise signal obeying a 1/f power law.
</li>
<li>
<a href = "png_crc/png_crc.html">
png_crc</a>,
a program which
computes the Cyclic Redundancy Checksum (CRC) for a PNG graphics file
(or any other file, for that matter);
</li>
<li>
<a href = "point_merge/point_merge.html">
point_merge</a>,
a library which
considers N points in M dimensional space, and counts or indexes
the unique or tolerably unique items.
</li>
<li>
<a href = "poisson_openmp/poisson_openmp.html">
poisson_openmp</a>,
a program which
computes an approximate solution to the Poisson equation in a rectangle,
using the Jacobi iteration to solve the linear system, and OpenMP to
carry out the Jacobi iteration in parallel.
</li>
<li>
<a href = "poisson_serial/poisson_serial.html">
poisson_serial</a>,
a program which
computes an approximate solution to the Poisson equation in a rectangle,
and is intended as the starting point for the creation of a parallel version.
</li>
<li>
<a href = "poisson_simulation/poisson_simulation.html">
poisson_simulation</a>,
a library which
simulates a Poisson process in which events randomly occur with an
average waiting time of Lambda.
</li>
<li>
<a href = "polpak/polpak.html">
polpak</a>,
a library which
evaluates a variety of mathematical functions, including
Chebyshev, Gegenbauer, Hermite, Jacobi, Laguerre, Legendre polynomials,
and the Collatz sequence.
</li>
<li>
<a href = "polygon_moments/polygon_moments.html">
polygon_moments</a>,
a library which
computes arbitrary moments of a polygon.
</li>
<li>
<a href = "polygonal_surface_display_opengl/polygonal_surface_display_opengl.html">
polygonal_surface_display_opengl</a>,
a program which
displays a surface in 3D described as a set of polygons using OpenGL;
</li>
<li>
<a href = "power_method/power_method.html">
power_method</a>,
a library which
carries out the power method for finding a dominant eigenvalue
and its eigenvector.
</li>
<li>
<a href = "power_rule/power_rule.html">
power_rule</a>,
a program which
constructs a power rule, that is, a product quadrature rule
from identical 1D factor rules.
</li>
<li>
<a href = "ppma_io/ppma_io.html">
ppma_io</a>,
a library which
reads or writes an ASCII Portable Pixel Map (PPM) graphics file;
</li>
<li>
<a href = "ppma_to_bmp/ppma_to_bmp.html">
ppma_to_bmp</a>,
a program which
converts an ASCII Portable Pixel Map (PPM) graphics file
to a Microsoft BMP file;
</li>
<li>
<a href = "ppma_to_ppmb/ppma_to_ppmb.html">
ppma_to_ppmb</a>,
a program which
converts an ASCII Portable Pixel Map (PPM) graphics file
to binary PPM format;
</li>
<li>
<a href = "ppmb_io/ppmb_io.html">
ppmb_io</a>,
a library which
reads or writes a binary Portable Pixel Map (PPM) 2D
pixel map graphics file;
</li>
<li>
<a href = "ppmb_to_bmp/ppmb_to_bmp.html">
ppmb_to_bmp</a>,
a program which
converts a binary Portable Pixel Map (PPM) file to a Microsoft BMP file;
</li>
<li>
<a href = "ppmb_to_ppma/ppmb_to_ppma.html">
ppmb_to_ppma</a>,
a program which
converts a binary Portable Pixel Map (PPM) file to ASCII PPM format;
</li>
<li>
<a href = "prime_mpi/prime_mpi.html">
prime_mpi</a>,
a program which
counts the number of primes between 1 and N,
using MPI for parallel execution.
</li>
<li>
<a href = "prime_openmp/prime_openmp.html">
prime_openmp</a>,
a program which
counts the number of primes between 1 and N,
using OpenMP for parallel execution.
</li>
<li>
<a href = "prime_serial/prime_serial.html">
prime_serial</a>,
a program which
counts the number of primes between 1 and N,
and is intended as a starting point for a parallel version.
</li>
<li>
<a href = "prob/prob.html">
prob</a>,
a library which
evaluates the probability density function (PDF),
cumulative density function (CDF), mean, variance and
samples of various probability distributions;
</li>
<li>
<a href = "product_rule/product_rule.html">
product_rule</a>,
a program which
creates an M-dimensional quadrature rule
from a product of distinct 1d quadrature rules;
</li>
<li>
<a href = "pthreads/pthreads.html">
pthreads</a>,
programs which
illustrate the use of the POSIX thread library to carry out
parallel program execution.
</li>
<li>
<a href = "pwl_approx_1d/pwl_approx_1d.html">
pwl_approx_1d</a>,
a library which
approximates a set of data using a piecewise linear function.
</li>
<li>
<a href = "pwl_interp_1d/pwl_interp_1d.html">
pwl_interp_1d</a>,
a library which
interpolates a set of data using a piecewise linear function.
</li>
<li>
<a href = "pwl_interp_2d/pwl_interp_2d.html">
pwl_interp_2d</a>,
a library which
evaluates a piecewise linear interpolant to data defined on
a regular 2D grid.
</li>
<li>
<a href = "pwl_interp_2d_scattered/pwl_interp_2d_scattered.html">
pwl_interp_2d_scattered</a>,
a library which
evaluates a piecewise linear interpolant to data which is available
at an irregularly arranged set of points.
</li>
<li>
<a href = "pyramid_exactness/pyramid_exactness.html">
pyramid_exactness</a>,
a program which
investigates the polynomial exactness of a quadrature rule for the pyramid.
</li>
<li>
<a href = "pyramid_rule/pyramid_rule.html">
pyramid_rule</a>,
a program which
computes a quadrature rule for a pyramid.
</li>
<li>
<a href = "qr_solve/qr_solve.html">
qr_solve</a>,
a library which
computes the least squares solution of a linear system A*x=b.
</li>
<li>
<a href = "quad_mesh/quad_mesh.html">
quad_mesh</a>,
a library which
handles meshes of quadrilaterals over a 2D region;
</li>
<li>
<a href = "quad_mesh_rcm/quad_mesh_rcm.html">
quad_mesh_rcm</a>,
a program which
computes the Reverse Cuthill-McKee (RCM) reordering for nodes in a mesh of 4-node
quadrilaterals.
</li>
<li>
<a href = "quad_mpi/quad_mpi.html">
quad_mpi</a>,
a program which
applies a quadrature rule to estimate an
integral, working in parallel by using MPI;
</li>
<li>
<a href = "quad_openmp/quad_openmp.html">
quad_openmp</a>,
a program which
applies a quadrature rule to estimate an integral over a 1D interval,
using OpenMP for parallel execution;
</li>
<li>
<a href = "quad_serial/quad_serial.html">
quad_serial</a>,
a program which
applies a quadrature rule to estimate an integral,
intended as a starting point for parallelization exercises.
</li>
<li>
<a href = "quad2d_openmp/quad2d_openmp.html">
quad2d_openmp</a>,
a program which
applies a product quadrature rule to estimate an integral over a 2D rectangle,
using OpenMP for parallel execution;
</li>
<li>
<a href = "quad2d_serial/quad2d_serial.html">
quad2d_serial</a>,
a program which
applies a product quadrature rule to estimate an integral over a 2D rectangle,
intended as a starting point for parallelization exercises.
</li>
<li>
<a href = "quadrature_test/quadrature_test.html">
quadrature_test</a>,
a program which
reads the definition of an
M-dimensional quadrature rule from three files, applies
the rule to a number of test integrals, and prints the
results.
</li>
<li>
<a href = "quadrature_test_2d/quadrature_test_2d.html">
quadrature_test_2d</a>,
a program which
reads the definition of a 2D quadrature rule from
three files, applies the rule to a number of test integrals, and
prints the results.
</li>
<li>
<a href = "quadrule/quadrule.html">
quadrule</a>,
a library which
defines quadrature rules for approximating integrals;
</li>
<li>
<a href = "quality/quality.html">
quality</a>,
a library which
computes quality of distribution
measures for pointsets in M dimensions;
</li>
<li>
<a href = "r4lib/r4lib.html">
r4lib</a>,
a library which
contains many utility routines, using single precision real (R4) arithmetic.
</li>
<li>
<a href = "r8lib/r8lib.html">
r8lib</a>,
a library which
contains many utility routines, using double precision real (R8) arithmetic.
</li>
<li>
<a href = "rand48/rand48.html">
rand48</a>,
a program which
demonstrates the use of the RAND48 family of random number generators
available in the C/C++ standard library.
</li>
<li>
<a href = "randlc/randlc.html">
randlc</a>,
a library which
generates a sequence of pseudorandom numbers,
used by the NAS Benchmark programs.
</li>
<li>
<a href = "random_data/random_data.html">
random_data</a>,
a library which
generates sample points for
various probability distributions, spatial dimensions, and geometries;
</li>
<li>
<a href = "random_mpi/random_mpi.html">
random_mpi</a>,
a program which
demonstrates one way to generate the same sequence of random numbers
for both sequential execution and parallel execution under MPI.
</li>
<li>
<a href = "random_openmp/random_openmp.html">
random_openmp</a>,
a program which
illustrates how a parallel program using OpenMP can generate multiple
distinct streams of random numbers.
</li>
<li>
<a href = "rbf_interp_1d/rbf_interp_1d.html">
rbf_interp_1d</a>,
a library which
defines and evaluates radial basis function (RBF) interpolants to 1D data.
</li>
<li>
<a href = "rbf_interp_2d/rbf_interp_2d.html">
rbf_interp_2d</a>,
a library which
defines and evaluates radial basis function (RBF) interpolants to 2D data.
</li>
<li>
<a href = "rbf_interp_nd/rbf_interp_nd.html">
rbf_interp_nd</a>,
a library which
defines and evaluates radial basis function (RBF) interpolants to multidimensional data.
</li>
<li>
<a href = "rcm/rcm.html">
rcm</a>,
a library which
applies the Reverse Cuthill McKee (RCM) algorithm for
reordering the nodes of a graph, and reducing the bandwidth of a
corresponding sparse matrix;
</li>
<li>
<a href = "reactor_simulation/reactor_simulation.html">
reactor simulation</a>,
a program which
is a simple Monte Carlo simulation of the shielding effect of a slab
of a certain thickness in front of a neutron source. This program was
provided as an example with the book "Numerical Methods and Software."
</li>
<li>
<a href = "recomment/recomment.html">
recomment</a>,
a program which
converts C style comments to C++ style;
</li>
<li>
<a href = "reword/reword.html">
reword</a>,
a program which
makes a copy of a file in which
every line has the same number of words;
</li>
<li>
<a href = "ring_mpi/ring_mpi.html">
ring_mpi</a>,
a program which
uses the MPI parallel programming environment, and measures the time
necessary to copy a set of data around a ring of processes.
</li>
<li>
<a href = "rk4/rk4.html">
rk4</a>,
a library which
applies the fourth order Runge-Kutta (RK) algorithm to estimate the
solution of an ordinary differential equation (ODE) at the next time step.
</li>
<li>
<a href = "rkf45/rkf45.html">
rkf45</a>,
a library which
applies the Runge-Kutta-Fehlberg (RKF)
algorithm to solve a system of ordinary differential equations (ODEs);
</li>
<li>
<a href = "rot13/rot13.html">
rot13</a>,
a program which
makes a copy of a file which has
been encoded using the ROT13 coding (and a ROT5 coding for digits).
</li>
<li>
<a href = "rotating_cube_display_opengl/rotating_cube_display_opengl.html">
rotating_cube_display_opengl</a>,
a program which
displays a rotating color cube in 3D, using OpenGL;
</li>
<li>
<a href = "rsites/rsites.html">
rsites</a>,
a program which
generates random pointsets with
integer coordinates for testing computational geometry algorithms;
</li>
<li>
<a href = "sandia_cubature/sandia_cubature.html">
sandia_cubature</a>,
a library which
implements quadrature rules for certain M-dimensional regions and weight functions.
</li>
<li>
<a href = "sandia_rules/sandia_rules.html">
sandia_rules</a>,
a library which
can produce a standard 1D Gauss quadrature rule of
Chebyshev, Gegenbauer, generalized Hermite, generalized Laguerre, Hermite,
Jacobi, Laguerre, and Legendre types.
</li>
<li>
<a href = "sandia_rules2/sandia_rules2.html">
sandia_rules2</a>,
a library which
contains a very small selection of functions which serve as an interface
between sandia_sgmg or sandia_sgmga and sandia_rules.
</li>
<li>
<a href = "sandia_sgmg/sandia_sgmg.html">
sandia_sgmg</a>,
a library which
creates sparse grids based a mixture of 1D factor rules, and which
experiments with the idea of using linear growth rate for the 1D quadrature rules.
This is a version of sparse_grid_mixed_growth that uses a different procedure
for supplying the parameters needed to evaluate certain quadrature rules.
</li>
<li>
<a href = "sandia_sgmga/sandia_sgmga.html">
sandia_sgmga</a>,
a library which
creates sparse grids based on a mixture of 1D quadrature rules,
allowing anisotropic weights for each dimension.
This is a version of sgmga that uses a different procedure
for supplying the parameters needed to evaluate certain quadrature rules.
</li>
<li>
<a href = "sandia_sgmgg/sandia_sgmgg.html">
sandia_sgmgg</a>,
a library which
explores a generalized construction method for sparse grids.
</li>
<li>
<a href = "sandia_sparse/sandia_sparse.html">
sandia_sparse</a>,
a library which
can produce an M-dimensional sparse grid, based on a variety of 1D
quadrature rules; only isotropic grids are generated, that is, the same
rule is used in each dimension, and the same maximum order is used in
each dimension.
</li>
<li>
<a href = "satisfy/satisfy.html">
satisfy</a>,
a program which
demonstrates, for a particular circuit, an exhaustive search
for solutions of the circuit satisfy problem.
</li>
<li>
<a href = "satisfy_mpi/satisfy_mpi.html">
satisfy_mpi</a>,
a program which
demonstrates, for a particular circuit, an exhaustive search
for solutions of the circuit satisfy problem,
using MPI to perform the calculation in parallel.
</li>
<li>
<a href = "satisfy_openmp/satisfy_openmp.html">
satisfy_openmp</a>,
a program which
demonstrates, for a particular circuit, an exhaustive search
for solutions of the circuit satisfy problem,
using OpenMP for parallel execution.
</li>
<li>
<a href = "schedule_openmp/schedule_openmp.html">
schedule_openmp</a>,
a program which
demonstrates the default, static, and dynamic methods of scheduling
loop iterations in OpenMP to avoid work imbalance.
</li>
<li>
<a href = "sde/sde.html">
sde</a>,
a library which
illustrates the properties of stochastic differential equations (SDE's), and
common algorithms for their analysis,
by Desmond Higham;
</li>
<li>
<a href = "search_mpi/search_mpi.html">
search_mpi</a>,
a program which
searches integers between A and B for a solution J such that F(J)=C,
carried out in parallel using MPI.
</li>
<li>
<a href = "search_serial/search_serial.html">
search_serial</a>,
a program which
searches the integers from A to B for a value J such that F(J) = C.
this version of the program is intended as a starting point for
a parallel approach.
</li>
<li>
<a href = "set_theory/set_theory.html">
set_theory</a>,
a library which
demonstrates various set theoretic operations using several models of a set.
</li>
<li>
<a href = "sftpack/sftpack.html">
sftpack</a>,
a library which
implements the slow Fourier transform, intended as a teaching
tool and comparison with the Fast Fourier Transform (FFT).
</li>
<li>
<a href = "sgefa_openmp/sgefa_openmp.html">
sgefa_openmp</a>,
a program which
compares a standard linear algebra solver against a revised version
which can be run in parallel with OpenMP.
</li>
<li>
<a href = "sgmg/sgmg.html">
sgmg</a>,
a library which
creates sparse grids based a mixture of 1D factor rules, and which
experiments with the idea of using linear growth rate for the 1D quadrature rules.
</li>
<li>
<a href = "sgmga/sgmga.html">
sgmga</a>,
a library which
creates sparse grids based on a mixture of 1D quadrature rule families,
allowing user specified growth rates for each family,
allowing anisotropic weights for each dimension.
</li>
<li>
<a href = "shallow_water_1d/shallow_water_1d.html">
shallow_water_1d</a>,
a program which
simulates the evolution of a 1D fluid governed by the
time-dependent shallow water equations.
</li>
<li>
<a href = "shepard_interp_1d/shepard_interp_1d.html">
shepard_interp_1d</a>,
a library which
defines and evaluates Shepard interpolants to 1D data,
based on inverse distance weighting.
</li>
<li>
<a href = "shepard_interp_2d/shepard_interp_2d.html">
shepard_interp_2d</a>,
a library which
defines and evaluates Shepard interpolants to 2D data,
based on inverse distance weighting.
</li>
<li>
<a href = "shepard_interp_nd/shepard_interp_nd.html">
shepard_interp_nd</a>,
a library which
defines and evaluates Shepard interpolants to multidimensional data,
based on inverse distance weighting.
</li>
<li>
<a href = "simple_ga/simple_ga.html">
simple_ga</a>,
a program which
is a simple example of a genetic algorithm,
by Dennis Cormier and Sita Raghavan.
</li>
<li>
<a href = "simplex_coordinates/simplex_coordinates.html">
simplex_coordinates</a>,
a library which
computes the Cartesian coordinates of the vertices of a regular
simplex in M dimensions.
</li>
<li>
<a href = "sine_transform/sine_transform.html">
sine_transform</a>,
a library which
demonstrates some simple properties of the discrete sine transform.
</li>
<li>
<a href = "sobol/sobol.html">
sobol</a>,
a library which
computes elements of the Sobol
M-dimensional quasirandom sequence, extended to a maximal
spatial dimension of 1111,
by Bennett Fox.
</li>
<li>
<a href = "sobol_dataset/sobol_dataset.html">
sobol_dataset</a>,
a program which
creates a Sobol quasirandom dataset;
</li>
<li>
<a href = "sor/sor.html">
sor</a>,
a library which
implements a simple version of the Successive Over-Relaxation (SOR)
method for the iterative solution of a linear system of equations.
</li>
<li>
<a href = "sparse_grid_cc/sparse_grid_cc.html">
sparse_grid_cc</a>,
a library of routines which
creates sparse grids based on Clenshaw-Curtis rules.
</li>
<li>
<a href = "sparse_grid_cc_dataset/sparse_grid_cc_dataset.html">
sparse_grid_cc_dataset</a>,
a program which
creates a sparse grid dataset based on Clenshaw-Curtis rules.
</li>
<li>
<a href = "sparse_grid_gl/sparse_grid_gl.html">
sparse_grid_gl</a>,
a library which
creates sparse grids based on Gauss-Legendre rules.
</li>
<li>
<a href = "sparse_grid_gl_dataset/sparse_grid_gl_dataset.html">
sparse_grid_gl_dataset</a>,
a program which
creates a sparse grid dataset based on Gauss-Legendre rules.
</li>
<li>
<a href = "sparse_grid_hermite/sparse_grid_hermite.html">
sparse_grid_hermite</a>,
a library which
creates sparse grids based on Gauss-Hermite rules.
</li>
<li>
<a href = "sparse_grid_hermite_dataset/sparse_grid_hermite_dataset.html">
sparse_grid_hermite_dataset</a>,
a program which
creates a sparse grid dataset based on Gauss-Hermite rules.
</li>
<li>
<a href = "sparse_grid_laguerre/sparse_grid_laguerre.html">
sparse_grid_laguerre</a>,
a library which
creates sparse grids based on Gauss-Laguerre rules.
</li>
<li>
<a href = "sparse_grid_laguerre_dataset/sparse_grid_laguerre_dataset.html">
sparse_grid_laguerre_dataset</a>,
a program which
creates a sparse grid dataset based on Gauss-Laguerrre rules.
</li>
<li>
<a href = "sparse_grid_mixed/sparse_grid_mixed.html">
sparse_grid_mixed</a>,
a library which
creates sparse grids based on a mixture of 1D factor rules.
</li>
<li>
<a href = "sparse_grid_mixed_dataset/sparse_grid_mixed_dataset.html">
sparse_grid_mixed_dataset</a>,
a program which
creates a sparse grid dataset based on a mixture of 1D rules.
</li>
<li>
<a href = "sparse_grid_open/sparse_grid_open.html">
sparse_grid_open</a>,
a library which
creates sparse grids based on open rules (Fejer 2, Gauss-Patterson,
Newton-Cotes-Open).
</li>
<li>
<a href = "sparse_grid_open_dataset/sparse_grid_open_dataset.html">
sparse_grid_open_dataset</a>,
a program which
creates a sparse grid dataset based on
open rules (Fejer 2, Gauss-Patterson, Newton-Cotes-Open).
</li>
<li>
<a href = "sparse_grid_pure/sparse_grid_pure.html">
sparse_grid_pure</a>,
a library which
for the analysis and creation of sparse grids in which a single family
of 1D quadrature rules is used for all spatial dimensions.
</li>
<li>
<a href = "sparse_interp_nd/sparse_interp_nd.html">
sparse_interp_nd</a>,
a library which
can be used to define a sparse interpolant to a function f(x) of a
multidimensional argument.
</li>
<li>
<a href = "sphere_exactness/sphere_exactness.html">
sphere_exactness</a>,
a program which
tests the polynomial exactness of a quadrature rule for the unit sphere;
</li>
<li>
<a href = "sphere_grid/sphere_grid.html">
sphere_grid</a>,
a library which
provides a number of ways of generating grids of points, or of
points and lines, or of points and lines and faces, over the unit sphere.
</li>
<li>
<a href = "sphere_lebedev_rule/sphere_lebedev_rule.html">
sphere_lebedev_rule</a>,
a library which
computes Lebedev quadrature rules for the unit sphere;
</li>
<li>
<a href = "sphere_monte_carlo/sphere_monte_carlo.html">
sphere_monte_carlo</a>,
a library which
applies a Monte Carlo method to estimate the integral of a function
over the surface of the unit sphere in 3D;
</li>
<li>
<a href = "sphere_quad/sphere_quad.html">
sphere_quad</a>,
a library which
approximates an integral over the surface of the unit sphere
by applying a triangulation to the surface;
</li>
<li>
<a href = "sphere_stereograph/sphere_stereograph.html">
sphere_stereograph</a>,
a library which
computes the stereographic mapping between points on the unit sphere
and points on the plane Z = 1; a generalized mapping is also available.
</li>
<li>
<a href = "sphere_triangle_quad/sphere_triangle_quad.html">
sphere_triangle_quad</a>,
a library which
estimates the integral of a function over a spherical triangle.
</li>
<li>
<a href = "sphere_voronoi_display_opengl/sphere_voronoi_display_opengl.html">
sphere_voronoi_display_opengl</a>,
a program which
displays a sphere and randomly selected generator points, and then
gradually colors in points in the sphere that are closest to each generator.
</li>
<li>
<a href = "sphere_xyz_display_opengl/sphere_xyz_display_opengl.html">
sphere_xyz_display_opengl</a>,
a program which
reads XYZ information defining points in 3D that lie (presumably)
on the unit sphere, and displays an image of the unit sphere and
the points, using OpenGL;
</li>
<li>
<a href = "spline/spline.html">
spline</a>,
a library which
interpolates or approximates data by piecewise polynomial functions;
</li>
<li>
<a href = "spring_ode/spring_ode.html">
spring_ode</a>,
a program which
shows how line printer graphics can be used to make a crude illustration
of a solution of the ordinary differential equation (ODE) that describes
the motion of a weight attached to a spring.
</li>
<li>
<a href = "spring_ode2/spring_ode2.html">
spring_ode2</a>,
a program which
shows how gnuplot graphics can be used to illustrate
a solution of the ordinary differential equation (ODE) that describes
the motion of a weight attached to a spring.
</li>
<li>
<a href = "star_discrepancy/star_discrepancy.html">
star_discrepancy</a>,
a program which
computes bounds on the star discrepancy of a set of N points
in M dimensions, stored as a table file,
by Eric Thiemard.
</li>
<li>
<a href = "stla_io/stla_io.html">
stla_io</a>,
a library which
reads and writes ASCII stereolithography (STL)
3d graphics files;
</li>
<li>
<a href = "stochastic_rk/stochastic_rk.html">
stochastic_rk</a>,
a library which
applies a Runge-Kutta (RK) scheme to a stochastic differential equation.
</li>
<li>
<a href = "string_simulation/string_simulation.html">
string_simulation</a>,
a program which
simulates the behavior of a vibrating string.
</li>
<li>
<a href = "stroud/stroud.html">
stroud</a>,
a library which
defines rules for numerical integration (quadrature)
over M-dimensional regions, including spheres, toruses and
other shapes;
</li>
<li>
<a href = "subpak/subpak.html">
subpak</a>,
a library which
contains many utility routines;
</li>
<li>
<a href = "subset/subset.html">
subset</a>,
a library which
ranks, unranks and generates random subset,
combinations, permutations and other combinatorial objects;
</li>
<li>
<a href = "subset_sum/subset_sum.html">
subset_sum</a>,
a program which
seeks solutions of the subset sum problem.
</li>
<li>
<a href = "sum_million/sum_million.html">
sum_million</a>,
a program which
sums the integers from 1 to 1,000,000, as a demonstration of how
to rate a computer's speed;
</li>
<li>
<a href = "svd_basis/svd_basis.html">
svd_basis</a>,
a program which
applies the singular value decomposition (SVD) to a set of vectors,
to extract the dominant modes;
</li>
<li>
<a href = "svd_demo/svd_demo.html">
svd_demo</a>,
a program which
demonstrates the calculation of the
singular value decomposition (SVD) and some of its properties;
</li>
<li>
<a href = "svd_truncated/svd_truncated.html">
svd_truncated</a>,
a program which
demonstrates the computation of the reduced or truncated
Singular Value Decomposition (SVD) that is useful for cases when
one dimension of the matrix is much smaller than the other.
</li>
<li>
<a href = "table_border/table_border.html">
table_border</a>,
a program which
reads a table file of 2D data,
and adds data representing a boundary layer of zero values;
</li>
<li>
<a href = "table_delaunay/table_delaunay.html">
table_delaunay</a>,
a program which
computes the Delaunay triangulation
of a set of points stored as a table file;
</li>
<li>
<a href = "table_io/table_io.html">
table_io</a>,
a library which
reads and writes a simple dataset stored as a table file;
</li>
<li>
<a href = "table_latinize/table_latinize.html">
table_latinize</a>,
a program which
reads a dataset of N points in M dimensions
from a table file,
adjusts data to form a Latin Hypercube;
</li>
<li>
<a href = "table_quality/table_quality.html">
table_quality</a>,
a program which
reads a dataset of N points in the
M-dimensional unit hypercube from a table file,
and analyzes the quality of dispersion;
</li>
<li>
<a href = "table_unborder/table_unborder.html">
table_unborder</a>,
a program which
reads a table file
of 2D data and deletes the data representing the boundary layer;
</li>
<li>
<a href = "table_voronoi/table_voronoi.html">
table_voronoi</a>,
a program which
reads a set of 2D points from a table file, and
prints information about the Voronoi diagram;
</li>
<li>
<a href = "tanh_quad/tanh_quad.html">
tanh_quad</a>,
a library which
sets up the tanh quadrature rule;
</li>
<li>
<a href = "tanh_sinh_rule/tanh_sinh_rule.html">
tanh_sinh_rule</a>,
a program which
computes and writes out a tanh-sinh quadrature rule of given order.
</li>
<li>
<a href = "task_division/task_division.html">
task_division</a>,
a library which
implements a simple procedure for smoothly dividing T tasks among
P processors; such a method can be useful in MPI and other parallel
environments, particularly when T is not an exact multiple of P,
and when the processors can be indexed starting from 0 or from 1.
</li>
<li>
<a href = "test_approx/test_approx.html">
test_approx</a>,
a library which
implements test problems for approximation,
provided as a set of (x,y) data.
</li>
<li>
<a href = "test_eigen/test_eigen.html">
test_eigen</a>,
a library which
implements test matrices for eigenvalue analysis.
</li>
<li>
<a href = "test_int/test_int.html">
test_int</a>,
a library which
implements test problems for
approximate integration (quadrature) in one dimension.
</li>
<li>
<a href = "test_int_2d/test_int_2d.html">
test_int_2d</a>,
a library which
implements test problems for
approximate integration (quadrature) in two dimensions.
</li>
<li>
<a href = "test_int_hermite/test_int_hermite.html">
test_int_hermite</a>,
a library which
defines test integrands for Hermite integrals with
interval (-oo,+oo) and weight exp(-x^2).
</li>
<li>
<a href = "test_int_laguerre/test_int_laguerre.html">
test_int_laguerre</a>,
a library which
implements test problems for
approximate integration over a semi-infinite interval,
often carried out using Gauss-Laguerre quadrature.
</li>
<li>
<a href = "test_interp/test_interp.html">
test_interp</a>,
a library which
defines test problems for interpolation,
provided as a set of (x,y) data.
</li>
<li>
<a href = "test_interp_1d/test_interp_1d.html">
test_interp_1d</a>,
a library which
defines test problems for interpolation of data y(x),
which depends on a 1D argument.
</li>
<li>
<a href = "test_interp_2d/test_interp_2d.html">
test_interp_2d</a>,
a library which
defines test problems for interpolation of data z(x,y),
depending on a 2D argument.
</li>
<li>
<a href = "test_interp_nd/test_interp_nd.html">
test_interp_nd</a>,
a library which
defines test problems for interpolation of data z(x),
depending on an M-dimensional argument.
</li>
<li>
<a href = "test_ls/test_ls.html">
test_ls</a>,
a library which
implements linear least squares test problems of the form A*x=b.
</li>
<li>
<a href = "test_mat/test_mat.html">
test_mat</a>,
a library which
implements test matrices.
</li>
<li>
<a href = "test_matrix_exponential/test_matrix_exponential.html">
test_matrix_exponential</a>,
a library which
defines a set of test cases for computing the matrix exponential.
</li>
<li>
<a href = "test_min/test_min.html">
test_min</a>,
a library which
implements test problems for
minimization of a scalar function of a scalar variable.
</li>
<li>
<a href = "test_nint/test_nint.html">
test_nint</a>,
a library which
implements test problems for
approximate integration (quadrature) in M dimensions.
</li>
<li>
<a href = "test_opt_con/test_opt_con.html">
test_opt_con</a>,
a library which
defines test problems for the minimization of a scalar function of several variables,
with the search constrained to lie within a specified hyper-rectangle.
</li>
<li>
<a href = "test_optimization/test_optimization.html">
test_optimization</a>,
a library which
implements test problems for optimization
of a scalar function of several variables,
as described by Molga and Smutnicki.
</li>
<li>
<a href = "test_tri_int/test_tri_int.html">
test_tri_int</a>,
a library which
implements test functions for
integration over a triangle in 2 dimensions.
</li>
<li>
<a href = "test_values/test_values.html">
test_values</a>,
a library which
returns a small set of values for a variety of mathematical functions,
suitable for a rough test of accuracy for algorithms;
</li>
<li>
<a href = "test_zero/test_zero.html">
test_zero</a>,
a library which
implements test problems for the solution
of a single nonlinear equation in one variable.
</li>
<li>
<a href = "testpack/testpack.html">
testpack</a>,
a program which
demonstrates the use of
a set of test integrand functions chosen by Alan Genz.
</li>
<li>
<a href = "tet_mesh/tet_mesh.html">
tet_mesh</a>,
a library which
works with tetrahedral meshes in 3D;
</li>
<li>
<a href = "tet_mesh_boundary/tet_mesh_boundary.html">
tet_mesh_boundary</a>,
a program which
reads information defining
a tetrahedral mesh of points in 3D, and determines the triangular
faces that form the boundary of the mesh; it writes out files containing
the nodes and elements defining this tri_surface data.
</li>
<li>
<a href = "tet_mesh_display_opengl/tet_mesh_display_opengl.html">
tet_mesh_display_opengl</a>,
a program which
reads two files describing
a tetrahedral mesh in 3D and displays it using OpenGL.
</li>
<li>
<a href = "tet_mesh_l2q/tet_mesh_l2q.html">
tet_mesh_l2q</a>,
a program which
reads information about a 4-node (linear) tet mesh and
creates data defining a corresponding 10-node (quadratic)
tet mesh;
</li>
<li>
<a href = "tet_mesh_q2l/tet_mesh_q2l.html">
tet_mesh_q2l</a>,
a program which
reads information about a 10-node (quadratic) tet mesh and
creates data defining a corresponding 4-node (linear)
tet mesh;
</li>
<li>
<a href = "tet_mesh_quality/tet_mesh_quality.html">
tet_mesh_quality</a>,
a program which
reads a node coordinate file
and a tetrahedron file and returns quality measures for
the tetrahedronal mesh;
</li>
<li>
<a href = "tet_mesh_rcm/tet_mesh_rcm.html">
tet_mesh_rcm</a>,
a program which
computes the Reverse Cuthill McKee (RCM) reordering for the nodes
of a tet_mesh that uses 4-node or 10-node tetrahedrons;
</li>
<li>
<a href = "tet_mesh_refine/tet_mesh_refine.html">
tet_mesh_refine</a>,
a program which
refines a tet mesh;
</li>
<li>
<a href = "tet_mesh_tet_neighbors/tet_mesh_tet_neighbors.html">
tet_mesh_tet_neighbors</a>,
a program which
reads information about a tet mesh and writes out a list of the
tetrahedrons that are adjacent to a given tetrahedron;
</li>
<li>
<a href = "tet_mesh_volumes/tet_mesh_volumes.html">
tet_mesh_volumes</a>,
a program which
computes the volume of each tetrahedron in a tet mesh;
</li>
<li>
<a href = "tetrahedron_exactness/tetrahedron_exactness.html">
tetrahedron_exactness</a>,
a program which
tests the polynomial
exactness of a quadrature rule for the tetrahedron;
</li>
<li>
<a href = "tetrahedron_grid/tetrahedron_grid.html">
tetrahedron_grid</a>,
a library which
computes a grid of points inside a 3D tetrahedron.
</li>
<li>
<a href = "tetrahedron_monte_carlo/tetrahedron_monte_carlo.html">
tetrahedron_monte_carlo</a>,
a program which
uses the Monte Carlo method to estimate an integral over a tetrahedron.
</li>
<li>
<a href = "tetrahedron_properties/tetrahedron_properties.html">
tetrahedron_properties</a>,
a program which
prints out the properties of a tetrahedron
whose vertex coordinates are read from a file;
</li>
<li>
<a href = "tga_io/tga_io.html">
tga_io</a>,
a library which
reads a TARGA (TGA) graphics file;
</li>
<li>
<a href = "three_body_simulation/three_body_simulation.html">
three_body_simulation</a>,
a program which
simulates the behavior of three planets, constrained to lie in a plane,
and moving under the influence of gravity,
by Walter Gander and Jiri Hrebicek.
</li>
<li>
<a href = "tiler_3d/tiler_3d.html">
tiler_3d</a>,
a library which
blends a pattern repeatedly into a region in 3D;
</li>
<li>
<a href = "timer/timer.html">
timer</a>,
programs which
measure the CPU time used by a portion of a user's program;
</li>
<li>
<a href = "timestamp/timestamp.html">
timestamp</a>,
a library which
prints the current YMDHMS date as a timestamp, and other timekeeping operations;
</li>
<li>
<a href = "toeplitz_cholesky/toeplitz_cholesky.html">
toeplitz_cholesky</a>,
a library which
computes the Cholesky factorization of a nonnegative definite symmetric
Toeplitz matrix.
</li>
<li>
<a href = "toms178/toms178.html">
toms178</a>,
a library which
seeks the minimizer of a scalar function of several variables
using the Hooke-Jeeves method, by Arthur Kaupe;
this is a C++ version of ACM TOMS algorithm 178.
</li>
<li>
<a href = "toms179/toms179.html">
toms179</a>,
a library which
calculates the incomplete Beta ratio,
by Oliver Ludwig;
this is a C++ version of ACM TOMS algorithm 179.
</li>
<li>
<a href = "toms291/toms291.html">
toms291</a>,
a library which
approximates the logarithm of the Gamma function;
this is a C++ version of ACM TOMS algorithm 291.
</li>
<li>
<a href = "toms446/toms446.html">
toms446</a>,
a library which
manipulates Chebyshev series for interpolation and approximation;
this is a C++ version of ACM TOMS algorithm 446,
by Roger Broucke.
</li>
<li>
<a href = "toms462/toms462.html">
toms462</a>,
a library which
evaluates the upper right tail of the bivariate normal distribution; that is,
the probability that normal variables X and Y with correlation R will
satisfy H <= X and K <= Y;
this is a C++ version of ACM TOMS algorithm 462.
</li>
<li>
<a href = "toms655/toms655.html">
toms655</a>,
a library which
computes the weights for interpolatory quadrature rule;
this library is commonly called IQPACK;
this is a C++ version of ACM TOMS algorithm 655.
</li>
<li>
<a href = "tri_surface_display_opengl/tri_surface_display_opengl.html">
tri_surface_display_opengl</a>,
a program which
displays a 3D triangulated surface or TRI_SURFACE using OpenGL;
</li>
<li>
<a href = "tri_surface_io/tri_surface_io.html">
tri_surface_io</a>,
a library which
reads and writes the 3D graphics information
in a tri_surface file;
</li>
<li>
<a href = "triangle_exactness/triangle_exactness.html">
triangle_exactness</a>,
a program which
tests the polynomial exactness of a quadrature rule for triangles;
</li>
<li>
<a href = "triangle_grid/triangle_grid.html">
triangle_grid</a>,
a library which
computes a triangular grid of points.
</li>
<li>
<a href = "triangle_histogram/triangle_histogram.html">
triangle_histogram</a>,
a program which
computes histograms of data on the unit triangle.
</li>
<li>
<a href = "triangle_io/triangle_io.html">
triangle_io</a>,
a library which
can read or write some of the files created by Jonathan Shewchuk's
triangle program.
</li>
<li>
<a href = "triangle_monte_carlo/triangle_monte_carlo.html">
triangle_monte_carlo</a>,
a program which
uses the Monte Carlo method to estimate an integral over a triangle.
</li>
<li>
<a href = "triangle_properties/triangle_properties.html">
triangle_properties</a>,
a program which
computes properties of a triangle
whose vertex coordinates are read from a file.
</li>
<li>
<a href = "triangle_to_fem/triangle_to_fem.html">
triangle_to_fem</a>,
a program which reads the NODE and ELE files created by the triangle program to
describe a triangular mesh, and writes a corresponding pair of
node and element files in the 2D FEM format.
</li>
<li>
<a href = "triangle_to_mesh/triangle_to_mesh.html">
triangle_to_mesh</a>,
a program which reads the NODE and ELE files created by the triangle program to
describe a triangular mesh, and writes a corresponding MESH file
for input to medit.
</li>
<li>
<a href = "triangulation/triangulation.html">
triangulation</a>,
a library which
computes the triangulation of a set of
points in the plane, to search it, plot it, and manipulate it
in other ways;
</li>
<li>
<a href =
"triangulation_boundary_nodes/triangulation_boundary_nodes.html">
triangulation_boundary_nodes</a>,
a program which
reads data defining a triangulation, determines which nodes
lie on the boundary, and writes their coordinates to a file;
</li>
<li>
<a href = "triangulation_corner/triangulation_corner.html">
triangulation_corner</a>,
a program which
modifies triangulations in which one or more triangles have more
than one boundary edge.
</li>
<li>
<a href = "triangulation_delaunay_discrepancy/triangulation_delaunay_discrepancy.html">
triangulation_delaunay_discrepancy</a>,
a program which
measures the amount by which a triangulation fails the local
Delaunay test;
</li>
<li>
<a href = "triangulation_display_opengl/triangulation_display_opengl.html">
triangulation_display_opengl</a>,
a program which
reads two files describing
a triangulation and displays it using OpenGL.
</li>
<li>
<a href = "triangulation_histogram/triangulation_histogram.html">
triangulation_histogram</a>,
a program which
computes histograms of data over a triangulation.
</li>
<li>
<a href = "triangulation_l2q/triangulation_l2q.html">
triangulation_l2q</a>,
a program which
reads information about a 3-node (linear) triangulation and creates data
defining a corresponding 6-node (quadratic) triangulation;
</li>
<li>
<a href = "triangulation_mask/triangulation_mask.html">
triangulation_mask</a>,
a program which
reads a triangulation and calls
a user-supplied routine to consider each triangle for deletion;
</li>
<li>
<a href = "triangulation_orient/triangulation_orient.html">
triangulation_orient</a>,
a program which
ensures that the triangles in
an order 3 or order 6 triangulation have positive orientation;
</li>
<li>
<a href = "triangulation_plot/triangulation_plot.html">
triangulation_plot</a>,
a program which
plots the nodes and elements of a triangulation as a PostScript (PS) file;
</li>
<li>
<a href = "triangulation_q2l/triangulation_q2l.html">
triangulation_q2l</a>,
a program which
reads information about a 6-node triangulation and creates data
defining a corresponding 3-node triangulation;
</li>
<li>
<a href = "triangulation_quad/triangulation_quad.html">
triangulation_quad</a>,
a program which
reads information about a triangulation and the value of a function at
the nodes and estimates the integral of the function
over the triangulated region.
</li>
<li>
<a href = "triangulation_quality/triangulation_quality.html">
triangulation_quality</a>,
a program which
reads information about a triangulation and computes various
quality measures;
</li>
<li>
<a href = "triangulation_rcm/triangulation_rcm.html">
triangulation_rcm</a>,
a program which
computes the Reverse Cuthill McKee (RCM) reordering for the nodes
of a triangulation that uses 3-node or 6-node triangles;
</li>
<li>
<a href = "triangulation_refine/triangulation_refine.html">
triangulation_refine</a>,
a program which
refines a triangulation;
</li>
<li>
<a href = "triangulation_t3_to_t4/triangulation_t3_to_t4.html">
triangulation_t3_to_t4</a>,
a program which
reads information about a 3-node triangulation and creates data
defining a corresponding 4-node triangulation (vertices + centroid);
</li>
<li>
<a href =
"triangulation_triangle_neighbors/triangulation_triangle_neighbors.html">
triangulation_triangle_neighbors</a>,
a program which
reads data defining a triangulation, finds the three neighbor
triangles for each triangle, and writes them to a file;
</li>
<li>
<a href = "uncontrol/uncontrol.html">
uncontrol</a>,
a program which
removes control characters from a file;
</li>
<li>
<a href = "unicycle/unicycle.html">
unicycle</a>,
a library which
considers permutations containing a single cycle, sometimes called cyclic permutations.
</li>
<li>
<a href = "uniform/uniform.html">
uniform</a>,
a library which
generates uniform pseudorandom numbers;
</li>
<li>
<a href = "uniform_dataset/uniform_dataset.html">
uniform_dataset</a>,
a program which
creates a file of uniform pseudorandom values;
</li>
<li>
<a href = "valgrind/valgrind.html">
valgrind</a>,
programs which
illustrate the use of the VALGRIND suite of programs which includes
a memory leak detector.
</li>
<li>
<a href = "van_der_corput/van_der_corput.html">
van_der_corput</a>,
a library which
evaluates the van der Corput 1-dimensional quasirandom sequence;
</li>
<li>
<a href = "van_der_corput_dataset/van_der_corput_dataset.html">
van_der_corput_dataset</a>,
a program which
creates a file of quasirandom van der Corput values;
</li>
<li>
<a href = "vandermonde_approx_1d/vandermonde_approx_1d.html">
vandermonde_approx_1d</a>,
a library which
finds a polynomial approximant to data y(x) of a 1D argument by setting up and
solving an overdetermined linear system for the polynomial coefficients
involving the Vandermonde matrix.
</li>
<li>
<a href = "vandermonde_approx_2d/vandermonde_approx_2d.html">
vandermonde_approx_2d</a>,
a library which
finds a polynomial approximant p(x,y) to data z(x,y) of a 2D argument by setting up and
solving an overdetermined linear system for the polynomial coefficients
involving the Vandermonde matrix.
</li>
<li>
<a href = "vandermonde_interp_1d/vandermonde_interp_1d.html">
vandermonde_interp_1d</a>,
a library which
finds a polynomial interpolant to data y(x) of a 1D argument by setting up and
solving a linear system for the polynomial coefficients
involving the Vandermonde matrix.
</li>
<li>
<a href = "vandermonde_interp_2d/vandermonde_interp_2d.html">
vandermonde_interp_2d</a>,
a library which
finds a polynomial interpolant to data z(x,y) of a 2D argument by setting up and
solving a linear system for the polynomial coefficients
involving the Vandermonde matrix.
</li>
<li>
<a href = "vector_read/vector_read.html">
vector_read</a>,
a library which
reads, one line at a time, numeric data, storing it in a
vector returned to the user;
</li>
<li>
<a href = "walsh/walsh.html">
walsh</a>,
a library which
implements versions of the Walsh and Haar transforms.
</li>
<li>
<a href = "wandzura/wandzura.html">
wandzura</a>,
a library which
returns a Wandzura rule for quadrature in a triangle;
</li>
<li>
<a href = "wavelet/wavelet.html">
wavelet</a>,
a library which
does some simple wavelet calculations;
</li>
<li>
<a href = "weekday/weekday.html">
weekday</a>,
a library which
determines the day of the week corresponding to a given date,
such as 14 October 1066, Julian calendar, ...which was a Saturday.
</li>
<li>
<a href = "width/width.html">
width</a>,
a program which
returns the length and location of the longest line in a text file;
</li>
<li>
<a href = "wrap/wrap.html">
wrap</a>,
a program which
wraps a file so that no line is longer than 80 characters;
</li>
<li>
<a href = "wrap2/wrap2.html">
wrap2</a>,
a program which
wraps a text file so that no line is
longer than a given maximum; the wrapping may be done slightly
earlier than at the maximum, in order to avoid breaking words;
</li>
<li>
<a href = "wtime/wtime.html">
wtime</a>,
a library which
returns a reading of the wall clock time in seconds.
</li>
<li>
<a href = "x_window/x_window.html">
x_window</a>,
programs which
illustrate the use of the X Window graphical terminal system;
</li>
<li>
<a href = "xy_display_opengl/xy_display_opengl.html">
xy_display_opengl</a>,
a program which
reads XY information defining points in 2D
and displays an image using OpenGL;
</li>
<li>
<a href = "xy_io/xy_io.html">
xy_io</a>,
a library which
reads and writes XY, XYL and XYF files defining points,
lines, and faces in 2D.
</li>
<li>
<a href = "xyf_display_opengl/xyf_display_opengl.html">
xyf_display_opengl</a>,
a program which
reads XYF information defining points and faces in 2D
and displays an image using OpenGL;
</li>
<li>
<a href = "xyl_display_opengl/xyl_display_opengl.html">
xyl_display_opengl</a>,
a program which
reads XYL information defining points and lines in 2D
and displays an image using OpenGL;
</li>
<li>
<a href = "xyz_display_opengl/xyz_display_opengl.html">
xyz_display_opengl</a>,
a program which
reads XYZ information defining points in 3D
and displays an image using OpenGL;
</li>
<li>
<a href = "xyz_io/xyz_io.html">
xyz_io</a>,
a library which
reads and writes XYZ, XYZL and XYZF files defining points, lines and
faces in 3D.
</li>
<li>
<a href = "xyzf_display_opengl/xyzf_display_opengl.html">
xyzf_display_opengl</a>,
a program which
reads XYZF information defining points and faces in 3D
and displays an image using OpenGL;
</li>
<li>
<a href = "xyzl_display_opengl/xyzl_display_opengl.html">
xyzl_display_opengl</a>,
a program which
reads XYZL information defining points and lines in 3D
and displays an image using OpenGL;
</li>
<li>
<a href = "ziggurat/ziggurat.html">
ziggurat</a>,
a library which
samples the uniform, normal or exponential distributions,
using the ziggurat method,
by Marsaglia and Tsang.
</li>
<li>
<a href = "ziggurat_openmp/ziggurat_openmp.html">
ziggurat_openmp</a>,
a program which
demonstrates how the ziggurat library can be used to generate
random numbers in an OpenMP parallel program.
</li>
</ol>
</p>
<p>
You can go up one level to
<a href = "../index.html">the main web page.</a>
</p>
<hr>
<i>
Last revised on 28 November 2012.
</i>
<!-- John Burkardt -->
forked from johannesgerer/jburkardt-cpp
An official Git Mirror of John Burkardt's great collection of C++ Software
denysfarias/jburkardt-cpp
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Â
Â
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
 |  | |||
Repository files navigation
About
An official Git Mirror of John Burkardt's great collection of C++ Software
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published