octave_src

1. advection_pde, an Octave code which solves the advection partial differential equation (PDE) dudt + c * dudx = 0 in one spatial dimension, with a constant velocity c, and periodic boundary conditions, using the forward time centered space (FTCS) method.
2. advection_pde_test
3. allen_cahn_pde, an Octave code which sets up and solves the Allen-Cahn reaction-diffusion partial differential equation (PDE) du/dt = nu * uxx - u * (u^2-1) / (2*xi) in 1 space dimension and time.
4. allen_cahn_pde_test
5. allen_cahn_pde_etdrk4 an Octave code which uses the exponential time differencing (ETD) RK4 method to solve the Allen-Cahn system of stiff ordinary differential equations (ODE), by Aly-Khan Kassam, Lloyd Trefethen.
6. allen_cahn_pde_etdrk4_test
7. allen_cahn_pde_euler an Octave code which uses the Euler method to solve the Allen-Cahn PDE as a system of stiff ordinary differential equations (ODE), by Aly-Khan Kassam, Lloyd Trefethen.
8. allen_cahn_pde_euler_test
9. alpert_rule, an Octave code which sets up an Alpert quadrature rule for functions which are regular, log(x) singular, or 1/sqrt(x) singular.
10. alpert_rule_test
11. analemma, an Octave 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, based on a C program by Brian Tung.
12. analemma_test
13. animation_test, an Octave code which demonstrates how to create an animation in the form of a GIF.
14. anishchenko_ode, an Octave code which sets up and solves the Anishchenko ordinary differential equation (ODE), which has chaotic behavior and an attractor.
15. anishchenko_ode_test
16. annulus_distance, an Octave code which estimates the typical distance between a pair of points randomly selected inside a circular annulus.
17. annulus_distance_test
18. annulus_grid, an Octave code which computes a grid of points over the interior of a circular annulus.
19. annulus_grid_test
20. annulus_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of an annulus centered at the origin.
21. annulus_integrals_test
22. annulus_monte_carlo, an Octave code which uses the Monte Carlo method to estimate the integral of a function over the interior of a circular annulus in 2D.
23. annulus_monte_carlo_test
24. annulus_rule, an Octave code which computes a quadrature rule for estimating integrals of a function over the interior of a circular annulus in 2D.
25. annulus_rule_test
26. aperiodic_tile, an Octave code which constructs several steps in the aperiodic tiling of the plane, using the monotile T(1,1), displaying the result graphically, by Henning Voss.
27. aperiodic_tile_test
28. approx_bernstein, an Octave code which interactively approximates a function f(x) in the interval [a,b] by constructing a Bernstein polynomial.
29. approx_bernstein_test
30. approx_chebyshev, an Octave code which interactively approximates a function f(x) in the interval [a,b] by constructing a Chebyshev polynomial interpolant that is often a good estimate of the minimax polynomial.
31. approx_chebyshev_test
32. approx_leastsquares, an Octave code which interactively approximates a function f(x) in the interval [a,b] by constructing an m-degree polynomial which minimizes the square root of the sum of the squares of the error with n sample data points.
33. approx_leastsquares_test
34. arclength, an Octave code which estimates the arclength of curves of the form (x,f(x)) or (x(t),y(t)).
35. arclength_test
36. area_under_curve, an Octave code which displays the area under a curve, that is, the points (x,y) between the X axis and the curve Y=F(X).
37. area_under_curve_test
38. arenstorf_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) which defines a stable periodic orbit of a spacecraft around the Earth and the Moon.
39. arenstorf_ode_test
40. args, an Octave code which shows how to count and report command line arguments;
41. args_test
42. arneodo_ode, an Octave code which sets up and solves the Arneodo ordinary differential equation (ODE), which has chaotic behavior and an attractor.
43. arneodo_ode_test
44. artery_pde, an Octave code which solves a partial differential equation (PDE) in one spatial dimension and time, that models the displacement of arterial walls under pressure.
45. artery_pde_test
46. asa_geometry_2011, an Octave code which was used during labs, demonstrations, and lectures associated with the Geometry Algorithms portion of the class Algorithms for Science Applications II, as taught at the Scientific Computing Department, Florida State University, Spring Semester 2011.
47. asa_geometry_2011_test
48. asa_graphs_2011, a Octave code which was used during labs, demonstrations, and lectures associated with the Graph Algorithms portion of the class Algorithms for Science Applications II, as taught at the Scientific Computing Department, Florida State University, Spring Semester 2011.
49. asa_images_2011, an Octave code which was used during labs, demonstrations, and lectures associated with the Image Algorithms portion of the class Algorithms for Science Applications II, as taught at the Scientific Computing Department, Florida State University, Spring Semester 2011.
50. asa005, an Octave 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;
51. asa005_test
52. asa006, an Octave 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;
53. asa006_test
54. asa007, an Octave code which computes the inverse of a symmetric positive definite (SPD) matrix, by Michael Healy. This is a version of Applied Statistics Algorithm 7.
55. asa007_test
56. asa032, an Octave code which evaluates the incomplete Gamma function, by G Bhattacharjee. This is a version of Applied Statistics Algorithm 32.
57. asa032_test
58. asa047, an Octave 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.
59. asa047_test
60. asa053, an Octave code which produces sample matrices from the Wishart distribution, by William Smith and Ronald Hocking. This is a version of Applied Statistics Algorithm 53.
61. asa053_test
62. asa058, an Octave code which implements the K-means data clustering algorithm, by David Sparks. This is a version of Applied Statistics Algorithm 58.
63. asa058_test
64. asa063, an Octave code which evaluates the incomplete Beta function, by KL Majumder and G Bhattacharjee. This is a version of Applied Statistics Algorithm 63.
65. asa063_test
66. asa066, an Octave 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.
67. asa066_test
68. asa076, an Octave 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.
69. asa076_test
70. asa082, an Octave code which computes the determinant of an orthogonal matrix; this is a version of Applied Statistics Algorithm 82, by J C Gower.
71. asa082_test
72. asa091, an Octave code which evaluates the percentage points of the Chi-Squared distribution, by Best and Roberts. This is a version of Applied Statistics Algorithm 91.
73. asa091_test
74. asa103, an Octave code which evaluates the digamma or psi function, by Jose Bernardo. This is a version of Applied Statistics Algorithm 103.
75. asa103_test
76. asa109, an Octave code which inverts the incomplete Beta function, by Cran, Martin and Thomas. This is a version of Applied Statistics Algorithm 109.
77. asa109_test
78. asa111, an Octave code which evaluates the percentage points of the normal distribution, by Beasley and Springer. This is a version of Applied Statistics Algorithm 111.
79. asa111_test
80. asa113, an Octave code which implements a clustering algorithm using transfers and swaps, by Banfield and Bassill. This is a version of Applied Statistics Algorithm 113.
81. asa113_test
82. asa121, an Octave code which evaluates the trigamma function, by BE Schneider. This is a version of Applied Statistics Algorithm 121.
83. asa121_test
84. asa136, an Octave code which implements a clustering algorithm, by Hartigan and Wong. This is a version of Applied Statistics Algorithm 136.
85. asa136_test
86. asa144, an Octave code which randomly generates an RxC contingency table, by James Boyett. This is a version of Applied Statistics Algorithm 144.
87. asa144_test
88. asa147, an Octave code which evaluates the incomplete Gamma function, by Chi Leung Lau. This is a version of Applied Statistics Algorithm 147.
89. asa147_test
90. asa152, an Octave 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.
91. asa152_test
92. asa159, an Octave code which randomly generates an RxC contingency table, by Michael Patefield; This is a version of Applied Statistics Algorithm 159.
93. asa159_test
94. asa172, an Octave 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;
95. asa172_test
96. asa183, an Octave code which implements a random number generator (RNG), by Wichman and Hill. This is a version of Applied Statistics Algorithm 183.
97. asa183_test
98. asa226, an Octave 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.
99. asa226_test
100. asa239, an Octave code which evaluates the incomplete Gamma function, by Shea. This is a version of Applied Statistics Algorithm 239.
101. asa239_test
102. asa241, an Octave code which evaluates the percentage points of the normal distribution, by Michael Wichura. This is a version of Applied Statistics Algorithm 241.
103. asa241_test
104. asa243, an Octave 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.
105. asa243_test
106. asa245, an Octave code which evaluates the logarithm of the Gamma function, by Allan Mcleod; this is a version of Applied Statistics Algorithm 245.
107. asa245_test
108. asa266, an Octave code which evaluates various properties of the Dirichlet Probability Density Function (PDF); This is a version of Applied Statistics Algorithm 266.
109. asa266_test
110. asa299, an Octave code which computes the lattice points in an M-dimensional simplex, by Chasalow and Brand; this is a version of Applied Statistics Algorithm 299;
111. asa299_test
112. asa310, an Octave 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.
113. asa310_test
114. asa314, an Octave 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;
115. asa314_test
116. atbash, an Octave code which applies the Atbash substitution cipher to a string of text.
117. atbash_test
118. atkinson, an Octave code which contains examples from the text 'Elementary Numerical Analysis', by Atkinson.
119. atkinson_test
120. autocatalytic_ode, an Octave code which sets up and solves the autocatalytic ordinary differential equation (ODE), which has chaotic behavior and an attractor.
121. autocatalytic_ode_test
122. axon_ode, an Octave code which sets up and solves the ordinary differential equations (ODE) for the Hodgkin-Huxley model of an axon.
123. axon_ode_test
124. backtrack_binary_rc, an Octave code which carries out a backtrack search for a set of binary decisions, using reverse communication (RC).
125. backtrack_binary_rc_test
126. backward_euler, an Octave code which solves one or more ordinary differential equations (ODE) using the (implicit) backward Euler method, using fsolve() for the implicit equation.
127. backward_euler_test
128. backward_euler_fixed, an Octave code which solves one or more ordinary differential equations (ODE) using the (implicit) backward Euler method, using a fixed point iteration for the implicit equation.
129. backward_euler_fixed_test
130. ball_and_stick_display, an Octave code which demonstrates the creation of a 3D ball and stick image;
131. ball_and_stick_display_test
132. ball_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected from the interior of the unit ball in 3D.
133. ball_distance_test
134. ball_grid, an Octave code which computes a grid of points over the interior of the unit ball in 3D.
135. ball_grid_test
136. ball_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of the unit ball in 3D.
137. ball_integrals_test
138. ball_monte_carlo, an Octave code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit ball in 3D;
139. ball_monte_carlo_test
140. ball_positive_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected from the interior of the unit positive ball in 3D.
141. ball_positive_distance_test
142. bank, an Octave code which computes the check digit associated with a US Bank Routing Number check digit, or reports whether a 9-digit code is actually valid.
143. bank_test
144. barycentric_interp_1d, an Octave code which defines and evaluates the barycentric Lagrange polynomial p(x) which interpolates a set of data, so that p(x(i)) = y(i). The barycentric approach means that very high degree polynomials can safely be used.
145. barycentric_interp_1d_test
146. basketball_dynamic, an Octave code which uses dynamic programming to count the ways of achieving a given score in basketball, respecting the order of events.
147. basketball_dynamic_test
148. bdf2, an Octave code which solves one or more ordinary differential equations (ODE) using BDF2, the (implicit) backward difference formula of order 2, using fsolve() to solve the implicit equation.
149. bdf2_test
150. bdf3, an Octave code which solves one or more ordinary differential equations (ODE) using the (implicit) backward difference formula of order 3 (BDF), using fsolve() to solve the implicit equation.
151. bdf3_test
152. bellman_ford, an Octave 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.
153. bellman_ford_test
154. bernstein_approximation, an Octave code which looks at some simple cases of approximation of a function f(x) by a Bernstein polynomial.
155. bernstein_approximation_test
156. bernstein_polynomial, an Octave code which evaluates the Bernstein polynomials;
157. bernstein_polynomial_test
158. besselj, an Octave code which evaluates Bessel J functions of noninteger order;
159. besselj_test
160. besselj_zero, an Octave code which computes zeros of any Bessel j function of integer order n.
161. besselj_zero_test
162. besselzero, an Octave code which computes the zeros of Bessel functions j or y, by Greg van Winckel and Jason Nicholson.
163. besselzero_test
164. beta_nc, an Octave code which evaluates the cumulative density function (CDF) of the noncentral Beta distribution;
165. beta_nc_test
166. bezier_surface, an Octave code which reads, writes, prints and manipulates the data that defines a Bezier surface;
167. bezier_surface_test
168. bezier_surface_display, an Octave code which displays a Bezier surface;
169. bezier_surface_display_test
170. bicg, an Octave code which implements the biconjugate gradient method (BICG), which estimates the solution of a large sparse nonsymmetric linear system.
171. bicg_test
172. biharmonic_cheby1d, an Octave code which uses Chebyshev methods to solve the biharmonic equation over an interval, a fourth order two point boundary value problem (BVP) in one spatial dimension.
173. biharmonic_cheby1d_test
174. biharmonic_exact, an Octave code which evaluates exact solutions w(x,y) to the biharmonic equation del^2 w = 0 or wxxxx + 2 wxxyy + wyyyy = 0
175. biharmonic_exact_test
176. biharmonic_fd1d, an Octave code which applies the finite difference method to solve the biharmonic equation over an interval, a fourth order two point boundary value problem (BVP) in one spatial dimension.
177. biharmonic_fd1d_test
178. biharmonic_fd2d, an Octave code which deals with the biharmonic equation in two dimensions, whose simplest form is uxxxx + 2uxxyy + uyyyy = f.
179. biharmonic_fd2d_test
180. biochemical_linear_ode, an Octave code which sets up and solves a linear biochemical ordinary differential equation (ODE).
181. biochemical_linear_ode_test
182. biochemical_nonlinear_ode, an Octave code which sets up and solves a nonlinear biochemical ordinary differential equation (ODE).
183. biochemical_nonlinear_ode_test
184. bioconvection_ode, an Octave code which approximates solutions to a system of ordinary differential equations (ODE) which model a bioconvection problem, and which are related to the Lorenz system.
185. bioconvection_ode_test
186. bird_egg, an Octave code which evaluates some formulas for the shapes of bird eggs.
187. bird_egg_test
188. bisection, an Octave code which applies the bisection method to seek a root of f(x) over a change-of-sign interval a <= x <= b.
189. bisection_test
190. bisection_integer, an Octave code which seeks an integer solution to the equation F(X)=0, using bisection within a user-supplied change of sign interval [a,b].
191. bisection_integer_test
192. bisection_rc, an Octave 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).
193. bisection_rc_test
194. black_scholes, an Octave code which implements some simple approaches to the Black-Scholes option valuation theory, by Desmond Higham.
195. black_scholes_test
196. blend, an Octave code which carries out 1D/2D/3D blending interpolation;
197. blend_test
198. blood_pressure_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) which models the variation in blood pressure in the human artery.
199. blood_pressure_ode_test
200. blowup_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) y'=y^2. whose solution blows up in finite time.
201. blowup_ode_test
202. boat, an Octave code which considers the boat tiling puzzle, a smaller version of the eternity puzzle. The boat puzzle specifies a region R composed of 756 30-60-90 triangles, and a set of 21 "tiles", each consisting of 36 30-60-90 triangles, and seeks an arrangement of the tiles that exactly covers the region.
203. boat_test
204. boat_cplex_test a BASH code which calls cplex(), to read the LP file defining the boat tiling problem, solve the linear programming problem, and write the solution to a file.
205. boat_gurobi_test a BASH code which calls gurobi(), to read the LP file defining the boat tiling problem, solve the linear programming problem, and write the solution to a file.
206. boundary_locus, an Octave code which uses the boundary locus method to display the region of absolute stability for a solver of ordinary differential equations (ODE).
207. boundary_locus_test
208. boundary_locus2, an Octave code which uses the boundary locus method to plot the boundary of the absolute stability region for a solver of ordinary differential equations (ODE), based on a procedure by Randall Leveque.
209. boundary_locus2_test
210. boundary_word_drafter, an Octave code which describes the outline of an object using a string of symbols that represent the sequence of steps tracing out the boundary, on a grid of drafters, or 30-60-90 triangles. The objects include tiles for the eternity, serenity and trinity puzzles, and the hat and turtle aperiodic monotiles.
211. boundary_word_drafter_test
212. boundary_word_equilateral, an Octave code which describes the outline of an object on a grid of equilateral triangles, using a string of symbols that represent the sequence of steps tracing out the boundary.
213. boundary_word_equilateral_test
214. boundary_word_hexagon, an Octave code which describes the outline of an object on a grid of hexagons, using a string of symbols that represent the sequence of steps tracing out the boundary.
215. boundary_word_hexagon_test
216. boundary_word_right, an Octave code which describes the outline of an object on a grid of isoceles right triangles, using a string of symbols that represent the sequence of steps tracing out the boundary.
217. boundary_word_right_test
218. boundary_word_square, an Octave code which describes the outline of an object on a grid of squares, using a string of symbols that represent the sequence of steps tracing out the boundary.
219. boundary_word_square_test
220. box_behnken, an Octave code which computes a Box-Behnken design, that is, a set of arguments to sample the behavior of a function of multiple parameters;
221. box_behnken_test
222. box_display, an Octave code which displays a box plot, over integer pairs of data, of a function defined by two formulas.
223. box_display_test
224. box_distance, an Octave code which estimates the distribution and expected value of the distance between two points picked uniformly at random within a box.
225. box_distance_test
226. box_flow, an Octave code which solves the Navier Stokes equations (NSE) in a 2D rectangular region, replacing the continuity equation with a pressure Poisson equation (PPE), by John Cornthwaite.
227. box_flow_test
228. box_games, an Octave code which assists in the display of game boards (checkers, cellular automatons, life);
229. box_games_test
230. box_plot, an Octave code which displays a box plot of data that consists of pairs of integers;
231. box_plot_test
232. brc_data, an Octave code which creates a file of randomly generated temperature readings to be associated with weather stations at 413 world cities. A file like this, with 1 billion records, is used for the billion record challenge (BRC).
233. brc_data_test
234. brc_naive, an Octave code which reads a file of randomly generated temperature readings, associated with weather stations at 413 world cities, and computes the minimum, mean, and maximum temperature for each weather station. It also reports the total execution time. Processing such a data file with one billion records is the substance of the billion record challenge (BRC).
235. brc_naive_test
236. brownian_motion_simulation, an Octave code which simulates Brownian motion in an M dimensional region.
237. brownian_motion_simulation_test
238. broyden, an Octave code which implements the Broyden iterative method for nonlinear equations, by Tim Kelley.
239. broyden_test
240. brusselator_ode, an Octave code which sets up and solves the Brusselator ordinary differential equation (ODE) system.
241. brusselator_ode_test
242. buckling_spring, an Octave code which plots solutions of the buckling spring equations.
243. buckling_spring_test
244. burgers_pde_etdrk4, an Octave code which uses the exponential time differencing (ETD) RK4 method to solve the Burgers PDE as a system of stiff ordinary differential equations (ODE), by Aly-Khan Kassam, Lloyd Trefethen.
245. burgers_pde_etdrk4_test
246. burgers_exact, an Octave code which evaluates exact solutions of the time-dependent 1D viscous Burgers equation.
247. burgers_exact_test
248. burgers_steady_viscous, an Octave code which solves the steady (time-independent) viscous Burgers equation using the finite difference method (FDM) applied to the conservative form of the equation, using the Newton method to solve the resulting nonlinear system.
249. burgers_steady_viscous_test
250. burgers_time_inviscid, an Octave code which solves the time-dependent inviscid Burgers equation using the finite difference method (FDM), and one of six solution methods.
251. burgers_time_inviscid_test
252. burgers_time_viscous, an Octave code which solves the time-dependent viscous Burgers equation using the finite difference method (FDM) applied to the conservative form of the equation.
253. burgers_time_viscous_test
254. bvec, an Octave code which demonstrates how signed integers can be stored as binary vectors, and arithmetic can be performed on them.
255. bvec_test
256. bvp_fd, an Octave code which demonstrates the use of the finite difference method (FDM) to solve a boundary value problem (BVP).
257. bvp_fd_test
258. bvp_shooting_test, an Octave code which demonstrates the use of the shooting method to solve a boundary value problem (BVP).
259. bwlabel_test, an Octave code which calls bwlabel(), which is given a binary matrix, and organizes the 1 values into labeled clusters, using 4-way or 8-way connectivity. For Octave, bwlabel() is part of the image() package.
260. c8lib, an Octave code which implements certain elementary functions for complex 64 bit ("C8") variables;
261. c8lib_test
262. caesar, an Octave code which applies a Caesar Shift Cipher to a string of text.
263. caesar_test
264. calendar_nyt, an Octave code which shows the correspondence between dates and the New York Times volume and issue number;
265. calendar_nyt_test
266. california_migration, an Octave code which runs a simple linear model of migration between California and the rest of the US, based on data from 1960. The point of the code is to illustrate the use of a matrix model for population exchange.
267. california_migration_test
268. calpak, an Octave code which computes various simple calendrical quantities. It works with various calendars including Egyptian, English, French Revolutionary, Gregorian, Julian, and Julian Ephemeris Date. It converts a date from one calendar to another. It returns the day of the week for a given date. It converts from day-number/year to day/month/year format. It calculates the time difference between two dates.
269. calpak_test
270. candy_count, an Octave 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.
271. candy_count_test
272. capacitor_2d_test, an Octave code which plots data from a model of a 2D capacitor, computed by FreeFem++() and transferred using the ffmatlib() library.
273. capacitor_3d_test, an Octave code which plots data from a model of a 3D capacitor, computed by FreeFem++() and transferred using the ffmatlib() library.
274. casino_simulation, an Octave code which simulates a casino game that gives you 20% of your bet for heads, and only takes 17% for tails. How much will you end up winning?
275. casino_simulation_test
276. cauchy_method, an Octave code which solves one or more ordinary differential equations (ODE) using the Cauchy method.
277. cauchy_method_test
278. cauchy_principal_value, an Octave code which uses Gauss-Legendre quadrature to estimate the Cauchy Principal Value (CPV) of certain singular integrals.
279. cauchy_principal_value_test
280. caustic, an Octave code which generates an image of a caustic, by drawing n equally spaced points in a circle, and then connecting specific pairs of points using a spacing parameter m.
281. caustic_test
282. cavity_flow_display, an Octave code which displays a single velocity field solution for the driven cavity;
283. cavity_flow_display_test
284. cc_display, an Octave code which displays the points used in a 2D Clenshaw-Curtis quadrature rule;
285. cc_display_test
286. cc_project, an Octave code which computes generalized Clenshaw-Curtis quadrature rules for semi-infinite and infinite intervals, by John Boyd.
287. cc_project_test
288. ccl_test, an Octave code which estimates the Lebesgue constants for sets of points in [-1,+1] computed in several ways. The program is probably of limited interest except as an example of an application of the lebesgue_constant() function.
289. ccn_rule, an Octave code which defines a Clenshaw Curtis Nested (CCN) quadrature rule.
290. ccn_rule_test
291. ccs_io an Octave code which reads and writes sparse linear systems stored in the Compressed Column Storage (CCS) format.
292. ccs_io_test
293. ccs_to_st an Octave code which converts a sparse matrix from Compressed Column Storage (CCS) to sparse triplet (ST) format.
294. ccs_to_st_test
295. ccvt_reflect, an Octave code which calculates a Constrained Centroidal Voronoi Tessellation (CCVT) for points constrained to lie in a box, with some points pushed towards the boundary;
296. ccvt_reflect_test
297. cell, an Octave 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.
298. cell_test
299. cellular_automaton, an Octave code which prints or plots the evolution of Cellular Automaton rule #30.
300. cellular_automaton_test
301. cg, an Octave code which implements a simple version of the conjugate gradient (CG) method for solving a system of linear equations of the form A*x=b, suitable for situations in which the matrix A is symmetric positive definite (SPD).
302. cg_test
303. cg_lab_triangles, an Octave code which was a computer lab assignment on computational geometry and triangles;
304. cg_lab_triangles_test
305. cg_ne, an Octave code which implements the conjugate gradient method (CG) for the normal equations, where the matrix A is not symmetric positive definite (SPD). In this case, it is attempted to set up and solve the normal equations A'*A*x=A'*b.
306. cg_ne_test
307. cg_rc, an Octave code which implements the conjugate gradient (CG) method for solving a symmetric positive definite (SPD) sparse linear system A*x=b, using reverse communication (RC).
308. cg_rc_test
309. cg_squared, an Octave code which implements the conjugate gradient squared (CGS) method for solving a nonsymmetric sparse linear system A*x=b.
310. cg_squared_test
311. change_diophantine, an Octave code which sets up a Diophantine equation to solve the change making problem, which counts the number of ways a given sum can be formed using coins of various denominations.
312. change_diophantine_test
313. change_dynamic, an Octave 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.
314. change_dynamic_test
315. change_greedy, an Octave code which uses the greedy method to seek a solution to the change making problem, which tries to match a given amount by selecting coins of various denominations.
316. change_greedy_test
317. change_polynomial, an Octave code which uses a polynomial multiplication algorithm to count the ways of making various sums using a given number of coins.
318. change_polynomial_test
319. chebyshev, an Octave code which computes the Chebyshev interpolant/approximant to a given function over an interval.
320. chebyshev_test
321. chebyshev_interp_1d, an Octave code which determines the combination of Chebyshev polynomials which interpolates a set of data, so that p(x(i)) = y(i).
322. chebyshev_interp_1d_test
323. chebyshev_matrix, an Octave code which defines the Chebyshev differentiation matrix, by Lloyd Trefethen.
324. chebyshev_matrix_test
325. chebyshev_polynomial, an Octave code which considers the Chebyshev polynomials T(i,x), U(i,x), V(i,x) and W(i,x).
326. chebyshev_polynomial_test
327. chebyshev_series, an Octave code which evaluates a Chebyshev series approximating a function f(x), while efficiently computing one, two, three or four derivatives of the series, by Manfred Zimmer.
328. chebyshev_series_test
329. chebyshev1_exactness, an Octave code which tests the polynomial exactness of Gauss-Chebyshev type 1 quadrature rules.
330. chebyshev1_exactness_test
331. chebyshev1_rule, an Octave code which computes and writes out a Gauss-Chebyshev type 1 quadrature rule of given order.
332. chebyshev1_rule_test
333. chebyshev2_exactness, an Octave code which tests the polynomial exactness of Gauss-Chebyshev type 2 quadrature rules.
334. chebyshev2_exactness_test
335. chebyshev2_rule, an Octave code which computes and writes out a Gauss-Chebyshev type 2 quadrature rule of given order.
336. chebyshev2_rule_test
337. chen_ode, an Octave code which sets up and solves the Chen system of ordinary differential equations (ODE).
338. chen_ode_test
339. cheney_kincaid, an Octave code which contains examples from the text 'Numerical Mathematics and Computing', by Cheney and Kincaid.
340. cheney_kincaid_test
341. chinese_remainder_theorem, an Octave code which demonstrates the Chinese remainder theorem, for reconstructing a number based on its remainders against a set of bases.
342. chinese_remainder_theorem_test
343. chirikov_iteration, an Octave code which applies the Chirikov map repeatedly to a given (x,y) initial condition.
344. chirikov_iteration_test
345. chladni_figures, an Octave code which creates Chladni figures of the eigenmodes of a thin vibrating plate, by Martin Gander and Felix Kwok.
346. chladni_figures_test
347. chrpak, an Octave code which manipulates characters and strings;
348. chrpak_test
349. chuckaluck_simulation, an Octave code which simulates the Chuck-a-Luck gambling game.
350. chuckaluck_simulation_test
351. circle_arc_grid, an Octave code which computes grid points along a circular arc.
352. circle_arc_grid_test
353. circle_circles_packing, an Octave code which tries to randomly pack as many non-overlapping circles of equal size into a larger circle, with a typical final coverage density of about 0.547. This is an example of random sequential adsorption (RSA).
354. circle_circles_packing_test
355. circle_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected on the circumference of the unit circle in 2D.
356. circle_distance_test
357. circle_grid_display an Octave code which reads a matrix of integers, and draws a corresponding grid of circles filled with color.
358. circle_grid_display_test
359. circle_integrals, an Octave code which returns the exact value of the integral of any monomial over the circumference of the unit circle in 2D.
360. circle_integrals_test
361. circle_map, an Octave code which illustrates how a matrix maps points on the unit circle to an ellipse.
362. circle_map_test
363. circle_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function along the circumference of the unit circle in 2D;
364. circle_monte_carlo_test
365. circle_positive_distance, an Octave code which estimates the mean and variance of the distance between a random pair of points on the circumference of the unit positive circle in 2D.
366. circle_positive_distance_test
367. circle_rule, an Octave code which computes quadrature rules for the unit circle in 2D, to approximate integrals of f(x,y) over the circumference of the circle of radius 1 and center (0,0).
368. circle_rule_test
369. circle_segment, an Octave code which carries out computations associated with a circle segment, including height, angle, area, centroid, sampling, and quadrature.
370. circle_segment_test
371. circles, an Octave code which draws one or more circles, while controlling the center locations, radii, colors, edge colors, and transparency, by Chad Greene.
372. circles_test
373. cities, an Octave code which works with city-to-city distance matrices;
374. cities_test
375. clausen, an Octave code which evaluates a Chebyshev interpolant to the Clausen function Cl2(x).
376. clausen_test
377. clenshaw_curtis_rule, an Octave code which implements a Clenshaw Curtis quadrature rule;
378. clenshaw_curtis_rule_test
379. clock_solitaire_simulation, an Octave code which simulates the game of clock solitaire. The deck is dealt into 13 piles of 4 cards each. Repeatedly, the top card a pile is removed, and its rank indicates the next pile to consider. Game continues until an empty pile is reached. The game is won if all piles are empty. The quantity of interest is the probability of winning.
380. clock_solitaire_simulation_test
381. closest_pair_brute, an Octave 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.
382. closest_pair_brute_test
383. closest_pair_divcon, an Octave code which uses a divide and conquer approach to solve a 2D version of the closest pair problem.
384. closest_pair_divcon_test
385. closest_point_brute, an Octave 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.
386. closest_point_brute_test
387. cnoise, an Octave code which generates samples of noise obeying a 1/f^alpha power law, by Miroslav Stoyanov.
388. cnoise_test
389. cobweb_plot, an Octave code which displays a cobweb plot illustrating the process of function iteration.
390. cobweb_plot_test
391. coin_simulation, an Octave code which looks at ways of simulating or visualizing the results of many tosses of a fair or biased coin.
392. coin_simulation_test
393. collatz, an Octave code which computes and analyzes the Collatz sequence, also known as the hailstone sequence or 3n+1 sequence;
394. collatz_test
395. collatz_polynomial, an Octave code which implements the Collatz polynomial iteration, a polynomial analog of the numerical iteration that is also known as the 3n+1 conjecture or the hailstone sequence.
396. collatz_polynomial_test
397. collatz_recursive, an Octave code which demonstrates recursive programming by considering the simple Collatz 3n+1 problem.
398. collatz_recursive_test
399. collocation, an Octave code which demonstrates the use of collocation to produce a function g(x) that satisfies the same constraints as a function f(x), but only at a discrete set of points.
400. collocation_test
401. colored_noise, an Octave code which generates samples of noise obeying a 1/f^alpha power law.
402. colored_noise_test
403. combo, an Octave 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.
404. combo_test
405. companion_matrix, an Octave 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.
406. companion_matrix_test
407. compass_search, an Octave code which seeks the minimizer of a scalar function of several variables using compass search, a direct search algorithm that does not use derivatives.
408. compass_search_test
409. complex_numbers_test, an Octave code which demonstrates some of the features of using complex numbers.
410. components, an Octave 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.
411. components_test
412. condition, an Octave code which implements methods of computing or estimating the condition number of a matrix.
413. condition_test
414. conservation_ode, an Octave code which monitors the conservation of a quantity that should be constant, during the solution of an ordinary differential equation (ODE).
415. conservation_ode_test
416. conte_deboor, an Octave code which contains examples from the text 'Elementary Numerical Analysis' by Conte and deBoor.
417. conte_deboor_test
418. continuation, an Octave code which implements the continuation method for a simple 2D problem, involving finding a point on the unit circle, and then finding a sequence of nearby points that trace out the full curve, using only the information available in the implicit definition of the curve from the function f(x,y)=x^2+y^2-1.
419. continuation_test
420. continued_fraction an Octave code which implements some simple algorithms for dealing with simple and generalized continued fractions.
421. continued_fraction_test
422. continuity_exact, an Octave code which returns a 2D velocity vector field (u,v)(x,y) which is an exact solution of the partial differential equation (PDE) sometimes called the continuity equation of fluid mechanics, which has the form ux + vy = 0.
423. continuity_exact_test
424. contour_gradient, an Octave code which displays contours and gradient vectors for a function f(x,y).
425. contour_gradient_test
426. contour_gradient_3d, an Octave code which displays contours and gradient vectors for a function f(x,y) in a 3D display.
427. contour_gradient_3d_test
428. contour_sequence4, an Octave code which creates images suitable for animation from one XY file and a sequence of u(x,y) data files;
429. contour_sequence4_test
430. control_bio, an Octave code which optimizes a given cost functional of a biological model using optimal control, based on work by Suzanne Lenhart and John Workman.
431. control_bio_test
432. control_bio_homework, an Octave code which handles several homework problems for a biological control class.
433. convective_rolls_test, an Octave code which plots data describing the convective rolling behavior of a fluid being heated from below, as computed by FreeFem++() and transferred using the ffmatlib() library.
434. convergence, an Octave code which is given a sequence of approximation errors and estimates the order of convergence, assuming the results correspond to a a sequence of decreasing mesh sizes h, or increasing mesh counts n.
435. convergence_test
436. convhull_test, an Octave code which demonstrates the use of the built-in function convhull() for the computation of the convex hull of a set of 2D points.
437. coordinate_search, an Octave code which seeks the minimizer of a scalar function of several variables, by Jeff Borggaard.
438. coordinate_search_test
439. cordic, an Octave code which computes a few special functions using the CORDIC algorithm.
440. cordic_test
441. correlation, an Octave code which contains statistical correlation functions.
442. correlation_test
443. cosine_transform, an Octave code which demonstrates some simple properties of the discrete cosine transform (DCT).
444. cosine_transform_test
445. counterfeit_detection, an Octave code which considers problems in which one or more counterfeit coins are to be identified by the fact that they do not have the standard weight.
446. counterfeit_detection_test
447. cplex_solution_read, an Octave code which extracts solution data from a cplex() result file.
448. cplex_solution_read_test
449. cpr, an Octave code which implements the Chebyshev Proxy Rootfinder (CPR) to locate all the real zeros of a smooth real function f(x) within an interval [a,b], by John Boyd.
450. cpr_test
451. craps_simulation, an Octave code which simulates the gambling game of craps, in which a player rolls two dice. On the first roll, the player wins immediately if a 7 or 11 is rolled, and loses immediately if a 2, 3 or 12 is rolled. Otherwise, the sum of the dice on this first roll is called the point. The player now continues to roll the dice, winning if the point is rolled again, and losing if a 7 is rolled.
452. craps_simulation_test
453. crs_io, an Octave code which reads and writes sparse linear systems stored in the Compressed Row Storage (CRS) format.
454. crs_io_test
455. cube_arbq_rule, an Octave code which returns quadrature rules, with exactness up to total degree 15, over the interior of the symmetric cube in 3D, by Hong Xiao and Zydrunas Gimbutas.
456. cube_arbq_rule_test
457. cube_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected in the interior of the unit cube in 3D.
458. cube_distance_test
459. cube_exactness, an Octave code which investigates the polynomial exactness of quadrature rules over the interior of a cube in 3D.
460. cube_exactness_test
461. cube_felippa_rule, an Octave code which returns a Felippa quadrature rules for approximating integrals over the interior of a cube in 3D.
462. cube_felippa_rule_test
463. cube_grid, an Octave code which computes a grid of points over the interior of a cube in 3D.
464. cube_grid_test
465. cube_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of the unit cube in 3D.
466. cube_integrals_test
467. cube_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit cube in 3D.
468. cube_monte_carlo_test
469. cube_surface_distance, an Octave code which estimates the expected value of the distance between a pair of points randomly selected on the surface of the unit cube.
470. cube_surface_distance_test
471. cuda_loop, an Octave 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.
472. cuda_loop_test
473. cvt, an Octave code which computes an N-point Centroidal Voronoi Tessellation (CVT) in M dimensions;
474. cvt_test
475. cvt_1d_lloyd, an Octave code which computes an N-point Centroidal Voronoi Tessellation (CVT) within the interval [0,1], under a uniform density, using the Lloyd method to compute the Voronoi regions exactly.
476. cvt_1d_lloyd_test
477. cvt_1d_lumping, an Octave code which allows the user to carry out a lumped version of the Lloyd iterative algorithm for a centroidal Voronoi Tessellation (CVT() in the interval [-1,+1], and is applied to investigate a relationship between a CVT and the Chebyshev Zero nodes.
478. cvt_1d_lumping_test
479. cvt_1d_nonuniform, an Octave code which computes an N-point Centroidal Voronoi Tessellation (CVT) in 1 dimension, under a nonuniform density, and plots the evolution of the locations of the generators during the iteration;
480. cvt_1d_nonuniform_test
481. cvt_1d_sampling, an Octave code which computes an N-point Centroidal Voronoi Tessellation (CVT) within the interval [0,1], under a uniform density, using sampling to estimate the Voronoi regions.
482. cvt_1d_sampling_test
483. cvt_2d_lumping, an Octave code which computes an N-point Centroidal Voronoi Tessellation (CVT) within the unit square [-1,1]^2, under a Chebyshev density, using weighted sampling (lumping) to estimate the Voronoi regions.
484. cvt_2d_lumping_test
485. cvt_2d_sampling, an Octave code which computes an N-point Centroidal Voronoi Tessellation (CVT) within the unit square [0,1]x[0,1], under a uniform density, using sampling to estimate the Voronoi regions.
486. cvt_2d_sampling_test
487. cvt_3d_lumping, an Octave code which computes an N-point Centroidal Voronoi Tessellation (CVT) within the unit cube [-1,1]^3, under a Chebyshev density, using weighted sampling (lumping) to estimate the Voronoi regions.
488. cvt_3d_lumping_test
489. cvt_3d_sampling, an Octave code which computes an N-point Centroidal Voronoi Tessellation (CVT) within the unit cube [0,1]^3, under a uniform density, using sampling to estimate the Voronoi regions.
490. cvt_3d_sampling_test
491. cvt_basic, an Octave code which calculates a Centroidal Voronoi Tessellation (CVT) in a square with uniform density. It is intended as an introduction to the cvt_square_uniform() code.
492. cvt_basic_test
493. cvt_box, an Octave code which calculates a Centroidal Voronoi Tessellation (CVT) constrained to a box region, with points projected to the boundary;
494. cvt_box_test
495. cvt_circle_nonuniform, an Octave code which demonstrates the computation of a centroidal Voronoi Tessellation (CVT) over a circular region, using a nonuniform density.
496. cvt_circle_nonuniform_test
497. cvt_circle_uniform, an Octave code which computes a centroidal Voronoi Tessellation (CVT) over a circular region, using a uniform density.
498. cvt_circle_uniform_test
499. cvt_corn, an Octave code which studies a 2D model of the growth of a corn kernel, by treating the surface and interior biological cells as points to be organized by a Centroidal Voronoi Tessellation (CVT) with a nonuniform density; during a sequence of growth steps, new biological cells are randomly added to the surface and interior.
500. cvt_corn_test
501. cvt_ellipse_uniform, an Octave code which iteratively calculates a Centroidal Voronoi Tessellation (CVT) over an ellipse, with a uniform density.
502. cvt_ellipse_uniform_test
503. cvt_metric, an Octave code which computes a Centroidal Voronoi Tessellation (CVT) under a spatially varying metric;
504. cvt_metric_test
505. cvt_square_nonuniform, an Octave code which iteratively calculates a Centroidal Voronoi Tessellation (CVT) over a square, with a nonuniform density.
506. cvt_square_nonuniform_test
507. cvt_square_pdf_discrete, an Octave code which iteratively calculates a Centroidal Voronoi Tessellation (CVT) over a square, with a density determined from a discrete PDF.
508. cvt_square_pdf_discrete_test
509. cvt_square_uniform, an Octave code which iteratively calculates a Centroidal Voronoi Tessellation (CVT) over a square, with a uniform density.
510. cvt_square_uniform_test
511. cvt_triangle_uniform, an Octave code which iteratively calculates a Centroidal Voronoi Tessellation (CVT) over a triangle, with a uniform density.
512. cvt_triangle_uniform_test
513. cvtm_1d, an Octave code which estimates a mirror-periodic centroidal Voronoi Tessellation (CVTM) in the periodic interval [0,1], using a version of the Lloyd iteration.
514. cvtm_1d_test
515. cvtp, an Octave code which creates a periodic Centroidal Voronoi Tessellation (CVTP).
516. cvtp_test
517. cvtp_1d, an Octave code which estimates a periodic centroidal Voronoi Tessellation (CVTP) in the periodic interval [0,1], using a version of the Lloyd iteration.
518. cvtp_1d_test
519. cycle_brent, an Octave code which carries out an iterated function evaluation, and seeks to determine the nearest element of a cycle, and the cycle length, using the Brent method.
520. cycle_brent_test
521. cycle_floyd, an Octave code which carries out an iterated function evaluation, and seeks to determine the nearest element of a cycle, and the cycle length, using the Floyd method.
522. cycle_floyd_test
523. cyclic_reduction, an Octave code which solves a tridiagonal linear system using cyclic reduction;
524. cyclic_reduction_test
525. delaunay_test, an Octave code which calls the built-in delaunay() function, which computes the Delaunay triangulation of a set of points.
526. delsq, an Octave code which is given a grid G, and returns a corresponding sparse matrix D that defines the Laplacian operator on G. MATLAB includes a built-in version of this function.
527. delsq_test
528. dfield9, an Octave code which allows a user to interactively specify the right hand side of an ordinary differential equation (ODE). The program then displays the corresponding direction field. If the user clicks on any point in the image as an initial condition, the program displays the corresponding solution curve. The original version of this code was by John Polking.
529. dg1d_advection, an Octave code which uses the Discontinuous Galerkin Method (DG) to approximate a solution of the advection equation. The original version of the code was written by Jan Hesthaven and Tim Warburton.
530. dg1d_advection_test
531. dg1d_burgers, an Octave code which uses the Discontinuous Galerkin Method (DG) to approximate a solution of the unsteady 1D Burgers equation. The original version of the code was written by Jan Hesthaven and Tim Warburton.
532. dg1d_burgers_test
533. dg1d_heat, an Octave code which uses the Discontinuous Galerkin Method (DG) to approximate a solution of the unsteady 1D heat equation. The original version of the code was written by Jan Hesthaven and Tim Warburton.
534. dg1d_heat_test
535. dg1d_maxwell, an Octave code which uses the Discontinuous Galerkin Method (DG) to approximate a solution of the Maxwell equations. The original version of the code was written by Jan Hesthaven and Tim Warburton.
536. dg1d_maxwell_test
537. dg1d_poisson, an Octave code which applies the discontinuous Galerkin method (DG) to a 1D version of the Poisson equation; the original version of the code was written by Beatrice Riviere.
538. dg1d_poisson_test
539. diaphony, an Octave code which reads a file of N points in M dimensions and computes its diaphony, a measure of point dispersion.
540. diaphony_test
541. dice_simulation, an Octave code which simulates N tosses of M dice, making a histogram of the resulting sums.
542. dice_simulation_test
543. dictionary_code, an Octave code which demonstates how a text file can be compressed and decompressed using a dictionary code.
544. dictionary_code_test
545. diff_test, an Octave code which calls diff(), which computes differences in a vector of data, which can be scaled to estimate derivatives of equally spaced data.
546. diff_center, an Octave code which interactively uses centered differences to estimate the derivative of a function f(x), using a stepsize h.
547. diff_center_test
548. diff_forward, an Octave code which interactively uses forward differences to estimate the derivative of a function f(x), using a stepsize h.
549. diff_forward_test
550. diff2_center, an Octave code which interactively uses centered differences to estimate the second derivative of a function f(x), using a stepsize h.
551. diff2_center_test
552. differ, an Octave 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.
553. differ_test
554. diffusion_pde, an Octave code which solves the diffusion partial differential equation (PDE) dudt = mu * d2udx2 in one spatial dimension and time, with a constant diffusion coefficient mu, and periodic or zero Neumann boundary conditions, using the forward time centered space (FTCS) method or ode45().
555. diffusion_pde_test
556. digital_dice, an Octave code which carries out probability simulations described in "Digital Dice", by Paul Nahin;
557. digital_dice_test
558. digraph_adj, an Octave code which carries out operations on abstract digraphs, a kind of graph with directed edges, described by an adjacency matrix.
559. digraph_adj_test
560. dijkstra, an Octave code which implements a simple version of the Dijkstra minimum distance algorithm for graphs.
561. dijkstra_test
562. diophantine, an Octave code which finds one solution of a diophantine equation in any number of variables.
563. diophantine_test
564. diophantine_nd, an Octave code which is given a Diophantine equation in N variables, and returns all nonnegative solutions, or all strictly positive solutions.
565. diophantine_nd_test
566. discrete_pdf_sample_2d, an Octave 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.
567. discrete_pdf_sample_2d_test
568. disk_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected from the interior of the unit disk in 2D.
569. disk_distance_test
570. disk_grid, an Octave 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.
571. disk_grid_test
572. disk_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of a disk of radius R centered at the origin.
573. disk_integrals_test
574. disk_monte_carlo, an Octave code which applies a Monte Carlo method to estimate integrals of a function over the interior of the general disk in 2D.
575. disk_monte_carlo_test
576. disk_positive_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected from the interior of the unit positive disk in 2D.
577. disk_positive_distance_test
578. disk_rule, an Octave code which computes quadrature rules for the general disk in 2D.
579. disk_rule_test
580. disk01_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of the unit disk in 2D.
581. disk01_integrals_test
582. disk01_integrands, an Octave code which defines several test integrals over the unit disk, making it possible to check the accuracy of quadrature rules.
583. disk01_integrands_test
584. disk01_monte_carlo, an Octave code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit disk in 2D;
585. disk01_monte_carlo_test
586. disk01_positive_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit positive disk in 2D;
587. disk01_positive_monte_carlo_test
588. disk01_positive_rule, an Octave code which computes a quadrature rule over the interior of the unit positive disk in 2D, with radius 1 and center (0,0).
589. disk01_positive_rule_test
590. disk01_rule, an Octave code which computes quadrature rules for the unit disk in 2D.
591. disk01_rule_test
592. dist_plot, an Octave code which makes contour plots of the distance function, as defined and used in Persson and Strang's distmesh() code;
593. dist_plot_test
594. distmesh, an Octave code which carries out a method of mesh generation; by Per-Olof Persson and Gilbert Strang.
595. distmesh_test
596. distmesh_3d, an Octave code which carries out a method of mesh generation in 3D, by Per-Olof Persson and Gilbert Strang.
597. distmesh_3d_test
598. divdif, an Octave 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.
599. divdif_test
600. doomsday, an Octave 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.
601. doomsday_test
602. dosage_ode, an Octave code which sets up and solves a system of ordinary differential equations (ODE) to simulate the blood levels of a medicinal drug that should stay between medicinal and toxic limits.
603. dosage_ode_test
604. dot_l2, an Octave code which interactively estimates the L2 dot product of two functions: dot_l2(f(x),g(x))_= integral ( a <= x <= b ) f(x) g(x) dx
605. dot_l2_test
606. double_c_data, an Octave code which generates, plots and writes out 2D data that forms two interlocking C shapes.
607. double_c_data_test
608. double_well_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) which models the motion of a particle in a double well potential.
609. double_well_ode_test
610. dream, an Octave 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.
611. dream_test
612. duel_simulation, an Octave code which simulates N repetitions of a duel between two players, each of whom has a known firing accuracy.
613. duel_simulation_test
614. dueling_idiots, an Octave code which carries out the probability simulations described in "Dueling Idiots", by Paul Nahin;
615. dueling_idiots_test
616. duffing_ode, an Octave code which sets up and solves a second-order ordinary differential equation (ODE) whose solution can exhibit chaotic behavior.
617. duffing_ode_test
618. e_spigot, an Octave code which produces any number of digits of the decimal expansion of e.
619. e_spigot_test
620. edge, an Octave code which defines some test functions in 1D, 2D and 3D for the detection of edges or discontinuities.
621. edge_test
622. eigenfaces, an Octave code which applies principal component analysis (PCA) to a set of images.
623. eigenfaces_test
624. eigs_test, an Octave code which calls eigs(), which is a built-in system function which computes the eigenvalues and eigenvectors of a matrix.
625. elfun, an Octave code which evaluates elliptic integrals, include Bulirsch's integrals cel(), cel1(), cel2(), cel3(), Carlson integrals rc(), rd(), rf(), rg(), rj(), and Jacobi functions cn(), dn(), sn(), by Milan Batista.
626. elfun_test
627. ellipse, an Octave 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.
628. ellipse_test
629. ellipse_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected on the circumference of the ellipse (x/a)^2+(y/b)^2=1 in 2D.
630. ellipse_distance_test
631. ellipse_grid, an Octave code which computes a grid of points over the interior of an ellipse in 2D.
632. ellipse_grid_test
633. ellipse_monte_carlo, an Octave code which uses the Monte Carlo method to estimate the value of integrals over the interior of an ellipse in 2D.
634. ellipse_monte_carlo_test
635. ellipsoid, an Octave code which carries out geometric calculations for ellipsoids, including area, random sampling, conversion between standard and quadratic forms.
636. ellipsoid_test
637. ellipsoid_grid, an Octave code which computes a grid of points over the interior of an ellipsoid in 3D.
638. ellipsoid_grid_test
639. ellipsoid_monte_carlo, an Octave code which uses the Monte Carlo method to estimate the value of integrals over the interior of an ellipsoid in M dimensions.
640. ellipsoid_monte_carlo_test
641. elliptic_integral, an Octave code which evaluates complete elliptic integrals of first, second and third kind, using the Carlson elliptic integral functions.
642. elliptic_integral_test
643. epicycloid, an Octave code which plots an epicycloid curve.
644. epicycloid_test
645. equidistribution, an Octave code which investigates equidistribution properties relating to density functions and point sets.
646. equidistribution_test
647. eros, an Octave code which implements elementary row operations (ERO) for the interactive solution of a system of linear equations.
648. eros_test
649. errors, an Octave code which illustrates the failure of numerical algorithms;
650. errors_test
651. eternity, an Octave code which considers the eternity puzzle, an irregular dodecagon that is to be tiled by 209 pieces, each formed by 12 contiguous 30-60-90 triangles, known as polydrafters.
652. eternity_test
653. eternity_hexity, an Octave code which evaluates and manipulates a six-fold parity quantity associated with grids and tiles used in the Eternity puzzle.
654. eternity_hexity_test
655. eternity_tile, an Octave code which considers the individual tiles of the eternity puzzle, 209 distinct pieces, each formed by 36 contiguous 30-60-90 triangles, known as polydrafters, as well as tiles for the serenity and trinity puzzles, and the hat and turtle aperiodic monotiles.
656. eternity_tile_test
657. euclid, an Octave code which investigates various versions of Euclid's algorithm for computing the greatest common divisor (GCD) of two integers.
658. euclid_test
659. euler, an Octave code which solves one or more ordinary differential equations (ODE) using the forward Euler method.
660. euler_test
661. exactness, an Octave 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).
662. exactness_test
663. exm, an Octave code which contains scripts and data discussed in the electronic textbook "Experiments with Matlab", by Cleve Moler, including easter, Fast Fourier Transforms, Fibonacci numbers, the fractal fern, the game of Life, magic matrices, the Mandelbrot set, Morse code, Music, Ordinary Differential Equations, the page rank algorithm, planetary orbits, predator prey equations, the shallow water equations, Sudoku puzzles.
664. exm_test
665. exp_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) whose solution is an exponential function.
666. exp_ode_test
667. faces_average, an Octave code which averages several images of the same face;
668. faces_average_test
669. fair_dice_simulation, an Octave code which simulates N tosses of 2 dice, making a histogram of the resulting sums.
670. fair_dice_simulation_test
671. faure, an Octave code which computes the Faure M dimensional Quasi Mont Carlo (QMC) sequence;
672. faure_test
673. fd_predator_prey, an Octave code which solves a time-dependent predator prey system using the finite difference method (FDM).
674. fd_predator_prey_test
675. fd_to_tec, an Octave code which converts finite difference method (FDM) models into tecplot() ASCII files.
676. fd_to_tec_test
677. fd1d_advection_diffusion_steady, an Octave 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.
678. fd1d_advection_diffusion_steady_test
679. fd1d_advection_ftcs, an Octave 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.
680. fd1d_advection_ftcs_test
681. fd1d_advection_lax, an Octave 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.
682. fd1d_advection_lax_test
683. fd1d_advection_lax_wendroff, an Octave 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.
684. fd1d_advection_lax_wendroff_test
685. fd1d_burgers_lax, an Octave 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.
686. fd1d_burgers_lax_test
687. fd1d_burgers_leap, an Octave 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.
688. fd1d_burgers_leap_test
689. fd1d_bvp, an Octave code which applies the finite difference method (FDM) to a two point boundary value problem (BVP) in one spatial dimension.
690. fd1d_bvp_test
691. fd1d_display, an Octave code which reads a pair of files defining a 1D finite difference method (FDM) of a function, and plots the data.
692. fd1d_display_test
693. fd1d_heat_explicit, an Octave code which implements a finite difference method (FDM), explicit in time, to solve the time dependent 1D heat equation;
694. fd1d_heat_explicit_test
695. fd1d_heat_implicit, an Octave code which implements a finite difference method (FDM), implicit in time, to solve the time dependent 1D heat equation;
696. fd1d_heat_implicit_test
697. fd1d_heat_steady, an Octave code which implements a finite difference method (FDM) for the steady (time independent) 1D heat equation;
698. fd1d_heat_steady_test
699. fd1d_poisson, an Octave code which solves a Poisson equation over a user-specified discretized interval, with given functions f(x) (right hand side) and g(x) (Dirichlet boundary conditions), using the Finite Difference Method (FDM).
700. fd1d_poisson_test
701. fd1d_predator_prey, an Octave code which implements the finite difference method (FDM) for a predator-prey system with time and 1D spatial dependence, by Marcus Garvie.
702. fd1d_predator_prey_test
703. fd1d_predator_prey_plot, an Octave code which plots solutions of the predator prey differential equations, by Marcus Garvie.
704. fd1d_predator_prey_plot_test
705. fd1d_wave, an Octave code which applies the finite difference method (FDM) to solve the time-dependent wave equation utt = c * uxx in one spatial dimension.
706. fd1d_wave_test
707. fd2d_convergence_test, an Octave code which calls fd2d_poisson(), which repeatedly solves a Poisson equation on a sequence of finer meshes, so that the relationship between mesh size H and error norm E can be explored.
708. fd2d_heat_steady, an Octave code which implements a finite difference method (FDM) for the steady (time independent) 2D heat equation;
709. fd2d_heat_steady_test
710. fd2d_poisson, an Octave code which solves a Poisson equation over a user-specified discretized rectangle, with given functions f(x,y) (right hand side) and g(x,y) (Dirichlet boundary conditions), using the Finite Difference Method (FDM).
711. fd2d_poisson_test
712. fd2d_predator_prey, an Octave code which implements a finite difference method (FDM) for a time and 2D space dependent predator-prey system, by Marcus Garvie.
713. fd2d_predator_prey_test
714. fd3d_poisson, an Octave code which solves a Poisson equation over a user-specified discretized 3d block, with given functions f(x,y,z) (right hand side) and g(x,y,z) (Dirichlet boundary conditions), using the Finite Difference Method (FDM).
715. fd3d_poisson_test
716. fem_basis, an Octave code which defines and evaluates finite element method (FEM) basis functions for any degree in an M dimensional simplex (1D interval, 2D triangle, 3D tetrahedron, and higher dimensional generalizations.)
717. fem_basis_test
718. fem_basis_q4_display, an Octave code which displays any single finite element method (FEM) basis function associated with an arbitrary linear quadrilateral Q4 mesh;
719. fem_basis_q4_display_test
720. fem_basis_t3_display, an Octave code which displays a basis function for the finite element method (FEM) associated with an arbitrary 3-node triangle T3 mesh;
721. fem_basis_t3_display_test
722. fem_basis_t4_display, an Octave code which displays a basis function for the finite element method (FEM) associated with an arbitrary 4-node triangle T4 mesh;
723. fem_basis_t4_display_test
724. fem_basis_t6_display, an Octave code which displays a basis function for the finite element method (FEM) associated with an arbitrary 6-node triangle T6 mesh;
725. fem_basis_t6_display_test
726. fem_io, an Octave code which reads or writes FEM files, which describe the nodes, elements, and function values associated with a finite element method (FEM) model;
727. fem_io_test
728. fem_neumann, an Octave code which sets up a time-dependent reaction-diffusion equation in 1D, with Neumann boundary conditions, discretized using the finite element method (FEM).
729. fem_neumann_test
730. fem_to_gmsh, an Octave 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.
731. fem_to_gmsh_test
732. fem_to_medit, an Octave code which reads a set of FEM files defining the node coordinates, boundary nodes, and elements of a finite element mesh, and rewrites the data as a medit() MESH file.
733. fem_to_medit_test
734. fem_to_tec, an Octave code which converts FEM models into tecplot() ASCII files.
735. fem_to_tec_test
736. fem_to_triangle, an Octave code which reads FEM files defining a 2D mesh of triangles, namely a file of node coordinates and a file of elements defined by node indices, and creates a corresponding pair of node and element files for use by Jonathan Shewchuk's triangle() program.
737. fem_to_triangle_test
738. fem_to_xml, an Octave code which reads a pair of FEM files defining node coordinates and elements, of a 1D, 2D or 3D mesh, namely a file of node coordinates and a file of elements defined by node indices, and creates a corresponding XML file for input to dolfin() or fenics().
739. fem_to_xml_test
740. fem1d, an Octave code which applies the finite element method (FEM), using piecewise linear basis functions, to a linear two point boundary value problem (BVP) in 1D;
741. fem1d_test
742. fem1d_adaptive, an Octave code which uses an adaptive mesh when applying the finite element method (FEM), with piecewise linear (PWL) basis functions, to a linear two point boundary value problem (BVP) in 1D;
743. fem1d_adaptive_test
744. fem1d_approximate, an Octave code which uses a given finite element method (FEM) mesh and piecewise linear (PWL) basis functions to approximate a set of data points, while controlling the variation in the derivative.
745. fem1d_approximate_test
746. fem1d_bvp_linear, an Octave code which applies the finite element method (FEM), with piecewise linear (PWL) 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.
747. fem1d_bvp_linear_test
748. fem1d_bvp_quadratic, an Octave code which applies the finite element method (FEM), with piecewise quadratic (PWQ) 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.
749. fem1d_bvp_quadratic_test
750. fem1d_display, an Octave code which reads three files defining a 1D arbitrary degree basis function associated with the finite element method (FEM), and displays a plot.
751. fem1d_display_test
752. fem1d_function_10_display, an Octave code which reads three files defining a 1D piecewise linear finite element method (FEM) function and displays a plot.
753. fem1d_display_function_10_test
754. fem1d_heat_explicit, an Octave code which uses the finite element method (FEM) and explicit time stepping to solve the time dependent heat equation in 1D.
755. fem1d_heat_explicit_test
756. fem1d_heat_implicit, an Octave code which uses the finite element method (FEM) and implicit time stepping to solve the time dependent heat equation in 1D.
757. fem1d_heat_implicit_test
758. fem1d_heat_steady, an Octave code which uses the finite element method (FEM) to solve the steady (time independent) 1D heat equation;
759. fem1d_heat_steady_test
760. fem1d_lagrange, an Octave 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.
761. fem1d_lagrange_test
762. fem1d_nonlinear, an Octave code which applies the finite element method (FEM), with piecewise linear (PWL) basis functions, to a nonlinear two point boundary value problem (BVP) in 1D;
763. fem1d_nonlinear_test
764. fem1d_pack, an Octave code which contains utilities for 1D finite element method (FEM) calculations.
765. fem1d_pack_test
766. fem1d_pmethod, an Octave code which applies the p-method version of the finite element method (FEM) to a linear two point boundary value problem (BVP) in 1D;
767. fem1d_pmethod_test
768. fem1d_project, an Octave 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.
769. fem1d_project_test
770. fem1d_sample, an Octave code which samples a scalar or vector finite element function of one variable, defined by FEM files, returning interpolated values at the sample points.
771. fem1d_sample_test
772. fem2d_bvp_linear, an Octave code which applies the finite element method (FEM), with piecewise linear (PWL) elements, to a 2D boundary value problem (BVP) in a rectangle, and compares the computed and exact solutions with the L2 and seminorm errors.
773. fem2d_bvp_linear_test
774. fem1d_bvp_quadratic, an Octave code which applies the finite element method (FEM), with piecewise quadratic (PWQ) 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.
775. fem1d_bvp_quadratic_test
776. fem2d_bvp_serene, an Octave 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.
777. fem2d_bvp_serene_test
778. fem2d_heat, an Octave code which applies the finite element method (FEM) to the time dependent heat equation on an arbitrary triangulated region in 2D;
779. fem2d_heat_test
780. fem2d_heat_rectangle, an Octave code which applies the finite element method (FEM) for the time-dependent heat equation on a triangulated rectangle in 2D;
781. fem2d_heat_rectangle_test
782. fem2d_heat_sparse, an Octave code which applies the finite element method (FEM) to the heat equation on an arbitrary triangulated region in 2D, using a sparse storage matrix format;
783. fem2d_heat_sparse_test
784. fem2d_mesh_display, an Octave code which reads a FEM model of a 2D mesh of elements of any uniform order and displays a plot of the elements and nodes, with optional numbering.
785. fem2d_mesh_display_test
786. fem2d_pack, an Octave code which performs simple 2D finite element method (FEM) computations;
787. fem2d_pack_test
788. fem2d_poisson_rectangle, an Octave code which solves the 2D Poisson equation on a rectangle, using the finite element method (FEM), and piecewise quadratic triangular elements.
789. fem2d_poisson_rectangle_test
790. fem2d_poisson_rectangle_linear, an Octave code which solves the 2D Poisson equation on a rectangle, using the finite element method (FEM), and piecewise linear triangular elements.
791. fem2d_poisson_rectangle_linear_test
792. fem2d_predator_prey_fast, an Octave code which implements a finite element method (FEM) for a time and 2D space dependent predator-prey system, on an arbitrary triangulated region, with a variety of possible boundary conditions, incorporating some optimizations, by Marcus Garvie.
793. fem2d_predator_prey_fast_test
794. fem2d_project, an Octave code which projects a function f(x,y), given as data, into a given finite element method (FEM) space of piecewise linear triangular elements.
795. fem2d_project_test
796. fem2d_project_function, an Octave code which projects a function f(x,y), given as a formula, into a given finite element method (FEM) space of piecewise linear triangular elements.
797. fem2d_project_function_test
798. fem2d_sample, an Octave code which samples a finite element method (FEM) function, defined by three text files describing the nodes, triangles, and coefficients, at arbitrary points.
799. fem2d_sample_test
800. fem2d_scalar_display, an Octave code which reads information about nodes, elements and nodal values for a 2D finite element method (FEM) and creates a surface plot of U(X,Y).
801. fem2d_scalar_display_test
802. fem2d_scalar_display_brief, an Octave code which reads information about nodes, elements and nodal values for a 2D finite element method (FEM) and creates a surface plot of U(X,Y), in 5 lines of code.
803. fem2d_scalar_display_brief_test
804. fem2d_scalar_display_gpl, an Octave code which reads information about nodes, elements and nodal values for a 2D finite element method (FEM) and creates a GPL file describing a surface plot of U(X,Y), to be displayed by gnuplot().
805. fem2d_scalar_display_gpl_test,
806. fem3d_pack, an Octave code which contains utilities for 3D finite element method (FEM) calculations.
807. fem3d_pack_test
808. fem3d_project, an Octave code which projects a function f(x,y,z), given as a data, into a given space of piecewise linear tetrahedral elements for use in the finite element method (FEM).
809. fem3d_project_test
810. fem3d_sample, an Octave code library which evaluates a function defined on a 3D tetrahedral mesh as part of the finite element method (FEM).
811. fem3d_sample_test
812. fermat_factor, an Octave code which uses Fermat's factorization method to decompose an integer N into the product of two factors, N = A^2-B^2 = (A+B)*(A-B).
813. fermat_factor_test
814. fern, an Octave code which computes and displays the Barnsley fractal fern.
815. fern_test
816. feynman_kac_1d, an Octave code which demonstrates the use of the Feynman-Kac algorithm to solve the Poisson equation in a 1D interval by averaging stochastic paths to the boundary.
817. feynman_kac_1d_test
818. feynman_kac_2d, an Octave code which demonstrates the use of the Feynman-Kac algorithm to solve the Poisson equation in a 2D ellipse by averaging stochastic paths to the boundary.
819. feynman_kac_2d_test
820. feynman_kac_3d, an Octave code which demonstrates the use of the Feynman-Kac algorithm to solve the Poisson equation in a 3D ellipsoid by averaging stochastic paths to the boundary.
821. feynman_kac_3d_test
822. ffmatlib, an Octave code which allows the user to plot finite element method (FEM) results that have been computed by FreeFem++().
823. fft_serial, an Octave code which computes a Fast Fourier Transform (FFT), and is intended as a starting point for implementing a parallel version.
824. fft_serial_test
825. fibonacci_spiral, an Octave code which displays points on a Fibonacci spiral, suggesting the arrangement of seeds in a sunflower, for instance.
826. fibonacci_spiral_test
827. file_increment, an Octave code which increments every entry of an integer array which is stored in a file.
828. file_increment_test
829. file_name_sequence, an Octave 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.
830. file_name_sequence_test
831. files_multiple_test, an Octave code which demonstrates how a program can open multiple output files at one time, and write data to any one specific file it chooses.
832. filon_rule, an Octave code which approximates integrals which include an oscillatory factor of sin(k*x) or cos(k*x).
833. filon_rule_test
834. filum, an Octave code which handles files and filenames;
835. filum_test
836. fire_simulation, an Octave code which simulates a forest fire over a rectangular array of trees, starting at a single random location.
837. fire_simulation_test
838. fisher_exact, an Octave code which returns an exact solution u(x,t) of the Kolmogorov Petrovsky Piskonov Fisher partial differential equation (PDE): ut=uxx+u*(1-u).
839. fisher_exact_test
840. fisher_pde_ftcs, an Octave code which estimates a solution of the Kolmogorov Petrovsky Piskonov Fisher partial differential equation (PDE) ut=uxx+u*(1-u), using the forward time centered space (FTCS) method, with an oscillating Dirichlet condition on the left, and a zero Neumann condition on the right. An animation of the solution is created.
841. fisher_pde_ftcs_test
842. fitzhugh_nagumo_ode, an Octave code which sets up and solves the Fitzhugh-Nagumo system of ordinary differential equations (ODE).
843. fitzhugh_nagumo_ode_test
844. flame_exact, an Octave code which returns the exact solution y(t) of an ordinary differential equation (ODE) which models the growth of a ball of flame in a combustion process. The exact solution is defined in terms of the Lambert W function.
845. flame_exact_test
846. flame_ode, an Octave code which sets up and solves 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.
847. flame_ode_test
848. flies_simulation, an Octave code which simulates an experiment in which two flies land on a plate of radius 1. By repeating the experiment many times, the average distance between the flies is to be estimated.
849. flies_simulation_test
850. floyd, an Octave code which implements the Floyd algorithm for finding the shortest distance between pairs of nodes on a directed graph.
851. floyd_test
852. fly_simulation, an Octave code which simulates an experiment in which a fly lands on a plate of radius 1. By repeating the experiment many times, the average distance of the fly from the center is to be estimated.
853. fly_simulation_test
854. fn, an Octave code which evaluates elementary and special functions using Chebyshev polynomials, including Airy, Bessel I, Bessel J, Bessel K, Bessel Y, beta, confluent hypergeometric, cosine integral, the Dawson integral, digamma (psi), error, exponential integral, gamma, hyperbolic cosine integral, hyperbolic sine integral, incomplete gamma, log gamma, logarithmic integral, Pochhammer, psi, sine integral, Spence;, by Wayne Fullerton.
855. fn_test
856. football_dynamic, an Octave code which uses dynamic programming to count the ways of achieving a given score in football.
857. football_dynamic_test
858. four_fifths, an Octave code which searches for a solution to the problem of finding four fifth powers that sum to a fifth power, that is, integers a, b, c, d and e such that a^5+b^5+c^5+d^5=e^5. Euler conjectured that no solution was possible.
859. four_fifths_test
860. fractal_coastline, an Octave code which uses perturbed Bezier interpolation to create a fractal coastline from a crude outline of a state, country, island, or even any general closed polygonal curve.
861. fractal_coastline_test
862. freefem_msh_io, an Octave code which reads and writes files used by the FreeFem finite element program to store mesh information.
863. freefem_msh_io_test
864. fsolve_test, an Octave code which calls fsolve() which seeks the solution x of one or more nonlinear equations f(x)=0.
865. full_deck_simulation, an Octave code which simulates a process in which a random card is drawn from a deck of 52, and then replaced, continuing until every card has been seen at least once.
866. full_deck_simulation_test
867. gamblers_ruin_simulation, an Octave code which simulates a game in which a gambler never stops playing until all money is lost.
868. gamblers_ruin_simulation_test
869. gauss_seidel, an Octave code which implements the Gauss-Seidel iteration for linear systems.
870. gauss_seidel_test
871. gauss_seidel_poisson_1d, an Octave code which demonstrates how the linear system for a discretized version of the steady 1D Poisson equation can be solved by the Gauss-Seidel iteration.
872. gauss_seidel_poisson_1d_test
873. gauss_seidel_stochastic, an Octave code which uses a stochastic version of the Gauss-Seidel iteration to solve a linear system with a symmetric positive definite (SPD) matrix.
874. gauss_seidel_stochastic_test
875. gaussian, an Octave code which evaluates the Gaussian function and its derivatives.
876. gaussian_test,
877. gaussian_2d, an Octave code which evaluates a general Gaussian function of a 2D argument.
878. gaussian_2d_test,
879. gaussian_prime_spiral, an Octave code which computes a twisting spiral path along the Gaussian primes, and displays a plot of the total trajectory.
880. gaussian_prime_spiral_test
881. ge_to_crs, an Octave code which converts a matrix from General (GE) to Compressed Row Storage (CRS) format.
882. ge_to_crs_test
883. gegenbauer_cc, an Octave code which computes the Gegenbauer weighted integral of a function f(x) using a Clenshaw-Curtis approach.
884. gegenbauer_cc_test
885. gegenbauer_exactness, an Octave code which tests the polynomial exactness of Gauss-Gegenbauer quadrature rules.
886. gegenbauer_exactness_test
887. gegenbauer_polynomial, an Octave code which evaluates the Gegenbauer polynomial and associated functions.
888. gegenbauer_polynomial_test
889. gegenbauer_rule, an Octave code which computes and writes out a Gauss-Gegenbauer quadrature rule of given order.
890. gegenbauer_rule_test
891. gen_hermite_exactness, an Octave code which tests the polynomial exactness of generalized Gauss-Hermite quadrature rules.
892. gen_hermite_exactness_test
893. gen_hermite_rule, an Octave code which computes and writes out a generalized Gauss-Hermite quadrature rule of given order and parameter value.
894. gen_hermite_rule_test
895. gen_laguerre_exactness, an Octave code which tests the polynomial exactness of generalized Gauss-Laguerre quadrature rules.
896. gen_laguerre_exactness_test
897. gen_laguerre_rule, an Octave code which computes and writes out a generalized Gauss-Laguerre quadrature rule of given order and parameter value.
898. gen_laguerre_rule_test
899. geometry, an Octave code which performs geometric calculations in 2, 3 and M dimensional space, including the computation of angles, areas, containment, distances, intersections, lengths, and volumes.
900. geometry_test
901. geompack, an Octave code which computes Delaunay triangulations, Voronoi diagrams, and other information, by Barry Joe.
902. geompack_test
903. gl_fast_rule, an Octave code which carries out the rapid computation of the Kth value and weight of an N point Gauss-Legendre quadrature rule, by Ignace Bogaert.
904. gl_fast_rule_test
905. glomin, an Octave code which finds a global minimum of a scalar function of a scalar variable, without the use of derivative information, by Richard Brent.
906. glomin_test
907. glycolysis_ode, an Octave code which sets up a pair of ordinary differential equations (ODE) that model the biochemical process of glycolysis, for which a limit cycle exists.
908. glycolysis_ode_test
909. gmres, an Octave code which implements the generalized minimum residual (GMRES) method for solving a nonsymmetric sparse linear system A*x=b.
910. gmres_test
911. gmsh_io, an Octave code which reads or writes files created by the gmsh() program for 1D, 2D or 3D meshes used by the finite element method (FEM).
912. gmsh_io_test
913. gmsh_to_fem, an Octave code which reads a mesh data file created by the gmsh() program and writes a pair of node and element files that correspond to the FEM format.
914. gmsh_to_fem_test
915. gnuplot_test, an Octave code which uses gnuplot() to create various kinds of plots.
916. gpl_display, an Octave code which tries to read the data in a typical gnuplot() GPL file, describing a 1D, 2D or 3D curve, or a surface Z(X,Y) defined on a regular grid, a triangular grid, or an irregular quadrilateral grid, displays it in a more attractive way than gnuplot() is capable of.
917. gpl_display_test
918. gradient_descent, an Octave code which uses gradient descent to solve a linear least squares (LLS) problem.
919. gradient_descent_test
920. gram_polynomial, an Octave code which evaluates the Gram polynomials, also known as the discrete Chebyshev polyomials and associated functions.
921. gram_polynomial_test
922. gram_schmidt, an Octave code which implements the Gram-Schmidt process to orthogonalize and normalize a set of vectors.
923. gram_schmidt_test
924. graph_adj, an Octave code which carries out operations on abstract graphs, with undirected edges, described 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.
925. graph_adj_test
926. graph_dist, an Octave code which carries out operations on abstract graphs, defined by undirected edges with an associated distance matrix.
927. graph_dist_test
928. graph_representation, an Octave code which determines various representations of a graph.
929. graph_representation_test
930. graphics_test, an Octave code which graphically displays various kinds of data.
931. gray_scott_pde, an Octave code which solves the partial differential equation (PDE) known as the Gray-Scott reaction diffusion equation, displaying a sequence of solutions as time progresses.
932. gray_scott_pde_test
933. grazing_ode, an Octave code which sets up and solves a pair of ordinary differential equations (ODE) that model the populations of an edible plant, and the herbivore that grazes on it.
934. gray_code_display, an Octave code which computes the Hamming distance tables for both the binary and Gray codes, and displays 3D plots that illustrate how the Gray code does a better job of providing nearby representations for nearby numbers.
935. gray_code_display_test
936. grazing_ode_test
937. grf_display, an Octave code which reads a GRF file defining a mathematical graph and displays an image of it.
938. grf_display_test
939. grf_io, an Octave code which reads or writes a grf file which represents a mathematical graph;
940. grf_io_test
941. grid_display, an Octave code which reads a file of points on a grid or sparse grid, displays the grid and saves the image in a png file;
942. grid_display_test
943. gridlines, an Octave code which gives the user more control over drawing gridlines on a graph than is available through the builtin grid() command.
944. gridlines_test
945. grids_display, an Octave code which reads two files of grids or sparse grids, displaying the first with hollow blue dots, the second with solid red dots.
946. grids_display_test
947. gurobi_solution_read, an Octave code which reads a file created by the optimization package GUROBI, representing the solution of a polyomino tiling problem, and writes out a simple ASCII file to be read by load().
948. gurobi_solution_read_test
949. gyroscope_ode, an Octave code which sets up the ordinary differential equations (ODE) that simulate the angular attitude and rotational speed of a gyroscope.
950. gyroscope_ode_test
951. haar_transform, an Octave code which computes the Haar transform of 1d or 2d data.
952. haar_transform_test
953. halton, an Octave code which computes elements of a Halton Quasi Monte Carlo (QMC) sequence, using a simple interface.
954. halton_test
955. hammersley, an Octave code which computes elements of a Hammersley Quasi Monte Carlo (QMC) sequence, using a simple interface.
956. hammersley_test
957. hamming, an Octave code which implements some simple versions of Hamming codes which detects and correct errors in data.
958. hamming_test
959. hand, an Octave code which carries out some numerical exercises based on data that came from tracing several points on a hand.
960. hand_test
961. hand_area, an Octave code which estimates the area of a curve which outlines a hand.
962. hand_area_test
963. hand_data, an Octave code which creates a data set which is presumably the (x,y) coordinates of points that outline a user's hand which has been pressed to the screen.
964. hand_data_test
965. hand_mesh2d, an Octave code which reads in a set of points which outline a human hand, and calls mesh2d(), which is able to create a fine triangular mesh of the region outlined by the points.
966. hand_mesh2d_test
967. hankel_cholesky, an Octave code which computes the upper Cholesky factor R of a symmetric positive definite (SPD) Hankel matrix H so that H = R' * R.
968. hankel_cholesky_test
969. hankel_inverse, an Octave code which computes the inverse of a Hankel matrix.
970. hankel_inverse_test
971. hankel_spd, an Octave code which computes a lower triangular matrix L which is the Cholesky factor of a symmetric positive definite (SPD) Hankel matrix H, that is, H = L * L'.
972. hankel_spd_test
973. hb_io, an Octave code which reads and writes sparse linear systems stored in the Harwell Boeing (HB) format for sparse matrices.
974. hb_io_test
975. hb_to_mm, an Octave code which converts a sparse matrix from Harwell Boeing (HB) to Matrix Market (MM) format.
976. hb_to_mm_test
977. hb_to_msm, an Octave code which converts a sparse matrix stored in a Harwell Boeing (HB) format to MATLAB sparse matrix (MSM) format;
978. hb_to_msm_test
979. hb_to_st, an Octave code which converts a sparse matrix from Harwell Boeing (HB) format to Sparse Triplet (ST) format.
980. hb_to_st_test
981. heartbeat_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) describing the beating of the heart, as suggested by Zeeman.
982. heartbeat_ode_test
983. heat_transfer_test, an Octave code which plots data from the computation of heat distribution on a metal disk, as computed by FreeFem++() and transferred using the ffmatlib() library.
984. heated_plate, an Octave code which solves the steady state heat equation in a 2D rectangular region, and is intended as a starting point for a parallel version.
985. heated_plate_test
986. hello, an Octave code which prints out "Hello, world!".
987. hello_test
988. helmholtz_exact, an Octave code which evaluates an exact solution z(x,y) for the Helmholtz equation, a sort of eigenvalue version of a partial differential equation (PDE) arising after separation of variables is a applied to the wave equation. This example considers a problem in which z(x,y) represents the vertical deflection of the surface of a vibrating circular membrane such as a drumhead. The Helmholtz equation has the form - del^2 Z = k^2 Z.
989. helmholtz_exact_test
990. henon_heiles_ode, an Octave code which sets up and solves the Henon-Heiles system of ordinary differential equations (ODE) which model the motion of a star around the galactic center.
991. henon_heiles_ode_test
992. henon_orbit, a Octave code which computes the orbit of the Henon map for various sets of initial data.
993. henon_orbit_test
994. hermite_cubic, an Octave code which computes the value, derivatives or integral of a Hermite cubic polynomial, or manipulates an interpolating function made up of piecewise Hermite cubic polynomials.
995. hermite_cubic_test
996. hermite_exactness, an Octave code which tests the polynomial exactness of Gauss-Hermite quadrature rules to estimate the integral of a function with density exp(-x^2) over the interval (-oo,+oo).
997. hermite_exactness_test
998. hermite_integrands, an Octave code which defines test integrands for Hermite integrals with density exp(-x^2) over the interval (-oo,+oo).
999. hermite_integrands_test
1000. hermite_interpolant, an Octave code which computes the Hermite interpolant, a polynomial that matches function values and derivatives.
1001. hermite_interpolant_test
1002. hermite_polynomial, an Octave code which evaluates the physicist's Hermite polynomial, the probabilist's Hermite polynomial, the Hermite function, and related functions.
1003. hermite_polynomial_test
1004. hermite_product_display, an Octave code which displays an image of a function created by the Cartesian product of two Hermite polynomials, such as f(x,y) = h(3,x) * h(1,y).
1005. hermite_product_display_test
1006. hermite_product_polynomial, an Octave code which defines Hermite product polynomials, creating a multivariate polynomial as the product of univariate Hermite polynomials.
1007. hermite_rule, an Octave code which computes and writes out a Gauss-Hermite quadrature rule to estimate the integral of a function with density exp(-x^2) over the interval (-oo,+oo).
1008. hexagon_integrals, an Octave code which returns the exact value of the integral of a monomial over the interior of a hexagon in 2D.
1009. hexagon_integrals_test
1010. hexagon_lyness_rule, an Octave code which computes one of 13 Lyness quadrature rules over the interior of the unit hexagon.
1011. hexagon_lyness_rule_test
1012. hexagon_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of a hexagon in 2D;
1013. hexagon_monte_carlo_test
1014. hexagon_stroud_rule, an Octave code which computes one of four Stroud quadrature rules over the interior of the unit hexagon.
1015. hexagon_stroud_rule_test
1016. hexahedron_jaskowiec_rule, an Octave code which returns a symmetric Jaskowiec quadrature rule for the hexahedron, with exactness up to total degree 21.
1017. hexahedron_jaskowiec_rule_test
1018. hexahedron_witherden_rule, an Octave code which returns a symmetric Witherden quadrature rule for the hexahedron, with exactness up to total degree 11.
1019. hexahedron_witherden_rule_test
1020. high_card_simulation, an Octave 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.
1021. high_card_simulation_test
1022. hilbert_curve, an Octave code which computes the sequence of discrete 2D Hilbert curves whose limit is a space-filling curve.
1023. hilbert_curve_test
1024. hilbert_curve_3d, an Octave code which converts 3D Hilbert curve data between spatial coordinates of a lattice point (x,y,z) and the linear coordinate H which describes the ordering of that point on the curve.
1025. hilbert_curve_3d_test
1026. hilbert_curve_display, an Octave code which plots a 2D Hilbert curve of given order.
1027. hilbert_curve_display_test
1028. histogram_data_2d_sample, an Octave code which demonstrates how to construct a Probability Density Function (PDF) from sample data over a 2D domain, and then to use that PDF to create new samples.
1029. histogram_data_2d_sample_test
1030. histogram_discrete, an Octave code which tries to make a histogram of data without using bins.
1031. histogram_discrete_test
1032. histogram_pdf, an Octave code which creates a histogram plot of a set of data, normalized to estimate the probability density function (PDF).
1033. histogram_pdf_test
1034. histogram_pdf_2d_sample, an Octave code which demonstrates how uniform sampling of a 2D region with respect to some known Probability Density Function (PDF) can be approximated by decomposing the region into rectangles, approximating the PDF by a piecewise constant (PWC) function, constructing a histogram for the CDF, and then sampling.
1035. histogram_pdf_2d_sample_test
1036. histogramize, an Octave code which takes a vector of data and organizes it into a histogram of a given number of bins with given width and range, to be displayed as a bar chart.
1037. histogramize_test
1038. hits, an Octave code which uses the HITS algorithm to assign authority and hub indices to a set of nodes in a directed network.
1039. hits_test
1040. house, an Octave code which includes a line segment outline of a house, and some programs to show how linear transformations affect the shape, by Cleve Moler.
1041. house_test
1042. house_data, an Octave code which returns the coordinates of 11 points which are the vertices of a (degenerate) polygon which has the shape of a house.
1043. house_data_test
1044. human_data, an Octave code which starts with an image of simple outline of a human body, tabulates a sequence of points on the outline, creating numerical data defining the boundary.
1045. human_data_test
1046. human_mesh2d, an Octave code which retrieves data for an outline of a human body, and then uses mesh2d() to triangulate the data to make a mesh of the region.
1047. human_mesh2d_test
1048. humps, an Octave code which evaluates the humps() function, its first and second derivatives and its antiderivative.
1049. humps_test
1050. humps_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) whose solution is a double hump curve.
1051. humps_ode_test
1052. hyper_2f1, an Octave code which evaluates the hypergeometric functions 2F1(a,b,c;x) for real parameters a, b, c and argument x. This function is simply a wrapper for the Gnu Scientific Library function gsl_sf_hyperg_2F1().
1053. hyper_2f1_test
1054. hyperball_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected from the interior of the unit hyperball in M dimensions.
1055. hyperball_distance_test
1056. hyperball_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of the unit hyperball in M dimensions.
1057. hyperball_integrals_test
1058. hyperball_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit ball in M dimensions;
1059. hyperball_monte_carlo_test
1060. hyperball_positive_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected from the interior of the unit positive hyperball in M dimensions.
1061. hyperball_positive_distance_test
1062. hypercube_distance, an Octave code which estimates the expected value of the distance between a pair of points randomly selected in the M-dimensional unit hypercube.
1063. hypercube_distance_test
1064. hypercube_exactness, an Octave code which tests the polynomial exactness of a quadrature rule over the interior of the unit hypercube in M dimensions.
1065. hypercube_exactness_test
1066. hypercube_grid, an Octave code which computes a grid of points over the interior of a hypercube in M dimensions.
1067. hypercube_grid_test
1068. hypercube_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of the unit hypercube in M dimensions.
1069. hypercube_integrals_test
1070. hypercube_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit hypercube in M dimensions.
1071. hypercube_monte_carlo_test
1072. hypercube_surface_distance, an Octave code which estimates the expected value of the distance between a pair of points randomly selected on the surface of the unit hypercube in D dimensions.
1073. hypercube_surface_distance_test
1074. hypersphere, an Octave 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.
1075. hypersphere_test
1076. hypersphere_angle_distance, an Octave code which considers the problem of describing the typical value of the angle between a pair of points randomly selected on the unit hypersphere in M dimensions. Since by symmetry, this will be zero, we instead look at the average of the absolute value of the dot product, and the corresponding angle. In dimension 1, we have average dot product of 1, and angle 0. As the dimension increases, the average dot product rapidly decreases to 0, while the average angle goes to 90 degrees.
1077. hypersphere_angle_distance_test
1078. hypersphere_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected on the surface of the unit hypersphere in M dimensions.
1079. hypersphere_distance_test
1080. hypersphere_integrals, an Octave code which returns the exact value of the integral of any monomial over the surface of the unit hypersphere in M dimensions.
1081. hypersphere_integrals_test
1082. hypersphere_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function on the surface of the unit sphere in M dimensions;
1083. hypersphere_monte_carlo_test
1084. hypersphere_positive_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected on the surface of the unit positive hypersphere in M dimensions.
1085. hypersphere_positive_distance_test
1086. i4lib, an Octave code which contains many utility routines, using single precision integer (I4) arithmetic.
1087. i4lib_test
1088. i4mat_rref2, an Octave code which computes a version of the reduced row echelon form of an integer matrix.
1089. i4mat_rref2_test
1090. image_boundary, an Octave code which reports the pixels which form the boundary between the black and white regions of a simple image.
1091. image_boundary_test
1092. image_contrast, an Octave code which applies image processing techniques to increase the contrast in an image.
1093. image_contrast_test
1094. image_decimate, an Octave code which drops the even rows and columns from an image.
1095. image_decimate_test
1096. image_denoise, an Octave code which applies simple filtering operations to a noisy image.
1097. image_denoise_test
1098. image_diffuse, an Octave code which uses diffusion to smooth out an image.
1099. image_diffuse_test
1100. image_double, an Octave code which doubles the height and width of an image by repeating each row and column.
1101. image_double_test
1102. image_edge, an Octave code which detects edges in an image.
1103. image_edge_test
1104. image_mesh2d, an Octave code which starts with a list of points that bound some region, and calls mesh2d() to create a mesh of the interior.
1105. image_mesh2d_test
1106. image_noise, an Octave code which adds noise to an image.
1107. image_noise_test
1108. image_normalize, an Octave code which reads image data from a file, converts it (if necessary) to grayscale, resizes it to H pixels by W pixels.
1109. image_normalize_test
1110. image_quantization, an Octave code which uses kmeans() to reduce the number of colors or shades of gray in an image.
1111. image_quantization_test
1112. image_rgb_to_gray, an Octave code which makes a grayscale version of an RGB image.
1113. image_rgb_to_gray_test
1114. image_sample, an Octave code which allows the user to specify an image file to be displayed. The user may then use the mouse to select points on the image. The coordinates of each point are saved to a file. Selection ends with a RETURN. An example is supplied, which outlines the boundary of an aneurysm.
1115. image_sample_test
1116. image_threshold, an Octave code which makes a black and white version of a grayscale image by setting all pixels below or above a threshold value to black or white.
1117. image_threshold_test
1118. imshow_numeric, an Octave code which accepts a numeric 2D array and displays it as a grayscale image.
1119. imshow_numeric_test
1120. index, an Octave code which converts an M-dimensional vector index to a one-dimensional vector index; it handles zero and one based indexing schemes, as well as column major and row major conventions.
1121. index_test
1122. insurance_simulation, an Octave code which simulates a highly simplified model of term life insurance, in which a customer agrees to pay an annual fee for a given number of years, so that if the customer dies within that term, the family receives a large payout.
1123. insurance_simulation_test
1124. interp, an Octave code which parameterizes and interpolates data;
1125. interp_test
1126. interp_chebyshev, a Octave code which interactively uses n Chebyshev spaced nodes in the interval [a,b] to interpolate a function f(x) with a polynomial.
1127. interp_chebyshev_test
1128. interp_equal, a Octave code which interactively uses n equally spaced nodes in the interval [a,b] to interpolate a function f(x) with a polynomial.
1129. interp_equal_test
1130. interp_ncs, a Octave code which interactively constructs a natural cubic spline (NCS) interpolant to a function f(x), using the 'zero second derivative' end condition.
1131. interp_ncs_test
1132. interp_spline, a Octave code which interactively constructs a cubic spline interpolant to a function f(x), using the 'not-a-knot' end condition.
1133. interp_spline_test
1134. interp_spline_data, a Octave code which interactively constructs a cubic spline interpolant to (x,y) data, using the 'not-a-knot' end condition.
1135. interp_spline_data_test
1136. interp_trig, a Octave code which interactively uses n equally spaced nodes in the interval [a,b] to interpolate a function f(x) with a trigonometric polynomial.
1137. interp_trig_test
1138. iplot, a Octave code which interactively plots a function f(x) over a domain a ≤ x ≤ b;
1139. iplot_test
1140. is_gaussian_prime, an Octave code which is true if a given complex number c is a Gaussian prime.
1141. is_gaussian_prime_test
1142. is_prime, an Octave code which implements various versions of the sieve of Eratosthenes to determine whether a given integer is prime.
1143. is_prime_test
1144. isbn, an Octave code which determines the check digit for an International Standard Book Number (ISBN) or reports whether a given ISBN is valid.
1145. isbn_test
1146. ising_2d_simulation, an Octave code which simulates the evolution of a 2D array of positive and negative charges, each of which is likely to flip to be in agreement with neighbors.
1147. ising_2d_simulation_test
1148. jaccard_distance, an Octave code which computes the Jaccard distance between two sets.
1149. jaccard_distance_test
1150. jacobi, an Octave code which implements the Jacobi iteration for the iterative solution of linear systems.
1151. jacobi_test
1152. jacobi_eigenvalue, an Octave code which implements the Jacobi iteration for the iterative determination of the eigenvalues and eigenvectors of a real symmetric matrix.
1153. jacobi_eigenvalue_test
1154. jacobi_exactness, an Octave code which tests the polynomial exactness of rules for integrals with a Jacobi weight function.
1155. jacobi_exactness_test
1156. jacobi_poisson_1d, an Octave code which uses Jacobi iteration to solve the linear system for a discretized steady 1D Poisson equation.
1157. jacobi_poisson_1d_test
1158. jacobi_polynomial, an Octave code which evaluates the Jacobi polynomial and associated functions.
1159. jacobi_polynomial_test
1160. jacobi_rule, an Octave code which computes and writes out a Gauss-Jacobi quadrature rule of given order.
1161. jacobi_rule_test
1162. jai_alai_simulation, an Octave code which simulates matches of jai alai.
1163. jai_alai_simulation_test
1164. jordan_matrix, an Octave code which returns a random matrix in Jordan canonical form.
1165. jordan_matrix_test
1166. julia_set, an Octave code which computes and plots a Julia set, the set of points in the complex plane that remain bounded under a mapping of the form f(z) = z^2+c.
1167. julia_set_test
1168. kdv_etdrk4, an Octave code which uses the ETDRK4 method to solve the Korteweg-deVries (KdV) partial differential equation (PDE), by Aly-Khan Kassam, Lloyd Trefethen.
1169. kdv_etdrk4_test
1170. kdv_exact, an Octave code which evaluates an exact solution u(x,t) of the Korteweg-deVries (KdV) partial differential equation (PDE), representing the motion of a soliton. The equation has the form u' - 6 u ux + uxxx = 0.
1171. kdv_exact_test
1172. kdv_ift, an Octave code which uses the Inverse Fourier Transform (IFT) method to solve the Korteweg-deVries (KdV) partial differential equation (PDE), by Aly-Khan Kassam, Lloyd Trefethen.
1173. kdv_ift_test
1174. kelley, an Octave code which implements iterative methods for linear and nonlinear problems, including Arnoldi iteration, Broyden's method, conjugate gradient, GMRES, Krylov iteration, Newton-Krylov nonlinear solver, line search for minimization, transpose-free quasi-minimal residual solver for sparse linear systems, by Tim Kelley.
1175. kelley_test
1176. kepler_ode, an Octave code which sets up and solves the ordinary differential equations (ODE) for a Kepler two-body gravitational system.
1177. kepler_ode_test
1178. kepler_perturbed_ode, an Octave code which sets up and solves the ordinary differential equations (ODE) for a perturbed Kepler two-body gravitational system.
1179. kepler_perturbed_ode_test
1180. keyword_test, an Octave code which accepts named keywords, using the Name/Value paired argument convention.
1181. kmeans, an Octave code which handles the K-Means problem, which organizes a set of N points in M dimensions into K clusters;
1182. kmeans_test
1183. kmeans_fast, an Octave code which contains several different algorithms for the K-Means problem, which organizes a set of N points in M dimensions into K clusters, by Charles Elkan.
1184. kmeans_fast_test
1185. knapsack_01_brute, an Octave 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;
1186. knapsack_01_brute_test
1187. knapsack_brute, an Octave 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.
1188. knapsack_brute_test
1189. knapsack_dynamic, an Octave code which uses dynamic programming to solve a knapsack problem.
1190. knapsack_dynamic_test
1191. knapsack_greedy, an Octave code which uses a greedy algorithm to estimate a solution of the knapsack problem;
1192. knapsack_greedy_test
1193. knapsack_random, an Octave 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.
1194. knapsack_random_test
1195. knapsack_rational, an Octave code which solves the rational knapsack problem, in which a knapsack of limited weight capacity is filled with profitable items. This variation of the knapsack problem allows a fractional part of an item to be included in the knapsack. The result is an upper bound on the maximum possible profit for the knapsack problem.
1196. knapsack_rational_test
1197. knapsack_values, an Octave 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.
1198. knapsack_values_test
1199. kronrod_rule, an Octave code which computes a Gauss and Gauss-Kronrod pair of quadrature rules of arbitrary order, by Robert Piessens, Maria Branders.
1200. kronrod_rule_test
1201. kursiv_pde_etdrk4, an Octave code which uses the exponential time differencing (ETD) RK4 method to solve the Kuratomo-Sivashinsky PDE as a system of stiff ordinary differential equations (ODE), by Aly-Khan Kassam, Lloyd Trefethen.
1202. kursiv_pde_etdrk4_test
1203. l4lib, an Octave code which contains functions for working with logical variables.
1204. l4lib_test
1205. lagrange_approx_1d, an Octave code which defines and evaluates the Lagrange polynomial p(x) of degree m which approximates a set of nd data points (x(i),y(i)).
1206. lagrange_approx_1d_test
1207. lagrange_basis_display, an Octave code which displays the basis functions associated with a given set of nodes used with the Lagrange interpolation scheme.
1208. lagrange_basis_display_test
1209. lagrange_interp_1d, an Octave code which defines and evaluates the Lagrange polynomial p(x) which interpolates a set of data depending on a 1D argument, so that p(x(i)) = y(i).
1210. lagrange_interp_1d_test
1211. lagrange_interp_2d, an Octave code which defines and evaluates the Lagrange polynomial p(x,y) which interpolates a set of data depending on a 2D argument that was evaluated on a product grid, so that p(x(i),y(j)) = z(i,j).
1212. lagrange_interp_2d_test
1213. lagrange_interp_nd, an Octave code which defines and evaluates the Lagrange polynomial p(x) which interpolates a set of data depending on an M dimensional argument that was evaluated on a product grid, so that p(x(i)) = z(i).
1214. lagrange_interp_nd_test
1215. lagrange_nd, an Octave code which implements several multivariate Lagrange interpolation schemes developed by Tomas Sauer.
1216. lagrange_nd_test
1217. laguerre_exactness, an Octave code which tests the polynomial exactness of Gauss-Laguerre quadrature rules for integrating functions with density exp(-x) over [0,+oo).
1218. laguerre_exactness_test
1219. laguerre_integrands, an Octave code which implements test problems for approximate integration over a semi-infinite interval, often carried out using Gauss-Laguerre quadrature.
1220. laguerre_integrands_test
1221. laguerre_polynomial, an Octave code which evaluates the Laguerre polynomial, the generalized Laguerre polynomials, and the Laguerre function.
1222. laguerre_polynomial_test
1223. laguerre_product, an Octave code which computes weighted integrals of products of Laguerre polynomials.
1224. laguerre_product_test
1225. laguerre_rule, an Octave code which computes and prints a Gauss-Laguerre quadrature rule of a given order for estimating the integral of a function with density exp(-x) over the interval [0,+oo).
1226. laguerre_rule_test
1227. lambert_w, an Octave code which evaluates Lambert's W function.
1228. lambert_w_test
1229. langford_ode, an Octave code which sets up and solves the Langford system of ordinary differential equations (ODE).
1230. langford_ode_test
1231. laplace_periodic_test, an Octave code which plots data from the solution of the Laplace equation in a square with periodic boundary conditions, computed by FreeFem++() and transferred using the ffmatlib() library.
1232. laplace_radial_exact, an Octave code which evaluates exact solutions u(x,y) or u(x,y,z), with radial symmetry, to the Laplace equation: del^2 U = 0.
1233. laplace_radial_exact_test
1234. laplacian, an Octave code which evaluates a discretized approximation to the Laplacian operator on data on an evenly spaced grid, within a circle, an interval, or a torus. For the case of the interval, the data may be supplied on an unevenly spaced grid.
1235. laplacian_test
1236. laplacian_matrix, an Octave code which carries out computations related to the discrete Laplacian operator, including full or sparse evaluation, evaluation for unequally spaced data sampling points, application to a set of data samples, solution of associated linear systems, eigenvalues and eigenvectors, and extension to 2D and 3D geometry.
1237. laplacian_matrix_test
1238. latin_center, an Octave code which computes N points in an M dimensional Latin Center square;
1239. latin_center_test
1240. latin_cover, an Octave code which produces N Latin squares which cover an NxN square, or NxN Latin cubes which cover an NxNxN cube.
1241. latin_cover_test
1242. latin_edge, an Octave code which returns N points in an M dimensional Latin Edge square;
1243. latin_edge_test
1244. latin_random, an Octave code which returns N points in an M dimensional Latin Random square;
1245. latin_random_test
1246. latinize, an Octave code which adjusts N points in M dimensions to form a Latin hypercube;
1247. latinize_test
1248. lattice_rule, an Octave code which returns lattice rules for M dimensional integration;
1249. lattice_rule_test
1250. leapfrog, an Octave code which uses the leapfrog method to solve a second order ordinary differential equation (ODE) of the form y''=f(t,y).
1251. leapfrog_test
1252. least_squares_approximant, an Octave code which finds a polynomial approximant to data using linear least squares (LLS).
1253. least_squares_approximant_test
1254. lebesgue, an Octave code which is given nodes in 1D, plots the Lebesgue function, and estimates the Lebesgue constant, which measures the maximum magnitude of the potential error of Lagrange polynomial interpolation.
1255. lebesgue_test
1256. legendre_exactness, an Octave code which tests the monomial exactness of quadrature rules for the Legendre problem of integrating a function with density 1 over the interval [-1,+1].
1257. legendre_exactness_test
1258. legendre_fast_rule, an Octave code which uses a fast (order N) algorithm to compute a Gauss-Legendre quadrature rule of given order.
1259. legendre_fast_rule_test
1260. legendre_polynomial, an Octave code which evaluates the Legendre polynomial and associated functions.
1261. legendre_polynomial_test
1262. legendre_product, an Octave code which computes weighted integrals of products of Legendre polynomials.
1263. legendre_product_test
1264. legendre_product_display, an Octave code which displays the points used in a 2D Gauss-Legendre quadrature rule;
1265. legendre_product_display_test
1266. legendre_product_polynomial, an Octave code which defines Legendre product polynomials, creating a multivariate polynomial as the product of univariate Legendre polynomials.
1267. legendre_product_polynomial_test
1268. legendre_rule, an Octave code which writes out a Gauss-Legendre quadrature rule of given order.
1269. legendre_rule_test
1270. legendre_shifted_polynomial, an Octave code which evaluates the shifted Legendre polynomial, with the domain [0,1].
1271. legendre_shifted_polynomial_test
1272. levels, an Octave code which makes a contour plot, choosing the contour levels using random sampling.
1273. levels_test
1274. levenshtein_distance, an Octave code which returns the Levenshtein distance between two strings.
1275. levenshtein_distance_test
1276. levenshtein_matrix, an Octave code which returns the Levenshtein distance matrix defined by two strings.
1277. levenshtein_matrix_test
1278. life, an Octave code which computes a few steps of the evolution of John Conway's Game of Life, intended as a starting point for implementing a parallel version.
1279. life_test
1280. lights_out_game, an Octave code which sets up the "Lights Out" game, lighting up a few squares on a grid. An interactive user must then try to press squares in such a way that all the lights are turned off.
1281. lindberg_exact, an Octave code which evaluates the exact solution y(t) of the Lindberg ordinary differential equation (ODE), a system that is extremely difficult to solve accurately.
1282. lindberg_exact_test
1283. lindberg_ode, an Octave code which sets up and solves a system of 4 ordinary differential equations (ODE) which are very stiff.
1284. lindberg_ode_test
1285. line_cvt_lloyd, an Octave code which applies the Lloyd iteration repeatedly to a set of N points, to compute a Centroidal Voronoi Tessellation (CVT) over the interior of a line segment in 1D.
1286. line_cvt_lloyd_test
1287. line_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected in the unit line segment.
1288. line_distance_test
1289. line_fekete_rule, an Octave code which estimates the location of N Fekete points, for polynomial interpolation or quadrature, over the interior of a line segment in 1D.
1290. line_fekete_rule_test
1291. line_felippa_rule, an Octave code which returns a Felippa quadrature rules for approximating integrals over the interior of a line segment in 1D.
1292. line_felippa_rule_test
1293. line_grid, an Octave code which computes a grid of points over the interior of a line segment in 1D.
1294. line_grid_test
1295. line_integrals, an Octave code which returns the exact value of the integral of any monomial over the length of the unit line in 1D.
1296. line_integrals_test
1297. line_lines_packing, an Octave code which tries to randomly pack as many non-overlapping equal line segments as possible into a larger line segment, estimating Renyi's parking constant of 0.7475979202. This is an example of random sequential adsorption (RSA).
1298. line_lines_packing_test
1299. line_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the length of the unit line in 1D.
1300. line_monte_carlo_test
1301. line_ncc_rule, an Octave code which computes a Newton Cotes Closed (NCC) quadrature rule, using equally spaced points, over the interior of a line segment in 1D.
1302. line_ncc_rule_test
1303. line_nco_rule, an Octave code which computes a Newton Cotes Open (NCO) quadrature rule, using equally spaced points, over the interior of a line segment in 1D.
1304. line_nco_rule_test
1305. linear_algebra, an Octave code which carries out various linear algebra operations for matrices stored in a variety of formats.
1306. linpack_bench, an Octave code which carries out the LINPACK Benchmark, which measures the time required to factor and solve a large linear system.
1307. linpack_bench_test
1308. linpack_bench_backslash, an Octave code which is a version of the LINPACK benchmark using the backslash linear system solver;
1309. linpack_bench_backslash_test
1310. linpack_d, an Octave code which factors and solves linear systems using real 64 bit arithmetic, by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart. The matrix and vector data is assumed to be real.
1311. linpack_d_test
1312. linpack_z, an Octave code which factors and solves linear systems using complex 64 bit arithmetic, by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart. The matrix and vector data is assumed to be complex.
1313. linpack_z_test
1314. lissajous, an Octave code which plots a Lissajous figure, of the form x = sin ( a1 t + b1 ), y = sin ( a2 t + b2 ).
1315. lissajous_test
1316. llsq, an Octave code which solves the linear least squares (LLS) problem. It finds the best straight line to match a set of data points. More precisely, it finds the quantities a and b defining the straight line y=a*x+b, which minimizes the root-mean-square (RMS) error to the data.
1317. llsq_test
1318. load_test, an Octave code which calls the load() function, which reads data from a file into a variable.
1319. lobatto_polynomial, an Octave code which evaluates Lobatto polynomials similar to Legendre polynomials except that they are 0 at both endpoints.
1320. lobatto_polynomial_test
1321. local_min, an Octave code which finds a local minimum of a scalar function of a scalar variable, without the use of derivative information, by Richard Brent.
1322. local_min_test
1323. local_min_rc, an Octave 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.
1324. local_min_rc_test
1325. locker_simulation, an Octave code which simulates the locker problem, in which gym users have left their wallets in lockers; someone has scrambled all the lockers, and the gym users need a strategy that maximizes the chance that everyone will find their wallet by searching a limited number of lockers.
1326. locker_simulation_test
1327. log_norm, an Octave code which computes the logarithmic norm of a matrix, for norms 1, 2 and oo.
1328. log_norm_test
1329. log_normal, an Octave code which returns quantities related to the log normal Probability Distribution Function (PDF).
1330. log_normal_test
1331. log_normal_truncated_ab, an Octave code which returns quantities related to the log normal Probability Distribution Function (PDF) truncated to the interval [a,b].
1332. log_normal_truncated_ab_test
1333. logistic_bifurcation, an Octave code which plots the bifurcation diagram for the logistic equation, by John D Cook.
1334. logistic_bifurcation_test
1335. logistic_exact, an Octave code which evaluates an exact solution y(t) of the logistic equation, which models population growth in the face of a limited carrying capacity, an ordinary differential equation (ODE) of the y' = r * ( y - y^2 / k ).
1336. logistic_exact_test
1337. logistic_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) which models population growth in the face of a limited carrying capacity.
1338. logistic_ode_test
1339. lorenz_ode, an Octave code which sets up and solves the Lorenz system of ordinary differential equations (ODE).
1340. lorenz_ode_test
1341. luhn, an Octave code which computes the Luhn check digit for a string, and validates a string.
1342. luhn_test
1343. machar, an Octave code which computes the appropriate values of arithmetic constants for a given machine, by William Cody.
1344. machar_test
1345. machine, an Octave code which returns values of arithmetic constants for a given machine.
1346. machine_test
1347. magic_matrix, an Octave code which computes a magic matrix, for any odd order n, such that all rows, columns, the diagonal and antidiagonal have the same sum.
1348. magic_matrix_test
1349. magic4_matrix, an Octave code which computes an nxn magic matrix, where n is a multiple of 4, such that all rows, columns, the diagonal and antidiagonal have the same sum.
1350. magic4_matrix_test
1351. mandelbrot, an Octave code which generates an image of the Mandelbrot set;
1352. mandelbrot_test
1353. mandelbrot_orbit, an Octave code which generates the Mandelbrot iterates arising from a single starting point;
1354. mandelbrot_orbit_test
1355. maple_area, an Octave code which takes the list of pixels that form the boundary of the image of a maple leaf within a picture, and uses grid, Monte Carlo, and Quasi Monte Carlo (QMC) sampling to estimate the area of the leaf.
1356. maple_area_test
1357. maple_data, an Octave code which reads an image of a maple leaf and extracts the list of pixels that form the boundary.
1358. maple_data_test
1359. mario, an Octave code which creates a sort of needlepoint image of Mario, as an array of colored squares.
1360. mario_test
1361. markov_letters, an Octave code which counts the occurences of letter pairs in a text.
1362. markov_letters_test
1363. matrix_analyze, an Octave code which reports whether a matrix has various properties.
1364. matrix_analyze_test
1365. matrix_chain_brute, an Octave code which finds the cost of the most efficient ordering to use when multiplying a sequence of matrices, using brute force.
1366. matrix_chain_brute_test
1367. matrix_chain_dynamic, an Octave code which finds the cost of the most efficient ordering to use when multiplying a sequence of matrices, using dynamic programming..
1368. matrix_chain_dynamic_test
1369. matrix_exponential, an Octave code which computes the exponential of a matrix.
1370. matrix_exponential_test
1371. mcnuggets, an Octave code which counts M(N), the number of ways a given number N of Chicken McNuggets can be assembled, given that they are only available in packages of 6, 9, and 20.
1372. mcnuggets_test
1373. mcnuggets_diophantine, an Octave code which uses Diophantine methods to find the ways a given number N of Chicken McNuggets can be assembled, given that they are only available in packages of 6, 9, and 20.
1374. mcnuggets_diophantine_test
1375. md, an Octave code which carries out a molecular dynamics simulation, and is intended as a starting point for implementing a parallel version.
1376. md_test
1377. md_fast, an Octave code which carries out a molecular dynamics simulation; it is a version of md() that has been revised to take advantage of vectorization.
1378. md_fast_test
1379. medit_mesh_io, an Octave code which reads or writes medit() MESH files defining a finite element mesh.
1380. medit_mesh_io_test
1381. medit_to_fem, an Octave code which reads a medit() MESH file and writes a corresponding pair of node and element files that correspond to the FEM format.
1382. medit_to_fem_test
1383. memory, an Octave code which declares and uses a sequence of larger and larger arrays, to see what the memory limits are on a given computer.
1384. memory_test
1385. mesh_bandwidth, an Octave code which returns the geometric bandwidth associated with a mesh of elements of any order and in a space of M dimensions.
1386. mesh_bandwidth_test
1387. mesh_boundary, an Octave code which is given a mesh of a 2D region, formed by polygonal elements, and determines a sequence of pairs of polygonal vertices that define the boundary of the region.
1388. mesh_boundary_test
1389. mesh_display, an Octave code which plots the nodes and elements of a polygonal mesh, with optional numbering.
1390. mesh_display_test
1391. mesh_etoe, an Octave code which uses ETOV, the mesh element-to-vertex connectivity, to construct ETOE, the element-to-element connectivity.
1392. mesh_etoe_test
1393. mesh_vtoe, an Octave code which uses ETOV, the mesh element-to-vertex connectivity, to construct VTOE, the vertex-to-element connectivity.
1394. mesh_vtoe_test
1395. mesh2d, an Octave code which automatically creates a triangular mesh for a given polygonal region, by Darren Engwirda.
1396. mesh2d_test
1397. mesh2d_to_medit, an Octave code which accepts the nodes and triangles of a mesh created by mesh2d() and creates a corresponding medit() MESH file.
1398. mesh2d_to_medit_test
1399. mesh2d_write, an Octave code which writes mesh2d() node and element data to files.
1400. mesh2d_write_test
1401. mgmres, an Octave 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.
1402. mgmres_test
1403. mgs, an Octave 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.
1404. mgs_test
1405. mhd_exact, an Octave code which evaluates Hartmann's exact formula for a velocity/pressure/magnetic field solution (u,v), p, (b1,b2) of the partial differential equations (PDE) for steady magnetohydrodynamic (MHD) fluid flow in a 2D rectangular channel.
1406. mhd_exact_test
1407. middle_square, an Octave 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.
1408. middle_square_test
1409. midpoint, an Octave code which solves one or more ordinary differential equations (ODE) using the (implicit) midpoint method.
1410. midpoint_test
1411. midpoint_adaptive, an Octave 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.
1412. midpoint_adaptive_test
1413. midpoint_explicit, an Octave code which solves one or more ordinary differential equations (ODE) using the (explicit) midpoint method, also called the modified Euler method.
1414. midpoint_explicit_test
1415. midpoint_fixed, an Octave code which solves one or more ordinary differential equations (ODE) using the (implicit) midpoint method, using a simple fixed-point iteration to solve the implicit equation.
1416. midpoint_fixed_test
1417. minimal_surface_exact, an Octave code which evaluates exact solutions u(x,y) to the minimal surface equation: (1+Ux^2) Uyy - 2 Ux Uy Uxy + (1+Uy^2) Uxx = 0
1418. minimal_surface_exact_test
1419. mm_io, an Octave code which reads and writes sparse linear systems stored in the Matrix Market (MM) format.
1420. mm_io_test
1421. mm_to_hb, an Octave code which reads the sparse matrix information from an Matrix Market (MM) file and writes a corresponding Harwell Boeing (HB) file.
1422. mm_to_hb_test
1423. mm_to_msm, an Octave code which reads a Matrix Market (MM) file defining a sparse matrix, and creates a corresponding matrix in MATLAB sparse matrix (MSM) format.
1424. mm_to_msm_test
1425. mm_to_st, an Octave code which reads the sparse matrix information from a Matrix Market (MM) file and writes a corresponding Sparse Triplet (ST) file.
1426. mm_to_st_test
1427. monoalphabetic, an Octave code which applies a monoalphabetic substitution cipher to a string of text.
1428. monoalphabetic_test
1429. monomial, an Octave 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.
1430. monomial_test
1431. monomial_symmetrize, an Octave code which symmetrizes the coefficients of equivalent monomials in a polynomial.
1432. monomial_symmetrize_test
1433. monomial_value, an Octave code which evaluates a monomial in M dimensions.
1434. monomial_value_test
1435. monopoly_matrix, an Octave code which computes the adjacency and transition matrices for the game of Monopoly.
1436. monopoly_matrix_test
1437. monty_hall_simulation, an Octave code which simulates the Let's Make a Deal game in which Monty Hall has hidden a prize behind one of several doors, and the user wins the prize if the correct door is selected.
1438. monty_hall_simulation_test
1439. mortality, an Octave code which processes some sample mortality data.
1440. mortality_test
1441. msm_to_hb, an Octave code which writes a MATLAB sparse matrix (MSM) to a Harwell Boeing (HB) file;
1442. msm_to_hb_test
1443. msm_to_mm, an Octave code which writes a MATLAB sparse matrix (MSM) to a Matrix Market (MM) file;
1444. msm_to_mm_test
1445. msm_to_st, an Octave code which writes a MATLAB sparse matrix (MSM) to a Sparse Triplet (ST) file;
1446. msm_to_st_test
1447. mxm, an Octave code which sets up a matrix multiplication problem A=B*C of arbitrary size, and compares the time required for IJK, IKJ, JIK, JKI, KIJ and KJI orderings of the loops.
1448. mxm_test
1449. naca, an Octave code which takes the parameters of certain NACA airfoils and returns the coordinates of a sequence of points that outline the wing shape. The shape can be displayed graphically.
1450. naca_test
1451. nas, an Octave code which runs the NASA kernel benchmark.
1452. nas_test
1453. navier_stokes_2d_exact, an Octave code which evaluates an exact solution to the incompressible time-dependent Navier-Stokes equations (NSE) over an arbitrary domain in 2D.
1454. navier_stokes_2d_exact_test
1455. navier_stokes_3d_exact, an Octave code which evaluates an exact solution to the incompressible time-dependent Navier-Stokes equations (NSE) over an arbitrary domain in 3D.
1456. navier_stokes_3d_exact_test
1457. navier_stokes_mesh2d, an Octave code which handles meshes for several 2D test problems involving the Navier Stokes equations (NSE) for fluid flow, provided by Leo Rebholz.
1458. navier_stokes_mesh2d_test
1459. navier_stokes_mesh3d, an Octave code which handles meshes for several 3D test problems involving the Navier Stokes equations (NSE) for fluid flow, provided by Leo Rebholz.
1460. navier_stokes_mesh3d_test
1461. ncm, an Octave code which accompanies the textbook "Numerical Computing with MATLAB", by Cleve Moler, and illustrates algorithms for the 3n+1 problem, blackjack, eigenvalue computations, fast Fourier transforms, Fibonacci numbers, file encryption, the flame differential equation, the fractal fern, the Lorenz differential equation, a membrane partial differential equation, minimization of a scalar function, ordinary differential equations, the pendulum differential equation, piecewise cubic Hermite interpolation, polynomial interpolation, quadrature for approximate integration, random number generation, tridiagonal linear system solution, the singular value decomposition, solution of a nonlinear equation.
1462. ncm_test
1463. nearest_interp_1d, an Octave code which interpolates a set of data using a piecewise constant (PWC) interpolant defined by the nearest neighbor criterion.
1464. nearest_interp_1d_test
1465. nearest_neighbor, an Octave code which is given two sets of M-dimensional points R and S; For each point in S, it finds the closest point in R. The code is by Richard Brown.
1466. nearest_neighbor_test
1467. neighbor_risk, an Octave code which records information about neighboring pairs of territories in the game of RISK.
1468. neighbor_risk_test
1469. neighbor_states, an Octave code which records information about pairs of US states which are neighbors.
1470. neighbor_states_test
1471. neighbors_to_metis_graph, an Octave 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();
1472. neighbors_to_metis_graph_test
1473. nested_sequence_display, an Octave code which displays nested sequences.
1474. nested_sequence_display_test
1475. neural_network, an Octave code which illustrates the use of neural networks for deep learning, using back propagation and stochastic gradient descent, by Catherine Higham and Desmond Higham.
1476. neural_network_test
1477. newton_interp_1d, an Octave code which finds a polynomial interpolant to data using Newton divided differences.
1478. newton_interp_1d_test
1479. newton_rc, an Octave code which solves a system of nonlinear equations by Newton's method, using reverse communication (RC).
1480. newton_rc_test
1481. niederreiter2, an Octave code which computes the Niederreiter M dimensional Quasi Mont Carlo (QMC) sequence, base 2;
1482. niederreiter2_test
1483. nint_exactness_mixed, an Octave code which measures the exactness of an M-dimensional quadrature rule based on a mixture of 1D quadrature rule factors.
1484. nint_exactness_mixed_test
1485. nintlib, an Octave code which implements approximate integration (quadrature) in M dimensions;
1486. nintlib_test
1487. nonlin_bisect, a Octave code which interactively uses bisection to seek a zero of a function f(x) within a domain a ≤ x ≤ b;
1488. nonlin_bisect_test
1489. nonlin_fixed_point, a Octave code which interactively uses fixed point iteration x=g(x) to seek a zero of a function f(x) given a starting point x0 and iterations it;
1490. nonlin_fixed_point_test
1491. nonlin_newton, a Octave code which interactively uses the Newton method to find the zero of a function, given formulas for f(x), f'(x), and a starting point.
1492. nonlin_newton_test
1493. nonlin_regula, a Octave code which interactively uses the regula falsi method to seek a zero of a function f(x) within a change of sign interval [a,b];
1494. nonlin_regula_test
1495. nonlin_secant, a Octave code which interactively uses the secant method to seek a zero of a function f(x) given two starting estimates a and b.
1496. nonlin_secant_test
1497. nonlin_snyder, a Octave code which interactively uses the Snyder method to seek a zero of a function f(x) within a change of sign interval [a,b];
1498. nonlin_snyder_test
1499. norm_l1, a Octave code which interactively estimates the L1 norm of a function over an interval [A,B], with the function entered as a string.
1500. norm_l1_test
1501. norm_l2, a Octave code which interactively estimates the L2 norm of a function over an interval [A,B], with the function entered as a string.
1502. norm_l2_test
1503. norm_loo, a Octave code which interactively estimates the L-infinity norm of a function over an interval [A,B], with the function entered as a string.
1504. norm_loo_test
1505. norm_rms, a Octave code which interactively estimates the root mean square (RMS) norm of a function over an interval [A,B], with the function entered as a string.
1506. norm_rms_test
1507. normal, an Octave code which implements normal random number generators (RNG) for real and complex arithmetic, for scalars, vectors, and matrices.
1508. normal_test
1509. normal_dataset, an Octave code which creates a multivariate normal random dataset and writes it to a file.
1510. normal_dataset_test
1511. normal_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) defining the normal probability density function (PDF).
1512. normal_ode_test
1513. normal01_multivariate_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected from an isotropic standard normal distribution in M dimensions.
1514. normal01_multivariate_distance_test
1515. numgrid, an Octave code which defines and numbers a subset of the nodes in a regular nxn grid of the [-1,+1]x[-1,+1] unit square.
1516. numgrid_test
1517. obj_display, an Octave code which displays an OBJ 3D graphics file;
1518. obj_display_test
1519. obj_io, an Octave code which reads and writes the data in an OBJ 3D graphics file;
1520. obj_io_test
1521. obj_to_tri_surface, an Octave code which reads an OBJ 3D graphics file and extracts the surface mesh data as a TRI_SURFACE dataset.
1522. obj_to_tri_surface_test
1523. octave_combinatorics, an Octave code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.
1524. octave_distance, an Octave code which estimates the typical distance between a pair of points randomly selected from the surface or interior of a geometric object such as a circle, disk, sphere, cube.
1525. octave_exact, an Octave code which evaluates exact solutions to a few selected examples of ordinary differential equations (ODE) and partial differential equations (PDE).
1526. octave_grid, an Octave code which generates a regular grid of points inside a variety of regions in one, two, three or many dimensions.
1527. octave_integrals, an Octave code which returns the exact value of the integral of any monomial over the surface or interior of some geometric object, including a line, quadrilateral, box, circle, disk, sphere, ball and others.
1528. octave_monte_carlo, an Octave code which uses Monte Carlo sampling to estimate areas and integrals.
1529. octave_ode, an Octave code which sets up various systems of ordinary differential equations (ODE).
1530. octave_ode_solver, an Octave 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.
1531. octave_plots, an Octave code which uses plotting to illustrate a mathematical structure, such as an iterative map, a fractal, a curve or surface.
1532. octave_polynomial, an Octave code which analyzes a variety of polynomial families, returning the polynomial values, coefficients, derivatives, integrals, roots, or other information.
1533. octave_random_test, an Octave code which demonstrates random number generation.
1534. octave_rule, an Octave 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).
1535. octave_simulation, an Octave 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.
1536. octopus, an Octave code which contains some Octave-specific utilities.
1537. octopus_test
1538. ode_euler, a Octave code which interactively applies the Euler method to estimate the solution of an ordinary differential equation (ODE) y'=f(x,y), over the interval [a,b], with initial condition y(a)=ya, using n steps.
1539. ode_euler_test
1540. ode_euler_backward, a Octave code which interactively applies the backward Euler method to estimate the solution of an ordinary differential equation (ODE) y'=f(x,y), over the interval [a,b], with initial condition y(a)=ya, using n steps.
1541. ode_euler_backward_test
1542. ode_euler_system, a Octave code which interactively applies the Euler method to estimate the solution of a system of ordinary differential equations (ODE) y'=f(x,y), over the interval [a,b], with initial condition y(a)=ya, using n steps.
1543. ode_euler_system_test
1544. ode_midpoint, a Octave code which interactively applies the midpoint method to estimate the solution of an ordinary differential equation (ODE) y'=f(x,y), over the interval [a,b], with initial condition y(a)=ya, using n steps.
1545. ode_midpoint_test
1546. ode_midpoint_system, a Octave code which interactively applies the midpoint method to estimate the solution of a system of ordinary differential equations (ODE) y'=f(x,y), over the interval [a,b], with initial condition y(a)=ya, using n steps.
1547. ode_midpoint_system_test
1548. ode_rk4, a Octave code which interactively applies a fourth order Runge-Kutta method to estimate the solution of an ordinary differential equation (ODE) y'=f(x,y), over the interval [a,b], with initial condition y(a)=ya, using n steps.
1549. ode_rk4_test
1550. ode_trapezoidal, a Octave code which interactively applies the trapezoidal method to estimate the solution of an ordinary differential equation (ODE) y'=f(x,y), over the interval [a,b], with initial condition y(a)=ya, using n steps.
1551. ode_trapezoidal_test
1552. ode23_test, an Octave code which calls ode23(), which is a built-in function for the adaptive solution of systems of ordinary differential equations (ODE) using a pair of Runge-Kutta solvers of orders 2 and 3.
1553. ode45_test, an Octave code which calls ode45(), which is a built-in function for the adaptive solution of systems of ordinary differential equations (ODE) using a pair of Runge-Kutta solvers of orders 4 and 5.
1554. opt_golden, a Octave code which interactively estimates a minimizer of a function f(x) over the interval [a,b], assuming f(x) is unimodular (U-shaped) over the interval [a,b].
1555. opt_golden_test
1556. opt_gradient_descent, a Octave code which interactively seeks a local minimum of a function f(x), given a formula for the derivative f'(x), a starting point x0, and a stepsize factor gamma.
1557. opt_gradient_descent_test
1558. opt_quadratic, a Octave code which interactively uses quadratic interpolation to estimate a critical point of a function f(x) given three starting points, an iteration limit n, and tolerances for x and y.
1559. opt_quadratic_test
1560. opt_sample, a Octave code which interactively estimates the minimum and maximum of a function f(x) over an interval [a,b], using n random sample values, with the function entered as a string.
1561. opt_sample_test
1562. oregonator_ode, an Octave code which sets up and solves the ordinary differential equations (ODE) that define the Oregonator, a model of the Belousov-Zhabotinsky chemical reaction.
1563. oregonator_ode_test
1564. ornstein_uhlenbeck, an Octave code which approximates solutions of the Ornstein-Uhlenbeck stochastic differential equation (SDE) using the Euler method, the Euler-Maruyama method, and the Milstein method.
1565. ornstein_uhlenbeck_test
1566. oscillator_ode, an Octave code which sets up and solves the highly oscillatory ordinary differential equation (ODE).
1567. oscillator_ode_test
1568. owen, an Octave code which evaluates the Owen T function.
1569. owen_test
1570. ozone_ode, an Octave code which sets up and solves a stiff system of four ordinary differential equations (ODE) that simulate the daily variation in atmospheric ozone concentration.
1571. ozone_ode_test
1572. ozone2_ode, an Octave code which sets up and solves a stiff system of four ordinary differential equations (ODE) that simulate the daily variation in atmospheric ozone concentration. This version of the ozone ODE includes a nitrogen oxide source term.
1573. ozone2_ode_test
1574. padua, an Octave code which returns the coordinates of the 2D Padua points, as well as interpolation weights or quadrature weights, and images of the points.
1575. padua_test
1576. pagerank, an Octave code which uses the eigenvalue (power method) and surfer (Markov Chain Monte Carlo MCMC) approaches to ranking web pages.
1577. pagerank_test
1578. pagerank2, an Octave code which considers a specific application of the page rank algorithm.
1579. pagerank2_test
1580. paraheat_functional, an Octave code which sets up and solves a parameterized steady heat equation in a 2D spatial domain, using diffusivity parameterized by vc, and reporting selected solution values vs, using a functional framework vs=f(vc).
1581. paraheat_functional_test
1582. pariomino, an Octave code which considers pariominoes, which are polyominoes with a checkerboard parity.
1583. pariomino_test
1584. partial_digest, an Octave code which seeks solutions of the partial digest problem.
1585. partial_digest_test
1586. partition_brute, an Octave 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.
1587. partition_brute_test
1588. partition_greedy, an Octave code which uses a greedy algorithm to seek a solution of the partition problem, in which a given set of integers is to be split into two groups whose sums are as close as possible.
1589. partition_greedy_test
1590. patterson_rule, an Octave 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.
1591. patterson_rule_test
1592. pbma_io, an Octave code which reads or writes graphics files that use the ASCII Portable Bit Map (PBM) format.
1593. pbma_io_test
1594. pce_burgers, an Octave code which solves a version of the time-dependent viscous Burgers equation, with uncertain viscosity, using a polynomial chaos expansion (PCE) in terms of Hermite polynomials, by Gianluca Iaccarino.
1595. pce_burgers_test
1596. pce_legendre, an Octave code which sets up the system matrix for a polynomial chaos expansion (PCE), using Legendre polynomials with a linear factor, applied to a 2D partial differential equation (PDE) with a stochastic diffusion coefficient.
1597. pce_legendre_test
1598. pce_ode_hermite, an Octave code which sets up a simple scalar ordinary differential equation (ODE) for exponential decay with an uncertain decay rate, using a polynomial chaos expansion (PCE) in terms of Hermite polynomials.
1599. pce_ode_hermite_test
1600. pdflib, an Octave 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.
1601. pdflib_test
1602. peak_movie, an Octave code which creates a sequence of frames, and then an animation or movie from the data displayed by the peaks() function.
1603. peak_movie_test
1604. pendulum_comparison_ode, an Octave code which compares the linear and nonlinear ordinary differential equations (ODE) that represent the behavior of a pendulum of length L under a gravitational force of strength G.
1605. pendulum_comparison_ode_test
1606. pendulum_double_ode, an Octave code which sets up and solves the double pendulum ordinary differential equation (ODE).
1607. pendulum_double_ode_test
1608. pendulum_elastic_ode an Octave code which sets up and solves the ordinary differential equations (ODE) that represent the behavior of a nonlinear elastic pendulum, with gravitational force G, spring constant K, unstretched length L, and mass M.
1609. pendulum_elastic_ode_test
1610. pendulum_nonlinear_exact, an Octave code which evaluates an exact formula y(t) for the solution of the the ordinary differential equations (ODE) that represent the behavior of a nonlinear pendulum of length L under a gravitational force of strength G, y''=-G/L sin(y).
1611. pendulum_nonlinear_exact_test
1612. pendulum_nonlinear_ode, an Octave code which sets up and solves the ordinary differential equations (ODE) that represent a nonlinear model of the behavior of a pendulum of length L under a gravitational force of strength G.
1613. pendulum_nonlinear_ode_test
1614. pendulum_ode, an Octave code which sets up and solves the ordinary differential equations (ODE) that represent a linear model of the behavior of a pendulum of length L under a gravitational force of strength G.
1615. pendulum_ode_test
1616. pendulum_ode_period, an Octave code which sets up and solves a system of ordinary differential equations (ODE) that represent the behavior of a linear pendulum of length L under a gravitational force of strength G, in order to estimate the period of oscillation.
1617. pendulum_ode_period_test
1618. pentominoes, an Octave code which forms or plots any of the 12 members of the pentomino family, shapes formed from 5 adjacent squares.
1619. pentominoes_test
1620. perceptron_test, an Octave code which calculates a classifier of linearly separable data using the perceptron algorithm.
1621. percolation_simulation, an Octave code which simulates a percolation system. A rectangular region is decomposed into a grid of MxN squares. Each square may be porous or solid. We are interested in a path of porous squares connecting the top and bottom, or the left and right boundaries. The original code was written by Ian Cooper.
1622. percolation_simulation_test
1623. permutation_distance, an Octave code which estimates the expected value of the Ulam distance between a pair of randomly selected permutations of the same order.
1624. permutation_distance_test
1625. persistence, an Octave code which demonstrates how to initialize, get, or set data stored within a function, using static/persistent/saved/local memory.
1626. persistence_test
1627. pgma_io, an Octave code which reads or writes graphics files that use the ASCII Portable Gray Map (PGM) format.
1628. pgma_io_test
1629. pi_spigot, an Octave code which produces any number of digits of the decimal expansion of pi.
1630. pi_spigot_test
1631. pic, an Octave code which uses the Particle In Cell (PIC) method to simulate the motion of electrically charged particles past a plate, and is intended as a starting point for implementing a parallel version.
1632. pic_test
1633. pink_noise, an Octave code which computes a pink noise signal obeying a 1/f power law.
1634. pink_noise_test
1635. plasma_matrix, an Octave code which sets up a matrix associated with a problem in plasma physics.
1636. plasma_matrix_test
1637. ply_display, an Octave code which displays an image of a 3D graphics file in PLY format;
1638. ply_display_test
1639. ply_io, an Octave code which reads or writes a 3D graphics file in PLY format, by Greg Turk;
1640. ply_io_test
1641. ply_to_tri_surface, an Octave code which reads a PLY file describing a 3D polygonal mesh, and reformulates the surface mesh data as 3D mesh of triangles, a TRI_SURFACE dataset.
1642. ply_to_tri_surface_test
1643. poisson_1d, an Octave 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.
1644. poisson_1d_test
1645. poisson_1d_multigrid, an Octave code which applies the multigrid method to a discretized version of the 1D Poisson equation.
1646. poisson_1d_multigrid_test
1647. poisson_2d, an Octave code which solves the Poisson equation in a rectangle, using finite differences and Jacobi iteration.
1648. poisson_2d_test
1649. poisson_2d_exact, an Octave code which evaluates exact solutions u(x,y) to the Poisson partial differential equation (PDE): del^2 U = f(x,y) over a specified region with given boundary conditions.
1650. poisson_2d_exact_test
1651. poisson_ell_test, an Octave code which plots data from a solution of the Poisson equation in the L-shaped region, as computed by FreeFem++() and transferred using the ffmatlib() library.
1652. poisson_simulation, an Octave code which simulates a Poisson process in which events randomly occur with an average waiting time of Lambda.
1653. poisson_simulation_test
1654. polar_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) whose variable is complex, and whose solution should be viewed in a polar coordinate plot.
1655. polar_ode_test
1656. polpak, an Octave 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.
1657. polpak_test
1658. polygon, an Octave 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.
1659. polygon_test
1660. polygon_average, an Octave code which demonstrates a process of repeatedly averaging and normalizing the vertices of a polygon, illustrating a property of the power method.
1661. polygon_average_test
1662. polygon_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected from the interior of a polygon in 2D.
1663. polygon_distance_test
1664. polygon_grid, an Octave code which generates a grid of points over the interior of a polygon in 2D.
1665. polygon_grid_test
1666. polygon_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of a polygon in 2D.
1667. polygon_integrals_test
1668. polygon_minkowski, an Octave code which converts polygons between the vertex representation and the Minkowski representation, which uses a sequence of (non-unit) normal vectors.
1669. polygon_minkowski_test
1670. polygon_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of a polygon in 2D.
1671. polygon_monte_carlo_test
1672. polygon_sample, an Octave code which uniformly samples points in a polygon.
1673. polygon_sample_test
1674. polygon_triangulate, an Octave code which triangulates a (possibly nonconvex) polygon in 2D, based on a C program by Joseph ORourke;
1675. polygon_triangulate_test
1676. polygonal_surface_display, an Octave code which displays a surface in 3D described as a set of polygons;
1677. polygonal_surface_display_test
1678. polyiamonds, an Octave code which works with polyiamonds, simple shapes constructed by edgewise connections of congruent equilateral triangles.
1679. polyiamonds_test
1680. polynomial, an Octave code which adds, multiplies, differentiates, evaluates and prints multivariate polynomials in a space of M dimensions.
1681. polynomial_test
1682. polynomial_conversion, an Octave code which converts representations of a polynomial between monomial, Bernstein, Chebyshev, Gegenbauer, Hermite, Laguerre and Legendre forms.
1683. polynomial_conversion_test
1684. polynomial_multiply, an Octave code which multiplies two polynomials p(x) and q(x).
1685. polynomial_multiply_test
1686. polynomial_resultant, an Octave code which computes the resultant R of univariate polynomials P and Q.
1687. polynomial_resultant_test
1688. polynomial_root_bound, an Octave code which computes the Cauchy bound on the magnitude of all roots of a polynomial with complex coefficients.
1689. polynomial_root_bound_test
1690. polynomials, an Octave code which defines multivariate polynomials over rectangular domains, for which certain information is to be determined, such as the maximum and minimum values.
1691. polynomials_test
1692. polyomino_parity, an Octave code which uses parity considerations to determine whether a given set of polyominoes can tile a specified region.
1693. polyomino_parity_test
1694. polyominoes, an Octave code which defines, solves, and plots a variety of polyomino tiling problems, which are solved by a direct algebraic approach, instead of the more typical brute-force or backtracking methods.
1695. polyominoes_test
1696. porous_medium_exact, an Octave code which returns an exact solution u(x,t) of the porous medium equation (PME), related to the diffusion equation, and based on the Barenblatt solution. The partial differential equation (PDE) has the form dudt=Del^2(u^m). This system reduces to a diffusion equation if the exponent m is set to 1.
1697. porous_medium_exact_test
1698. power_method, an Octave code which carries out the power method for finding a dominant eigenvalue and its eigenvector.
1699. power_method_test
1700. power_rule, an Octave code which constructs a power rule, that is, a product quadrature rule from identical 1D factor rules.
1701. power_rule_test
1702. ppma_io, an Octave code which reads or writes graphics files that use the ASCII Portable Pixel Map (PPM) format.
1703. ppma_io_test
1704. praxis, an Octave code which minimizes a scalar function of several variables, without requiring derivative information, by Richard Brent.
1705. praxis_test
1706. predator_prey_ode, an Octave code which sets up and solves a time-dependent predator-prey system of ordinary differential equations (ODE).
1707. predator_prey_ode_test
1708. predator_prey_ode_period, an Octave code which sets up and solves a time-dependent predator-prey system of ordinary differential equations (ODE) in order to estimate the period of the limit cycle.
1709. predator_prey_ode_period_test
1710. prime, an Octave code which counts the number of primes between 1 and N, and is intended as a starting point for a parallel version.
1711. prime_test
1712. prime_factors, an Octave code which returns a list of the prime factors of an integer.
1713. prime_factors_test
1714. prime_fermat, an Octave code which applies Fermat's primality test to an integer n, which always correctly identifies primes, but sometimes also accepts nonprimes. Nonetheless, the test is useful for weeding out most nonprimes. The accuracy of the test can be improved by running it for several bases.
1715. prime_fermat_test
1716. prime_pi, an Octave code which evaluates Pi(n), the number of primes less than or equal to an integer n.
1717. prime_pi_test
1718. prime_plot, an Octave code which displays a box plot of the prime and composite numbers.
1719. prime_plot_test
1720. prism_jaskowiec_rule, an Octave 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.
1721. prism_jaskowiec_rule_test
1722. prism_witherden_rule, an Octave code which returns a symmetric Witherden quadrature rule for a prism with triangular base, with exactness up to total degree 10.
1723. prism_witherden_rule_test
1724. prob, an Octave 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.
1725. prob_test
1726. product_rule, an Octave code which creates an M dimensional quadrature rule from a product of distinct 1d quadrature rules;
1727. product_rule_test
1728. profile_data, an Octave code which returns the (x,y) coordinates of points that came from tracing the profile of a face.
1729. profile_data_test
1730. profile_interp, an Octave code which interpolates (x,y) data that came from tracing the profile of a face.
1731. profile_interp_test
1732. pwc_plot_1d, an Octave code which converts the definition of a piecewise constant (PWC) function of a 1D argument into plottable data.
1733. pwc_plot_1d_test
1734. pwc_plot_2d, an Octave code which converts the definition of a piecewise constant (PWC) function of a 2D argument into plottable data.
1735. pwc_plot_2d_test
1736. pwl_approx_1d, an Octave code which approximates a set of data using a piecewise linear (PWL) function.
1737. pwl_approx_1d_test
1738. pwl_interp_1d, an Octave code which interpolates a set of data using a piecewise linear (PWL) function.
1739. pwl_interp_1d_test
1740. pwl_interp_2d, an Octave code which evaluates a piecewise linear (PWL) interpolant to data defined on a regular 2D grid.
1741. pwl_interp_2d_test
1742. pwl_interp_2d_scattered, an Octave code which evaluates a piecewise linear (PWL) interpolant to data which is available at an irregularly arranged set of points.
1743. pwl_interp_2d_scattered_test
1744. pwl_product_integral, an Octave code which calculates the exact value of the integral of the product of two piecewise linear (PWL) functions f(x) and g(x).
1745. pwl_product_integral_test
1746. pyramid_exactness, an Octave code which investigates the polynomial exactness of a quadrature rule over the interior of the unit pyramid in 3D.
1747. pyramid_exactness_test
1748. pyramid_felippa_rule, an Octave code which returns a Felippa quadrature rule for approximating integrals over the interior of a pyramid in 3D.
1749. pyramid_felippa_rule_test
1750. pyramid_grid, an Octave code which computes a grid of points over the interior of the unit pyramid in 3D;
1751. pyramid_grid_test
1752. pyramid_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of the unit pyramid in 3D.
1753. pyramid_integrals_test
1754. pyramid_jaskowiec_rule, an Octave 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.
1755. pyramid_jaskowiec_rule_test
1756. pyramid_monte_carlo, an Octave code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit pyramid in 3D;
1757. pyramid_monte_carlo_test
1758. pyramid_rule, an Octave code which computes a conical product quadrature rule over the interior of the unit pyramid in 3D.
1759. pyramid_rule_test
1760. pyramid_witherden_rule, an Octave code which returns a Witherden quadrature rule, with exactness up to total degree 10, over the interior of a pyramid.
1761. pyramid_witherden_rule_test
1762. qr_solve, an Octave code which computes the linear least squares (LLS) solution of a system A*x=b using the QR factorization.
1763. qr_solve_test
1764. quad_fast_rule, an Octave code which rapidly defines certain quadrature rules for approximating an integral;
1765. quad_fast_rule_test
1766. quad_gauss, a Octave code which interactively uses an n-point Gauss quadrature rule to estimate the integral of a function f(x) in the interval [a,b].
1767. quad_gauss_test
1768. quad_monte_carlo, a Octave code which interactively uses n random samples to estimate the integral of a function f(x) in the interval [a,b].
1769. quad_monte_carlo_test
1770. quad_rule, an Octave code which defines quadrature rules for approximating an integral;
1771. quad_rule_test
1772. quad_serial, an Octave code which applies a quadrature rule to estimate an integral, intended as a starting point for parallelization exercises.
1773. quad_serial_test
1774. quad_trapezoid, a Octave code which interactively applies a trapezoid rule using n intervals to estimate the integral of a function f(x) over an interval [a,b].
1775. quad_trapezoid_test
1776. quad2d, an Octave code which estimates an integral over a 2D rectangle using quadrature, intended as the starting point for program optimization or parallelization.
1777. quad2d_test
1778. quadex_ode an Octave code which sets up and solves a stiff ordinary differential equation (ODE), whose exact solution is a parabola, but for which errors grow exponentially.
1779. quadex_ode_test
1780. quadmom, an Octave 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).
1781. quadmom_test
1782. quadrature_golub_welsch, an Octave code which computes the points and weights of a Gaussian quadrature rule using the Golub-Welsch procedure.
1783. quadrature_golub_welsch_test
1784. quadrature_least_squares, an Octave 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.
1785. quadrature_least_squares_test
1786. quadrature_weights_vandermonde, an Octave code which computes the weights of a quadrature rule using the Vandermonde matrix, assuming that the points have been specified.
1787. quadrature_weights_vandermonde_test
1788. quadrature_weights_vandermonde_2d, an Octave code which computes the weights of a 2D quadrature rule using the Vandermonde matrix, assuming that the points have been specified.
1789. quadrature_weights_vandermonde_2d_test
1790. quadrilateral, an Octave code which carries out geometric calculations on quadrilaterals, including angles, area, distances, nearest point, point containment, perimeter, and random generation.
1791. quadrilateral_test
1792. quadrilateral_mesh, an Octave code which handles meshes of quadrilaterals over a 2D region;
1793. quadrilateral_mesh_test
1794. quadrilateral_mesh_order1_display, an Octave code which plots piecewise constant (PWC) data associated with a mesh of quadrilaterals;
1795. quadrilateral_mesh_order1_display_test
1796. quadrilateral_mesh_rcm, an Octave code which computes the Reverse Cuthill McKee (RCM) reordering for nodes in a mesh of 4-node quadrilaterals.
1797. quadrilateral_mesh_rcm_test
1798. quadrilateral_surface_display, an Octave code which plots piecewise bilinear data associated with a quadrilateral_surface, that is, a 3D surface defined by a quadrilateral mesh;
1799. quadrilateral_surface_display_test
1800. quadrilateral_witherden_rule, an Octave code which returns a symmetric Witherden quadrature rule for the quadrilateral, with exactness up to total degree 21.
1801. quadrilateral_witherden_rule_test
1802. quality, an Octave code which measures the dispersion of pointsets in M dimensions;
1803. quality_test
1804. quasiperiodic_ode, an Octave code which sets up and solves a system of ordinary differential equations (ODE) for a problem with a quasiperiodic solution.
1805. quasiperiodic_ode_test
1806. quaternions, an Octave code which carries out some simple arithmetic operations for quaternions.
1807. quaternions_test
1808. r8_scale, an Octave code which computes the "next" and "previous" real numbers.
1809. r8_scale_test
1810. r83, an Octave code which contains linear algebra routines for r83 matrices (real, 64 bit, tridiagonal 3xN format).
1811. r83_test
1812. r83_np, an Octave code which contains linear algebra routines for r83_np matrices (real, 64 bit, tridiagonal 3xN format, nonpivoting factorization).
1813. r83_np_test
1814. r83p, an Octave code which contains linear algebra routines for r83p matrices (real, 64 bit, tridiagonal periodic format).
1815. r83p_test
1816. r83s, an Octave code which contains linear algebra routines for r83s matrices (real, 64 bit, tridiagonal scalar format).
1817. r83s_test
1818. r83t, an Octave code which contains linear algebra routines for r83t matrices (real, 64 bit, tridiagonal Mx3 format).
1819. r83t_test
1820. r83v, an Octave code which contains linear algebra routines for r83v matrices (real, 64 bit, tridiagonal three vector format).
1821. r83v_test
1822. r85, an Octave code which contains linear algebra routines for r85 matrices (real, 64 bit, pentadiagonal format).
1823. r85_test
1824. r8bb, an Octave code which contains linear algebra routines for r8bb matrices (real, 64 bit, border banded format).
1825. r8bb_test
1826. r8blt, an Octave code which contains linear algebra routines for r8blt matrices (real, 64 bit, band lower triangular format).
1827. r8blt_test
1828. r8bto, an Octave code which contains linear algebra routines for r8bto matrices (real, 64 bit, block Toeplitz format).
1829. r8bto_test
1830. r8but, an Octave code which contains linear algebra routines for r8but matrices (real, 64 bit, band upper triangular format).
1831. r8but_test
1832. r8cb, an Octave code which contains linear algebra routines for r8cb matrices (real, 64 bit, Compressed Band format).
1833. r8cb_test
1834. r8cbb, an Octave code which contains linear algebra routines for r8cbb matrices (real, 64 bit, Compressed Border Banded format).
1835. r8cbb_test
1836. r8ccs, an Octave code which contains linear algebra routines for r8ccs matrices: real, 64 bit, Compressed Column Storage (CCS) format.
1837. r8ccs_test
1838. r8ci, an Octave code which contains linear algebra routines for r8ci matrices (real, 64 bit, circulant format).
1839. r8ci_test
1840. r8col, an Octave code which contains utility routines for an R8COL, that is, a real 64 bit 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.
1841. r8col_test
1842. r8crs, an Octave code which contains linear algebra routines for R8CRS matrices: real, 64 bit, Compressed Row Storage (CRS) format.
1843. r8crs_test
1844. r8gb, an Octave code which contains linear algebra routines for r8gb matrices (real, 64 bit, General Banded format).
1845. r8gb_test
1846. r8gd, an Octave code which contains linear algebra routines for r8gd matrices (real, 64 bit, general diagonal format).
1847. r8gd_test
1848. r8ge, an Octave code which contains linear algebra routines for R8GE matrices (real, 64 bit, General format).
1849. r8ge_test
1850. r8ge_np, an Octave code which contains nonpivoting linear algebra routines for r8ge_np matrices (real, 64 bit, General Nonpivoting format).
1851. r8ge_np_test
1852. r8lib, an Octave code which contains many utility routines, using double precision real (R8) arithmetic.
1853. r8lib_test
1854. r8lt, an Octave code which contains linear algebra routines for R8LT matrices: real, 64 bit, Lower Triangular.
1855. r8lt_test
1856. r8ltt, an Octave code which contains linear algebra routines for r8ltt matrices (real, 64 bit, lower triangular Toeplitz format).
1857. r8ltt_test
1858. r8ncf, an Octave code which contains linear algebra routines for r8ncf matrices (real, 64 bit, nonsymmetric coordinate format).
1859. r8ncf_test
1860. r8pbl, an Octave code which contains linear algebra routines for r8pbl matrices (real, 64 bit, symmetric positive definite (SPD) band lower format).
1861. r8pbl_test
1862. r8pbu, an Octave code which contains linear algebra routines for r8pbu matrices (real, 64 bit, symmetric positive definite (SPD) band upper format).
1863. r8pbu_test
1864. r8po, an Octave code which contains linear algebra routines for r8po matrices (real, 64 bit, symmetric positive definite (SPD) format).
1865. r8po_test
1866. r8poly, an Octave 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.
1867. r8poly_test
1868. r8pp, an Octave code which contains linear algebra routines for r8pp matrices (real, 64 bit, symmetric positive definite (SPD) packed format).
1869. r8pp_test
1870. r8ri, an Octave code which contains linear algebra routines for r8ri matrices (real, 64 bit, row indexed format).
1871. r8ri_test
1872. r8row, an Octave code which contains utility routines for an R8ROW, that is, a real 64 bit 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.
1873. r8row_test
1874. r8sd, an Octave code which contains linear algebra routines for r8sd matrices (real, 64 bit, symmetric diagonal format).
1875. r8sd_test
1876. r8sm, an Octave code which contains linear algebra routines for r8sm matrices (real, 64 bit, Sherman-Morrison A-u*v' format).
1877. r8sm_test
1878. r8sr, an Octave code which carries out linear algebra operations for r8sr matrices (real, 64 bit, diagonal + compressed row offdiagonal format).
1879. r8sr_test
1880. r8ss, an Octave code which carries out linear algebra operations for r8ss matrices (real, 64 bit, symmetric skyline format).
1881. r8ss_test
1882. r8st, an Octave code which contains linear algebra routines for R8ST matrices: real, 64 bit, Sparse Triplet.
1883. r8st_test
1884. r8sto, an Octave code which contains linear algebra routines for r8sto matrices (real, 64 bit, symmetric Toeplitz N format).
1885. r8sto_test
1886. r8to, an Octave code which contains linear algebra routines for r8to matrices (real, 64 bit, Toeplitz 2*N-1 format).
1887. r8to_test
1888. r8ut, an Octave code which contains linear algebra routines for r8ut matrices: real, 64 bit, Upper Triangular.
1889. r8ut_test
1890. r8utp, an Octave code which carries out linear algebra operations on r8utp matrices, real 64 bit, Upper Triangular Packed format.
1891. r8utp_test
1892. r8utt, an Octave code which contains linear algebra routines for r8utt matrices (real, 64 bit, upper triangular Toeplitz format).
1893. r8utt_test
1894. r8vm, an Octave code which contains linear algebra routines for r8vm matrices (real, 64 bit, vandermonde format).
1895. r8vm_test
1896. randlc, an Octave code which implements a random number generator (RNG) used by the nas() benchmarks.
1897. randlc_test
1898. random_data, an Octave 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 annulus, cube, ellipse, ellipsoid, polygon, simplex and sphere.
1899. random_data_test
1900. random_sorted, an Octave code which generates vectors of random values which are already sorted.
1901. random_sorted_test
1902. random_walk_1d_simulation, an Octave code which simulates a random walk in a 1-dimensional region.
1903. random_walk_1d_simulation_test
1904. random_walk_2d_avoid_simulation, an Octave code which simulates a self-avoiding random walk in a 2-dimensional region.
1905. random_walk_2d_avoid_simulation_test
1906. random_walk_2d_simulation, an Octave code which simulates a random walk in a 2-dimensional region.
1907. random_walk_2d_simulation_test
1908. random_walk_3d_simulation, an Octave code which simulates a random walk in a 3-dimensional region.
1909. random_walk_3d_simulation_test
1910. ranlib, an Octave code which produces random samples from Probability Density Functions (PDF), including Beta, Chi-square Exponential, F, Gamma, Multivariate normal, Noncentral chi-square, Noncentral F, Univariate normal, random permutations, Real uniform, Binomial, Negative Binomial, Multinomial, Poisson and Integer uniform, by Barry Brown and James Lovato.
1911. ranlib_test
1912. rbf_interp_1d, an Octave code which defines and evaluates radial basis function (RBF) interpolants to 1D data.
1913. rbf_interp_1d_test
1914. rbf_interp_2d, an Octave code which defines radial basis function (RBF) interpolants to 2D data.
1915. rbf_interp_2d_test
1916. rbf_interp_nd, an Octave code which defines and evaluates radial basis function (RBF) interpolants to M dimensional data.
1917. rbf_interp_nd_test
1918. rcm, an Octave 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;
1919. rcm_test
1920. reaction_ode, an Octave code which sets up and solves the ordinary differential equations (ODE) which model a simple chemical reaction A+B --k--> C.
1921. reaction_ode_test
1922. reaction_twoway_ode, an Octave code which sets up and solves the ordinary differential equations (ODE) which model a two-way chemical reaction between species W1 and W2.
1923. reaction_twoway_ode_test
1924. reactor simulation, an Octave code which is a simple Monte Carlo simulation of the shielding effect of a slab of a certain thickness in front of a neutron source. This program was provided as an example with the book "Numerical Methods and Software."
1925. reactor simulation_test
1926. rectangle_distance, an Octave code which estimates the distribution and expected value of the distance between two points picked uniformly at random within a rectangle.
1927. rectangle_distance_test
1928. region_test, an Octave code which plots data from an interesting region that was meshed by FreeFem++() and transferred using the ffmatlib() library.
1929. reid_tiling, an Octave code which uses the reduced row echelon form (RREF) to determine solutions to the problem of tiling the Reid polyomino.
1930. reid_tiling_test
1931. rejection_sample, an Octave code which demonstrates acceptance/rejection sampling.
1932. rejection_sample_test
1933. rigid_body_ode, an Octave code which sets up and solves the ordinary differential equations (ODE) representing the Euler equations for a rigid body with three unequal moments of inertia, originally proposed by Fred Krogh.
1934. rigid_body_ode_test
1935. ring_data, an Octave code which creates, plots, or saves data generated by sampling a number of concentric, possibly overlapping rings.
1936. ring_data_test
1937. ripple_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) whose solutions start as ripples and end as hyperbolas.
1938. ripple_ode_test
1939. risk_matrix, an Octave code which returns the transition and adjacency matrix for the game of RISK.
1940. risk_matrix_test
1941. rk1, an Octave 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.
1942. rk1_test
1943. rk1_implicit, an Octave 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.
1944. rk1_implicit_test
1945. rk12, an Octave code which solves an ordinary differential equation (ODE) using a Runge-Kutta (RK) method of order 2, estimating the local error with a Runge-Kutta method of order 1.
1946. rk12_test
1947. rk12_adapt, an Octave code which defines an adaptive ordinary differential equation (ODE) solver, using Runge-Kutta (RK) solvers of order 1 and 2.
1948. rk12_adapt_test
1949. rk2, an Octave 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.
1950. rk2_test
1951. rk2_implicit, an Octave 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.
1952. rk2_implicit_test
1953. rk23, an Octave code which applies Runge-Kutta (RK) solvers of order 2 and 3 to a system of ordinary differential equations (ODE);
1954. rk23_test
1955. rk3, an Octave code which solves one or more ordinary differential equations (ODE) using an explicit Runge-Kutta method of order 3.
1956. rk3_test
1957. rk34, an Octave code which applies Runge-Kutta (RK) solvers of order 3 and 4 to a system of ordinary differential equations (ODE);
1958. rk34_test
1959. rk4, an Octave code which applies the fourth order Runge-Kutta (RK) algorithm to estimate the solution of an ordinary differential equation (ODE) at the next time step.
1960. rk4_test
1961. rk45, an Octave code which applies Runge-Kutta (RK) solvers of order 4 and 5 to a system of ordinary differential equations (ODE);
1962. rk45_test
1963. rkf45, an Octave code which applies a Runge-Kutta-Fehlberg (RKF) solver to a system of ordinary differential equations (ODE);
1964. rkf45_test
1965. rng_cliff, an Octave code which computes a sequence of values from the Cliff random number generator (RNG).
1966. rng_cliff_test
1967. rnglib, an Octave code which implements a random number generator (RNG) with splitting facilities, allowing multiple independent streams to be computed, by L'Ecuyer and Cote.
1968. rnglib_test
1969. robertson_ode, an Octave code which sets up and solves a system of three nonlinear stiff ordinary differential equations (ODE) characterizing an autocatalytic chemical reaction.
1970. robertson_ode_test
1971. roessler_ode, an Octave code which sets up and solves the 3D Roessler system of ordinary differential equations (ODE).
1972. roessler_ode_test
1973. root_rc, an Octave code which seeks a solution of a scalar nonlinear equation f(x)=0, using reverse communication (RC), by Gaston Gonnet.
1974. root_rc_test
1975. roots_rc, an Octave code which seeks solutions of a system of nonlinear equations, using reverse communication (RC), by Gaston Gonnet.
1976. roots_rc_test
1977. rot13, an Octave code which enciphers a string using the ROT13 cipher for letters, and the ROT5 cipher for digits.
1978. rot13_test
1979. roulette_simulation, an Octave code which simulates the spinning of a roulette wheel and the evaluation of certain common roulette bets.
1980. roulette_simulation_test
1981. row_echelon_integer, an Octave 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.
1982. row_echelon_integer_test
1983. rref_test, an Octave code which calls rref() for the reduced row echelon form (RREF) of a matrix, which can be singular or rectangular.
1984. rref2, an Octave code which involves a user-written approach to compute the reduced row echelon form (RREF) of a matrix, which can be used to analyze matrices which are square or rectangular, singular or invertible.
1985. rref2_test
1986. rubber_band_ode, an Octave code which sets up and solves a set of ordinary differential equations (ODE) describing a mass suspended by a spring and rubber band, which exhibits chaotic behavior.
1987. rubber_band_ode_test
1988. rucklidge_ode, an Octave code which sets up and solves the Rucklidge ordinary differential equation (ODE), a model of double convection which embodies a transition to chaos.
1989. rucklidge_ode_test
1990. runge, an Octave code which evaluates the Runge() function, its first and second derivatives, and its antiderivative. This function causes a breakdown for polynomial interpolation over equally spaced nodes in [-1,+1].
1991. runge_test
1992. sammon_data, an Octave code which generates six M dimensional datasets for cluster analysis.
1993. sammon_data_test
1994. sandia_cubature, an Octave code which computes M-dimensional quadrature rules for certain regions and weight functions.
1995. sandia_cubature_test
1996. sandia_rules, an Octave code which produces 1D quadrature rules of Chebyshev, Clenshaw Curtis, Fejer 2, Gegenbauer, generalized Hermite, generalized Laguerre, Hermite, Jacobi, Laguerre, Legendre and Patterson types.
1997. sandia_rules_test
1998. sandia_sgmgg, an Octave code which explores a generalized construction method for sparse grids.
1999. sandia_sgmgg_test
2000. sandia_sparse, an Octave 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.
2001. sandia_sparse_test
2002. satisfy_brute, an Octave code which uses brute force to find all assignments of values to a set of logical variables which make a complicated logical statement true.
2003. satisfy_brute_test
2004. sawtooth_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) driven by a right hand side which is a sawtooth function (periodic, discontinuous, piecewise linear).
2005. sawtooth_ode_test
2006. schroedinger_linear_pde, an Octave code which sets up and solves the complex partial differential equation (PDE) known as Schroedinger's linear equation: dudt = i uxx, in one spatial dimension, with Neumann boundary conditions.
2007. schroedinger_linear_pde_test
2008. schroedinger_nonlinear_pde, an Octave code which sets up and solves the complex partial differential equation (PDE) known as Schroedinger's nonlinear equation: dudt = i uxx + i gamma * |u|^2 u, in one spatial dimension, with Neumann boundary conditions.
2009. schroedinger_nonlinear_pde_test
2010. scip_solution_read, an Octave code which reads a file created by the integer programming package scip(), representing the solution of a polyomino tiling problem, and writes out a simple ASCII file.
2011. scip_solution_read_test
2012. sde, an Octave code which illustrates properties of stochastic differential equations (SDE), and common algorithms for their analysis, by Desmond Higham;
2013. sde_test
2014. search_test, an Octave code which searches integers between A and B for a value J such that F(J) = C.
2015. sensitive_ode, an Octave code which sets up a second order ordinary differential equation (ODE) which exhibits sensitive dependence on the initial condition.
2016. sensitive_ode_test
2017. serenity, an Octave code which considers the serenity puzzle, a smaller version of the eternity puzzle. The serenity puzzle specifies a dodecagonal region R composed of 288 30-60-90 triangles, and a set of 8 "tiles", each consisting of 36 30-60-90 triangles, and seeks an arrangement of the tiles that exactly covers the region.
2018. serenity_test
2019. serenity_cplex_test a BASH code which calls cplex(), to read the LP file defining the serenity tiling problem, solve the linear programming problem, and write the solution to a file.
2020. serenity_gurobi_test a BASH code which calls gurobi(), to read the LP file defining the serenity tiling problem, solve the linear programming problem, and write the solution to a file.
2021. set_theory, an Octave code which implements various set theoretic operations.
2022. set_theory_test
2023. sftpack, an Octave code which implements the slow Fourier transform (SFT), intended as a teaching tool and comparison with the Fast Fourier Transform (FFT).
2024. sftpack_test
2025. shepard_interp_1d, an Octave code which defines and evaluates Shepard interpolants to 1D data, based on inverse distance weighting.
2026. shepard_interp_1d_test
2027. shepard_interp_2d, an Octave code which defines and evaluates Shepard interpolants to 2D data, based on inverse distance weighting.
2028. shepard_interp_2d_test
2029. shepard_interp_nd, an Octave code which defines and evaluates Shepard interpolants to M dimensional data, based on inverse distance weighting.
2030. shepard_interp_nd_test
2031. sigmoid, an Octave code which evaluates derivatives of any order for the sigmoid function s(x)=1/(1+exp(-x)).
2032. sigmoid_test
2033. simplex_coordinates, an Octave code which computes the Cartesian coordinates of the vertices of a regular simplex in M dimensions.
2034. simplex_coordinates_test
2035. simplex_gm_rule, an Octave code which defines Grundmann-Moeller quadrature rules over the interior of a triangle in 2D, a tetrahedron in 3D, or over the interior of the simplex in M dimensions.
2036. simplex_gm_rule_test
2037. simplex_grid, an Octave code which generates a regular grid of points over the interior of an arbitrary simplex in M dimensions.
2038. simplex_grid_test
2039. simplex_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of the unit simplex in M dimensions.
2040. simplex_integrals_test
2041. simplex_monte_carlo, an Octave code which uses the Monte Carlo method to estimate an integral over the interior of the unit simplex in M dimensions.
2042. simplex_monte_carlo_test
2043. sinc, an Octave code which evaluates the sinc() function, its first and second derivative and its antiderivative. The normalized function is defined by sincn=sin(pi*x)/(pi*x), the unnormalized function is sincu=sin(x)/x. Plots of these functions are made.
2044. sinc_test
2045. sine_gordon_exact, an Octave code which returns an exact solution of the Sine-Gordon equation, a partial differential equation (PDE) of the form uxy=sin(u).
2046. sine_gordon_exact_test
2047. sine_integral, an Octave code which evaluates the Cosine Integral and the Sine Integral, by Shanjie Zhang, Jianming Jin;
2048. sine_integral_test
2049. sine_transform, an Octave code which demonstrates properties of the discrete sine transform (DST).
2050. sine_transform_test
2051. sir_ode, an Octave code which sets up and solves the ordinary differential equations (ODE) which simulate the spread of a disease using the Susceptible/Infected/Recovered (SIR) model.
2052. sir_ode_test
2053. sir_simulation, an Octave code which simulates the spread of a disease through a hospital room of M by N beds, using the Susceptible/Infected/Recovered (SIR) model.
2054. sir_simulation_test
2055. slap_io, an Octave code which reads and writes sparse matrix files in the SLAP format;
2056. slap_io_test
2057. sling_ode, an Octave code which sets up and solves a system of ordinary differential equations (ODE) for which the exact circular solution can only be approximated for a short interval before it decays to zero.
2058. sling_ode_test
2059. smolyak_display, an Octave code which displays the exactness diagram for a 2D Smolyak sparse grid, by displaying and summing the exactness diagrams for the component product rules.
2060. smolyak_display_test
2061. snakes_and_ladders, an Octave code which provides tools for studying the game of Snakes and Ladders.
2062. snakes_and_ladders_simulation, an Octave code which simulates a one-player game of Snakes and Ladders, to produce histograms of the count, PDF and CDF estimates for the length of a one-player game.
2063. snakes_and_ladders_simulation_test
2064. snakes_matrix, an Octave code which returns the transition matrix for the game of Snakes and Ladders.
2065. snakes_matrix_test
2066. snakes_probability, an Octave code which computes the game length probabilities for the game of Snakes and Ladders, by Desmond Higham and Nicholas Higham.
2067. snakes_probability_test
2068. sncndn, an Octave code which evaluates the Jacobi elliptic functions sn(u,m), cn(u,m), and dn(u,m).
2069. sncndn_test
2070. solve, an Octave code which uses Gauss elimination to solve a linear system A*x=b.
2071. solve_test
2072. sor, an Octave code which uses the successive over-relaxation (SOR) iteration to solve a linear system of equations.
2073. sor_test
2074. sort_test, an Octave code which calls the sort() function to sort objects of several types.
2075. sort_rc, an Octave code which sorts a list of any kind of objects, using reverse communication (RC).
2076. sort_rc_test
2077. sparse_test, an Octave code which tests the sparse() function for creating sparse matrices and carrying out linear algebraic functions on them;
2078. sparse_count, an Octave 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.
2079. sparse_count_test
2080. sparse_display, an Octave code which reads information defining a matrix of numbers and displays the sparsity pattern or location of the nonzero elements using gnuplot(). This operation is already available in the built-in matplotlib spy() function.
2081. sparse_display_test
2082. sparse_grid_cc, an Octave code which creates sparse grids based on Clenshaw-Curtis (CC) quadrature rules.
2083. sparse_grid_cc_test
2084. sparse_grid_gl, an Octave code which creates sparse grids based on Gauss-Legendre (GL) rules.
2085. sparse_grid_gl_test
2086. sparse_grid_hermite, an Octave code which creates sparse grids based on Gauss-Hermite rules.
2087. sparse_grid_hermite_test
2088. sparse_grid_hw, an Octave 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.
2089. sparse_grid_hw_test
2090. sparse_grid_laguerre, an Octave code which creates sparse grids based on Gauss-Laguerre rules.
2091. sparse_grid_laguerre_test
2092. sparse_grid_mixed, an Octave code which creates a sparse grid dataset based on a mixed set of 1D factor rules.
2093. sparse_grid_mixed_test
2094. sparse_grid_total_poly, an Octave code which investigates the total polynomial approximation using sparse grids.
2095. sparse_grid_total_poly_test
2096. sparse_interp_nd, an Octave code which defines a sparse interpolant to a function f(x) of a M dimensional argument.
2097. sparse_interp_nd_test
2098. spd_test, an Octave code which performs a few tests on a real matrix to determine whether it is symmetric positive definite (SPD).
2099. sphere_cubed_grid, an Octave 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.
2100. sphere_cubed_grid_test
2101. sphere_cvt, an Octave code which carries out the Centroidal Voronoi Tessellation (CVT) iteration on the surface of the unit sphere in 3D.
2102. sphere_cvt_test
2103. sphere_delaunay, an Octave code which computes the Delaunay triangulation of points on the surface of the unit sphere in 3D.
2104. sphere_delaunay_test
2105. sphere_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected on the surface of the unit sphere in 3D.
2106. sphere_distance_test
2107. sphere_exactness, an Octave code which tests the polynomial exactness of a quadrature rule on the surface of the unit sphere in 3D.
2108. sphere_exactness_test
2109. sphere_fibonacci_grid, an Octave code which uses a Fibonacci spiral to create a grid of points on the surface of the unit sphere in 3D.
2110. sphere_fibonacci_grid_test
2111. sphere_grid, an Octave code which provides a number of ways of generating grids of points, or of points and lines, or of points and lines and faces, on the surface of the unit sphere in 3D.
2112. sphere_grid_test
2113. sphere_integrals, an Octave code which returns the exact value of the integral of any monomial over the surface of the unit sphere in 3D.
2114. sphere_integrals_test
2115. sphere_lebedev_rule, an Octave code which computes Lebedev quadrature rules on the surface of the unit sphere in 3D.
2116. sphere_lebedev_rule_test
2117. sphere_lebedev_rule_display, an Octave code which reads a file defining a Lebedev quadrature rule on the surface of the unit sphere in 3D and displays the point locations.
2118. sphere_lebedev_rule_display_test
2119. sphere_llq_grid, an Octave code which uses longitudes and latitudes to create grids of points, lines, and quadrilaterals on the surface of the unit sphere in 3D.
2120. sphere_llq_grid_test
2121. sphere_llt_grid, an Octave code which uses longitudes and latitudes to create grids of points, lines, and triangles on the surface of the unit sphere in 3D.
2122. sphere_llt_grid_test
2123. sphere_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function on the surface of the unit sphere in 3D.
2124. sphere_monte_carlo_test
2125. sphere_positive_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected on the surface of the unit positive sphere in 3D.
2126. sphere_positive_distance_test
2127. sphere_quad, an Octave code which uses triangulation to approximate an integral on the surface of the unit sphere in 3D.
2128. sphere_quad_test
2129. sphere_stereograph, an Octave 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.
2130. sphere_stereograph_test
2131. sphere_stereograph_display, an Octave code which computes and displays the results of several stereographic projections between points on the surface of the unit sphere in 3D and a plane.
2132. sphere_stereograph_display_test
2133. sphere_triangle_monte_carlo, an Octave 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;
2134. sphere_triangle_monte_carlo_test
2135. sphere_triangle_quad, an Octave code which uses quadrature to estimate the integral of a function over a spherical triangle on the surface of the unit sphere in 3D.
2136. sphere_triangle_quad_test
2137. sphere_voronoi, an Octave code which computes the Voronoi diagram of points on the surface of the unit sphere in 3D.
2138. sphere_voronoi_test
2139. spherical_harmonic, an Octave code which evaluates spherical harmonic functions.
2140. spherical_harmonic_test
2141. spiral_pde, an Octave code which solves a pair of reaction-diffusion partial differential equations (PDE) over a rectangular domain with periodic boundary condition, whose solution is known to evolve into a pair of spirals.
2142. spiral_pde_test
2143. spline, an Octave code which interpolates and approximates via splines;
2144. spline_test
2145. spquad, an Octave code which computes the points and weights of a sparse grid quadrature rule for an M-dimensional integral, based on the Clenshaw-Curtis quadrature rule, by Greg von Winckel.
2146. spquad_test
2147. spring_ode, an Octave code which sets up and solves a system of ordinary differential equations (ODE) for the motion of a spring with mass m, damping b, and stiffness k.
2148. spring_ode_test
2149. spring_double_ode, an Octave code which sets up and solves a system of ordinary differential equations (ODE) for a system in which a mass is connected by a spring to a mass connected by a spring to a fixed support.
2150. spring_double_ode_test
2151. spring_sweep_ode, an Octave code which computes a grid of solutions to a parameterized system of ordinary differential equations (ODE) that represent the motion of a spring with mass m, damping b, and stiffness k.
2152. spring_sweep_ode_test
2153. square_arbq_rule, an Octave 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.
2154. square_arbq_rule_test
2155. square_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected from the interior of the unit square in 2D.
2156. square_distance_test
2157. square_exactness, an Octave code which investigates the polynomial exactness of quadrature rules for f(x,y) over the interior of a rectangle in 2D.
2158. square_exactness_test
2159. square_felippa_rule, an Octave code which returns a Felippa quadrature rules for approximating integrals over the interior of a square in 2D.
2160. square_felippa_rule_test
2161. square_grid, an Octave code which computes a grid of points over the interior of a square in 2D.
2162. square_grid_test
2163. square_hex_grid, an Octave code which computes a hexagonal grid of points over the interior of a square in 2D.
2164. square_hex_grid_test
2165. square_integrals, an Octave 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.
2166. square_integrals_test
2167. square_minimal_rule, an Octave 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.
2168. square_minimal_rule_test
2169. square_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit square in 2D.
2170. square_monte_carlo_test
2171. square_surface_distance, an Octave code which estimates the expected value of the distance between a pair of points randomly selected on the surface of the unit square.
2172. square_surface_distance_test
2173. square_symq_rule, an Octave 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.
2174. square_symq_rule_test
2175. squircle_ode, an Octave code which sets up and solves a system of ordinary differential equations (ODE) for a pair of functions that generalize the sine and cosine, and whose phase portrait is a squircle, a sort of squared circle.
2176. squircle_ode_test
2177. st_io, an Octave code which reads and writes sparse linear systems stored in the Sparse Triplet (ST) format.
2178. st_io_test
2179. st_to_ccs, an Octave code which converts sparse matrix data from Sparse Triplet (ST) format to Compressed Column Storage (CCS) format;
2180. st_to_ccs_test
2181. st_to_hb, an Octave code which converts sparse matrix data from Sparse Triplet (ST) format to Harwell Boeing (HB) format;
2182. st_to_hb_test
2183. st_to_mm, an Octave code which converts sparse matrix data from Sparse Triplet (ST) format to Matrix Market (MM) format;
2184. st_to_mm_test
2185. st_to_msm, an Octave code which reads a Sparse Triplet (ST) file and creates a corresponding MATLAB Sparse Matrix (MSM).
2186. st_to_msm_test
2187. standing_wave_exact, an Octave code which returns an exact standing wave solution u(x,t) of the partial differential equation (PDE): utt = c^2 uxx, describing a wave in a 1D spatial region with propagation speed c.
2188. standing_wave_exact_test
2189. steinerberger, an Octave code which evaluates the Steinerberger function, a continuous function with discontinuous derivative, which is very hard to accurately plot, integrate, minimize, or interpolate. Plots are made of several of the functions.
2190. steinerberger_test
2191. stetter_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) for which a specific time step sequence causes the implicit trapezoidal method to be unstable, while the implicit midpoint method will be stable. Note that the right hand side function f(t,y) is periodic, discontinuous, and piecewise linear.
2192. stetter_ode_test
2193. stiff_exact, an Octave code which returns an exact solution y(t) to a stiff ordinary differential equation (ODE) of the form y' = lambda * ( cos(t-t0) - y).
2194. stiff_exact_test
2195. stiff_ode, an Octave code which sets up and solves an ordinary differential equation (ODE) which is an example of a stiff ODE.
2196. stiff_ode_test
2197. stla_display, an Octave code which displays an ASCII stereolithography (STL) 3D graphics file;
2198. stla_display_test
2199. stla_io, an Octave code which reads and writes an ASCII stereolithography (STL) 3D graphics file;
2200. stla_io_test
2201. stla_to_tri_surface, an Octave code which reads an ASCII stereolithography (STL) 3D graphics file and extracts the surface mesh data as a TRI_SURFACE dataset.
2202. stla_to_tri_surface_test
2203. stla_to_tri_surface_fast, an Octave code which is a faster version of stla_to_tri_surface().
2204. stla_to_tri_surface_fast_test
2205. stochastic_diffusion, an Octave code which implements several versions of a stochastic diffusivity coefficient.
2206. stochastic_diffusion_test
2207. stochastic_heat2d, an Octave code which implements a finite difference method (FDM) for the steady 2D heat equation, with a stochastic heat diffusivity coefficient.
2208. stochastic_heat2d_test
2209. stochastic_rk, an Octave code which applies a Runge Kutta (RK) scheme to a stochastic ordinary differential equation (SDE).
2210. stochastic_rk_test
2211. stokes_2d_exact, an Octave code which evaluates exact solutions (u,v,p)(x,y) to the incompressible steady Stokes equations in 2D, which are a system of partial differential equations (PDE) of the form: -uxx-uyy+px=f, -vxx-vyy+py=g, ux+vy=h.
2212. stokes_2d_exact_test
2213. string_pde, an Octave code which sets up and solves the partial differential equations (PDE) describing a vibrating string, creating files to be displayed by gnuplot().
2214. string_pde_test
2215. stroud_rule, an Octave 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.
2216. stroud_rule_test
2217. subpak, an Octave code which includes a number of utility routines.
2218. subpak_test
2219. subset, an Octave 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.
2220. subset_test
2221. subset_distance, an Octave code which estimates the expected value of the Hamming distance between a pair of randomly selected subsets of an M set.
2222. subset_distance_test
2223. subset_sum, an Octave 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.
2224. subset_sum_test
2225. subset_sum_backtrack, an Octave 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.
2226. subset_sum_backtrack_test
2227. subset_sum_brute, an Octave code which seeks solutions of the subset sum problem, using a brute force approach.
2228. subset_sum_brute_test
2229. subset_sum_swap, an Octave 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.
2230. subset_sum_swap_test
2231. sudoku, an Octave code which handles Sudoku puzzles;
2232. sudoku_test
2233. surf_test, calls surf(), which displays a 3D surface or contour plot for data of the form Z=F(X,Y).
2234. svd_test, an Octave code which demonstrates the Singular Value Decomposition (SVD) for a simple example.
2235. svd_basis, an Octave code which applies the singular value decomposition (SVD) to a collection of data vectors, extracting dominant modes;
2236. svd_basis_test
2237. svd_circle, an Octave code which analyzes a linear map of the unit circle caused by an arbitrary 2x2 matrix A, using the singular value decomposition (SVD).
2238. svd_circle_test
2239. svd_faces, an Octave code which applies singular value decomposition (SVD) analysis to a set of images.
2240. svd_faces_test
2241. svd_fingerprint, an Octave code which reads a file containing a fingerprint image and uses the singular value decomposition (SVD) to compute and display a series of low rank approximations to the image.
2242. svd_fingerprint_test
2243. svd_gray, an Octave code which reads a gray scale image, computes the Singular Value Decomposition (SVD), and constructs a series of low rank approximations to the image.
2244. svd_gray_test
2245. svd_lls, an Octave code which uses the singular value decomposition (SVD) to construct and plot the best affine and linear relationships in the sense of least square, between two vectors of data.
2246. svd_lls_test
2247. svd_powers, an Octave code which applies singular value decomposition (SVD) analysis to a set of powers x(i)^(j-1).
2248. svd_powers_test
2249. svd_snowfall, an Octave code which reads a file containing historical snowfall data and analyzes the data with the Singular Value Decomposition (SVD).
2250. svd_snowfall_test
2251. svd_sphere, an Octave code which analyzes a linear map of the unit sphere caused by an arbitrary 3x3 matrix A, using the singular value decomposition (SVD).
2252. svd_sphere_test
2253. svd_truncated_test, an Octave code which calls the economy version of the Singular Value Decomposition (SVD) of an M by N rectangular matrix, in cases where M is less than N or N is less than M.
2254. sympy_test, an Octave code which tests sympy(), the symbolic mathematics package.
2255. t_puzzle, an Octave code which considers the T puzzle, a set of 4 wooden pieces. The challenge is to arrange the pieces to form the shape of the letter T. Three other challenge shapes are an arrow, a rhombus, and a fat T.
2256. t_puzzle_test
2257. table_io, an Octave code which reads and writes a simple table file;
2258. table_io_test
2259. task_division, an Octave code which implements a simple procedure for smoothly dividing T tasks among P processors; such a method can be useful in MPI and other parallel environments, particularly when T is not an exact multiple of P, and when the processors can be indexed starting from 0 or from 1.
2260. task_division_test
2261. tec_io, an Octave code which reads or writes a tecplot() ASCII TEC file containing a model associated with the finite element method (FEM).
2262. tec_io_test
2263. tec_to_fem, an Octave code which converts a tecplot() ASCII TEC file into an FEM model.
2264. tec_to_fem_test
2265. tec_to_vtk, an Octave code which converts a tecplot() TEC file into a set of VTK files.
2266. tec_to_vtk_test
2267. tennis_matrix, an Octave code which computes the transition matrix for a game of tennis, which has 17 distinct states.
2268. tennis_matrix_test
2269. tensor_grid_display, an Octave code which displays the grid points of a tensor product rule used for interpolation or quadrature, in 1D, 2D or 3D.
2270. tensor_grid_display_test
2271. test_approx, an Octave code which implements test problems for approximation, provided as a set of (x,y) data.
2272. test_approx_test
2273. test_con, an Octave code which implements test problems for numerical continuation.
2274. test_con_test
2275. test_eigen, an Octave code which implements test matrices for eigenvalue analysis.
2276. test_eigen_test
2277. test_int, an Octave code which implements test problems for approximate integration (quadrature) in one dimension.
2278. test_int_test
2279. test_int_2d, an Octave code which implements test problems for approximate integration (quadrature) in two dimensions.
2280. test_int_2d_test
2281. test_int_nd, an Octave code which defines test functions for M-dimensional quadrature routines.
2282. test_int_nd_test
2283. test_interp, an Octave code which defines test problems for interpolation, provided as a set of (x,y(x)) data.
2284. test_interp_test
2285. test_interp_1d, an Octave code which defines test problems for interpolation of data y(x), which depends on a 1D argument.
2286. test_interp_1d_test
2287. test_interp_2d, an Octave code which defines test problems for interpolation of data z(x,y), which depends on a 2D argument.
2288. test_interp_2d_test
2289. test_interp_fun, an Octave code which defines test problems for interpolation which are available in functional form.
2290. test_interp_fun_test
2291. test_interp_nd, an Octave code which defines test problems for interpolation of data z(x), depending on an M dimensional argument.
2292. test_interp_nd_test
2293. test_lls, an Octave code which implements linear least squares (LLS) test problems of the form A*x=b.
2294. test_lls_test
2295. test_matrix, an Octave 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.
2296. test_matrix_test
2297. test_matrix_exponential, an Octave code which defines a set of test cases for computing the matrix exponential.
2298. test_matrix_exponential_test
2299. test_min, an Octave code which implements test problems for minimization of a scalar function of a scalar variable.
2300. test_min_test
2301. test_nearest, an Octave code which tests the time complexity of various procedures for solving the nearest neighbor problem.
2302. test_nearest_test
2303. test_nonlin, an Octave code which implements test problems for the solution of systems of nonlinear equations.
2304. test_nonlin_test
2305. test_opt, an Octave code which implements test problems for optimization of a scalar function of several variables.
2306. test_opt_test
2307. test_opt_con, an Octave 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.
2308. test_opt_con_test
2309. test_optimization, an Octave code which implements test problems for optimization of a scalar function of several variables, as described by Molga and Smutnicki.
2310. test_optimization_test
2311. test_partial_digest, an Octave code which generates example cases of the partial digest problem.
2312. test_partial_digest_test
2313. test_triangulation, an Octave code which defines test problems for triangulation;
2314. test_triangulation_test
2315. test_values, an Octave 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.
2316. test_values_test
2317. test_zero, an Octave code which defines some functions f(x) suitable for testing software that solves a nonlinear equation f(x)=0;
2318. test_zero_test
2319. tester, a BASH script which runs the Octave tests.
2320. tet_mesh, an Octave code which works with tetrahedral meshes in 3D;
2321. tet_mesh_test
2322. tet_mesh_boundary, an Octave code which reads information defining a tetrahedral mesh of points in 3D, and determines the triangular faces that form the boundary of the mesh; it writes out files containing the nodes and elements defining this TRI_SURFACE data.
2323. tet_mesh_boundary_test
2324. tet_mesh_display, an Octave code which reads data defining a tetrahedral mesh, and displays a wireframe image of the nodes and edges;
2325. tet_mesh_display_test
2326. tet_mesh_l2q, an Octave code which reads information about a 4-node linear mesh of tetrahedrons and creates data defining a corresponding 10-node quadratic mesh of tetrahedrons;
2327. tet_mesh_l2q_test
2328. tet_mesh_q2l, an Octave code which reads information about a 10-node quadratic mesh of tetrahedrons and creates data defining a corresponding 4-node linear mesh of tetrahedrons;
2329. tet_mesh_q2l_test
2330. tet_mesh_quad, an Octave code which estimates the integral of a function over a region defined by a tetrahedral mesh.
2331. tet_mesh_quad_test
2332. tet_mesh_quality, an Octave code which computes various quality measures for a tetrahedral mesh of a set of nodes in 3D;
2333. tet_mesh_quality_test
2334. tet_mesh_rcm, an Octave code which computes the Reverse Cuthill McKee (RCM) reordering for the nodes of a mesh of tetrahedrons, using 4 or 10 node elements.
2335. tet_mesh_rcm_test
2336. tet_mesh_refine, an Octave code which refines a mesh of tetrahedrons;
2337. tet_mesh_refine_test
2338. tet_mesh_tet_neighbors, an Octave code which reads information about a tetrahedral mesh and lists the tetrahedrons adjacent to a given tetrahedron;
2339. tet_mesh_tet_neighbors_test
2340. tet_mesh_to_gmsh, an Octave code which write a gmsh() file describing a tetrahedral mesh;
2341. tet_mesh_to_gmsh_test
2342. tet_mesh_to_xml, an Octave code which write an XML file describing a tetrahedral mesh;
2343. tet_mesh_to_xml_test
2344. tet_mesh_volumes, an Octave code which computes the volume of each tetrahedron in a mesh of tetrahedrons;
2345. tet_mesh_volumes_test
2346. tetrahedron, an Octave code which carries out geometric calculations involving a general tetrahedron, including solid and facial angles, face areas, point containment, distances to a point, circumsphere and insphere, measures of shape quality, centroid, barycentric coordinates, edges and edge lengths, random sampling, and volumes.
2347. tetrahedron_test
2348. tetrahedron_arbq_rule, an Octave 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.
2349. tetrahedron_arbq_rule_test
2350. tetrahedron_exactness, an Octave code which tests the polynomial exactness of a quadrature rule over the interior of a tetrahedron in 3D.
2351. tetrahedron_exactness_test
2352. tetrahedron_felippa_rule, an Octave code which returns a Felippa quadrature rules for approximating integrals over the interior of a tetrahedron in 3D.
2353. tetrahedron_felippa_rule_test
2354. tetrahedron_grid, an Octave code which computes a grid of points over the interior of a tetrahedron in 3D.
2355. tetrahedron_grid_test
2356. tetrahedron_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of the unit tetrahedron in 3D.
2357. tetrahedron_integrals_test
2358. tetrahedron_jaskowiec_rule, an Octave 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.
2359. tetrahedron_jaskowiec_rule_test
2360. tetrahedron_keast_rule, an Octave code which defines a Keast quadrature rule, of degree of exactness 0 through 8, over the interior of the tetrahedron in 3D.
2361. tetrahedron_keast_rule_test
2362. tetrahedron_monte_carlo, an Octave code which uses the Monte Carlo method to estimate an integral over the interior of a general tetrahedron in 3D.
2363. tetrahedron_monte_carlo_test
2364. tetrahedron_ncc_rule, an Octave code which defines Newton-Cotes closed (NCC) quadrature rules over the interior of a tetrahedron in 3D.
2365. tetrahedron_ncc_rule_test
2366. tetrahedron_nco_rule, an Octave code which defines Newton-Cotes open (NCO) quadrature rules over the interior of a tetrahedron in 3D.
2367. tetrahedron_nco_rule_test
2368. tetrahedron_slice_display, an Octave code which determines the intersection between a tetrahedron and a plane and displays the result.
2369. tetrahedron_slice_display_test
2370. tetrahedron_witherden_rule, an Octave code which returns a symmetric Witherden quadrature rule for the tetrahedron, with exactness up to total degree 10.
2371. tetrahedron_witherden_rule_test
2372. tetrahedron01_monte_carlo, an Octave code which uses the Monte Carlo method to estimate an integral over the interior of the unit tetrahedron in 3D.
2373. tetrahedron01_monte_carlo_test
2374. theta_method, an Octave code which solves one or more ordinary differential equations (ODE) using the theta method.
2375. theta_method_test
2376. three_body_ode, an Octave code which sets up and solves ordinary differential equations (ODE) that simulate the behavior of three planets, constrained to lie in a plane, and moving under the influence of gravity, by Walter Gander and Jiri Hrebicek.
2377. three_body_ode_test
2378. tictoc_test, an Octave code which calls tic() and toc(), which compute elapsed time.
2379. timer_test, an Octave code which demonstrates and compares several ways of timing code execution.
2380. timestamp, an Octave code which prints the current YMDHMS date as a timestamp;
2381. timestamp_test
2382. toeplitz_cholesky, an Octave code which computes the Cholesky factorization of a symmetric positive definite (SPD) Toeplitz matrix.
2383. toeplitz_cholesky_test
2384. toeplitz_inverse, an Octave code which computes the inverse of a Toeplitz matrix.
2385. toeplitz_inverse_test
2386. toms097, an Octave code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using the Floyd algorithm. This is a version of ACM TOMS algorithm 97.
2387. toms097_test
2388. toms112, an Octave code which determines whether a point is contained in a polygon, by Moshe Shimrat. This is a version of ACM TOMS algorithm 112.
2389. toms112_test
2390. toms178, an Octave 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.
2391. toms178_test
2392. toms179, an Octave code which evaluates the modified Beta function, by Oliver Ludwig. This is a version of ACM TOMS algorithm 179.
2393. toms179_test
2394. toms243, an Octave code which evaluates the logarithm of a complex value, by David Collens. This is a version of ACM TOMS algorithm 243.
2395. toms243_test
2396. toms291, an Octave code which evaluates the logarithm of the Gamma function. This is a version of ACM TOMS algorithm 291.
2397. toms291_test
2398. toms443, an Octave code which evaluates the Lambert W function, by Fritsch, Shafer and Crowley. This is a version of ACM TOMS algorithm 443.
2399. toms443_test
2400. toms446, an Octave code which manipulates Chebyshev series for interpolation and approximation; this is a version of ACM TOMS algorithm 446, by Roger Broucke.
2401. toms446_test
2402. toms462, an Octave 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.
2403. toms462_test
2404. toms515, an Octave 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.
2405. toms515_test
2406. toms577, an Octave code which evaluates the Carlson elliptic integral functions RC, RD, RF and RJ. This is a version of ACM TOMS algorithm 577;
2407. toms577_test
2408. toms655, an Octave 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.
2409. toms655_test
2410. toms743, an Octave code which evaluates the Lambert W function. This is a version of ACM TOMS algorithm 743, by Barry, Barry and Culligan-Hensley.
2411. toms743_test
2412. toms847, an Octave code which carries out piecewise linear (PWL) multidimensional hierarchical sparse grid interpolation; this is commonly called spinterp() (version 2.1); this is a version of ACM TOMS Algorithm 847, by Andreas Klimke;
2413. toms847_test
2414. toms866, an Octave code which is version 2.2 of the Incompressible Flow Iterative Solution Software (IFISS), for fluid flow governed by the Navier Stokes equations (NSE), by Howard Elman, Alison Ramage, David Silvester; this is a version of ACM TOMS algorithm 866.
2415. toms886, an Octave 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.
2416. toms886_test
2417. toms923, an Octave code which evaluates the Pfaffian for a dense or banded skew symmetric matrix, by Michael Wimmer.
2418. toms923_test
2419. tough_ode, an Octave code which sets up and solves a system of four ordinary differential equations (ODE) which is extremely difficult to solve accurately.
2420. tough_ode_test
2421. traffic_simulation, an Octave code which simulates the cars waiting to get through a traffic light.
2422. traffic_simulation_test
2423. trapezoidal, an Octave code which solves one or more ordinary differential equations (ODE) using the (implicit) trapezoidal method, and fsolve() for the implicit system.
2424. trapezoidal_test
2425. trapezoidal_explicit, an Octave code which solves one or more ordinary differential equations (ODE) using the (explicit) trapezoidal method.
2426. trapezoidal_explicit_test
2427. trapezoidal_fixed, an Octave code which solves one or more ordinary differential equations (ODE) using the (implicit) trapezoidal method, and a fixed point method for the implicit system.
2428. trapezoidal_fixed_test
2429. traveling_wave_exact, an Octave code which returns an exact traveling wave solution u(x,t) of the partial differential equation (PDE): utt = c^2 uxx, describing a wave in a 1D spatial region with propagation speed c.
2430. traveling_wave_exact_test
2431. treepack, an Octave 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.
2432. treepack_test
2433. tri_surface_display, an Octave code which displays a TRI_SURFACE object representing a triangulated surface;
2434. tri_surface_display_test
2435. tri_surface_io, an Octave code which reads and writes the graphics information in a tri_surface file, describing a surface in 3D consisting of a collection of connected triangles;
2436. tri_surface_io_test
2437. tri_surface_to_obj, an Octave code which reads a TRI_SURFACE dataset and extracts the surface mesh data as an OBJ file.
2438. tri_surface_to_obj_test
2439. tri_surface_to_ply, an Octave code which reads a TRI_SURFACE dataset and extracts the surface mesh data as a PLY file.
2440. tri_surface_to_ply_test
2441. tri_surface_to_stla, an Octave code which reads a TRI_SURFACE dataset and extracts the surface mesh data as an ASCII stereolithography (STL) file.
2442. tri_surface_to_stla_test
2443. triangle, an Octave code which computes properties of a triangle, including angles, area, centroid, circumcircle, edge lengths, incircle, orientation, orthocenter, quality, Cartesian to barycentric coordinates, barycentric coordinates to Cartesian. A point is treated as a (1,2) array, a list of points as an (n,2) array, and a triangle as a (3,2) array.
2444. triangle_test
2445. triangle_analyze, an Octave code which reads a triangle defined in a file and computes angles, area, centroid, circumcircle, edge lengths, incircle, orientation, orthocenter, and quality.
2446. triangle_analyze_test
2447. triangle_display, an Octave code which displays the nodes and elements of a triangulation for which the data has been stored in NODE and ELE files by Jonathan Shewchuk's triangle() program.
2448. triangle_display_test
2449. triangle_distance, an Octave code which computes the expected value of the distance between a pair of points randomly selected from the interior of a triangle in 2D.
2450. triangle_distance_test
2451. triangle_dunavant_rule, an Octave code which returns a Dunavant quadrature rule over the interior of a triangle in 2D.
2452. triangle_dunavant_rule_test
2453. triangle_exactness, an Octave code which tests the polynomial exactness of a quadrature rule over the interior of a triangle in 2D.
2454. triangle_exactness_test
2455. triangle_fekete_rule, an Octave code which returns a Fekete rule for interpolation or quadrature over the interior of a triangle in 2D.
2456. triangle_fekete_rule_test
2457. triangle_felippa_rule, an Octave code which returns a Felippa quadrature rule for approximating integrals over the interior of a triangle in 2D.
2458. triangle_felippa_rule_test
2459. triangle_grid, an Octave code which computes a grid of points over the interior of a triangle in 2D.
2460. triangle_grid_test
2461. triangle_histogram, an Octave code which computes histograms of data over the interior of a unit triangle in 2D.
2462. triangle_histogram_test
2463. triangle_integrals, an Octave code which returns the exact value of the integral of any polynomial over the interior of an arbitrary triangle in 2D.
2464. triangle_integrals_test
2465. triangle_integrands, an Octave code which defines integrands for testing quadrature rules over a triangle.
2466. triangle_integrands_test
2467. triangle_interpolate, an Octave code which shows how vertex data can be interpolated at any point in the interior of a triangle.
2468. triangle_interpolate_test
2469. triangle_io, an Octave code which reads or writes files created by Jonathan Shewchuk's triangle() program.
2470. triangle_io_test
2471. triangle_lyness_rule, an Octave code which returns Lyness-Jespersen quadrature rules over the interior of a triangle in 2D;
2472. triangle_lyness_rule_test
2473. triangle_monte_carlo, an Octave code which uses the Monte Carlo method to estimate an integral over the interior of a general triangle in 2D.
2474. triangle_monte_carlo_test
2475. triangle_ncc_rule, an Octave code which defines Newton-Cotes Closed (NCC) quadrature rules over the interior of a triangle in 2D.
2476. triangle_ncc_rule_test
2477. triangle_nco_rule, an Octave code which defines Newton-Cotes Open (NCO) quadrature rules over the interior of a triangle in 2D.
2478. triangle_nco_rule_test
2479. triangle_quadrature_symmetry, an Octave code which determines the symmetries of a quadrature rule for a triangle.
2480. triangle_quadrature_symmetry_test
2481. triangle_refine, an Octave code which divides a triangle into c^2 copies of itself, and implements a simple centroid-based quadrature scheme.
2482. triangle_refine_test
2483. triangle_svg, an Octave code which uses Scalable Vector graphics (SVG) to plot a triangle and any number of points, to illustrate quadrature rules and sampling techniques.
2484. triangle_svg_test
2485. triangle_symq_rule, an Octave code which returns efficient symmetric quadrature rules, with exactness up to total degree 50, over the interior of a triangle in 2D, by Hong Xiao and Zydrunas Gimbutas.
2486. triangle_symq_rule_test
2487. triangle_symq_rule_convert, an Octave code which takes quadrature rules defined for the equilateral triangle and converts them to the reference triangle (0,0), (1,0), (0,1).
2488. triangle_symq_rule_convert_test
2489. triangle_symq_rule_original, an Octave code which is based on the original Fortran77 code, which uses an equilateral triangle as the reference element, by Hong Xiao and Zydrunas Gimbutas.
2490. triangle_symq_rule_original_test
2491. triangle_symq_to_ref, an Octave code which creates quadrature rules defined on the half-unit square from symmetric quadrature rules defined on an equilateral triangle, defined by triangle_symq_rule(), by Hong Xiao and Zydrunas Gimbutas.
2492. triangle_symq_to_ref_test
2493. triangle_to_fem, an Octave 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.
2494. triangle_to_fem_test
2495. triangle_to_medit, an Octave 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.
2496. triangle_to_medit_test
2497. triangle_to_xml, an Octave code which reads the NODE and ELE files created by Jonathan Shewchuk's triangle() program to describe a triangular mesh in 2D, and writes a corresponding XML mesh file for use by dolfin() or fenics().
2498. triangle_to_xml_test
2499. triangle_twb_rule, an Octave code which generates the points and weights of quadrature rules over the interior of a triangle in 2D, determined by Taylor, Wingate, and Bos.
2500. triangle_twb_rule_test
2501. triangle_wandzura_rule, an Octave code which returns a Wandzura quadrature rule of exactness 5, 10, 15, 20, 25 and 30 over the interior of the triangle in 2D.
2502. triangle_wandzura_rule_test
2503. triangle_witherden_rule, an Octave code which returns a symmetric Witherden quadrature rule for the triangle, with exactness up to total degree 20.
2504. triangle_witherden_rule_test
2505. triangle01_integrals, an Octave code which returns the integral of any monomial over the interior of the unit triangle in 2D.
2506. triangle01_integrals_test
2507. triangle01_monte_carlo, an Octave code which uses the Monte Carlo method to estimate an integral over the interior of the unit triangle in 2D.
2508. triangle01_monte_carlo_test-
2509. triangulate, an Octave code which triangulates a polygonal region, based on a C program by Joseph ORourke;
2510. triangulate_test
2511. triangulate_rectangle, an Octave code which sets up a grid of triangles in a rectangular region.
2512. triangulate_rectangle_test
2513. triangulation, an Octave code which computes the triangulation of a set of points in the plane, and performs various operations using a triangulation, including searching a Delaunay triangulation to find which triangle contains a given point.
2514. triangulation_test
2515. triangulation_boundary, an Octave code which starts with a triangulation of a simple shape, and determines the triangle edges that form the boundary, and a sequence of nodes that trace the boundary.
2516. triangulation_boundary_test
2517. triangulation_boundary_edges, an Octave code which reads data defining a triangulation, determines which edges lie on the boundary, organizes them into connected components, and writes this information to a file.
2518. triangulation_boundary_edges_test
2519. triangulation_boundary_nodes, an Octave code which reads data defining a triangulation, determines which nodes lie on the boundary, and writes their coordinates to a file;
2520. triangulation_boundary_nodes_test
2521. triangulation_corner, an Octave code which patches triangulations so that no triangle has two sides on the boundary.
2522. triangulation_corner_test
2523. triangulation_delaunay_discrepancy, an Octave code which measures the amount by which a triangulation fails the local Delaunay test;
2524. triangulation_delaunay_discrepancy_test
2525. triangulation_display, an Octave code which displays the nodes and elements of a triangulation;
2526. triangulation_display_test
2527. triangulation_histogram, an Octave code which computes histograms of data over a triangulation.
2528. triangulation_histogram_test
2529. triangulation_l2q, an Octave code which reads information about a 3-node linear triangulation and creates data defining a corresponding 6-node quadratic triangulation;
2530. triangulation_l2q_test
2531. triangulation_mask, an Octave code which reads a triangulation and calls a user-supplied routine to consider each triangle for deletion;
2532. triangulation_mask_test
2533. triangulation_node_to_element, an Octave code which reads files describing a set of nodes, their triangulation, and the value of one or more quantities at each node, and outputs a file that averages the quantities for each element. This operation in effect creates an order1 finite element model of the data.
2534. triangulation_node_to_element_test
2535. triangulation_order1_display, an Octave code which plots piecewise constant (PWC) data associated with a triangulation;
2536. triangulation_order1_display_test
2537. triangulation_order3_contour, an Octave code which plots color contours of a piecewise linear (PWL) scalar quantity evaluated at the nodes of a 3-node triangle triangulation.
2538. triangulation_order3_contour_test
2539. triangulation_order6_contour, an Octave code which plots color contours of a piecwise quadratic (PWQ) scalar quantity evaluated at the nodes of a 6-node triangle triangulation.
2540. triangulation_order6_contour_test
2541. triangulation_orient, an Octave code which ensures that the triangles in an order 3 or order 6 triangulation have positive orientation;
2542. triangulation_orient_test
2543. triangulation_plot, an Octave code which plots the nodes and elements of a triangulation as a PostScript file;
2544. triangulation_plot_test
2545. triangulation_q2l, an Octave code which reads information about a 6-node quadratic triangulation and creates data defining a corresponding 3-node linear triangulation;
2546. triangulation_q2l_test
2547. triangulation_quad, an Octave 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.
2548. triangulation_quad_test
2549. triangulation_quality, an Octave code which reads information about a triangulation and computes various quality measures;
2550. triangulation_quality_test
2551. triangulation_rcm, an Octave 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.
2552. triangulation_rcm_test
2553. triangulation_refine, an Octave code which refines a triangulation;
2554. triangulation_refine_test
2555. triangulation_refine_local, an Octave code which refines a triangulation locally; a single triangular element is replaced by four smaller triangles, and neighboring information is updated.
2556. triangulation_refine_local_test
2557. triangulation_svg, an Octave code which creates a Scalable Vector graphics (SVG) image of a triangulation, which can be displayed by a web browser.
2558. triangulation_svg_test
2559. triangulation_t3_to_t4, an Octave code which reads information about a 3-node triangulation and creates data defining a corresponding 4-node triangulation (vertices + centroid);
2560. triangulation_t3_to_t4_test
2561. triangulation_triangle_neighbors, an Octave code which reads data defining a triangulation, finds the three neighbor triangles for each triangle, and writes them to a file;
2562. triangulation_triangle_neighbors_test
2563. tridiagonal_solver, an Octave code which solves a tridiagonal linear system.
2564. tridiagonal_solver_test
2565. trig_interp, an Octave code which uses trigonometric functions for interpolation.
2566. trig_interp_test
2567. trig_interp_basis, an Octave code which evaluates the cardinal basis functions for trigonometric interpolation of equally spaced data.
2568. trig_interp_basis_test
2569. trinity, an Octave code which considers the trinity puzzle, a smaller version of the eternity puzzle. The trinity puzzle specifies a region R composed of 144 30-60-90 triangles, and a set of 4 "tiles", T1, T2, T3 and T4, each consisting of 36 30-60-90 triangles, and seeks an arrangement of the four tiles that exactly covers the region.
2570. trinity_test
2571. truel_simulation, an Octave code which simulates N repetitions of a duel between three players, each of whom has a known firing accuracy.
2572. truel_simulation_test
2573. truncated_normal, an Octave 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.
2574. truncated_normal_test
2575. truncated_normal_rule, an Octave code which computes a quadrature rule for a normal probability density function (PDF), sometimes called a Gaussian distribution, that has been truncated to [A,+oo), (-oo,B] or [a,b].
2576. truncated_normal_rule_test
2577. truncated_normal_sparse_grid, an Octave code which computes a sparse grid based on a normal probability density function (PDF), also called a Gaussian distribution, that has been truncated to [A,+oo), (-oo,B] or [A,B].
2578. truncated_normal_sparse_grid_test
2579. tsp_brute, an Octave code which reads a file of city-to-city distances and solves a (small!) traveling salesperson problem (TSP), using brute force.
2580. tsp_brute_test
2581. tsp_descent, an Octave code which reads a file of city-to-city distances, chooses an initial tour at random, and then tries some simple variations to quickly find a tour of lower length, to solve the traveling salesperson problem (TSP).
2582. tsp_descent_test
2583. tsp_greedy, an Octave code which reads a file of city-to-city distances, and solves a small traveling salesperson problem (TSP) using the greedy algorithm. It picks a starting city at random, and then successively visits the nearest unvisited city.
2584. tsp_greedy_test
2585. tsp_moler, an Octave code which tries to optimize the traveling salesperson problem (TSP), written by Cleve Moler.
2586. tsp_moler_test
2587. tsp_random, an Octave code which seeks a solution of the Traveling Salesperson Problem (TSP), by accepting a table of city-to-city distances, and randomly generating round trips that visit every city, returning the tour of shortest length.
2588. tsp_random_test
2589. two_body_ode, an Octave 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.
2590. two_body_ode_test
2591. ubvec, an Octave code which demonstrates how nonnegative integers can be stored as unsigned binary vectors (UBVEC), and arithmetic can be performed on them.
2592. ubvec_test
2593. ulam_spiral, an Octave code which displays the integers as a spiral of grid cells, with the primes highlighted, so show that they tend to fall along diagonals, as discovered by Stanislaw Ulam.
2594. ulam_spiral_test
2595. unicycle, an Octave code which considers permutations containing a single cycle, sometimes called cyclic permutations.
2596. unicycle_test
2597. uniform, an Octave code which implements a uniform random number generator (RNG) for a variety of arithmetic types.
2598. uniform_test
2599. unstable_ode, an Octave code which sets up and solves an unstable ordinary differential equation (ODE) which the backward Euler method incorrectly drives to zero.
2600. unstable_ode_test
2601. upc, an Octave code which determines the check digit for a Uniform product Code (UPC) or reports whether a given UPC is valid.
2602. upc_test
2603. urn_simulation, an Octave code which simulates the experiment of sampling K balls from an urn containing N balls of various colors.
2604. urn_simulation_test
2605. usa_box_plot, an Octave code which creates simplified maps of the USA in which each state appears as a box, and the placement of the boxes only roughly corresponds to the relative locations of states on an accurate map.
2606. usa_box_plot_test
2607. usa_cvt_geo, an Octave code which explores the creation of a centroidal Voronoi Tessellation (CVT) of the continental United States, based solely on geometric considerations.
2608. usa_cvt_geo_test
2609. usa_matrix, an Octave code which defines the adjacency matrix for US states, using a variety of matrix formats.
2610. usa_matrix_test
2611. van_der_corput, an Octave code which computes elements of the van der Corput 1-dimensional Quasi Mont Carlo (QMC) sequence, using a simple interface.
2612. van_der_corput_test
2613. vandermonde, an Octave code which implements the Bjork-Pereyra algorithm for accurate solution of linear systems involving the Vandermonde matrix.
2614. vandermonde_test
2615. vandermonde_approx_1d, an Octave 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.
2616. vandermonde_approx_1d_test
2617. vandermonde_approx_2d, an Octave 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.
2618. vandermonde_approx_2d_test
2619. vandermonde_interp_1d, an Octave code which finds a polynomial interpolant to data y(x) of a 1D argument by solving a linear system for the polynomial coefficients involving the Vandermonde matrix.
2620. vandermonde_interp_1d_test
2621. vandermonde_interp_2d, an Octave code which finds a polynomial interpolant to data z(x,y) of a 2D argument by solving a linear system for the polynomial coefficients involving the Vandermonde matrix.
2622. vandermonde_interp_2d_test
2623. vanderpol_ode, an Octave code which sets up and solves the van der Pol system of ordinary differential equations (ODE).
2624. vanderpol_ode_test
2625. vanderpol_ode_period, an Octave code which sets up and solves the ordinary differential equations (ODE) defining the van der Pol oscillator in order to estimate the period of the limit cycle.
2626. vanderpol_ode_period_test
2627. variomino, an Octave code which considers variominoes, which are polyominoes in which each square has been assigned a positive label or "variety", and the determination of tilings of a region using a specific set of variominoes.
2628. variomino_test
2629. vector, an Octave code which considers a problem involving vectors, which can be considered to belong to equivalence classes, for which an arbitrary collection of coefficients must be gathered, averaged, and then scattered again.
2630. vector_test
2631. velocity_verlet, an Octave code which uses a version of the velocity Verlet method to solve a second order ordinary differential equation (ODE) of the form y''=f(t,y).
2632. velocity_verlet_test
2633. verlet_simulation, an Octave code which demonstates the use of Verlet integration to simulate simple problems in dynamics, involving changes in position and velocity.
2634. verlet_simulation_test
2635. vin, an Octave code which computes the check digit for a Vehicle Identification Number (VIN), or verifies that a given VIN is legitimate.
2636. vin_test
2637. voronoi_city, an Octave code which displays the steps involved in computing the Voronoi diagram of 3 points, which we think of as cities connected by roads.
2638. voronoi_city_test
2639. voronoi_display, an Octave code which computes and displays the Voronoi diagram of a set of points.
2640. voronoi_display_test
2641. voronoi_mountains, an Octave code which makes a mountain plot of a Voronoi diagram, that is, a surface plot of the distance from each point to its nearest Voronoi generator.
2642. voronoi_mountains_test
2643. voronoi_neighbors, an Octave code which is given a set of points in the plane and determines the Voronoi adjacency structure, that is, the points which share an edge of the Voronoi diagram.
2644. voronoi_neighbors_test
2645. voronoi_plot, an Octave code which estimates the Voronoi neighborhoods of points using sampling, and with a distance based on the L1, L2, LInfinity or arbitrary LP norms;
2646. voronoi_plot_test
2647. voronoi_test, an Octave code which calls the built-in voronoi() function, which computes the Voronoi diagram of a set of points.
2648. vpa_test, an Octave code which uses the Symbolic package to compute arbitrary precision quantities.
2649. walker_sample, an Octave code which efficiently samples a discrete probability vector using Walker sampling.
2650. walker_sample_test
2651. walsh_transform, an Octave code which implements the Walsh data transform.
2652. walsh_transform_test
2653. wathen_matrix, an Octave code which compares storage schemes (full, banded, sparse triplet, sparse) and solution strategies (A\x, Linpack, conjugate gradient) for linear systems involving the Wathen matrix, which arises when solving a problem using the finite element method (FEM).
2654. wathen_matrix_test
2655. wave_pde, an Octave code which uses the finite difference method (FDM) in space, and the method of lines in time, to set up and solve the partial differential equations (PDE) known as the wave equations, utt = c uxx.
2656. wave_pde_test
2657. wavelet, an Octave code which does some simple calculations with wavelet transforms;
2658. wavelet_test
2659. web_matrix, an Octave code which stores sample matrices describing a web page network. These matrices are typically very sparse, and the examples here are stored using the sparse triplet (ST) format. They can be used to demonstrate pagerank and other graph algorithms.
2660. web_matrix_test
2661. wedge_exactness, an Octave code which investigates the polynomial exactness of a quadrature rule over the interior of the unit wedge in 3D.
2662. wedge_exactness_test
2663. wedge_felippa_rule, an Octave code which returns quadrature rules for approximating integrals over the interior of the unit wedge in 3D.
2664. wedge_felippa_rule_test
2665. wedge_grid, an Octave code which computes a grid of points over the interior of the unit wedge in 3D.
2666. wedge_grid_test
2667. wedge_integrals, an Octave code which returns the exact value of the integral of any monomial over the interior of the unit wedge in 3D.
2668. wedge_integrals_test
2669. wedge_monte_carlo, an Octave code which uses the Monte Carlo method to estimate an integral over the interior of the unit wedge in 3D.
2670. wedge_monte_carlo_test
2671. weekday, an Octave code which determines the day of the week corresponding to a given date, such as 14 October 1066, Julian calendar, ... which was a Saturday.
2672. weekday_test
2673. weekday_zeller, an Octave code which uses the Zeller congruence to determine the day of the week corresponding to a given date, such as 13 July 1989, Gregorian calendar, ... which was a Thursday.
2674. weekday_zeller_test
2675. welzl, an Octave code which computes the minimal bounding circle or sphere for a set of points, using algorithms by Welzl or Ritter, by Anton Semechko.
2676. welzl_test
2677. will_you_be_alive, an Octave code which carries out the probability simulations described in "Will You Be Alive 10 Years From Now?" by Paul Nahin;
2678. will_you_be_alive_test
2679. wishart_matrix, an Octave code which produces sample matrices from the Wishart or Bartlett distributions, useful for sampling random covariance matrices.
2680. wishart_matrix_test
2681. wtime, an Octave code which returns a reading of the wall clock time in seconds.
2682. wtime_test
2683. xyz_display, an Octave code which displays a 3D plot from a file of point coordinates.
2684. xyz_display_test
2685. zero_brent, an Octave code which seeks a solution of a scalar nonlinear equation f(x)=0, by Richard Brent.
2686. zero_brent_test
2687. zero_chandrupatla, an Octave 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.
2688. zero_chandrupatla_test
2689. zero_itp, an Octave 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.
2690. zero_itp_test
2691. zero_laguerre, an Octave 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.
2692. zero_laguerre_test
2693. zero_muller, an Octave code which seeks a root of a nonlinear equation using the Muller method, with complex arithmetic.
2694. zero_muller_test
2695. zero_rc, an Octave code which seeks a solution of a scalar nonlinear equation f(x)=0, using reverse communication (RC), by Richard Brent.
2696. zero_rc_test
2697. ziggurat, an Octave code which implements uniform, normal and exponential random number generators (RNG) using the ziggurat method, by Marsaglia and Tsang.
2698. ziggurat_test
2699. zombie_ode, an Octave code which sets up and solves a system of ordinary differential equations (ODE) for a generalized Susceptible-Infected-Recovered (SIR) disease model to simulate a zombie attack, developed by Philip Munz.
2700. zombie_ode_test
2701. zoomin, an Octave code which implements many procedures for finding the zero of a scalar nonlinear function.
2702. zoomin_test