cpp_src

---

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. anagram, a C++ code which determines anagrams of a string, by James Cherry;
5. anagram_test
6. 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 program by Brian Tung.
7. analemma_test
8. 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.
9. annulus_monte_carlo_test
10. 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.
11. annulus_rule_test
12. args, a C++ code which reports the command line arguments with which it was invoked;
13. args_test
14. 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;
15. asa005_test
16. 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;
17. asa006_test
18. 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.
19. asa007_test
20. asa032, a C++ code which evaluates the incomplete Gamma function, by G Bhattacharjee. This is a version of Applied Statistics Algorithm 32.
21. asa032_test
22. 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.
23. asa047_test
24. 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.
25. asa053_test
26. asa058, a C++ code which implements the K-means data clustering algorithm, by David Sparks. This is a version of Applied Statistics Algorithm 58.
27. asa058_test
28. 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.
29. asa063_test
30. 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.
31. asa066_test
32. 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.
33. asa076_test
34. 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.
35. asa082_test
36. 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.
37. asa091_test
38. asa103, a C++ code which evaluates the digamma or psi function, by Jose Bernardo. This is a version of Applied Statistics Algorithm 103.
39. asa103_test
40. asa109, a C++ code which inverts the incomplete Beta function, by Cran, Martin and Thomas. This is a version of Applied Statistics Algorithm 109.
41. asa109_test
42. 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.
43. asa111_test
44. 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.
45. asa113_test
46. asa121, a C++ code which evaluates the trigamma function, by BE Schneider. This is a version of Applied Statistics Algorithm 121.
47. asa121_test
48. asa136, a C++ code which implements a clustering algorithm, by Hartigan and Wong. This is a version of Applied Statistics Algorithm 136.
49. asa136_test
50. asa144, a C++ code which randomly generates an RxC contingency table, by James Boyett. This is a version of Applied Statistics Algorithm 144.
51. asa144_test
52. asa147, a C++ code which evaluates the incomplete Gamma function, by Chi Leung Lau. This is a version of Applied Statistics Algorithm 147.
53. asa147_test
54. 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.
55. asa152_test
56. asa159, a C++ code which randomly generates an RxC contingency table, by Michael Patefield; This is a version of Applied Statistics Algorithm 159.
57. asa159_test
58. 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.
59. asa172_test
60. asa183, a C++ code which implements a random number generator (RNG), by Wichman and Hill. This is a version of Applied Statistics Algorithm 183.
61. asa183_test
62. 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.
63. asa226_test
64. asa239, a C++ code which evaluates the incomplete Gamma function, by Shea. This is a version of Applied Statistics Algorithm 239.
65. asa239_test
66. 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.
67. asa241_test
68. 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.
69. asa243_test
70. asa245, a C++ code which evaluates the logarithm of the Gamma function, by Allan Mcleod; this is a version of Applied Statistics Algorithm 245.
71. asa245_test
72. asa266, a C++ code which evaluates various properties of the Dirichlet Probability Density Function (PDF); this is a version of Applied Statistics Algorithm 266;
73. asa266_test
74. 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;
75. asa299_test
76. 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.
77. asa310_test
78. 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;
79. asa314_test
80. atbash, a C++ code which applies the Atbash substitution cipher to a string of text.
81. atbash_test
82. b1g3, a C++ code which solves one or more ordinary differential equations (ODE) with the b1g3 method, using fsolve() to solve the implicit equation.
83. b1g3_test
84. backtrack_binary_rc, a C++ code which carries out a backtrack search for a set of binary decisions, using reverse communication.
85. backtrack_binary_rc_test
86. 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.
87. backward_euler_test
88. ball_grid, a C++ code which computes grid points inside a 3D ball.
89. ball_grid_test
90. 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.
91. ball_integrals_test
92. 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;
93. ball_monte_carlo_test
94. bank_code, 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 valid.
95. bank_code_test
96. 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.
97. barycentric_interp_1d_test
98. bdf2, a C++ code which solves one or more ordinary differential equations (ODE) using the (implicit) backward difference formula (BDF) of order 2, using fsolve() to solve the implicit equation.
99. bdf2_test
100. bdf3, a C++ code which solves one or more ordinary differential equations (ODE) using the (implicit) backward difference formula (BDF) of order 3, using fsolve() to solve the implicit equation.
101. bdf3_test
102. 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.
103. bellman_ford_test
104. bernstein_polynomial, a C++ code which evaluates the Bernstein polynomials;
105. bernstein_polynomial_test
106. besselj, a C++ code which evaluates Bessel J functions of noninteger order;
107. besselj_test
108. besselj_zero, a C++ code which computes zeros of any Bessel j function of integer order n.
109. besselj_zero_test
110. besselzero, a C++ code which computes the zeros of Bessel j and y functions.
111. besselzero_test
112. beta_nc, a C++ code which evaluates the cumulative density function (CDF) of the noncentral Beta distribution;
113. beta_nc_test
114. 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
115. biharmonic_exact_test
116. bins, a C++ code which handles geometric data partially sorted into bins;
117. bins_test
118. 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.
119. bisection_test
120. 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].
121. bisection_integer_test
122. bisection_min, a C++ code which uses the bisection method to estimate a minimizer of a function f(x) assumed to be strictly unimodal ("U-shaped") over the interval [a,b].
123. bisection_min_test
124. 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).
125. bisection_rc_test
126. black_scholes, a C++ code which implements some simple approaches to the Black-Scholes option valuation theory, by Desmond Higham.
127. black_scholes_test
128. blas0, a C++ code which contains auxilliary functions for the Basic Linear Algebra Subprograms (BLAS).
129. blas0_test
130. blas1_d, a C++ code which constitutes the Level 1 Basic Linear Algebra Subprograms (BLAS), using double precision real arithmetic, by Charles Lawson, Richard Hanson, David Kincaid, Fred Krogh.
131. blas1_d_test
132. blas1_z, a C++ code which constitutes the Level 1 Basic Linear Algebra Subprograms (BLAS), using double precision complex arithmetic, by Charles Lawson, Richard Hanson, David Kincaid, Fred Krogh.
133. blas1_z_test
134. blas2_d, a C++ code which constitutes the Level 2 Basic Linear Algebra Subprograms (BLAS), for matrix-vector operations, using double precision real arithmetic.
135. blas2_d_test
136. blas3_d, a C++ code which constitutes the Level 3 Basic Linear Algebra Subprograms (BLAS) for matrix-matrix operations, using double precision arithmetic;
137. blas3_d_test
138. blend, a C++ code which "blends" multidimensional data, that is, performs a kind of interpolation. However, in this case, the data may be known at points, or curves, or planes, and is to be extended to a higher-dimensional domain.
139. blend_test
140. bmp_io, a C++ code which reads or writes the graphics information in a Microsoft BMP file.
141. bmp_io_test
142. bmp_to_ppma, a C++ code which converts an image file from Microsoft BMP format to ASCII Portable Pixel Map (PPM) format.
143. bmp_to_ppma_test
144. bmp_to_ppmb, a C++ code which converts an image file from Microsoft BMP format to binary Portable Pixel Map (PPM) format.
145. bmp_to_ppmb_test
146. boost_test, a C++ code which demonstrates the boost() libraries.
147. 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;
148. box_behnken_test
149. 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).
150. brc_data_test
151. 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).
152. brc_naive_test
153. brownian_motion_simulation, a C++ code which simulates Brownian motion in an M-dimensional region, creating graphics files for processing by gnuplot().
154. brownian_motion_simulation_test
155. burgers_exact, a C++ code which evaluates exact solutions of the time-dependent 1D viscous Burgers equation.
156. burgers_exact_test
157. bvec, a C++ code which demonstrates how signed integers can be stored as binary vectors, and arithmetic can be performed on them.
158. bvec_test
159. c++_calls_c_test, a C++ code which which calls a C function.
160. c++_calls_f77_test, a C++ code which calls a FORTRAN77 subroutine.
161. c++_calls_f90_test, a C++ code which calls a FORTRAN90 subroutine.
162. c8_complex_lib, a C++ code which implements double precision complex (C8) numbers;
163. c8_complex_lib_test
164. c8lib, a C++ code which implements certain elementary functions for double precision complex (C8) variables;
165. c8lib_test
166. c8poly, a C++ code which operates on complex polynomials.
167. c8poly_test
168. caesar, a C++ code which applies a Caesar Shift Cipher to a string of text.
169. caesar_test
170. calendar_rd, a C++ code which computes the representation of a given date in a number of calendrical systems, by Edward Reingold and Nachum Dershowitz.
171. calendar_rd_test
172. 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.
173. calpak_test
174. 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.
175. candy_count_test
176. catalog, a C++ code which reads a C, C++, Fortran77, Fortran90, MATLAB, Octave, Python, or R file, and prints every line that begins with a special index tag that identifies each individual function. If the code has been marked up expecting this convention, it is a handy way of making a table of contents of a program file.
177. catalog_test
178. cauchy_principal_value, a C++ code which uses Gauss-Legendre quadrature to estimate the Cauchy Principal Value (CPV) of certain singular integrals.
179. cauchy_principal_value_test
180. caustic_opengl, a C++ code which generates an image of a caustic curve, by drawing n equally spaced points in a circle, and then connecting specific pairs of points using a spacing parameter m, and displays it using OpenGL.
181. caustic_opengl_test
182. cblas_test, a C++ code which uses cblas(), which, is a C translation of the Fortran77 Basic Linear Algebra Subprograms (BLAS) used by the C translation of the Fortran77 LAPACK linear algebra package.
183. ccn_rule, a C++ code which defines a nested Clenshaw Curtis quadrature rule.
184. ccn_rule_test
185. ccs_io, a C++ code which reads and writes sparse linear systems stored in the Compressed Column Storage (CCS) format.
186. ccs_io_test
187. ccs_to_st, a C++ code which converts a sparse matrix from Compressed Column Storage (CCS) to sparse triplet (ST) format.
188. ccs_to_st_test
189. 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.
190. cdflib_test
191. cellular_automaton, a C++ code which demonstrates the 1D Cellular Automaton known as rule #30.
192. cellular_automaton_test
193. 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 symmetric positive definite (SPD)
194. cg_test
195. cg_rc, a C++ code which implements the conjugate gradient (CG) method for solving a symmetric positive definite (SPD) sparse linear system A*x=b, using reverse communication (RC).
196. cg_rc_test
197. 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.
198. change_dynamic_test
199. chebyshev, a C++ code which computes the Chebyshev interpolant or approximant to a given function over an interval.
200. chebyshev_test
201. 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).
202. chebyshev_interp_1d_test
203. 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.
204. chebyshev_polynomial_test
205. 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.
206. chebyshev_series_test
207. chebyshev1_exactness, a C++ code which tests the polynomial exactness of Gauss-Chebyshev type 1 quadrature rules.
208. chebyshev1_exactness_test
209. chebyshev1_rule, a C++ code which computes and writes out a Gauss-Chebyshev type 1 quadrature rule of given order.
210. chebyshev1_rule_test
211. chebyshev2_exactness, a C++ code which tests the polynomial exactness of Gauss-Chebyshev type 2 quadrature rules.
212. chebyshev2_exactness_test
213. chebyshev2_rule, a C++ code which computes a Gauss-Chebyshev type 2 quadrature rule of given order.
214. chebyshev2_rule_test
215. chrpak, a C++ code which manipulates characters and strings;
216. chrpak_test
217. circle_arc_grid, a C++ code which computes grid points along a circular arc.
218. circle_arc_grid_test
219. 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.
220. circle_integrals_test
221. 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;
222. circle_monte_carlo_test
223. 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).
224. circle_rule_test
225. 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().
226. circle_segment_test
227. cities, a C++ code which works with city-to-city distance matrices;
228. cities_test
229. clapack_test, a C++ code which uses clapack(), a C translation of the blas() and lapack() linear algebra libraries.
230. clausen, a C++ code which evaluates a Chebyshev interpolant to the Clausen function Cl2(x).
231. clausen_test
232. clenshaw_curtis_grid, a C++ code which sets up a Clenshaw Curtis quadrature rule in multiple dimensions;
233. clenshaw_curtis_grid_test
234. clenshaw_curtis_rule, a C++ code which implements a Clenshaw Curtis quadrature rule;
235. clenshaw_curtis_rule_test
236. 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.
237. closest_pair_brute_test
238. 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.
239. closest_point_brute_test
240. cnf_io, a C++ code which reads or writes DIMACS Conjunctive Normal Form (CNF) files defining satisfiability problems in terms of a boolean formula.
241. cnf_io_test
242. collatz_recursive, a C++ code which demonstrates recursive programming by considering the simple Collatz 3n+1 problem.
243. collatz_recursive_test
244. colored_noise, a C++ code which generates samples of noise obeying a 1/f^alpha power law.
245. colored_noise_test
246. 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.
247. combo_test
248. 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.
249. communicator_mpi_test
250. 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.
251. companion_matrix_test
252. 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.
253. compass_search_test
254. complex_numbers_test, a C++ code which demonstrates some simple features involved in the use of complex numbers in C programming.
255. 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.
256. components_test
257. condition, a C++ code which implements several methods of computing or estimating the condition number of a matrix.
258. condition_test
259. continued_fraction, a C++ code which implements some simple algorithms for dealing with simple and generalized continued fractions.
260. continued_fraction_test
261. continuity_exact, a C++ code which returns a 2D velocity vector field (u,v)(x,y) which is an exact solution of the partial differential equation (PDE) sometimes called the continuity equation of fluid mechanics, which has the form ux + vy = 0.
262. continuity_exact_test
263. cordic, a C++ code which computes a few special functions using the CORDIC algorithm.
264. cordic_test
265. correlation, a C++ code which contains examples of statistical correlation functions.
266. correlation_test
267. cosine_integral, a C++ code which evaluates the Cosine Integral, by Shanjie Zhang, Jianming Jin;
268. cosine_integral_test
269. cosine_transform, a C++ code which demonstrates some simple properties of the discrete cosine transform (DCT).
270. cosine_transform_test
271. cpp_arrays_test, a C++ code which uses vectors, matrices and tensors.
272. cpp_combinatorics, a C++ code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.
273. cpp_exact, a C++ code which evaluates exact solutions to a few selected examples of ordinary differential equations (ODE) and partial differential equations (PDE).
274. cpp_files_test, a C++ code which uses files.
275. cpp_grid, a C++ code which generates a regular grid of points inside a variety of regions in one, two, three or many dimensions.
276. cpp_integrals, a C++ code which returns the exact value of the integral of any monomial over a line, square, cube, a polygon, a circle, a disk, a sphere, a ball, a triangle, a tetrahedron, a simplex, and various other geometric regions.
277. cpp_intrinsics_test, a C++ code which illustrates the use of intrinsic functions supplied by C++.
278. cpp_monte_carlo, a C++ code which uses Monte Carlo sampling to estimate areas and integrals.
279. cpp_ode, a C++ code which sets up various systems of ordinary differential equations (ODE).
280. cpp_ode_solver, a C++ code which solves one or more differential equations (ODE) using a method of a particular order, either explicit or implicit. Some methods require a nonlinear equation solver. Some methods used a fixed stepsize, while others adapt the stepsize based on an error estimate.
281. cpp_random_test, a C++ code which uses the random number generator (RNG) functions.
282. cpp_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).
283. cpp_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.
284. cpp_test, a C++ code which illustrates some features of the C++ language;
285. cr2crlf, a C++ code which reads a text file and replaces carriage returns by carriage returns + line feeds.
286. cr2crlf_test
287. cr2lf, a C++ code which reads a text file and replaces carriage returns by line feeds.
288. cr2lf_test
289. crc, a C++ code which computes the cyclic redundancy checksum (CRC) as used by the PNG data format.
290. crc_test
291. cross_chaos, a C++ code which creates a dot-plot of a cross by repeatedly applying a randomized linear transformation to a starting point.
292. cross_chaos_test
293. crrm, a C++ code which reads a text file and removes the carriage return character.
294. crrm_test
295. 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.
296. cube_arbq_rule_test
297. cube_exactness, a C++ code which investigates the polynomial exactness of quadrature rules over the interior of a cube in 3D.
298. cube_exactness_test
299. cube_felippa_rule, a C++ code which returns a Felippa quadrature rule for approximating integrals over the interior of a cube in 3D.
300. cube_felippa_rule_test
301. cube_grid, a C++ code which computes a grid of points over the interior of a cube in 3D.
302. cube_grid_test
303. 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.
304. cube_integrals_test
305. 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.
306. cube_monte_carlo_test
307. 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.
308. cuda_loop_test
309. cvt, a C++ code which computes an N point Centroidal Voronoi Tessellation (CVT) in M dimensions;
310. cvt_test
311. cvt_box, a C++ code which carries out a Centroidal Voronoi Tessellation (CVT) calculation constrained to a box region, with points projected to the boundary;
312. cvt_box_test
313. cycle_brent, a C++ code which carries out an iterated function evaluation to determine the nearest element of a cycle, and the cycle's length, using Brent's method.
314. cycle_brent_test
315. 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's length, using Floyd's method.
316. cycle_floyd_test
317. cyclic_reduction, a C++ code which solves a tridiagonal linear system using cyclic reduction;
318. cyclic_reduction_test
319. deblank, a C++ code which reads a file and writes a copy containing no blank lines.
320. deblank_test
321. decomment, a C++ code which makes a copy of a text file that omits all comment lines, that begin with "#".
322. decomment_test
323. delaunay_tree_2d, a C++ code which computes the Delaunay triangulation of a 2D dataset, by Olivier Devillers.
324. delaunay_tree_2d_test
325. detroff, a C++ code which removes from a file every occurrence of the troff() overprint pair character+backspace, that makes a man() page printable;
326. detroff_test
327. diaphony, a C++ code which computes the diaphony of an M-dimensional pointset.
328. diaphony_test
329. differ, a C++ code which 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.
330. differ_test
331. dijkstra, a C++ code which implements a simple version of Dijkstra's minimum distance algorithm for graphs.
332. dijkstra_test
333. dijkstra_openmp, a C++ code which uses OpenMP to parallelize a simple example of Dijkstra's minimum distance algorithm for graphs.
334. dijkstra_openmp_test
335. dirichlet, a C++ code which evaluates the Dirichlet kernel function, sometimes called the periodic sinc function. The function includes a parameter n, normally taken to be an integer. The function is defined by diric(x,n)=sin(0.5*n*x)/n/sin(0.5*x). Sample plots of these functions are made.
336. dirichlet_test
337. 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.
338. discrete_pdf_sample_2d_test
339. 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.
340. disk_grid_test
341. 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;
342. disk_monte_carlo_test
343. disk_rule, a C++ code which computes quadrature rules for the general disk in 2D.
344. disk_rule_test
345. 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.
346. disk01_integrals_test
347. 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;
348. disk01_monte_carlo_test
349. 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;
350. disk01_positive_monte_carlo_test
351. 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).
352. disk01_rule_test
353. dislin_test, a C++ code which calls dislin(), which is a package of scientific graphics software.
354. 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.
355. divdif_test
356. doomsday, a C++ code which is given the year, month and day of a date, and uses John Conway's doomsday algorithm to determine the corresponding day of the week.
357. doomsday_test
358. doughnut_exact, a C++ code which evaluates an exact solution of a system of ordinary differential equations (ODE) whose trajectories lie on a torus or doughnut, and for which an exact solution is known.
359. doughnut_exact_test
360. doughnut_ode, a C++ code which sets up and solves a system of ordinary differential equations (ODE) whose trajectories lie on a torus or doughnut, and for which an exact solution is known.
361. doughnut_ode_test
362. dragon_chaos, a C++ code which creates a dot-plot of a dragon by repeatedly applying a randomized linear transformation to a starting point.
363. dragon_chaos_test
364. 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.
365. dream_test
366. duel_simulation, a C++ code which simulates N repetitions of a duel between two players, each of whom has a known firing accuracy.
367. duel_simulation_test
368. 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.
369. edge_test
370. eigs, a C++ code which computes the eigenvalues and eigenvectors of a matrix.
371. eigs_test
372. 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();
373. eispack_test
374. ellipse, a C++ code which carries out geometric calculations for ellipses and ellipsoids, including area, distance to a point, eccentricity, perimeter, points along the perimeter, random sampling, conversion between standard and quadratic forms.
375. ellipse_test
376. ellipse_grid, a C++ code which computes grid points over the interior of an ellipse in 2D.
377. ellipse_grid_test
378. 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.
379. ellipse_monte_carlo_test
380. ellipsoid, a C++ code which carries out geometric calculations for ellipsoids, including area, random sampling, conversion between standard and quadratic forms.
381. ellipsoid_test
382. ellipsoid_grid, a C++ code which computes a grid of points over the interior of an ellipsoid in 3D.
383. ellipsoid_grid_test
384. 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.
385. ellipsoid_monte_carlo_test
386. elliptic_integral, a C++ code which evaluates complete elliptic integrals of first, second and third kind, using Carlson's elliptic integral functions.
387. elliptic_integral_test
388. euler, a C++ code which solves one or more ordinary differential equations (ODE) using the forward Euler method.
389. euler_test
390. 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).
391. exactness_test
392. fair_dice_simulation, a C++ code which simulates N tosses of 2 dice, creating graphics files for processing by gnuplot().
393. fair_dice_simulation_test
394. faure, a C++ code which computes elements of the Faure M-dimensional Quasi Mont Carlo (QMC) sequence;
395. faure_test
396. fd_predator_prey, a C++ code which solves a pair of predator prey ordinary differential equations (ODE) using the finite difference method (FDM).
397. fd_predator_prey_test
398. 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().
399. fd1d_advection_diffusion_steady_test
400. 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) method, writing graphics files for processing by gnuplot().
401. fd1d_advection_ftcs_test
402. 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().
403. fd1d_advection_lax_test
404. 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().
405. fd1d_advection_lax_wendroff_test
406. 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.
407. fd1d_burgers_lax_test
408. 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.
409. fd1d_burgers_leap_test
410. fd1d_bvp, a C++ code which applies the finite difference method (FDM) to a two point boundary value problem (BVP) in one spatial dimension.
411. fd1d_bvp_test
412. fd1d_heat_explicit, a C++ code which uses the finite difference method (FDM), with explicit time stepping, to solve the time dependent 1D heat equation;
413. fd1d_heat_explicit_test
414. fd1d_heat_implicit, a C++ code which implements a finite difference method (FDM), implicit in time, of the time dependent 1D heat equation;
415. fd1d_heat_implicit_test
416. fd1d_heat_steady, a C++ code which implements a finite difference method (FDM) for the steady (time independent) 1D heat equation;
417. fd1d_heat_steady_test
418. fd1d_wave, a C++ code which applies the finite difference method (FDM) to solve the time-dependent wave equation utt = c * uxx in one spatial dimension.
419. fd1d_wave_test
420. fd2d_heat_steady, a C++ code which implements a finite difference method (FDM) for the steady (time independent) 2D heat equation;
421. fd2d_heat_steady_test
422. 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.)
423. fem_basis_test
424. 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;
425. fem_io_test
426. 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.
427. fem_to_gmsh_test
428. 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 Jonathan Shewchuk's triangle() program.
429. fem_to_triangle_test
430. fem_to_xml, 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 corresponding XML file for input to DOLFIN or FENICS.
431. fem_to_xml_test
432. 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;
433. fem1d_test
434. 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;
435. fem1d_adaptive_test
436. 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.
437. fem1d_bvp_linear_test
438. 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.
439. fem1d_bvp_quadratic_test
440. fem1d_heat_steady, a C++ code which implements the finite element method (FEM) for the steady (time independent) 1D heat equation;
441. fem1d_heat_steady_test
442. 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.
443. fem1d_lagrange_test
444. 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;
445. fem1d_nonlinear_test
446. fem1d_pack, a C++ code which contains utilities for 1D finite element method (FEM) calculations.
447. fem1d_pack_test
448. 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;
449. fem1d_pmethod_test
450. 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 solution from one mesh to another.
451. fem1d_project_test
452. 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.
453. fem1d_sample_test
454. 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.
455. fem2d_bvp_linear_test
456. 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.
457. fem2d_bvp_quadratic_test
458. 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.
459. fem2d_bvp_serene_test
460. fem2d_heat, a C++ code which applies the finite element method (FEM) to solve the time-dependent heat equation in an arbitrary triangulated region in 2D;
461. fem2d_heat_test
462. fem2d_heat_rectangle, a C++ code which applies the finite element method (FEM) to solve the time dependent heat equation on a square in 2D;
463. fem2d_heat_rectangle_test
464. fem2d_mesh_display_opengl, a C++ code which reads the finite element method (FEM) model of a 2D mesh, consisting of polygonal elements of any uniform order, and displays an image of the elements and nodes using OpenGL.
465. fem2d_mesh_display_opengl_test
466. fem2d_pack, a C++ code which implements various 2D finite element method (FEM) calculations;
467. fem2d_pack_test
468. 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.
469. fem2d_poisson_rectangle_test
470. 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.
471. fem2d_poisson_rectangle_linear_test
472. fem2d_project, a C++ code which projects a function f(x,y), given as data, into a given finite element space of piecewise linear triangular elements.
473. fem2d_project_test
474. fem2d_project_function, a C++ code which projects a function f(x,y), given as a formula, into a given finite element space of piecewise linear triangular elements.
475. fem2d_project_function_test
476. fem2d_sample, a C++ code which samples a finite element method (FEM) function, defined by FEM files, (three text files describing the nodes, triangles, and coefficients); at arbitrary points.
477. fem2d_sample_test
478. fem3d_pack, a C++ code which contains utilities for 3D finite element method (FEM) calculations.
479. fem3d_pack_test
480. fem3d_project, a C++ code which projects a function f(x,y,z), given as a data, into a given space of piecewise linear tetrahedrons associated with the finite element method (FEM).
481. fem3d_project_test
482. fem3d_sample, a C++ code which evaluates a finite element function defined on a 3D tetrahedral mesh.
483. fem3d_sample_test
484. fermat_factor, a C++ code which uses Fermat's factorization method to decompose an integer N into the product of two factors, N = A^2-B^2 = (A+B)*(A-B).
485. fermat_factor_test
486. fern_chaos, a C++ code which applies a randomized linear map to a starting point to compute the Barnsley fractal fern.
487. fern_chaos_test
488. fern_opengl, a C++ code which uses OpenGL to display the Barnsley fractal fern.
489. fern_opengl_test
490. feynman_kac_1d, a C++ code which demonstrates the use of the Feynman-Kac algorithm to solve Poisson's equation in a 1D interval by averaging stochastic paths to the boundary.
491. feynman_kac_1d_test
492. feynman_kac_2d, a C++ code which demonstrates the use of the Feynman-Kac algorithm to solve Poisson's equation in a 2D ellipse by averaging stochastic paths to the boundary.
493. feynman_kac_2d_test
494. feynman_kac_3d, a C++ code which demonstrates the use of the Feynman-Kac algorithm to solve Poisson's equation in a 3D ellipsoid by averaging stochastic paths to the boundary.
495. feynman_kac_3d_test
496. fft_openmp, a C++ code which demonstrates the computation of a Fast Fourier Transform (FFT) in parallel, using OpenMP.
497. fft_openmp_test
498. 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.
499. fft_serial_test
500. file_name_sequence, a C++ code which demonstrates ways to generate a sequence of filenames, which can be useful when generating a sequence of still snapshots to be animated later.
501. file_name_sequence_test
502. files_multiple, a C++ code which demonstrates how a program can open multiple output files at one time, and write data to any one specific file it chooses.
503. files_multiple_test
504. filon_rule, a C++ code which uses Filon's method to approximates integrals with an oscillatory factor of sin(k*x) or cos(k*x).
505. filon_rule_test
506. filum, a C++ code which performs various operations with files;
507. filum_test
508. 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.
509. fire_simulation_test
510. fisher_exact, a C++ code which returns an exact solution u(x,t) of the Kolmogorov Petrovsky Piskonov Fisher partial differential equation (PDE): ut=uxx+u*(1-u).
511. fisher_exact_test
512. flame_exact, a C++ code which returns the exact solution y(t) 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.
513. flame_exact_test
514. floyd, a C++ code which implements Floyd's algorithm for finding the shortest distance between pairs of nodes on a directed graph.
515. floyd_test
516. 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.
517. fn_test
518. football_dynamic, a C++ code which uses dynamic programming to count the ways of achieving a given score in football.
519. football_dynamic_test
520. freefem_msh_io, a C++ code which reads and writes files used by the FreeFem++ finite element program to store mesh information.
521. freefem_msh_io_test
522. fresnel, a C++ code which evaluates the Fresnel cosine and sine integrals.
523. fresnel_test
524. 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.
525. fsolve_test
526. fsu_dakota, a C++ code which implements a variety of methods for the generation of Quasi Monte Carlo (QMC) numbers, submitted for inclusion in the Sandia Labs DAKOTA package;
527. fsu_dakota_test
528. g++_intrinsics_test, a C++ code which tests or demonstrates some of the intrinsic functions provided by the Gnu G++ compiler for C++.
529. g++_quadmath_test, a C++ code which illustrates the use of quadruple precision real arithmetic, as provided on some systems by the Gnu g++ compiler for C++.
530. gauss_seidel, a C++ code which implements the Gauss-Seidel iteration for linear systems.
531. gauss_seidel_test
532. gaussian, a C++ code which evaluates the Gaussian function for arbitrary mu and sigma, its antiderivative, and derivatives of arbitrary order.
533. gaussian_test,
534. gegenbauer_cc, a C++ code which computes the Gegenbauer weighted integral of a function f(x) using a Clenshaw-Curtis approach.
535. gegenbauer_cc_test
536. gegenbauer_exactness, a C++ code which tests the polynomial exactness of Gauss-Gegenbauer quadrature rules.
537. gegenbauer_exactness_test
538. gegenbauer_polynomial, a C++ code which evaluates the Gegenbauer polynomial and associated functions.
539. gegenbauer_polynomial_test
540. gegenbauer_rule, a C++ code which computes and writes out a Gauss-Gegenbauer quadrature rule of given order.
541. gegenbauer_rule_test
542. gen_hermite_exactness, a C++ code which tests the polynomial exactness of generalized Gauss-Hermite quadrature rules.
543. gen_hermite_exactness_test
544. gen_hermite_rule, a C++ code which computes and writes out a generalized Gauss-Hermite quadrature rule of given order and parameter value.
545. gen_hermite_rule_test
546. gen_laguerre_exactness, a C++ code which tests the polynomial exactness of generalized Gauss-Laguerre quadrature rules.
547. gen_laguerre_exactness_test
548. gen_laguerre_rule, a C++ code which computes and writes out a generalized Gauss-Laguerre quadrature rule of given order and parameter value.
549. gen_laguerre_rule_test
550. 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.
551. geometry_test
552. geompack, a C++ code which computes Delaunay triangulations, Voronoi diagrams, and other information, by Barry Joe.
553. geompack_test
554. 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.
555. gl_fast_rule_test
556. 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.
557. glomin_test
558. 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).
559. gmsh_io_test
560. 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.
561. gmsh_to_fem_test
562. gnuplot_test, a C++ code which uses gnuplot() to create various kinds of plots.
563. golden_section, a C++ code which estimates a minimizer of a function f(x) over the interval [a,b], assuming f(x) is unimodal ("U-shaped") over [a,b].
564. golden_section_test
565. gprof_test
566. graphics_dislin_test, a C++ code which creates various kinds of plots using the dislin() library.
567. grf_display_opengl, a C++ code which reads a GRF file containing information about an abstract graph and displays a plot using OpenGL.
568. grf_display_opengl_test
569. grf_io, a C++ code which reads or writes a GRF file;
570. grf_io_test
571. grid_to_bmp, a C++ code which reads a text file of data on a rectangular grid and creates a BMP graphics file containing a color image of the data.
572. grid_to_bmp_test
573. 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.
574. haar_transform, a C++ code which computes the Haar transform of 1d or 2d data.
575. haar_transform_test
576. halton, a C++ code which computes elements of a Halton Quasi Monte Carlo (QMC) sequence, using a simple interface.
577. halton_test
578. hammersley, a C++ code which computes elements of a Hammersley Quasi Monte Carlo (QMC) sequence, using a simple interface.
579. hammersley_test
580. hankel_cholesky, a C++ code which computes the upper Cholesky factor R of a symmetric positive definite (SPD) matrix so that H = R' * R.
581. hankel_cholesky_test
582. 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'.
583. hankel_spd_test
584. hb_io, a C++ code which reads and writes sparse linear systems stored in the Harwell Boeing (HB) format for sparse matrices.
585. hb_io_test
586. hdf5_test, a C++ code which uses HDF5, a file format, library, and utility codes for efficiently managaing large and complex datasets.
587. heat_mpi, a C++ code which uses the Message Passing Interface (MPI) to solve the 1D time dependent heat equation.
588. heat_mpi_test
589. 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 a parallel version. A contour plot of the solution is created using gnuplot().
590. heated_plate_test
591. 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.
592. heated_plate_openmp_test
593. hello, a C++ code which prints out "Hello, world!".
594. hello_test
595. hello_mpi, a C++ code which prints out "Hello, world!" using the Message Passing Interface (MPI) for parallel programming.
596. hello_mpi_test
597. hello_openmp, a C++ code which prints out "Hello, world!" within the OpenMP parallel programming environment.
598. hello_openmp_test
599. helmholtz_exact, a C++ code which evaluates an exact solution z(x,y) for the Helmholtz equation, a sort of eigenvalue version of a partial differential equation (PDE) arising after separation of variables is a applied to the wave equation. This example considers a problem in which z(x,y) represents the vertical deflection of the surface of a vibrating circular membrane such as a drumhead. The Helmholtz equation has the form: - del^2 Z = k^2 Z.
600. helmholtz_exact_test
601. 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.
602. helmholtz_openmp_test
603. hermite_cubic, a C++ code which computes the value, derivatives or integral of a Hermite cubic polynomial, or manipulates an interpolating function made up of piecewise Hermite cubic polynomials.
604. hermite_cubic_test
605. 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).
606. hermite_exactness_test
607. hermite_integrands, a C++ code which defines test integrands for Hermite integrals with density exp(-x^2) over the interval (-oo,+oo).
608. hermite_integrands_test
609. hermite_interpolant, a C++ code which computes the Hermite interpolant, a polynomial that matches function values and derivatives.
610. hermite_interpolant_test
611. hermite_polynomial, a C++ code which evaluates the physicist's Hermite polynomial, the probabilist's Hermite polynomial, the Hermite function, and related functions.
612. hermite_polynomial_test
613. hermite_product_polynomial, a C++ code which defines Hermite product polynomials, creating a multivariate polynomial as the product of univariate Hermite polynomials.
614. hermite_product_polynomial_test
615. 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).
616. hermite_rule_test
617. hexahedron_jaskowiec_rule, a C++ code which returns a symmetric Jaskowiec quadrature rule for the hexahedron, with exactness up to total degree 21.
618. hexahedron_jaskowiec_rule_test
619. hexahedron_witherden_rule, a C++ code which returns a symmetric Witherden quadrature rule for the hexahedron, with exactness up to total degree 11.
620. hexahedron_witherden_rule_test
621. hexdump, a C++ code which produces a hexadecimal dump of a file;
622. hexdump_test
623. 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 program uses gnuplot() to create a graph of the results.
624. high_card_simulation_test
625. hilbert_curve, a C++ code which computes the sequence of discrete Hilbert curves whose limit is a space-filling curve.
626. hilbert_curve_test
627. 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.
628. histogram_data_2d_sample_test
629. htmlindex, a C++ code which creates a skeleton HTML page for a marked-up C, C++ or FORTRAN file;
630. htmlindex_test
631. humps, a C++ code which evaluates the humps() function, its first and second derivatives and its antiderivative.
632. humps_test
633. hyper_2f1, a C++ code which evaluates the hypergeometric functions 2F1(a,b,c;x) for real or complex parameters a, b, c, and argument x, by N. Michel and M. Stoitsov.
634. hyper_2f1_test
635. 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.
636. hyperball_integrals_test
637. 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;
638. hyperball_monte_carlo_test
639. hypercube_exactness, a C++ code which tests the polynomial exactness of a quadrature rule over the interior of the unit hypercube in M dimensions.
640. hypercube_exactness_test
641. hypercube_grid, a C++ code which computes a grid of points over the interior of a hypercube in M dimensions.
642. hypercube_grid_test
643. 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.
644. hypercube_integrals_test
645. 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.
646. hypercube_monte_carlo_test
647. 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.
648. hypersphere_test
649. 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.
650. hypersphere_integrals_test
651. 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;
652. hypersphere_monte_carlo_test
653. i2_binary_to_ascii, a C++ code which converts a file of short int (I2) data from binary to ASCII format.
654. i2_binary_to_ascii_test
655. i4lib, a C++ code which contains many utility routines, using single precision integer (I4) arithmetic.
656. i4lib_test
657. image_denoise, a C++ code which applies simple filtering operations to a noisy image.
658. image_denoise_test
659. image_edge, a C++ code which demonstrates a simple procedure for edge detection in images.
660. image_edge_test
661. index, a C++ code which converts a M-dimensional 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.
662. index_test
663. interp, a C++ code which parameterizes and interpolates data;
664. interp_test
665. is_prime, a C++ code which implements various versions of the sieve of Eratosthenes to determine whether a given integer is prime.
666. is_prime_test
667. isbn10_code, a C++ code which determines the check digit for a 10 digit International Standard Book Number (ISBN10) or reports whether a given ISBN10 is valid.
668. isbn10_code_test
669. ising_2d_simulation, a C++ code which simulates the evolution of a 2D array of positive and negative charges, each of which is likely to flip to be in agreement with neighbors, using gnuplot() to display the initial and final configurations.
670. ising_2d_simulation_test
671. jacobi, a C++ code which implements the Jacobi iteration for linear systems.
672. jacobi_test
673. jacobi_eigenvalue, a C++ code which implements the Jacobi iteration for the iterative determination of the eigenvalues and eigenvectors of a real symmetric matrix.
674. jacobi_eigenvalue_test
675. jacobi_exactness, a C++ code which tests the polynomial exactness of rules for integrals with a Jacobi weight function.
676. jacobi_exactness_test
677. jacobi_openmp, a C++ code which illustrates the use of the OpenMP application program interface to parallelize a Jacobi iteration solving A*x=b.
678. jacobi_openmp_test
679. jacobi_polynomial, a C++ code which evaluates the Jacobi polynomial and associated functions.
680. jacobi_polynomial_test
681. jacobi_rule, a C++ code which computes and writes out a Gauss-Jacobi quadrature rule of given order.
682. jacobi_rule_test
683. kdv_exact, a C++ code which evaluates an exact solution u(x,t) of the Korteweg-deVries (KdV) partial differential equation (PDE), representing the motion of a soliton. The equation has the form u' - 6 u ux + uxxx = 0.
684. kdv_exact_test
685. kmeans, a C++ code which handles the K-Means problem, which organizes a set of N points in M dimensions into K clusters;
686. kmeans_test
687. knapsack_01_brute, a C++ code which uses brute force to solve small versions of the 0/1 knapsack problem, in which a knapsack of limited weight capacity is to be packed as full as possible, selecting items from a set of varying weights;
688. knapsack_01_brute_test
689. knapsack_brute, a C++ code which uses brute force to solve small versions of the knapsack problem, in which N items are available, each with given value and weight. A thief's knapsack can carry no more than Wmax pounds. The thief seeks a selection of items to carry in the knapsack of maximum total value.
690. knapsack_brute_test
691. knapsack_random, a C code which randomly chooses a subset of N items, each with given value and weight. It then evaluates whether this is a feasible solution to a problem in which a thief's knapsack can carry no more than Wmax pounds, and it is desired to maximum the total value of the selected items.
692. knapsack_random_test
693. knapsack_rational, a C++ code which solves the rational knapsack problem, in which a knapsack of limited weight capacity is filled with profitable items. This variation of the knapsack problem allows a fractional part of an item to be included in the knapsack. The result is an upper bound on the maximum possible profit for the knapsack problem.
694. knapsack_rational_test
695. knapsack_values, a C++ code which returns some simple examples of the knapsack problem, in which N items are available, each with given value V and weight W. A thief's knapsack can carry no more than K pounds. The thief seeks a selection S of items to carry in the knapsack of maximum total value.
696. knapsack_values_test
697. kronrod_rule, a C++ code which computes a Gauss and Gauss-Kronrod pair of quadrature rules of arbitrary order, by Robert Piessens, Maria Branders.
698. kronrod_rule_test
699. l4lib, a C++ code which contains functions for working with logical variables.
700. l4lib_test
701. lagrange, a C++ code which evaluates any Lagrange basis polynomial L(i)(x), its antiderivative, or its first or second derivatives. Sample plots are made.
702. lagrange_test
703. 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)).
704. lagrange_approx_1d_test
705. 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).
706. lagrange_interp_1d_test
707. 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).
708. lagrange_interp_2d_test
709. lagrange_interp_nd, a C++ code which defines and evaluates the Lagrange polynomial p(x) which interpolates a set of data depending on a M-dimensional argument that was evaluated on a product grid, so that p(x(i)) = z(i).
710. lagrange_interp_nd_test
711. lagrange_nd, a C++ code which implements several multivariate Lagrange interpolation schemes developed by Tomas Sauer.
712. lagrange_nd_test
713. 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).
714. laguerre_exactness_test
715. laguerre_integrands, a C++ code which implements test problems for for Gauss-Laguerre type quadrature rules for approximating the integral of a function with density exp(-x) over the interval [0,+oo).
716. laguerre_integrands_test
717. laguerre_polynomial, a C++ code which evaluates the Laguerre polynomial, the generalized Laguerre polynomials, and the Laguerre function.
718. laguerre_polynomial_test
719. 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).
720. laguerre_rule_test
721. lambert_w, a C++ code which evaluates Lambert's W function.
722. lambert_w_test
723. 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.
724. laplace_radial_exact, a C++ code which evaluates exact solutions u(x,y) or u(x,y,z), with radial symmetry, to the Laplace equation: del^2 U = 0.
725. laplace_radial_exact_test
726. 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.
727. laplacian_matrix_test
728. latin_center, a C++ code which computes Latin Center Squares of N points in M dimensions;
729. latin_center_test
730. latin_cover, a C++ code which produces N Latin squares which cover an NxN square, or NxN Latin cubes which cover an NxNxN cube.
731. latin_cover_test
732. latin_edge, a C++ code which computes Latin Edge Squares of N points in M dimensions;
733. latin_edge_test
734. latin_random, a C++ code which computes Latin Random Squares of N points in M dimensions;
735. latin_random_test
736. latinize, a C++ code which adjusts N points in M dimensions to form a Latin Hypercube;
737. latinize_test
738. lattice_rule, a C++ code which returns lattice rules for M-dimensional integration;
739. lattice_rule_test
740. lcvt, a C++ code which creates a Latinized Centroidal Voronoi Tessellation (CVT);
741. lcvt_test
742. leaf_chaos, a C++ code which creates a dot-plot of a leaf by repeatedly applying a randomized linear transformation to a starting point.
743. leaf_chaos_test
744. 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.
745. lebesgue_test
746. 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].
747. legendre_exactness_test
748. legendre_fast_rule, a C++ code which uses a fast (order N) algorithm to compute a Gauss-Legendre quadrature rule of given order.
749. legendre_fast_rule_test
750. legendre_polynomial, a C++ code which evaluates the Legendre polynomial and associated functions.
751. legendre_polynomial_test
752. legendre_product_polynomial, a C++ code which defines Legendre product polynomials, creating a multivariate polynomial as the product of univariate Legendre polynomials.
753. legendre_product_polynomial_test
754. legendre_rule, a C++ code which writes out a Gauss-Legendre quadrature rule of given order.
755. legendre_rule_test
756. legendre_shifted_polynomial, a C++ code which evaluates the shifted Legendre polynomial, with the domain [0,1].
757. legendre_shifted_polynomial_test
758. levenshtein_distance, a C++ code which returns the Levenshtein distance between two strings.
759. levenshtein_distance_test
760. levenshtein_matrix, a C++ code which returns the Levenshtein distance matrix defined by two strings.
761. levenshtein_matrix_test
762. levy_dragon_chaos, a C++ code which creates a dot-plot of the Levy dragon by repeatedly applying a randomized linear transformation to a starting point.
763. levy_dragon_chaos_test
764. lf2cr, a C++ code which converts linefeeds to carriage returns in a file;
765. lf2cr_test
766. lf2crlf, a C++ code which converts linefeeds to carriage returns + linefeeds in a file;
767. lf2crlf_test
768. lfrm, a C++ code which removes all linefeed characters from a file;
769. lfrm_test
770. life_opengl, a C++ code which uses OpenGL to display the evolution of John Conway's Game of life.
771. 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.
772. life_serial_test
773. lights_out_game, a C++ code which sets up the "Lights Out" game, 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.
774. line_cvt_lloyd, a C++ code which applies Lloyd's iteration repeatedly to a set of N points, to compute a Centroidal Voronoi Tessellation (CVT) over the interior of a line segment in 1D.
775. line_cvt_lloyd_test
776. 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.
777. line_fekete_rule_test
778. line_felippa_rule, a C++ code which returns a Felippa quadrature rule for approximating integrals over the interior of a line segment in 1D.
779. line_felippa_rule_test
780. line_grid, a C++ code which computes a grid of points over the interior of a line segment in 1D.
781. line_grid_test
782. 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.
783. line_integrals_test
784. 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.
785. line_monte_carlo_test
786. line_ncc_rule, a C++ code which computes a Newton Cotes (Closed) quadrature rule, using equally spaced points, over the interior of a line segment in 1D.
787. line_ncc_rule_test
788. 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.
789. line_nco_rule_test
790. linear_algebra, C++ codes which carry out various linear algebra operations for matrices stored in a variety of formats.
791. linpack_bench, a C++ code which carries out the LINPACK Benchmark, which measures the time required to factor and solve a large linear system.
792. linpack_bench_test
793. 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 for the singular value decomposition (SVD) of a rectangular matrix, by Jack Dongarra, Cleve Moler, Jim Bunch, Pete Stewart.
794. linpack_d_test
795. linpack_z, a C++ code which factors matrices in a variety of formats, and solving the associated linear systems, using double precision complex arithmetic; it includes a function for the singular value decomposition (SVD) of a rectangular matrix, by Jack Dongarra, Cleve Moler, Jim Bunch, Pete Stewart.
796. linpack_z_test
797. lissajous, a C++ code which plots a Lissajous figure, of the form x = sin ( a1 t + b1 ), y = sin ( a2 t + b2 ), using OpenGL.
798. lissajous_test
799. 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 (RMS) error to a set of N data points.
800. llsq_test
801. lobatto_polynomial, a C++ code which evaluates Lobatto polynomials similar to Legendre polynomials except that they are 0 at both endpoints.
802. lobatto_polynomial_test
803. 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.
804. local_min_test
805. 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.
806. local_min_rc_test
807. log_normal, a C++ code which returns quantities related to the log normal Probability Distribution Function (PDF).
808. log_normal_test
809. 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].
810. log_normal_truncated_ab_test
811. logistic_exact, a C++ code which evaluates an exact solution y(t) of the logistic equation, which models population growth in the face of a limited carrying capacity, an ordinary differential equation (ODE) of the y' = r * ( y - y^2 / k ).
812. logistic_exact_test
813. lorenz_ode, a C++ code which solves the Lorenz system of ordinary differential equations (ODE), creating output files that can be displayed by gnuplot().
814. lorenz_ode_test
815. lorenz96_ode, a C++ code which sets up and solves a system of ordinary differential equations (ODE) devised by Edward Lorenz, as a test of predictability for data assimilation applications.
816. lorenz96_ode_test
817. luhn_code, 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.
818. luhn_code_test
819. machar, a C++ code which dynamically computes the values of various machine constants, by William Cody;
820. machar_test
821. machine, a C++ code which returns tabulated values of the constants associated with computer arithmetic.
822. machine_test
823. makefiles_test, a C++ code which illustrates the use of makefiles for maintaining a software project;
824. mandelbrot, a C++ code which generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot set;
825. mandelbrot_test
826. mandelbrot_openmp, a C++ code which generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot fractal set, using OpenMP for parallel execution;
827. mandelbrot_openmp_test
828. mandelbrot_ppm, a C++ code which generates a binary Portable Pixel Map (PPM) image of the Mandelbrot set, by Eric Weeks.
829. mandelbrot_ppm_test
830. mario, a C++ code which creates a sort of "needlepoint" image of Mario, as an array of colored squares.
831. mario_test
832. 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.
833. matrix_chain_brute_test
834. 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.
835. matrix_chain_dynamic_test
836. matrix_exponential, a C++ code which demonstrates some simple approaches to the problem of computing the exponential of a matrix.
837. matrix_exponential_test
838. md, a C++ code which carries out a molecular dynamics simulation, and is intended as a starting point for implementing an OpenMP parallel version.
839. md_test
840. md_openmp, a C++ code which carries out a molecular dynamics simulation in parallel using OpenMP.
841. md_openmp_test
842. medit_mesh_io, a C++ code which reads or writes medit() MESH files defining a finite element mesh.
843. medit_mesh_io_test
844. 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.
845. medit_to_fem_test
846. 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.
847. memory_test
848. menger_sponge_chaos, a C++ code which creates a dot-plot of the 3D Menger sponge by repeatedly applying a randomized linear transformation to a starting point.
849. menger_sponge_chaos_test
850. 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.
851. mesh_bandwidth_test
852. mesh_display_opengl, a C++ code which reads the name of two data files defining a polygonal mesh, reads the data, and displays the mesh using opengl().
853. mesh_display_opengl_test
854. metis_test, a C++ code which demonstrates metis(), which partitions unstructured graphs or meshes, and computes fill-reducing reorderings of sparse matrices.
855. 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.
856. mgmres_test
857. 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.
858. mgs_test
859. 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.
860. middle_square_test
861. 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.
862. midpoint_test
863. 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().
864. midpoint_adaptive_test
865. 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.
866. midpoint_explicit_test
867. midpoint_fixed, a C++ code which solves one or more ordinary differential equations (ODE) using the (implicit) midpoint method, using a fixed point iteration to solve the associated nonlinear equation.
868. midpoint_fixed_test
869. 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.
870. minesweeper_game, a C++ code which is a text-based implementation of the Minesweeper game, by Detelina Stoyanova.
871. minimal_surface_exact, a C++ code which evaluates exact solutions u(x,y) to the minimal surface equation: (1+Ux^2) Uyy - 2 Ux Uy Uxy + (1+Uy^2) Uxx = 0
872. minimal_surface_exact_test
873. minpack, a C++ code which solves systems of nonlinear equations or nonlinear least squares problems (NLS), by Jorge More, Danny Sorenson, Burton Garbow, Kenneth Hillstrom.
874. minpack_test
875. mixed_test, a C++ code which illustrates mixed language programming in which the main program is written in C++;
876. 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.
877. monomial_test
878. monomial_value, a C++ code which evaluates a monomial in M dimensions.
879. monomial_value_test
880. mpi_test, a C++ code which illustrates the use of the Message Passing Interface (MPI) for parallel programming;
881. 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.
882. multitask_mpi_test
883. 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.
884. multitask_openmp_test
885. mxm, a C++ code which sets up a matrix multiplication problem A=B*C, intended as a starting point for implementing a parallel version.
886. mxm_test
887. mxm_openmp, a C++ code which computes a dense matrix product C=A*B, using OpenMP for parallel execution.
888. mxm_openmp_test
889. 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().
890. naca_test
891. nas, a C++ code which runs the NASA kernel benchmark.
892. nas_test
893. navier_stokes_2d_exact, a C++ code which evaluates an exact solution to the incompressible time-dependent Navier-Stokes equations over an arbitrary domain in 2D.
894. navier_stokes_2d_exact_test
895. navier_stokes_3d_exact, a C++ code which evaluates an exact solution to the incompressible time-dependent Navier-Stokes equations over an arbitrary domain in 3D.
896. navier_stokes_3d_exact_test
897. 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().
898. nearest_interp_1d_test
899. neighbors_to_metis_graph, a C++ code which reads a file describing the neighbor structure of a mesh of triangles or tetrahedrons, and writes a metis_graph() file suitable for input to one of the family of programs based on metis();
900. neighbors_to_metis_graph_test
901. newton_interp_1d, a C++ code which finds a polynomial interpolant to data using Newton divided differences.
902. newton_interp_1d_test
903. niederreiter, a C++ code which computes elements of the Niederreiter Quasi Mont Carlo (QMC) M-dimensional sequence [arbitrary base];
904. niederreiter_test
905. niederreiter2, a C++ code which computes elements of the Niederreiter M-dimensional Quasi Mont Carlo (QMC) sequence using base 2;
906. niederreiter2_test
907. nint_exactness_mixed, a C++ code which measures the polynomial exactness of an M-dimensional quadrature rule based on a mixture of 1D quadrature rule factors.
908. nint_exactness_mixed_test
909. nintlib, a C++ code which implements approximate integration (quadrature) in M dimensions;
910. nintlib_test
911. normal, a C++ code which implements a random number generator (RNG) for normally distributed values.
912. normal_test
913. normal_dataset, a C++ code which creates a multivariate normal random dataset and writes it to a file.
914. normal_dataset_test
915. obj_io, a C++ code which reads and writes the data in an OBJ 3D graphics file;
916. obj_io_test
917. ode, a C++ code which solves a system of ordinary differential equations (ODE), by Shampine and Gordon;
918. ode_test
919. openmp_test, a C++ code which uses the OpenMP interface for parallel programming shared memory system;
920. optimize_test, a C++ code which looks at the use of automatic optimization by the compiler to make the executable code run faster.
921. 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().
922. ornstein_uhlenbeck_test
923. owen, a C++ code which evaluates Owen's T function;
924. owen_test
925. 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 in gnuplot() graphics files.
926. padua_test
927. partial_digest, a C++ code which solves the partial digest problem;
928. partial_digest_test
929. 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.
930. partition_brute_test
931. 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.
932. patterson_rule_test
933. pbma_io, a C++ code which reads or writes an ASCII Portable Bit Map (PBM) graphics file;
934. pbma_io_test
935. pbmb_io, a C++ code which reads or writes a binary Portable Bit Map (PBM) graphics file;
936. pbmb_io_test
937. pce_burgers, a C++ code which defines and solves the time-dependent viscous Burgers equation, with uncertain viscosity, using a polynomial chaos expansion in terms of Hermite polynomials, by Gianluca Iaccarino.
938. pce_burgers_test
939. 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.
940. pce_ode_hermite_test
941. 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.
942. pdflib_test
943. pentominoes, a C++ code which forms or plots any of the 12 members of the pentomino family, shapes formed from 5 adjacent squares.
944. pentominoes_test
945. persistence, a C++ code which demonstrates how to initialize, get, or set data stored within a function, using static/persistent/saved/local memory.
946. persistence_test
947. pgma_io, a C++ code which reads or writes an ASCII Portable Gray Map (PGM) 2D graphics file;
948. pgma_io_test
949. pgmb_io, a C++ code which reads or writes a binary Portable Gray Map (PGM) 2D graphics file;
950. pgmb_io_test
951. pink_noise, a C++ code which computes a pink noise signal obeying a 1/f power law.
952. pink_noise_test
953. point_merge, a C++ code which considers N points in M-dimensional space, and counts or indexes the unique or tolerably unique items.
954. point_merge_test
955. 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.
956. poisson_1d_test
957. poisson_1d_multigrid, a C++ code which applies the multigrid method to a discretized version of the 1D Poisson equation.
958. poisson_1d_multigrid_test
959. poisson_2d, a C++ code which solves the Poisson equation in a rectangle, using finite differences and Jacobi iteration.
960. poisson_2d_test
961. poisson_2d_exact, a C++ code which evaluates exact solutions u(x,y) to the Poisson partial differential equation (PDE): del^2 U = f(x,y) over a specified region with given boundary conditions.
962. poisson_2d_exact_test
963. poisson_openmp, a C++ code which computes an approximate solution to the Poisson equation in a rectangle, using the Jacobi iteration to solve the linear system, and OpenMP to carry out the Jacobi iteration in parallel.
964. poisson_openmp_test
965. poisson_serial, a C++ code which computes an approximate solution to the Poisson equation in a rectangle, and is intended as the starting point for the creation of a parallel version.
966. poisson_serial_test
967. 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().
968. poisson_simulation_test
969. 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.
970. polpak_test
971. 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.
972. polygon_test
973. polygon_grid, a C++ code which generates a grid of points over the interior of a polygon in 2D.
974. polygon_grid_test
975. polygon_integrals, a C++ code which returns the exact value of the integral of any monomial over the interior of a polygon in 2D.
976. polygon_integrals_test
977. 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.
978. polygon_monte_carlo_test
979. 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.
980. polygon_triangulate_test
981. polygonal_surface_display_opengl, a C++ code which displays a surface in 3D described as polygons, using OpenGL.
982. polygonal_surface_display_opengl_test
983. polynomial, a C++ code which adds, multiplies, differentiates, evaluates and prints multivariate polynomials in a space of M dimensions.
984. polynomial_test
985. polynomial_conversion, a C++ code which converts representations of a polynomial between monomial, Bernstein, Chebyshev, Gegenbauer, Hermite, Laguerre and Legendre forms.
986. polynomial_conversion_test
987. polynomial_root_bound, a C++ code which computes the Cauchy bound on the magnitude of all roots of a polynomial with complex coefficients.
988. polynomial_root_bound_test
989. polyominoes, a C++ code which provides some utilities for manipulating polyominoes.
990. polyominoes_test
991. porous_medium_exact, a C++ code which returns an exact solution u(x,t) of the porous medium equation (PME), related to the diffusion equation, and based on the Barenblatt solution. The partial differential equation (PDE) has the form dudt=Del^2(u^m). This system reduces to a diffusion equation if the exponent m is set to 1.
992. porous_medium_exact_test
993. power_method, a C++ code which carries out the power method for finding a dominant eigenvalue and its eigenvector.
994. power_method_test
995. power_rule, a C++ code which constructs a power rule, that is, a product quadrature rule from identical 1D factor rules.
996. power_rule_test
997. ppma_io, a C++ code which reads or writes an ASCII Portable Pixel Map (PPM) graphics file;
998. ppma_io_test
999. ppmb_io, a C++ code which reads or writes a binary Portable Pixel Map (PPM) 2D pixel map graphics file;
1000. ppmb_io_test
1001. ppmb_to_bmp, a C++ code which converts a binary Portable Pixel Map (PPM) file to a BMP file.
1002. ppmb_to_bmp_test
1003. ppmb_to_ppma, a C++ code which converts a binary Portable Pixel Map (PPM) file to an ASCII PPM file.
1004. ppmb_to_ppma_test
1005. praxis, a C++ code which minimizes a scalar function of several variables, without requiring derivative information, by Richard Brent.
1006. praxis_test
1007. predator_prey_ode, a C++ code which solves a time-dependent predator-prey system of ordinary differential equations (ODE).
1008. predator_prey_ode_test
1009. 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.
1010. prime_test
1011. prime_fermat, a C++ code which applies Fermat's primality test to an integer n, which always correctly identifies primes, but sometimes also accepts nonprimes. Nonetheless, the test is useful for weeding out most nonprimes. The accuracy of the test can be improved by running it for several bases.
1012. prime_fermat_test
1013. prime_mpi, a C++ code which counts the number of primes between 1 and N, using MPI for parallel execution.
1014. prime_mpi_test
1015. prime_openmp, a C++ code which counts the number of primes between 1 and N, using OpenMP for parallel execution.
1016. prime_openmp_test
1017. prime_pi, a C++ code which evaluates Pi(n), the number of primes less than or equal to an integer n.
1018. prime_pi_test
1019. 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.
1020. prism_jaskowiec_rule_test
1021. 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.
1022. prism_witherden_rule_test
1023. 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.
1024. prob_test
1025. product_rule, a C++ code which creates an M-dimensional quadrature rule from a product of distinct 1d quadrature rules;
1026. product_rule_test
1027. pwl_approx_1d, a C++ code which approximates a set of data using a piecewise linear function.
1028. pwl_approx_1d_test
1029. pwl_interp_1d, a C++ code which interpolates a set of data using a piecewise linear function, creating graphics files for processing by gnuplot().
1030. pwl_interp_1d_test
1031. pwl_interp_2d, a C++ code which evaluates a piecewise linear interpolant to data defined on a regular 2D grid.
1032. pwl_interp_2d_test
1033. 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.
1034. pwl_interp_2d_scattered_test
1035. 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).
1036. pwl_product_integral_test
1037. pyramid_exactness, a C++ code which investigates the polynomial exactness of a quadrature rule over the interior of the unit pyramid in 3D.
1038. pyramid_exactness_test
1039. pyramid_felippa_rule, a C++ code which returns a Felippa quadrature rule for approximating integrals over the interior of a pyramid in 3D.
1040. pyramid_felippa_rule_test
1041. pyramid_grid, a C++ code which computes a grid of points over the interior of the unit pyramid in 3D;
1042. pyramid_grid_test
1043. 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.
1044. pyramid_integrals_test
1045. 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.
1046. pyramid_jaskowiec_rule_test
1047. 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;
1048. pyramid_monte_carlo_test
1049. pyramid_rule, a C++ code which computes a conical product quadrature rule for a pyramid.
1050. pyramid_rule_test
1051. 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.
1052. pyramid_witherden_rule_test
1053. qr_solve, a C++ code which computes the linear least squares (LLS) solution of a system A*x=b.
1054. qr_solve_test
1055. quad_mpi, a C++ code which applies a quadrature rule to estimate an integral, working in parallel by using the Message Passing Interface (MPI);
1056. quad_mpi_test
1057. quad_openmp, a C++ code which applies a quadrature rule to estimate an integral over a 1D interval, using OpenMP for parallel execution;
1058. quad_openmp_test
1059. quad_rule, a C++ code which defines quadrature rules for approximating integrals;
1060. quad_rule_test
1061. quad_serial, a C++ code which applies a quadrature rule to estimate an integral, intended as a starting point for parallelization exercises.
1062. quad_serial_test
1063. 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.
1064. quad2d_test
1065. quad2d_openmp, a C++ code which applies a product quadrature rule to estimate an integral over a 2D rectangle, using OpenMP for parallel execution;
1066. quad2d_openmp_test
1067. 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).
1068. quadmom_test
1069. quadrature_golub_welsch, a C++ code which computes the points and weights of a Gaussian quadrature rule using the Golub-Welsch procedure.
1070. quadrature_golub_welsch_test
1071. 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.
1072. quadrature_least_squares_test
1073. 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.
1074. quadrature_weights_vandermonde_test
1075. 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.
1076. quadrature_weights_vandermonde_2d_test
1077. quadrilateral_mesh, a C++ code which handles meshes of quadrilaterals over a 2D region;
1078. quadrilateral_mesh_test
1079. quadrilateral_mesh_rcm, a C++ code which computes the Reverse Cuthill-McKee (RCM) reordering for nodes in a mesh of 4-node quadrilaterals.
1080. quadrilateral_mesh_rcm_test
1081. quadrilateral_witherden_rule, a C++ code which returns a symmetric Witherden quadrature rule for the quadrilateral, with exactness up to total degree 21.
1082. quadrilateral_witherden_rule_test
1083. quality, a C++ code which computes quality of distribution measures for pointsets in M dimensions;
1084. quality_test
1085. quaternions, a C++ code which carries out some simple arithmetic operations for quaternions.
1086. quaternions_test
1087. r83, a C++ code which contains linear algebra routines for r83 matrices (real, 64 bit, tridiagonal 3xN format).
1088. r83_test
1089. r83_np, a C++ code which contains linear algebra routines for r83_np matrices (real, 64 bit, tridiagonal 3xN format, nonpivoting factorization).
1090. r83_np_test
1091. r83p, a C++ code which contains linear algebra routines for r83p matrices (real, 64 bit, tridiagonal periodic format).
1092. r83p_test
1093. r83s, a C++ code which contains linear algebra routines for r83s matrices (real, 64 bit, tridiagonal scalar format).
1094. r83s_test
1095. r83t, a C++ code which contains linear algebra routines for r83t matrices (real, 64 bit, tridiagonal Mx3 format).
1096. r83t_test
1097. r83v, a C++ code which contains linear algebra routines for r83v matrices (real, 64 bit, tridiagonal three vector format).
1098. r83v_test
1099. r85, a C++ code which contains linear algebra routines for r85 matrices (real, 64 bit, pentadiagonal format).
1100. r85_test
1101. r8bb, a C++ code which contains linear algebra routines for r8bb matrices (real, 64 bit, border banded format).
1102. r8bb_test
1103. r8blt, a C++ code which contains linear algebra routines for r8blt matrices (real, 64 bit, band lower triangular format).
1104. r8blt_test
1105. r8bto, a C++ code which contains linear algebra routines for r8bto matrices (real, 64 bit, block Toeplitz format).
1106. r8bto_test
1107. r8but, a C++ code which contains linear algebra routines for r8but matrices (real, 64 bit, band upper triangular format).
1108. r8but_test
1109. r8cb, a C++ code which contains linear algebra routines for r8cb matrices (real, 64 bit, Compressed Band format).
1110. r8cb_test
1111. r8cbb, a C++ code which contains linear algebra routines for r8cbb matrices (real, 64 bit, Compressed Border Banded format).
1112. r8cbb_test
1113. r8ccs, a C++ code which contains linear algebra routines for r8ccs matrices (real, 64 bit, Compressed Column Storage (Colptr,Row,Value) format).
1114. r8ccs_test
1115. r8ci, a C++ code which contains linear algebra routines for r8ci matrices (real, 64 bit, circulant format).
1116. r8ci_test
1117. r8col, a C++ code which contains utility routines for R8COL's, that is, double precision real MxN arrays, 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.
1118. r8col_test
1119. r8gb, a C++ code which contains linear algebra routines for r8gb matrices (real, 64 bit, General Banded format).
1120. r8gb_test
1121. r8gd, a C++ code which contains linear algebra routines for r8gd matrices (real, 64 bit, general diagonal format).
1122. r8gd_test
1123. r8ge, a C++ code which contains linear algebra routines for R8GE matrices (real, 64 bit, General format).
1124. r8ge_test
1125. r8lib, a C++ code which contains many utility routines, using double precision real (R8) arithmetic.
1126. r8lib_test
1127. r8lt, a C++ code which contains linear algebra routines for R8LT matrices (real, 64 bit, Lower Triangular).
1128. r8lt_test
1129. r8ltt, a C++ code which contains linear algebra routines for r8ltt matrices (real, 64 bit, lower triangular Toeplitz format).
1130. r8ltt_test
1131. r8ncf, a C++ code which contains linear algebra routines for r8ncf matrices (real, 64 bit, nonsymmetric coordinate format).
1132. r8ncf_test
1133. r8pbl, a C++ code which contains linear algebra routines for r8pbl matrices (real, 64 bit, symmetric positive definite (SPD) band lower format).
1134. r8pbl_test
1135. r8pbu, a C++ code which contains linear algebra routines for r8pbu matrices (real, 64 bit, symmetric positive definite (SPD) band upper format).
1136. r8pbu_test
1137. r8po, a C++ code which contains linear algebra routines for r8po matrices (real, 64 bit, symmetric positive definite (SPD) format).
1138. r8po_test
1139. 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.
1140. r8poly_test
1141. r8pp, a C++ code which contains linear algebra routines for r8pp matrices (real, 64 bit, symmetric positive definite (SPD) packed format).
1142. r8pp_test
1143. r8ri, a C++ code which contains linear algebra routines for r8ri matrices (real, 64 bit, row indexed format).
1144. r8ri_test
1145. r8row, a C++ code which contains utility routines for R8ROW's, that is, double precision real MxN arrays, 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.
1146. r8row_test
1147. r8sd, a C++ code which contains linear algebra routines for r8sd matrices (real, 64 bit, symmetric diagonal format).
1148. r8sd_test
1149. r8sm, a C++ code which contains linear algebra routines for r8sm matrices (real, 64 bit, Sherman-Morrison A-u*v' format).
1150. r8sm_test
1151. r8sr, a C++ code which carries out linear algebra operations for r8sr matrices (real, 64 bit, diagonal + compressed row offdiagonal format).
1152. r8sr_test
1153. r8ss, a C++ code which carries out linear algebra operations for r8ss matrices (real, 64 bit, symmetric skyline format).
1154. r8ss_test
1155. r8st, a C++ code which contains linear algebra routines for r8st matrices (real, 64 bit, Sparse Triplet (ST) (I,J,AIJ) format).
1156. r8st_test
1157. r8sto, a C++ code which contains linear algebra routines for r8sto matrices (real, 64 bit, symmetric Toeplitz N format).
1158. r8sto_test
1159. r8to, a C++ code which contains linear algebra routines for r8to matrices (real, 64 bit, Toeplitz 2*N-1 format).
1160. r8to_test
1161. r8ut, a C++ code which contains linear algebra routines for r8ut matrices (real, 64 bit, Upper Triangular).
1162. r8ut_test
1163. r8utp, a C++ code which carries out linear algebra operations on r8utp matrices, real 64 bit, Upper Triangular Packed format.
1164. r8utp_test
1165. r8utt, a C++ code which contains linear algebra routines for r8utt matrices (real, 64 bit, upper triangular Toeplitz format).
1166. r8utt_test
1167. r8vm, a C++ code which contains linear algebra routines for r8vm matrices (real, 64 bit, vandermonde format).
1168. r8vm_test
1169. rand48_test, a C++ code which demonstrates the use of the RAND48 family of random number generators (RNG) available in the C/C++ standard library.
1170. randlc, a C++ code which implements a random number generator (RNG) used by the NAS Benchmark programs.
1171. randlc_test
1172. random_data, a C++ code which uses a random number generator (RNG) to sample points distribute according to various probability density functions (PDF), for various spatial dimensions, and geometries, including the M-dimensional cube, ellipsoid, simplex and sphere.
1173. random_data_test
1174. random_mpi, a C++ code which demonstrates one way to generate the same sequence of random numbers for both sequential execution and parallel execution under MPI.
1175. random_mpi_test
1176. random_openmp, a C++ code which illustrates how a parallel program using OpenMP can generate multiple distinct streams of random numbers.
1177. random_openmp_test
1178. random_sorted, a C++ code which generates vectors of random values which are already sorted.
1179. random_sorted_test
1180. 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.
1181. ranlib_test
1182. rbf_interp_1d, a C++ code which defines and evaluates radial basis function (RBF) interpolants to 1D data.
1183. rbf_interp_1d_test
1184. rbf_interp_2d, a C++ code which defines and evaluates radial basis function (RBF) interpolants to 2D data.
1185. rbf_interp_2d_test
1186. rbf_interp_nd, a C++ code which defines and evaluates radial basis function (RBF) interpolants to M-dimensional data.
1187. rbf_interp_nd_test
1188. rcm, a C++ code which applies the Reverse Cuthill McKee (RCM) algorithm for reordering the nodes of a graph, and reducing the bandwidth of a corresponding sparse matrix;
1189. rcm_test
1190. reactor simulation, a C++ code which is a simple Monte Carlo simulation of the shielding effect of a slab of a certain thickness in front of a neutron source. This program was provided as an example with the book "Numerical Methods and Software."
1191. reactor simulation_test
1192. recomment, a C++ code which converts C style comments to C++ style comments.
1193. recomment_test
1194. reword, a C++ code which reads a text file and writes a copy which has a fixed number of words per line.
1195. reword_test
1196. 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.
1197. ring_mpi_test
1198. 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.
1199. rk1_test
1200. rk1_implicit, a C++ code which solves one or more ordinary differential equations (ODE) using the Runge-Kutta order 1 implicit method, with a version of fsolve() handling the associated nonlinear equation, and using a fixed time step. This method is often called the backward Euler method.
1201. rk1_implicit_test
1202. rk2, a C++ code which solves one or more ordinary differential equations (ODE) using an explicit Runge-Kutta method of order 2, also known as Heun's method, the modified Euler method, or the explicit midpoint method.
1203. rk2_test
1204. rk2_implicit, a C++ code which solves one or more ordinary differential equations (ODE) using the Runge-Kutta order 2 implicit method, using fsolve() to solve the implicit equation, and using a fixed time step. rk2_implicit() is also known as the implicit midpoint method.
1205. rk2_implicit_test
1206. rk3, a C++ code which solves one or more ordinary differential equations (ODE) using an explicit Runge-Kutta method of order 3.
1207. rk3_test
1208. 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.
1209. rk4_test
1210. rkf45, a C++ code which applies the Runge-Kutta-Fehlberg (RKF) algorithm to solve a system of ordinary differential equations (ODE);
1211. rkf45_test
1212. 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.
1213. rnglib_test
1214. root_rc, a C++ code which seeks a solution of a scalar nonlinear equation f(x)=0, using reverse communication (RC), by Gaston Gonnet.
1215. root_rc_test
1216. roots_rc, a C++ code which seeks solutions of a system of nonlinear equations, using reverse communication (RC), by Gaston Gonnet.
1217. roots_rc_test
1218. 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.
1219. rot13_test
1220. rotating_cube_display_opengl, a C++ code which displays a rotating color cube in 3D, using OpenGL;
1221. rotating_cube_display_opengl_test
1222. 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.
1223. row_echelon_integer_test
1224. rref2, a C++ code which involves a user-written approach to compute the reduced row echelon form (RREF) of a matrix, which can be used to analyze matrices which are square or rectangular, singular or invertible.
1225. rref2_test
1226. runge, a C++ code which evaluates the Runge() function, its first and second derivatives, and its antiderivative. This function causes a breakdown for polynomial interpolation over equally spaced nodes in [-1,+1]. The functions are plotted using gnuplot().
1227. runge_test
1228. sandia_cubature, a C++ code which computes M-dimensional quadrature rules for certain regions and weight functions.
1229. sandia_cubature_test
1230. sandia_rules, a C++ code which produces 1D quadrature rules of Chebyshev, Clenshaw Curtis, Fejer 2, gegenbauer, generalized Hermite, generalized Laguerre, Hermite, Jacobi, Laguerre, legendre and Patterson types.
1231. sandia_rules_test
1232. sandia_rules2, a C++ code which contains a very small selection of functions which serve as an interface between sandia_sgmg() or sandia_sgmga() and sandia_rules().
1233. sandia_rules2_test
1234. sandia_sgmg, a C++ code which creates a sparse grid dataset based on a mixed set of 1D factor rules, and experiments with the use of a linear growth rate for the quadrature rules. This is a version of sgmg() that uses a different procedure for supplying the parameters needed to evaluate certain quadrature rules.
1235. sandia_sgmg_test
1236. sandia_sgmga, a C++ code which creates sparse grids based on a mixture of 1D quadrature rules, allowing anisotropic weights for each dimension. This is a version of sgmga() that uses a different procedure for supplying the parameters needed to evaluate certain quadrature rules.
1237. sandia_sgmga_test
1238. sandia_sgmgg, a C++ code which explores a generalized construction method for sparse grids.
1239. sandia_sgmgg_test
1240. sandia_sparse, a C++ code which produces a M-dimensional sparse grid, based on a variety of 1D quadrature rules; only isotropic grids are generated, that is, the same rule is used in each dimension, and the same maximum order is used in each dimension.
1241. sandia_sparse_test
1242. 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.
1243. satisfy_brute_test
1244. 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.
1245. satisfy_mpi_test
1246. 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.
1247. satisfy_openmp_test
1248. schedule_openmp, a C++ code which demonstrates the default, static, and dynamic methods of scheduling loop iterations in OpenMP to avoid work imbalance.
1249. schedule_openmp_test
1250. screenshot_opengl, a C++ code which uses OpenGL() to save a screenshot of the graphics being displayed.
1251. screenshot_opengl_test
1252. 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;
1253. sde_test
1254. 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.
1255. search_mpi_test
1256. search_serial, a C++ code which searches the integers from A to B for a value J such that F(J) = C. this version of the program is intended as a starting point for a parallel approach.
1257. search_serial_test
1258. set_theory, a C++ code which demonstrates various set theoretic operations using several models of a set.
1259. set_theory_test
1260. sftpack, a C++ code which implements the slow Fourier transform, intended as a teaching tool and comparison with the Fast Fourier Transform (FFT).
1261. sftpack_test
1262. sgefa_openmp, a C++ code which compares a standard linear algebra solver against a revised version which can be run in parallel with OpenMP.
1263. sgefa_openmp_test
1264. sgmg, a C++ code which constructs a sparse grid whose factors are possibly distinct 1D quadrature rules.
1265. sgmg_test
1266. sgmga, a C++ code which implements a family of sparse grid rules. These rules are "mixed", in that a different 1D quadrature rule can be specified for each dimension. Moreover, each 1D quadrature rule comes in a family of increasing size whose growth rate (typically linear or exponential) is chosen by the user. Finally, the user may also specify different weights for each dimension, resulting in anisotropic rules.
1267. sgmga_test
1268. shallow_water_1d, a C++ code which simulates the evolution of a 1D fluid governed by the time-dependent shallow water equations.
1269. shallow_water_1d_test
1270. shepard_interp_1d, a C++ code which defines and evaluates Shepard interpolants to scattered 1D data, based on inverse distance weighting.
1271. shepard_interp_1d_test
1272. shepard_interp_2d, a C++ code which defines and evaluates Shepard interpolants to scattered 2D data, based on inverse distance weighting.
1273. shepard_interp_2d_test
1274. shepard_interp_nd, a C++ code which defines and evaluates Shepard interpolants to scattered M-dimensional data, based on inverse distance weighting.
1275. shepard_interp_nd_test
1276. sierpinski_carpet_chaos, a C++ code which creates a dot-plot of the Sierpinski carpet by repeatedly applying a randomized linear transformation to a starting point.
1277. sierpinski_carpet_chaos_test
1278. sierpinski_triangle_chaos, a C++ code which creates a dot-plot of the Sierpinski triangle by repeatedly applying a randomized linear transformation to a starting point.
1279. sierpinski_triangle_chaos_test
1280. sigmoid, 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().
1281. sigmoid_test
1282. simple_ga, a C++ code which is a simple example of a genetic algorithm, by Dennis Cormier and Sita Raghavan.
1283. simple_ga_test
1284. simplex_coordinates, a C++ code which computes the Cartesian coordinates of the vertices of a regular simplex in M dimensions.
1285. simplex_coordinates_test
1286. 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.
1287. simplex_gm_rule_test
1288. simplex_grid, a C++ code which generates a regular grid of points over the interior of an arbitrary simplex in M dimensions.
1289. simplex_grid_test
1290. 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.
1291. simplex_integrals_test
1292. 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.
1293. simplex_monte_carlo_test
1294. sinc, a C++ code which evaluates the sinc() function, its first and second derivative and its antiderivative. The normalized function is defined by sincn=sin(pi*x)/(pi*x), the unnormalized function is sincu=sin(x)/x. Plots of these functions are made.
1295. sinc_test
1296. 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).
1297. sine_gordon_exact_test
1298. sine_integral, a C++ code which evaluates the Sine Integral, by Shanjie Zhang, Jianming Jin;
1299. sine_integral_test
1300. sine_transform, a C++ code which demonstrates some simple properties of the discrete sine transform.
1301. sine_transform_test
1302. snakes_and_ladders, a C++ code which provides tools to analyze the game of Snakes and Ladders.
1303. snakes_and_ladders_test
1304. sncndn, a C++ code which evaluates the Jacobi elliptic functions sn(u,m), cn(u,m), and dn(u,m).
1305. sncndn_test
1306. sobol, a C++ code which computes elements of the Sobol M-dimensional Quasi Mont Carlo (QMC) sequence, extended to a maximal spatial dimension of 1111, by Bennett Fox.
1307. sobol_test
1308. solve, a C++ code which implements a linear solver which makes it easy to create doubly-dimensioned arrays and solve associated linear systems.
1309. solve_test
1310. 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.
1311. sor_test
1312. sort_rc, a C++ code which sorts a list of any kind of objects, using reverse communication (RC).
1313. sort_rc_test
1314. sparse_count, a C++ code which analyzes sparse grids in which a single family of 1D quadrature rules is used for all spatial dimensions, with a variety of growth rules.
1315. sparse_count_test
1316. 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.
1317. sparse_display_test
1318. sparse_grid_cc, a C++ code which creates sparse grids based on Clenshaw-Curtis rules.
1319. sparse_grid_cc_test
1320. sparse_grid_gl, a C++ code which creates sparse grids based on Gauss-Legendre rules.
1321. sparse_grid_gl_test
1322. sparse_grid_hermite, a C++ code which creates sparse grids based on Gauss-Hermite rules.
1323. sparse_grid_hermite_test
1324. 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.
1325. sparse_grid_hw_test
1326. sparse_grid_laguerre, a C++ code which creates sparse grids based on Gauss-Laguerre rules.
1327. sparse_grid_laguerre_test
1328. sparse_grid_mixed, a C++ code which creates a sparse grid dataset based on a mixed set of 1D factor rules.
1329. sparse_grid_mixed_test
1330. sparse_interp_nd, a C++ code which defines a sparse interpolant to a function f(x) of a M-dimensional argument.
1331. sparse_interp_nd_test
1332. sphere_exactness, a C++ code which tests the polynomial exactness of a quadrature rule over the surface of the unit sphere in 3D;
1333. sphere_exactness_test
1334. 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.
1335. sphere_fibonacci_grid_test
1336. 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.
1337. sphere_grid_test
1338. sphere_integrals, a C++ code which returns the exact value of the integral of any monomial over the surface of the unit sphere in 3D.
1339. sphere_integrals_test
1340. sphere_lebedev_rule, a C++ code which computes Lebedev quadrature rules for the surface of the unit sphere in 3D;
1341. sphere_lebedev_rule_test
1342. 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.
1343. sphere_llq_grid_test
1344. 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.
1345. sphere_llt_grid_test
1346. 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;
1347. sphere_monte_carlo_test
1348. sphere_quad, a C++ code which uses triangulation to approximate an integral over the surface of the unit sphere in 3D;
1349. sphere_quad_test
1350. sphere_stereograph, a C++ code which computes the stereographic mapping between points on the plane Z=1 and the surface of the unit sphere in 3D.
1351. sphere_stereograph_test
1352. sphere_triangle_monte_carlo, a C++ code which applies a Monte Carlo method to estimate the integral of a function over a spherical triangle on the surface of the unit sphere in 3D;
1353. sphere_triangle_monte_carlo_test
1354. sphere_triangle_quad, a C++ code which uses quadrature to estimate the integral of a function over a spherical triangle on the surface of the unit sphere in 3D.
1355. sphere_triangle_quad_test
1356. sphere_voronoi_display_opengl, a C++ code which displays randomly selected generator points and colors in points on the sphere that are closest to each generator, on the surface of the unit sphere in 3D.
1357. sphere_voronoi_display_opengl_test
1358. sphere_xyz_display_opengl, a C++ code which reads XYZ information defining points and displays a unit sphere and the points, using OpenGL, on the surface of the unit sphere in 3D.
1359. sphere_xyz_display_opengl_test
1360. spline, a C++ code which interpolates or approximates data by piecewise polynomial functions;
1361. spline_test
1362. 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.
1363. square_arbq_rule_test
1364. square_exactness, a C++ code which investigates the polynomial exactness of quadrature rules for f(x,y) over the interior of a square in 2D.
1365. square_exactness_test
1366. square_felippa_rule, a C++ code which returns a Felippa quadrature rule for approximating integrals over the interior of a square in 2D.
1367. square_felippa_rule_test
1368. square_grid, a C++ code which computes a grid of points over the interior of a square in 2D.
1369. square_grid_test
1370. square_hex_grid, a C++ code which computes a hexagonal grid of points over the interior of a square in 2D.
1371. square_hex_grid_test
1372. square_integrals, a C++ code which returns the exact value of the integral of any monomial over the interior of the unit square in 2D.
1373. square_integrals_test
1374. 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.
1375. square_minimal_rule_test
1376. 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.
1377. square_monte_carlo_test
1378. 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.
1379. square_symq_rule_test
1380. st_io, a C++ code which reads and writes sparse linear systems stored in the Sparse Triplet (ST) format.
1381. st_io_test
1382. st_to_ccs, a C++ code which converts a sparse matrix from Sparse Triplet (ST) format to Compressed Column Storage (CCS) format;
1383. st_to_ccs_test
1384. standing_wave_exact, a C++ code which returns an exact standing wave solution u(x,t) of the partial differential equation (PDE): utt = c^2 uxx, describing a wave in a 1D spatial region with speed c.
1385. standing_wave_exact_test
1386. star_discrepancy, a C++ code which computes bounds on the star discrepancy of a set of N points in M dimensions, stored as a table file, by Eric Thiemard.
1387. star_discrepancy_test
1388. steinerberger, a C++ code which evaluates the Steinerberger function, a continuous function with discontinuous derivative, which is very hard to accurately plot, integrate, minimize, or interpolate. Plots are made of several of the functions.
1389. steinerberger_test
1390. stiff_exact, a C++ code which returns an exact solution y(t) to a stiff ordinary differential equation (ODE) of the form y' = lambda * ( cos(t-t0) - y).
1391. stiff_exact_test
1392. stiff_ode, a C++ code which considers an ordinary differential equation (ODE) which is an example of a stiff ODE.
1393. stiff_ode_test
1394. stla_io, a C++ code which reads and writes ASCII stereolithography (STL) 3d graphics files;
1395. stla_io_test
1396. stochastic_diffusion, functions which implement several versions of a stochastic diffusivity coefficient.
1397. stochastic_diffusion_test
1398. 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.
1399. stochastic_heat2d_test
1400. stochastic_rk, a C++ code which applies a Runge-Kutta (RK) scheme to a stochastic ordinary differential equation (SODE).
1401. stochastic_rk_test
1402. stokes_2d_exact, a C++ code which evaluates exact solutions (u,v,p)(x,y) to the incompressible steady Stokes equations in 2D, which are a system of partial differential equations (PDE) of the form: -uxx-uyy+px=f, -vxx-vyy+py=g, ux+vy=h.
1403. stokes_2d_exact_test
1404. 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().
1405. string_pde_test
1406. 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.
1407. stroud_rule_test
1408. subpak, a C++ code which contains many utility routines;
1409. subpak_test
1410. 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.
1411. subset_test
1412. 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.
1413. subset_sum_test
1414. 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.
1415. subset_sum_backtrack_test
1416. 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.
1417. subset_sum_brute_test
1418. 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.
1419. subset_sum_swap_test
1420. svd_basis, a C++ code which applies the singular value decomposition (SVD) to a set of vectors, to extract the dominant modes;
1421. svd_basis_test
1422. svd_snowfall, a C++ code which reads a file containing historical snowfall data and analyzes the data with the Singular Value Decomposition (SVD), displaying the results using gnuplot().
1423. svd_snowfall_test
1424. svd_test, a C++ code which demonstrates the computation of the singular value decomposition (SVD) and a few of its properties.
1425. 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.
1426. svd_truncated_test
1427. table_io, a C++ code which reads and writes a simple dataset stored as a table file;
1428. table_io_test
1429. 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.
1430. task_division_test
1431. test_approx, a C++ code which implements test problems for approximation, provided as a set of (x,y) data.
1432. test_approx_test
1433. test_eigen, a C++ code which implements test matrices for eigenvalue analysis.
1434. test_eigen_test
1435. test_int, a C++ code which implements test problems for approximate integration in one dimension.
1436. test_int_test
1437. test_int_2d, a C++ code which implements test problems for approximate integration in two dimensions.
1438. test_int_2d_test
1439. test_int_nd, a C++ code which implements test problems for approximate integration (quadrature) in M dimensions.
1440. test_int_nd_test
1441. test_interp, a C++ code which defines test problems for interpolation, provided as a set of (x,y) data.
1442. test_interp_test
1443. test_interp_1d, a C++ code which defines test problems for interpolation of data y(x), which depends on a 1D argument.
1444. test_interp_1d_test
1445. test_interp_2d, a C++ code which defines test problems for interpolation of data z(x,y), depending on a 2D argument.
1446. test_interp_2d_test
1447. test_interp_fun, a C++ code which defines test problems for interpolation of data defined by a functional formula.
1448. test_interp_fun_test
1449. test_interp_nd, a C++ code which defines test problems for interpolation of data z(x), depending on an M-dimensional argument.
1450. test_interp_nd_test
1451. test_lls, a C++ code which implements linear least squares (LLS) test problems of the form A*x=b.
1452. test_lls_test
1453. 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.
1454. test_matrix_test
1455. test_matrix_exponential, a C++ code which defines a set of test cases for computing the matrix exponential.
1456. test_matrix_exponential_test
1457. test_min, a C++ code which implements test problems for minimization of a scalar function of a scalar variable.
1458. test_min_test
1459. 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.
1460. test_opt_con_test
1461. test_optimization, a C++ code which implements test problems for optimization of a scalar function of several variables, as described by Molga and Smutnicki.
1462. test_optimization_test
1463. test_partial_digest, a C++ code which generates cases of the partial digest problem.
1464. test_partial_digest_test
1465. 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.
1466. test_values_test
1467. test_zero, a C++ code which implements test problems for the solution of a single nonlinear equation in one variable.
1468. test_zero_test
1469. tester, a BASH script which runs the test programs.
1470. testpack, a C++ code which demonstrates the use of a set of test integrand functions chosen by Alan Genz.
1471. testpack_test
1472. tet_mesh, a C++ code which works with tetrahedral meshes in 3D;
1473. tet_mesh_test
1474. tet_mesh_boundary, a C++ code which reads information defining a tetrahedral mesh of points in 3D, and determines the triangular faces that form the boundary of the mesh; it writes files containing the nodes and elements defining this tri_surface data.
1475. tet_mesh_boundary_test
1476. tet_mesh_display_opengl, a C++ code which reads a mesh of tetrahedrons and displays the nodes and edges using OpenGL.
1477. tet_mesh_display_opengl_test
1478. tet_mesh_l2q, a C++ code which reads information about a 4-node (linear) mesh of tetrahedrons and creates data defining a corresponding 10-node (quadratic) mesh;
1479. tet_mesh_l2q_test
1480. tet_mesh_q2l, a C++ code which reads information about a 10-node (quadratic) mesh of tetrahedrons and creates data defining a corresponding 4-node (linear) mesh;
1481. tet_mesh_q2l_test
1482. tet_mesh_quad, a C++ code which estimates the integral of a function over a region defined by a tetrahedral mesh.
1483. tet_mesh_quad_test
1484. tet_mesh_quality, a C++ code which reads a node coordinate file and a tetrahedron file and returns quality measures for the tetrahedral mesh;
1485. tet_mesh_quality_test
1486. tet_mesh_rcm, a C++ code which computes the Reverse Cuthill McKee (RCM) reordering for the nodes of a tet_mesh that uses 4-node or 10-node tetrahedrons;
1487. tet_mesh_rcm_test,
1488. tet_mesh_refine, a C++ code which refines a mesh of tetrahedrons;
1489. tet_mesh_refine_test
1490. tet_mesh_tet_neighbors, a C++ code which reads information about a mesh of tetrahedrons, and creates a list of the tetrahedrons that are adjacent to a given tetrahedron;
1491. tet_mesh_tet_neighbors_test
1492. tet_mesh_to_gmsh, a C++ code which converts a mesh of tetrahedrons to gmsh() format;
1493. tet_mesh_to_gmsh_test
1494. tet_mesh_to_xml, a C++ code which converts a mesh of tetrahedrons to XML format;
1495. tet_mesh_to_xml_test
1496. tet_mesh_volumes, a C++ code which computes the volume of each tetrahedron in a mesh of tetrahedrons;
1497. tet_mesh_volumes_test
1498. 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.
1499. tetrahedron_test
1500. 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.
1501. tetrahedron_arbq_rule_test
1502. tetrahedron_exactness, a C++ code which tests the polynomial exactness of a quadrature rule over the interior of a tetrahedron in 3D.
1503. tetrahedron_exactness_test
1504. tetrahedron_felippa_rule, a C++ code which returns a Felippa quadrature rule for approximating integrals over the interior of a tetrahedron in 3D.
1505. tetrahedron_felippa_rule_test
1506. tetrahedron_grid, a C++ code which computes a grid of points over the interior of a tetrahedron in 3D.
1507. tetrahedron_grid_test
1508. 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.
1509. tetrahedron_integrals_test
1510. 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.
1511. tetrahedron_jaskowiec_rule_test
1512. 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.
1513. tetrahedron_keast_rule_test
1514. 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.
1515. tetrahedron_monte_carlo_test
1516. tetrahedron_ncc_rule, a C++ code which defines Newton-Cotes closed (NCC) quadrature rules over the interior of a tetrahedron in 3D.
1517. tetrahedron_ncc_rule_test
1518. tetrahedron_nco_rule, a C++ code which defines Newton-Cotes open (NCO) quadrature rules over the interior of a tetrahedron in 3D.
1519. tetrahedron_nco_rule_test
1520. tetrahedron_witherden_rule, a C++ code which returns a symmetric Witherden quadrature rule for the tetrahedron, with exactness up to total degree 10.
1521. tetrahedron_witherden_rule_test
1522. 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.
1523. tetrahedron01_monte_carlo_test
1524. 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.
1525. three_body_ode_test
1526. tiler_3d, a C++ code which blends a pattern repeatedly into a region in 3D;
1527. tiler_3d_test
1528. timer_test, a C++ code which measures the CPU time used by a portion of a user's program;
1529. timestamp, a C++ code which prints the current YMDHMS date as a timestamp, and other timekeeping operations;
1530. timestamp_test
1531. toeplitz_cholesky, a C++ code which computes the Cholesky factorization of a symmetric positive definite (SPD) Toeplitz matrix.
1532. toeplitz_cholesky_test
1533. toms097, a C++ code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using Floyd's algorithm. This is a version of ACM TOMS algorithm 97.
1534. toms097_test
1535. 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.
1536. toms112_test
1537. toms178, a C++ code which seeks the minimizer of a scalar function of several variables using the Hooke-Jeeves method, by Arthur Kaupe. This is a version of ACM TOMS algorithm 178.
1538. toms178_test
1539. toms179, a C++ code which calculates the incomplete Beta ratio, by Oliver Ludwig. This is a version of ACM TOMS algorithm 179.
1540. toms179_test
1541. toms243, a C++ code which evaluates the logarithm of a complex value, by David Collens. This is a version of ACM TOMS algorithm 243.
1542. toms243_test
1543. toms291, a C++ code which approximates the logarithm of the Gamma function; this is a version of ACM TOMS algorithm 291.
1544. toms291_test
1545. toms443, a C++ code which evaluates Lambert's W function. This is a version of ACM TOMS algorithm 443.
1546. toms443_test
1547. toms446, a C++ code which manipulates Chebyshev series for interpolation and approximation. This is a version of ACM TOMS algorithm 446, by Roger Broucke.
1548. toms446_test
1549. 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.
1550. toms462_test
1551. 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.
1552. toms515_test
1553. toms577, a C++ code which evaluates Carlson's elliptic integral functions RC, RD, RF and RJ. This is a version of ACM TOMS algorithm 577.
1554. toms577_test
1555. toms655, a C++ code which computes the weights for interpolatory quadrature rule; this library is commonly called IQPACK, by Sylvan Elhay and Jaroslav Kautsky. This is a version of ACM TOMS algorithm 655.
1556. toms655_test
1557. toms743, a C++ code which evaluates Lambert's W function. This is a version of ACM TOMS algorithm 743, by Barry, Barry and Culligan-Hensley.
1558. toms743_test
1559. 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.
1560. toms886_test
1561. 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.
1562. toms917_test
1563. 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.
1564. trapezoidal_test
1565. traveling_wave_exact, a C++ code which returns an exact traveling wave solution u(x,t) of the partial differential equation (PDE): utt = c^2 uxx, describing a wave in a 1D spatial region with propagation speed c.
1566. traveling_wave_exact_test
1567. tree_chaos, a C++ code which creates a dot-plot of a tree by repeatedly applying a randomized linear transformation to a starting point.
1568. tree_chaos_test
1569. 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.
1570. treepack_test
1571. tri_surface_display_opengl, a C++ code which displays the 3D graphics information in a tri_surface file using OpenGL.
1572. tri_surface_display_opengl_test
1573. tri_surface_io, a C++ code which reads and writes the 3D graphics information in a tri_surface file;
1574. tri_surface_io_test
1575. triangle, a C++ code which computes properties, including angles, area, centroid, circumcircle, edge lengths, incircle, orientation, orthocenter, and quality, of a triangle in 2D.
1576. triangle_test
1577. 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.
1578. triangle_analyze_test
1579. triangle_dunavant_rule, a C++ code which defines Dunavant quadrature rules over the interior of a triangle in 2D.
1580. triangle_dunavant_rule_test
1581. triangle_exactness, a C++ code which tests the polynomial exactness of a quadrature rule over the interior of a triangle in 2D.
1582. triangle_exactness_test
1583. triangle_fekete_rule, a C++ code which sets up one of seven Fekete rules for interpolation or quadrature over the interior of a triangle in 2D.
1584. triangle_fekete_rule_test
1585. triangle_felippa_rule, a C++ code which returns a Felippa quadrature rule for approximating integrals over the interior of a triangle in 2D.
1586. triangle_felippa_rule_test
1587. triangle_grid, a C++ code which computes a grid of points over the interior of a triangle in 2D.
1588. triangle_grid_test
1589. triangle_histogram, a C++ code which computes histograms of data over the interior of the unit triangle in 2D.
1590. triangle_histogram_test
1591. 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.
1592. triangle_integrals_test
1593. triangle_interpolate, a C++ code which shows how vertex data can be interpolated at any point in the interior of a triangle.
1594. triangle_interpolate_test
1595. triangle_io, a C++ code which reads or writes files created by Jonathan Shewchuk's triangle() program.
1596. triangle_io_test
1597. triangle_lyness_rule, a C++ code which returns Lyness-Jespersen quadrature rules over the interior of a triangle in 2D;
1598. triangle_lyness_rule_test
1599. 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.
1600. triangle_monte_carlo_test
1601. triangle_ncc_rule, a C++ code which defines Newton-Cotes closed (NCC) quadrature rules over the interior of a triangle in 2D.
1602. triangle_ncc_rule_test
1603. triangle_nco_rule, a C++ code which defines Newton-Cotes open (NCO) quadrature rules over the interior of a triangle in 2D.
1604. triangle_nco_rule_test
1605. 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.
1606. triangle_svg_test
1607. 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.
1608. triangle_symq_rule_test
1609. triangle_to_fem, a C++ code which reads the NODE and ELE files created by Jonathan Shewchuk's triangle() program to describe a triangular mesh, and writes a corresponding pair of node and element files in the 2D FEM format.
1610. triangle_to_fem_test
1611. triangle_to_xml, a C++ code which reads the NODE and ELE files created by Jonathan Shewchuk's triangle() program to describe a triangular mesh in 2D, and writes out a corresponding XML mesh file for use by dolfin() or fenics().
1612. triangle_to_xml_test
1613. 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.
1614. triangle_twb_rule_test
1615. triangle_wandzura_rule, a C++ code which returns a Wandzura quadrature rule of exactness 5, 10, 15, 20, 25 or 30 over the interior of the triangle in 2D.
1616. triangle_wandzura_rule_test
1617. triangle_witherden_rule, a C code which returns a symmetric Witherden quadrature rule for the triangle, with exactness up to total degree 20.
1618. triangle_witherden_rule_test
1619. triangle01_integrals, a C++ code which returns the integral of any monomial over the interior of the unit triangle in 2D.
1620. triangle01_integrals_test
1621. 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.
1622. triangle01_monte_carlo_test
1623. 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.
1624. triangulation_test
1625. triangulation_boundary_nodes, a C++ code which reads data defining a triangulation, determines which nodes lie on the boundary, and writes their coordinates to a file;
1626. triangulation_boundary_nodes_test
1627. triangulation_corner, a C++ code which modifies triangulations in which one or more triangles have more than one boundary edge.
1628. triangulation_corner_test
1629. triangulation_delaunay_discrepancy, a C++ code which measures the amount by which a triangulation fails the local Delaunay test;
1630. triangulation_delaunay_discrepancy_test
1631. triangulation_display_opengl, a C++ code which reads files defining a 2D triangulation and displays an image using OpenGL.
1632. triangulation_display_opengl_test
1633. triangulation_histogram, a C++ code which computes histograms of data over a triangulation.
1634. triangulation_histogram_test
1635. triangulation_l2q, a C++ code which reads information about a 3-node (linear) triangulation and creates data defining a corresponding 6-node (quadratic) triangulation;
1636. triangulation_l2q_test
1637. triangulation_mask, a C++ code which reads a triangulation and calls a user-supplied routine to consider each triangle for deletion;
1638. triangulation_mask_test
1639. 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.
1640. triangulation_node_to_element_test
1641. triangulation_orient, a C++ code which ensures that the triangles in an order 3 or order 6 triangulation have positive orientation;
1642. triangulation_orient_test
1643. triangulation_plot, a C++ code which plots the nodes and elements of a triangulation as a PostScript (PS) file;
1644. triangulation_plot_test
1645. triangulation_q2l, a C++ code which reads information about a 6-node triangulation and creates data defining a corresponding 3-node triangulation;
1646. triangulation_q2l_test
1647. triangulation_quad, a C++ code which reads information about a triangulation and the value of a function at the nodes and estimates the integral of the function over the triangulated region.
1648. triangulation_quad_test
1649. triangulation_quality, a C++ code which reads information about a triangulation and computes various quality measures;
1650. triangulation_quality_test
1651. triangulation_rcm, a C++ code which reads files describing a triangulation of nodes in 2D, and applies the Reverse Cuthill McKee (RCM) algorithm to produce a renumbering of the triangulation with a reduced bandwidth.
1652. triangulation_rcm_test
1653. triangulation_refine, a C++ code which refines a triangulation;
1654. triangulation_refine_test
1655. triangulation_svg, a C++ code which creates an SVG image of a triangulation, which can be displayed by a web browser.
1656. triangulation_svg_test
1657. triangulation_t3_to_t4, a C++ code which reads information about a 3-node triangulation and creates data defining a corresponding 4-node triangulation (vertices + centroid);
1658. triangulation_t3_to_t4_test
1659. 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;
1660. triangulation_triangle_neighbors_test
1661. 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.
1662. truncated_normal_test
1663. 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].
1664. truncated_normal_rule_test
1665. tsp_att48, a C++ code which returns the (x,y) coordinates of the cities that constitute the AT&T 48 state challenge for the Traveling Salesman Problem (TSP). Graphics files are created for processing by gnuplot().
1666. tsp_att48_test
1667. tsp_brute, a C++ code which reads a file of city locations and solves a (small!) traveling salesperson problem, using brute force. Graphics files are created for processing by gnuplot().
1668. tsp_brute_test
1669. tsp_display, a C++ code which displays the solution of a Traveling Salesman Problem (TSP). Graphics files are created for processing by gnuplot().
1670. tsp_display_test
1671. tsp_nearest, a C++ code which is given a table of city locations, and solves a small traveling salesperson problem (TSP) using the nearest neighbor algorithm. It picks a starting city at random, and then successively visits the nearest unvisited city. Graphics files are created for processing by gnuplot().
1672. tsp_nearest_test
1673. ubvec, a C++ code which demonstrates how nonnegative integers can be stored as unsigned binary vectors, and arithmetic can be performed on them.
1674. ubvec_test
1675. umfpack_test, a C++ code which calls umfpack(), which solves sparse linear systems, part of the SuiteSparse package, by Timothy Davis.
1676. uncontrol, a C++ code which makes a copy of a text file which contains no control characters.
1677. uncontrol_test
1678. unicycle, a C++ code which considers permutations containing a single cycle, sometimes called cyclic permutations.
1679. unicycle_test
1680. uniform, a C++ code which implements uniform random number generators (RNG) for a variety of arithmetic types.
1681. uniform_test
1682. upc_code, a C++ code which computes the check digit of a uniform product code (UPC), or reports whether a full 12-digit UPC is valid.
1683. upc_code_test
1684. valgrind_test, a C++ code which uses valgrind(), a suite of debuggers and applications which include a memory leak detector.
1685. van_der_corput, a C++ code which evaluates the van der Corput 1-dimensional Quasi Mont Carlo (QMC) sequence, using a simple interface.
1686. van_der_corput_test
1687. vandermonde, a C++ code which implements the Bjork-Pereyra algorithm for accurate solution of linear systems involving the Vandermonde matrix.
1688. vandermonde_test
1689. vandermonde_approx_1d, a C++ code which finds a polynomial approximant to data y(x) of a 1D argument by setting up and solving an overdetermined linear system for the polynomial coefficients involving the Vandermonde matrix.
1690. vandermonde_approx_1d_test
1691. 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.
1692. vandermonde_approx_2d_test
1693. 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().
1694. vandermonde_interp_1d_test
1695. 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.
1696. vandermonde_interp_2d_test
1697. walker_sample, a C++ code which efficiently samples a discrete probability vector using Walker sampling.
1698. walker_sample_test
1699. walsh_transform, a C++ code which implements the Walsh data transform.
1700. walsh_transform_test
1701. 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).
1702. wathen_matrix_test
1703. wave_mpi, a C++ code which uses the finite difference method (FDM) and the Message Passing Interface (MPI) to estimate a solution to the wave equation.
1704. wave_mpi_test
1705. wavelet, a C++ code which does some simple calculations with wavelet transforms;
1706. wavelet_test
1707. wedge_exactness, a C++ code which investigates the polynomial exactness of a quadrature rule over the interior of the unit wedge in 3D.
1708. wedge_exactness_test
1709. wedge_felippa_rule, a C++ code which returns a Felippa quadrature rule for approximating integrals over the interior of the unit wedge in 3D.
1710. wedge_felippa_rule_test
1711. wedge_grid, a C++ code which computes a grid of points over the interior of the unit wedge in 3D.
1712. wedge_grid_test
1713. 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.
1714. wedge_integrals_test
1715. 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.
1716. wedge_monte_carlo_test
1717. 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.
1718. weekday_test
1719. wishart_matrix, a C++ code which produces sample matrices from the Wishart or Bartlett distributions, useful for sampling random covariance matrices.
1720. wishart_matrix_test
1721. wrap, a C++ code which makes a copy of a text file in which no line is longer than a user-specified wrap length.
1722. wrap_test
1723. wrap2, a C++ code which wraps long lines in a text file, but which wraps some lines early, so as to avoid breaking words.
1724. wrap2_test
1725. wtime, a C++ code which returns a reading of the wall clock time in seconds.
1726. wtime_test
1727. xy_display_opengl, a C++ code which reads XY information defining points in 2D, and displays an image using OpenGL.
1728. xy_io, a C++ code which reads and writes files in the XY, XYL and XYF simple graphics formats.
1729. xy_io_test
1730. xyf_display_opengl, a C++ code which reads XYF information defining points and faces in 2D, and displays an image using OpenGL.
1731. xyl_display_opengl, a C++ code which reads XYL information defining points and lines in 2D, and displays an image using OpenGL.
1732. xyz_display_opengl, a C++ code which reads XYZ information defining points in 3D, and displays an image using OpenGL.
1733. xyz_io, a C++ code which reads and writes simple graphics files in the XYZ, XYZL, and XYZF formats.
1734. xyz_io_test, a C++ code which reads and writes simple graphics files in the XYZ, XYZL, and XYZF formats.
1735. xyzf_display_opengl, a C++ code which reads XYZF information defining points and faces in 3D, and displays an image using OpenGL.
1736. xyzl_display_opengl, a C++ code which reads XYZL information defining points and lines in 3D, and displays an image using OpenGL.
1737. zero_brent, a C++ code which seeks a solution of a scalar nonlinear equation f(x)=0, by Richard Brent.
1738. zero_brent_test
1739. 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.
1740. zero_chandrupatla_test
1741. 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.
1742. zero_itp_test
1743. 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.
1744. zero_laguerre_test
1745. zero_muller, a C++ code which seeks a root of a nonlinear equation using the Muller method, with complex arithmetic.
1746. zero_muller_test
1747. zero_rc, a C++ code which seeks a solution of a scalar nonlinear equation f(x)=0, using reverse communication (RC), by Richard Brent.
1748. zero_rc_test
1749. ziggurat, a C++ code which samples the uniform, normal or exponential distributions, using the ziggurat method, by Marsaglia and Tsang.
1750. ziggurat_test
1751. 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.
1752. ziggurat_inline_test
1753. ziggurat_openmp, a C++ code which demonstrates how ziggurat() can be used as a random number generator (RNG) in an OpenMP parallel program.
1754. ziggurat_openmp_test

---

Last revised on 11 August 2025.