C Codes

1. allocatable_array_test
2. alpert_rule, a C code which sets up an Alpert quadrature rule for functions which are regular, log(x) singular, or 1/sqrt(x) singular.
3. alpert_rule_test
4. analemma, a C code which evaluates the equation of time, a formula for the difference between the uniform 24 hour day and the actual position of the sun, creating data files that can be plotted with gnuplot(), based on a C code by Brian Tung.
5. analemma_test
6. annulus_monte_carlo, a C code which uses the Monte Carlo method to estimate the integral of a function over the interior of a circular annulus in 2D.
7. annulus_monte_carlo_test
8. annulus_rule, a C code which computes a quadrature rule for estimating integrals of a function over the interior of a circular annulus in 2D.
9. annulus_rule_test
10. args, a C code which reports the command line arguments with which it was invoked;
11. args_test
12. asa005, a C code which evaluates the Cumulative Density Function (CDF) of the noncentral T Probability Density Function (PDF), by BE Cooper. This is a version of Applied Statistics Algorithm 5;
13. asa005_test
14. asa006, a C code which computes the Cholesky factorization of a symmetric positive definite (SPD) matrix, by Michael Healy. This is a version of Applied Statistics Algorithm 6;
15. asa006_test
16. asa007, a C code which computes the inverse of a symmetric positive definite (SPD) matrix, by Michael Healy. This is a version of Applied Statistics Algorithm 7.
17. asa007_test
18. asa032, a C code which evaluates the incomplete Gamma function, by G Bhattacharjee. This is a version of Applied Statistics Algorithm 32.
19. asa032_test
20. asa047, a C code which minimizes a scalar function of several variables using the Nelder-Mead algorithm, by R ONeill. This is a version of Applied Statistics Algorithm 47.
21. asa047_test
22. asa053, a C code which produces sample matrices from the Wishart distribution, by William Smith and Ronald Hocking. This is a version of Applied Statistics Algorithm 53.
23. asa053_test
24. asa058, a C code which implements the K-means data clustering algorithm, by David Sparks. This is a version of Applied Statistics Algorithm 58.
25. asa058_test
26. asa063, a C code which evaluates the incomplete Beta function, by KL Majumder and G Bhattacharjee. This is a version of Applied Statistics Algorithm 63.
27. asa063_test
28. asa066, a C code which evaluates the Cumulative Density Function (CDF) of the normal probability distribution, by David Hill. This is a version of Applied Statistics Algorithm 66.
29. asa066_test
30. asa076, a C code which evaluates the Owen T function, needed to compute the Cumulative Density Function (CDF) of the noncentral T distribution, by Young and Minder. This is a version of Applied Statistics Algorithm 76.
31. asa076_test
32. asa082, a C code which computes the determinant of an orthogonal matrix; this is a version of Applied Statistics Algorithm 82, by J C Gower.
33. asa082_test
34. asa091, a C code which evaluates the percentage points of the Chi-Squared distribution, by Best and Roberts. This is a version of Applied Statistics Algorithm 91.
35. asa091_test
36. asa103, a C code which evaluates the digamma or psi function, by Jose Bernardo. This is a version of Applied Statistics Algorithm 103.
37. asa103_test
38. asa109, a C code which inverts the incomplete Beta function, by Cran, Martin and Thomas. This is a version of Applied Statistics Algorithm 109.
39. asa109_test
40. asa111, a C code which evaluates the percentage points of the normal distribution, by Beasley and Springer. This is a version of Applied Statistics Algorithm 111.
41. asa111_test
42. asa113, a C code which implements a clustering algorithm using transfers and swaps, by Banfield and Bassill. This is a version of Applied Statistics Algorithm 113.
43. asa113_test
44. asa121, a C code which evaluates the trigamma function, by BE Schneider. This is a version of Applied Statistics Algorithm 121.
45. asa121_test
46. asa136, a C code which implements a clustering algorithm, by Hartigan and Wong. This is a version of Applied Statistics Algorithm 136.
47. asa136_test
48. asa144, a C code which randomly generates an RxC contingency table, by James Boyett. This is a version of Applied Statistics Algorithm 144.
49. asa144_test
50. asa147, a C code which evaluates the incomplete Gamma function, by Chi Leung Lau. This is a version of Applied Statistics Algorithm 147.
51. asa147_test
52. asa152, a C code which evaluates the Probability Density Function (PDF) and Cumulative Density Function (CDF) associated with the hypergeometric distribution, by Richard Lund; this is a version of Applied Statistics Algorithm 152.
53. asa152_test
54. asa159, a C code which randomly generates an RxC contingency table, by Michael Patefield; This is a version of Applied Statistics Algorithm 159.
55. asa159_test
56. asa172, a C code which generates all M-dimensional indices in a given range, simulating the behavior of an arbitrary number of nested loops, by OFlaherty and MacKenzie. This is a version of Applied Statistics Algorithm 172.
57. asa172_test
58. asa183, a C code which implements a random number generator (RNG), by Wichman and Hill. This is a version of Applied Statistics Algorithm 183.
59. asa183_test
60. asa226, a C code which evaluates the Cumulative Density Function (CDF) of the noncentral Beta distribution, by Russell Lenth. This is a version of Applied Statistics Algorithm 226.
61. asa226_test
62. asa239, a C code which evaluates the incomplete Gamma function, by Shea. This is a version of Applied Statistics Algorithm 239.
63. asa239_test
64. asa241, a C code which evaluates the percentage points of the normal distribution, by Michael Wichura. This is a version of Applied Statistics Algorithm 241.
65. asa241_test
66. asa243, a C code which evaluates the Cumulative Density Function (CDF) of the noncentral T distribution, by Russell Lenth; this is a version of Applied Statistics Algorithm 243.
67. asa243_test
68. asa245, a C code which evaluates the logarithm of the Gamma function, by Allan Mcleod; this is a version of Applied Statistics Algorithm 245.
69. asa245_test
70. asa266, a C code which evaluates various properties of the Dirichlet Probability Density Function (PDF); this is a version of Applied Statistics Algorithm 266;
71. asa266_test
72. asa299, a C code which computes the lattice points in an M-dimensional simplex, by Chasalow and Brand; this is a version of Applied Statistics Algorithm 299;
73. asa299_test
74. asa310, a C code which computes the Cumulative Density Function (CDF) of the noncentral Beta distribution, by Chattamvelli and Shanmugam; this is a version of Applied Statistics Algorithm 310.
75. asa310_test
76. asa314, a C code which computes the inverse of a matrix whose elements are subject to modulo arithmetic, by Roger Payne. This is a version of Applied Statistics Algorithm 314;
77. asa314_test
78. ascii_to_mri, a C code which restores MRI data to its original binary format, having been previously converted to an ASCII text file.
79. ascii_to_mri_test
80. atbash, a C code which applies the Atbash substitution cipher to a string of text.
81. atbash_test
82. backtrack_binary_rc, a C code which carries out a backtrack search for a set of binary decisions, using reverse communication (RC).
83. backtrack_binary_rc_test
84. backward_euler, a C code which solves one or more ordinary differential equations (ODE) using the (implicit) backward Euler method, using a version of fsolve() for the implicit equation.
85. backward_euler_test
86. ball_grid, a C code which computes a grid of points over the interior of the unit ball in 3D.
87. ball_grid_test
88. ball_integrals, a C code which returns the exact value of the integral of any monomial over the interior of the unit ball in 3D.
89. ball_integrals_test
90. ball_monte_carlo, a C code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit ball in 3D;
91. ball_monte_carlo_test
92. bank, a C code which computes the check digit associated with a US Bank Routing Number check digit, or reports whether a 9-digit code is actually valid.
93. bank_test
94. barycentric_interp_1d, a C code 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.
95. barycentric_interp_1d_test
96. bdf2, a C code which solves one or more ordinary differential equations (ODE) using the (implicit) backward difference formula of order 2 (BDF2), using fsolve() to solve the implicit equation.
97. bdf2_test
98. bellman_ford, a C code which implements the Bellman-Ford algorithm for finding the shortest distance from a given node to all other nodes in a directed graph whose edges have been assigned real-valued lengths.
99. bellman_ford_test
100. bernstein_polynomial, a C code which evaluates the Bernstein polynomials;
101. bernstein_polynomial_test
102. besselj, a C code which evaluates Bessel J functions of noninteger order;
103. besselj_test
104. beta_nc, a C code which evaluates the cumulative density function (CDF) of the noncentral Beta distribution;
105. beta_nc_test
106. biharmonic_exact, a C code which evaluates exact solutions w(x,y) to the biharmonic equation del^2 w = 0 or wxxxx + 2 wxxyy + wyyyy = 0
107. biharmonic_exact_test
108. bisection, a C code which applies the bisection method to seek a root of f(x) over a change-of-sign interval a <= x <= b.
109. bisection_test
110. bisection_integer, a C code which seeks an integer solution to the equation F(X)=0, using bisection within a user-supplied change of sign interval [A,B].
111. bisection_integer_test
112. bisection_rc, a C code which seeks a solution to the equation F(X)=0 using bisection within a user-supplied change of sign interval [A,B]. The procedure is written using reverse communication (RC).
113. bisection_rc_test
114. black_scholes, a C code which implements some simple approaches to the Black-Scholes option valuation theory, by Desmond Higham.
115. black_scholes_test
116. blas0, a C code which contains auxilliary functions for the Basic Linear Algebra Subprograms (BLAS).
117. blas0_test
118. blas1_d, a C code of the Level 1 Basic Linear Algebra Subprograms (BLAS), using double precision real arithmetic;
119. blas1_d_test
120. blas1_z, a C code of the Level 1 Basic Linear Algebra Subprograms (BLAS), using double precision complex arithmetic;
121. blas1_z_test
122. blas2_d, a C code which constitutes the Level 2 Basic Linear Algebra Subprograms (BLAS), using double precision real arithmetic.
123. blas2_d_test
124. blas3_d, a C code which constitutes the Level 3 Basic Linear Algebra Subprograms (BLAS) for matrix-matrix operations, using double precision real arithmetic.
125. blas3_d_test
126. blend, a C code which carries out 1D/2D/3D blending interpolation;
127. blend_test
128. box_behnken, a C code which computes a Box-Behnken design, that is, a set of arguments to sample the behavior of a function of multiple parameters;
129. box_behnken_test
130. brc_data, a C code which creates a file of randomly generated temperature readings to be associated with weather stations at 413 world cities. A file like this, with 1 billion records, is used for the billion record challenge (BRC).
131. brc_data_test
132. brc_naive, a C code which reads a file of randomly generated temperature readings, associated with weather stations at 413 world cities, and computes the minimum, mean, and maximum temperature for each weather station. It also reports the total execution time. Processing such a data file with one billion records is the substance of the billion record challenge (BRC).
133. brc_naive_test
134. brownian_motion_simulation, a C code which simulates Brownian motion in an M-dimensional region, creating graphics files for processing by gnuplot().
135. brownian_motion_simulation_test
136. burgers_exact, a C code which evaluates exact solutions of the time-dependent 1D viscous Burgers equation.
137. burgers_exact_test
138. bvec, a C code which demonstrates how signed integers can be stored as binary vectors, and arithmetic can be performed on them.
139. bvec_test
140. c_test, a C code which illustrates some of the features of the C programming language.
141. c_arrays_test, a C code which shows how to define, allocate, index and delete vectors, matrices and higher dimensional arrays.
142. c_calls_f77_test, a C code which illustrates how a C program can call a FORTRAN77 subroutine.
143. c_calls_f90_test, a C code which illustrates how a C program can call a FORTRAN90 subroutine.
144. c_combinatorics, a C code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.
145. c_exact, a C code which evaluates exact solutions to a few selected examples of ordinary differential equations (ODE) and partial differential equations (PDE).
146. c_files_test, a C code which illustrates the use of files.
147. c_intrinsics_test, a C code which illustrates the use of intrinsic functions supplied by the C language.
148. c_mistake, a C code which illustrates some simple but devious programming mistakes in C.
149. c_monte_carlo, a C code which uses Monte Carlo sampling to estimate areas and integrals.
150. c_operators_test
151. c_random_test
152. c_rule, a C code which computes a quadrature rule which estimates the integral of a function f(x), which might be defined over a one dimensional region (a line) or more complex shapes such as a circle, a triangle, a quadrilateral, a polygon, or a higher dimensional region, and which might include an associated weight function w(x).
153. c_simulation, a C code which uses simulation to study card games, contests, and other processes which have a random element. Usually, the purpose is to try to predict the average behavior of the system over many trials.
154. c8_complex_lib, a C code which defines a double precision complex (C8) variable as a structure, and implements certain corresponding elementary functions.
155. c8_complex_lib_test
156. c8lib, a C code which implements certain elementary functions for double precision complex (C8) variables using the C99 standard "double complex" datatype.
157. c8lib_test
158. c8poly, a C code which operates on complex polynomials.
159. c8poly_test
160. caesar, a C code which applies a Caesar Shift Cipher to a string of text.
161. caesar_test
162. calpak, a C code which computes various simple calendrical quantities. It can work with various calendars including Egyptian, English, French Revolutionary, Gregorian, Julian, and Julian Ephemeris Date. It can convert a date from one calendar to another. It can return the day of the week for a given date. It can convert from day-number/year to day/month/year format. It can calculate the time difference between two dates.
163. calpak_test
164. candy_count, a C code which counts the types of candy in a rectangular container, which might be a vector, matrix, or 3D box. The candy is assumed to have C possible types, and to have been entered into the container in a cycle that begins with type 1. While the vector case is easy, it is already difficult to come up with a general formula for the MxN matrix case.
165. candy_count_test
166. cauchy_principal_value, a C code which uses Gauss-Legendre quadrature to estimate the Cauchy Principal Value (CPV) of certain singular integrals.
167. cauchy_principal_value_test
168. cblas_test, a C code which calls cblas(), which implements the Basic Linear Algebra Subprograms.
169. ccn_rule, a C code which defines a one of a sequence of Clenshaw Curtis Nested (CCN) quadrature rules of any order.
170. ccn_rule_test
171. ccs_io, a C code which reads and writes sparse linear systems stored in the Compressed Column Storage (CCS) format.
172. ccs_io_test
173. ccs_to_st, a C code which converts a sparse matrix from Compressed Column Storage (CCS) to sparse triplet (ST) format.
174. ccs_to_st_test
175. cdflib, a C code which evaluates the cumulative density function (CDF), inverse CDF, and certain other inverse functions, for distributions including beta, binomial, chi-square, noncentral chi-square, F, noncentral F, gamma, negative binomial, normal, Poisson, and students T, by Barry Brown, James Lovato, Kathy Russell.
176. cdflib_test
177. cell, a C code which defines a cell array, a generalization of an array which compactly stores and retrieves vector or matrix data of varying size, such as the rows of a triangular matrix.
178. cell_test
179. cellular_automaton, a C code which demonstrates the 1D Cellular Automaton known as rule #30.
180. cellular_automaton_test
181. cg, a C code which implements a simple version of the conjugate gradient (CG) method for solving a system of linear equations of the form A*x=b, suitable for situations in which the matrix A is positive definite, only real, positive eigenvalues and symmetric.
182. cg_test
183. cg_rc, a C code which implements the conjugate gradient (CG) method for solving a positive definite sparse linear system A*x=b, using reverse communication (RC).
184. cg_rc_test
185. change_dynamic, a C code which uses dynamic programming to solve the change making problem, in which a given sum is to be formed using coins of various denominations.
186. change_dynamic_test
187. chebyshev, a C code which computes the Chebyshev interpolant or approximant to a given function over an interval.
188. chebyshev_test
189. chebyshev_interp_1d, a C code which determines the combination of Chebyshev polynomials which interpolates a set of data, so that p(x(i)) = y(i).
190. chebyshev_interp_1d_test
191. chebyshev_polynomial, a C code which considers the Chebyshev polynomials T(i,x), U(i,x), V(i,x) and W(i,x). Functions are provided to evaluate the polynomials, determine their zeros, produce their polynomial coefficients, produce related quadrature rules, project other functions onto these polynomial bases, and integrate double and triple products of the polynomials.
192. chebyshev_polynomial_test
193. chebyshev_series, a C code which evaluates a Chebyshev series approximating a function f(x), while efficiently computing one, two or three derivatives of the series, which approximate f'(x), f''(x), and f'''(x), by Manfred Zimmer.
194. chebyshev_series_test
195. chrpak, a C code which manipulates characters and strings;
196. chrpak_test
197. circle_arc_grid, a C code which computes grid points along a circular arc.
198. circle_arc_grid_test
199. circle_integrals, a C code which returns the exact value of the integral of any monomial over the circumference of the unit circle in 2D.
200. circle_integrals_test
201. circle_monte_carlo, a C code which applies a Monte Carlo method to estimate the integral of a function along the circumference of the unit circle in 2D;
202. circle_monte_carlo_test
203. circle_rule, a C code which computes quadrature rules for the unit circle in 2D, that is, the circumference of the circle of radius 1 and center (0,0).
204. circle_rule_test
205. circle_segment, a C code which carries out computations associated with a circle segment, including height, angle, area, centroid, sampling, and quadrature, creating some graphics images using gnuplot().
206. circle_segment_test
207. clapack_test
208. clausen, a C code which evaluates a Chebyshev interpolant to the Clausen function Cl2(x).
209. clausen_test
210. clenshaw_curtis_rule, a C code which implements a Clenshaw Curtis quadrature rule;
211. clenshaw_curtis_rule_test
212. closest_pair_brute, a C code which uses brute force to solve a 2D version of the closest pair problem, which identifies the closest pair of points in a given collection.
213. closest_pair_brute_test
214. closest_point_brute, a C code which uses brute force to find the nearest of a set of N points in D dimensions to a given test point. This is sometimes called a nearest neighbor calculation.
215. closest_point_brute_test
216. cnoise, a C code which generates samples of noise obeying a 1/f^alpha power law, by Miroslav Stoyanov.
217. cnoise_test
218. collatz_recursive, a C code which demonstrates recursive programming by considering the simple Collatz 3n+1 problem.
219. collatz_recursive_test
220. colored_noise, a C code which generates samples of noise obeying a 1/f^alpha power law.
221. colored_noise_test
222. combo, a C code which ranks, unranks, enumerates, lists and randomly selects balanced sequences, cycles, graphs, Gray codes, subsets, partitions, permutations, restricted growth functions, Pruefer codes and trees.
223. combo_test
224. communicator_mpi, a C code which creates new communicators involving a subset of initial set of MPI processes in the default communicator MPI_COMM_WORLD.
225. communicator_mpi_test
226. companion_matrix, a C code which computes the companion matrix for a polynomial. The polynomial may be represented in the standard monomial basis, or as a sum of Chebyshev, Gegenbauer, Hermite, Laguerre, or Lagrange basis polynomials. All the roots of the polynomial can be determined as the eigenvalues of the corresponding companion matrix.
227. companion_matrix_test
228. compass_search, a C code which seeks the minimizer of a scalar function of several variables using compass search, a direct search algorithm that does not use derivatives.
229. compass_search_test
230. complex_numbers_test, a C code which demonstrates the declaration and use of complex numbers.
231. components, a C code which organizes contiguous cells into labeled clusters, for a 1D, 2D, or 3D array. This code has uses in image analysis and percolation simulation.
232. components_test
233. condition, a C code which implements methods of computing or estimating the condition number of a matrix.
234. condition_test
235. continued_fraction, a C code which implements some simple algorithms for dealing with simple and generalized continued fractions.
236. continued_fraction_test
237. cordic, a C code which computes a few special functions using the CORDIC algorithm.
238. cordic_test
239. correlation, a C code which contains statistical correlation functions.
240. correlation_test
241. cosine_transform, a C code which demonstrates some simple properties of the discrete cosine transform (DCT).
242. cosine_transform_test
243. csparse, a C code which carries out the direct solution of sparse linear systems, by Timothy Davis.
244. csparse_test
245. cube_arbq_rule, a C code which returns quadrature rules, with exactness up to total degree 15, over the interior of the symmetric cube in 3D, by Hong Xiao and Zydrunas Gimbutas.
246. cube_arbq_rule_test
247. cube_exactness, a C code which investigates the polynomial exactness of quadrature rules over the interior of a cube in 3D.
248. cube_exactness_test
249. cube_felippa_rule, a C code which returns a Felippa quadrature rules for approximating integrals over the interior of a cube in 3D.
250. cube_felippa_rule_test
251. cube_grid, a C code which computes a grid of points over the interior of a cube in 3D.
252. cube_grid_test
253. cube_integrals, a C code which returns the exact value of the integral of any monomial over the interior of the unit cube in 3D.
254. cube_integrals_test
255. cube_monte_carlo, a C code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit cube in 3D.
256. cube_monte_carlo_test
257. cuda_loop, a C code which shows how, in a CUDA program running on a Graphics Processing Unit (GPU), the choice of block and thread factors determines the allocation of tasks to processors.
258. cuda_loop_test
259. cycle_brent, a C code which carries out an iterated function evaluation, and seeks to determine the nearest element of a cycle, and the cycle length, using the Brent method.
260. cycle_brent_test
261. cycle_floyd, a C code which carries out an iterated function evaluation, and seeks to determine the nearest element of a cycle, and the cycle length, using the Floyd method.
262. cycle_floyd_test
263. cyclic_reduction, a C code which solves a tridiagonal linear system using cyclic reduction;
264. cyclic_reduction_test
265. differ, is given function values at equally spaced locations, and the order of a derivative, and uses the finite difference method (FDM) to compute a linear combination of these function values which approximated that derivative.
266. differ_test
267. dijkstra, a C code which implements a simple version of the Dijkstra minimum distance algorithm for graphs.
268. dijkstra_test
269. dijkstra_openmp, a C code which uses OpenMP to parallelize a simple example of the Dijkstra minimum distance algorithm for graphs.
270. dijkstra_openmp_test
271. discrete_pdf_sample_2d, a C code 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.
272. discrete_pdf_sample_2d_test
273. disk_grid, a C code which computes grid points within the interior of a disk of user specified radius and center in 2D, using gnuplot() to create an image of the grid.
274. disk_grid_test
275. disk_monte_carlo, a C code which applies a Monte Carlo method to estimate integrals of a function over the interior of the general disk in 2D;
276. disk_monte_carlo_test
277. disk_rule, a C code which computes quadrature rules for the general disk in 2D.
278. disk_rule_test
279. disk01_integrals, a C code which returns the exact value of the integral of any monomial over the interior of the unit disk in 2D.
280. disk01_integrals_test
281. disk01_monte_carlo, a C code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit disk in 2D;
282. disk01_monte_carlo_test
283. disk01_positive_monte_carlo, a C code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit positive disk in 2D;
284. disk01_positive_monte_carlo_test
285. disk01_rule, a C code which computes quadrature rules for the unit disk in 2D, that is, the interior of the circle of radius 1 and center (0,0).
286. disk01_rule_test
287. dislin_test, a C code which uses dislin() to create a variety of graphics.
288. divdif, a C code which creates, prints and manipulates divided difference polynomials from a table of values (x,f(x)). The code can compute the coefficients of the Newton and power sum forms of the interpolating polynomial. It can compute the derivative or antiderivate polynomial. It can compute the form of the Lagrange basis polynomials. It can compute the points and weights for Newton Cotes quadrature rules. It can compute the weights for a Lagrange interpolation scheme.
289. divdif_test
290. doomsday, a C code which is given the year, month and day of a date, and uses the doomsday algorithm of John Conway to determine the corresponding day of the week.
291. doomsday_test
292. dream, a C code which implements the DREAM algorithm for accelerating Markov Chain Monte Carlo (MCMC) convergence using differential evolution, using five user functions to define the problem, by Guannan Zhang.
293. dream_test
294. duel_simulation, a C code which simulates N repetitions of a duel between two players, each of whom has a known firing accuracy.
295. duel_simulation_test
296. edge, a C code which defines some test functions in 1D, 2D and 3D for the detection of edges or discontinuities, and using gnuplot() to display the curves or surfaces.
297. edge_test
298. eigs, a C code which computes the eigenvalues and eigenvectors of a matrix.
299. eigs_test
300. eispack, a C code which carries out eigenvalue computations. It includes a function to compute the singular value decomposition (SVD) of a rectangular matrix. superseded by lapack();
301. eispack_test
302. ellipse, a C code which carries out geometric calculations for ellipses, including area, distance to a point, eccentricity, perimeter, points along the perimeter, random sampling, conversion between standard and quadratic forms.
303. ellipse_test
304. ellipse_grid, a C code which computes grid points over the interior of an ellipse in 2D.
305. ellipse_grid_test
306. ellipse_monte_carlo, a C code which uses the Monte Carlo method to estimate the value of integrals over the interior of an ellipse in 2D.
307. ellipse_monte_carlo_test
308. ellipsoid, a C code which carries out geometric calculations for ellipsoids, including area, random sampling, conversion between standard and quadratic forms.
309. ellipsoid_test
310. ellipsoid_grid, a C code which computes a grid of points over the interior of an ellipsoid in 3D.
311. ellipsoid_grid_test
312. ellipsoid_monte_carlo, a C code which uses the Monte Carlo method to estimate the value of integrals over the interior of an ellipsoid in M dimensions.
313. ellipsoid_monte_carlo_test
314. elliptic_integral, a C code which evaluates complete elliptic integrals of first, second and third kind, using the Carlson elliptic integral functions.
315. elliptic_integral_test
316. euler, a C code which solves one or more ordinary differential equations (ODE) using the forward Euler method.
317. euler_test
318. exactness, a C code which investigates the exactness of quadrature rules that estimate the integral of a function with a density, such as 1, exp(-x) or exp(-x^2), over an interval such as [-1,+1], [0,+oo) or (-oo,+oo).
319. exactness_test
320. f77split, a C code which splits a file containing multiple FORTRAN77 routines into separate files;
321. f77split_test
322. f90split, a C code which splits a file containing multiple FORTRAN90 routines into separate files;
323. f90split_test
324. fair_dice_simulation, a C code which simulates N tosses of 2 dice, making a histogram of the results.
325. fair_dice_simulation_test
326. fd_predator_prey, a C code which solves a pair of predator prey ordinary differential equations (ODE) using a finite difference method (FDM) approximation.
327. fd_predator_prey_test
328. fd1d_advection_diffusion_steady, a C code which applies the finite difference method (FDM) to solve the steady advection diffusion equation v*ux-k*uxx=0 in one spatial dimension, with constant velocity v and diffusivity k, writing graphics files for processing by gnuplot().
329. fd1d_advection_diffusion_steady_test
330. fd1d_advection_ftcs, a C code which applies the finite difference method (FDM) to solve the time-dependent advection equation ut = - c * ux in one spatial dimension, with a constant velocity, using the forward time centered space (FTCS) difference method, writing graphics files for processing by gnuplot().
331. fd1d_advection_ftcs_test
332. fd1d_advection_lax, a C code which applies the finite difference method (FDM) to solve the time-dependent advection equation ut = - c * ux in one spatial dimension, with a constant velocity, using the Lax method to approximate the time derivative, writing graphics files for processing by gnuplot().
333. fd1d_advection_lax_test
334. fd1d_advection_lax_wendroff, a C code which applies the finite difference method (FDM) to solve the time-dependent advection equation ut = - c * ux in one spatial dimension, with a constant velocity, using the Lax-Wendroff method to approximate the time derivative, writing graphics files for processing by gnuplot().
335. fd1d_advection_lax_wendroff_test
336. fd1d_burgers_lax, a C code which applies the finite difference method (FDM) and the Lax Wendroff method to solve the non-viscous time-dependent Burgers equation in one spatial dimension.
337. fd1d_burgers_lax_test
338. fd1d_burgers_leap, a C code which applies the finite difference method (FDM) and the leapfrog approach to solve the non-viscous time-dependent Burgers equation in one spatial dimension.
339. fd1d_burgers_leap_test
340. fd1d_bvp, a C code which applies the finite difference method (FDM) to a two point boundary value problem (BVP) in one spatial dimension.
341. fd1d_bvp_test
342. fd1d_heat_explicit, a C code which implements a finite difference method (FDM), explicit in time, of the time dependent 1D heat equation;
343. fd1d_heat_explicit_test
344. fd1d_heat_implicit, a C code which implements a finite difference method (FDM), implicit in time, of the time dependent 1D heat equation;
345. fd1d_heat_implicit_test
346. fd1d_heat_steady, a C code which implements a finite difference method (FDM) for the steady time-independent 1D heat equation;
347. fd1d_heat_steady_test
348. fd1d_wave, a C code which applies the finite difference method (FDM) to solve the time-dependent wave equation in one spatial dimension.
349. fd1d_wave_test
350. fd2d_heat_steady, a C code which implements a finite difference method (FDM) for the steady time-independent 2D heat equation;
351. fd2d_heat_steady_test
352. fem_basis, a C code which defines and evaluates finite element method (FEM) basis functions for any degree in an M-dimensional simplex: 1D interval, 2D triangle, 3D tetrahedron, and higher dimensional generalizations.
353. fem_basis_test
354. fem_io, a C code which reads or writes FEM files, which describe the nodes, elements, and function values associated with a finite element method (FEM) model;
355. fem_io_test
356. fem_to_gmsh, a C code which reads a pair of FEM files defining node coordinates and elements, of a 1D, 2D or 3D mesh, namely a file of node coordinates and a file of elements defined by node indices, and creates a gmsh() mesh file.
357. fem_to_gmsh_test
358. fem_to_triangle, a C code which reads FEM files defining a 2D mesh of triangles, namely a file of node coordinates and a file of elements defined by node indices, and creates a corresponding pair of node and element files for use by the triangle() program of Jonathan Shewchuk.
359. fem_to_triangle_test
360. fem_to_xml, reads a pair of FEM files defining node coordinates and elements, of a 1D, 2D or 3D mesh, namely a file of node coordinates and a file of elements defined by node indices, and creates a corresponding XML file for input to DOLFIN or FENICS.
361. fem_to_xml_test
362. fem1d, a C code which applies the finite element method (FEM), using piecewise linear basis functions, to a linear two point boundary value problem (BVP) in 1D;
363. fem1d_test
364. fem1d_adaptive, a C code which uses an adaptive mesh when applying the finite element method (FEM), with piecewise linear basis functions, to a linear two point boundary value problem (BVP) in 1D;
365. fem1d_adaptive_test
366. fem1d_bvp_linear, a C code which applies the finite element method (FEM), with piecewise linear elements, to a two point boundary value problem (BVP) in one spatial dimension, and compares the computed and exact solutions with the L2 and seminorm errors.
367. fem1d_bvp_linear_test
368. fem1d_bvp_quadratic, a C code which applies the finite element method (FEM), with piecewise quadratic elements, to a two point boundary value problem (BVP) in one spatial dimension, and compares the computed and exact solutions with the L2 and seminorm errors.
369. fem1d_bvp_quadratic_test
370. fem1d_heat_steady, a C code which implements the finite element method (FEM) for the steady (time independent) 1D heat equation;
371. fem1d_heat_steady_test
372. fem1d_lagrange, a C code which sets up the matrices and vectors associated with the finite element method (FEM) solution of a boundary value problem (BVP) -u''+u=f(x), using Lagrange basis polynomials.
373. fem1d_lagrange_test
374. fem1d_nonlinear, a C code which applies the finite element method (FEM), with piecewise linear basis functions, to a nonlinear two point boundary value problem (BVP) in 1D;
375. fem1d_nonlinear_test
376. fem1d_pack, a C code which contains utilities for 1D finite element method (FEM) calculations.
377. fem1d_pack_test
378. fem1d_pmethod, a C code which applies the p-method version of the finite element method (FEM) to a linear two point boundary value problem (BVP) in 1D;
379. fem1d_pmethod_test
380. fem1d_project, a C code which projects data into a finite element space, including the least squares approximation of data, or the projection of a finite element method (FEM) solution from one mesh to another.
381. fem1d_project_test
382. fem1d_sample, a C code which samples a scalar or vector finite element function of one variable, defined by FEM files, returning interpolated values at the sample points.
383. fem1d_sample_tesst
384. fem2d_bvp_linear, a C code which applies the finite element method (FEM), with piecewise linear elements, to a 2D boundary value problem (BVP) in a rectangle, and compares the computed and exact solutions with the L2 and seminorm errors.
385. fem2d_bvp_linear_test
386. fem2d_bvp_quadratic, a C code which applies the finite element method (FEM), with piecewise quadratic elements, to a 2D boundary value problem (BVP) in a rectangle, and compares the computed and exact solutions with the L2 and seminorm errors.
387. fem2d_bvp_quadratic_test
388. fem2d_bvp_serene, a C code which applies the finite element method (FEM), with serendipity elements, to a 2D boundary value problem (BVP) in a rectangle, and compares the computed and exact solutions with the L2 and seminorm errors.
389. fem2d_bvp_serene_test
390. fem2d_pack, a C code which implements various 2D finite element method (FEM) calculations;
391. fem2d_pack_test
392. fem2d_poisson_rectangle, a C code which solves the 2D Poisson equation on a rectangle, using the finite element method (FEM), and piecewise quadratic triangular elements.
393. fem2d_poisson_rectangle_test
394. fem2d_poisson_rectangle_linear, a C code which solves the 2D Poisson equation on a rectangle, using the finite element method (FEM), and piecewise linear triangular elements.
395. fem2d_poisson_rectangle_linear_test
396. fern_opengl, a C code which uses OpenGL to display the Barnsley fractal fern.
397. feynman_kac_1d, a C code which demonstrates the use of the Feynman-Kac algorithm to solve the Poisson equation in a 1D interval by averaging stochastic paths to the boundary.
398. feynman_kac_1d_test
399. feynman_kac_2d, a C code which demonstrates the use of the Feynman-Kac algorithm to solve the Poisson equation in a 2D ellipse by averaging stochastic paths to the boundary.
400. feynman_kac_2d_test
401. feynman_kac_3d, a C code which demonstrates the use of the Feynman-Kac algorithm to solve the Poisson equation in a 3D ellipsoid by averaging stochastic paths to the boundary.
402. feynman_kac_3d_test
403. fft_openmp, a C code which demonstrates the computation of a Fast Fourier Transform (FFT) in parallel, using OpenMP.
404. fft_openmp_test
405. fft_serial, a C code which computes a Fast Fourier Transform (FFT), and is intended as a starting point for implementing an OpenMP parallel version.
406. fft_serial_test
407. fftpack4, a C code which implements the Fast Fourier Transform (FFT) by Paul Swarztrauber and Dick Valent, translated by Andrew Fernandes;
408. fftpack4_test
409. fftw_test
410. file_name_sequence, a C code which generates a sequence of filenames, which can be useful when generating a sequence of still snapshots to be animated later.
411. file_name_sequence_test
412. files_multiple, a C code which opens multiple output files at one time, and write data to any one specific file it chooses.
413. files_multiple_test
414. filon_rule, a C code which uses Filon's method to approximate integrals which include an oscillatory factor of sin(k*x) or cos(k*x).
415. filon_rule_test
416. filum, a C code which performs various operations with files;
417. filum_test
418. fire_simulation, a C code which simulates a forest fire over a rectangular array of trees, starting at a single random location. It is intended as a starting point for the development of a parallel version.
419. fire_simulation_test
420. fisher_exact, a C code which returns an exact solution of the Kolmogorov Petrovsky Piskonov Fisher partial differential equation (PDE) ut=uxx+u*(1-u).
421. fisher_exact_test
422. flame_exact, a C code which returns the exact solution of an ordinary differential equation (ODE) which models the growth of a ball of flame in a combustion process. The exact solution is defined in terms of the Lambert W function.
423. flame_exact_test
424. flood_opengl, a C code which uses OpenGL to allow the user to select regions of a 2D image and flood them with color, by Art Wetzel.
425. floyd, a C code which implements the Floyd algorithm for finding the shortest distance between pairs of nodes on a directed graph.
426. floyd_test
427. fn, a C code which evaluates elementary and special functions using Chebyshev polynomials; functions include Airy, Bessel I, J, K and Y, beta, confluent hypergeometric, error, gamma, log gamma, Pochhammer, Spence; integrals include hyperbolic cosine, cosine, Dawson, exponential, logarithmic, hyperbolic sine, sine; by Wayne Fullerton.
428. fn_test
429. football_dynamic, a C code which uses dynamic programming to count the ways of achieving a given score in football.
430. football_dynamic_test
431. freefem_msh_io, a C code which reads and writes files used by the FreeFem++ finite element program to store mesh information.
432. freefem_msh_io_test
433. fsolve, a C code which solves systems of nonlinear equations, inspired by the fsolve() function in minpack(), with special interfaces fsolve_bdf2(), fsolve_be() and fsolve_tr() for handling systems associated with implicit ODE solvers of type bdf2, backward Euler, midpoint, or trapezoidal.
434. fsolve_test
435. functions_openmp, a C code which demonstrates a few of the OpenMP functions.
436. functions_openmp_test
437. gauss_seidel, a C code which implements the Gauss-Seidel iteration for linear systems.
438. gauss_seidel_test
439. gcc_intrinsics_test, a C code which demonstrates the intrinsic functions made available by the Gnu gcc compiler for C.
440. gegenbauer_cc, a C code which computes the Gegenbauer weighted integral of a function f(x) using a Clenshaw-Curtis approach.
441. gegenbauer_cc_test
442. gegenbauer_polynomial, a C code which evaluates the Gegenbauer polynomial and associated functions.
443. gegenbauer_polynomial_test
444. geometry, a C code which performs geometric calculations in 2, 3 and M dimensional space, including the computation of angles, areas, containment, distances, intersections, lengths, and volumes.
445. geometry_test
446. geompack, a C code which computes Delaunay triangulations, Voronoi diagrams, and other information, by Barry Joe.
447. geompack_test
448. gl_fast_rule, a C code which carries out the rapid computation of the Kth value and weight of an N point Gauss-Legendre quadrature rule, by Ignace Bogaert.
449. gl_fast_rule_test
450. glomin, a C code which finds a global minimum of a scalar function of a scalar variable, without the use of derivative information, by Richard Brent.
451. glomin_test
452. glomin_nogoto, a C code which finds a global minimum of a scalar function of a scalar variable, without the use of derivative information, by Richard Brent. This version, rewritten by Hans Bieshaar, avoids the use of the goto statement, and the alternative duplication of some statements.
453. glomin_nogoto_test
454. gmsh_io, a C code which reads or writes some of the files created by gmsh() for 1D, 2D or 3D meshes used by the finite element method (FEM).
455. gmsh_io_test
456. gmsh_to_fem, a C code which reads a mesh data file created by gmsh() and writes a pair of node and element files that correspond to the FEM format.
457. gmsh_to_fem_test
458. gnuplot_test, a C code which uses gnuplot() to create various kinds of plots.
459. gnuplot_i, a C code which allows an executing C, C++ or Fortran program to interact with gnuplot(), by Nicholas Devillard.
460. gnuplot_i_test
461. gprof_test, a C code which uses the gprof() profiling tool.
462. graphics_dislin_test, a C code which creates various kinds of plots using dislin().
463. graphics_gnuplot_test, a C code which creates plots using gnuplot().
464. gsl_test, a C code which uses the GNU Scientific Library (GSL), which includes utilities to handle Basis splines, BLAS (Basic Linear Algebra Subprograms), Chebyshev Approximation, Complex numbers, Ordinary Differential Equations (ODE), Discrete Hankel Transforms, Discrete Wavelet Transforms, Eigenvalues and Eigenvectors, Fast Fourier Transforms (FFT), Histograms, IEEE Floating Point Calculations, Interpolation, Least Squares Fitting, Linear Algebra, Minimization, Monte Carlo Integration, N-Tuples, Numerical Differentiation, Permutations, Physical Constants, Quadrature (Numerical Integration), Quasi-Random sequences, Random Distributions, Random Numbers, Root finding of general nonlinear equations, Roots of Polynomials, Running Statistics, Series Acceleration, Simulated Annealing, Sorting, Sparse Matrices, Special Functions, Statistics, Vectors and matrices.
465. haar_transform, a C code which computes the Haar transform of 1d or 2d data.
466. haar_transform_test
467. halton, a C code which computes elements of a Halton Quasi Monte Carlo (QMC) sequence, using a simple interface.
468. halton_test
469. hammersley, a C code which computes elements of a Hammersley Quasi Monte Carlo (QMC) sequence, using a simple interface.
470. hammersley_test
471. hankel_cholesky, a C code which computes the upper Cholesky factor R of a symmetric positive definite (SPD) matrix H so that H = R' * R.
472. hankel_cholesky_test
473. hankel_spd, a C code which computes a lower triangular matrix L which is the Cholesky factor of a symmetric positive definite (SPD) Hankel matrix H, that is, H = L * L'.
474. hankel_spd_test
475. hdf5_test, a C code which demonstrates the use of the HDF5 data format.
476. heat_mpi, a C code which demonstrates the use of the Message Passing Interface (MPI), by solving the 1D time dependent heat equation.
477. heat_mpi_test
478. heated_plate, a C code 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.
479. heated_plate_test
480. heated_plate_openmp, a C code which solves the steady time-independent heat equation in a 2D rectangular region, using OpenMP to run in parallel.
481. heated_plate_openmp_test
482. hello, a C code which prints out "Hello, world!".
483. hello_test
484. hello_mpi, a C code which prints out "Hello, world!" using MPI for parallel programming.
485. hello_mpi_test
486. hello_openmp, a C code which prints out "Hello, world!" within the OpenMP parallel programming environment.
487. hello_openmp_test
488. helmholtz_openmp, a C code which solves the discretized Helmholtz equation in 2D using the OpenMP application program interface for carrying out parallel computations in a shared memory environment.
489. helmholtz_openmp_test
490. hermite_cubic, a C code which computes the value, derivatives or integral of a Hermite cubic polynomial, or manipulate an interpolant made up of piecewise Hermite cubic polynomials.
491. hermite_cubic_test
492. hermite_exactness, a C code which tests the polynomial exactness of Gauss-Hermite quadrature rules for approximating the integral of a function with density exp(-x^2) over the interval (-oo,+oo).
493. hermite_exactness_test
494. hermite_integrands, a C code which defines test integrands for Hermite integrals with density exp(-x^2) over the interval (-oo,+oo).
495. hermite_integrands_test
496. hermite_interpolant, a C code which computes the Hermite interpolant, a polynomial that matches function values and derivatives.
497. hermite_interpolant_test
498. hermite_polynomial, a C code which evaluates the physicist's Hermite polynomial, the probabilist's Hermite polynomial, the Hermite function, and related functions.
499. hermite_polynomial_test
500. hermite_product_polynomial, a C code which defines Hermite product polynomials, creating a multivariate polynomial as the product of univariate Hermite polynomials.
501. hermite_product_polynomial_test
502. hermite_rule, a C code which computes and writes out a Gauss-Hermite quadrature rule for approximating the integral of a function with density exp(-x^2) over the interval (-oo,+oo).
503. hermite_rule_test
504. hexahedron_jaskowiec_rule, a C code which returns a symmetric Jaskowiec quadrature rule for the hexahedron, with exactness up to total degree 21.
505. hexahedron_jaskowiec_rule_test
506. hexahedron_witherden_rule, a C code which returns a symmetric Witherden quadrature rule for the hexahedron, with exactness up to total degree 11.
507. hexahedron_witherden_rule_test
508. high_card_simulation, a C code which simulates a situation in which you see the cards in a deck one by one, and must select the one you think is the highest and stop; the code uses gnuplot() to create a graph of the results.
509. high_card_simulation_test
510. hilbert_curve, a C code which computes the sequence of discrete Hilbert curves whose limit is a space-filling curve.
511. hilbert_curve_test
512. histogram_data_2d_sample, a C code which demonstrates how to construct a Probability Density Function (PDF) from sample data over a 2D domain, and then to use that PDF to create new samples.
513. histogram_data_2d_sample_test
514. humps, a C code which evaluates the humps function, its first and second derivatives and its antiderivative.
515. humps_test
516. hyper_2f1, a C code which evaluates the hypergeometric functions 2F1(a,b,c;x) for real parameters a, b, c, and argument x, based on the Gnu Scientific Library function gsl_sf_hyperg_2F1().
517. hyper_2f1_test
518. hyperball_integrals, a C code which returns the exact value of the integral of any monomial over the interior of the unit hyperball in M dimensions.
519. hyperball_integrals_test
520. hyperball_monte_carlo, a C code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit ball in M dimensions;
521. hyperball_monte_carlo_test
522. hypercube_exactness, a C code which tests the polynomial exactness of a quadrature rule over the interior of the unit hypercube in M dimensions.
523. hypercube_exactness_test
524. hypercube_grid, a C code which computes a grid of points over the interior of a hypercube in M dimensions.
525. hypercube_grid_test
526. hypercube_integrals, a C code which returns the exact value of the integral of any monomial over the interior of the unit hypercube in M dimensions.
527. hypercube_integrals_test
528. hypercube_monte_carlo, a C code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit hypercube in M dimensions.
529. hypercube_monte_carlo_test
530. hypersphere, a C code which carries out various operations for an M dimensional hypersphere, including converting between Cartesian and spherical coordinates, stereographic projection, sampling the surface of the sphere, and computing the surface area and volume.
531. hypersphere_test
532. hypersphere_integrals, a C code which returns the exact value of the integral of any monomial over the surface of the unit hypersphere in M dimensions.
533. hypersphere_integrals_test
534. hypersphere_monte_carlo, a C code which applies a Monte Carlo method to estimate the integral of a function on the surface of the unit sphere in M dimensions;
535. hypersphere_monte_carlo_test
536. i4lib, a C code which contains many utility routines, using single precision integer (I4) arithmetic.
537. i4lib_test
538. i8lib, a C code which contains many utility routines, using double precision integer (I8) arithmetic.
539. i8lib_test
540. ice_io, a C code which reads or writes an ICE dataset, which defines a 3D grid, using the netcdf() file format.
541. ice_io_test
542. ice_to_medit, a C code which reads a netcdf() file containing an ICE dataset and rewrites the information as a medit() MESH file.
543. ice_to_medit_test
544. image_denoise, a C code which applies simple filtering operations to a noisy image.
545. image_denoise_test
546. image_denoise_openmp, a C code which applies simple filtering operations to a noisy image, carrying out the operation in parallel using OpenMP.
547. image_denoise_openmp_test
548. image_edge, a C code which demonstrates a simple procedure for edge detection in images.
549. image_edge_test
550. index, a C code 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.
551. index_test
552. interp, a C code which parameterizes or interpolates data;
553. interp_test
554. is, a C code which is a serial version of the nas Integer Sort (IS) Parallel Benchmark, which is intended as the starting point for the development of a parallel version.
555. is_test
556. is_prime, a C code which determines if a given integer n is prime, using various versions of the sieve of Eratosthenes.
557. is_prime_test
558. isbn, a C code which determines the check digit for an International Standard Book Number or report whether a given ISBN is valid.
559. isbn_test
560. ising_2d_simulation, a C code which simulates evolution of a 2D array of positive and negative charges, each of which is likely to flip to be in agreement with neighbors, using gnuplot() to display the initial and final configurations.
561. ising_2d_simulation_test
562. jacobi, a C code which implements the Jacobi iteration for the iterative solution of linear systems.
563. jacobi_test
564. jacobi_eigenvalue, a C code which implements the Jacobi iteration for the iterative determination of the eigenvalues and eigenvectors of a real symmetric matrix.
565. jacobi_eigenvalue_test
566. jacobi_openmp, a C code which uses OpenMP to parallelize a Jacobi iteration solving A*x=b.
567. jacobi_openmp_test
568. jacobi_polynomial, a C code which evaluates the Jacobi polynomial and associated functions.
569. jacobi_polynomial_test
570. julia_set, a C code which generates a TGA or TARGA graphics file of a Julia set.
571. julia_set_test
572. julia_set_openmp, a C code which produces an image of a Julia set, using OpenMP to carry out the computation in parallel.
573. julia_set_openmp_test
574. kdv_exact, a C code which evaluates exact solutions of the Korteweg-deVries (KdV) partial differential equation (PDE).
575. kdv_exact_test
576. kmeans, a C code which handles the K-Means problem, which organizes a set of N points in M dimensions into K clusters;
577. kmeans_test
578. knapsack_01_brute, a C code which uses brute force to solve small versions of the 0/1 knapsack problem;
579. knapsack_01_brute_test
580. kronrod_rule, a C code which computes a Gauss and Gauss-Kronrod pair of quadrature rules of arbitrary order, by Robert Piessens, Maria Branders.
581. kronrod_rule_test
582. ladders, a C code which transforms one five letter word into another, by changing one letter at a time, using only legitimate English words. This puzzle was invented by Lewis Carroll, who called it "Doublets", but it is also known as "Word Ladders" or "Word Golf". The code is by Donald Knuth, as part of his "Stanford Graph Base".
583. lagrange_approx_1d, a C code which defines and evaluates the Lagrange polynomial p(x) of degree m which approximates a set of nd data points (x(i),y(i)).
584. lagrange_approx_1d_test
585. lagrange_interp_1d, a C code 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).
586. lagrange_interp_1d_test
587. lagrange_interp_2d, a C code 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).
588. lagrange_interp_2d_test
589. lagrange_interp_nd, a C code which defines and evaluates the Lagrange polynomial p(x) which interpolates a set of data depending on a multidimensional argument evaluated on a product grid, so that p(x(i)) = z(i).
590. lagrange_interp_nd_test
591. laguerre_exactness, a C code which tests the polynomial exactness of Gauss-Laguerre quadrature rules for integrating functions with density exp(-x) over [0,+oo).
592. laguerre_exactness_test
593. laguerre_integrands, a C code which implements test problems for approximate integration over a semi-infinite interval, often carried out using Gauss-Laguerre quadrature.
594. laguerre_integrands_test
595. laguerre_polynomial, a C code which evaluates the Laguerre polynomial, the generalized Laguerre polynomials, and the Laguerre function.
596. laguerre_polynomial_test
597. laguerre_rule, a C code which computes and writes out a Gauss-Laguerre quadrature rule for approximating the integral of a function with density exp(-x) over the interval [0,+oo).
598. laguerre_rule_test
599. lambert_w, a C code which evaluates Lambert's W function.
600. lambert_w_test
601. lapack_test, a C code which calls lapack(), which is a Fortran library, containing a standard linear algebra package for solving linear systems, computing matrix factorizations, and solving eigenvalue problems. A precompiled copy of the lapack() library is often available on most scientific computing systems. This code illustrates how a C calling program interacts with a Fortran library.
602. laplace_mpi, a C code which solves the Laplace equation on a rectangle, using the Message Passing Interface (MPI) for parallel execution.
603. laplace_mpi_test
604. laplacian_matrix, a C code which carries out computations related to the discrete Laplacian operator, including full or sparse evaluation, evaluation for unequally spaced data sampling points, application to a set of data samples, solution of associated linear systems, eigenvalues and eigenvectors, and extension to 2D and 3D geometry.
605. laplacian_matrix_test
606. latin_cover, a C code which produces N Latin squares which cover an NxN square, or NxN Latin cubes which cover an NxNxN cube.
607. latin_cover_test
608. latin_random, a C code which computes Latin Random Squares of N points in M dimensions;
609. latin_random_test
610. latinize, a C code which adjusts N points in M dimensions to form a Latin Hypercube;
611. latinize_test
612. lebesgue, a C code which is given a set of nodes in 1D, and plots the Lebesgue function, and estimates the Lebesgue constant, which measures the maximum magnitude of the potential error of Lagrange polynomial interpolation.
613. lebesgue_test
614. legendre_exactness, a C code which tests the monomial exactness of quadrature rules for the Legendre problem of integrating a function with density 1 over the interval [-1,+1].
615. legendre_exactness_test
616. legendre_fast_rule, a C code which uses a fast, order N, algorithm to compute a Gauss-Legendre quadrature rule of given order to integrate a function with density 1 over the interval [-1,+1].
617. legendre_fast_rule_test
618. legendre_polynomial, a C code which evaluates the Legendre polynomial and associated functions.
619. legendre_polynomial_test
620. legendre_product_polynomial, a C code which defines Legendre product polynomials, creating a multivariate polynomial as the product of univariate Legendre polynomials.
621. legendre_product_polynomial_test
622. legendre_rule, a C code which writes out a Gauss-Legendre quadrature rule of given order to integrate a function with density 1 over the interval [-1,+1].
623. legendre_rule_test
624. legendre_shifted_polynomial, a C code which evaluates the shifted Legendre polynomial, with the domain [0,1].
625. legendre_shifted_polynomial_test
626. levenshtein_distance, a C code which returns the Levenshtein distance between two strings.
627. levenshtein_distance_test
628. levenshtein_matrix, a C code which returns the Levenshtein distance matrix defined by two strings.
629. levenshtein_matrix_test
630. life_opengl, a C code which uses OpenGL to display the evolution of John Conway's Game of life, by Simon Green.
631. life_serial, a C code which computes a few steps of the evolution of John Conway's Game of Life, intended as a starting point for implementing a parallel version.
632. life_serial_test
633. lights_out_game, a C code which sets up the "Lights Out" puzzle, lighting up a few squares on a grid. An interactive user must then try to press squares in such a way that all the lights are turned off. The OpenGL graphics system is used.
634. line_cvt_lloyd, a C code which applies the Lloyd iteration repeatedly to a set of N points, to compute a Centroidal Voronoi Tessellation (CVT) over the interior of a line segment in 1D.
635. line_cvt_lloyd_test
636. line_fekete_rule, a C code which estimates the location of N Fekete points, for polynomial interpolation or quadrature, over the interior of a line segment in 1D.
637. line_fekete_rule_test
638. line_felippa_rule, a C code which returns a Felippa quadrature rules for approximating integrals over the interior of a line segment in 1D.
639. line_felippa_rule_test
640. line_grid, a C code which computes a grid of points over the interior of a line segment in 1D.
641. line_grid_test
642. line_integrals, a C code which returns the exact value of the integral of any monomial over the length of the unit line in 1D.
643. line_integrals_test
644. line_monte_carlo, a C code which applies a Monte Carlo method to estimate the integral of a function over the length of the unit line in 1D.
645. line_monte_carlo_test
646. line_ncc_rule, a C code which computes a Newton Cotes Closed (NCC) quadrature rule, using equally spaced points, over the interior of a line segment in 1D.
647. line_ncc_rule_test
648. line_nco_rule, a C code which computes a Newton Cotes Open (NCO) quadrature rule, using equally spaced points, over the interior of a line segment in 1D.
649. line_nco_rule_test
650. linear_algebra, C codes which carry out various linear algebra operations for matrices stored in a variety of formats.
651. linpack_bench, a C code which is a version of the LINPACK benchmark;
652. linpack_bench_test
653. linpack_d, a C code which factors matrices in a variety of formats, and solving the associated linear systems, using double precision real arithmetic; it includes a function to compute the singular value decomposition (SVD) of a rectangular matrix. The original version of this code is by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart.
654. linpack_d_test
655. llsq, a C code which solves the simple linear least squares (LLS) 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.
656. llsq_test
657. lobatto_polynomial, a C code which evaluates Lobatto polynomials similar to Legendre polynomials except that they are 0 at both endpoints.
658. lobatto_polynomial_test
659. local_min, a C code which finds a local minimum of a scalar function of a scalar variable, without the use of derivative information, by Richard Brent.
660. local_min_test
661. local_min_rc, a C code which finds a local minimum of a scalar function of a scalar variable, without the use of derivative information, using reverse communication (RC), by Richard Brent.
662. local_min_rc_test
663. log_normal, a C code which returns quantities related to the log normal Probability Distribution Function (PDF).
664. log_normal_test
665. log_normal_truncated_ab, a C code which returns quantities related to the log normal Probability Distribution Function (PDF) truncated to the interval [A,B].
666. log_normal_truncated_ab_test
667. logistic_exact, a C code which evaluates an exact solution of the logistic equation, an ordinary differential equation (ODE) which models population growth in the face of a limited carrying capacity.
668. logistic_exact_test
669. lorenz_ode, a C code which approximates solutions to the Lorenz system of ordinary differential equations (ODE), creating output files that can be displayed by gnuplot().
670. lorenz_ode_test
671. luhn, a C code which computes the Luhn check digit for a string, or verify a string, as used for error detection in credit card numbers.
672. luhn_test
673. machar, a C code which dynamically computes the values of various machine characteristic constants, by William Cody;
674. machar_test
675. machine, a C code which returns tabulated values of the constants associated with computer arithmetic;
676. machine_test
677. makefile_test, a C code which shows how a makefile can be used to manage the compilation and loading of a C code.
678. mandelbrot, a C code which generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot set;
679. mandelbrot_test
680. mandelbrot_ascii, a C code which generates an ASCII text image of the Mandelbrot set, using just two lines of C code.
681. mandelbrot_ascii_test
682. mandelbrot_openmp, a C code which generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot fractal set, using OpenMP for parallel execution;
683. mandelbrot_openmp_test
684. mandelbrot_ppm, a C code which generates a binary Portable Pixel Map (PPM) image of the Mandelbrot set, by Eric Weeks.
685. mandelbrot_ppm_test
686. mario, a C code which creates a sort of "needlepoint" image of Mario, as an array of colored squares.
687. mario_test
688. matmul, a C code which carries out a matrix multiplication benchmark;
689. matmul_test
690. matrix_chain_brute, a C code which finds the cost of the most efficient ordering to use when multiplying a sequence of matrices, using brute force.
691. matrix_chain_brute_test
692. matrix_chain_dynamic, a C code which finds the cost of the most efficient ordering to use when multiplying a sequence of matrices, using dynamic programming.
693. matrix_chain_dynamic_test
694. matrix_exponential, a C code which demonstrates some simple approaches to the problem of computing the exponential of a matrix.
695. matrix_exponential_test
696. md, a C code which carries out a molecular dynamics (MD) simulation, and is intended as a starting point for implementing an OpenMP parallel version.
697. md_test
698. md_openmp, a C code which carries out a molecular dynamics (MD) simulation in parallel using OpenMP.
699. md_openmp_test
700. medit_mesh_io, a C code which reads or writes medit() MESH files defining a finite element mesh.
701. medit_mesh_io_test
702. medit_to_fem, a C code which reads a medit() MESH file and writes a corresponding pair of node and element files that correspond to the FEM format.
703. medit_to_fem_test
704. medit_to_ice, a C code which reads a medit() MESH file containing an ICE dataset and rewrites the information as a netcdf() file.
705. medit_to_ice_test
706. memory, a C code which declares and uses a sequence of larger and larger arrays, to see what the memory limits are on a given computer.
707. memory_test
708. mesh_bandwidth, a C code which returns the geometric bandwidth associated with a mesh of elements of any order and in a space of M dimensions.
709. mesh_bandwidth_test
710. metis_test
711. mgmres, a C code which applies the restarted Generalized Minimum Residual (GMRES) algorithm to solve a sparse linear system, using Compressed Row Storage (CRS) or sparse triplet (ST) format, by Lili Ju.
712. mgmres_test
713. mgs, a C code which is an example of legacy code, which the student is encouraged to study, understand, and document. This example is due to Diane O'Leary.
714. mgs_test
715. middle_square, a C code which implements the middle square algorithm for generating random integers. This is a very early method, attributed to von Neumann, which actually is deeply flawed, with short cycles.
716. middle_square_test
717. midpoint, a C code which solves one or more ordinary differential equations (ODE) using the (implicit) midpoint method, with a version of fsolve() handling the associated nonlinear equation, and using a fixed time step.
718. midpoint_test
719. midpoint_adaptive, a C code which solves one or more ordinary differential equations (ODE) using the (implicit) midpoint method, with fsolve() solving the implicit equation, and an adaptive time step. Plots of the solution and timestep history are created using gnuplot().
720. midpoint_adaptive_test
721. midpoint_explicit, a C code which solves one or more ordinary differential equations (ODE) using the explicit midpoint method, also called the modified Euler method.
722. midpoint_explicit_test
723. midpoint_fixed, a C code which solves one or more ordinary differential equations (ODE) using the implicit midpoint method, applying a fixed point iteration to solve the associated nonlinear equation.
724. midpoint_fixed_test
725. midpoint_gsl_test, a C code which calls the Gnu Scientific Library (GSL) implicit midpoint method solver for ordinary differential equation (ODE), and uses gnuplot() to plot the resulting solution.
726. minpack, a C code which solves a system of nonlinear equations, by Jorge More, Danny Sorenson, Burton Garbow, Kenneth Hillstrom.
727. minpack_test
728. mixed_test, a C code which tests various mixed language programs.
729. mm_io, a C code which reads and writes a Matrix Market (MM) Sparse Matrix File;
730. mm_io_test
731. monomial, a C code which enumerates, lists, ranks, unranks and randomizes multivariate monomials in a space of M dimensions, with total degree less than N, equal to N, or lying within a given range.
732. monomial_test
733. monomial_value, a C code which evaluates a monomial in M dimensions.
734. monomial_value_test
735. mpi_test, a C code which uses the Message Passing Interface (MPI) for parallel programming;
736. mri_to_ascii, a C code which converts the binary data in a Magnetic Resonance Imaging (MRI) file to ASCII text.
737. mri_to_ascii_test
738. mri_to_pgm, a C code which converts the binary data in a Magnetic Resonance Imaging (MRI) file to a sequence of Portable Gray Map (PGM) image files.
739. mri_to_pgm_test
740. multitask_mpi, a C code which demonstrates how to multitask, that is, to execute several unrelated and distinct tasks simultaneously, using MPI for parallel execution.
741. multitask_mpi_test
742. multitask_openmp, a C code which demonstrates how to multitask, that is, to execute several unrelated and distinct tasks simultaneously, using OpenMP for parallel execution.
743. multitask_openmp_test
744. mxm, a C code 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.
745. mxm_test
746. mxm_openmp, a C code which computes a dense matrix product C=A*B, using OpenMP for parallel execution.
747. mxm_openmp_test
748. mxm_serial, a C code which sets up a matrix multiplication problem A=B*C, intended as a starting point for implementing a parallel version.
749. mxm_serial_test
750. naca, a C code which takes the parameters of certain NACA airfoils and returns the coordinates of a sequence of points that outline the wing shape. The points can be plotted with gnuplot().
751. naca_test
752. nas, a C code which runs the NASA kernel benchmark.
753. nas_test
754. navier_stokes_2d_exact, a C code which evaluates an exact solution to the incompressible time-dependent Navier-Stokes equations (NSE) over an arbitrary domain in 2D.
755. navier_stokes_2d_exact_test
756. navier_stokes_3d_exact, a C code which evaluates an exact solution to the incompressible time-dependent Navier-Stokes equations (NSE) over an arbitrary domain in 3D.
757. navier_stokes_3d_exact_test
758. nearest_interp_1d, a C code which interpolates a set of data using a piecewise constant interpolant defined by the nearest neighbor criterion, creating graphics files for processing by gnuplot().
759. nearest_interp_1d_test
760. netcdf_test
761. newton_interp_1d, a C code which finds a polynomial interpolant to data using Newton divided differences.
762. newton_interp_1d_test
763. nintlib, a C code which implements approximate integration or quadrature in M dimensions;
764. nintlib_test
765. normal, a C code which implements random number generators (RNG) for normally distributed values.
766. normal_test
767. ode, a C code which solves a system of ordinary differential equations (ODE), by Shampine and Gordon;
768. ode_test
769. ode_moshier, a C code which implements the Adams-Bashforth-Moulton and Runge-Kutta (RK) methods of solving systems of ordinary differential equations (ODE), by Steven Moshier.
770. ode_moshier_test
771. opengl_test, a C code which uses opengl() for graphics;
772. openmp_test, a C code which uses OpenMP for parallel programming;
773. optimize_test
774. ornstein_uhlenbeck, a C code which approximates solutions of the Ornstein-Uhlenbeck stochastic ordinary differential equation (SODE) using the Euler method, the Euler-Maruyama method, and the Milstein method, and creating graphics files for processing by gnuplot().
775. ornstein_uhlenbeck_test
776. owen, a C code which evaluates the Owen T function;
777. owen_test
778. padua, a C code which returns the coordinates of the 2D Padua points, as well as interpolation weights or quadrature weights, and images of the points to be processed by gnuplot().
779. padua_test
780. partial_digest, a C code which solves the partial digest problem;
781. partial_digest_test
782. partition_brute, a C code which uses a brute force algorithm to seek solutions of the partition problem, splitting a set of integers into two subsets with equal sum.
783. partition_brute_test
784. patterson_rule, a C code which returns the points and weights of a 1D Gauss-Patterson quadrature rule of order 1, 3, 7, 15, 31, 63, 127, 255 or 511.
785. patterson_rule_test
786. pbma_io, a C code which reads or writes an ASCII Portable Bit Map (PBM) bit map graphics file;
787. pbma_io_test
788. pbmb_io, a C code which reads or writes a binary Portable Bit Map (PBM) graphics file;
789. pbmb_io_test
790. pbmlib, a C code which reads or writes graphics files in the Portable Bit Map (PBM) format;
791. pbmlib_test
792. pce_burgers, a C code which 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.
793. pce_burgers_test
794. pce_ode_hermite, a C code 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.
795. pce_ode_hermite_test
796. pcg_basic, a C code which returns a sequence of uniformly distributed pseudorandom numbers, by Melissa O'Neill.
797. pcg_basic_test
798. pcg_minimal, a C code which is a minimal implementation of a permuted congruential generator (PCG) of random numbers, by Melissa O'Neill.
799. pcg_minimal_test
800. pdflib, a C code which evaluates Probability Density Functions (PDF) and produces random samples from them, including beta, binomial, chi, exponential, gamma, inverse chi, inverse gamma, multinomial, normal, scaled inverse chi, and uniform.
801. pdflib_test
802. pentominoes, a C code which forms or plots any of the 12 members of the pentomino family, shapes formed from 5 adjacent squares.
803. pentominoes_test
804. peri1d, a C code which sets up and solves a 1D time-dependent peridynamics problem, by Miroslav Stoyanov;
805. peri1d_test
806. persistence, a C code which demonstrates how to initialize, get, or set data stored within a function, using static/persistent/saved/local memory.
807. persistence_test
808. pgma_io, a C code which reads or writes ASCII Portable Gray Map (PGM) 2D graphics files;
809. pgma_io_test
810. pgmb_io, a C code which reads or writes a binary Portable Gray Map (PGM) 2D graphics file;
811. pgmb_io_test
812. pig_latin, a C code which converts its input to Pig Latin; a winner of the International Obfuscated C Code Competition in the Most Humorous category, by Don Dodson;
813. pig_latin_test
814. pink_noise, a C code which computes a pink noise signal obeying a 1/f power law.
815. pink_noise_test
816. ply_io, a C code which reads or writes a 3D graphics file in PLY format, by Greg Turk;
817. ply_to_obj, a C code which converts a PLY 3D graphics file to an OBJ file.
818. ply_to_obj_test
819. png_io, a C code which reads and writes files in the Portable Network Graphics (PNG) format.
820. png_io_test
821. point_merge, a C code which considers N points in M-dimensional space, and counts or indexes the unique or tolerably unique items.
822. point_merge_test
823. poisson_1d, a C code which solves a discretized version of the Poisson equation -uxx = f(x) on the interval a ≤ x ≤ b, with Dirichlet boundary conditions u(a) = ua, u(b) = ub. The linear system is solved using Gauss-Seidel iteration.
824. poisson_1d_test
825. poisson_1d_multigrid, a C code which applies the multigrid method to a discretized version of the 1D Poisson equation.
826. poisson_1d_multigrid_test
827. poisson_2d, a C code which computes a solution to the Poisson equation in a rectangle, and is intended as the starting point for the creation of a parallel version.
828. poisson_2d_test
829. poisson_mpi, a C code which computes a solution to the Poisson equation in a rectangle, using the Jacobi iteration to solve the linear system, and MPI to carry out the Jacobi iteration in parallel.
830. poisson_mpi_test
831. poisson_openmp, a C code which computes a 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.
832. poisson_openmp_test
833. poisson_simulation, a C code which simulates a Poisson process in which events randomly occur with an average waiting time of Lambda, creating graphics files for processing by gnuplot().
834. poisson_simulation_test
835. polpak, a C code which evaluates a variety of mathematical functions, polynomials, and sequences, including Bell, Benford, Bernoulli, Bernstein, Cardan, Catalan, Charlier, Chebyshev, Collatz, Delannoy, Euler, Fibonacci, Gegenbauer, Gudermannian, Harmonic, Hermite, Hofstadter, Hypergeometric 2F1, Jacobi, Krawtchouk, Laguerre, Lambert, Legendre, Lerch, Meixner, Mertens, Moebius, Motzkin, Phi, Stirling Number, Tau, Tribonacci, Zernike.
836. polpak_test
837. polygon, a C code which computes properties of an arbitrary polygon in the plane, defined by a sequence of vertices, including interior angles, area, centroid, containment of a point, convexity, counter clockwise ordering, diameter, distance to a point, inradius, lattice area, nearest point in set, outradius, uniform sampling, and triangulation.
838. polygon_test
839. polygon_grid, a C code which generates a grid of points over the interior of a polygon in 2D.
840. polygon_grid_test
841. polygon_integrals, a C code which returns the exact value of the integral of any monomial over the interior of a polygon in 2D.
842. polygon_integrals_test
843. polygon_monte_carlo, a C code which applies a Monte Carlo method to estimate the integral of a function over the interior of a polygon in 2D.
844. polygon_monte_carlo_test
845. polygon_triangulate, a C code which triangulates a possibly nonconvex polygon in 2D, and which can use gnuplot() to display the external edges and internal diagonals of the triangulation.
846. polygon_triangulate_test
847. polynomial, a C code which adds, multiplies, differentiates, evaluates and prints multivariate polynomials in a space of M dimensions.
848. polynomial_test
849. polynomial_conversion, a C code which converts representations of a polynomial between monomial, Bernstein, Chebyshev, Gegenbauer, Hermite, Laguerre and Legendre forms.
850. polynomial_conversion_test
851. polynomial_root_bound, a C code which computes the Cauchy bound on the magnitude of all roots of a polynomial with complex coefficients.
852. polynomial_root_bound_test
853. polyominoes, a C code which utilities for manipulating polyominoes and tilings.
854. polyominoes_test
855. porous_medium_exact, a C code which returns an exact solution of the porous medium equation (PME), dudt=Del^2(u^m), a partial differential equation (PDE) related to the diffusion equation, based on the Barenblatt solution.
856. porous_medium_exact_test
857. power_method, a C code which carries out the power method for finding a dominant eigenvalue and its eigenvector.
858. power_method_test
859. power_rule, a C code which constructs a power rule, that is, a product quadrature rule from identical 1D factor rules.
860. power_rule_test
861. ppc_array, a C code which allocates and frees memory for vectors and matrices, for a variety of types, from Rouben Rostamian's "Programming Projects in C";
862. ppc_array_test
863. ppc_array_mine, a C code which is an alternate version of ppc_array(), and manages the dynamic allocation and release of arrays, from Rouben Rostamian's "Programming Projects in C";
864. ppc_array_mine_test
865. ppc_bvp, a C code which solves a 1 dimensional boundary value problem (BVP), using triangle() for the mesh, the finite element method (FEM) for discretization, umfpack() to solve the linear system, and geomview() for visualization, from Rouben Rostamian's "Programming Projects in C";
866. ppc_bvp_test
867. ppc_evolution, a C code which simulates the process of evolution on a model world of creatures, from Rouben Rostamian's "Programming Projects in C";
868. ppc_evolution_test
869. ppc_evolution_io, a C code which reads or writes world data files in WDF format, used by ppc_evolution(), which simulates the process of evolution on a model world of creatures, from Rouben Rostamian's "Programming Projects in C";
870. ppc_evolution_io_test
871. ppc_fd1, a C code which solves the 1 dimensional time-dependent heat equation, using the finite difference method (FDM) for discretization, and offering a variety of solvers, including explicit, implicit, Crank-Nicolson, and Seidman sweep, from Rouben Rostamian's "Programming Projects in C";
872. ppc_fd1_test
873. ppc_fetch_line, a C code which transfers lines of text from a file to a buffer, trimming initial and trailing whitespace, and comments, from Rouben Rostamian's "Programming Projects in C";
874. ppc_fetch_line_test
875. ppc_fgets_demo, a C code which demonstrates how the fgets() function transfers data from a file to an internal C buffer, from Rouben Rostamian's "Programming Projects in C";
876. ppc_fgets_demo_test
877. ppc_gauss_quad, a C code which implements Gauss quadrature rules for approximate integration, from Rouben Rostamian's "Programming Projects in C";
878. ppc_gauss_quad_test
879. ppc_haar, a C code which applies forward and backward Haar transforms to vectors and matrices, from Rouben Rostamian's "Programming Projects in C";
880. ppc_haar_test
881. ppc_image_analysis, a C code which analyzes and manipulates an image stored in PGM or PBM format, from Rouben Rostamian's "Programming Projects in C";
882. ppc_image_analysis_test
883. ppc_image_reduce, a C code which reduces the size of an image stored in PGM or PBM format, by applying a Haar transform and removing modes of low importance, from Rouben Rostamian's "Programming Projects in C";
884. ppc_image_reduce_test
885. ppc_ll, a C code which demonstrates the use of linked lists, from Rouben Rostamian's "Programming Projects in C";
886. ppc_ll_test
887. ppc_mesh, a C code which uses a version of Jonathan Shewchuk's triangle() code to create a triangular mesh of a region bounded by a polygonal arc, and possibly including holes, from Rouben Rostamian's "Programming Projects in C";
888. ppc_mesh_test
889. ppc_nelder_mead, a C code which implements the Nelder-Mead moving simplex function minimization algorithm, from Rouben Rostamian's "Programming Projects in C";
890. ppc_nelder_mead_test
891. ppc_netpbm, a C code which demonstrates the use of netpbm() to read and write images, from Rouben Rostamian's "Programming Projects in C";
892. ppc_netpbm_test
893. ppc_netpbm_io, a C code which reads and writes netpbm() files in pgm or ppm format, from Rouben Rostamian's "Programming Projects in C";
894. ppc_netpbm_io_test
895. ppc_netpbm_random, a C code which creates a random MxN array of 0's and 1's, regarded as a portable bit map (PBM) image, from Rouben Rostamian's "Programming Projects in C";
896. ppc_netpbm_random_test
897. ppc_neural_ode, a C code which uses a neural network to model an ordinary differential equation and to approximate its solution, from Rouben Rostamian's "Programming Projects in C";
898. ppc_neural_ode_test
899. ppc_neural_pde, a C code which uses a neural network to model a partial differential equation and to approximate its solution, from Rouben Rostamian's "Programming Projects in C";
900. ppc_neural_pde_ell, a C code which calls ppc_neural_pde(), which uses a neural network to model a partial differential equation (PDE) in the form of a boundary value problem (BVP) posed in an L-shaped region and to approximate its solution, from Rouben Rostamian's "Programming Projects in C";
901. ppc_neural_pde_square, a C code which calls ppc_neural_pde(), which uses a neural network to model a partial differential equation (PDE) in the form of a boundary value problem (BVP) posed in a square region and to approximate its solution, from Rouben Rostamian's "Programming Projects in C";
902. ppc_neural_pde_square_hole, a C code which calls ppc_neural_pde(), which uses a neural network to model a partial differential equation (PDE) in the form of a boundary value problem (BVP) posed in a square region with a circular hole, and to approximate its solution, from Rouben Rostamian's "Programming Projects in C";
903. ppc_neural_pde_test
904. ppc_poisson, a C code which solves the 1 dimensional Poisson equation as a boundary value problem (BVP), using triangle() for the mesh, the finite element method (FEM) for discretization, umfpack() to solve the linear system, and geomview() for visualization, from Rouben Rostamian's "Programming Projects in C";
905. ppc_poisson_test
906. ppc_porous_medium, a C code which solves the porous medium equation, dudt=Del^2(u^m), from Rouben Rostamian's "Programming Projects in C";
907. ppc_porous_medium_test
908. ppc_sparse_matrix, a C code which packs a sparse MxN matrix into compressed column storage (CCS), or unpacks a compressed column storage matrix to MxN format, from Rouben Rostamian's "Programming Projects in C";
909. ppc_sparse_matrix_test
910. ppc_triangle, a C code which is the library version of Jonathan Shewchuk's triangle() code, for computing a triangular mesh from a given set of points, from Rouben Rostamian's "Programming Projects in C";
911. ppc_truss, a C code which models a truss structure under a load, from Rouben Rostamian's "Programming Projects in C";
912. ppc_truss_test
913. ppc_truss_io, a C code which reads or writes a file defining a truss structure under a load, from Rouben Rostamian's "Programming Projects in C";
914. ppc_truss_io_test
915. ppc_truss_to_eps, a C code which creates an Encapsulated PostScript image of a truss structure under a load, from Rouben Rostamian's "Programming Projects in C";
916. ppc_truss_to_eps_test
917. ppc_twb_quad, a C code which defines Taylor, Wingate, Bos quadrature rules for triangles, from Rouben Rostamian's "Programming Projects in C";
918. ppc_twb_quad_test
919. ppc_twb_quad_minimal, a C code which is a minimal demonstration of defines Taylor, Wingate, Bos quadrature rules for triangles, from Rouben Rostamian's "Programming Projects in C";
920. ppc_twb_quad_minimal_test
921. ppc_umfpack_test, a C code which defines a sparse linear system and then requests a solution using umfpack(), from Rouben Rostamian's "Programming Projects in C";
922. ppc_xmalloc, a C code which manages the allocation of memory, from Rouben Rostamian's "Programming Projects in C";
923. ppc_xmalloc_test
924. ppma_io, a C code which reads or writes an ASCII Portable Pixel Map (PPM) 2D graphics file;
925. ppma_io_test
926. ppmb_io, a C code which reads or writes a binary Portable Pixel Map (PPM) 2D graphics file;
927. ppmb_io_test
928. praxis, a C code which minimizes a scalar function of several variables, without requiring derivative information, by Richard Brent.
929. praxis_test
930. predator_prey_ode, a C code which solves a time-dependent predator-prey system of ordinary differential equations (ODE).
931. predator_prey_ode_test
932. prime, a C code which counts the number of primes between 1 and N, and is intended as a starting point for a parallel version.
933. prime_test
934. prime_mpi, a C code which counts the primes between 1 and N, using MPI for parallel execution.
935. prime_mpi_test
936. prime_openmp, a C code which counts the number of primes between 1 and N, using OpenMP for parallel execution.
937. prime_openmp_test
938. prime_pi, a C code which evaluates Pi(n), the number of primes less than or equal to an integer n.
939. prime_pi_test
940. prism_jaskowiec_rule, a C code which returns symmetric quadrature rules, with exactness up to total degree 20, over the interior of a prism with triangular base, by Jan Jaskowiec, Natarajan Sukumar.
941. prism_jaskowiec_rule_test
942. prism_witherden_rule, a C code which returns a symmetric Witherden quadrature rule for a prism with triangular base, with exactness up to total degree 10.
943. prism_witherden_rule_test
944. prob, a C code which evaluates, samples, inverts, and characterizes a number of Probability Density Functions (PDF) and Cumulative Density Functions (CDF), including anglit, arcsin, benford, birthday, bernoulli, beta_binomial, beta, binomial, bradford, burr, cardiod, cauchy, chi, chi squared, circular, cosine, deranged, dipole, dirichlet mixture, discrete, empirical, english sentence and word length, error, exponential, extreme values, f, fisk, folded normal, frechet, gamma, generalized logistic, geometric, gompertz, gumbel, half normal, hypergeometric, inverse gaussian, laplace, levy, logistic, log normal, log series, log uniform, lorentz, maxwell, multinomial, nakagami, negative binomial, normal, pareto, planck, poisson, power, quasigeometric, rayleigh, reciprocal, runs, sech, semicircular, student t, triangle, uniform, von mises, weibull, zipf.
945. prob_test
946. product_rule, a C code which creates an M-dimensional quadrature rule from a product of distinct 1d quadrature rules;
947. product_rule_test
948. pthreads_test
949. pwl_approx_1d, a C code which approximates a set of data using a piecewise linear function.
950. pwl_approx_1d_test
951. pwl_interp_1d, a C code which interpolates a set of data using a piecewise linear function. creating graphics files for processing by gnuplot().
952. pwl_interp_1d_test
953. pwl_interp_2d, a C code which evaluates a piecewise linear interpolant to data defined on a regular 2D grid.
954. pwl_interp_2d_test
955. pwl_interp_2d_scattered, a C code which evaluates a piecewise linear interpolant to data which is available at an irregularly arranged set of points.
956. pwl_interp_2d_scattered_test
957. pwl_product_integral, a C code which calculates the exact value of the integral of the product of two piecewise linear functions f(x) and g(x).
958. pwl_product_integral_test
959. pyramid_exactness, a C code which investigates the polynomial exactness of a quadrature rule over the interior of the unit pyramid in 3D.
960. pyramid_exactness_test
961. pyramid_felippa_rule, a C code which returns a Felippa quadrature rule for approximating integrals over the interior of a pyramid in 3D.
962. pyramid_felippa_rule_test
963. pyramid_grid, a C code which computes a grid of points over the interior of the unit pyramid in 3D;
964. pyramid_grid_test
965. pyramid_integrals, a C code which returns the exact value of the integral of any monomial over the interior of the unit pyramid in 3D.
966. pyramid_integrals_test
967. pyramid_jaskowiec_rule, a C code which returns quadrature rules, with exactness up to total degree 20, over the interior of a pyramid in 3D, by Jan Jaskowiec, Natarajan Sukumar.
968. pyramid_jaskowiec_rule_test
969. pyramid_monte_carlo, a C code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit pyramid in 3D;
970. pyramid_monte_carlo_test
971. pyramid_rule, a C code which computes a conical product quadrature rule over the interior of the unit pyramid in 3D.
972. pyramid_rule_test
973. pyramid_witherden_rule, a C code which returns a Witherden quadrature rule, with exactness up to total degree 10, over the interior of a pyramid.
974. pyramid_witherden_rule_test
975. qr_solve, a C code which computes the linear least squares (LLS) solution of a system A*x=b.
976. qr_solve_test
977. quad_mpi, a C code which applies a quadrature rule to estimate an integral, working in parallel by using MPI;
978. quad_mpi_test
979. quad_openmp, a C code which applies a quadrature rule to estimate an integral over a 1D interval, using OpenMP for parallel execution;
980. quad_openmp_test
981. quad_rule, a C code which defines quadrature rules for approximating integrals;
982. quad_rule_test
983. quad_serial, a C code which applies a quadrature rule to estimate an integral, intended as a starting point for parallelization exercises.
984. quad_serial_test
985. quad2d, a C code which applies a product quadrature rule to estimate an integral over a 2D rectangle, intended as a starting point for parallelization exercises.
986. quad2d_test
987. quad2d_openmp, a C code which applies a product quadrature rule to estimate an integral over a 2D rectangle, using OpenMP for parallel execution;
988. quadmom, a C code which computes a Gaussian quadrature rule for a weight function rho(x) based on the Golub-Welsch procedure that only requires knowledge of the moments of rho(x).
989. quadmom_test
990. quadrature_golub_welsch, a C code which computes the points and weights of a Gaussian quadrature rule using the Golub-Welsch procedure.
991. quadrature_golub_welsch_test
992. quadrature_least_squares, a C code which computes weights for "sub-interpolatory" quadrature rules, that is, it estimates integrals by integrating a polynomial that approximates the function data in a least squares sense.
993. quadrature_least_squares_test
994. quadrature_weights_vandermonde, a C code which computes the weights of a quadrature rule using the Vandermonde matrix, assuming that the points have been specified.
995. quadrature_weights_vandermonde_test
996. quadrature_weights_vandermonde_2d, a C code which computes the weights of a 2D quadrature rule using the Vandermonde matrix, assuming that the points have been specified.
997. quadrature_weights_vandermonde_2d_test
998. quadrilateral_witherden_rule, a C code which returns a symmetric Witherden quadrature rule for the quadrilateral, with exactness up to total degree 21.
999. quadrilateral_witherden_rule_test
1000. quaternions, a C code which carries out some simple arithmetic operations for quaternions.
1001. quaternions_test
1002. r83, a C code which contains linear algebra routines for r83 matrices, real, 64 bit, tridiagonal 3xN format.
1003. r83_test
1004. r83_np, a C code which contains linear algebra routines for r83_np matrices (real, 64 bit, tridiagonal 3xN format, nonpivoting factorization).
1005. r83_np_test
1006. r83p, a C code which contains linear algebra routines for r83p matrices (real, 64 bit, tridiagonal periodic format).
1007. r83p_test
1008. r83s, a C code which contains linear algebra routines for r83s matrices (real, 64 bit, tridiagonal scalar format).
1009. r83s_test
1010. r83t, a C code which contains linear algebra routines for r83t matrices (real, 64 bit, tridiagonal Mx3 format).
1011. r83t_test
1012. r83v, a C code which contains linear algebra routines for r83v matrices (real, 64 bit, tridiagonal three vector format).
1013. r83v_test
1014. r85, a C code which contains linear algebra routines for r85 matrices (real, 64 bit, pentadiagonal format).
1015. r85_test
1016. r8bb, a C code which contains linear algebra routines for r8bb matrices (real, 64 bit, border banded format).
1017. r8bb_test
1018. r8blt, a C code which contains linear algebra routines for r8blt matrices (real, 64 bit, band lower triangular format).
1019. r8blt_test
1020. r8bto, a C code which contains linear algebra routines for r8bto matrices (real, 64 bit, block Toeplitz format).
1021. r8bto_test
1022. r8but, a C code which contains linear algebra routines for r8but matrices (real, 64 bit, band upper triangular format).
1023. r8but_test
1024. r8cb, a C code which contains linear algebra routines for r8cb matrices (real, 64 bit, Compressed Band format).
1025. r8cb_test
1026. r8cbb, a C code which contains linear algebra routines for r8cbb matrices (real, 64 bit, Compressed Border Banded format).
1027. r8cbb_test
1028. r8ccs, a C code which contains linear algebra routines for r8ccs matrices (real, 64 bit, Compressed Column Storage (Colptr,Row,Value) format).
1029. r8ccs_test
1030. r8ci, a C code which contains linear algebra routines for r8ci matrices (real, 64 bit, circulant format).
1031. r8ci_test
1032. r8col, a C code which contains utility routines for an R8COL, that is, a double precision real MxN array, considered as N column vectors, each of length M. The data may be thought of as a matrix of multiple columns, and many operations will be carried out columnwise.
1033. r8col_test
1034. r8gb, a C code which contains linear algebra routines for r8gb matrices (real, 64 bit, General Banded format).
1035. r8gb_test
1036. r8gd, a C code which contains linear algebra routines for r8gd matrices (real, 64 bit, general diagonal format).
1037. r8gd_test
1038. r8ge, a C code which contains linear algebra routines for R8GE matrices, real, 64 bit, General format.
1039. r8ge_test
1040. r8lib, a C code which contains many utility routines, using double precision real (R8) arithmetic.
1041. r8lib_test
1042. r8lt, a C code which contains linear algebra routines for R8LT matrices, real, 64 bit, Lower Triangular format.
1043. r8lt_test
1044. r8ltt, a C code which contains linear algebra routines for r8ltt matrices (real, 64 bit, lower triangular Toeplitz format).
1045. r8ltt_test
1046. r8ncf, a C code which contains linear algebra routines for r8ncf matrices (real, 64 bit, nonsymmetric coordinate format).
1047. r8ncf_test
1048. r8pbl, a C code which contains linear algebra routines for r8pbl matrices (real, 64 bit, symmetric positive definite (SPD) band lower format).
1049. r8pbl_test
1050. r8pbu, a C code which contains linear algebra routines for r8pbu matrices (real, 64 bit, symmetric positive definite (SPD) band upper format).
1051. r8pbu_test
1052. r8po, a C code which contains linear algebra routines for r8po matrices (real, 64 bit, symmetric positive definite (SPD) format).
1053. r8po_test
1054. r8poly, a C code which operates on real polynomials, including evaluation, differentiation, integration, multiplication, synthetic division, shifting the base, computing a power, taking the norm. It also defines Chebyshev, Lagrange and Legendre polynomials.
1055. r8poly_test
1056. r8pp, a C code which contains linear algebra routines for r8pp matrices (real, 64 bit, symmetric positive definite (SPD) packed format).
1057. r8pp_test
1058. r8ri, a C code which contains linear algebra routines for r8ri matrices (real, 64 bit, row indexed format).
1059. r8ri_test
1060. r8row, a C code which contains utility routines for an R8ROW, that is, a double precision real MxN array, considered as M row vectors, each of length N. The data may be thought of as a matrix of multiple rows, and many operations will be carried out rowwise.
1061. r8row_test
1062. r8sd, a C code which contains linear algebra routines for r8sd matrices (real, 64 bit, symmetric diagonal format).
1063. r8sd_test
1064. r8sm, a C code which contains linear algebra routines for r8sm matrices (real, 64 bit, Sherman-Morrison A-u*v' format).
1065. r8sm_test
1066. r8sr, a C code which carries out linear algebra operations for r8sr matrices (real, 64 bit, diagonal + compressed row offdiagonal format).
1067. r8sr_test
1068. r8ss, a C code which carries out linear algebra operations for r8ss matrices (real, 64 bit, symmetric skyline format).
1069. r8ss_test
1070. r8st, a C code which contains linear algebra routines for r8st matrices, real, 64 bit, Sparse Triplet format.
1071. r8st_test
1072. r8sto, a C code which contains linear algebra routines for r8sto matrices (real, 64 bit, symmetric Toeplitz N format).
1073. r8sto_test
1074. r8to, a C code which contains linear algebra routines for r8to matrices (real, 64 bit, Toeplitz 2*N-1 format).
1075. r8to_test
1076. r8ut, a C code which contains linear algebra routines for r8ut matrices, real, 64 bit, Upper Triangular format.
1077. r8ut_test
1078. r8utp, a C code which carries out linear algebra operations on r8utp matrices, real 64 bit, Upper Triangular Packed format.
1079. r8utp_test
1080. r8utt, a C code which contains linear algebra routines for r8utt matrices (real, 64 bit, upper triangular Toeplitz format).
1081. r8utt_test
1082. r8vm, a C code which contains linear algebra routines for r8vm matrices (real, 64 bit, vandermonde format).
1083. r8vm_test
1084. rand48_test, a C code which calls rand48(), which demonstrates the use of several stdlib functions, which uses 48-bit arithmetic to generate uniformly distributed pseudorandom value. The results can be returned as double precision values in [0.0,1.0], or as long integers in [-2^31,2^31], or as nonnegative long integers in [0,2^31].
1085. randlc, a C code which implements a random number generator (RNG) used by the NAS Benchmark.
1086. randlc_test
1087. random_data, a C code which uses a random number generator (RNG) to sample points for various probability distributions, spatial dimensions, and geometries, including the M-dimensional cube, ellipsoid, simplex and sphere.
1088. random_data_test
1089. random_mpi, a C code which generates the same sequence of random numbers for both sequential execution and parallel execution under MPI.
1090. random_mpi_test
1091. random_openmp, a C code which illustrates how a parallel program using OpenMP can generate multiple distinct streams of random numbers.
1092. random_openmp_test
1093. random_sorted, a C code which generates vectors of random values which are already sorted.
1094. random_sorted_test
1095. ranlib, a C code which produces random samples from Probability Density Functions (PDF), including Beta, Chi-square Exponential, F, Gamma, Multivariate normal, Noncentral chi-square, Noncentral F, Univariate normal, random permutations, Real uniform, Binomial, Negative Binomial, Multinomial, Poisson and Integer uniform, by Barry Brown and James Lovato.
1096. ranlib_test
1097. rbf_interp_1d, a C code which defines and evaluates radial basis function (RBF) interpolants to 1D data.
1098. rbf_interp_1d_test
1099. rbf_interp_2d, a C code which defines and evaluates radial basis function (RBF) interpolants to 2D data.
1100. rbf_interp_2d_test
1101. rbf_interp_nd, a C code which defines and evaluates radial basis function (RBF) interpolants to M-dimensional data.
1102. rbf_interp_nd_test
1103. reactor simulation, a C code which is a Monte Carlo simulation of the shielding effect of a slab of a certain thickness in front of a neutron source. This code was provided as an example with the book "Numerical Methods and Software."
1104. reactor simulation_test
1105. ring_mpi, a C code which uses the MPI parallel programming environment, and measures the time necessary to copy a set of data around a ring of processes.
1106. ring_mpi_test
1107. rk1, a C code which solves one or more ordinary differential equations (ODE) using an explicit Runge-Kutta method of order 1, usually known as Euler's explicit method.
1108. rk1_test
1109. rk4, a C code which applies the fourth order Runge-Kutta (RK) algorithm to estimate the solution of an ordinary differential equation (ODE) at the next time step.
1110. rk4_test
1111. rkf45, a C code which applies the Runge-Kutta-Fehlberg (RKF) algorithm to solve a system of ordinary differential equations (ODE);
1112. rkf45_test
1113. rnglib, a C code which implements a random number generator (RNG) with splitting facilities, allowing multiple independent streams to be computed, by L'Ecuyer and Cote.
1114. rnglib_test
1115. root_rc, a C code which seeks a solution of a scalar nonlinear equation f(x)=0, using reverse communication (RC), by Gaston Gonnet.
1116. root_rc_test
1117. roots_rc, a C code which seeks solutions of a system of nonlinear equations, using reverse communication (RC), by Gaston Gonnet.
1118. roots_rc_test
1119. rot13, a C code which makes a copy of a file which has been encoded using the ROT13 coding and a ROT5 coding for digits.
1120. rot13_test
1121. row_echelon_integer, a C code which carries out the exact computation of the integer row echelon form (IREF) and integer reduced row echelon form (IRREF) of an integer matrix.
1122. row_echelon_integer_test
1123. sandia_rules, a C code which produces a standard 1D Gauss quadrature rule of Chebyshev, Gegenbauer, generalized Hermite, generalized Laguerre, Hermite, Jacobi, Laguerre, and Legendre types.
1124. sandia_rules_test
1125. satisfy_brute, a C code which uses brute force to find all assignments of values to a set of logical variables which make a complicated logical statement true.
1126. satisfy_brute_test
1127. satisfy_mpi, a C code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfy problem, using MPI to perform the calculation in parallel.
1128. satisfy_mpi_test
1129. satisfy_openmp, a C code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfy problem, using OpenMP for parallel execution.
1130. satisfy_openmp_test
1131. schedule_openmp, a C code which demonstrates the default, static, and dynamic methods of scheduling loop iterations in OpenMP to avoid work imbalance.
1132. schedule_openmp_test
1133. screenshot_opengl, a C code which uses OpenGL() to save a screenshot of the graphics being displayed.
1134. sde, a C code which illustrates properties of stochastic ordinary differential equations (SODE), and common algorithms for their analysis, including the Euler method, the Euler-Maruyama method, and the Milstein method, making graphics files for processing and display by gnuplot(), by Desmond Higham;
1135. sde_test
1136. search, a C code which searches the integers from A to B for a value J such that F(J) = C. this is intended as a starting point for a parallel approach.
1137. search_test
1138. search_mpi, a C code which searches integers between A and B for a solution J such that F(J)=C, carried out in parallel using MPI.
1139. search_mpi_test
1140. set_theory, a C code which demonstrates various set theoretic operations using several models of a set.
1141. set_theory_test
1142. sftpack, a C code which implements the slow Fourier transform, intended as a teaching tool and comparison with the Fast Fourier Transform (FFT).
1143. sftpack_test
1144. sgefa_openmp, a C code which compares a standard linear algebra solver against a revised version which can be run in parallel with OpenMP.
1145. sgefa_openmp_test
1146. sgmga, a C code which creates sparse grids using a mixture of 1D quadrature rule families, allowing user specified growth rates for each family, allowing anisotropic weights for each dimension.
1147. sgmga_test
1148. shallow_water_1d, a C code which simulates the evolution of a 1D fluid governed by the time-dependent shallow water equations.
1149. shallow_water_1d_test
1150. shepard_interp_1d, a C code which defines and evaluates Shepard interpolants to 1D data, based on inverse distance weighting.
1151. shepard_interp_1d_test
1152. shepard_interp_2d, a C code which defines and evaluates Shepard interpolants to 2D data, based on inverse distance weighting.
1153. shepard_interp_2d_test
1154. shepard_interp_nd, a C code which defines and evaluates Shepard interpolants to M-dimensional data, based on inverse distance weighting.
1155. shepard_interp_nd_test
1156. showme, a C code which displays triangulations and meshes, by Jonathan Shewchuk;
1157. showme_test
1158. sigmoid_derivative, a C code which evaluates derivatives of any order for the sigmoid function s(x)=1/(1+exp(-x)). The test code creates graphics images using gnuplot().
1159. sigmoid_derivative_test
1160. simplex_coordinates, a C code which computes the Cartesian coordinates of the vertices of a regular simplex in M dimensions.
1161. simplex_coordinates_test
1162. simplex_gm_rule, a C code which defines Grundmann-Moeller quadrature rules over the interior of a triangle in 2D, a tetrahedron in 3D, or over the interior of the simplex in M dimensions.
1163. simplex_gm_rule_test
1164. simplex_grid, a C code which generates a regular grid of points over the interior of an arbitrary simplex in M dimensions.
1165. simplex_grid_test
1166. simplex_integrals, a C code which returns the exact value of the integral of any monomial over the interior of the unit simplex in M dimensions.
1167. simplex_integrals_test
1168. simplex_monte_carlo, a C code which uses the Monte Carlo method to estimate an integral over the interior of the unit simplex in M dimensions.
1169. simplex_monte_carlo_test
1170. sine_gordon_exact, a C code which returns an exact solution of the Sine-Gordon equation, a partial differential equation (PDE) of the form uxy=sin(u).
1171. sine_gordon_exact_test
1172. sine_transform, a C code which demonstrates some simple properties of the discrete sine transform.
1173. sine_transform_test
1174. smolpack, a C code which estimates the integral of a function over a M-dimensional hypercube using a sparse grid, by Knut Petras;
1175. smolpack_test
1176. snakes_and_ladders, a C code which provides tools for the analysis of the game of Snakes and Ladders.
1177. snakes_and_ladders_test
1178. solve, a C code which implements a linear solver which makes it easy to create doubly-dimensioned arrays and solve associated linear systems.
1179. solve_test
1180. sor, a C code which implements a simple version of the Successive Over-Relaxation (SOR) method for the iterative solution of a linear system of equations.
1181. sor_test
1182. sort_rc, a C code which sorts a list of any kind of objects, using reverse communication (RC).
1183. sort_rc_test
1184. sparse_display, a C code which reads information defining a matrix of numbers and displays the sparsity pattern or location of the nonzero elements using gnuplot(). This operation is already available in the built-in MATLAB spy() command.
1185. sparse_display_test
1186. sparse_grid_cc, a C code which creates sparse grids based on Clenshaw-Curtis rules.
1187. sparse_grid_cc_test
1188. sparse_grid_hw, a C code 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.
1189. sparse_grid_hw_test
1190. sparse_interp_nd, a C code which defines a sparse interpolant to a function f(x) of a multidimensional argument.
1191. sparse_interp_nd_test
1192. sphere_exactness, a C code which tests the polynomial exactness of a quadrature rule over the surface of the unit sphere in 3D;
1193. sphere_exactness_test
1194. sphere_fibonacci_grid, a C code which uses a Fibonacci spiral to create a grid of points on the surface of the unit sphere in 3D.
1195. sphere_fibonacci_grid_test
1196. sphere_grid, a C code 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 surface of the unit sphere in 3D.
1197. sphere_grid_test
1198. sphere_integrals, a C code which defines test functions for integration over the surface of the unit sphere in 3D.
1199. sphere_integrals_test
1200. sphere_lebedev_rule, a C code which computes Lebedev quadrature rules over the surface of the unit sphere in 3D;
1201. sphere_lebedev_rule_test
1202. sphere_llq_grid, a C code which uses longitudes and latitudes to create grids of points, lines, and quadrilaterals on the surface of the unit sphere in 3D.
1203. sphere_llq_grid_test
1204. sphere_llt_grid, a C code which uses longitudes and latitudes to create grids of points, lines, and triangles on the surface of the unit sphere in 3D.
1205. sphere_llt_grid_test
1206. sphere_monte_carlo, a C code which applies a Monte Carlo method to estimate the integral of a function over the surface of the unit sphere in 3D;
1207. sphere_monte_carlo_test
1208. sphere_quad, a C code which used triangulation to approximate an integral over the surface of the unit sphere in 3D;
1209. sphere_quad_test
1210. sphere_stereograph, a C code which computes the stereographic mapping between points on the unit sphere in 3D and points on the plane Z = 1; a generalized mapping is also available.
1211. sphere_stereograph_test
1212. sphere_triangle_monte_carlo, a C code which used the Monte Carlo method to estimate the integral of a function defined in a triangle on the surface of the unit sphere in 3D.
1213. sphere_triangle_monte_carlo_test
1214. sphere_triangle_quad, a C code which uses quadrature to estimate the integral of a function in a spherical triangle on the surface of the unit sphere in 3D.
1215. sphere_triangle_quad_test
1216. spiral_exact, a C code which computes a 2D velocity vector field that is an exact solution of the continuity equation.
1217. spiral_exact_test
1218. spline, a C code which interpolates or approximates data by piecewise polynomial functions;
1219. spline_test
1220. square_arbq_rule, a C code which returns quadrature rules, with exactness up to total degree 20, over the interior of the symmetric square in 2D, by Hong Xiao and Zydrunas Gimbutas.
1221. square_arbq_rule_test
1222. square_exactness, a C code which investigates the polynomial exactness of quadrature rules for f(x,y) over the interior of a rectangle in 2D.
1223. square_exactness_test
1224. square_felippa_rule, a C code which returns a Felippa quadrature rules for approximating integrals over the interior of a square in 2D.
1225. square_felippa_rule_test
1226. square_grid, a C code which computes a grid of points over the interior of a square in 2D.
1227. square_grid_test
1228. square_integrals, a C code which returns the exact value of the integral of any monomial over the interior of the unit square or symmetric unit square in 2D.
1229. square_integrals_test
1230. square_minimal_rule, a C code which returns "almost minimal" quadrature rules, with exactness up to total degree 55, over the interior of the symmetric square in 2D, by Mattia Festa and Alvise Sommariva.
1231. square_minimal_rule_test
1232. square_monte_carlo, a C code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit square in 2D.
1233. square_monte_carlo_test
1234. square_symq_rule, a C code which returns symmetric quadrature rules, with exactness up to total degree 20, over the interior of the symmetric square in 2D, by Hong Xiao and Zydrunas Gimbutas.
1235. square_symq_rule_test
1236. st_io, a C code which reads and writes sparse linear systems stored in the Sparse Triplet (ST) format.
1237. st_io_test
1238. st_to_ccs, a C code which converts a matrix from the Sparse Triplet (ST) format to the Compressed Column Storage (CCS) format.
1239. st_to_ccs_test
1240. stiff_ode, a C code which considers an ordinary differential equation (ODE) which is an example of a stiff ODE.
1241. stiff_ode_test
1242. stochastic_diffusion, functions which implement several versions of a stochastic diffusivity coefficient.
1243. stochastic_diffusion_test
1244. stochastic_heat2d, a C code which implements a finite difference method (FDM) for the steady time-independent 2D heat equation, with a stochastic heat diffusivity coefficient, using gnuplot() to illustrate the results.
1245. stochastic_heat2d_test,
1246. stochastic_rk, a C code which applies a Runge-Kutta (RK) scheme to a stochastic ordinary differential equation (SODE).
1247. stochastic_rk_test
1248. stokes_2d_exact, a C code which evaluates exact solutions to the incompressible steady Stokes equations over the unit square in 2D.
1249. stokes_2d_exact_test
1250. string_pde, a C code which sets up and solves the partial differential equations (PDE) describing a vibrating string, creating files that can be displayed by gnuplot().
1251. string_pde_test
1252. stroud_rule, a C code which defines quadrature rules for a variety of M-dimensional regions, including the interior of the square, cube and hypercube, the pyramid, cone and ellipse, the hexagon, the M-dimensional octahedron, the circle, sphere and hypersphere, the triangle, tetrahedron and simplex, and the surface of the circle, sphere and hypersphere.
1253. stroud_rule_test
1254. subpak, a C code which includes a number of utility routines.
1255. subpak_test
1256. subset, a C code which enumerates, generates, randomizes, ranks and unranks combinatorial objects including combinations, compositions, Gray codes, index sets, partitions, permutations, polynomials, subsets, and Young tables. Backtracking routines are included to solve some combinatorial problems.
1257. subset_test
1258. subset_sum, a C code which seeks solutions of the subset sum problem, in which it is desired to find a subset of integers which has a given sum.
1259. subset_sum_test
1260. subset_sum_backtrack, a C code which uses backtracking to find solutions of the subset sum problem, in which it is desired to find a subset of integers which has a given sum.
1261. subset_sum_backtrack_test
1262. subset_sum_brute, a C code which uses brute force to find solutions of the subset sum problem, in which it is desired to find a subset of integers which has a given sum.
1263. subset_sum_brute_test
1264. subset_sum_swap, a C code which uses swapping to try to improve an initial estimated solution of the subset sum problem, which seeks a subset of a set of integers which has a given sum. Even when an exact solution exists, this approach often only finds an approximate solution.
1265. subset_sum_swap_test
1266. super_blas, a C code which implements some of the BLAS routines, for particular use by superlu();
1267. super_blas_test
1268. superlu_test, a C code which illustrates how to use superlu(), which applies a fast direct solution method to solve sparse linear systems, by James Demmel, John Gilbert, and Xiaoye Li.
1269. svd_test, a C code which demonstrates the computation of the singular value decomposition (SVD) and a few of its properties.
1270. svd_snowfall, a C code which reads a file containing historical snowfall data and analyzes the data with the Singular Value Decomposition (SVD).
1271. svd_snowfall_test
1272. svd_truncated, a C code 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.
1273. svd_truncated_test
1274. table_io, a C code which reads and writes a simple dataset stored as a table file;
1275. table_io_test
1276. task_division, a C code 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.
1277. task_division_test
1278. test_approx, a C code which implements test problems for approximation, provided as a set of (x,y) data.
1279. test_approx_test
1280. test_eigen, a C code which implements test matrices for eigenvalue analysis.
1281. test_eigen_test
1282. test_int, a C code which implements test problems for approximate integration or quadrature in one dimension.
1283. test_int_test
1284. test_int_2d, a C code which implements test problems for approximate integration or quadrature in two dimensions.
1285. test_int_2d_test
1286. test_interp, a C code which defines test problems for interpolation, provided as a set of (x,y) data.
1287. test_interp_test
1288. test_interp_1d, a C code which defines test problems for interpolation of data y(x), which depends on a 1D argument.
1289. test_interp_1d_test
1290. test_interp_2d, a C code which defines test problems for interpolation of data z(x,y), which depends on a 2D argument.
1291. test_interp_2d_test
1292. test_interp_nd, a C code which defines test problems for interpolation of data z(x), depending on an M-dimensional argument.
1293. test_interp_nd_test
1294. test_interp_fun, a C code which provides formulas of certain functions that are useful for testing an interpolation algorithm using a varying number of points.
1295. test_interp_fun_test
1296. test_lls, a C code which implements linear least squares (LLS) test problems of the form A*x=b.
1297. test_lls_test
1298. test_matrix, a C code which defines test matrices for which the condition number, determinant, eigenvalues, eigenvectors, inverse, null vectors, P*L*U factorization or linear system solution are known. Examples include the Fibonacci, Hilbert, Redheffer, Vandermonde, Wathen and Wilkinson matrices.
1299. test_matrix_test
1300. test_matrix_exponential, a C code which defines a set of test cases for computing the matrix exponential.
1301. test_matrix_exponential_test
1302. test_min, a C code which implements test problems for minimization of a scalar function of a scalar variable.
1303. test_min_test
1304. test_opt_con, a C code 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.
1305. test_opt_con_test
1306. test_optimization, a C code which implements test problems for optimization of a scalar function of several variables, as described by Molga and Smutnicki.
1307. test_optimization_test
1308. test_partial_digest, a C code which generates examples of the partial digest problem.
1309. test_partial_digest_test
1310. test_values, a C code which supplies test values of various mathematical functions, including Abramowitz, AGM, Airy, Bell, Bernoulli, Bessel, Beta, Binomial, Bivariate Normal, Catalan, Cauchy, Chebyshev, Chi Square, Clausen, Clebsch Gordan, Collatz, Cosine integral, Dawson, Debye, Dedekind, dilogarithm, Dixon elliptic functions, Exponential integral, Elliptic, Error, Euler, Exponential integral, F probability, Fresnel, Frobenius, Gamma, Gegenbauer, Goodwin, Gudermannian, Harmonic, Hermite, Hypergeometric 1F1, Hypergeometric 2F1, inverse trigonometic, Jacobi Elliptic functions sn(), cn(), dn(), the Julian Ephemeris Date, Kelvin, Laguerre, Lambert W, Laplace, Legendre, Lerch, Lobachevsky, Lobatto, Logarithmic integral, Log normal, McNugget numbers, Mersenne primes, Mertens, Mittag-Leffler, Moebius, Multinomial, Negative binomial, Nine J, Normal, Omega, Owen, Partition, Phi, Pi, Poisson, Polylogarithm, Polynomial Resultant, Polyomino, Prime, Psi, Rayleigh, Hyperbolic Sine integral, Sigma, Sine Power integral, Sine integral, Six J, Sphere area, Sphere volume, Spherical harmonic, Stirling, Stromgen, Struve, Student, Subfactorial, Student probability, Three J, Transport, Trigamma, Truncated normal, van der Corput, von Mises, Weibull, Wright Omega, Zeta.
1311. test_values_test
1312. test_zero, a C code which implements test problems for the solution of a single nonlinear equation in one variable.
1313. test_zero_test
1314. tester, a BASH script which runs the test programs.
1315. tet_mesh, a C code which carries out various tasks associated with tetrahedral meshes in 3D;
1316. tet_mesh_test
1317. tetrahedron, a C code which computes properties, including the centroid, circumsphere, dihedral angles, edge lengths, face angles, face areas, insphere, quality, solid angles, and volume, of a tetrahedron in 3D.
1318. tetrahedron_test
1319. tetrahedron_arbq_rule, a C code which returns quadrature rules, with exactness up to total degree 15, over the interior of a tetrahedron in 3D, by Hong Xiao and Zydrunas Gimbutas.
1320. tetrahedron_arbq_rule_test
1321. tetrahedron_exactness, a C code which tests the polynomial exactness of a quadrature rule over the interior of a tetrahedron in 3D.
1322. tetrahedron_exactness_test
1323. tetrahedron_felippa_rule, a C code which returns a Felippa quadrature rules for approximating integrals over the interior of a tetrahedron in 3D.
1324. tetrahedron_felippa_rule_test
1325. tetrahedron_grid, a C code which computes a grid of points over the interior of a tetrahedron in 3D.
1326. tetrahedron_grid_test
1327. tetrahedron_integrals, a C code which returns the exact value of the integral of any monomial over the interior of the unit tetrahedron in 3D.
1328. tetrahedron_integrals_test
1329. tetrahedron_jaskowiec_rule, a C code which returns quadrature rules, with exactness up to total degree 20, over the interior of a tetrahedron in 3D, by Jan Jaskowiec, Natarajan Sukumar.
1330. tetrahedron_jaskowiec_rule_test
1331. tetrahedron_keast_rule, a C code which defines a Keast quadrature rule, of degree of exactness 0 through 8, over the interior of the tetrahedron in 3D.
1332. tetrahedron_keast_rule_test
1333. tetrahedron_monte_carlo, a C code which uses the Monte Carlo method to estimate an integral over the interior of a general tetrahedron in 3D.
1334. tetrahedron_monte_carlo_test
1335. tetrahedron_ncc_rule, a C code which defines Newton-Cotes closed (NCC) quadrature rules over the interior of a tetrahedron in 3D.
1336. tetrahedron_ncc_rule_test
1337. tetrahedron_nco_rule, a C code which defines Newton-Cotes open (NCO) quadrature rules over the interior of a tetrahedron in 3D.
1338. tetrahedron_nco_rule_test
1339. tetrahedron_witherden_rule, a C code which returns a symmetric Witherden quadrature rule for the tetrahedron, with exactness up to total degree 10.
1340. tetrahedron_witherden_rule_test
1341. tetrahedron01_monte_carlo, a C code which uses the Monte Carlo method to estimate an integral over the interior of the unit tetrahedron in 3D.
1342. tetrahedron01_monte_carlo_test
1343. three_body_ode, a C code 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.
1344. three_body_ode_test
1345. timer_test, a C code which computes the elapsed CPU time or elapsed wall clock time in a calculation.
1346. timestamp, a C code which returns the current YMDHMS date as a timestamp, and performs other timing chores;
1347. timestamp_test
1348. toeplitz_cholesky, a C code which computes the Cholesky factorization of a symmetrid positive definite (SPD) Toeplitz matrix.
1349. toeplitz_cholesky_test
1350. toms097, a C code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using the Floyd algorithm. This is a version of ACM TOMS algorithm 97.
1351. toms097_test
1352. toms112, a C code which determines whether a point is contained in a polygon, by Moshe Shimrat. This is a version of ACM TOMS algorithm 112.
1353. toms112_test
1354. toms178, a C code which seeks the minimizer of a function of several variables, using the Hooke-Jeeves direct search method, by Arthur Kaupe. This is a version of ACM TOMS algorithm 178.
1355. toms178_test
1356. toms179, a C code which calculates the incomplete Beta ratio, by Oliver Ludwig; this is a version of ACM TOMS algorithm 179.
1357. toms179_test
1358. toms243, a C code which evaluates the logarithm of a complex value, by David Collens. This is a version of ACM TOMS algorithm 243.
1359. toms243_test
1360. toms291, a C code which approximates the logarithm of the Gamma function; This is a version of ACM TOMS algorithm 291.
1361. toms291_test
1362. toms322, a C code which evaluates the F and the Student T Cumulative Density Function (CDF); This is a version of ACM TOMS algorithm 322.
1363. toms322_test
1364. toms443, a C code which evaluates the Lambert W function. This is a version of ACM TOMS algorithm 443.
1365. toms443_test
1366. toms446, a C code which manipulates Chebyshev series for interpolation and approximation. This is a version of ACM TOMS algorithm 446, by Roger Broucke.
1367. toms446_test
1368. toms462, a C code 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 version of ACM TOMS algorithm 462.
1369. toms462_test
1370. toms515, a C code which selects subsets of size K from a set of size N, This is a version of ACM TOMS Algorithm 515, by Bill Buckles, Matthew Lybanon.
1371. toms515_test
1372. toms577, a C code which evaluates the Carlson elliptic integral functions RC, RD, RF and RJ. This is a version of ACM TOMS algorithm 577.
1373. toms577_test
1374. toms655, a C code which computes the weights for interpolatory quadrature rule; this code is commonly called IQPACK, by Sylvan Elhay and Jaroslav Kautsky. This is a version of ACM TOMS algorithm 655.
1375. toms655_test
1376. toms743, a C code which evaluates the Lambert W function. This is a version of ACM TOMS algorithm 743, by Barry, Barry and Culligan-Hensley.
1377. toms743_test
1378. toms886, a C code which defines the Padua points for interpolation in a 2D region, including the rectangle, triangle, and ellipse, by Marco Caliari, Stefano de Marchi, Marco Vianello. This is a version of ACM TOMS algorithm 886.
1379. toms886_test
1380. toms917, a C code which evaluates the Wright Omega function, by Piers Lawrence, Robert Corless, David Jeffrey. This is a version of ACM TOMS algorithm 917.
1381. toms917_test
1382. trapezoidal, a C code which solves one or more ordinary differential equations (ODE) using the (implicit) trapezoidal method, and a version of fsolve() to handle the nonlinear equation.
1383. trapezoidal_test
1384. treepack, a C code which defines, analyzes, and manipulates trees, a simple kind of graph with no circuits. Special cases include rooted and binary trees. Representations include adjacency, arc, Pruefer code, and parent. Operations include center, diameter, eccentricity, enumeration, generation one at a time, random selection, traversal.
1385. treepack_test
1386. triangle, a C code which computes properties, including angles, area, centroid, circumcircle, edge lengths, incircle, orientation, orthocenter, and quality, of a triangle in 2D.
1387. triangle_test
1388. triangle_analyze, a C code which reads a triangle defined in a file, and computes angles, area, centroid, circumcircle, edge lengths, incircle, orientation, orthocenter, and quality.
1389. triangle_analyze_test
1390. triangle_bench, a C code which sets up sample datasets of random points in the unit square, writes them to a file acceptable by Jonathan Shewchuk's triangle() program for computing Delaunay triangulations and Voronoi diagrams, which can then be benchmarked by timing the computation for increasing large sets.
1391. triangle_bench_test
1392. triangle_exactness, a C code which tests the polynomial exactness of a quadrature rule over the interior of a triangle in 2D.
1393. triangle_exactness_test
1394. triangle_fekete_rule, a C code which returns a Fekete rule for interpolation or quadrature over the interior of a triangle in 2D.
1395. triangle_fekete_rule_test
1396. triangle_felippa_rule, a C code which returns a Felippa quadrature rules for approximating integrals over the interior of a triangle in 2D.
1397. triangle_felippa_rule_test
1398. triangle_grid, a C code which computes a grid of points over the interior of a triangle in 2D.
1399. triangle_grid_test
1400. triangle_integrals, a C code which returns the exact value of the integral of any polynomial over the interior of an arbitrary triangle in 2D.
1401. triangle_integrals_test
1402. triangle_interpolate, a C code which shows how vertex data can be interpolated at any point in the interior of a triangle.
1403. triangle_interpolate_test
1404. triangle_io, a C code which reads or writes some of the files created by the triangle() program of Jonathan Shewchuk.
1405. triangle_io_test
1406. triangle_monte_carlo, a C code which uses the Monte Carlo method to estimate an integral over the interior of a general triangle in 2D.
1407. triangle_monte_carlo_test
1408. triangle_ncc_rule, a C code which defines Newton-Cotes closed (NCC) quadrature rules over the interior of a triangle in 2D.
1409. triangle_ncc_rule_test
1410. triangle_nco_rule, a C code which defines Newton-Cotes open (NCO) quadrature rules over the interior of a triangle in 2D.
1411. triangle_nco_rule_test
1412. triangle_nodefile_random, a C code which generates a set of N random nodes in M dimensions, and writes them to a file suitable for processing by Jonathan Shewchuk's triangle() program.
1413. triangle_nodefile_random_test
1414. triangle_shewchuk, a C code which generates meshes, Delaunay triangulations, and Voronoi diagrams, by Jonathan Shewchuk;
1415. triangle_shewchuk_test
1416. triangle_svg, a C code which uses Scalable Vector Graphics (SVG) to plot a triangle and any number of points, to illustrate quadrature rules and sampling techniques.
1417. triangle_svg_test
1418. triangle_symq_rule, a C code which returns efficient symmetric quadrature rules, with exactness up to total degree 50, over the interior of a triangle in 2D, by Hong Xiao and Zydrunas Gimbutas.
1419. triangle_symq_rule_test
1420. triangle_to_fem, a C code which reads the NODE and ELE files created by the triangle() program to describe a triangular mesh, and writes a corresponding pair of node and element files in the 2D FEM format.
1421. triangle_to_fem_test
1422. triangle_to_medit, a C code which reads the NODE and ELE files created by the triangle() program to describe a triangular mesh, and writes a corresponding medit() mesh file.
1423. triangle_to_medit_test
1424. triangle_to_xml, a C code which reads the NODE and ELE files created by triangle() to describe a triangular mesh in 2D, and writes out a corresponding XML mesh file for use by DOLFIN or FENICS.
1425. triangle_to_xml_test
1426. triangle_twb_rule, a C code which generates the points and weights of quadrature rules over the interior of a triangle in 2D, determined by Taylor, Wingate, and Bos.
1427. triangle_twb_rule_test
1428. triangle_witherden_rule, a C code which returns a symmetric Witherden quadrature rule for the triangle, with exactness up to total degree 20.
1429. triangle_witherden_rule_test
1430. triangle01_integrals, a C code which returns the integral of any monomial over the interior of the unit triangle in 2D.
1431. triangle01_integrals_test
1432. triangle01_monte_carlo, a C code which uses the Monte Carlo method to estimate an integral over the interior of the unit triangle in 2D.
1433. triangle01_monte_carlo_test
1434. triangulate, a C code which triangulates a polygonal region, by Joseph ORourke;
1435. triangulate_test
1436. triangulation, a C code which computes the triangulation of a set of points in the plane, and performs various operations using a triangulation, including searching a Delaunay triangulation to find which triangle contains a given point.
1437. triangulation_test
1438. triangulation_node_to_element, a C code which reads files describing a set of nodes, their triangulation, and the value of one or more quantities at each node, and outputs a file that averages the quantities for each element. This operation in effect creates an "order1" finite element model of the data.
1439. triangulation_node_to_element_test
1440. triangulation_svg, a C code which creates an SVG image of a triangulation, which can be displayed by a web browser.
1441. triangulation_svg_test
1442. triangulation_triangle_neighbors, a C code which reads data defining a triangulation, finds the three neighbor triangles for each triangle, and writes them to a file;
1443. triangulation_triangle_neighbors_test
1444. trig_to_neib, a C code which reads node and ele files, a format prescribed by the triangle() program of Jonathan Shewchuk, describing a triangulation, and produces a file defining the neighbor triangles of each element; the code can also produce information about the Voronoi diagram. The code is by Lili Ju.
1445. trig_to_neib_test
1446. truncated_normal, a C code which works with the truncated normal distribution over [A,B], or [A,+oo) or (-oo,B], returning the probability density function (PDF), the cumulative density function (CDF), the inverse CDF, the mean, the variance, and sample values.
1447. truncated_normal_test
1448. truncated_normal_rule, a C code which computes a quadrature rule for a normal probability density function (PDF), sometimes called a Gaussian distribution, that has been truncated to [A,+oo), (-oo,B], or [A,B].
1449. truncated_normal_rule_test
1450. tsp_brute, a C code which reads a file of city-to-city distances and solves a small traveling salesperson problem (TSP), using brute force.
1451. tsp_brute_test
1452. ubvec, a C code which demonstrates how nonnegative integers can be stored as unsigned binary vectors, and arithmetic can be performed on them.
1453. ubvec_test
1454. umfpack_test, a C code which calls umfpack(), which solves sparse linear systems, part of the SuiteSparse package, by Timothy Davis.
1455. unicycle, a C code which considers permutations containing a single cycle, sometimes called cyclic permutations.
1456. unicycle_test
1457. uniform, a C code which contains uniform random number generators (RNG) for several arithmetic types.
1458. uniform_test
1459. upc, a C code which computes the check digit associated with a uniform product code (UPC), or reports whether a 12-digit UPC is actually valid.
1460. upc_test
1461. valgrind_test, a C code which uses valgrind(), a suite of programs which includes a memory leak detector.
1462. van_der_corput, a C code which computes elements of the van der Corput one-dimensional Quasi Monte Carlo (QMC) sequence, using a simple interface.
1463. van_der_corput_test
1464. vandermonde, a C code which implements the Bjork-Pereyra algorithm for accurate solution of linear systems involving the Vandermonde matrix.
1465. vandermonde_test
1466. vandermonde_approx_1d, a C code which finds a polynomial approximant to data y(x) of a 1D argument by solving an overdetermined linear system for the polynomial coefficients involving the Vandermonde matrix.
1467. vandermonde_approx_1d_test
1468. vandermonde_approx_2d, a C code 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.
1469. vandermonde_approx_2d_test
1470. vandermonde_interp_1d, a C code 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, creating graphics files for processing by gnuplot().
1471. vandermonde_interp_1d_test
1472. vandermonde_interp_2d, a C code which finds a polynomial interpolant to data z(x,y) of a 2D argument by setting up and solving a linear system for the polynomial coefficients involving the Vandermonde matrix.
1473. vandermonde_interp_2d_test
1474. walker_sample, a C code which efficiently samples a discrete probability vector using Walker sampling.
1475. walker_sample_test
1476. walsh_transform, a C code which implements the Walsh data transform.
1477. walsh_transform_test
1478. wathen_matrix, a C code which compares storage schemes: full, banded, sparse triplet, and solution strategies: Linpack full, Linpack banded, conjugate gradient (CG), for linear systems involving the Wathen matrix, which can arise when solving a problem using the finite element method (FEM).
1479. wathen_matrix_test
1480. wave_mpi, a C code which uses the finite difference method (FDM) and MPI to estimate a solution to the wave equation.
1481. wave_mpi_test
1482. wavelet, a C code which does some simple calculations with wavelet transforms;
1483. wavelet_test
1484. wedge_exactness, a C code which investigates the polynomial exactness of a quadrature rule over the interior of the unit wedge in 3D.
1485. wedge_exactness_test
1486. wedge_felippa_rule, a C code which returns quadrature rules for approximating integrals over the interior of the unit wedge in 3D.
1487. wedge_felippa_rule_test
1488. wedge_grid, a C code which computes a grid of points over the interior of the unit wedge in 3D.
1489. wedge_grid_test
1490. wedge_integrals, a C code which returns the exact value of the integral of any monomial over the interior of the unit wedge in 3D.
1491. wedge_integrals_test
1492. wedge_monte_carlo, a C code which uses the Monte Carlo method to estimate an integral over the interior of the unit wedge in 3D.
1493. wedge_monte_carlo_test
1494. weekday, a C code which determines the day of the week corresponding to a given date, such as 14 October 1066, Julian calendar, ... which was a Saturday.
1495. weekday_test
1496. wishart_matrix, a C code which produces sample matrices from the Wishart or Bartlett distributions, useful for sampling random covariance matrices.
1497. wishart_matrix_test
1498. wtime, a C code which returns a reading of the wall clock time in seconds.
1499. wtime_test
1500. x_window_test
1501. zero_brent, a C code which seeks a solution of a scalar nonlinear equation f(x)=0, by Richard Brent.
1502. zero_brent_test
1503. zero_chandrupatla, a C code which finds a zero of a scalar function of a scalar variable, starting from a change of sign interval, using the Chandrupatla method, which can converge faster than bisection, regula falsi, or Brent's method, by Tirupathi Chandrapatla.
1504. zero_chandrupatla_test
1505. zero_itp, a C code which finds a zero of a scalar function of a scalar variable, starting from a change of sign interval, using the Interpolate/Truncate/Project (ITP) method, which has faster convergence than the bisection method.
1506. zero_itp_test
1507. zero_laguerre, a C code which uses Laguerre's method to find the zero of a function. The method needs first and second derivative information. The method almost always works when the function is a polynomial.
1508. zero_laguerre_test
1509. zero_muller, a C code which seeks a root of a nonlinear equation using the Muller method, with complex arithmetic.
1510. zero_muller_test
1511. zero_rc, a C code which seeks a solution of a scalar nonlinear equation f(x)=0, using reverse communication (RC), by Richard Brent.
1512. zero_rc_test
1513. ziggurat, a C code which samples the uniform, normal or exponential distributions, using the ziggurat method, by Marsaglia and Tsang.
1514. ziggurat_test
1515. ziggurat_inline, a C code which generates variates from the uniform, normal or exponential distributions, using an inline random number generator for very fast execution, by Marsaglia and Tsang.
1516. ziggurat_inline_test
1517. ziggurat_openmp, a C code which demonstrates how ziggurat() can be used as a random number generator (RNG) in an OpenMP parallel program.
1518. ziggurat_openmp_test