Fortran90 Codes

1. allocatable_array_test, a Fortran90 code which demonstrates how a main program can declare an allocatable array, which is then passed to a subroutine which allocates it, initializes it, and returns it to the calling program for further use.
2. analemma, a Fortran90 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 code by Brian Tung.
3. analemma_test
4. annulus_monte_carlo, a Fortran90 code which uses the Monte Carlo method to estimate the integral of a function over the interior of a circular annulus in 2D.
5. annulus_monte_carlo_test
6. apportionment, a Fortran90 code which demonstrates some of the methods used or proposed for fairly assigning seats in the House of Representatives to each state;
7. apportionment_test
8. args, a Fortran90 code which reports the command line arguments of a Fortran90 code;
9. args_test
10. arpack, a Fortran90 code which is a numerical software library for solving large scale eigenvalue problems. The package is designed to compute a few eigenvalues and corresponding eigenvectors of large sparse or structured matrices, using the Implicitly Restarted Arnoldi Method (IRAM) or, in the case of symmetric matrices, the corresponding variant of the Lanczos algorithm. It is used by many popular numerical computing environments such as SciPy, Mathematica, GNU Octave and MATLAB to provide this functionality.
11. arpack_test
12. asa005, a Fortran90 code which evaluates the Cumulative Density Function (CDF) of the noncentral T Probability Density Function (PDF), by BE Cooper. This is a version of Applied Statistics Algorithm 5;
13. asa005_test
14. asa006, a Fortran90 code which computes the Cholesky factorization of a symmetric positive definite (SPD) matrix, by Michael Healy. This is a version of Applied Statistics Algorithm 6;
15. asa006_test
16. asa007, a Fortran90 code which computes the inverse of a symmetric positive definite (SPD) matrix, by Michael Healy. This is a version of Applied Statistics Algorithm 7.
17. asa007_test
18. asa032, a Fortran90 code which evaluates the incomplete Gamma function, by G Bhattacharjee. This is a version of Applied Statistics Algorithm 32.
19. asa032_test
20. asa047, a Fortran90 code which minimizes a scalar function of several variables using the Nelder-Mead algorithm, by R ONeill. This is a version of Applied Statistics Algorithm 47.
21. asa047_test
22. asa053, a Fortran90 code which produces sample matrices from the Wishart distribution, by William Smith and Ronald Hocking. This is a version of Applied Statistics Algorithm 53.
23. asa053_test
24. asa058, a Fortran90 code which implements the K-means data clustering algorithm, by David Sparks. This is a version of Applied Statistics Algorithm 58.
25. asa058_test
26. asa063, a Fortran90 code which evaluates the incomplete Beta function, by KL Majumder and G Bhattacharjee. This is a version of Applied Statistics Algorithm 63.
27. asa063_test
28. asa066, a Fortran90 code which evaluates the Cumulative Density Function (CDF) of the normal probability distribution, by David Hill. This is a version of Applied Statistics Algorithm 66.
29. asa066_test
30. asa076, a Fortran90 code which evaluates the Owen T function, needed to compute the Cumulative Density Function (CDF) of the noncentral T distribution, by Young and Minder. This is a version of Applied Statistics Algorithm 76.
31. asa076_test
32. asa082, a Fortran90 code which computes the determinant of an orthogonal matrix; this is a version of Applied Statistics Algorithm 82, by J C Gower.
33. asa082_test
34. asa091, a Fortran90 code which evaluates the percentage points of the Chi-Squared distribution, by Best and Roberts. This is a version of Applied Statistics Algorithm 91.
35. asa091_test
36. asa103, a Fortran90 code which evaluates the digamma or psi function, by Jose Bernardo. This is a version of Applied Statistics Algorithm 103.
37. asa103_test
38. asa109, a Fortran90 code which inverts the incomplete Beta function, by Cran, Martin and Thomas. This is a version of Applied Statistics Algorithm 109.
39. asa109_test
40. asa111, a Fortran90 code which evaluates the percentage points of the normal distribution, by Beasley and Springer. This is a version of Applied Statistics Algorithm 111.
41. asa111_test
42. asa113, a Fortran90 code which implements a clustering algorithm using transfers and swaps, by Banfield and Bassill. This is a version of Applied Statistics Algorithm 113.
43. asa113_test
44. asa121, a Fortran90 code which evaluates the trigamma function, by BE Schneider. This is a version of Applied Statistics Algorithm 121.
45. asa121_test
46. asa136, a Fortran90 code which implements a clustering algorithm, by Hartigan and Wong. This is a version of Applied Statistics Algorithm 136.
47. asa136_test
48. asa144, a Fortran90 code which randomly generates an RxC contingency table, by James Boyett. This is a version of Applied Statistics Algorithm 144.
49. asa144_test
50. asa147, a Fortran90 code which evaluates the incomplete Gamma function, by Chi Leung Lau. This is a version of Applied Statistics Algorithm 147.
51. asa147_test
52. asa152, a Fortran90 code which evaluates the Probability Density Function (PDF) and Cumulative Density Function (CDF) associated with the hypergeometric distribution, by Richard Lund; this is a version of Applied Statistics Algorithm 152.
53. asa152_test
54. asa159, a Fortran90 code which randomly generates an RxC contingency table, by Michael Patefield; This is a version of Applied Statistics Algorithm 159.
55. asa159_test
56. asa172, a Fortran90 code which generates all M-dimensional indices in a given range, simulating the behavior of an arbitrary number of nested loops, by OFlaherty and MacKenzie. This is a version of Applied Statistics Algorithm 172.
57. asa172_test
58. asa183, a Fortran90 code which implements a random number generator (RNG), by Wichman and Hill. This is a version of Applied Statistics Algorithm 183.
59. asa183_test
60. asa189, a Fortran90 code which estimates the parameters of a beta binomial distribution based on a sample of values generated by the distribution, by D Smith; this is a version of Applied Statistics Algorithm 189;
61. asa189_test
62. asa205, a Fortran90 code which generates all the contingency tables corresponding to a given set of row and column sums. This is a version of Applied Statistics Algorithm 205.
63. asa205_test
64. asa226, a Fortran90 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.
65. asa226_test
66. asa239, a Fortran90 code which evaluates the incomplete Gamma function, by Shea. This is a version of Applied Statistics Algorithm 239.
67. asa239_test
68. asa241, a Fortran90 code which evaluates the percentage points of the normal distribution, by Michael Wichura. This is a version of Applied Statistics Algorithm 241.
69. asa241_test
70. asa243, a Fortran90 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.
71. asa243_test
72. asa245, a Fortran90 code which evaluates the logarithm of the Gamma function, by Allan Mcleod; this is a version of Applied Statistics Algorithm 245.
73. asa245_test
74. asa266, a Fortran90 code which evaluates various properties of the Dirichlet Probability Density Function (PDF); this is a version of Applied Statistics Algorithm 266;
75. asa266_test
76. asa299, a Fortran90 code which computes the lattice points in an M-dimensional simplex, by Chasalow and Brand; this is a version of Applied Statistics Algorithm 299;
77. asa299_test
78. asa310, a Fortran90 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.
79. asa310_test
80. asa314, a Fortran90 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;
81. asa314_test
82. atbash, a Fortran90 code which applies the Atbash substitution cipher to a string of text.
83. atbash_test
84. backtrack_binary_rc, a Fortran90 code which carries out a backtrack search for binary decisions, using reverse communication (RC).
85. backtrack_binary_rc_test
86. backward_euler, a Fortran90 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 Fortran90 code which computes grid points inside a 3D ball.
89. ball_grid_test
90. ball_integrals, a Fortran90 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 Fortran90 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. band_qr, a Fortran90 code which computes the QR factorization of a banded matrix, and solves related linear systems, by Alfredo Remon, Enrique Quintana-Orti, Gregorio Quintana-Orti.
95. band_qr_test
96. barycentric_interp_1d, a Fortran90 code which defines and evaluates the barycentric Lagrange polynomial p(x) which interpolates 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 Fortran90 code which solves one or more ordinary differential equations (ODE) using the (implicit) backward difference formula of order 2 (BDF2), using fsolve() to solve the implicit equation.
99. bdf2_test
100. bdmlib, a Fortran90 code which estimates the weights in a Dirichlet mixture based on sample data;
101. bdmlib_test
102. bellman_ford, a Fortran90 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 Fortran90 code which evaluates the Bernstein polynomials;
105. bernstein_polynomial_test
106. besselj, a Fortran90 code which evaluates Bessel J functions of noninteger order;
107. besselj_test
108. beta_nc, a Fortran90 code which evaluates the cumulative density function (CDF) of the noncentral Beta distribution;
109. beta_nc_test
110. bezier_surface, a Fortran90 code which reads, writes, prints and manipulates the data that defines a Bezier surface;
111. bezier_surface_test
112. biharmonic_exact, a Fortran90 code which evaluates exact solutions w(x,y) to the biharmonic equation del^2 w = 0 or wxxxx + 2 wxxyy + wyyyy = 0
113. biharmonic_exact_test
114. bins, a Fortran90 code which sorts data into order, or lumps it into bins, or selects an item of particular rank, or finds the unique elements in a list.
115. bins_test
116. bisection, a Fortran90 code which applies the bisection method to seek a root of f(x) over a change-of-sign interval a <= x <= b.
117. bisection_test
118. bisection_integer, a Fortran90 code which seeks an integer solution to the equation F(X)=0, using bisection within a user-supplied change of sign interval [A,B].
119. bisection_integer_test
120. bisection_rc, a Fortran90 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).
121. bisection_rc_test
122. bivar, a Fortran90 code which interpolates scattered bivariate data. This is a version of ACM TOMS algorithm 526, by Hiroshi Akima.
123. bivar_test
124. black_scholes, a Fortran90 code which implements some simple approaches to the Black-Scholes option valuation theory, creating graphics files for processing by gnuplot(), by Desmond Higham.
125. black_scholes_test
126. blend, a Fortran90 code which carries out 1D/2D/3D blending interpolation;
127. blend_test
128. box_behnken, a Fortran90 code which computes a Box-Behnken design, that is, arguments to sample the behavior of a function of multiple parameters;
129. box_behnken_test
130. brownian_motion_simulation, a Fortran90 code which simulates Brownian motion in an M-dimensional region, creating graphics files for processing by gnuplot().
131. brownian_motion_simulation_test
132. bump, a Fortran90 code which solves a 2D steady incompressible flow problem set in a channel with a small bump.
133. bump_test
134. burgers_exact, a Fortran90 code which evaluates exact solutions of the time-dependent 1D viscous Burgers equation.
135. burgers_exact_test
136. bvec, a Fortran90 code which demonstrates how signed integers can be stored as binary vectors, and arithmetic can be performed on them.
137. bvec_test
138. bvls, a Fortran90 code which applies linear least squares (LLS) methods to solve a system for which lower and upper constraints may have been placed on every variable, by Charles Lawson and Richard Hanson.
139. bvls_test
140. c_comment, a Fortran90 code which reads an ASCII text file, and writes a copy, in which C++ style comments have been replaced by equivalent C-style comments.
141. c_comment_test
142. c8lib, a Fortran90 code which implements certain elementary functions for double precision complex (C8) variables;
143. c8lib_test
144. c8poly, a Fortran90 code which operates on complex polynomials.
145. c8poly_test
146. caesar, a Fortran90 code which applies a Caesar Shift Cipher to a string of text.
147. caesar_test
148. calendar_nyt, a Fortran90 code which shows the correspondence between dates and the New York Times volume and issue number;
149. calendar_nyt_test
150. calpak, a Fortran90 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.
151. calpak_test
152. candy_count, a Fortran90 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.
153. candy_count_test
154. cauchy_principal_value, a Fortran90 code which uses Gauss-Legendre quadrature to estimate the Cauchy Principal Value (CPV) of certain singular integrals.
155. cauchy_principal_value_test
156. ccn_rule, a Fortran90 code which defines a Clenshaw Curtis Nested (CCN) quadrature rule.
157. ccn_rule_test
158. ccs_io, a Fortran90 code which reads and writes sparse linear systems stored in the Compressed Column Storage (CCS) format.
159. ccs_io_test
160. ccs_to_st, a Fortran90 code which converts a sparse matrix from compressed column storage (CCS) to sparse triplet (ST) format.
161. ccs_to_st_test
162. cdflib, a Fortran90 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.
163. cdflib_test
164. cell, a Fortran90 code which defines a cell array, a generalization of an array which compactly stores and retrieves vector or matrix data of varying size, such as the rows of a triangular matrix.
165. cell_test
166. cg, a Fortran90 code which implements a simple version of the conjugate gradient (CG) method for solving a system of linear equations of the form A*x=b, suitable for situations in which the matrix A is positive definite, only real, positive eigenvalues and symmetric.
167. cg_test
168. cg_rc, a Fortran90 code which implements the conjugate gradient (CG) method for solving a positive definite sparse linear system A*x=b, using reverse communication (RC).
169. cg_rc_test
170. change_dynamic, a Fortran90 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.
171. change_dynamic_test
172. channel, a Fortran90 code which computes the time-independent flow of a viscous incompressible fluid in a 2D channel.
173. channel_test
174. chebyshev, a Fortran90 code which computes the Chebyshev interpolant/approximant to a given function over an interval.
175. chebyshev_test
176. chebyshev_interp_1d, a Fortran90 code which determines the combination of Chebyshev polynomials which interpolates data, so that p(x(i)) = y(i).
177. chebyshev_interp_1d_test
178. chebyshev_polynomial, a Fortran90 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.
179. chebyshev_polynomial_test
180. chebyshev_series, a Fortran90 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.
181. chebyshev_series_test
182. chrpak, a Fortran90 code which manipulates characters and strings;
183. chrpak_test
184. circle_arc_grid, a Fortran90 code which computes a grid of points over the length of a circle or circular arc in 2D.
185. circle_arc_grid_test
186. circle_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the circumference of the unit circle in 2D.
187. circle_integrals_test
188. circle_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate the integral of a function along the circumference of the unit circle in 2D;
189. circle_monte_carlo_test
190. circle_packing, a Fortran90 code which performs a circle-packing test on the spacing for points;
191. circle_packing_test
192. circle_segment, a Fortran90 code which carries out computations associated with a circle segment, including height, angle, area, centroid, sampling, and quadrature, creating some graphics images using gnuplot().
193. circle_segment_test
194. clausen, a Fortran90 code which evaluates a Chebyshev interpolant to the Clausen function Cl2(x).
195. clausen_test
196. clenshaw_curtis_grid, a Fortran90 code which sets up a Clenshaw Curtis quadrature rule in multiple dimensions;
197. clenshaw_curtis_grid_test
198. closest_pair_brute, a Fortran90 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.
199. closest_pair_brute_test
200. closest_point_brute, a Fortran90 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.
201. closest_point_brute_test
202. cluster_energy, a Fortran90 code which groups data into a given number of clusters to minimize the energy.
203. cluster_energy_test
204. cnf_io, a Fortran90 code which reads or writes DIMACS Conjunctive Normal Form (CNF) files defining satisfiability problems in terms of a boolean formula.
205. cnf_io_test
206. codepack, a Fortran90 code which determine if two graphs are isomorphic.
207. codepack_test
208. collatz_recursive, a Fortran90 code which demonstrates recursive programming by considering the simple Collatz 3n+1 problem.
209. collatz_recursive_test
210. color_digraph_adj, a Fortran90 code which carries out operations on color digraphs, a directed graph in which each node has been assigned a color. That information is stored in an adjacency matrix in which the diagonal elements record colors. Operations include counting the colors, computing in- and out-degrees, computing the in- and out-degree sequences, counting the edges, printing the adjacency matrix, generating fixed and random examples.
211. color_digraph_adj_test
212. color_graph_adj, a Fortran90 code which carries out operations on color graphs, an undirected graph in which each node has been assigned a color. That information is stored in an adjacency matrix in which the diagonal elements record colors. Operations include counting the colors, computing degrees, computing the degree sequences, counting the edges, printing the adjacency matrix, generating fixed and random examples.
213. color_graph_adj_test
214. colored_noise, a Fortran90 code which generates samples of noise obeying a 1/f^alpha power law.
215. colored_noise_test
216. colors, a Fortran90 code which converts between various formats for describing colors;
217. colors_test
218. combo, a Fortran90 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.
219. combo_test
220. communicator_mpi, a Fortran90 code which creates new communicators involving a subset of initial set of MPI processes in the default communicator MPI_COMM_WORLD.
221. communicator_mpi_test
222. companion_matrix, a Fortran90 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.
223. companion_matrix_test
224. compass_search, a Fortran90 code which seeks the minimizer of a scalar function of several variables using compass search, a direct search algorithm that does not use derivatives.
225. compass_search_test
226. complex_numbers_test, a Fortran90 code which demonstrates some simple features involved in the use of complex numbers.
227. components, a Fortran90 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.
228. components_test
229. condition, a Fortran90 code which implements methods of computing or estimating the condition number of a matrix.
230. condition_test
231. continued_fraction, a Fortran90 code which deals with simple and generalized continued fractions.
232. continued_fraction_test
233. cordic, a Fortran90 code which computes a few special functions using the CORDIC algorithm.
234. cordic_test
235. cosine_transform, a Fortran90 code which demonstrates some simple properties of the discrete cosine transform (DCT).
236. cosine_transform_test
237. crystal_coordinates, a Fortran90 code which generates the coordinates of a set of 4 * NX * NY * NZ points in a rectangular block of NX * NY * NZ cells, with face-centered cubic (FCC) symmetry.
238. crystal_coordinates_test
239. csv_io, a Fortran90 code which reads and writes files that use the Comma Separated Value (CSV) format.
240. csv_io_test
241. cube_exactness, a Fortran90 code which computes the polynomial exactness of quadrature rules over the interior of a cube in 3D.
242. cube_exactness_test
243. cube_grid, a Fortran90 code which computes a grid of points over the interior of a cube in 3D.
244. cube_grid_test
245. cube_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the interior of the unit cube in 3D.
246. cube_integrals_test
247. cube_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit cube in 3D.
248. cube_monte_carlo_test
249. cuda_loop, a Fortran90 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.
250. cuda_loop_test
251. cvt, a Fortran90 code which computes elements of a Centroidal Voronoi Tessellation (CVT).
252. cvt_test
253. cvt_basis, a Fortran90 code which uses discrete Centroidal Voronoi Tessellation (CVT) techniques to produce a small set of basis vectors that are good cluster centers for a large set of data vectors;
254. cvt_basis_test
255. cvt_basis_flow, a Fortran90 code which extracts dominant solution modes from solutions of a flow problem governed by the Navier Stokes Equations (NSE) using Centroidal Voronoi Tessellation (CVT) methods.
256. cvt_box, a Fortran90 code which calculates a Centroidal Voronoi Tessellation (CVT) constrained to a box region, with points projected to the boundary;
257. cvt_box_test
258. cvtp, a Fortran90 code which creates a Centroidal Voronoi Tessellation on a Periodic region (CVTP).
259. cvtp_test
260. cvt_triangulation, a Fortran90 code which applies Centroidal Voronoi Tessellation (CVT) techniques to the test_triangulation() set;
261. cvt_triangulation_test
262. cyclic_reduction, a Fortran90 code which solves a tridiagonal linear system using cyclic reduction.
263. cyclic_reduction_test
264. diaphony, a Fortran90 code which reads a file of N points in M dimensions and computes its diaphony, a measure of point dispersion.
265. diaphony_test
266. differ, a Fortran90 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.
267. differ_test
268. digraph_adj, a Fortran90 code which carries out operations on digraphs, a directed graph. Information is stored in an adjacency matrix. Operations include computing in- and out-degrees, computing the in- and out-degree sequences, counting the edges, printing the adjacency matrix, generating fixed and random examples.
269. digraph_adj_test
270. digraph_arc, a Fortran90 code which carries out operations on digraphs, a directed graph. Information is stored in an arc list, pairs of nodes forming edges. Operations include computing in- and out-degrees, computing the in- and out-degree sequences, counting the edges, printing the arc list, generating fixed and random examples.
271. digraph_arc_test
272. dijkstra, a Fortran90 code which implements a simple version of the Dijkstra minimum distance algorithm for graphs.
273. dijkstra_test
274. discrete_pdf_sample_2d, a Fortran90 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.
275. discrete_pdf_sample_2d_test
276. disk_grid, a Fortran90 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.
277. disk_grid_test
278. disk_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate integrals of a function over the interior of the general disk in 2D;
279. disk_monte_carlo_test
280. disk01_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the interior of the unit disk in 2D.
281. disk01_integrals_test
282. disk01_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit disk in 2D;
283. disk01_monte_carlo_test
284. disk01_positive_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit positive disk in 2D;
285. disk01_positive_monte_carlo_test
286. distance_to_position, a Fortran90 code which estimates the positions of cities based on a city-to-city distance table.
287. distance_to_position_test
288. divdif, a Fortran90 code which creates, prints and manipulates divided difference polynomials from a table of values (x,f(x)). The code can compute the coefficients of the Newton and power sum forms of the interpolating polynomial. It can compute the derivative or antiderivate polynomial. It can compute the form of the Lagrange basis polynomials. It can compute the points and weights for Newton Cotes quadrature rules. It can compute the weights for a Lagrange interpolation scheme.
289. divdif_test
290. doomsday, a Fortran90 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.
291. doomsday_test
292. dqed, a Fortran90 code which solves (square) systems of nonlinear equations, or minimizes the residual in a set of nonlinear equations, using least squares, by Richard Hanson and Fred Krogh.
293. dqed_test
294. dream, a Fortran90 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.
295. dream_test
296. duel_simulation, a Fortran90 code which simulates N repetitions of a duel between two players, each of whom has a known firing accuracy.
297. duel_simulation_test
298. dutch, a Fortran90 code which carries out tasks in computational geometry.
299. dutch_test
300. edge, a Fortran90 code which defines some test functions in 1D, 2D and 3D for the detection of edges or discontinuities. It uses gnuplot() to display the jumps in curves and surfaces.
301. edge_test
302. eigs, a Fortran90 code which computes the eigenvalues and eigenvectors of a matrix.
303. eigs_test
304. eispack, a Fortran90 code which carries out eigenvalue computations. It includes a function to compute the singular value decomposition (SVD) of a rectangular matrix. superseded by lapack();
305. eispack_test
306. ellipse, a Fortran90 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.
307. ellipse_test
308. ellipse_grid, a Fortran90 code which computes grid points over the interior of an ellipse in 2D.
309. ellipse_grid_test
310. ellipse_monte_carlo, a Fortran90 code which uses the Monte Carlo method to estimate the value of integrals over the interior of an ellipse in 2D.
311. ellipse_monte_carlo_test
312. ellipsoid, a Fortran90 code which carries out geometric calculations for ellipsoids, including area, random sampling, conversion between standard and quadratic forms.
313. ellipsoid_test
314. ellipsoid_grid, a Fortran90 code which computes a grid of points over the interior of an ellipsoid in 3D.
315. ellipsoid_grid_test
316. ellipsoid_monte_carlo, a Fortran90 code which uses the Monte Carlo method to estimate the value of integrals over the interior of an ellipsoid in M dimensions.
317. ellipsoid_monte_carlo_test
318. elliptic_integral, a Fortran90 code which evaluates complete elliptic integrals of first, second and third kind, using the Carlson elliptic integral functions.
319. elliptic_integral_test
320. etdrk4, a Fortran90 code which uses the ETD RK4 method to solve systems of stiff ordinary differential equations (ODE), by Aly-Khan Kassam, Lloyd Trefethen.
321. etdrk4_test
322. euler, a Fortran90 code which solves one or more ordinary differential equations (ODE) using the forward Euler method.
323. euler_test
324. exactness, a Fortran90 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).
325. exactness_test
326. extract, a Fortran90 code which pulls a copy of a Fortran block data, function, module, program or subroutine from a big file, and saves the copy in a little file.
327. extract_test
328. f90_combinatorics, a Fortran90 code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.
329. f90_exact, a Fortran90 code which evaluates exact solutions to a few selected examples of ordinary differential equations (ODE) and partial differential equations (PDE).
330. f90_monte_carlo, a Fortran90 code which uses Monte Carlo sampling to estimate areas and integrals.
331. f90_ode_solver, a Fortran90 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.
332. f90_random_test, a Fortran90 code which calls the random number generator (RNG) routines.
333. f90_rule, a Fortran90 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).
334. f90_simulation, a Fortran90 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.
335. f90split, a Fortran90 code which reads a Fortran file and creates individual files for every blockdata, function, module, program, or subroutine in the file.
336. f90split_test
337. fair_dice_simulation, a Fortran90 code which simulates N games where two fair dice are thrown and summed, creating graphics files for processing by gnuplot().
338. fair_dice_simulation_test
339. fd_predator_prey, a Fortran90 code which solves a pair of predator prey ordinary differential equations (ODE) using the finite difference method (FDM), and plots the data with gnuplot().
340. fd_predator_prey_test
341. fd1d_advection_diffusion_steady, a Fortran90 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().
342. fd1d_advection_diffusion_steady_test
343. fd1d_advection_ftcs, a Fortran90 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().
344. fd1d_advection_ftcs_test
345. fd1d_advection_lax, a Fortran90 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().
346. fd1d_advection_lax_test
347. fd1d_advection_lax_wendroff, a Fortran90 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().
348. fd1d_advection_lax_wendroff_test
349. fd1d_burgers_lax, a Fortran90 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.
350. fd1d_burgers_lax_test
351. fd1d_burgers_leap, a Fortran90 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.
352. fd1d_burgers_leap_test
353. fd1d_bvp, a Fortran90 code which applies the finite difference method (FDM) to a two point boundary value problem (BVP) in one spatial dimension.
354. fd1d_bvp_test
355. fd1d_heat_explicit, a Fortran90 code which implements a finite difference method (FDM), explicit in time, of the time dependent 1D heat equation;
356. fd1d_heat_explicit_test
357. fd1d_heat_implicit, a Fortran90 code which implements a finite difference method (FDM), implicit in time, of the time dependent 1D heat equation;
358. fd1d_heat_implicit_test
359. fd1d_heat_steady, a Fortran90 code which implements a finite difference method (FDM) for the steady time-independent 1D heat equation;
360. fd1d_heat_steady_test
361. fd1d_predator_prey, a Fortran90 code which implements the finite difference method (FDM) for a predator-prey system with time and 1D spatial dependence, by Marcus Garvie.
362. fd1d_predator_prey_test
363. fd1d_wave, a Fortran90 code which applies the finite difference method (FDM) to solve the time-dependent wave equation utt = c * uxx in one spatial dimension.
364. fd1d_wave_test
365. fd2d_heat_steady, a Fortran90 code which implements a finite difference method (FDM) for the steady time-independent 2D heat equation;
366. fd2d_heat_steady_test
367. fd2d_predator_prey, a Fortran90 code which implements the finite difference method (FDM) for a 2D predator-prey system, by Marcus Garvie.
368. fd2d_predator_prey_test
369. fem_basis, a Fortran90 code which defines and evaluates basis functions associated with the finite element method (FEM) for any degree in an M-dimensional simplex: 1D interval, 2D triangle, 3D tetrahedron, and higher dimensional generalizations.)
370. fem_basis_test
371. fem_io, a Fortran90 code which reads or writes FEM files, which describe the nodes, elements, and function values associated with a finite element method (FEM) model;
372. fem_io_test
373. fem_to_gmsh, a Fortran90 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.
374. fem_to_gmsh_test
375. fem_to_medit, a Fortran90 code which reads FEM files defining the node coordinates, boundary nodes, and elements of a finite element mesh, and rewrites the data as a medit() MESH file.
376. fem_to_medit_test
377. fem_to_tec, a Fortran90 code which converts FEM models into tecplot ASCII files.
378. fem_to_tec_test
379. fem_to_triangle, a Fortran90 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 Jonathan Shewchuk's triangle() program
380. fem_to_triangle_test
381. fem_to_xml, reads a pair of FEM files defining node coordinates and elements, of a 1D, 2D or 3D mesh, namely a file of node coordinates and a file of elements defined by node indices, and creates a corresponding XML file for input to dolfin() or fenics().
382. fem_to_xml_test
383. fem1d, a Fortran90 code which applies the finite element method (FEM), using piecewise linear basis functions, to a linear two point boundary value problem (BVP) in 1D;
384. fem1d_test
385. fem1d_adaptive, a Fortran90 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;
386. fem1d_adaptive_test
387. fem1d_bvp_linear, a Fortran90 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.
388. fem1d_bvp_linear_test
389. fem1d_bvp_quadratic, a Fortran90 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.
390. fem1d_bvp_quadratic_test
391. fem1d_heat_steady, a Fortran90 code which implements the finite element method (FEM) for the steady time-independent 1D heat equation;
392. fem1d_heat_steady_test
393. fem1d_lagrange, a Fortran90 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.
394. fem1d_lagrange_test
395. fem1d_nonlinear, a Fortran90 code which applies the finite element method (FEM), with piecewise linear basis functions, to a nonlinear two point boundary value problem (BVP) in 1D;
396. fem1d_nonlinear_test
397. fem1d_pack, a Fortran90 code which contains utilities for 1D finite element method (FEM) calculations.
398. fem1d_pack_test
399. fem1d_pmethod, a Fortran90 code which applies the p-method version of the finite element method (FEM) to a linear two point boundary value problem (BVP) in 1D;
400. fem1d_pmethod_test
401. fem1d_project, a Fortran90 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.
402. fem1d_project_test
403. fem1d_sample, a Fortran90 code which samples a scalar or vector finite element function of one variable, defined by FEM files, returning interpolated values at the sample points.
404. fem1d_sample_test
405. fem2d_bvp_linear, a Fortran90 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.
406. fem2d_bvp_linear_test
407. fem2d_bvp_quadratic, a Fortran90 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.
408. fem2d_bvp_quadratic_test
409. fem2d_bvp_serene, a Fortran90 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.
410. fem2d_bvp_serene_test
411. fem2d_heat, a Fortran90 code which uses the finite element method (FEM) and the backward Euler method to solve the time-dependent heat equation on an arbitrary triangulated region in 2D. The user supplies some information in some problem-dependent subroutines.
412. fem2d_heat_test
413. fem2d_heat_rectangle, a Fortran90 code which implements the finite element method (FEM) for the time dependent heat equation on a triangulated square in 2D;
414. fem2d_heat_rectangle_test
415. fem2d_pack, a Fortran90 code which implements simple 2D finite element method (FEM) calculations;
416. fem2d_pack_test
417. fem2d_poisson_rectangle, a Fortran90 code which solves the 2D Poisson equation on a rectangle, using the finite element method (FEM), and piecewise quadratic triangular elements.
418. fem2d_poisson_rectangle_test
419. fem2d_poisson_rectangle_linear, a Fortran90 code which solves the 2D Poisson equation on a rectangle, using the finite element method (FEM), and piecewise linear triangular elements.
420. fem2d_poisson_rectangle_linear_test
421. fem2d_sample, a Fortran90 code which samples at arbitray points a finite element function, defined by FEM files, three text files describing the nodes, triangles, and coefficients.
422. fem2d_sample_test
423. fem3d_pack, a Fortran90 code which contains utilities for 3D finite element method (FEM) calculations.
424. fem3d_pack_test
425. fem3d_sample, a Fortran90 code which evaluates a finite element function defined on a 3D tetrahedral mesh.
426. fem3d_sample_test
427. fftpack5, a Fortran90 code which computes Fast Fourier Transforms (FFTs), by Paul Swarztrauber and Dick Valent;
428. fftpack5_test
429. fftpack51, a Fortran90 code which computes Fast Fourier Transforms (FFTs), using real 64 bit arithmetic, by Paul Swarztrauber and Dick Valent;
430. fftpack51_test
431. fftw_test, a Fortran90 code which calls fftw(), which computes Fast Fourier Transforms (FFT), by Matteo Frigo and Steven Johnson.
432. file_name_sequence, a Fortran90 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.
433. file_name_sequence_test
434. files_multiple, a Fortran90 code which demonstrates how a program can open multiple output files at one time, and write data to any one specific file it chooses.
435. filon_rule, a Fortran90 code which uses Filon's method to approximate integrals which include an oscillatory factor of sin(k*x) or cos(k*x).
436. filon_rule_test
437. filum, a Fortran90 code which performs various operations on files;
438. filum_test
439. fisher_exact, a Fortran90 code which returns an exact solution of the Kolmogorov Petrovsky Piskonov Fisher partial differential equation (PDE) ut=uxx+u*(1-u).
440. fisher_exact_test
441. fixcon, a Fortran90 code which converts the line continuation scheme used in a Fortran77 file to that used in Fortran90 files.
442. fixcon_test
443. flame_exact, a Fortran90 code which returns the exact solution of an ordinary differential equation (ODE) which models the growth of a ball of flame in a combustion process. The exact solution is defined in terms of the Lambert W function.
444. flame_exact_test
445. floyd, a Fortran90 code which implements the Floyd algorithm for finding the shortest distance between pairs of nodes on a directed graph.
446. floyd_test
447. football_dynamic, a Fortran90 code which uses dynamic programming to count the ways of achieving a given score in football.
448. football_dynamic_test
449. football_rank, a Fortran90 code which is given a set of game scores, and produces a ranking of college football teams.
450. football_rank_test
451. freefem_msh_io, a Fortran90 code which reads and writes files used by FreeFem++ to store mesh information for the finite element method (FEM).
452. freefem_msh_io_test
453. frieze, a Fortran90 code which demonstrates how to tile a 2D region with repeated copies of a given pattern.
454. frieze_test
455. fsolve, a Fortran90 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.
456. fsolve_test
457. gauss_seidel, a Fortran90 code which implements the Gauss-Seidel iteration for linear systems.
458. gauss_seidel_test
459. gdb_test, a Fortran90 code which uses the GNU debugger;
460. gegenbauer_cc, a Fortran90 code which computes the Gegenbauer weighted integral of a function f(x) using a Clenshaw-Curtis approach.
461. gegenbauer_cc_test
462. gegenbauer_exactness, a Fortran90 code which tests the polynomial exactness of Gauss-Gegenbauer quadrature rules.
463. gegenbauer_exactness_test
464. gegenbauer_polynomial, a Fortran90 code which evaluates the Gegenbauer polynomial and associated functions.
465. gegenbauer_polynomial_test
466. gegenbauer_rule, a Fortran90 code which computes and writes out a Gauss-Gegenbauer quadrature rule of given order.
467. gegenbauer_rule_test
468. gen_hermite_exactness, a Fortran90 code which tests the polynomial exactness of generalized Gauss-Hermite quadrature rules.
469. gen_hermite_exactness_test
470. gen_hermite_rule, a Fortran90 code which computes and writes out a generalized Gauss-Hermite quadrature rule of given order and parameter value.
471. gen_hermite_rule_test
472. gen_laguerre_exactness, a Fortran90 code which tests the polynomial exactness of generalized Gauss-Laguerre quadrature rules.
473. gen_laguerre_exactness_test
474. gen_laguerre_rule, a Fortran90 code which computes and writes out a generalized Gauss-Laguerre quadrature rule of given order and parameter value.
475. gen_laguerre_rule_test
476. gene_cluster, a Fortran90 code which clusters sets of genetic expression data;
477. gene_cluster_test
478. geometry, a Fortran90 code which performs geometric calculations in 2, 3 and M dimensional space, including the computation of angles, areas, containment, distances, intersections, lengths, and volumes.
479. geometry_test
480. geompack, a Fortran90 code which computes Delaunay triangulations, Voronoi diagrams, and other information, by Barry Joe.
481. geompack_test
482. gfortran_quadmath_test, a Fortran90 code which illustrates the use of quadruple real precision arithmetic with the Gnu Fortran compiler.
483. gl_fast_rule, a Fortran90 code which carries out the rapid computation of the Kth value and weight of an N point Gauss-Legendre quadrature rule, by Ignace Bogaert.
484. gl_fast_rule_test
485. glomin, a Fortran90 code which finds a global minumum of a scalar function of a scalar variable, without the use of derivative information, by Richard Brent.
486. glomin_test
487. gmsh_io, a Fortran90 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).
488. gmsh_io_test
489. gmsh_to_fem, a Fortran90 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.
490. gmsh_to_fem_test
491. gprof_test, a Fortran90 code which uses the gprof() profiling tool.
492. graph_adj, a Fortran90 code which carries out operations on abstract graphs, with undirected edges, represented by an adjacency matrix. Operations include breadth-first search, the computation of a minimum spanning tree, an Euler or Hamilton circuit, blocks, chromatic polynomial, or transitive closure.
493. graph_adj_test
494. graph_arc, a Fortran90 code which carries out operations on graphs. Information is stored in an arc list, pairs of nodes forming edges. Operations include the chromatic polynomial, computing degrees, computing the degree sequence, counting the edges, determining edge and node connectivity, Euler circuits, spanning trees, shortest path, printing the arc list, generating fixed and random examples.
495. graph_arc_test
496. graph_code, a Fortran90 code which reads a table file representing the adjacency matrix of a graph, and computes the graph code.
497. graph_code_test
498. graph_dist, a Fortran90 code which carries out operations on abstract graphs, defined by undirected edges with an associated distance matrix.
499. graph_dist_test
500. graph_paper, a Fortran90 code which makes PostScript (PS) graph paper;
501. graph_paper_test
502. graph_theory, a Fortran90 code which carries out operations on abstract graphs, such as a breadth-first-search, the computation of a minimum spanning tree, an Euler or Hamilton circuit, blocks, chromatic polynomial, or transitive closure. Objects include undirected and directed graphs, weighted graphs, and trees.
503. graph_theory_test
504. graphics_dislin_test, a Fortran90 code which graphically displays various kinds of data, using the dislin() graphics library.
505. graphics_gnuplot_test, a Fortran90 code which graphically displays various kinds of data, using the gnuplot() graphics program.
506. grf_io, a Fortran90 code which reads or writes a grf file which represents a mathematical graph;
507. grf_io_test
508. grf_to_eps, a Fortran90 code which converts a GRF file to Encapsulated PostScript (EPS) format;
509. grf_to_eps_test
510. grf_to_xyl, a Fortran90 code which converts information describing the adjacency and embedding of an abstract graph from GRF to XYL format.
511. grf_to_xyl_test
512. haar_transform, a Fortran90 code which computes the Haar transform of 1d or 2d data.
513. haar_transform_test
514. halton, a Fortran90 code which computes elements of a Halton Quasi Monte Carlo (QMC) sequence, using a simple interface.
515. halton_test
516. hammersley, a Fortran90 code which computes elements of a Hammersley Quasi Monte Carlo (QMC) sequence, using a simple interface.
517. hammersley_test
518. hankel_cholesky, a Fortran90 code which computes the upper Cholesky factor R of a symmetric positive definite (SPD) Hankel matrix H so that H = R' * R.
519. hankel_cholesky_test
520. hankel_spd, a Fortran90 code which computes a lower triangular matrix L that is the Cholesky factor of a symmetric positive definite (SPD) Hankel matrix H, that is, H = L * L'.
521. hankel_spd_test
522. hb_io, a Fortran90 code which reads and writes sparse linear systems stored in the Harwell Boeing (HB) format for sparse matrices.
523. hb_io_test
524. hb_to_st, a Fortran90 code which converts a sparse matrix from Harwell Boeing (HB) format to Sparse Triplet (ST) format.
525. hb_to_st_test
526. heat_mpi, a Fortran90 code which solves the 1D time dependent heat equation in parallel, using the Message Passing Interface (MPI).
527. heat_mpi_test
528. heated_plate, a Fortran90 code which solves the steady (time independent) heat equation in a 2D rectangular region, and is intended as a starting point for implementing a parallel version.
529. heated_plate_test
530. heated_plate_openmp, a Fortran90 code which solves the steady (time independent) heat equation in a 2D rectangular region, using OpenMP to run in parallel.
531. heated_plate_openmp_test
532. hello, a Fortran90 code which prints out "Hello, world!".
533. hello_test
534. hello_mpi, a Fortran90 code which prints 'Hello, world!' using the Message Passing Interface (MPI) for parallel execution.
535. hello_mpi_test
536. hello_openmp, a Fortran90 code which prints 'Hello, world!', using OpenMP for parallel execution.
537. hello_openmp_test
538. helmholtz_openmp, a Fortran90 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.
539. helmholtz_openmp_test
540. hermite_cubic, a Fortran90 code which computes the value, derivatives or integral of a Hermite cubic polynomial, or manipulate an interpolating function made up of piecewise Hermite cubic polynomials.
541. hermite_cubic_test
542. hermite_exactness, a Fortran90 code which tests the monomial exactness of quadrature rules for estimating Hermite-type integrals of a function f(x) with density rho(x)=exp(-x^2) over the interval (-oo,+oo).
543. hermite_exactness_test
544. hermite_integrands, a Fortran90 code which defines test integrands for Hermite integrals with density exp(-x^2) over the interval (-oo,+oo).
545. hermite_integrands_test
546. hermite_interpolant, a Fortran90 code which computes the Hermite interpolant, a polynomial that matches function values and derivatives.
547. hermite_interpolant_test
548. hermite_polynomial, a Fortran90 code which evaluates the physicist's Hermite polynomial, the probabilist's Hermite polynomial, the Hermite function, and related functions.
549. hermite_polynomial_test
550. hermite_product_polynomial, a Fortran90 code which defines Hermite product polynomials, creating a multivariate polynomial as the product of univariate Hermite polynomials.
551. hermite_product_polynomial_test
552. hex_grid, a Fortran90 code which computes points on a hexagonal grid.
553. hex_grid_test
554. hex_grid_angle, a Fortran90 code which produces a hexagonal grid of points in the unit square or an arbitrary box, allowing the user to specify an arbitrary center, angle, and grid density.
555. hex_grid_angle_test
556. hexahedron_jaskowiec_rule, a Fortran90 code which returns a symmetric Jaskowiec quadrature rule for the hexahedron, with exactness up to total degree 21.
557. hexahedron_jaskowiec_rule_test
558. hexahedron_witherden_rule, a Fortran90 code which returns a symmetric Witherden quadrature rule for the hexahedron, with exactness up to total degree 11.
559. hexahedron_witherden_rule_test
560. high_card_simulation, a Fortran90 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; using gnuplot() for graphics.
561. high_card_simulation_test
562. hilbert_curve, a Fortran90 code which computes the sequence of discrete Hilbert curves whose limit is a space-filling curve.
563. hilbert_curve_test
564. humps, a Fortran90 code which evaluates the humps function, its first and second derivatives, and its antiderivative.
565. humps_test
566. hyper_2f1, a Fortran90 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.
567. hyper_2f1_test
568. hyperball_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the interior of the unit hyperball in M dimensions.
569. hyperball_integrals_test
570. hyperball_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit ball in M dimensions;
571. hyperball_monte_carlo_test
572. hypercube_exactness, a Fortran90 code which tests the polynomial exactness of a quadrature rule over the interior of the unit hypercube in M dimensions.
573. hypercube_exactness_test
574. hypercube_grid, a Fortran90 code which computes a grid of points over the interior of a hypercube in M dimensions.
575. hypercube_grid_test
576. hypercube_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the interior of the unit hypercube in M dimensions.
577. hypercube_integrals_test
578. hypercube_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit hypercube in M dimensions.
579. hypercube_monte_carlo_test
580. hypergeometric, a Fortran90 code which evaluates the generalized hypergeometric functions pFq, for integer p and q, for complex arguments of large magnitude, by Warren Perger, Atul Bhalla, and Mark Nardin.
581. hypergeometric_test
582. hypersphere, a Fortran90 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.
583. hypersphere_test
584. hypersphere_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the surface of the unit hypersphere in M dimensions.
585. hypersphere_integrals_test
586. hypersphere_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate the integral of a function on the surface of the unit sphere in M dimensions;
587. hypersphere_monte_carlo_test
588. i4lib, a Fortran90 code which contains utilities which use single precision integer (I4) arithmetic.
589. i4lib_test
590. interp, a Fortran90 code which parameterizies and interpolates data;
591. interp_test
592. intlib, a Fortran90 code which carries out approximate integration (quadrature) in one dimension;
593. intlib_test
594. is_prime, a Fortran90 code which implements various versions of the sieve of Eratosthenes to determine whether a given integer is prime.
595. is_prime_test
596. ising_2d_simulation, a Fortran90 code which carries out a Monte Carlo simulation of an Ising model, a 2D array of positive and negative charges, each of which is likely to flip to be in agreement with neighbors, using gnuplot() to make images of the initial and final configurations.
597. ising_2d_simulation_test
598. ising_3d_simulation, a Fortran90 code which carries out a Monte Carlo simulation of an Ising model, a 3D array of positive and negative charges, each of which is likely to flip to be in agreement with neighbors.
599. ising_3d_simulation_test
600. jacobi, a Fortran90 code which implements the Jacobi method for the iterative solution of linear systems.
601. jacobi_test
602. jacobi_eigenvalue, a Fortran90 code which implements the Jacobi iteration for the determination of the eigenvalues and eigenvectors of a real symmetric matrix.
603. jacobi_eigenvalue_test
604. jacobi_exactness, a Fortran90 code which tests the monomial exactness of quadrature rules for integrals that include a Jacobi weight.
605. jacobi_exactness_test
606. jacobi_openmp, a Fortran90 code which uses OpenMP to parallelize a Jacobi iteration for solving A*x=b.
607. jacobi_openmp_test
608. jacobi_polynomial, a Fortran90 code which evaluates the Jacobi polynomial and associated functions.
609. jacobi_polynomial_test
610. jacobi_rule, a Fortran90 code which computes and print a Gauss-Jacobi quadrature rule.
611. jacobi_rule_test
612. kdv_exact, a Fortran90 code which evaluates exact solutions of the Korteweg-deVries (KdV) partial differential equation (PDE).
613. kdv_exact_test
614. kdv_ift, a FORTRAN90 code which uses the IFT method to solve the Korteweg-DeVries equation, by Aly-Khan Kassam, Lloyd Trefethen.
615. kdv_ift_test
616. ketel_one, a Fortran90 code which finds all words formed from the letters in "ketel one vodka";
617. ketel_one_test
618. kmeans, a Fortran90 code which handles the K-Means problem, which organizes N points in M dimensions into K clusters;
619. kmeans_test
620. knapsack_01_brute, a Fortran90 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;
621. knapsack_01_brute_test
622. knapsack_brute, a Fortran90 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.
623. knapsack_brute_test
624. knapsack_random, a Fortran90 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.
625. knapsack_random_test
626. knapsack_rational, a Fortran90 code which solves the rational knapsack problem, in which a knapsack of limited weight capacity is filled with profitable items. This variation of the 0/1 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 0/1 knapsack problem.
627. knapsack_rational_test
628. knapsack_values, a Fortran90 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.
629. knapsack_values_test
630. kronrod_rule, a Fortran90 code which computes a Gauss and Gauss-Kronrod pair of quadrature rules of arbitrary order, by Robert Piessens, Maria Branders.
631. kronrod_rule_test
632. l4lib, a Fortran90 code which contains functions for working with logical variables.
633. l4lib_test
634. lagrange_approx_1d, a Fortran90 code which evaluates the Lagrange polynomial p(x) of degree m which approximates n data points (x(i),y(i)).
635. lagrange_approx_1d_test
636. lagrange_interp_1d, a Fortran90 code which evaluates the Lagrange polynomial p(x) which interpolates data depending on a 1D argument, so that p(x(i)) = y(i).
637. lagrange_interp_1d_test
638. lagrange_interp_2d, a Fortran90 code which evaluates the Lagrange polynomial p(x,y) which interpolates data depending on a 2D argument that was evaluated on a product grid, so that p(x(i),y(j)) = z(i,j).
639. lagrange_interp_2d_test
640. lagrange_interp_nd, a Fortran90 code which evaluates the Lagrange polynomial p(x) which interpolates data depending on a multidimensional argument that was evaluated on a product grid, so that p(x(i)) = z(i).
641. lagrange_interp_nd_test
642. lagrange_nd, a Fortran90 code which implements several multivariate Lagrange interpolation schemes developed by Tomas Sauer.
643. lagrange_nd_test
644. laguerre_exactness, a Fortran90 code which tests the monomial exactness of Gauss-Laguerre quadrature rules for estimating the integral of a function f(x) with density rho(x)=exp(-x) over the interval [0,+oo).
645. laguerre_exactness_test
646. laguerre_integrands, a Fortran90 code which implements test problems for Gauss-Laguerre quadrature rules for estimating the integral of a function with density exp(-x) over the interval [0,+oo).
647. laguerre_integrands_test
648. laguerre_polynomial, a Fortran90 code which evaluates the Laguerre polynomial, the generalized Laguerre polynomials, and the Laguerre function.
649. laguerre_polynomial_test
650. laguerre_rule, a Fortran90 code which computes and print a Gauss-Laguerre quadrature rule for estimating the integral of a function with density exp(-x) over the interval [0,+oo).
651. laguerre_rule_test
652. lambert_w, a Fortran90 code which evaluates Lambert's W function.
653. lambert_w_test
654. lapack_test, a Fortran90 code which calls lapack(), which is 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.
655. lapack_d, a Fortran90 code which is the double precision real version of the lapack() linear algebra code.
656. lapack_d_test
657. laplacian_matrix, a Fortran90 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 data samples, solution of associated linear systems, eigenvalues and eigenvectors, and extension to 2D and 3D geometry.
658. laplacian_matrix_test
659. latin_center, a Fortran90 code which computes N points in an M dimensional Latin Center square;
660. latin_center_test
661. latin_cover, a Fortran90 code which produces N Latin squares which cover an NxN square, or NxN Latin cubes which cover an NxNxN cube.
662. latin_cover_test
663. latin_edge, a Fortran90 code which returns N points in an M dimensional Latin Edge square;
664. latin_edge_test
665. latin_random, a Fortran90 code which returns N points in an M dimensional Latin Random square;
666. latin_random_test
667. latinize, a Fortran90 code which adjusts N points in M dimensions to form a Latin hypercube;
668. latinize_test
669. lattice_rule, a Fortran90 code which approximates M-dimensional integrals using lattice rules.
670. lattice_rule_test
671. lau_np, a Fortran90 code which implements heuristic algorithms for various NP-hard combinatorial problems, including the integer linear programming problem, the K-center problem, the K-median problem, the 0-1 knapsack problem, the multiple knapsack problem, the graph matching problem, the graph partitioning problem, the minimal Steiner tree problem, and the traveling salesman problem;
672. lau_np_test
673. laupack, a Fortran90 code which computes properties of mathematical graphs, including Euler circuits, Hamiltonian circuits, cliques, strongly connected components, minimal spanning tree, chromatic number, shortest paths, maximal flow, and planarity.
674. laupack_test
675. lcvt, a Fortran90 code which computes a Latinized Centroidal Voronoi Tessellation (CVT).
676. lcvt_test
677. lebesgue, a Fortran90 code which is given 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, and which uses gnuplot() to make plots of the Lebesgue function.
678. lebesgue_test
679. legendre_exactness, a Fortran90 code which tests the monomial exactness of quadrature rules for estimating Legendre-type integrals of a function f(x) with density rho(x)=1 over the interval [-1,+1].
680. legendre_exactness_test
681. legendre_fast_rule, a Fortran90 code which uses a fast algorithm to compute a Gauss-Legendre quadrature rule for estimating the integral of a function with density rho(x)=1 over the interval [-1,+1].
682. legendre_fast_rule_test
683. legendre_polynomial, a Fortran90 code which evaluates the Legendre polynomial and associated functions.
684. legendre_polynomial_test
685. legendre_product_polynomial, a Fortran90 code which defines Legendre product polynomials, creating a multivariate polynomial as the product of univariate Legendre polynomials.
686. legendre_product_polynomial_test
687. legendre_rule, a Fortran90 code which computes Gauss-Legendre quadrature rules for estimating the integral of a function with density rho(x)=1 over the interval [-1,+1].
688. legendre_rule_test
689. legendre_shifted_polynomial, a Fortran90 code which evaluates the shifted Legendre polynomial, with domain [0,1].
690. legendre_shifted_polynomial_test
691. levenshtein_distance, a Fortran90 code which returns the Levenshtein distance between two strings.
692. levenshtein_distance_test
693. levenshtein_matrix, a Fortran90 code which returns the Levenshtein distance matrix defined by two strings.
694. levenshtein_matrix_test
695. line_cvt_lloyd, a Fortran90 code which applies the Lloyd iteration repeatedly to N points, to compute a Centroidal Voronoi Tessellation (CVT) over the interior of a line segment in 1D.
696. line_cvt_lloyd_test
697. line_fekete_rule, a Fortran90 code which estimates the location of N Fekete points, for polynomial interpolation or quadrature, over the interior of a line segment in 1D.
698. line_fekete_rule_test
699. line_felippa_rule, a Fortran90 code which returns a Felippa quadrature rule over the interior of a line segment in 1D.
700. line_felippa_rule_test
701. line_grid, a Fortran90 code which computes a grid of points over the interior of a line segment in 1D.
702. line_grid_test
703. line_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the length of the unit line in 1D.
704. line_integrals_test
705. line_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate the integral of a function over the length of the unit line in 1D.
706. line_monte_carlo_test
707. line_ncc_rule, a Fortran90 code which computes a Newton Cotes Closed (NCC) quadrature rule, using equally spaced points, over the interior of a line segment in 1D.
708. line_ncc_rule_test
709. line_nco_rule, a Fortran90 code which computes a Newton Cotes Open (NCO) quadrature rule, using equally spaced points, over the interior of a line segment in 1D.
710. line_nco_rule_test
711. linear_algebra, Fortran90 codes which carry out various linear algebra operations for matrices stored in a variety of formats.
712. linpack_bench, a Fortran90 code which carries out the LINPACK Benchmark.
713. linpack_bench_test
714. linpack_d, a Fortran90 code which factors and solves linear systems using double precision arithmetic, by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart. The matrix and vector data is assumed to be real.
715. linpack_d_test
716. linpack_z, a Fortran90 code which factors and solves linear systems using double precision arithmetic, by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart. The matrix and vector data is assumed to be complex.
717. linpack_z_test
718. llsq, a Fortran90 code which solves the simple linear least squares (LLS) problem of finding the formula of a straight line y=a*x+b which minimizes the root mean square error to N data points.
719. llsq_test
720. lobatto_polynomial, a Fortran90 code which evaluates Lobatto polynomials, similar to Legendre polynomials except that they are zero at both endpoints.
721. lobatto_polynomial_test
722. local_min, a Fortran90 code which finds a local minimum of a scalar function of a scalar variable, without the use of derivative information, by Richard Brent.
723. local_min_test
724. local_min_rc, a Fortran90 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.
725. local_min_rc_test
726. log_normal, a Fortran90 code which returns quantities related to the log normal Probability Distribution Function (PDF).
727. log_normal_test
728. log_normal_truncated_ab, a Fortran90 code which returns quantities related to the log normal Probability Distribution Function (PDF) truncated to the interval [A,B].
729. log_normal_truncated_ab_test
730. logistic_exact, a Fortran90 code which evaluates an exact solution of the logistic equation, an ordinary differential equation (ODE) which models population growth in the face of a limited carrying capacity.
731. logistic_exact_test
732. lorenz_ode, a Fortran90 code which approximates solutions to the Lorenz system of ordinary differential equations (ODE), creating output files that can be displayed by gnuplot().
733. lorenz_ode_test
734. machar, a Fortran90 code which dynamically computes the values of various machine characteristic constants by William Cody;
735. machar_test
736. machine, a Fortran90 code which returns tabulated values of the constants associated with computer arithmetic;
737. machine_test
738. mandelbrot, a Fortran90 code which generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot fractal set;
739. mandelbrot_test
740. mandelbrot_openmp, a Fortran90 code which generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot fractal set, using OpenMP for parallel execution.
741. mandelbrot_openmp_test
742. matman, a Fortran90 code which allows a user to interactively define and manipulate matrices using integer, real, or rational arithmetic, and to perform various operations in linear algebra or linear programming modes.
743. matman_test
744. matmul, a Fortran90 code which benchmarks matrix multiplication.
745. matmul_test
746. matrix_chain_brute, a Fortran90 code which finds the cost of the most efficient ordering to use when multiplying a sequence of matrices, using brute force.
747. matrix_chain_brute_test
748. matrix_chain_dynamic, a Fortran90 code which finds the cost of the most efficient ordering to use when multiplying a sequence of matrices, using dynamic programming.
749. matrix_chain_dynamic_test
750. matrix_exponential, a Fortran90 code which demonstrates some simple approaches to the problem of computing the exponential of a matrix;
751. matrix_exponential_test
752. maze, a Fortran90 code which carries out operations on a maze, including the diameter, a random example, or a path that solves the maze.
753. maze_test
754. md, a Fortran90 code which carries out a molecular dynamics simulation, intended as a starting point for implementing a parallel version.
755. md_test
756. md_openmp, a Fortran90 code which carries out a molecular dynamics simulation, using OpenMP for parallel execution.
757. md_openmp_test
758. medit_mesh_io, a Fortran90 code which reads or writes medit() MESH files defining a finite element mesh.
759. medit_mesh_io_test
760. medit_to_fem, a Fortran90 code which reads a medit() MESH file and rewrites the information as an FEM file.
761. medit_to_fem_test
762. mgmres, a Fortran90 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.
763. mgmres_test
764. mgs, a Fortran90 code which is an obscure legacy code, which the student is encouraged to study, understand, and document. This example is due to Diane O'Leary.
765. mgs_test
766. middle_square, a Fortran90 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.
767. middle_square_test
768. midpoint, a Fortran90 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.
769. midpoint_test
770. midpoint_adaptive, a Fortran90 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().
771. midpoint_adaptive_test
772. midpoint_explicit, a Fortran90 code which solves one or more ordinary differential equations (ODE) using the (explicit) midpoint method, also called the modified Euler method.
773. midpoint_explicit_test
774. midpoint_fixed, a Fortran90 code which solves one or more ordinary differential equations (ODE) using the (implicit) midpoint method, using a fixed point iteration for the nonlinear equation.
775. midpoint_fixed_test
776. minpack, a Fortran90 code which solves systems of nonlinear equations, or the least squares minimization of the residual of linear or nonlinear equations, by Jorge More, Danny Sorenson, Burton Garbow, Kenneth Hillstrom.
777. minpack_test
778. mm_io, a Fortran90 code which reads and writes sparse linear systems stored in the Matrix Market (MM) format.
779. mm_io_test
780. monomial, a Fortran90 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.
781. monomial_test
782. monomial_value, a Fortran90 code which evaluates a monomial in M dimensions.
783. monomial_value_test
784. multitask_mpi, a Fortran90 code which demonstrates how to multitask, that is, to execute several unrelated and distinct tasks simultaneously, using the message passing interface (MPI) for parallel execution.
785. multitask_mpi_test
786. multitask_openmp, a Fortran90 code which demonstrates how to multitask, that is, to execute several unrelated and distinct tasks simultaneously, using OpenMP for parallel execution.
787. multitask_openmp_test
788. mxm_openmp, a Fortran90 code which computes a dense matrix product C=A*B, using OpenMP for parallel execution.
789. mxm_openmp_test
790. naca, a Fortran90 code which takes the parameters of certain NACA airfoils and returns the coordinates of a sequence of points that outline the wing shape. The data is displayed with the gnuplot() graphics program.
791. naca_test
792. nas, a Fortran90 code which runs the NASA kernel benchmark.
793. nas_test
794. navier_stokes_2d_exact, a Fortran90 code which evaluates an exact solution to the incompressible time-dependent Navier-Stokes equations (NSE) over an arbitrary domain in 2D.
795. navier_stokes_2d_exact_test
796. navier_stokes_3d_exact, a Fortran90 code which evaluates an exact solution to the incompressible time-dependent Navier-Stokes equations (NSE) over an arbitrary domain in 3D.
797. navier_stokes_3d_exact_test
798. nearest_interp_1d, a Fortran90 code which interpolates data using a piecewise constant interpolant defined by the nearest neighbor criterion, creating graphics files for processing by gnuplot().
799. nearest_interp_1d_test
800. neighbors_to_metis_graph, a Fortran90 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();
801. neighbors_to_metis_graph_test
802. newton_interp_1d, a Fortran90 code which finds a polynomial interpolant to data using Newton divided differences.
803. newton_interp_1d_test
804. newton_rc, a Fortran90 code which solves a system of nonlinear equations by Newton's method, using reverse communication (RC).
805. newton_rc_test
806. niederreiter2, a Fortran90 code which computes elements of a Niederreiter Quasi Monte Carlo (QMC) sequence using base 2.
807. niederreiter2_test
808. nint_exactness_mixed, a Fortran90 code which measures the exactness of an M-dimensional quadrature rule based on a mixture of 1D quadrature rule factors.
809. nint_exactness_mixed_test
810. nintlib, a Fortran90 code which implements approximate integration or quadrature in M dimensions;
811. nintlib_test
812. nms, a Fortran90 code which includes a wide variety of numerical software, including solvers for linear systems of equations, interpolation of data, numerical quadrature, linear least squares (LLS) data fitting, the solution of nonlinear equations, ordinary differential equations (ODE), optimization and nonlinear least squares (NLS), simulation and random numbers, trigonometric approximation and Fast Fourier Transforms (FFT).
813. nms_test
814. normal, a Fortran90 code which implements a random number generator (RNG) for normally distributed values;
815. normal_test
816. normal_dataset, a Fortran90 code which creates a multivariate normal random dataset and writes it to a file.
817. normal_dataset_test
818. obj_io, a Fortran90 code which reads and writes the 3D graphics information in an Alias OBJ file;
819. obj_io_test
820. ode, a Fortran90 code which solves a system of ordinary differential equations (ODE), by Shampine and Gordon;
821. ode_test
822. openmp_test, a Fortran90 code which uses OpenMP, which is an application program interface for carrying out parallel computations in a shared memory environment.
823. optimize_test, a Fortran90 code which looks at the use of automatic optimization by the compiler to make the executable code run faster.
824. ornstein_uhlenbeck, a Fortran90 code which approximates solutions of the Ornstein-Uhlenbeck stochastic ordinary differential equation (SDE) using the Euler method and the Euler-Maruyama method, and creating graphics files for processing by gnuplot().
825. ornstein_uhlenbeck_test
826. owen, a Fortran90 code which evaluates the Owen T function.
827. owen_test
828. padua, a Fortran90 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.
829. padua_test
830. partition_brute, a Fortran90 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.
831. partition_brute_test
832. patterson_rule, a Fortran90 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.
833. patterson_rule_test
834. pbma_io, a Fortran90 code which reads or writes graphics files that use the ASCII Portable Bit Map (PBM) format.
835. pbma_io_test
836. pce_burgers, a Fortran90 code which solves a version of the time-dependent viscous Burgers equation, with uncertain viscosity, using a polynomial chaos expansion in terms of Hermite polynomials, by Gianluca Iaccarino.
837. pce_burgers_test
838. pce_ode_hermite, a Fortran90 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.
839. pce_ode_hermite_test
840. pdb_to_xyz, a Fortran90 code which reads a Protein Data Bank (PDB) file, and, for each ATOM record in the file, extracts the atomic spatial coordinates and writes them to an XYZ file.
841. pdb_to_xyz_test
842. pdflib, a Fortran90 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.
843. pdflib_test
844. pentominoes, a Fortran90 code which forms or plots any of the 12 members of the pentomino family, shapes formed from 5 adjacent squares.
845. pentominoes_test
846. persistence, a Fortran90 code which demonstrates how to initialize, get, or set data stored within a function, using static/persistent/saved/local memory.
847. persistence_test
848. pgma_io, a Fortran90 code which reads or writes graphics files that use the ASCII Portable Gray Map (PGM) format.
849. pgma_io_test
850. pink_noise, a Fortran90 code which computes a pink noise signal obeying a 1/f power law.
851. pink_noise_test
852. plot_points, a Fortran90 code which makes an Encapsulated PostScript (EPS) plot of points in 2D.
853. plot_points_test
854. plot_to_ps, a Fortran90 code which reads simple text commands and creates a PostScript (PS) image;
855. plot_to_ps_test
856. poisson_1d, a Fortran 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.
857. poisson_1d_test
858. poisson_1d_multigrid, a Fortran90 code which applies the multigrid method to a discretized version of the 1D Poisson equation.
859. poisson_1d_multigrid_test
860. poisson_2d, a Fortran90 code which solves the Poisson equation in a rectangle, using finite differences and Jacobi iteration.
861. poisson_2d_test
862. poisson_openmp, a Fortran90 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.
863. poisson_openmp_test
864. poisson_simulation, a Fortran90 code which simulates a Poisson process in which events randomly occur with an average waiting time of Lambda, creating output for graphics by gnuplot().
865. poisson_simulation_test
866. polpak, a Fortran90 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.
867. polpak_test
868. polygon, a Fortran90 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.
869. polygon_test
870. polygon_grid, a Fortran90 code which generates a grid of points over the interior of a polygon in 2D.
871. polygon_grid_test
872. polygon_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the interior of a polygon in 2D.
873. polygon_integrals_test
874. polygon_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate the integral of a function over the interior of a polygon in 2D.
875. polygon_monte_carlo_test
876. polygon_triangulate, a Fortran90 code which triangulates a possibly nonconvex polygon in 2D, and which uses gnuplot() to display the external edges and internal diagonals of the triangulation.
877. polygon_triangulate_test
878. polynomial, a Fortran90 code which adds, multiplies, differentiates, evaluates and prints multivariate polynomials in a space of M dimensions.
879. polynomial_test
880. polynomial_conversion, a Fortran90 code which converts representations of a polynomial between monomial, Bernstein, Chebyshev, Gegenbauer, Hermite, Laguerre and Legendre forms.
881. polynomial_conversion_test
882. polynomial_root_bound, a Fortran90 code which computes the Cauchy bound on the magnitude of all roots of a polynomial with complex coefficients.
883. polynomial_root_bound_test
884. polynomials, a Fortran90 code which defines multivariate polynomials over rectangular domains, for which certain information is to be determined, such as the maximum and minimum values.
885. polynomials_test
886. polyominoes, a Fortran90 code which manipulates polyominoes and tilings.
887. polyominoes_test
888. porous_medium_exact, a Fortran90 code which returns an exact solution of the porous medium equation (PME), dudt=Del^2(u^m), a partial differential equation (PDE) related to the diffusion equation, based on the Barenblatt solution.
889. porous_medium_exact_test
890. power_method, a Fortran90 code which carries out the power method for finding a dominant eigenvalue and its eigenvector.
891. power_method_test
892. power_rule, a Fortran90 code which constructs a power rule, that is, a product quadrature rule from identical 1D factor rules.
893. power_rule_test
894. ppma_io, a Fortran90 code which reads or writes graphics files that use the ASCII Portable Pixel Map (PPM) format.
895. ppma_io_test
896. pppack, a Fortran90 code which computes piecewise polynomial functions, including cubic splines, by Carl deBoor.
897. pppack_test
898. praxis, a Fortran90 code which minimizes a scalar function of several variables, without requiring derivative information, by Richard Brent.
899. praxis_test
900. predator_prey_ode, a Fortran90 code which solves a time-dependent predator-prey system of ordinary differential equations (ODE).
901. predator_prey_ode_test
902. prime, a Fortran90 code which counts the number of primes between 1 and N, and is intended as a starting point for a parallel version.
903. prime_test
904. prime_mpi, a Fortran90 code which counts primes between 1 and N, using Message Passing Interface (MPI) for parallel execution.
905. prime_mpi_test
906. prime_openmp, a Fortran90 code which counts primes between 1 and N, using OpenMP for parallel execution.
907. prime_openmp_test
908. prime_pi, a Fortran90 code which evaluates Pi(n), the number of primes less than or equal to an integer n.
909. prime_pi_test
910. prism_jaskowiec_rule, a Fortran90 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.
911. prism_jaskowiec_rule_test
912. prism_witherden_rule, a Fortran90 code which returns a symmetric Witherden quadrature rule for a prism with triangular base, with exactness up to total degree 10.
913. prism_witherden_rule_test
914. prob, a Fortran90 code which evaluates, samples, inverts, and characterizes 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.
915. prob_test
916. product_rule, a Fortran90 code which constructs a product quadrature rule from distinct 1D factor rules.
917. product_rule_test
918. ps_gg_align, a Fortran90 code which implements global string alignment algorithms which work in linear space, and compute both the optimal score and the optimal alignment. Gaps in the alignment are assigned an affine gap penalty. The algorithms are due to Chao.
919. ps_gg_align_test
920. ps_lg_align, a Fortran90 code which implements local string alignment algorithms which work in linear space, and compute both the optimal score and the optimal alignment. Gaps in the alignment are assigned an affine gap penalty. The algorithms are due to Chao.
921. ps_lg_align_test
922. ps_qg_align, a Fortran90 code which implements quasi-global string alignment algorithms which work in linear space, and compute both the optimal score and the optimal alignment. Gaps in the alignment are assigned an affine gap penalty. The algorithms are due to Chao.
923. ps_qg_align_test
924. ps_write, a Fortran90 code which creates PostScript (PS) graphics files.
925. ps_write_test
926. puzzles, a Fortran90 code which was used to solve various puzzles.
927. pwl_approx_1d, a Fortran90 code which approximates data using a piecewise linear function.
928. pwl_approx_1d_test
929. pwl_interp_1d, a Fortran90 code which interpolates data using a piecewise linear function.
930. pwl_interp_1d_test
931. pwl_interp_2d, a Fortran90 code which evaluates a piecewise linear interpolant to data defined on a regular 2D grid.
932. pwl_interp_2d_test
933. pwl_interp_2d_scattered, a Fortran90 code which evaluates a piecewise linear interpolant to data which is available at an irregularly arranged set of points.
934. pwl_interp_2d_scattered_test
935. pwl_product_integral, a Fortran90 code which calculates the exact value of the integral of the product of two piecewise linear functions f(x) and g(x).
936. pwl_product_integral_test
937. pyramid_exactness, a Fortran90 code which computes the monomial exactness of a quadrature rule over the interior of a pyramid in 3D.
938. pyramid_exactness_test
939. pyramid_felippa_rule, a Fortran90 code which returns a Felippa quadrature rule for approximating integrals over the interior of a pyramid in 3D.
940. pyramid_felippa_rule_test
941. pyramid_grid, a Fortran90 code which computes a grid of points over the interior of the unit pyramid in 3D;
942. pyramid_grid_test
943. pyramid_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the interior of the unit pyramid in 3D.
944. pyramid_integrals_test
945. pyramid_jaskowiec_rule, a Fortran90 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.
946. pyramid_jaskowiec_rule_test
947. pyramid_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit pyramid in 3D;
948. pyramid_monte_carlo_test
949. pyramid_rule, a Fortran90 code which computes a conical product quadrature rule over the interior of the unit pyramid in 3D;
950. pyramid_rule_test
951. pyramid_witherden_rule, a Fortran90 code which returns a Witherden quadrature rule, with exactness up to total degree 10, over the interior of a pyramid.
952. pyramid_witherden_rule_test
953. qr_solve, a Fortran90 code which computes the linear least squares (LLS) solution of a system A*x=b.
954. qr_solve_test
955. quad_mpi, a Fortran90 code which approximates an integral using a quadrature rule, and carries out the computation in parallel using the Message Passing Interface (MPI).
956. quad_mpi_test
957. quad_openmp, a Fortran90 code which applies a quadrature rule to estimate an integral over a 1D interval, using OpenMP for parallel execution.
958. quad_openmp_test
959. quad_rule, a Fortran90 code which implements rules for approximate integration (quadrature) in one dimension;
960. quad_rule_test
961. quad_serial, a Fortran90 code which approximates an integral using a quadrature rule, and is intended as a starting point for parallelization exercises.
962. quad_serial_test
963. quad2d, a Fortran90 code which estimates an integral over a 2D rectangle using quadrature, intended as the starting point for program optimization or parallelization.
964. quad2d_test
965. quadmom, a Fortran90 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).
966. quadmom_test
967. quadpack, a Fortran90 code which estimates integrals using numerical quadrature, by Piessens, deDoncker-Kapenga, Ueberhuber, and Kahaner.
968. quadpack_test
969. quadrature_golub_welsch, a Fortran90 code which computes the points and weights of a Gaussian quadrature rule using the Golub-Welsch procedure, assuming that the points have been specified.
970. quadrature_golub_welsch_test
971. quadrature_least_squares, a Fortran90 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.
972. quadrature_least_squares_test
973. quadrature_weights_vandermonde, a Fortran90 code which computes the weights of a quadrature rule using the Vandermonde matrix, assuming that the points have been specified.
974. quadrature_weights_vandermonde_test
975. quadrature_weights_vandermonde_2d, a Fortran90 code which computes the weights of a 2D quadrature rule using the Vandermonde matrix, assuming that the points have been specified.
976. quadrature_weights_vandermonde_2d_test
977. quadrilateral_mesh, a Fortran90 code which handles meshes of quadrilaterals over a 2D region;
978. quadrilateral_mesh_test
979. quadrilateral_mesh_rcm, a Fortran90 code which computes the Reverse Cuthill McKee (RCM) reordering for nodes in a mesh of 4-node quadrilaterals.
980. quadrilateral_mesh_rcm_test
981. quadrilateral_witherden_rule, a Fortran90 code which returns a symmetric Witherden quadrature rule for the quadrilateral, with exactness up to total degree 21.
982. quadrilateral_witherden_rule_test
983. quality, a Fortran90 code which computes quality of distribution measures for pointsets in M dimensions;
984. quality_test
985. quaternions, a Fortran90 code which carries out some simple arithmetic operations for quaternions.
986. quaternions_test
987. quotes, a Fortran90 code which prints a random quote from a file;
988. quotes_test
989. r83, a Fortran90 code which contains linear algebra routines for r83 matrices (real, 64 bit, tridiagonal 3xN format).
990. r83_test
991. r83_np, a Fortran90 code which contains linear algebra routines for r83_np matrices (real, 64 bit, tridiagonal 3xN format, nonpivoting factorization).
992. r83_np_test
993. r83p, a Fortran90 code which contains linear algebra routines for r83p matrices (real, 64 bit, tridiagonal periodic format).
994. r83p_test
995. r83s, a Fortran90 code which contains linear algebra routines for r83s matrices (real, 64 bit, tridiagonal scalar format).
996. r83s_test
997. r83t, a Fortran90 code which contains linear algebra routines for r83t matrices (real, 64 bit, tridiagonal Mx3 format).
998. r83t_test
999. r83v, a Fortran90 code which contains linear algebra routines for r83v matrices (real, 64 bit, tridiagonal three vector format).
1000. r83v_test
1001. r85, a Fortran90 code which contains linear algebra routines for r85 matrices (real, 64 bit, pentadiagonal format).
1002. r85_test
1003. r8bb, a Fortran90 code which contains linear algebra routines for r8bb matrices (real, 64 bit, border banded format).
1004. r8bb_test
1005. r8blt, a Fortran90 code which contains linear algebra routines for r8blt matrices (real, 64 bit, band lower triangular format).
1006. r8blt_test
1007. r8bto, a Fortran90 code which contains linear algebra routines for r8bto matrices (real, 64 bit, block Toeplitz format).
1008. r8bto_test
1009. r8but, a Fortran90 code which contains linear algebra routines for r8but matrices (real, 64 bit, band upper triangular format).
1010. r8but_test
1011. r8cb, a Fortran90 code which contains linear algebra routines for r8cb matrices (real, 64 bit, Compressed Band format).
1012. r8cb_test
1013. r8cbb, a Fortran90 code which contains linear algebra routines for r8cbb matrices (real, 64 bit, Compressed Border Banded format).
1014. r8cbb_test
1015. r8ccs, a Fortran90 code which contains linear algebra routines for r8ccs matrices (real, 64 bit, Compressed Column Storage (Colptr,Row,Value) format).
1016. r8ccs_test
1017. r8ci, a Fortran90 code which contains linear algebra routines for r8ci matrices (real, 64 bit, circulant format).
1018. r8ci_test
1019. r8col, a Fortran90 code which contains utility routines for an R8COL, that is, a double precision real MxN array, considered as N column vectors, each of length M. The data may be thought of as a matrix of multiple columns, and many operations will be carried out columnwise.
1020. r8col_test
1021. r8gb, a Fortran90 code which contains linear algebra routines for r8gb matrices (real, 64 bit, General Banded format).
1022. r8gb_test
1023. r8gd, a Fortran90 code which contains linear algebra routines for r8gd matrices (real, 64 bit, general diagonal format).
1024. r8gd_test
1025. r8ge, a Fortran90 code which contains linear algebra routines for R8GE matrices (real, 64 bit, General format).
1026. r8ge_test
1027. r8lib, a Fortran90 code which contains many utility routines, using double precision real (R8) arithmetic.
1028. r8lib_test
1029. r8lt, a Fortran90 code which contains linear algebra routines for R8LT matrices (real, 64 bit, Lower Triangular).
1030. r8lt_test
1031. r8ltt, a Fortran90 code which contains linear algebra routines for r8ltt matrices (real, 64 bit, lower triangular Toeplitz format).
1032. r8ltt_test
1033. r8ncf, a Fortran90 code which contains linear algebra routines for r8ncf matrices (real, 64 bit, nonsymmetric coordinate format).
1034. r8ncf_test
1035. r8pbl, a Fortran90 code which contains linear algebra routines for r8pbl matrices (real, 64 bit, symmetric positive definite (SPD) band lower format).
1036. r8pbl_test
1037. r8pbu, a Fortran90 code which contains linear algebra routines for r8pbu matrices (real, 64 bit, symmetric positive definite (SPD) band upper format).
1038. r8pbu_test
1039. r8po, a Fortran90 code which contains linear algebra routines for r8po matrices (real, 64 bit, symmetric positive definite (SPD) format).
1040. r8po_test
1041. r8poly, a Fortran90 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.
1042. r8poly_test
1043. r8pp, a Fortran90 code which contains linear algebra routines for r8pp matrices (real, 64 bit, symmetric positive definite (SPD) packed format).
1044. r8pp_test
1045. r8ri, a Fortran90 code which contains linear algebra routines for r8ri matrices (real, 64 bit, row indexed format).
1046. r8ri_test
1047. r8row, a Fortran90 code which contains utilities for an R8ROW, that is, a double precision real MxN array, considered as M row vectors, each of length N. The data may be thought of as a matrix of multiple rows, and many operations will be carried out rowwise.
1048. r8row_test
1049. r8sd, a Fortran90 code which contains linear algebra routines for r8sd matrices (real, 64 bit, symmetric diagonal format).
1050. r8sd_test
1051. r8sm, a Fortran90 code which contains linear algebra routines for r8sm matrices (real, 64 bit, Sherman-Morrison A-u*v' format).
1052. r8sm_test
1053. r8sr, a Fortran90 code which carries out linear algebra operations for r8sr matrices (real, 64 bit, diagonal + compressed row offdiagonal format).
1054. r8sr_test
1055. r8ss, a Fortran90 code which carries out linear algebra operations for r8ss matrices (real, 64 bit, symmetric skyline format).
1056. r8ss_test
1057. r8st, a Fortran90 code which contains linear algebra routines for R8ST matrices (real, 64 bit, Sparse Triplet).
1058. r8st_test
1059. r8sto, a Fortran90 code which contains linear algebra routines for r8sto matrices (real, 64 bit, symmetric Toeplitz N format).
1060. r8sto_test
1061. r8to, a Fortran90 code which contains linear algebra routines for r8to matrices (real, 64 bit, Toeplitz 2*N-1 format).
1062. r8to_test
1063. r8ut, a Fortran90 code which contains linear algebra routines for r8ut matrices (real, 64 bit, Upper Triangular).
1064. r8ut_test
1065. r8utp, a Fortran90 code which carries out linear algebra operations on r8utp matrices, real 64 bit, Upper Triangular Packed format.
1066. r8utp_test
1067. r8utt, a Fortran90 code which contains linear algebra routines for r8utt matrices (real, 64 bit, upper triangular Toeplitz format).
1068. r8utt_test
1069. r8vm, a Fortran90 code which contains linear algebra routines for r8vm matrices (real, 64 bit, Vandermonde format).
1070. r8vm_test
1071. randlc, a Fortran90 code which implements a random number generator (RNG) used by the nas() benchmarks.
1072. randlc_test
1073. random_data, a Fortran90 code which uses a random number generator (RNG) to sample points distributed according to various probability density functions (PDF), spatial dimensions, and geometries, including the M-dimensional cube, ellipsoid, simplex and sphere.
1074. random_data_test
1075. random_mpi, a Fortran90 code which generates the same sequence of values from a random number generator (RNG) for both sequential execution and parallel execution under the Message Passing Interface (MPI).
1076. random_mpi_test
1077. random_openmp, a Fortran90 code which generates multiple distinct streams of random numbers using OpenMP for parallel execution.
1078. random_openmp_test
1079. random_sorted, a Fortran90 code which uses a random number generator (RNG) to create a vector of random values which are already sorted.
1080. random_sorted_test
1081. ranlib, a Fortran90 code which is a library of random number generators 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.
1082. ranlib_test
1083. ranmap, a Fortran90 code which creates PostScript (PS) images of iterated affine mappings, including the Barnsley fractal fern and the Levy dragon.
1084. ranmap_test
1085. rbf_interp_1d, a Fortran90 code which defines and evaluates radial basis function (RBF) interpolants to 1D data.
1086. rbf_interp_1d_test
1087. rbf_interp_2d, a Fortran90 code which defines and evaluates radial basis function (RBF) interpolants to 2D data.
1088. rbf_interp_2d_test
1089. rbf_interp_nd, a Fortran90 code which defines and evaluates radial basis function (RBF) interpolants to multidimensional data.
1090. rbf_interp_nd_test
1091. rcm, a Fortran90 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;
1092. rcm_test
1093. reactor_simulation, a Fortran90 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 was provided as an example with the book 'Numerical Methods and Software'.
1094. reactor_simulation_test
1095. reformat, a Fortran90 code which makes a copy of a file with a given number of words per line.
1096. reformat_test
1097. region, a Fortran90 code which reads 3D magnetic resonance imaging (MRI) voxel data, and groups the voxels into connected regions, called components or segments;
1098. region_test
1099. ring_mpi, a Fortran90 code which uses the Message Passing Interface (MPI), and measures the time necessary to copy data around a ring of processes.
1100. ring_mpi_test
1101. rk1, a Fortran90 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.
1102. rk1_test
1103. rk1_implicit, a Fortran90 code which solves one or more ordinary differential equations (ODE) using the Runge-Kutta order 1 implicit method, using fsolve() to solve the implicit equation, and using a fixed time step. rk1_implicit() is commonly called the backward Euler method.
1104. rk1_implicit_test
1105. rk2, a Fortran90 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.
1106. rk2_test
1107. rk2_implicit, a Fortran90 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.
1108. rk2_implicit_test
1109. rk4, a Fortran90 code which applies the fourth order Runge-Kutta (RK) algorithm to estimate the solution of an ordinary differential equation (ODE).
1110. rk4_test
1111. rkf45, a Fortran90 code which applies a Runge-Kutta-Fehlberg (RKF) solver to a system of ordinary differential equations (ODE);
1112. rkf45_test
1113. rnglib, a Fortran90 code which implements a random number generator (RNG) with splitting facilities, allowing multiple independent streams to be computed, by L'Ecuyer and Cote.
1114. rnglib_test
1115. root_rc, a Fortran90 code which seeks a solution of a scalar nonlinear equation f(x) = 0, or a system of nonlinear equations, using reverse communication (RC), by Gaston Gonnet.
1116. root_rc_test
1117. roots_rc, a Fortran90 code which seeks a solution of a system of nonlinear equations f(x) = 0, using reverse communication (RC), by Gaston Gonnet.
1118. roots_rc_test
1119. row_echelon_integer, a Fortran90 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.
1120. row_echelon_integer_test
1121. rref2, a Fortran90 code which computes the reduced row echelon form (RREF) of a matrix, which can be used to analyze matrices which are square or rectangular, singular or invertible.
1122. rref2_test
1123. sandia_cubature, a Fortran90 code which computes M-dimensional quadrature rules for certain regions and weight functions.
1124. sandia_cubature_test
1125. sandia_cvt, a Fortran90 code which positions a given number of points in an arbitrary region, using probabilistic Centroidal Voronoi Tessellation (CVT) techniques to achieve good coverage and separation; developed for Sandia National Laboratory;
1126. sandia_cvt_test
1127. sandia_rules, a Fortran90 code which produces 1D quadrature rules of Chebyshev, Clenshaw Curtis, Fejer 2, Gegenbauer, generalized Hermite, generalized Laguerre, Hermite, Jacobi, Laguerre, legendre and Patterson types.
1128. sandia_rules_test
1129. sandia_sgmgg, a Fortran90 code which explores a generalized construction method for sparse grids.
1130. sandia_sgmgg_test
1131. sandia_sparse, a Fortran90 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.
1132. sandia_sparse_test
1133. satisfy_brute, a Fortran90 code which uses brute force to find all assignments of values to a set of logical variables which make a complicated logical statement true.
1134. satisfy_brute_test
1135. satisfy_mpi, a Fortran90 code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem, using the Message Passing Interface (MPI) to work in parallel.
1136. satisfy_mpi_test
1137. satisfy_openmp, a Fortran90 code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem, using OpenMP for parallel execution.
1138. satisfy_openmp_test
1139. schedule_openmp, a Fortran90 code which demonstrates the default, static, and dynamic methods of scheduling loop iterations in OpenMP to avoid work imbalance.
1140. schedule_openmp_test
1141. sde, a Fortran90 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;
1142. sde_test
1143. search_mpi, a Fortran90 code which searches integers between A and B for a value J such that F(J) = C, using MPI for parallel execution.
1144. search_mpi_test
1145. set_theory, a Fortran90 code which demonstrates various set theoretic operations using several models of a set.
1146. set_theory_test
1147. sftpack, a Fortran90 code which implements the slow Fourier transform, intended as a teaching tool and comparison with the Fast Fourier Transform (FFT).
1148. sftpack_test
1149. sgmga, a Fortran90 code which creates sparse grids based on a mixture of 1D quadrature rules, allowing anisotropic weights for each dimension.
1150. sgmga_test
1151. shallow_water_1d, a Fortran90 code which simulates the evolution of a 1D fluid governed by the time-dependent shallow water equations.
1152. shallow_water_1d_test
1153. shepard_interp_1d, a Fortran90 code which defines and evaluates Shepard interpolants to 1D data, based on inverse distance weighting.
1154. shepard_interp_1d_test
1155. shepard_interp_2d, a Fortran90 code which defines and evaluates Shepard interpolants to 2D data, based on inverse distance weighting.
1156. shepard_interp_2d_test
1157. shepard_interp_nd, a Fortran90 code which defines and evaluates Shepard interpolants to multidimensional data, based on inverse distance weighting.
1158. shepard_interp_nd_test
1159. sigmoid_derivative, a Fortran90 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().
1160. sigmoid_derivative_test
1161. simplex_coordinates, a Fortran90 code which computes the Cartesian coordinates of the vertices of a regular simplex in M dimensions.
1162. simplex_coordinates_test
1163. simplex_gm_rule, a Fortran90 code which defines Grundmann-Moeller quadrature rules over the interior of a triangle in 2D, a tetrahedron in 3D, or a simplex in M dimensions.
1164. simplex_gm_rule_test
1165. simplex_grid, a Fortran90 code which generates a regular grid of points over the interior of an arbitrary simplex in M dimensions.
1166. simplex_grid_test
1167. simplex_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the interior of the unit simplex in M dimensions.
1168. simplex_integrals_test
1169. simplex_monte_carlo, a Fortran90 code which uses the Monte Carlo method to estimate an integral over the interior of the unit simplex in M dimensions.
1170. simplex_monte_carlo_test
1171. sine_gordon_exact, a Fortran90 code which returns an exact solution of the Sine-Gordon equation, a partial differential equation (PDE) of the form uxy=sin(u).
1172. sine_gordon_exact_test
1173. sine_transform, a Fortran90 code which demonstrates some simple properties of the discrete sine transform (DST).
1174. sine_transform_test
1175. slap, a Fortran90 code which forms the Sparse Linear Algebra Package (SLAP), for the iterative solution of sparse linear systems, by Anne Greenbaum and Mark Seager.
1176. slap_test
1177. slap_io, a Fortran90 code which reads and writes sparse matrix files in the SLAP format;
1178. slap_io_test
1179. slatec, a FORTRAN90 code which collects standard numerical libraries, including blas(), bvsup(), dassl(), depac(), drive(), eispack(), fftpack(), fishpack(), fnlib(), linpack(), machine(), minpack(), mp(), pchip(), pppack(), quadpack(), slap(), sos(), splp(), and xerror().
1180. slatec_test
1181. snakes_and_ladders, a Fortran90 code which provides tools for the study of the game of Snakes and Ladders.
1182. snakes_and_ladders_test
1183. sncndn, a Fortran90 code which evaluates the Jacobi elliptic functions sn(u,m), cn(u,m), and dn(u,m).
1184. sncndn_test
1185. sobol, a Fortran90 code which computes elements of a Sobol Quasi Monte Carlo (QMC) sequence, by Bennett Fox.
1186. sobol_test
1187. solve, a Fortran90 code which demonstrates how Gauss elimination can be used to solve a linear system A*x=b.
1188. solve_test
1189. sort_rc, a Fortran90 code which sorts a list of any kind of objects, using reverse communication (RC).
1190. sort_rc_test
1191. spaeth, a Fortran90 code which analyzes data by grouping it into clusters.
1192. spaeth_test
1193. spaeth2, a Fortran90 code which analyzes data by grouping it into clusters.
1194. spaeth2_test
1195. sparse_count, a Fortran90 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.
1196. sparse_count_test
1197. sparse_display, a Fortran90 code which reads information defining a matrix of numbers and display the sparsity pattern or location of the nonzero elements using gnuplot(). This operation is similar to the MATLAB spy() command.
1198. sparse_display_test
1199. sparse_grid_cc, a Fortran90 code which creates sparse grids based on Clenshaw-Curtis rules.
1200. sparse_grid_cc_test
1201. sparse_grid_gl, a Fortran90 code which creates sparse grids based on Gauss-legendre rules.
1202. sparse_grid_gl_test
1203. sparse_grid_hermite, a Fortran90 code which creates sparse grids based on Gauss-Hermite rules.
1204. sparse_grid_hermite_test
1205. sparse_grid_hw, a Fortran90 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.
1206. sparse_grid_hw_test
1207. sparse_grid_laguerre, a Fortran90 code which creates sparse grids based on Gauss-Laguerre rules.
1208. sparse_grid_laguerre_test
1209. sparse_grid_mixed, a Fortran90 code which creates a sparse grid dataset based on a mixed set of 1D factor rules.
1210. sparse_grid_mixed_test
1211. sparse_interp_nd, a Fortran90 code which defines a sparse interpolant to a function f(x) of a multidimensional argument.
1212. sparse_interp_nd_test
1213. sparsekit, a Fortran90 code which implements operations on sparse matrices, including conversion between various formats, by Yousef Saad.
1214. sparsekit_test
1215. specfun, a Fortran90 code which computes special functions, including Bessel I, J, K and Y functions, and the Dawson, E1, EI, Erf, Gamma, log Gamma, Psi/Digamma functions, by William Cody and Laura Stoltz;
1216. specfun_test
1217. special_functions, a Fortran90 code which evaluates special functions, including Airy, Associated Legendre, Bernoulli Numbers, Bessel, Beta, Complete Elliptic Integral, Cosine Integral, Elliptic Integral, Error, Euler Numbers, Exponential Integral, Fresnel Integral, Gamma, Hankel, Hermite polynomials, Hypergeometric 2F1, Incomplete Beta, Incomplete Gamma, Jacobian Elliptic, Kelvin, Kummer Confluent Hypergeometric, Laguerre polynomials, Lambda, Legendre functions, Legendre polynomials, Mathieu, Modified Spherical Bessel, Parabolic Cylinder, Psi, Riccati-Bessel, Sine Integral, Spheroidal Angular, Spheroidal Wave, Struve, Tricomi Confluent Hypergeometric, Whittaker, by Shanjie Zhang, Jianming Jin;
1218. special_functions_test
1219. sphere_cubed_grid, a Fortran90 code which uses the projection of a cube to create grids of points, lines, and quadrilaterals on the surface of the unit sphere in 3D.
1220. sphere_cubed_grid_test
1221. sphere_cvt, a Fortran90 code which uses a Centroidal Voronoi Tessellation (CVT) to generate a mesh of well-separated points on the surface of the unit sphere in 3D.
1222. sphere_cvt_test
1223. sphere_delaunay, a Fortran90 code which reads a file containing the coordinates of points on the surface of the unit sphere in 3D, computes the Delaunay triangulation, and outputs a PostScript (PS) file of the image;
1224. sphere_delaunay_test
1225. sphere_design_rule, a Fortran90 code which returns point sets on the surface of the unit sphere in 3D, known as designs, which estimate integrals.
1226. sphere_design_rule_test
1227. sphere_exactness, a Fortran90 code which tests the monomial exactness of a quadrature rule over the surface of the unit sphere in 3D.
1228. sphere_exactness_test
1229. sphere_fibonacci_grid, a Fortran90 code which uses a Fibonacci spiral to create a grid of points on the surface of the unit sphere in 3D.
1230. sphere_fibonacci_grid_test
1231. sphere_grid, a Fortran90 code which generates grids of points, or of points and lines, or of points and lines and faces, on the surface of the unit sphere in 3D.
1232. sphere_grid_test
1233. sphere_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the surface of the unit sphere in 3D.
1234. sphere_integrals_test
1235. sphere_lebedev_rule, a Fortran90 code which computes Lebedev quadrature rules on the surface of the unit sphere in 3D.
1236. sphere_lebedev_rule_test
1237. sphere_llq_grid, a Fortran90 code which uses longitudes and latitudes to create grids of points, lines, and quadrilaterals on the surface of the unit sphere in 3D.
1238. sphere_llq_grid_test
1239. sphere_llt_grid, a Fortran90 code which uses longitudes and latitudes to create grids of points, lines, and triangles on the surface of the unit sphere in 3D.
1240. sphere_llt_grid_test
1241. sphere_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate the integral of a function on the surface of the unit sphere in 3D;
1242. sphere_monte_carlo_test
1243. sphere_quad, a Fortran90 code which uses triangulation to approximate an integral on the surface of the unit sphere in 3D;
1244. sphere_quad_test
1245. sphere_stereograph, a Fortran90 code which computes the stereographic mapping between points on the surface of the unit sphere in 3D and points on the plane Z = 1; a generalized mapping is also available.
1246. sphere_stereograph_test
1247. sphere_triangle_monte_carlo, a Fortran90 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;
1248. sphere_triangle_monte_carlo_test
1249. sphere_triangle_quad, a Fortran90 code which uses quadrature to estimate the integral of a function over a spherical triangle on the surface of the unit sphere in 3D.
1250. sphere_triangle_quad_test
1251. sphere_voronoi, a Fortran90 code which reads a file containing the coordinates of points on the surface of the unit sphere in 3D, computes the Voronoi diagram, and outputs a PostScript (PS) file of the image;
1252. sphere_voronoi_test
1253. spiral_exact, a Fortran90 code which computes a 2D velocity vector field that is an exact solution of the continuity equation.
1254. spiral_exact_test
1255. spline, a Fortran90 code which interpolates and approximates via splines;
1256. spline_test
1257. square_arbq_rule, a Fortran90 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.
1258. square_arbq_rule_test
1259. square_exactness, a Fortran90 code which computes the polynomial exactness of quadrature rules for f(x,y) over the interior of a quadrilateral in 2D.
1260. square_exactness_test
1261. square_felippa_rule, a Fortran90 code which returns a Felippa quadrature rule over the interior of a square in 2D.
1262. square_felippa_rule_test
1263. square_grid, a Fortran90 code which computes a grid of points over the interior of a square in 2D.
1264. square_grid_test
1265. square_hex_grid, a Fortran90 code which computes a hexagonal grid of points over the interior of a square in 2D.
1266. square_hex_grid_test
1267. square_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the interior of the unit square or symmetric unit square in 2D.
1268. square_integrals_test
1269. square_minimal_rule, a Fortran90 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.
1270. square_minimal_rule_test
1271. square_monte_carlo, a Fortran90 code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit square in 2D.
1272. square_monte_carlo_test
1273. square_symq_rule, a Fortran90 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.
1274. square_symq_rule_test
1275. ss_gd_align, a Fortran90 code which implements some of the linear space alignment algorithms described in the reference by Chao.
1276. ss_gd_align_test
1277. ss_gg_align, a Fortran90 code which implements the sequence/sequence global gap alignment, one of the string matching algorithms described in the reference by Chao.
1278. ss_gg_align_test
1279. ss_lg_align, a Fortran90 code which implements the sequence/sequence local alignment, one of the string matching algorithms described by Chao.
1280. ss_lg_align_test
1281. ss_qg_align, a Fortran90 code which implements the sequence/sequence global gap alignment, one of the string matching algorithms described by Chao.
1282. ss_qg_align_test
1283. st_io, a Fortran90 code which reads and writes sparse linear systems stored in the Sparse Triplet (ST) format.
1284. st_io_test
1285. st_to_ccs, a Fortran90 code which converts sparse matrix data from Sparse Triplet (ST) format to Compressed Column Storage (CCS) format;
1286. st_to_ccs_test
1287. st_to_hb, a Fortran90 code which converts a sparse matrix file from Sparse Triplet (ST) format to Harwell Boeing (HB) format;
1288. st_to_hb_test
1289. starpac, a Fortran90 code which performs statistical data analysis. It includes functions for nonlinear least squares regression, time series analysis in both time and frequency domains), line printer graphics, basic statistical analysis, and linear least squares regression, by Janet Donaldson.
1290. starpac_test
1291. steam, a Fortran90 code which computes steam table properties including pressure and density, based on a National Bureau of Standards (NBS) package;
1292. steam_test
1293. steam_interact, a Fortran90 code which allows the user to interactively query the steam table functions from the National Bureau of Standards (NBS).
1294. steam_interact_test
1295. stiff_ode, a Fortran90 code which considers an ordinary differential equation (ODE) which is an example of a stiff ODE.
1296. stiff_ode_test
1297. stla_io, a Fortran90 code which reads and writes the 3D graphics information in an ASCII stereolithography (STL) file;
1298. stla_io_test
1299. stochastic_diffusion, a Fortran90 code which implements several versions of a stochastic diffusivity coefficient, using gnuplot() to create graphic images of sample realizations of the diffusivity field.
1300. stochastic_diffusion_test
1301. stochastic_heat2d, a Fortran90 code which implements a finite difference method (FDM) for the steady 2D heat equation, with a stochastic heat diffusivity coefficient.
1302. stochastic_heat2d_test
1303. stochastic_rk, a Fortran90 code which applies a Runge-Kutta (RK) scheme to a stochastic ordinary differential equation (SDE).
1304. stochastic_rk_test
1305. stokes_2d_exact, a Fortran90 code which evaluates exact solutions to the incompressible steady Stokes equations over the unit square in 2D.
1306. stokes_2d_exact_test
1307. string_pde, a Fortran90 code which sets up and solves the partial differential equations (PDE) describing a vibrating string, creating files that can be displayed by gnuplot().
1308. string_pde_test
1309. stripack, a Fortran90 code which computes the Delaunay triangulation or Voronoi diagram of points on a unit sphere, by Robert Renka.
1310. stripack_test
1311. stripack_bench, a Fortran90 code which times the execution of stripack()'s Delaunay triangulation procedure over the surface of a sphere, for a random set of N nodes.
1312. stripack_bench_test
1313. stripack_delaunay, a Fortran90 code which reads points on the unit sphere, calls stripack() to compute the Delaunay triangulation, and writes it to a file.
1314. stripack_delaunay_test
1315. stripack_voronoi, a Fortran90 code which reads points on the unit sphere, computes the Voronoi diagram, and writes it to a file.
1316. stripack_voronoi_test
1317. stroud_rule, a Fortran90 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.
1318. stroud_rule_test
1319. subpak, a Fortran90 code which includes a number of utility routines.
1320. subpak_test
1321. subset, a Fortran90 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.
1322. subset_test
1323. subset_sum, a Fortran90 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.
1324. subset_sum_test
1325. subset_sum_backtrack, a Fortran90 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.
1326. subset_sum_backtrack_test
1327. subset_sum_brute, a Fortran90 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.
1328. subset_sum_brute_test
1329. subset_sum_swap, a Fortran90 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.
1330. subset_sum_swap_test
1331. svd_basis, a Fortran90 code which applies the singular value decomposition (SVD) to a collection of data vectors, extracting dominant modes;
1332. svd_basis_test
1333. svd_basis_weight, a Fortran90 code which applies the singular value decomposition (SVD) to a collection of weighted data vectors, extracting dominant modes;
1334. svd_basis_weight_test
1335. svd_snowfall, a Fortran90 code which reads a file containing historical snowfall data and analyzes the data with the Singular Value Decomposition (SVD), displaying the results using gnuplot().
1336. svd_snowfall_test
1337. svd_test, a Fortran90 code which demonstrates the Singular Value Decomposition (SVD).
1338. svd_truncated, a Fortran90 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.
1339. svd_truncated_test
1340. table_columns, a Fortran90 code which reads a table file of N points in M dimensions and creates a new file by copying various columns, with repetition and shuffling;
1341. table_columns_test
1342. table_io, a Fortran90 code which reads and writes data as a table file.
1343. table_io_test
1344. table_quality, a Fortran90 code which reads a table file of N points in M dimensions and computes the uniformity of the placement of the points;
1345. table_quality_test
1346. table_top, a Fortran90 code which displays patterns in a set of N points in M dimensions.
1347. table_top_test
1348. tec_io, a Fortran90 code which reads or writes a tecplot() ASCII TEC file containing a model associated with the finite element method (FEM).
1349. tec_io_test
1350. tec_to_fem, a Fortran90 code which converts a tecplot ASCII file into an FEM model.
1351. tec_to_fem_test
1352. test_approx, a Fortran90 code which implements test problems for approximation, provided as (x,y) data.
1353. test_approx_test
1354. test_con, a Fortran90 code which defines tests for the continuation problem, which considers a function F(X) with N-dimensional argument X and N-1 dimensional result. In general, this defines an implicit one-dimensional curve of solutions X(LAMBDA). A continuation code starts from a single point on this curve and tries to compute a sequence of solutions that form a path.
1355. test_con_test
1356. test_eigen, a Fortran90 code which implements test matrices for eigenvalue analysis.
1357. test_eigen_test
1358. test_int, a Fortran90 code which implements test problems for approximate integration in one dimension.
1359. test_int_test
1360. test_int_2d, a Fortran90 code which implements test problems for approximate integration in two dimensions.
1361. test_int_2d_test
1362. test_interp, a Fortran90 code which defines test problems for interpolation, provided as (x,y(x)) data.
1363. test_interp_test
1364. test_interp_1d, a Fortran90 code which defines test problems for interpolation of data y(x), which depends on a 1D argument.
1365. test_interp_1d_test
1366. test_interp_2d, a Fortran90 code which defines test problems for interpolation of data z(x,y), depending on a 2D argument.
1367. test_interp_2d_test
1368. test_interp_nd, a Fortran90 code which defines test problems for interpolation of data z(x), depending on an M-dimensional argument.
1369. test_interp_nd_test
1370. test_lls, a Fortran90 code which implements linear least squares (LLS) test problems of the form A*x=b.
1371. test_lls_test
1372. test_matrix, a Fortran90 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.
1373. test_matrix_test
1374. test_matrix_exponential, a Fortran90 code which defines test cases for computing the matrix exponential.
1375. test_matrix_exponential_test
1376. test_mesh, a Fortran90 code which implements some sample 2D meshes.
1377. test_mesh_test
1378. test_min, a Fortran90 code which implements test problems for minimization of a scalar function of a scalar variable.
1379. test_min_test
1380. test_nearest, a Fortran90 code which tests the time complexity of various procedures for solving the nearest neighbor problem.
1381. test_nearest_test
1382. test_nint, a Fortran90 code which implements test problems for approximate integration (quadrature) in M dimensions.
1383. test_nint_test
1384. test_nls, a Fortran90 code which implements nonlinear least squares (NLS) test problems.
1385. test_nls_test
1386. test_nonlin, a Fortran90 code which implements test problems for the solution of systems of nonlinear equations.
1387. test_nonlin_test
1388. test_ode, a FORTRAN90 code which defines a set of test initial value problems for ordinary differential equations (ODE).
1389. test_ode_test
1390. test_opt, a Fortran90 code which implements test problems for optimization of a scalar function of several variables.
1391. test_opt_test
1392. test_opt_con, a Fortran90 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.
1393. test_opt_con_test
1394. test_optimization, a Fortran90 code which implements test problems for optimization of a scalar function of several variables, as described by Molga and Smutnicki.
1395. test_optimization_test
1396. test_partial_digest, a Fortran90 code which generates cases of the partial digest problem.
1397. test_partial_digest_test
1398. test_tet_mesh, a Fortran90 code which implements test problems for tetrahedralization or meshing of arbitrary regions in 3 dimensions.
1399. test_tet_mesh_test
1400. test_triangulation, a Fortran90 code which implements test problems for triangularization or meshing of arbitrary regions in 2 dimensions.
1401. test_triangulation_test
1402. test_values, a Fortran90 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, Knapsack, 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.
1403. test_values_test
1404. test_zero, a Fortran90 code which implements test problems for the solution of a single nonlinear equation in one variable.
1405. test_zero_test
1406. tester, a BASH script which runs the test codes.
1407. tet_mesh, a Fortran90 code which carries out various tasks associated with tetrahedral meshes in 3D;
1408. tet_mesh_test
1409. tet_mesh_boundary, a Fortran90 code which determines the triangular mesh that bounds a tet mesh.
1410. tet_mesh_boundary_test
1411. tet_mesh_quad, a Fortran90 code which estimates the integral of a function over a region defined by a tetrahedral mesh.
1412. tet_mesh_quad_test
1413. tet_mesh_quality, a Fortran90 code which reads information about a tet mesh of points in 3D and computes various quality measures;
1414. tet_mesh_quality_test
1415. tet_mesh_to_gmsh, a Fortran90 code which writes a tetrahedral mesh to a gmsh() file.
1416. tet_mesh_to_gmsh_test
1417. tet_mesh_to_xml, a Fortran90 code which writes a tetrahedral mesh to an XML file.
1418. tet_mesh_to_xml_test
1419. tetrahedron, a Fortran90 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.
1420. tetrahedron_test
1421. tetrahedron_arbq_rule, a Fortran90 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.
1422. tetrahedron_arbq_rule_test
1423. tetrahedron_exactness, a Fortran90 code which computes the monomial exactness of a quadrature rule over the interior of a tetrahedron in 3D.
1424. tetrahedron_exactness_test
1425. tetrahedron_felippa_rule, a Fortran90 code which returns a Felippa quadrature rule for approximating integrals over the interior of a tetrahedron in 3D.
1426. tetrahedron_felippa_rule_test
1427. tetrahedron_grid, a Fortran90 code which computes a grid of points over the interior of a tetrahedron in 3D.
1428. tetrahedron_grid_test
1429. tetrahedron_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the interior of the unit tetrahedron in 3D.
1430. tetrahedron_integrals_test
1431. tetrahedron_jaskowiec_rule, a Fortran90 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.
1432. tetrahedron_jaskowiec_rule_test
1433. tetrahedron_keast_rule, a Fortran90 code which returns a Keast quadrature rule, with exactness between 0 and 8, over the interior of a tetrahedron in 3D.
1434. tetrahedron_keast_rule_test
1435. tetrahedron_monte_carlo, a Fortran90 code which uses the Monte Carlo method to estimate an integral over the interior of a general tetrahedron in 3D.
1436. tetrahedron_monte_carlo_test
1437. tetrahedron_ncc_rule, a Fortran90 code which defines Newton-Cotes Closed (NCC) quadrature rules over the interior of a tetrahedron in 3D.
1438. tetrahedron_ncc_rule_test
1439. tetrahedron_nco_rule, a Fortran90 code which defines Newton-Cotes Open (NCO) quadrature rules over the interior of a tetrahedron in 3D.
1440. tetrahedron_nco_rule_test
1441. tetrahedron_witherden_rule, a Fortran90 code which returns a symmetric Witherden quadrature rule for the tetrahedron, with exactness up to total degree 10.
1442. tetrahedron_witherden_rule_test
1443. tetrahedron01_monte_carlo, a Fortran90 code which uses the Monte Carlo method to estimate an integral over the interior of the unit tetrahedron in 3D.
1444. tetrahedron01_monte_carlo_test
1445. three_body_ode, a Fortran90 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.
1446. three_body_ode_test
1447. tiler_2d, a Fortran90 code which demonstrates how to graphically tile a 2D box with a repeated pattern, using transfinite interpolation.
1448. tiler_2d_test
1449. tiler_3d, a Fortran90 code which demonstrates how to graphically tile a 3D box with a repeated pattern, using transfinite interpolation.
1450. tiler_3d_test
1451. timer_test, a Fortran90 code which tests various timing functions.
1452. timestamp, a Fortran90 code which prints the current YMDHMS date as a timestamp.
1453. timestamp_test
1454. toeplitz, a Fortran90 code solves a variety of Toeplitz and circulant linear systems.
1455. toeplitz_test
1456. toeplitz_cholesky, a Fortran90 code which computes the Cholesky factorization of a nonnegative definite symmetric Toeplitz matrix.
1457. toeplitz_cholesky_test
1458. toms097, a Fortran90 code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using the Floyd algorithm.
1459. toms097_test
1460. toms112, a Fortran90 code which determines whether a point is contained in a polygon, by Moshe Shimrat. This is a version of ACM TOMS algorithm 112.
1461. toms112_test
1462. toms178, a Fortran90 code which optimizes a scalar functional of multiple variables using the Hooke-Jeeves method, by Arthur Kaupe. This is a version of ACM TOMS algorithm 178.
1463. toms178_test
1464. toms179, a Fortran90 code which evaluates the modified Beta function, by Oliver Ludwig. This is a version of ACM TOMS algorithm 179.
1465. toms179_test
1466. toms243, a Fortran90 code which evaluates the logarithm of a complex value, by David Collens. This is a version of ACM TOMS algorithm 243.
1467. toms243_test
1468. toms291, a Fortran90 code which evaluates the logarithm of the Gamma function, by Malcolm Pike and David Hill. This is a version of ACM TOMS algorithm 291.
1469. toms291_test
toms419, a Fortran90 code which seeks all the zeroes of a polynomial with complex coefficients; this is commonly called cpoly(); this is a version of ACM TOMS algorithm 419, by Jenkins and Traub.
1470. toms419_test
1471. toms443, a Fortran90 code which evaluates the Lambert W function, by Fritsch, Shafer and Crowley. This is a version of ACM TOMS algorithm 443.
1472. toms443_test
1473. toms446, a Fortran90 code which manipulates Chebyshev series for interpolation and approximation; this is a version of ACM TOMS algorithm 446, by Roger Broucke.
1474. toms446_test
1475. toms453, a Fortran90 code which determines the abscissas and weights for a Gaussian quadrature formula for the Bromwich integral; this is a version of ACM TOMS algorithm 453.
1476. toms453_test
1477. toms462, a Fortran90 code which evaluates the upper right tail of the bivariate normal Probability Density Function (PDF); 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.
1478. toms462_test
1479. toms493, a Fortran90 code which seeks the roots of a real polynomial, commonly called rpoly(); this is a version of ACM TOMS algorithm 493, by Michael Jenkins.
1480. toms493_test
1481. toms515, a Fortran90 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.
1482. toms515_test
1483. toms526, a Fortran90 code which interpolates scattered bivariate data. This is a version of ACM TOMS algorithm 526, by Hiroshi Akima;
1484. toms526_test
1485. toms577, a Fortran90 code which evaluates the Carlson elliptic integral functions RC, RD, RF and RJ. This is a version of ACM TOMS algorithm 577;
1486. toms577_test
1487. toms611, a Fortran90 code which seeks the minimizer of a scalar functional of multiple variables. This is a version of ACM TOMS algorithm 611, by David Gay.
1488. toms611_test
1489. toms647, a Fortran90 code which evaluates Faure, Halton and Sobol Quasi Monte Carlo (QMC) sequences. This is a version of ACM TOMS algorithm 647.
1490. toms647_test
1491. toms655, a Fortran90 code which computes the weights for interpolatory quadrature rules; this is commonly called IQPACK, by Sylvan Elhay and Jaroslav Kautsky. This is a version of ACM TOMS algorithm 655.
1492. toms655_test
1493. toms659, a Fortran90 code which computes elements of the Sobol Quasi Monte Carlo (QMC) sequence; this is a version of ACM TOMS algorithm 659.
1494. toms659_test
1495. toms660, a Fortran90 code which takes scattered 2D data and produces an interpolating function F(X,Y). This is a version of ACM TOMS algorithm 660, called qshep2d, by Robert Renka.
1496. toms660_test
1497. toms661, a Fortran90 code which takes scattered 3D data and produces an interpolating function F(X,Y,Z). This is a version of ACM TOMS algorithm 661, called qshep3d, by Robert Renka.
1498. toms661_test
1499. toms672, a Fortran90 code which generates an interpolatory quadrature rule of highest possible order, given preassigned abscissas. This can be used to generate Gauss-Kronrod and Gauss-Patterson quadrature rules. This is commonly called EXTEND. This is a version of ACM TOMS algorithm 672.
1500. toms672_test
1501. toms708, a Fortran90 code which computes the incomplete Beta function ratio Ix(a,b).
1502. toms708_test
1503. toms715, a Fortran90 code which evaluates special functions, including the Bessel I, J, K, and Y functions of order 0, of order 1, and of any real order, the Dawson integral, the error function, exponential integrals, the gamma function, the normal distribution function, the psi function. This is a version of ACM TOMS algorithm 715.
1504. toms715_test
1505. toms726, a Fortran90 code which computes recursion coefficients for orthogonal polynomials, and the abscissa and weights for related quadrature rules. by Walter Gautschi. This is commonly called ORTHPOL. This is a version of ACM TOMS algorithm 726.
1506. toms726_test
1507. toms738, a Fortran90 code which evaluates the Niederreiter Quasi Monte Carlo (QMC) sequence; this is a version of ACM TOMS algorithm 738;
1508. toms738_test
1509. toms743, a Fortran90 code which evaluates the Lambert W function. This is a version of ACM TOMS algorithm 743, by Barry, Barry and Culligan-Hensley.
1510. toms743_test
1511. toms757, a Fortran90 code which evaluates uncommon special functions, by Allan Mcleod; this is a version of ACM TOMS algorithm 757;
1512. toms757_test
1513. toms792, a Fortran90 code which tests functions that interpolate scattered data in the plane; by Robert Renka; this is a version of ACM TOMS algorithm 792.
1514. toms792_test
1515. toms886, a Fortran90 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.
1516. toms886_test
1517. trapezoidal, a Fortran90 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.
1518. trapezoidal_test
1519. treepack, a Fortran90 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.
1520. treepack_test
1521. tri_surface_io, a Fortran90 code which reads and writes the 3D graphics information in a tri_surface file;
1522. tri_surface_io_test
1523. triangle, a Fortran90 code which computes properties, including angles, area, centroid, circumcircle, edge lengths, incircle, orientation, orthocenter, and quality, of a triangle in 2D.
1524. triangle_test
1525. triangle_analyze, a Fortran90 code which reads a triangle defined in a file, and computes angles, area, centroid, circumcircle, edge lengths, incircle, orientation, orthocenter, and quality.
1526. triangle_analyze_test
1527. triangle_dunavant_rule, a Fortran90 code which defines Dunavant rules for quadrature over the interior of a triangle in 2D.
1528. triangle_dunavant_rule_test
1529. triangle_exactness, a Fortran90 code which computes the monomial exactness quadrature rule over the interior of a triangle in 2D.
1530. triangle_exactness_test
1531. triangle_fekete_rule, a Fortran90 code which defines a Fekete rule for interpolation or quadrature over the interior of a triangle in 2D.
1532. triangle_fekete_rule_test
1533. triangle_felippa_rule, a Fortran90 code which returns a Felippa quadrature rule for approximating integrals over the interior of a triangle in 2D.
1534. triangle_felippa_rule_test
1535. triangle_grid, a Fortran90 code which computes a grid of points over the interior of a triangle in 2D.
1536. triangle_grid_test
1537. triangle_histogram, a Fortran90 code which computes histograms of data over the interior of the unit triangle in 2D.
1538. triangle_histogram_test
1539. triangle_integrals, a Fortran90 code which returns the exact value of the integral of any polynomial over the interior of an arbitrary triangle in 2D.
1540. triangle_integrals_test
1541. triangle_interpolate, a Fortran90 code which shows how vertex data can be interpolated at any point in the interior of a triangle.
1542. triangle_interpolate_test
1543. triangle_io, a Fortran90 code which reads or writes some of the files created by Jonathan Shewchuk's triangle() program.
1544. triangle_io_test
1545. triangle_lyness_rule, a Fortran90 code which returns a Lyness-Jespersen quadrature rule over the interior of a triangle in 2D.
1546. triangle_lyness_rule_test
1547. triangle_monte_carlo, a Fortran90 code which uses the Monte Carlo method to estimate an integral over the interior of a general triangle in 2D.
1548. triangle_monte_carlo_test
1549. triangle_ncc_rule, a Fortran90 code which defines Newton-Cotes Closed (NCC) quadrature rules over the interior of a triangle in 2D.
1550. triangle_ncc_rule_test
1551. triangle_nco_rule, a Fortran90 code which defines Newton-Cotes Open (NCO) quadrature rules over the interior of a triangle in 2D.
1552. triangle_nco_rule_test
1553. triangle_svg, a Fortran90 code which uses Scalable Vector Graphics (SVG) to plot a triangle and any number of points, to illustrate quadrature rules and sampling techniques.
1554. triangle_svg_test
1555. triangle_symq_rule, a Fortran90 code which returns efficient symmetric quadrature rules, with exactness up to total degree 50, over the interior of an arbitrary triangle in 2D, by Hong Xiao and Zydrunas Gimbutas.
1556. triangle_symq_rule_test
1557. triangle_to_fem, a Fortran90 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.
1558. triangle_to_fem_test
1559. triangle_to_medit, a Fortran90 code which reads the NODE and ELE files created by Jonathan Shewchuk's triangle() program to describe a triangular mesh, and writes a corresponding medit() MESH file.
1560. triangle_to_medit_test
1561. triangle_to_xml, a Fortran90 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().
1562. triangle_to_xml_test
1563. triangle_twb_rule, a Fortran90 code which generates the points and weights of quadrature rules over the interior of a triangle in 2D, determined by Taylor, Wingate, and Bos.
1564. triangle_twb_rule_test
1565. triangle_wandzura_rule, a Fortran90 code which returns Wandzura quadrature rules of exactness 5, 10, 15, 20, 25 or 30 over the interior of the triangle in 2D.
1566. triangle_wandzura_rule_test
1567. triangle_witherden_rule, a Fortran90 code which returns a symmetric Witherden quadrature rule for the triangle, with exactness up to total degree 20.
1568. triangle_witherden_rule_test
1569. triangle01_integrals, a Fortran90 code which returns the integral of any monomial over the interior of the unit triangle in 2D.
1570. triangle01_integrals_test
1571. triangle01_monte_carlo, a Fortran90 code which uses the Monte Carlo method to estimate an integral over the interior of the unit triangle in 2D.
1572. triangle01_monte_carlo_test
1573. triangulation, a Fortran90 code which computes the triangulation 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.
1574. triangulation_test
1575. triangulation_l2q, a Fortran90 code which reads information about a 3-node (linear) triangulation and creates data defining a corresponding 6-node (quadratic) triangulation;
1576. triangulation_l2q_test
1577. triangulation_mask, a Fortran90 code which reads a triangulation and calls a user-supplied routine to consider each triangle for deletion;
1578. triangulation_mask_test
1579. triangulation_orient, a Fortran90 code which ensures that the triangles in an order 3 or order 6 triangulation have positive orientation;
1580. triangulation_orient_test
1581. triangulation_plot, a Fortran90 code which plots the nodes and elements of a triangulation as a PostScript (PS) file;
1582. triangulation_plot_test
1583. triangulation_q2l, a Fortran90 code which reads information about a 6-node triangulation and creates data defining a corresponding 3-node triangulation;
1584. triangulation_q2l_test
1585. triangulation_quad, a Fortran90 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.
1586. triangulation_quad_test
1587. triangulation_quality, a Fortran90 code which reads information about a triangulation and computes various quality measures;
1588. triangulation_quality_test
1589. triangulation_rcm, a Fortran90 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.
1590. triangulation_rcm_test
1591. triangulation_svg, a Fortran90 code which creates an SVG image of a triangulation, which can be displayed by a web browser.
1592. triangulation_svg_test
1593. triangulation_t3_to_t4, a Fortran90 code which reads information about a 3-node triangulation and creates data defining a corresponding 4-node triangulation (vertices + centroid);
1594. triangulation_t3_to_t4_test
1595. triangulation_triangle_neighbors, a Fortran90 code which reads data defining a triangulation, determines the neighboring triangles of each triangle, and writes that information to a file.
1596. triangulation_triangle_neighbors_test
1597. truncated_normal, a Fortran90 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.
1598. truncated_normal_test
1599. truncated_normal_rule, a Fortran90 code which computes a quadrature rule for a normal probability density function (PDF), also called a Gaussian distribution, that has been truncated to [A,+oo), (-oo,B] or [A,B].
1600. truncated_normal_rule_test
1601. tsp_brute, a Fortran90 code which reads a file of city-to-city distances and solves a (small!) traveling salesperson problem (TSP), using brute force.
1602. tsp_brute_test
1603. tsp_lau, a Fortran90 code which implements a heuristic algorithm for the solution of the traveling salesperson problem (TSP).
1604. tsp_lau_test
1605. two_body_ode, a Fortran90 code which sets up and solves ordinary differential equations (ODE) which simulate the behavior of two bodies, constrained to lie in a plane, moving under the influence of gravity, with one body much more massive than the other.
1606. two_body_ode_test
1607. ubvec, a Fortran90 code which demonstrates how unsigned binary vectors, strings of 0 and 1, represent nonnegative integers or subsets or other mathematical objects, for which various arithmetic and logical operations can be defined.
1608. ubvec_test
1609. unicycle, a Fortran90 code which considers permutations containing a single cycle, sometimes called cyclic permutations.
1610. unicycle_test
1611. uniform, a Fortran90 code which implements random number generators (RNG) for a variety of arithmetic types.
1612. uniform_test
1613. van_der_corput, a Fortran90 code which computes elements of a 1D van der Corput Quasi Monte Carlo (QMC) sequence using a simple interface.
1614. van_der_corput_test
1615. vandermonde, a Fortran90 code which implements the Bjork-Pereyra algorithm for accurate solution of linear systems involving the Vandermonde matrix.
1616. vandermonde_test
1617. vandermonde_approx_1d, a Fortran90 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.
1618. vandermonde_approx_1d_test
1619. vandermonde_approx_2d, a Fortran90 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.
1620. vandermonde_approx_2d_test
1621. vandermonde_interp_1d, a Fortran90 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().
1622. vandermonde_interp_1d_test
1623. vandermonde_interp_2d, a Fortran90 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.
1624. vandermonde_interp_2d_test
1625. vtk_io, a Fortran90 code which reads and writes some simple forms of VTK files.
1626. vtk_io_test
1627. walker_sample, a Fortran90 code which efficiently samples a discrete probability vector using Walker sampling.
1628. walker_sample_test
1629. walsh_transform, a Fortran90 code which implements the Walsh data transform.
1630. walsh_transform_test
1631. wathen_matrix, a Fortran90 code which compares storage schemes (full, banded, sparse triplet ) and solution strategies (Linpack full, Linpack banded, conjugate gradient) for linear systems involving the Wathen matrix, which can arise when solving a problem using the finite element method (FEM).
1632. wathen_matrix_test
1633. wave_mpi, a Fortran90 code which uses the finite difference method (FDM) to estimate a solution to the wave equation, using the Message Passing Interface (MPI) for parallel execution.
1634. wave_mpi_test
1635. wavelet, a Fortran90 code which does some simple calculations with wavelet transforms;
1636. wavelet_test
1637. wedge_exactness, a Fortran90 code which investigates the polynomial exactness of a quadrature rule over the interior of the unit wedge in 3D.
1638. wedge_exactness_test
1639. wedge_felippa_rule, a Fortran90 code which returns a Felippa quadrature rule for approximating integrals over the interior of the unit wedge in 3D.
1640. wedge_felippa_rule_test
1641. wedge_grid, a Fortran90 code which computes a grid of points over the interior of the unit wedge in 3D.
1642. wedge_grid_test
1643. wedge_integrals, a Fortran90 code which returns the exact value of the integral of any monomial over the interior of the unit wedge in 3D.
1644. wedge_integrals_test
1645. wedge_monte_carlo, a Fortran90 code which uses the Monte Carlo method to estimate an integral over the interior of the unit wedge in 3D.
1646. wedge_monte_carlo_test
1647. weekday, a Fortran90 code which determines the day of the week corresponding to a given date, such as 14 October 1066, Julian calendar, which was a Saturday.
1648. weekday_test
1649. wishart_matrix, a Fortran90 code which produces sample matrices from the Wishart or Bartlett distributions, useful for sampling random covariance matrices.
1650. wishart_matrix_test
1651. wordsnake, a Fortran90 code which tries to find a good solution to the "Wordsnake Puzzle", in which a list of words is reordered, trying to maximize the overlap of successive words.
1652. wordsnake_test
1653. wtime, a Fortran90 code which returns a reading of the wall clock time in seconds.
1654. wtime_test
1655. xerror, a Fortran90 code which reports and handles errors detected during execution.
1656. xerror_test
1657. xy_io, a Fortran90 code which reads and writes simple graphics files in the XY, XYL and XYF formats.
1658. xy_io_test
1659. xyz_io, a Fortran90 code which reads and writes simple graphics files in the XYZ, XYZL and XYZF formats.
1660. xyz_io_test
1661. xyz_to_pdb, a Fortran90 code which reads an XYZ file containing a list of spatial coordinates, and writes a Protein Data Bank (PDB) file containing ATOM records with the given coordinates.
1662. xyz_to_pdb_test
1663. zero_brent, a Fortran90 code which seeks a solution of a scalar nonlinear equation f(x)=0, by Richard Brent.
1664. zero_brent_test
1665. zero_chandrupatla, a Fortran90 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.
1666. zero_chandrupatla_test
1667. zero_itp, a Fortran90 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.
1668. zero_itp_test
1669. zero_laguerre, a Fortran90 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.
1670. zero_laguerre_test
1671. zero_muller, a Fortran90 code which seeks a root of a nonlinear equation using the Muller method, with complex arithmetic.
1672. zero_muller_test
1673. zero_rc, a Fortran90 code which seeks a solution of a scalar nonlinear equation f(x)=0, using reverse communication (RC), by Richard Brent.
1674. zero_rc_test
1675. zoomin, a Fortran90 code which implements many procedures for finding the zero of a scalar nonlinear function.
1676. zoomin_test