An official Git Mirror of John Burkardt's great collection of FORTRAN 90 Software
Switch branches/tags
Nothing to show
Pull request Compare This branch is 2 commits behind johannesgerer:master.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
alscal
alscal_data_convert
anyplt
apportionment
arby4
args
arpack
asa005
asa006
asa007
asa032
asa047
asa058
asa063
asa066
asa076
asa091
asa103
asa109
asa111
asa113
asa121
asa136
asa144
asa147
asa152
asa159
asa172
asa183
asa189
asa205
asa226
asa239
asa241
asa243
asa245
asa266
asa299
asa310
ball_grid
ball_volume_monte_carlo
ball_volume_quad
band_qr
bar_plot
barycentric_interp_1d
basis_compare
bayes_beta
bayes_dice
bayes_weight
bdmlib
bernstein
beta_nc
bezier_surface
bins
bisection_integer
black_scholes
blacs
blas
blas1
blas1_c
blas1_d
blas1_s
blas1_z
blas2
blas3
blend
box_behnken
brent
brownian_motion_simulation
bt_serial
bump
burgers_solution
bvls
c4lib
c8lib
calendar_nyt
calpak
ccn_rule
ccvt_box
ccvt_reflect
cell
cg_serial
channel
chebyshev
chebyshev1_rule
chebyshev2_rule
chebyshev_interp_1d
chebyshev_polynomial
chrpak
circle_arc_grid
circle_grid
circle_test
cities
clenshaw_curtis_rule
cluster_energy
cnf_io
codepack
collatz_recursive
colored_noise
colors
combination_lock
combo
communicator_mpi
compass_search
complex_numbers
condition
cordic
correlation
crystal
crystal_coordinates
crystal_plot
crystal_qed
csv_io
cubpack
cvt
cvt_basis
cvt_basis_flow
cvt_dataset
cvt_fixed
cvt_fixed2
cvt_mod
cvt_mod_dataset
cvt_movie5_data
cvt_refine
cvt_size
cvt_tet_mesh
cvt_triangulation
cvt_weight
cycle_brent
cycle_floyd
cyclic_reduction
dcdflib
delaunay_lmap_2d
diaphony
dijkstra
dijkstra_openmp
discrete_pdf_sample
dislin
distance_to_position
distances
divdif
dlap
dlap_io
doomsday
dqed
dsp_to_st
duel_simulation
dunavant
dutch
eispack
ellipse_grid
ellipsoid_grid
ep_serial
errors
extract
f77_cleanup
f77_to_f90
f90
f90_calls_c++
f90_calls_c++_and_mpi
f90_calls_c
f90_calls_c_and_mpi
f90_calls_matlab
f90_intrinsics
f90_random
f90split
fair_dice_simulation
faure
faure_dataset
fd1d_burgers_lax
fd1d_burgers_leap
fd1d_bvp
fd1d_heat_explicit
fd1d_heat_implicit
fd1d_heat_steady
fd1d_predator_prey
fd1d_wave
fd2d_predator_prey
fd_predator_prey
fekete
felippa
fem1d
fem1d_adaptive
fem1d_bvp_linear
fem1d_heat_steady
fem1d_nonlinear
fem1d_pack
fem1d_pmethod
fem1d_project
fem1d_sample
fem2d_heat
fem2d_heat_rectangle
fem2d_heat_square
fem2d_navier_stokes
fem2d_navier_stokes_cavity
fem2d_navier_stokes_channel
fem2d_navier_stokes_inout
fem2d_pack
fem2d_poisson
fem2d_poisson_ell
fem2d_poisson_lake
fem2d_poisson_rectangle
fem2d_poisson_rectangle_linear
fem2d_poisson_sparse
fem2d_poisson_sparse_ell
fem2d_poisson_sparse_lake
fem2d_project
fem2d_project_function
fem2d_sample
fem2d_stokes
fem2d_stokes_cavity
fem2d_stokes_channel
fem2d_stokes_inout
fem3d_pack
fem3d_project
fem3d_sample
fem_basis
fem_io
fem_to_mesh
fem_to_tec
feynman_kac_1d
feynman_kac_2d
feynman_kac_3d
fft_openmp
fft_serial
fftpack5.1
fftpack5.1d
fftpack5
fftw3
file_merge
file_name_sequence
file_row_reverse
file_transpose
files_multiple
filum
fixcon
flow3
flow5
floyd
fn
football
frieze
g95_intrinsics
g95_quadmath
gdb
gegenbauer_rule
gen_hermite_rule
gen_laguerre_rule
gene_cluster
geometry
geompack
geompack2
geompack3
getwgt
gfortran
gfortran_intrinsics
gfortran_quadmath
gm_rule
gnufor
gprof
grafpack
graph_paper
graphics_examples
grf_io
grf_to_eps
grf_to_xyl
grid
grid_dataset
haar
halton
halton_dataset
hammersley
hammersley_dataset
hb_io
hb_to_st
heat_mpi
heated_plate
heated_plate_openmp
heated_plate_workshare
hello
hello_mpi
hello_openmp
hermite
hermite_cubic
hermite_polynomial
hermite_rule
hex_grid
hex_grid_angle
hex_grid_dataset
hex_grid_triangulate
i4lib
i8lib
ice_io
ice_to_mesh
ieee_uniform
ihs
ihs_dataset
image_components
image_denoise
image_edge
include_files
index
int_exactness
int_exactness_chebyshev1
int_exactness_chebyshev2
int_exactness_gegenbauer
int_exactness_gen_hermite
int_exactness_gen_laguerre
int_exactness_hermite
int_exactness_jacobi
int_exactness_laguerre
int_exactness_legendre
integral_test
interp
intlib
ising_2d_simulation
ising_3d_simulation
ivread
jacobi_polynomial
jacobi_rule
jbar
keast
kmeans
kmedian
kronrod
lagrange_approx_1d
lagrange_interp_1d
lagrange_interp_2d
lagrange_interp_nd
laguerre_polynomial
laguerre_rule
lambert
lapack_examples
lapack_examples_osx
latin_center
latin_center_dataset
latin_cover
latin_edge
latin_edge_dataset
latin_random
latin_random_dataset
latinize
lattice_rule
lau_np
laupack
lawson
lcvt
lcvt_dataset
legendre_polynomial
legendre_rule
legendre_rule_fast
linpack
linpack_bench
linpack_c
linpack_d
linpack_s
linpack_z
linplus
llsq
lyness_rule
machar
machine
makefiles
mandelbrot
mandelbrot_openmp
mass
matman
matmul
matrix_exponential
md
md1
md2
md3
md3glue
md_openmp
memory_test
mesh_bandwidth
mesh_io
mesh_to_ice
meshless
mgmres
mgs
mhd_control
mhd_flow
minpack
mixed
mixture
mm_io
module_mark
monte_carlo_rule
movie_data_reformat
mpi
mpi_stubs
multigrid_poisson_1d
multitask_mpi
multitask_openmp
mxm
mxm_openmp
mxm_serial
mxv
mxv_openmp
nas
nast2d_f90
ncc_tetrahedron
ncc_triangle
nco_tetrahedron
nco_triangle
nearest_interp_1d
neighbors_to_metis_graph
netcdf
niederreiter
niederreiter2
niederreiter2_dataset
nint_exactness
nint_exactness_mixed
nintlib
nl2sol
nms
normal
normal_dataset
nsasm
nswc
obj_io
ode
openmp
openmp_stubs
optimize
owens
paranoia
partial_digest
partition_problem
patterson_rule
pblas
pbma_io
pbmlib
pce_burgers
pce_ode_hermite
pdb_extract
pdb_read
pdb_to_xyz
pgma_io
piecewise_linear_product_integral
pink_noise
pitcon7
plot3d_io
plot3d_to_avs
plot_points
plot_to_ps
pod_basis_flow
point_merge
poisson_openmp
poisson_serial
poisson_simulation
polpak
poly_io
polygon_moments
power_method
power_rule
ppma_io
ppma_to_ppmb
pppack
praxis
prime_mpi
prime_openmp
prime_serial
prob
product_rule
ps_gg_align
ps_lg_align
ps_qg_align
ps_write
puzzles
pwl_approx_1d
pwl_interp_1d
pwl_interp_2d
pwl_interp_2d_scattered
pyramid_exactness
pyramid_rule
qr_solve
quad2d_openmp
quad2d_serial
quad_mesh
quad_mesh_rcm
quad_mpi
quad_openmp
quad_serial
quadpack
quadrature_test
quadrature_test_2d
quadrature_test_genz
quadrature_weights
quadrule
quality
quote
r16_hermite_rule
r16_int_exactness_gen_hermite
r16lib
r4lib
r8lib
randlc
random_data
random_mpi
random_openmp
random_write
ranmap
rbf_interp_1d
rbf_interp_2d
rbf_interp_nd
rcm
reactor_simulation
read_align
real_precision
reformat
region
regression
rejoin
ring_mpi
rk4
rkf45
roc
sandia_cubature
sandia_cvt
sandia_rules
sandia_sgmgg
sandia_sparse
satisfy
satisfy_mpi
satisfy_openmp
scalapack
schedule_openmp
sde
search_mpi
search_serial
select
sequence
set_theory
sftpack
sgefa_openmp
sgmga
shallow_water_1d
shepard_interp_1d
shepard_interp_2d
shepard_interp_nd
simplex_coordinates
sine_transform
slatec
sobol
sobol_dataset
spacer
spacer_data_convert
spaeth
spaeth2
sparse_grid_cc
sparse_grid_cc_dataset
sparse_grid_gl
sparse_grid_gl_dataset
sparse_grid_hermite
sparse_grid_hermite_dataset
sparse_grid_hw
sparse_grid_laguerre
sparse_grid_laguerre_dataset
sparse_grid_mixed
sparse_grid_mixed_dataset
sparse_grid_open
sparse_grid_open_dataset
sparse_grid_pure
sparse_interp_nd
sparsekit
sparsepak
specfun
special_functions
sphere_cvt
sphere_delaunay
sphere_design_rule
sphere_exactness
sphere_grid
sphere_lebedev_rule
sphere_monte_carlo
sphere_quad
sphere_stereograph
sphere_triangle_monte_carlo
sphere_triangle_quad
sphere_voronoi
spiral_data
spline
spring_ode
spring_ode2
ss_gd_align
ss_gg_align
ss_lg_align
ss_qg_align
st_io
st_to_dsp
st_to_hb
starpac
steam
steam_interact
stla_io
stochastic_rk
string_simulation
stripack
stripack_interactive
stripper
stroud
subanagram
subpak
subset
subset_sum
sum_million
svd_basis
svd_basis_weight
svd_demo
svd_truncated
sweep2_delaunay_eps
sweep2_voronoi_eps
table_barplot_ppma
table_border
table_columns
table_columns_permute
table_delaunay
table_graph_code
table_histogram
table_io
table_latinize
table_merge
table_orthonormalize
table_quality
table_record_match
table_scale
table_shift
table_stats
table_tet_mesh
table_top
table_unborder
table_uniform_noise
table_voronoi
tanh_quad
tanh_sinh_rule
task_division
tec_io
tec_to_fem
tec_to_obj
tec_to_obj2
tec_write
templates
test_approx
test_con
test_eigen
test_int
test_int_2d
test_int_hermite
test_int_laguerre
test_interp
test_interp_1d
test_interp_2d
test_interp_nd
test_ls
test_mat
test_matrix_exponential
test_mesh
test_min
test_nint
test_nls
test_nonlin
test_ode
test_opt
test_opt_con
test_optimization
test_tet_mesh
test_tri_int
test_triangulation
test_values
test_zero
testpack
tet_mesh
tet_mesh_boundary
tet_mesh_l2q
tet_mesh_q2l
tet_mesh_quality
tet_mesh_rcm
tet_mesh_refine
tet_mesh_tet_neighbors
tet_mesh_volumes
tetrahedron_exactness
tetrahedron_grid
tetrahedron_monte_carlo
tetrahedron_properties
three_body_simulation
tiler_2d
tiler_3d
timer
timestamp
toeplitz
toeplitz_cholesky
toms178
toms179
toms291
toms446
toms453
toms462
toms526
toms552
toms611
toms647
toms655
toms659
toms660
toms661
toms672
toms708
toms726
toms738
toms757
toms790
toms792
tri_surface_io
triangle_exactness
triangle_grid
triangle_histogram
triangle_monte_carlo
triangle_properties
triangulation
triangulation_boundary_nodes
triangulation_corner
triangulation_delaunay_discrepancy
triangulation_histogram
triangulation_l2q
triangulation_mask
triangulation_orient
triangulation_plot
triangulation_q2l
triangulation_quad
triangulation_quality
triangulation_rcm
triangulation_refine
triangulation_t3_to_t4
triangulation_triangle_neighbors
tripack
tsp_io
unicycle
uniform
uniform_dataset
valgrind
van_der_corput
van_der_corput_dataset
vandermonde_approx_1d
vandermonde_approx_2d
vandermonde_interp_1d
vandermonde_interp_2d
vec_io
vector_plot
voronoi_plot
voronoi_weight
vtk_io
walsh
wandzura
wavelet
weekday
wordsnake
wtime
xerror
xlf_intrinsics
xy_io
xyz_io
xyz_plot
xyz_to_pdb
ziggurat
ziggurat_openmp
zoomin
README.md
f_src.html
robots.txt

README.md

<title> FORTRAN90 Source Codes </title>
<h1 align = "center">
  Source Codes in<br>
  Fortran90
</h1>

<hr>

<p>
  <ol>
    <li>
      <a href = "alscal/alscal.html">
      alscal</a>,
      a program which
      performs M-dimensional scaling of data given interdata distances,
      by Forrest Young and Rostyslaw Lewyckyj.
    </li>
    <li>
      <a href = "alscal_data_convert/alscal_data_convert.html">
      alscal_data_convert</a>,
      a program which
      reads a data file containing object names and distances between objects,
      and reformats the data for input to ALSCAL.
    </li>
    <li>
      <a href = "anyplt/anyplt.html">
      anyplt</a>,
      a library which
      was intended as a simple interface to a variety of graphics packages.
    </li>
    <li>
      <a href = "apportionment/apportionment.html">
      apportionment</a>,
      a library which
      demonstrates some of the methods
      used or proposed for fairly assigning a number of
      seats in the House of Representatives to each state;
    </li>
    <li>
      <a href = "arby4/arby4.html">
      arby4</a>,
      a program which
      analyzes a 2D fluid flow using the reduced basis method.
    </li>
    <li>
      <a href = "args/args.html">
      args</a>,
      a program which
      reports the command line arguments of a FORTRAN90 program;
    </li>
    <li>
      <a href = "arpack/arpack.html">
      arpack</a>,
      a library which
      computes eigenvalues for large matrices,
      by Richard Lehoucq, Danny Sorensen, Chao Yang;
    </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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 version of Applied Statistics Algorithm 47;
    </li>
    <li>
      <a href = "asa058/asa058.html">
      asa058</a>,
      a library which
      carries out clustering of data,
      by David Sparks;
      this is a FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 version of Applied Statistics Algorithm 183;
    </li>
    <li>
      <a href = "asa189/asa189.html">
      asa189</a>,
      a library which
      estimates the parameters of a beta binomial distribution based on a sample
      of values generated by the distribution, by D Smith;
      this is a FORTRAN90 version of Applied Statistics Algorithm 189;
    </li>
    <li>
      <a href = "asa205/asa205.html">
      asa205</a>,
      a library which
      generates tables with given row and column sums;
      this is a FORTRAN90 version of Applied Statistics Algorithm 205;
    </li>
    <li>
      <a href = "asa226/asa226.html">
      asa226</a>,
      a library which
      evaluates the noncentral incomplete Beta function,
      by Russell Lenth;
      this is a FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 version of Applied Statistics Algorithm 245;
    </li>
    <li>
      <a href = "asa266/asa266.html">
      asa266</a>,
      a library which
      evaluates various properties of the Dirichlet probability density function (PDF);
      this is a FORTRAN90 version of Applied Statistics Algorithm 266;
    </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 FORTRAN90 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 FORTRAN90 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 = "ball_volume_quad/ball_volume_quad.html">
      ball_volume_quad</a>,
      a program which
      applies a quadrature rule to estimate the volume of the unit ball in 6D;
    </li>
    <li>
      <a href = "band_qr/band_qr.html">
      band_qr</a>,
      a library which
      computes the QR factorization of a banded matrix, and can solve
      related linear systems,  
      by Alfredo Remon, Enrique Quintana-Orti, Gregorio Quintana-Orti.
    </li>
    <li>
      <a href = "bar_plot/bar_plot.html">
      bar_plot</a>,
      a library which
      creates RGB color arrays for data that represents a sort of bar plot
      (several Y values for each X value).
    </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 = "basis_compare/basis_compare.html">
      basis_compare</a>,
      a program which
      compares two sets, each containing N
      orthonormal M-dimensional vectors, to see if they span the same
      subspace.
    </li>
    <li>
      <a href = "bayes_beta/bayes_beta.html">
      bayes_beta</a>,
      a program which
      uses Bayesian analysis to estimate the parameters in a beta distribution
      based on a series of sample data.
    </li>
    <li>
      <a href = "bayes_dice/bayes_dice.html">
      bayes_dice</a>,
      a program which
      uses Bayesian analysis to adjust a model of loaded dice
      based on a sequence of experimental observations.
    </li>
    <li>
      <a href = "bayes_weight/bayes_weight.html">
      bayes_weight</a>,
      a program which
      uses Bayesian analysis to adjust a model of loaded dice
      based on a sequence of experimental observations.
    </li>
    <li>
      <a href = "bdmlib/bdmlib.html">
      bdmlib</a>,
      a library which
      estimates the weights in a Dirichlet mixtured based on sample data;
    </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 = "bezier_surface/bezier_surface.html">
      bezier_surface</a>,
      a library which
      reads, writes, prints and manipulates
      the data that defines a Bezier surface;
    </li>
    <li>
      <a href = "bins/bins.html">
      bins</a>,
      a library which
      orders, sorts and searches data using 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 = "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 = "blacs/blacs.html">
      blacs</a>,
      a library which
      sets up the necessary communication for a linear algebra computation
      on any of a variety of distributed memory clusters.
    </li>
    <li>
      <a href = "blas/blas.html">
      blas</a>,
      a library which
      contains the Basic Linear Algebra Subprograms (BLAS)
      for level 1, 2 and 3, for single and double precision,
      and for real and complex arithmetic.
    </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 = "blas2/blas2.html">
      blas2</a>,
      a library which
      constitutes the Level 2 Basic Linear Algebra Subprograms (BLAS);
    </li>
    <li>
      <a href = "blas3/blas3.html">
      blas3</a>,
      a library which
      constitutes the Level 3 Basic Linear Algebra Subprograms (BLAS);
    </li>
    <li>
      <a href = "blend/blend.html">
      blend</a>,
      a library which
      carries out 1D/2D/3D blending interpolation;
    </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.
    </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 = "bt_serial/bt_serial.html">
      bt_serial</a>,
      a program which
      is a serial version of the NAS Parallel Benchmark BT
      (block tridiagonal solver for a 3D PDE).
    </li>
    <li>
      <a href = "bump/bump.html">
      bump</a>,
      a program which
      computes the steady 2D incompressible
      Navier-Stokes flow in a channel that includes a variable bump;
    </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 = "bvls/bvls.html">
      bvls</a>,
      a library which
      applies least squares methods to solve a linear system for which
      lower and upper constraints may have been placed on every variable,
      by Charles Lawson and Richard Hanson.
    </li>
    <li>
      <a href = "c4lib/c4lib.html">
      c4lib</a>,
      a library which
      implements certain elementary functions for
      single precision complex variables;
    </li>
    <li>
      <a href = "c8lib/c8lib.html">
      c8lib</a>,
      a library which
      implements certain elementary functions for double precision complex variables;
    </li>
    <li>
      <a href = "calendar_nyt/calendar_nyt.html">
      calendar_nyt</a>,
      a library which
      shows the correspondence between dates and the New York Times volume and
      issue number;
    </li>
    <li>
      <a href = "calpak/calpak.html">
      calpak</a>,
      a library which
      makes various calendar calculations;
    </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
      calculates a Centroidal Voronoi Tessellation (CVT) constrained to a box
      region, with points projected to the boundary;
    </li>
    <li>
      <a href = "ccvt_reflect/ccvt_reflect.html">
      ccvt_reflect</a>,
      a program which
      carries out a Centroidal Voronoi Tessellation (CVT) calculation that tries to include
      points on the boundary as well as the interior, using a natural
      (nonparametric) technique;
    </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 = "cg_serial/cg_serial.html">
      cg_serial</a>,
      a program which
      is a serial version of the NAS Parallel Benchmark CG
      (conjugate gradient solver).
    </li>
    <li>
      <a href = "channel/channel.html">
      channel</a>,
      a program which
      uses a finite element model of time independent
      viscous incompressible flow in a 2D channel;
    </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
      manipulates 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 = "circle_test/circle_test.html">
      circle_test</a>,
      a program which
      performs a circle-spacing test on sets of points;
    </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 = "cluster_energy/cluster_energy.html">
      cluster_energy</a>,
      a program which
      computes the minimal cluster energy of a set of points;
    </li>
    <li>
      <a href = "cnf_io/cnf_io.html">
      cnf_io</a>,
      a library which
      reads or writes CNF data files, used to store boolean formulas in
      conjunctive normal form.
    </li>
    <li>
      <a href = "codepack/codepack.html">
      codepack</a>,
      a library which
      computes graph codes to compare two graphs;
    </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 = "colors/colors.html">
      colors</a>,
      a library which
      converts between various formats for describing colors;
    </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 FORTRAN90 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 = "crystal/crystal.html">
      crystal</a>,
      a program which
      simulates axisymmetric
      silicon crystal growth under the Czochralski process;
    </li>
    <li>
      <a href = "crystal_coordinates/crystal_coordinates.html">
      crystal_coordinates</a>,
      a program which
      generates the spatial coordinates
      of a slab of points in 3D, using face-centered cubic (FCC) symmetry; these coordinates
      may be used for initialization of a molecular dynamics program;
    </li>
    <li>
      <a href = "crystal_plot/crystal_plot.html">
      crystal_plot</a>,
      a program which
      creates plots of the output of the crystal or crystal_qed programs.
    </li>
    <li>
      <a href = "crystal_qed/crystal_qed.html">
      crystal_qed</a>,
      a program which
      seeks to minimize a certain objective function during the growth of
      a silicon crystal under the Czochralski process.
    </li>
    <li>
      <a href = "csv_io/csv_io.html">
      csv_io</a>,
      a library which
      reads and writes files that use the Comma Separated Value (CSV) format.
    </li>
    <li>
      <a href = "cubpack/cubpack.html">
      cubpack</a>,
      a library which
      estimates the integral of a function
      (or vector of functions) over a collection of M-dimensional
      hyperrectangles and simplices,
      by Alan Genz and Ronald Cools.
    </li>
    <li>
      <a href = "cvt/cvt.html">
      cvt</a>,
      a library which
      computes an N point
      Centroidal Voronoi Tessellation (CVT) in M dimensions;
    </li>
    <li>
      <a href = "cvt_basis/cvt_basis.html">
      cvt_basis</a>,
      a program which
      uses discrete Centroidal Voronoi Tessellation (CVT) techniques to produce a
      small set of basis vectors that are good cluster centers for a
      large set of data vectors;
    </li>
    <li>
      <a href = "cvt_basis_flow/cvt_basis_flow.html">
      cvt_basis_flow</a>,
      a program which
      uses Centroidal Voronoi Tessellation (CVT)
      techniques to extract a small set of representative behaviors
      from a large set of solutions of a partial differential equation (PDE)
      representing fluid flow;
    </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 = "cvt_fixed/cvt_fixed.html">
      cvt_fixed</a>,
      a library which
      computes a Centroidal Voronoi Tessellation (CVT),
      built on top of cvt_size, which allows the user to fix
      the location of some generators;
    </li>
    <li>
      <a href = "cvt_fixed2/cvt_fixed2.html">
      cvt_fixed2</a>,
      a library which
      implements a version of the Centroidal Voronoi Tessellation (CVT)
      algorithm which allows the user to fix some points;
    </li>
    <li>
      <a href = "cvt_mod/cvt_mod.html">
      cvt_mod</a>,
      a library which
      creates a Centroidal Voronoi Tessellation (CVT)
      dataset on the unit square with no boundaries (a logical torus);
    </li>
    <li>
      <a href = "cvt_mod_dataset/cvt_mod_dataset.html">
      cvt_mod_dataset</a>,
      a program which
      creates a Centroidal Voronoi Tessellation (CVT) dataset on the unit square 
      with no boundaries (a logical torus);
    </li>
    <li>
      <a href = "cvt_movie5_data/cvt_movie5_data.html">
      cvt_movie5_data</a>,
      a program which
      creates and saves data of a
      Centroidal Voronoi Tessellation (CVT) iteration, for use in a movie;
    </li>
    <li>
      <a href = "cvt_refine/cvt_refine.html">
      cvt_refine</a>,
      a library which
      investigates how to refine a Centroidal Voronoi Tessellation (CVT) 
      by fixing the current points and adding new ones;
    </li>
    <li>
      <a href = "cvt_size/cvt_size.html">
      cvt_size</a>,
      a library which
      controls Centroidal Voronoi Tessellation (CVT) cell sizes by specifying 
      a weight function associated with each cell;
    </li>
    <li>
      <a href = "cvt_tet_mesh/cvt_tet_mesh.html">
      cvt_tet_mesh</a>,
      a program which
      constructs a Centroidal Voronoi Tessellation (CVT) for a region specified
      by the TEST_TET_MESH library;
    </li>
    <li>
      <a href = "cvt_triangulation/cvt_triangulation.html">
      cvt_triangulation</a>,
      a program which
      constructs a Centroidal Voronoi Tessellation (CVT) for a region specified
      by the TEST_TRIANGULATION library;
    </li>
    <li>
      <a href = "cvt_weight/cvt_weight.html">
      cvt_weight</a>,
      a library which
      tried to control Centroidal Voronoi Tessellation (CVT) cell sizes 
      by specifying a weight function associated with each cell;
    </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,
      by Barry Brown, James Lovato, Kathy Russell.
    </li>
    <li>
      <a href = "delaunay_lmap_2d/delaunay_lmap_2d.html">
      delaunay_lmap_2d</a>,
      a program which
      reads a set of N points in 2 dimensions and writes out the Delaunay triangulation
      of the data after it is implicitly transformed by a linear map;
    </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
      illustrate the use of a scientific plotting package;
    </li>
    <li>
      <a href = "distance_to_position/distance_to_position.html">
      distance_to_position</a>,
      a program which
      estimates the positions of cities based on a city-to-city distance table.
    </li>
    <li>
      <a href = "distances/distances.html">
      distances</a>,
      a program which
      reads a multiple alignment file (perhaps preprocessed by read_align)
      and creates a distance matrix suitable for a principal component
      analysis by the spacer program.
    </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 = "dlap/dlap.html">
      dlap</a>,
      a library which
      solves linear systems involving a large sparse matrix,
      by Anne Greenbaum and Mark Seager.
    </li>
    <li>
      <a href = "dlap_io/dlap_io.html">
      dlap_io</a>,
      a library which
      reads and writes DLAP sparse matrix files;
    </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 = "dqed/dqed.html">
      dqed</a>,
      a library which
      solves bounded and constrained least
      squares problems and systems of nonlinear equations,
      by Richard Hanson and Fred Krogh;
    </li>
    <li>
      <a href = "dsp_to_st/dsp_to_st.html">
      dsp_to_st</a>,
      a program which
      converts a sparse matrix file from
      DSP format
      (one-based indices) to Sparse Triplet (ST) format (zero-based indices);
    </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 = "dutch/dutch.html">
      dutch</a>,
      a library which
      performs certain tasks in computational geometry;
    </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 = "ep_serial/ep_serial.html">
      ep_serial</a>,
      a program which
      is a serial version of the NAS Embarassingly Parallel (EP) benchmark program.
    </li>
    <li>
      <a href = "errors/errors.html">
      errors</a>,
      programs which
      illustrate the failure of numerical algorithms;
    </li>
    <li>
      <a href = "extract/extract.html">
      extract</a>,
      a program which
      extracts one routine from a FORTRAN77 or FORTRAN90 file;
    </li>
    <li>
      <a href = "f77_cleanup/f77_cleanup.html">
      f77_cleanup</a>,
      a program which
      makes some minor improvements to the
      text of a FORTRAN77 file;
    </li>
    <li>
      <a href = "f77_to_f90/f77_to_f90.html">
      f77_to_f90</a>,
      a program which
      converts a FORTRAN77 file to FORTRAN90 format,
      by Michael Metcalfe;
    </li>
    <li>
      <a href = "f90/f90.html">
      f90</a>,
      programs which
      illustrate the use of various FORTRAN90 programming features;
    </li>
    <li>
      <a href = "f90_calls_c/f90_calls_c.html">
      f90_calls_c</a>,
      programs which
      illustrates how a FORTRAN90 program can call a C function.
    </li>
    <li>
      <a href = "f90_calls_c_and_mpi/f90_calls_c_and_mpi.html">
      f90_calls_c_and_mpi</a>,
      programs which
      illustrate how a FORTRAN90 program can call a C function while
      executing under the MPI parallel programming environment.
    </li>
    <li>
      <a href = "f90_calls_c++/f90_calls_c++.html">
      f90_calls_c++</a>,
      programs which
      illustrate how a FORTRAN90 program can call a C++ function.
    </li>
    <li>
      <a href = "f90_calls_c++_and_mpi/f90_calls_c++_and_mpi.html">
      f90_calls_c++_and_mpi</a>,
      programs which
      illustrate how a FORTRAN90 program can call a C++ function while
      executing under the MPI parallel programming environment.
    </li>
    <li>
      <a href = "f90_calls_matlab/f90_calls_matlab.html">
      f90_calls_matlab</a>,
      programs which
      illustrate how a FORTRAN90 program can interact with MATLAB;
    </li>
    <li>
      <a href = "f90_intrinsics/f90_intrinsics.html">
      f90_intrinsics</a>,
      programs which
      illustrate the use of various FORTRAN90 intrinsic functions
      and subroutines;
    </li>
    <li>
      <a href = "f90_random/f90_random.html">
      f90_random</a>,
      programs which
      illustrate the use of FORTRAN90's random number generator routines.
    </li>
    <li>
      <a href = "f90split/f90split.html">
      f90split</a>,
      a program which
      splits FORTRAN77 or FORTRAN90 source into individual files;
    </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 = "faure/faure.html">
      faure</a>,
      a library which
      computes elements of the Faure quasirandom M-dimensional
      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_predator_prey/fd1d_predator_prey.html">
      fd1d_predator_prey</a>,
      a program which
      implements a finite difference
      algorithm for a 1D predator-prey system;
    </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 = "fd2d_predator_prey/fd2d_predator_prey.html">
      fd2d_predator_prey</a>,
      a program which
      implements a finite difference algorithm for a 2D predator-prey system,
      by Marcus Garvie.
    </li>
    <li>
      <a href = "fekete/fekete.html">
      fekete</a>,
      a library which
      returns 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 = "fem_to_tec/fem_to_tec.html">
      fem_to_tec</a>,
      a program which
      reads a set of FEM files
      (node coordinates/elements/node data)
      of finite element information and writes an equivalent TECPLOT 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
      uses the finite element method and the backward
      Euler method to solve the time-dependent heat equation
      on an arbitrary triangulated region in 2D.  (The user supplies
      some information in some problem-dependent subroutines.)
    </li>
    <li>
      <a href = "fem2d_heat_rectangle/fem2d_heat_rectangle.html">
      fem2d_heat_rectangle</a>,
      a program which
      implements the finite element
      method for the time dependent heat equation on a triangulated
      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
      uses the finite element
      method to solve the steady incompressible Navier Stokes equations
      on an arbitrary triangulated region in 2D   (The user supplies
      some information in some problem-dependent subroutines.)
    </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 simple 2D finite element calculations;
    </li>
    <li>
      <a href = "fem2d_poisson/fem2d_poisson.html">
      fem2d_poisson</a>,
      a program which
      uses the finite element method to solve
      Poisson's equation on an arbitrary triangulated region in 2D;
      (The user supplies
      some information in some problem-dependent subroutines.)
    </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
      uses the finite element method to solve
      the steady incompressible Stokes equations
      on an arbitrary triangulated region in 2D;
      The user supplies
      some information in some problem-dependent subroutines.
    </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 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 = "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
      in parallel, using OpenMP.
    </li>
    <li>
      <a href = "fft_serial/fft_serial.html">
      fft_serial</a>,
      a program which
      computes a Fast Fourier Transform, and is intended as
      a starting point for implementing an OpenMP parallel version.
    </li>
    <li>
      <a href = "fftpack5/fftpack5.html">
      fftpack5</a>,
      a library which
      computes Fast Fourier transforms
      by Paul Swarztrauber and Dick Valent;
    </li>
    <li>
      <a href = "fftpack5.1/fftpack5.1.html">
      fftpack5.1</a>,
      a library which
      contains version 5.1 of the FFTPACK
      Fast Fourier Transform package,
      using single precision arithmetic,
      by Paul Swarztrauber and Dick Valent;
    </li>
    <li>
      <a href = "fftpack5.1d/fftpack5.1d.html">
      fftpack5.1d</a>,
      a library which
      contains version 5.1 of the FFTPACK
      Fast Fourier Transform package,
      using double precision arithmetic,
      by Paul Swarztrauber and Dick Valent;
    </li>
    <li>
      <a href = "fftw3/fftw3.html">
      fftw3</a>,
      programs which
      illustrate the use of the FFTW3 Fast Fourier Transform package,
      by Matteo Frigo and Steven Johnson.
    </li>
    <li>
      <a href = "file_merge/file_merge.html">
      file_merge</a>,
      a program which
      merges two sorted files.
    </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 = "file_row_reverse/file_row_reverse.html">
      file_row_reverse</a>,
      a program which
      makes a copy of a file with the lines listed in reverse order.
    </li>
    <li>
      <a href = "file_transpose/file_transpose.html">
      file_transpose</a>,
      a program which
      makes a "transposed" copy of a file, in which the I-th word of the J-th line
      becomes the J-th word of the I-th line.
    </li>
    <li>
      <a href = "files_multiple/files_multiple.html">
      files_multiple</a>,
      a program which
      demonstrates how a program can open multiple output files at one time,
      and write data to any one specific file it chooses.
    </li>
    <li>
      <a href = "filum/filum.html">
      filum</a>,
      a library which
      performs various operations on files;
    </li>
    <li>
      <a href = "fixcon/fixcon.html">
      fixcon</a>,
      a program which
      converts FORTRAN77 continuation statements to the FORTRAN90 format;
    </li>
    <li>
      <a href = "flow3/flow3.html">
      flow3</a>,
      a program which
      uses the finite element method
      to solve the steady incompressible Navier Stokes equations in 2D;
    </li>
    <li>
      <a href = "flow5/flow5.html">
      flow5</a>,
      a program which
      uses the finite element method
      to solve the steady incompressible Navier Stokes equations in 2D;
    </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 = "football/football.html">
      football</a>,
      a program which
      ranks football teams based on scores;
    </li>
    <li>
      <a href = "frieze/frieze.html">
      frieze</a>,
      a program which
      demonstrates how to map a pattern
      repeatedly into a (distorted) 2D region to create a sort of
      wallpaper;
    </li>
    <li>
      <a href = "g95_intrinsics/g95_intrinsics.html">
      g95_intrinsics</a>,
      programs which
      illustrate the use of some of the intrinsic functions
      included by the GNU G95 compiler, above and beyond those
      specified in the FORTRAN language standards.
    </li>
    <li>
      <a href = "g95_quadmath/g95_quadmath.html">
      g95_quadmath</a>,
      a program which
      illustrates the use of quadruple precision real arithmetic,
      as provided on some systems by the G95 compiler for FORTRAN90.
    </li>
    <li>
      <a href = "gdb/gdb.html">
      gdb</a>,
      an example directory of programs which
      illustrate the use of the GNU debugger program
      on a FORTRAN90 program;
    </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 = "gene_cluster/gene_cluster.html">
      gene_cluster</a>,
      a program which
      clusters sets of genetic expression data;
    </li>
    <li>
      <a href = "geometry/geometry.html">
      geometry</a>,
      a library which
      performs 2D/3D geometric calculations;
    </li>
    <li>
      <a href = "geompack/geompack.html">
      geompack</a>,
      a library which
      determines the Delaunay triangulation of 2D data,
      by Barry Joe.
    </li>
    <li>
      <a href = "geompack2/geompack2.html">
      geompack2</a>,
      a library which
      computes the Delaunay triangulation of 2D data,
      by Barry Joe.
    </li>
    <li>
      <a href = "geompack3/geompack3.html">
      geompack3</a>,
      a library which
      performs Delaunay triangulation for 3D data,
      by Barry Joe.
    </li>
    <li>
      <a href = "getwgt/getwgt.html">
      getwgt</a>,
      a library which
      estimates the parameters of a Dirichlet mixture.
    </li>
    <li>
      <a href = "gfortran/gfortran.html">
      gfortran</a>,
      programs which
      investigate the use of the Gnu gfortran compiler with FORTRAN90 code.
    </li>
    <li>
      <a href = "gfortran_intrinsics/gfortran_intrinsics.html">
      gfortran_intrinsics</a>,
      a program which
      illustrates the use of some of the intrinsic functions
      included by the Gnu gfortran compiler, above and beyond those
      specified in the FORTRAN language standards.
    </li>
    <li>
      <a href = "gfortran_quadmath/gfortran_quadmath.html">
      gfortran_quadmath</a>,
      a program which
      illustrates the use of quadruple precision real arithmetic,
      as provided on some systems by the Gnu gfortran compiler for FORTRAN90.
    </li>
    <li>
      <a href = "gm_rule/gm_rule.html">
      gm_rule</a>,
      a library which
      defines Grundmann-Moeller quadrature rules for an M-dimensional simplex.
    </li>
    <li>
      <a href = "gnufor/gnufor.html">
      gnufor</a>,
      a library which
      provides an interface between a FORTRAN90 program and
      the gnuplot graphics library.
    </li>
    <li>
      <a href = "gprof/gprof.html">
      gprof</a>,
      programs which
      illustrate the use of the gprof program performance monitor;
    </li>
    <li>
      <a href = "grafpack/grafpack.html">
      grafpack</a>,
      a library which
      performs calculations on graphs;
    </li>
    <li>
      <a href = "graph_paper/graph_paper.html">
      graph_paper</a>,
      a library which
      makes PostScript (PS) graph paper;
    </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_io/grf_io.html">
      grf_io</a>,
      a library which
      reads or writes a GRF file which displays a mathematical graph;
    </li>
    <li>
      <a href = "grf_to_eps/grf_to_eps.html">
      grf_to_eps</a>,
      a program which
      converts a 2D graphics file from GRF format to 
      Encapsulated PostScript (EPS) format;
    </li>
    <li>
      <a href = "grf_to_xyl/grf_to_xyl.html">
      grf_to_xyl</a>,
      a program which
      converts information describing an abstract graph from
      GRF to XYL format.
    </li>
    <li>
      <a href = "grid/grid.html">
      grid</a>,
      a library which
      computes 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 uniform grid dataset;
    </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 dataset;
    </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 dataset;
    </li>
    <li>
      <a href = "hb_io/hb_io.html">
      hb_io</a>,
      a library which
      reads and writes files in the Harwell Boeing (HB) sparse matrix format;
    </li>
    <li>
      <a href = "hb_to_st/hb_to_st.html">
      hb_to_st</a>,
      a program which
      reads a sparse matrix in a Harwell Boeing (HB) file and
      writes an equivalent Sparse Triplet (ST) file.
    </li>
    <li>
      <a href = "heat_mpi/heat_mpi.html">
      heat_mpi</a>,
      a program which
      solves the 1D time dependent heat equation using MPI.
    </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 = "heated_plate_workshare/heated_plate_workshare.html">
      heated_plate_workshare</a>,
      a program which
      solves the steady (time independent) heat equation in a 2D
      rectangular region, using OpenMP's workshare directive to run in parallel;
      the results suggest that workshare is not supported by the
      gfortran and ifort compilers!
    </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
      defines a hexagonal grid of points in
      the unit square.
    </li>
    <li>
      <a href = "hex_grid_angle/hex_grid_angle.html">
      hex_grid_angle</a>,
      a library which
      defines a hexagonal grid of points in
      the unit square, with an arbitrary center, angle, and spacing.
    </li>
    <li>
      <a href = "hex_grid_dataset/hex_grid_dataset.html">
      hex_grid_dataset</a>,
      a program which
      creates a hexagonal grid dataset,
      using the hex_grid library;
    </li>
    <li>
      <a href = "hex_grid_triangulate/hex_grid_triangulate.html">
      hex_grid_triangulate</a>,
      a program which
      finds the points on a hex grid that
      lie inside a given triangulation region.
    </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 = "ieee_uniform/ieee_uniform.html">
      ieee_uniform</a>,
      a library which
      tries to uniformly sample the discrete set of values that represent the
      legal IEEE real numbers;
    </li>
    <li>
      <a href = "ihs/ihs.html">
      ihs</a>,
      a library which
      implements the Improved Distributed Hypercube
      Sampling method, regarded as a quasirandom M-dimensional sequence;
    </li>
    <li>
      <a href = "ihs_dataset/ihs_dataset.html">
      ihs_dataset</a>,
      a program which
      creates an Improved Distributed Hypercube Sampling 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 = "include_files/include_files.html">
      include_files</a>,
      a program which
      reads a FORTRAN90 file with INCLUDE
      statements, and makes a copy in which the indicated files have
      been included;
    </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 quadrature rules 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 = "integral_test/integral_test.html">
      integral_test</a>,
      a program which
      tests the use of quasirandom points (or
      any set of points) to approximate an M-dimensional integral;
    </li>
    <li>
      <a href = "interp/interp.html">
      interp</a>,
      a library which
      can be used for parameterizing and interpolating data;
    </li>
    <li>
      <a href = "intlib/intlib.html">
      intlib</a>,
      a library which
      carries out approximate integration (quadrature) in
      one dimension;
    </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 = "ising_3d_simulation/ising_3d_simulation.html">
      ising_3d_simulation</a>,
      a program which
      simulates the evolution of a 3D array of positive and negative charges,
      each of which is likely to flip to be in agreement with neighbors.
    </li>
    <li>
      <a href = "ivread/ivread.html">
      ivread</a>,
      a program which
      carries out 3D graphic file conversion;
    </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 = "jbar/jbar.html">
      jbar</a>,
      a program which
      reads a data file and creates a bar graph.
    </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 = "kmedian/kmedian.html">
      kmedian</a>,
      a program which
      handles the K-Median problem;
    </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 = "lambert/lambert.html">
      lambert</a>,
      a library which
      computes the Lambert quasirandom
      sequence in 1D, 2D, 3D and 4D.
    </li>
    <li>
      <a href = "lapack_examples/lapack_examples.html">
      lapack_examples</a>,
      a program which
      demonstrates the use of the LAPACK linear algebra library.
    </li>
    <li>
      <a href = "lapack_examples_osx/lapack_examples_osx.html">
      lapack_examples_osx</a>,
      a program which
      demonstrates the use of the precompiled LAPACK linear algebra library available
      on Macintosh OSX systems, using the "-framework veclib" compiler option.
    </li>
    <li>
      <a href = "latin_center/latin_center.html">
      latin_center</a>,
      a library which
      produces N points in an M-dimensional Latin Center Hypercube.
    </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
      produces N points in an M-dimensional Latin Edge Hypercube.
    </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
      produces N points in an M-dimensional Latin Random Hypercube.
    </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 = "lau_np/lau_np.html">
      lau_np</a>,
      a library which
      implements heuristic algorithms for NP-hard problems.
    </li>
    <li>
      <a href = "laupack/laupack.html">
      laupack</a>,
      a library which
      carries out various operations on graphs.
    </li>
    <li>
      <a href = "lawson/lawson.html">
      lawson</a>,
      a library which
      contains routines for solving least squares problems and singular value
      decompositions, by Lawson and Hanson.
    </li>
    <li>
      <a href = "lcvt/lcvt.html">
      lcvt</a>,
      a library which
      creates a sort of Latin Square Centroidal Voronoi Tessellation (CVT);
    </li>
    <li>
      <a href = "lcvt_dataset/lcvt_dataset.html">
      lcvt_dataset</a>,
      a program which
      creates a
      Latin Square Centroidal Voronoi Tessellation (CVT) dataset
    </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
      computes and 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.
    </li>
    <li>
      <a href = "linpack_bench/linpack_bench.html">
      linpack_bench</a>,
      a program which
      carries out the LINPACK benchmark;
    </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.
      It includes a routine for computing the singular value decomposition (SVD)
      of a rectangular matrix.
      The original version of this library is 
      by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart.
    </li>
    <li>
      <a href = "linpack_c/linpack_c.html">
      linpack_c</a>,
      a library which
      factors and solves linear systems
      using single precision complex arithmetic,
      by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart.
    </li>
    <li>
      <a href = "linpack_d/linpack_d.html">
      linpack_d</a>,
      a library which
      factors and solves linear systems using double precision real arithmetic,
      by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart.
    </li>
    <li>
      <a href = "linpack_s/linpack_s.html">
      linpack_s</a>,
      a library which
      factors and solves linear systems using single precision real arithmetic,
      by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart.
    </li>
    <li>
      <a href = "linpack_z/linpack_z.html">
      linpack_z</a>,
      a library which
      factors and solves linear systems
      using double precision complex arithmetic,
      by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart.
    </li>
    <li>
      <a href = "linplus/linplus.html">
      linplus</a>,
      a library which
      factors/solves/multiplies matrices in
      a variety of storage formats;
    </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 = "mass/mass.html">
      mass</a>,
      a program which
      verifies the computation of the mass matrix for a finite element
      calculation for a fluid flow problem;
    </li>
    <li>
      <a href = "matman/matman.html">
      matman</a>,
      a program which
      manipulates matrices;
    </li>
    <li>
      <a href = "matmul/matmul.html">
      matmul</a>,
      a program which
      carries out a matrix multiplication benchmark;
    </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 = "md1/md1.html">
      md1</a>,
      a program which
      carries out a simple molecular dynamics simulation;
    </li>
    <li>
      <a href = "md2/md2.html">
      md2</a>,
      a program which
      carries out a simple molecular dynamics simulation;
    </li>
    <li>
      <a href = "md3/md3.html">
      md3</a>,
      a program which
      carries out a simple molecular dynamics simulation;
    </li>
    <li>
      <a href = "md3glue/md3glue.html">
      md3glue</a>,
      a program which
      carries out a simple molecular dynamics simulation;
    </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_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 = "meshless/meshless.html">
      meshless</a>,
      a library which
      computes a meshless grid by centroidal
      Voronoi computations;
    </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, by Diane O'Leary.
    </li>
    <li>
      <a href = "mhd_control/mhd_control.html">
      mhd_control</a>,
      a program for the control of magnetic-hydrodynamic (MHD)
      viscous 2d time-dependent fluid flow;
    </li>
    <li>
      <a href = "mhd_flow/mhd_flow.html">
      mhd_flow</a>,
      a program for magnetic-hydrodynamic (MHD) viscous 2d
      time-dependent fluid flow;
    </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 the used of mixed language programming in which the main
      program is written in FORTRAN90;
    </li>
    <li>
      <a href = "mixture/mixture.html">
      mixture</a>,
      a program which
      simulates a process governed by a Dirichlet mixture distribution.
    </li>
    <li>
      <a href = "mm_io/mm_io.html">
      mm_io</a>,
      a library which
      reads or writes sparse matrices that use the
      Matrix Market (MM) sparse matrix file format.
    </li>
    <li>
      <a href = "module_mark/module_mark.html">
      module_mark</a>,
      a program which
      replaces bare "end" statements by "end (module name)" statements
      in a FORTRAN90 file.
    </li>
    <li>
      <a href = "monte_carlo_rule/monte_carlo_rule.html">
      monte_carlo_rule</a>,
      a program which
      generates a dataset of N random M-dimensional points, 
      regards it as a quadrature rule for the unit hypercube,
      and writes out three files of information.
    </li>
    <li>
      <a href = "movie_data_reformat/movie_data_reformat.html">
      movie_data_reformat</a>,
      a program which
      reformats movie data, copied from "the numbers" movie data web page, 
      into a comma separated variable (CSV) format suitable for input 
      to a statistical analysis package such as "R".
    </li>
    <li>
      <a href = "mpi/mpi.html">
      mpi</a>,
      programs which
      illustrate the use of the message passing interface (MPI)
      for parallel processing on distributed memory systems;
    </li>
    <li>
      <a href = "mpi_stubs/mpi_stubs.html">
      mpi_stubs</a>,
      a library which
      contains stub version of standard
      MPI routines, 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 (do i, do j) loops, (do j, do i) loops,
      and MATMUL 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 plain vanilla Fortran and the FORTRAN90
      intrinsic routine matmul(), for the matrix multiplication problem
      y=A*x, with and without parallelization by OpenMP.
    </li>
    <li>
      <a href = "nas/nas.html">
      nas</a>,
      a program which
      runs the NASA kernel benchmark.
    </li>
    <li>
      <a href = "nast2d_f90/nast2d_f90.html">
      nast2d_f90</a>,
      a program which
      solves the 2D Navier-Stokes equations,
      with heat; this is a FORTRAN90 version of a program by
      Griebel, Dornseifer, and Neunhoeffer;
    </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>,
      a directory of example programs which
      read and write netcdf files.
    </li>
    <li>
      <a href = "niederreiter/niederreiter.html">
      niederreiter</a>,
      a library which
      computes elements of the Niederreiter
      quasirandom M-dimensional sequence, using an arbitrary base;
    </li>
    <li>
      <a href = "niederreiter2/niederreiter2.html">
      niederreiter2</a>,
      a library which
      computes elements of the Niederreiter
      quasirandom M-dimensional 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 a 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 a 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
      carries out approximate integration (quadrature)
      in M dimensions;
    </li>
    <li>
      <a href = "nl2sol/nl2sol.html">
      nl2sol</a>,
      a library which
      implements an adaptive nonlinear least squares algorithm,
      by John Dennis, David Gay, Roy Welsch.
    </li>
    <li>
      <a href = "nms/nms.html">
      nms</a>,
      a library which
      accompanies the text "Numerical Methods and Software";
    </li>
    <li>
      <a href = "normal/normal.html">
      normal</a>,
      a library which
      computes elements of a pseudorandom sequence of normally distributed values;
    </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 = "nsasm/nsasm.html">
      nsasm</a>,
      a library which
      computes the jacobian matrix associated
      with a finite element approximation of the incompressible
      steady (time independent) Navier-Stokes equations in 2D, and to store these as
      a sparse matrix.
    </li>
    <li>
      <a href = "nswc/nswc.html">
      nswc</a>,
      a library which
      includes an extensive set of routines for a wide range of computational
      activities, compiled by Alfred Morris.
    </li>
    <li>
      <a href = "obj_io/obj_io.html">
      obj_io</a>,
      a library which
      reads and writes the 3D graphics information
      in an Alias OBJ 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 = "openmp/openmp.html">
      openmp</a>,
      programs which
      illustrate the use of OpenMP for parallel execution;
    </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 = "paranoia/paranoia.html">
      paranoia</a>,
      a program which
      checks the accuracy of floating point arithmetic on a given computer.
    </li>
    <li>
      <a href = "partial_digest/partial_digest.html">
      partial_digest</a>,
      a library which
      solves the partial digest problem;
    </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 = "pblas/pblas.html">
      pblas</a>,
      a library which
      embodies the Parallel Basic Linear Algebra Subprograms (PBLAS).
    </li>
    <li>
      <a href = "pbma_io/pbma_io.html">
      pbma_io</a>,
      a library which
      reads or writes ASCII Portable Bit Map (PBM) 2D graphics files;
    </li>
    <li>
      <a href = "pbmlib/pbmlib.html">
      pbmlib</a>,
      a library which
      reads or writes
      graphics files in the Portable Bit Map (PBM) format;
    </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 = "pdb_extract/pdb_extract.html">
      pdb_extract</a>,
      a program which
      can select records from a Protein Data Base (PDB) file
      and extract columns from those records;
    </li>
    <li>
      <a href = "pdb_read/pdb_read.html">
      pdb_read</a>,
      a library which
      reads a Protein Data Base (PDB) file;
    </li>
    <li>
      <a href = "pdb_to_xyz/pdb_to_xyz.html">
      pdb_to_xyz</a>,
      a program which
      copies the coordinates from the
      ATOM records of a Protein Data Base (PDB) file into an XYZ file;
    </li>
    <li>
      <a href = "pgma_io/pgma_io.html">
      pgma_io</a>,
      a library which
      reads or writes ASCII Portable Gray Map (PGM) 2D graphics files;
    </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 = "pitcon7/pitcon7.html">
      pitcon7</a>,
      a library which
      seeks to produce a sequence of points that satisfy a set of nonlinear
      equations with one degree of freedom;
      this is version 7.0 of ACM TOMS algorithm 596.
    </li>
    <li>
      <a href = "plot_points/plot_points.html">
      plot_points</a>,
      a program which
      can plot points, or the Delaunay triangulation or Voronoi diagram;
    </li>
    <li>
      <a href = "plot_to_ps/plot_to_ps.html">
      plot_to_ps</a>,
      a program which
      reads simple text commands and creates a PostScript (PS) image;
    </li>
    <li>
      <a href = "plot3d_io/plot3d_io.html">
      plot3d_io</a>,
      a library which
      reads or writes a plot3d file;
    </li>
    <li>
      <a href = "plot3d_to_avs/plot3d_to_avs.html">
      plot3d_to_avs</a>,
      a program which
      reads flow data from plot3d files and
      writes the data to files suitable for input to the AVS graphics
      system.
    </li>
    <li>
      <a href = "pod_basis_flow/pod_basis_flow.html">
      pod_basis_flow</a>,
      a program which
      uses POD techniques
      to extract a small set of representative behaviors from a large
      set of solutions of a partial differential equation (PDE) involving fluid flow;
    </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 = "poly_io/poly_io.html">
      poly_io</a>,
      a library which
      reads and writes POLY files;
    </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 = "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 ASCII Portable Pixel Map (PPM) 2D color graphics files;
    </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) file to a
      binary PPM file;
    </li>
    <li>
      <a href = "pppack/pppack.html">
      pppack</a>,
      a library which
      computes piecewise polynomial interpolants and approximants,
      in particular, cubic splines,
      by Carl DeBoor.
    </li>
    <li>
      <a href = "praxis/praxis.html">
      praxis</a>,
      a library which
      minimizes a scalar function of several variables, without
      requiring derivative information,
      by Richard Brent.
    </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>,
      is 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 probability density functions;
    </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 = "ps_gg_align/ps_gg_align.html">
      ps_gg_align</a>,
      a library which
      implements a profile/sequence global alignment method using an affine gap penalty.
    </li>
    <li>
      <a href = "ps_lg_align/ps_lg_align.html">
      ps_lg_align</a>,
      a library which
      implements a profile/sequence local alignment method using an affine gap penalty.
    </li>
    <li>
      <a href = "ps_qg_align/ps_qg_align.html">
      ps_qg_align</a>,
      a library which
      implements a profile/sequence quasiglobal alignment method using an affine gap penalty.
    </li>
    <li>
      <a href = "ps_write/ps_write.html">
      ps_write</a>,
      a library which
      creates a PostScript (PS) file of line drawings;
    </li>
    <li>
      <a href = "puzzles/puzzles.html">
      puzzles</a>,
      executable programs which
      solve simple puzzles;
    </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, 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 = "quadpack/quadpack.html">
      quadpack</a>,
      a library which
      approximates integrals of various types
      over finite, semi-infinite and infinite one dimensional intervals;
    </li>
    <li>
      <a href = "quadrature_test/quadrature_test.html">
      quadrature_test</a>,
      a program which
      reads the definition of a
      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 = "quadrature_test_genz/quadrature_test_genz.html">
      quadrature_test_genz</a>,
      a program which
      reads the definition of a
      M-dimensional quadrature rule from three files, applies
      the rule to the Genz test integrals, and prints the
      results.  This is a version of quadrature_test that
      is restricted to the Genz problems.
    </li>
    <li>
      <a href = "quadrature_weights/quadrature_weights.html">
      quadrature_weights</a>,
      a library which
      illustrates techniques for computing the weights of a quadrature
      rule, assuming that the points have been specified.
    </li>
    <li>
      <a href = "quadrule/quadrule.html">
      quadrule</a>,
      a library which
      implements rules for approximate integration (quadrature) in one dimension;
    </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 = "quote/quote.html">
      quote</a>,
      a program which
      prints a random quote from a file;
    </li>
    <li>
      <a href = "r16_hermite_rule/r16_hermite_rule.html">
      r16_hermite_rule</a>,
      a program which
      can compute and print a Gauss-Hermite quadrature rule, using
      quadruple precision real (R16) arithmetic.
    </li>
    <li>
      <a href = "r16_int_exactness_gen_hermite/r16_int_exactness_gen_hermite.html">
      r16_int_exactness_gen_hermite</a>,
      a program which
      tests the polynomial exactness of generalized Gauss-Hermite quadrature
      rules, using quadruple precision real (R16) arithmetic.
    </li>
    <li>
      <a href = "r16lib/r16lib.html">
      r16lib</a>,
      a library which
      contains many utility routines, using
      quadruple precision real (R16) arithmetic.
    </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 = "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 = "random_write/random_write.html">
      random_write</a>,
      a program which
      creates a very large file of 32 bit integers, for input to the
      diehard program, which can apply statistic tests for randomness.
    </li>
    <li>
      <a href = "ranmap/ranmap.html">
      ranmap</a>,
      a program which
      creates a PostScript (PS) file
      of images of iterated affine mappings;
    </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 = "read_align/read_align.html">
      read_align</a>,
      a program which
      extracts data from a multiple alignment file for sequences and
      writes the data to a file suitable for input to the distances program.
    </li>
    <li>
      <a href = "real_precision/real_precision.html">
      real_precision</a>,
      programs which
      investigate the occasionally awkward methods for requesting
      a real data type with given precision.  This is the preferred
      method for requesting double or quadruple precision arithmetic;
    </li>
    <li>
      <a href = "reformat/reformat.html">
      reformat</a>,
      a program which
      makes a copy of a data file with
      a given number of items per line;
    </li>
    <li>
      <a href = "region/region.html">
      region</a>,
      a library which
      reads 3D MRI voxel data, and groups the voxels into connected regions;
    </li>
    <li>
      <a href = "regression/regression.html">
      regression</a>,
      a library which
      handles problems in linear regression.
    </li>
    <li>
      <a href = "rejoin/rejoin.html">
      rejoin</a>,
      a library which
      demonstrates a way to split or merge data files
      for parallel computations.
    </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 a Runge-Kutta-Fehlberg (RKF) solver to a system of 
      ordinary differential equations (ODE's);
    </li>
    <li>
      <a href = "roc/roc.html">
      roc</a>,
      a program which
      computes the Receiver Operator Characteristic (ROC);
    </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_cvt/sandia_cvt.html">
      sandia_cvt</a>,
      a program which
      positions a given number of points in an
      arbitrary region, using probabilistic centroidal Voronoi tessellation
      techniques to achieve good coverage and separation; developed
      for Sandia National Laboratories;
    </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_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 satisfiability 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 satisfiability 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 satisfiability problem,
      using OpenMP for parallel execution.
    </li>
    <li>
      <a href = "scalapack/scalapack.html">
      scalapack</a>,
      a directory of example programs for
      SCALAPACK, which carries out linear algebra algorithms
      on parallel systems.
    </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 = "select/select.html">
      select</a>,
      a library which
      carries out Nijenhuis and Wilf's generalized
      combinatorial selection algorithm;
    </li>
    <li>
      <a href = "sequence/sequence.html">
      sequence</a>,
      a program which
      reads a numeric sequence with missing values,
      and fills in the missing values.
    </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.
    </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 = "sgmga/sgmga.html">
      sgmga</a>,
      a library which
      creates sparse grids based on a mixture of 1D quadrature rules,
      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 = "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 = "slatec/slatec.html">
      slatec</a>,
      a library which
      contains a huge collection of scientific algorithms;
    </li>
    <li>
      <a href = "sobol/sobol.html">
      sobol</a>,
      a library which
      evaluates the Sobol quasirandom M dimensional sequence,
      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 = "spacer/spacer.html">
      spacer</a>,
      a program which
      reads a file containing a distance matrix and performs a
      principal component analysis.
    </li>
    <li>
      <a href = "spacer_data_convert/spacer_data_convert.html">
      spacer_data_convert</a>,
      a program which
      reads a text file of distances, and reformats it for use with
      spacer.
    </li>
    <li>
      <a href = "spaeth/spaeth.html">
      spaeth</a>,
      a library which
      performs the cluster analysis of data;
    </li>
    <li>
      <a href = "spaeth2/spaeth2.html">
      spaeth2</a>,
      a library which
      performs the cluster analysis of data;
    </li>
    <li>
      <a href = "sparse_grid_cc/sparse_grid_cc.html">
      sparse_grid_cc</a>,
      a library 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_hw/sparse_grid_hw.html">
      sparse_grid_hw</a>,
      a library which
      creates sparse grids based on Gauss-Legendre, Gauss-Hermite,
      Gauss-Patterson, or a nested variation of Gauss-Hermite rules,
      by Florian Heiss and Viktor Winschel.
    </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 quadrature 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
      can analyze and create 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 = "sparsekit/sparsekit.html">
      sparsekit</a>,
      a library which
      performs sparse matrix operations, by Yousef Saad;
    </li>
    <li>
      <a href = "sparsepak/sparsepak.html">
      sparsepak</a>,
      a library which
      forms an obsolete version of the Waterloo Sparse Matrix Package;
    </li>
    <li>
      <a href = "specfun/specfun.html">
      specfun</a>,
      a library which
      computes special functions, including Bessel I, J, K and Y functions,
      and the Dawson, E1, EI, Erf, Gamma, Psi/Digamma functions,
      by William Cody and Laura Stoltz;
    </li>
    <li>
      <a href = "special_functions/special_functions.html">
      special_functions</a>,
      a library which
      computes special functions,
      by Shanjie Zhang, Jianming Jin;
    </li>
    <li>
      <a href = "sphere_cvt/sphere_cvt.html">
      sphere_cvt</a>,
      a program which
      generates a mesh of well-separated points on the unit sphere using 
      Centroidal Voronoi Tessellation (CVT) ideas.
    </li>
    <li>
      <a href = "sphere_delaunay/sphere_delaunay.html">
      sphere_delaunay</a>,
      a program which
      reads a file containing the coordinates of points on the unit sphere,
      computes the Delaunay triangulation,
      and outputs a PostScript (PS) file of the image;
    </li>
    <li>
      <a href = "sphere_design_rule/sphere_design_rule.html">
      sphere_design_rule</a>,
      a library which
      defines spherical designs for quadrature on the sphere;
    </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_monte_carlo/sphere_triangle_monte_carlo.html">
      sphere_triangle_monte_carlo</a>,
      a library which
      estimates the integral of a function over a spherical triangle using 
      the Monte Carlo method.
    </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 using quadrature.
    </li>
    <li>
      <a href = "sphere_voronoi/sphere_voronoi.html">
      sphere_voronoi</a>,
      a program which
      reads a file containing the coordinates of points on the unit sphere,
      computes the Voronoi diagram,
      and outputs a PostScript (PS) file of the image;
    </li>
    <li>
      <a href = "spiral_data/spiral_data.html">
      spiral_data</a>,
      a program which
      returns sample values of a velocity
      vector field that satisfies the continuity equation;
    </li>
    <li>
      <a href = "spline/spline.html">
      spline</a>,
      a library which
      interpolates and approximates via splines;
    </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 = "ss_gd_align/ss_gd_align.html">
      ss_gd_align</a>,
      a library which
      carries out a sequence-to-sequence global alignment using a distance matrix.
    </li>
    <li>
      <a href = "ss_gg_align/ss_gg_align.html">
      ss_gg_align</a>,
      a library which
      carries out a sequence-to-sequence global alignment using an affine gap penalty.
    </li>
    <li>
      <a href = "ss_lg_align/ss_lg_align.html">
      ss_lg_align</a>,
      a library which
      carries out a sequence-to-sequence local alignment using an affine gap penalty.
    </li>
    <li>
      <a href = "ss_qg_align/ss_qg_align.html">
      ss_qg_align</a>,
      a library which
      carries out a sequence-to-sequence quasi-global alignment using an affine gap penalty.
    </li>
    <li>
      <a href = "st_io/st_io.html">
      st_io</a>,
      a library which
      reads and writes sparse linear systems stored in the Sparse Triplet (ST) format.
    </li>
    <li>
      <a href = "st_to_dsp/st_to_dsp.html">
      st_to_dsp</a>,
      a program which
      converts a sparse matrix file from Sparse Triplet (ST) format (zero-based indices) to
      DSP format (one-based indices);
    </li>
    <li>
      <a href = "st_to_hb/st_to_hb.html">
      st_to_hb</a>,
      a program which
      converts a sparse matrix file from Sparse Triplet (ST) format to
      Harwell Boeing (HB) format;
    </li>
    <li>
      <a href = "starpac/starpac.html">
      starpac</a>,
      a library which
      carries out statistical data analysis.
    </li>
    <li>
      <a href = "steam/steam.html">
      steam</a>,
      a library which
      is based on the National Bureau of Standards (NBS) steam table package;
    </li>
    <li>
      <a href = "steam_interact/steam_interact.html">
      steam_interact</a>,
      a program which
      queries the National Bureau of Standards (NBS) steam table package;
    </li>
    <li>
      <a href = "stla_io/stla_io.html">
      stla_io</a>,
      a library which
      reads and writes the 3D graphics information
      in an ASCII stereolithography (STL) file;
    </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 (SDE).
    </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 = "stripack/stripack.html">
      stripack</a>,
      a library which
      computes Delaunay
      triangulations and Voronoi diagrams on a sphere,
      a version of ACM TOMS algorithm 772, 
      by Robert Renka.
    </li>
    <li>
      <a href = "stripack_interactive/stripack_interactive.html">
      stripack_interactive</a>,
      a program which
      reads a file of points on a sphere,
      determines the Delaunay triangulation, and writes out a file
      describing the triangulation.
    </li>
    <li>
      <a href = "stripper/stripper.html">
      stripper</a>,
      a program which
      can perform a variety of file modifications such as
      capitalization, removal of control characters, and so on;
    </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 = "subanagram/subanagram.html">
      subanagram</a>,
      a program which
      finds words which are anagrams formed from some of the letters
      of a given master word.
    </li>
    <li>
      <a href = "subpak/subpak.html">
      subpak</a>,
      a library which
      implements a wide variety of operations
      on real and integer vectors and matrices;
    </li>
    <li>
      <a href = "subset/subset.html">
      subset</a>,
      a library which
      ranks, unranks, and generates random
      subsets, combinations, permutations, and so on;
    </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 collection of data vectors,
      extracting dominant modes;
    </li>
    <li>
      <a href = "svd_basis_weight/svd_basis_weight.html">
      svd_basis_weight</a>,
      a program which
      applies the singular value decomposition (SVD) to a collection of weighted data vectors,
      extracting 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 = "sweep2_delaunay_eps/sweep2_delaunay_eps.html">
      sweep2_delaunay_eps</a>,
      a program which
      makes an Encapsulated PostScript (EPS) plot from the Delaunay triangulation information 
      that is output by sweep2;
    </li>
    <li>
      <a href = "sweep2_voronoi_eps/sweep2_voronoi_eps.html">
      sweep2_voronoi_eps</a>,
      a program which
      makes an Encapsulated PostScript (EPS) plot of the Voronoi diagram information 
      that is output by sweep2;
    </li>
    <li>
      <a href = "table_barplot_ppma/table_barplot_ppma.html">
      table_barplot_ppma</a>,
      a program which
      reads a table file
      of N rows of M numbers and makes a bar graph in the
      ASCII Portable Pixel Map (PPM) file format;
    </li>
    <li>
      <a href = "table_border/table_border.html">
      table_border</a>,
      a program which
      reads a table file representing a 2D
      array and adds a boundary layer of zero values.
    </li>
    <li>
      <a href = "table_columns/table_columns.html">
      table_columns</a>,
      a program which
      reads a table file of N points
      in M dimensions and creates a new file by copying various
      columns, with repetition and shuffling;
    </li>
    <li>
      <a href = "table_columns_permute/table_columns_permute.html">
      table_columns_permute</a>,
      a program which
      reads a table file
      where each line has COL_NUM values, and permutes the columns
      according to the user's prescription;
    </li>
    <li>
      <a href = "table_delaunay/table_delaunay.html">
      table_delaunay</a>,
      a program which
      reads a table file of N
      points in 2 dimensions and writes out the Delaunay triangulation;
    </li>
    <li>
      <a href = "table_graph_code/table_graph_code.html">
      table_graph_code</a>,
      a program which
      reads a table file
      representing the adjacency matrix of a graph, and computes the graph code.
    </li>
    <li>
      <a href = "table_histogram/table_histogram.html">
      table_histogram</a>,
      a program which
      reads a table file and histograms
      each column.
    </li>
    <li>
      <a href = "table_io/table_io.html">
      table_io</a>,
      a library which
      reads and writes a set of data as a table file.
    </li>
    <li>
      <a href = "table_latinize/table_latinize.html">
      table_latinize</a>,
      a program which
      reads a table file of N points in
      M dimensions and adjusts it to form a Latin hypercube.
    </li>
    <li>
      <a href = "table_merge/table_merge.html">
      table_merge</a>,
      a program which
      reads a table file of N points in
      M dimensions, removes duplicates or points that are closer
      than some tolerance, and writes the reduced set of points
      to a file.
    </li>
    <li>
      <a href = "table_orthonormalize/table_orthonormalize.html">
      table_orthonormalize</a>,
      a program which
      reads a table file of N points in
      M dimensions and orthonormalizes the columns;
    </li>
    <li>
      <a href = "table_quality/table_quality.html">
      table_quality</a>,
      a program which
      reads a table file of N points in
      M dimensions and computes the uniformity of the placement of
      the points;
    </li>
    <li>
      <a href = "table_record_match/table_record_match.html">
      table_record_match</a>,
      a program which
      reads a table file and seeks the
      closest pair of records;
    </li>
    <li>
      <a href = "table_scale/table_scale.html">
      table_scale</a>,
      a program which
      reads a table file of N points in
      M dimensions and creates a copy with every entry scaled by a
      given scale vector.
    </li>
    <li>
      <a href = "table_shift/table_shift.html">
      table_shift</a>,
      a program which
      reads a table file
      of N points in M dimensions, creates a copy with every entry shifted by a given
      displacement vector.
    </li>
    <li>
      <a href = "table_stats/table_stats.html">
      table_stats</a>,
      a program which
      reads a table file of N points in M dimensions, 
      and prints statistics, such as the average, maximum, minimum, and range.
    </li>
    <li>
      <a href = "table_tet_mesh/table_tet_mesh.html">
      table_tet_mesh</a>,
      a program which
      reads a table file of N points in 3 dimensions and produces a tet mesh;
    </li>
    <li>
      <a href = "table_top/table_top.html">
      table_top</a>,
      a program which
      is given a table file of M-dimensional points, makes plots of all
      coordinate pairs;
    </li>
    <li>
      <a href = "table_unborder/table_unborder.html">
      table_unborder</a>,
      a program which
      reads a table file representing a
      2D array, and removes the boundary values.
    </li>
    <li>
      <a href = "table_uniform_noise/table_uniform_noise.html">
      table_uniform_noise</a>,
      a program which
      reads a table file of N points in
      M dimensions, creates a copy with scaled uniform noise added
      to each entry.
    </li>
    <li>
      <a href = "table_voronoi/table_voronoi.html">
      table_voronoi</a>,
      a program which
      reads a table file
      of N points in 2 dimensions, calls geompack to get Delaunay
      triangulation information, and then determines
      and prints the Voronoi diagram information;
    </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 = "tec_io/tec_io.html">
      tec_io</a>,
      a library which
      reads or writes a TECPLOT graphics file
      of finite element information;
    </li>
    <li>
      <a href = "tec_to_fem/tec_to_fem.html">
      tec_to_fem</a>,
      a program which
      reads a TECPLOT graphics file
      of finite element information and writes an equivalent
      set of FEM files
      (node coordinates/elements/node data);
    </li>
    <li>
      <a href = "tec_to_obj/tec_to_obj.html">
      tec_to_obj</a>,
      a program which
      reads a TECPLOT graphics file of finite element information and 
      writes an equivalent Alias OBJ graphics file;
    </li>
    <li>
      <a href = "tec_to_obj2/tec_to_obj2.html">
      tec_to_obj2</a>,
      a program which
      reads a TECPLOT graphics file
      of finite element information and writes an equivalent
      Alias OBJ file;
      This is a minor revision of tec_to_obj, which
      tries to handle multiple zones.
    </li>
    <li>
      <a href = "tec_write/tec_write.html">
      tec_write</a>,
      a library which
      writes a TECPLOT graphics file.
    </li>
    <li>
      <a href = "templates/templates.html">
      templates</a>,
      a library which
      forms basic implementations of
      iterative methods for solving large sparse linear systems;
    </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_con/test_con.html">
      test_con</a>,
      a library which
      implements test problems for
      numerical continuation.
    </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.
    </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(x)) 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_mesh/test_mesh.html">
      test_mesh</a>,
      a library which
      implements some sample 2D meshes.
    </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_nls/test_nls.html">
      test_nls</a>,
      a library which
      implements nonlinear least squares test problems.
    </li>
    <li>
      <a href = "test_nonlin/test_nonlin.html">
      test_nonlin</a>,
      a library which
      implements test problems for the solution
      of systems of nonlinear equations.
    </li>
    <li>
      <a href = "test_ode/test_ode.html">
      test_ode</a>,
      a library which
      implements tests for solvers of systems of
      ordinary differential equations (ODE's).
    </li>
    <li>
      <a href = "test_opt/test_opt.html">
      test_opt</a>,
      a library which
      implements test problems for optimization
      of a scalar function of several variables.
    </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_tet_mesh/test_tet_mesh.html">
      test_tet_mesh</a>,
      a library which
      implements test problems for
      tetrahedralization or meshing of arbitrary regions in 3 dimensions.
    </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_triangulation/test_triangulation.html">
      test_triangulation</a>,
      a library which
      implements test problems for
      triangularization or meshing of arbitrary regions in 2 dimensions.
    </li>
    <li>
      <a href = "test_values/test_values.html">
      test_values</a>,
      a library which
      stores 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
      carries out various tasks associated 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 TRI_SURFACE
      files containing the nodes and elements defining this surface.
    </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 information about a tet mesh of points in 3D
      and computes various quality measures;
    </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 all the tetrahedrons in 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 = "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_2d/tiler_2d.html">
      tiler_2d</a>,
      a program which
      uses blending to map data into a 2D region;
    </li>
    <li>
      <a href = "tiler_3d/tiler_3d.html">
      tiler_3d</a>,
      a program which
      uses blending to map data into a 3D region;
    </li>
    <li>
      <a href = "timer/timer.html">
      timer</a>,
      a library which
      implements various real time and CPU time tests.
    </li>
    <li>
      <a href = "timestamp/timestamp.html">
      timestamp</a>,
      a library which
      prints the current YMDHMS date as a timestamp.
    </li>
    <li>
      <a href = "toeplitz/toeplitz.html">
      toeplitz</a>,
      a library which
      implements Toeplitz matrix system solvers.
    </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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 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 FORTRAN90 version of ACM TOMS algorithm 446,
      by Roger Broucke.
    </li>
    <li>
      <a href = "toms453/toms453.html">
      toms453</a>,
      a library which
      determines the abscissas and weights for a
      Gaussian quadrature formula for Bromwich's integral;
      this is a FORTRAN90 version of ACM TOMS algorithm 453.
    </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 FORTRAN90 version of ACM TOMS algorithm 462.
    </li>
    <li>
      <a href = "toms526/toms526.html">
      toms526</a>,
      a library which
      interpolates scattered bivariate data;
      this is a FORTRAN90 version of ACM TOMS algorithm 526,
      by Hiroshi Akima.
    </li>
    <li>
      <a href = "toms552/toms552.html">
      toms552</a>,
      a library which
      computes a solution of a constrained linear system.
      of a scalar function,
      this is a FORTRAN90 version of ACM TOMS algorithm 552;
    </li>
    <li>
      <a href = "toms611/toms611.html">
      toms611</a>,
      a library which
      implements unconstrained minimization
      of a scalar function;
      this is a FORTRAN90 version of ACM TOMS algorithm 611,
      by David Gay.
    </li>
    <li>
      <a href = "toms647/toms647.html">
      toms647</a>,
      a library which
      evaluates the Faure, Halton, and Sobol quasirandom sequences;
      this is a FORTRAN90 version of ACM TOMS algorithm 647;
    </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 FORTRAN90 version of ACM TOMS algorithm 655.
    </li>
    <li>
      <a href = "toms659/toms659.html">
      toms659</a>,
      a library which
      computes elements of the Sobol quasirandom sequence;
      this is a FORTRAN90 version of ACM TOMS algorithm 659.
    </li>
    <li>
      <a href = "toms660/toms660.html">
      toms660</a>,
      a library which
      takes scattered data in 2D and creates an interpolating function F(X,Y),
      called qshep2d;
      this is a FORTRAN90 version of ACM TOMS algorithm 660,
      by Robert Renka.
    </li>
    <li>
      <a href = "toms661/toms661.html">
      toms661</a>,
      a library which
      takes scattered data in 3D and creates an interpolating function F(X,Y,Z),
      called qshep3d;
      this is a FORTRAN90 version of ACM TOMS algorithm 661,
      by Robert Renka.
    </li>
    <li>
      <a href = "toms672/toms672.html">
      toms672</a>,
      a library which
      generates an interpolatory quadrature rule of highest possible order,
      given a set of preassigned abscissas;
      this library is commonly called EXTEND;
      this is a FORTRAN90 version of ACM TOMS algorithm 672.
    </li>
    <li>
      <a href = "toms708/toms708.html">
      toms708</a>,
      a library which
      evaluates the incomplete Beta function,
      by Armido Didonato, Alfred Morris, Jr;
      this is a FORTRAN90 version of ACM TOMS algorithm 708;
    </li>
    <li>
      <a href = "toms726/toms726.html">
      toms726</a>,
      a library which
      computes recursion coefficients for orthogonal polynomials,
      and the abscissa and weights for related quadrature rules;
      this library is commonly called ORTHPOL;
      this is a FORTRAN90 version of ACM TOMS algorithm 726.
    </li>
    <li>
      <a href = "toms738/toms738.html">
      toms738</a>,
      a library which
      evaluates Niederreiter's quasirandom sequence;
      this is a FORTRAN90 version of ACM TOMS algorithm 738;
    </li>
    <li>
      <a href = "toms757/toms757.html">
      toms757</a>,
      a library which
      evaluates uncommon special functions, by Allan McLeod.
      this is a FORTRAN90 version of ACM TOMS algorithm 757;
    </li>
    <li>
      <a href = "toms790/toms790.html">
      toms790</a>,
      a library which
      computes an interpolating function to a set of scattered data in the plane;
      this library is commonly called CSHEP2D;
      by Robert Renka;
      this is a FORTRAN90 version of ACM TOMS algorithm 790.
    </li>
    <li>
      <a href = "toms792/toms792.html">
      toms792</a>,
      a library which
      tests functions that interpolate scattered data in the plane;
      by Robert Renka;
      this is a FORTRAN90 version of ACM TOMS algorithm 792.
    </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_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 = "triangulation/triangulation.html">
      triangulation</a>,
      a library which
      computes, plots and manipulates the triangulation of a set of
      points in 2D;
    </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_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 = "tripack/tripack.html">
      tripack</a>,
      a library which
      computes constrained Delaunay triangulation
      in the plane, ACM TOMS algorithm 751,
      by Robert Renka;
    </li>
    <li>
      <a href = "tsp_io/tsp_io.html">
      tsp_io</a>,
      a library which
      reads or writes files in the TSP format used for examples of
      the traveling salesperson problem.
    </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
      computes elements of a simple pseudorandom number sequence;
    </li>
    <li>
      <a href = "uniform_dataset/uniform_dataset.html">
      uniform_dataset</a>,
      a program which
      creates a uniform random dataset;
    </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
      computes elements of
      the van der Corput one-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 dataset of the van der Corput one-dimensional quasirandom sequence;
    </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_i