- allocatable_array_test
- alpert_rule, a FORTRAN90 code which sets up an Alpert quadrature rule for functions which are regular, log(x) singular, or 1/sqrt(x) singular.
- alpert_rule_test
- analemma, a FORTRAN90 code which evaluates the equation of time, a formula for the difference between the uniform 24 hour day and the actual position of the sun, creating data files that can be plotted with gnuplot(), based on a C code by Brian Tung.
- analemma_test
- annulus_monte_carlo, a FORTRAN90 code which uses the Monte Carlo method to estimate the integral of a function over the interior of a circular annulus in 2D.
- annulus_monte_carlo_test
- annulus_rule, a FORTRAN90 code which computes a quadrature rule for estimating integrals of a function over the interior of a circular annulus in 2D.
- annulus_rule_test
- apportionment, a FORTRAN90 code which demonstrates some of the methods used or proposed for fairly assigning seats in the House of Representatives to each state;
- apportionment_test
- args, a FORTRAN90 code which reports the command line arguments of a FORTRAN90 code;
- args_test
- arpack, a FORTRAN90 code which computes eigenvalues for large matrices, by Richard Lehoucq, Danny Sorensen, Chao Yang;
- arpack_test
- asa005, a FORTRAN90 code which evaluates the lower tail of the noncentral Student T distribution, by BE Cooper; this is a version of Applied Statistics Algorithm 5;
- asa005_test
- asa006, a FORTRAN90 code which computes the Cholesky factor of a positive definite symmetric matrix, by Michael Healy; this is a version of Applied Statistics Algorithm 6;
- asa006_test
- asa007, a FORTRAN90 code which computes the inverse of a positive definite symmetric matrix, by Michael Healy; this is a version of Applied Statistics Algorithm 7,
- asa007_test
- asa032, a FORTRAN90 code which evaluates the incomplete Gamma function, by G Bhattacharjee; this is a version of Applied Statistics Algorithm 32;
- asa032_test
- asa047, a FORTRAN90 code which minimizes a scalar function of several variables using the Nelder-Mead algorithm, by R ONeill. This is a version of Applied Statistics Algorithm 47;
- asa047_test
- asa053, a FORTRAN90 code which produces sample matrices from the Wishart distribution, by William Smith and Ronald Hocking. This is a version of Applied Statistics Algorithm 53.
- asa053_test
- asa058, a FORTRAN90 code which carries out clustering of data, by David Sparks; this is a version of Applied Statistics Algorithm 58;
- asa058_test
- asa063, a FORTRAN90 code which evaluates the incomplete Beta function, by KL Majumder and G Bhattacharjee; this is a version of Applied Statistics Algorithm 63;
- asa063_test
- asa066, a FORTRAN90 code which computes the cumulative density function (CDF) of the standard normal distribution, by David Hill; this is a version of Applied Statistics Algorithm 66;
- asa066_test
- asa076, a FORTRAN90 code which evaluates the Owen T function, by Young and Minder; this is a version of Applied Statistics Algorithm 76;
- asa076_test
- asa082, a FORTRAN90 code which computes the determinant of an orthogonal matrix; this is Applied Statistics Algorithm 82, by J C Gower.
- asa082_test
- asa091, a FORTRAN90 code which computes the percentage points of the Chi-square distribution, by Best and Roberts; this is a version of Applied Statistics Algorithm 91;
- asa091_test
- asa103, a FORTRAN90 code which evaluates the digamma or psi function, by Jose Bernardo; this is a version of Applied Statistics Algorithm 103;
- asa103_test
- asa109, a FORTRAN90 code which inverts the incomplete Beta function, by Cran, Martin and Thomas; this is a version of Applied Statistics Algorithm 109;
- asa109_test
- asa111, a FORTRAN90 code which evaluates the percentage points of the normal distribution, by Beasley and Springer; this is a version of Applied Statistics Algorithm 111;
- asa111_test
- asa113, a FORTRAN90 code which clusters data using a transfer and swap algorithm, by Banfield and Bassill; this is a version of Applied Statistics Algorithm 113;
- asa113_test
- asa121, a FORTRAN90 code which evaluates the trigamma function, by BE Schneider; this is a version of Applied Statistics Algorithm 121;
- asa121_test
- asa136, a FORTRAN90 code which implements a clustering algorithm, by Hartigan and Wong; this is a version of Applied Statistics Algorithm 136;
- asa136_test
- asa144, a FORTRAN90 code which randomly generates tables with given row and column sums, by James Boyett; this is a version of Applied Statistics Algorithm 144;
- asa144_test
- asa147, a FORTRAN90 code which evaluates the incomplete Gamma function, by Chi Leung Lau; this is a version of Applied Statistics Algorithm 147;
- asa147_test
- asa152, a FORTRAN90 code which evaluates the probability density function (PDF) and cumulative density function (CDF) associated with the hypergeometric distribution, by Richard Lund; this is a version of Applied Statistics Algorithm 152;
- asa152_test
- asa159, a FORTRAN90 code which computes a random table with given row and column sums, by Michael Patefield; this is a version of Applied Statistics Algorithm 159;
- asa159_test
- asa172, a FORTRAN90 code which generates all multidimensional indices in a given range, simulating the behavior of an arbitrary number of nested loops, by OFlaherty and MacKenzie; this is a version of Applied Statistics Algorithm 172;
- asa172_test
- asa183, a FORTRAN90 code which implements a random number generator (RNG), by Wichman and Hill; this is a version of Applied Statistics Algorithm 183;
- asa183_test
- asa189, a FORTRAN90 code which estimates the parameters of a beta binomial distribution based on a sample of values generated by the distribution, by D Smith; this is a version of Applied Statistics Algorithm 189;
- asa189_test
- asa205, a FORTRAN90 code which generates tables with given row and column sums; this is a version of Applied Statistics Algorithm 205;
- asa205_test
- asa226, a FORTRAN90 code which evaluates the noncentral incomplete Beta function, by Russell Lenth; this is a version of Applied Statistics Algorithm 226;
- asa226_test
- asa239, a FORTRAN90 code which evaluates the incomplete Gamma function, by Shea; this is a version of Applied Statistics Algorithm 239;
- asa239_test
- asa241, a FORTRAN90 code which computes the inverse of the normal cumulative density function (CDF), by Michael Wichura; this is a version of Applied Statistics Algorithm 241;
- asa241_test
- asa243, a FORTRAN90 code which evaluates the lower tail of the noncentral Student T distribution, by Russell Lenth; this is a version of Applied Statistics Algorithm 243;
- asa243_test
- asa245, a FORTRAN90 code which evaluates the logarithm of the Gamma function, by Allan Mcleod; this is a version of Applied Statistics Algorithm 245;
- asa245_test
- asa266, a FORTRAN90 code which evaluates various properties of the Dirichlet probability density function (PDF); this is a version of Applied Statistics Algorithm 266;
- asa266_test
- asa299, a FORTRAN90 code which computes the lattice points (integer coordinates) in an M-dimensional simplex, by Chasalow and Brand; this is a version of Applied Statistics Algorithm 299;
- asa299_test
- asa310, a FORTRAN90 code which evaluates the noncentral incomplete Beta function, by Chattamvelli and Shanmugam; this is a version of Applied Statistics Algorithm 310;
- asa310_test
- asa314, a FORTRAN90 code which computes the inverse of a matrix whose elements are subject to modulo arithmetic, by Roger Payne. This is a version of Applied Statistics Algorithm 314.
- asa314_test
- atbash, a FORTRAN90 code which applies the Atbash substitution cipher to a string of text.
- atbash_test
- backtrack_binary_rc, a FORTRAN90 code which carries out a backtrack search for binary decisions, using reverse communication (RC).
- backtrack_binary_rc_test
- ball_grid, a FORTRAN90 code which computes grid points inside a 3D ball.
- ball_grid_test
- ball_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the interior of the unit ball in 3D.
- ball_integrals_test
- ball_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit ball in 3D;
- ball_monte_carlo_test
- bank, a FORTRAN90 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.
- bank_test
- barycentric_interp_1d, a FORTRAN90 code which defines and evaluates the barycentric Lagrange polynomial p(x) which interpolates data, so that p(x(i)) = y(i). The barycentric approach means that very high degree polynomials can safely be used.
- barycentric_interp_1d_test
- bdmlib, a FORTRAN90 code which estimates the weights in a Dirichlet mixture based on sample data;
- bdmlib_test
- bellman_ford, a FORTRAN90 code which implements the Bellman-Ford algorithm for finding the shortest distance from a given node to all other nodes in a directed graph whose edges have been assigned real-valued lengths.
- bellman_ford_test
- bernstein_polynomial, a FORTRAN90 code which evaluates the Bernstein polynomials;
- bernstein_polynomial_test
- besselj, a FORTRAN90 code which evaluates Bessel J functions of noninteger order;
- besselj_test
- beta_nc, a FORTRAN90 code which evaluates the cumulative density function (CDF) of the noncentral Beta distribution;
- beta_nc_test
- bezier_surface, a FORTRAN90 code which reads, writes, prints and manipulates the data that defines a Bezier surface;
- bezier_surface_test
- bins, a FORTRAN90 code which orders, sorts and searches data using bins;
- bins_test
- bisection_integer, a FORTRAN90 code which seeks an integer solution to the equation F(X)=0, using bisection within a user-supplied change of sign interval [A,B].
- bisection_integer_test
- bisection_rc, a FORTRAN90 code which seeks a solution to the equation F(X)=0 using bisection within a user-supplied change of sign interval [A,B]. The procedure is written using reverse communication (RC).
- bisection_rc_test
- bivar, a FORTRAN90 code which interpolates scattered bivariate data. This is a version of ACM TOMS algorithm 526, by Hiroshi Akima.
- bivar_test
- black_scholes, a FORTRAN90 code which implements some simple approaches to the Black-Scholes option valuation theory, creating graphics files for processing by gnuplot(), by Desmond Higham.
- black_scholes_test
- blas0, a FORTRAN90 code which contains auxilliary functions for the Basic Linear Algebra Subprograms (BLAS).
- blas0_test
- blas1_d, a FORTRAN90 code which constitutes the Level 1 Basic Linear Algebra Subprograms (BLAS), for vector-vector operations using double precision real arithmetic, by Charles Lawson, Richard Hanson, David Kincaid, Fred Krogh.
- blas1_d_test
- blas1_z, a FORTRAN90 code which constitutes the Level 1 Basic Linear Algebra Subprograms (BLAS), for vector-vector operations using double precision complex arithmetic, by Charles Lawson, Richard Hanson, David Kincaid, Fred Krogh.
- blas1_z_test
- blas2_d, a FORTRAN90 code which constitutes the Level 2 Basic Linear Algebra Subprograms (BLAS), for matrix-vector operations using double precision real arithmetic.
- blas2_d_test
- blas2_z, a FORTRAN90 code which constitutes the Level 2 Basic Linear Algebra Subprograms (BLAS), for matrix-vector operations using double precision complex arithmetic.
- blas2_z_test
- blas3_d, a FORTRAN90 code which constitutes the Level 3 Basic Linear Algebra Subprograms (BLAS), for matrix-matrix operations using double precision real arithmetic.
- blas3_d_test
- blas3_z, a FORTRAN90 code which constitutes the Level 3 Basic Linear Algebra Subprograms (BLAS), for matrix-matrix operations using double precision complex arithmetic.
- blas3_z_test
- blend, a FORTRAN90 code which carries out 1D/2D/3D blending interpolation;
- blend_test
- box_behnken, a FORTRAN90 code which computes a Box-Behnken design, that is, arguments to sample the behavior of a function of multiple parameters;
- box_behnken_test
- brownian_motion_simulation, a FORTRAN90 code which simulates Brownian motion in an M-dimensional region, creating graphics files for processing by gnuplot().
- brownian_motion_simulation_test
- burgers_solution, a FORTRAN90 code which evaluates exact solutions of the time-dependent 1D viscous Burgers equation.
- burgers_solution_test
- bvec, a FORTRAN90 code which demonstrates how signed integers can be stored as binary vectors, and arithmetic can be performed on them.
- bvec_test
- bvls, a FORTRAN90 code which applies linear least squares (LLS) methods to solve a system for which lower and upper constraints may have been placed on every variable, by Charles Lawson and Richard Hanson.
- bvls_test
- c8lib, a FORTRAN90 code which implements certain elementary functions for double precision complex (C8) variables;
- c8lib_test
- caesar, a FORTRAN90 code which applies a Caesar Shift Cipher to a string of text.
- caesar_test
- calendar_nyt, a FORTRAN90 code which shows the correspondence between dates and the New York Times volume and issue number;
- calendar_nyt_test
- calpak, a FORTRAN90 code which makes various calendar calculations;
- calpak_test
- cauchy_principal_value, a FORTRAN90 code which uses Gauss-Legendre quadrature to estimate the Cauchy Principal Value (CPV) of certain singular integrals.
- cauchy_principal_value_test
- ccn_rule, a FORTRAN90 code which defines a one of a sequence of Clenshaw Curtis nested (CCN) quadrature rules of any order.
- ccn_rule_test
- ccs_io, a FORTRAN90 code which reads and writes sparse linear systems stored in the Compressed Column Storage (CCS) format.
- ccs_io_test
- ccs_to_st, a FORTRAN90 code which converts a sparse matrix from compressed column storage (CCS) to sparse triplet (ST) format.
- ccs_to_st_test
- cdflib, a FORTRAN90 code which evaluates the cumulative density function (CDF), inverse CDF, and certain other inverse functions, for distributions including beta, binomial, chi-square, noncentral chi-square, F, noncentral F, gamma, negative binomial, normal, Poisson, and students T, by Barry Brown, James Lovato, Kathy Russell.
- cdflib_test
- cell, a FORTRAN90 code which defines a cell array, a generalization of an array which compactly stores and retrieves vector or matrix data of varying size, such as the rows of a triangular matrix.
- cell_test
- cellular_automaton, a FORTRAN90 code which demonstrates the 1D Cellular Automaton known as rule #30.
- cellular_automaton_test
- cg, a FORTRAN90 code which implements a simple version of the conjugate gradient (CG) method for solving a system of linear equations of the form A*x=b, suitable for situations in which the matrix A is positive definite, only real, positive eigenvalues and symmetric.
- cg_test
- cg_rc, a FORTRAN90 code which implements the conjugate gradient (CG) method for solving a positive definite sparse linear system A*x=b, using reverse communication (RC).
- cg_rc_test
- change_making, a FORTRAN90 code which considers the change making problem, in which a given sum is to be formed using coins of various denominations.
- change_making_test
- chebyshev, a FORTRAN90 code which computes the Chebyshev interpolant/approximant to a given function over an interval.
- chebyshev_test
- chebyshev_interp_1d, a FORTRAN90 code which determines the combination of Chebyshev polynomials which interpolates data, so that p(x(i)) = y(i).
- chebyshev_interp_1d_test
- chebyshev_polynomial, a FORTRAN90 code which considers the Chebyshev polynomials T(i,x), U(i,x), V(i,x) and W(i,x). Functions are provided to evaluate the polynomials, determine their zeros, produce their polynomial coefficients, produce related quadrature rules, project other functions onto these polynomial bases, and integrate double and triple products of the polynomials.
- chebyshev_polynomial_test
- chebyshev_series, a FORTRAN90 code which evaluates a Chebyshev series approximating a function f(x), while efficiently computing one, two or three derivatives of the series, which approximate f'(x), f''(x), and f'''(x), by Manfred Zimmer.
- chebyshev_series_test
- chebyshev1_exactness, a FORTRAN90 code which tests polynomial exactness of Gauss-Chebyshev type 1 quadrature rules.
- chebyshev1_exactness_test
- chebyshev1_rule, a FORTRAN90 code which computes and writes out a Gauss-Chebyshev type 1 quadrature rule of given order.
- chebyshev1_rule_test
- chebyshev2_exactness, a FORTRAN90 code which tests polynomial exactness of Gauss-Chebyshev type 2 quadrature rules.
- chebyshev2_exactness_test
- chebyshev2_rule, a FORTRAN90 code which computes and writes out a Gauss-Chebyshev type 2 quadrature rule of given order.
- chebyshev2_rule_test
- chrpak, a FORTRAN90 code which manipulates characters and strings;
- chrpak_test
- circle_arc_grid, a FORTRAN90 code which computes grid points along a circular arc.
- circle_arc_grid_test
- circle_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the circumference of the unit circle in 2D.
- circle_integrals_test
- circle_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate the integral of a function along the circumference of the unit circle in 2D;
- circle_monte_carlo_test
- circle_packing, a FORTRAN90 code which performs a circle-packing test on the spacing of points;
- circle_packing_test
- circle_rule, a FORTRAN90 code which computes quadrature rules for the unit circle in 2D, that is, the circumference of the circle of radius 1 and center (0,0).
- circle_rule_test
- circle_segment, a FORTRAN90 code which carries out computations associated with a circle segment, including height, angle, area, centroid, sampling, and quadrature, creating some graphics images using gnuplot().
- circle_segment_test
- cities, a FORTRAN90 code which works with city-to-city distance matrices;
- cities_test
- clausen, a FORTRAN90 code which evaluates a Chebyshev interpolant to the Clausen function Cl2(x).
- clausen_test
- clenshaw_curtis_grid, a FORTRAN90 code which sets up a Clenshaw Curtis quadrature rule in multiple dimensions;
- clenshaw_curtis_grid_test
- clenshaw_curtis_rule, a FORTRAN90 code which implements a Clenshaw Curtis quadrature rule;
- clenshaw_curtis_rule_test
- cluster_energy, a FORTRAN90 code which computes the minimal cluster energy of points;
- cluster_energy_test
- codepack, a FORTRAN90 code which computes graph codes to compare two graphs;
- codepack_test
- collatz_recursive, a FORTRAN90 code which demonstrates recursive programming by considering the simple Collatz 3n+1 problem.
- collatz_recursive_test
- colored_noise, a FORTRAN90 code which generates samples of noise obeying a 1/f^alpha power law.
- colored_noise_test
- colors, a FORTRAN90 code which converts between various formats for describing colors;
- colors_test
- combo, a FORTRAN90 code which includes routines for ranking, unranking, enumerating and randomly selecting balanced sequences, cycles, graphs, Gray codes, subsets, partitions, permutations, restricted growth functions, Pruefer codes and trees.
- combo_test
- communicator_mpi, a FORTRAN90 code which creates new communicators involving a subset of initial set of MPI processes in the default communicator MPI_COMM_WORLD.
- communicator_mpi_test
- compass_search, a FORTRAN90 code which seeks the minimizer of a scalar function of several variables using compass search, a direct search algorithm that does not use derivatives.
- compass_search_test
- complex_numbers_test, a FORTRAN90 code which demonstrates some simple features involved in the use of complex numbers.
- condition, a FORTRAN90 code which implements methods of computing or estimating the condition number of a matrix.
- condition_test
- continued_fraction, a FORTRAN90 code which deals with simple and generalized continued fractions.
- continued_fraction_test
- cordic, a FORTRAN90 code which computes a few special functions using the CORDIC algorithm.
- cordic_test
- correlation, a FORTRAN90 code which contains statistical correlation functions.
- correlation_test
- cosine_transform, a FORTRAN90 code which demonstrates some simple properties of the discrete cosine transform (DCT).
- cosine_transform_test
- csv_io, a FORTRAN90 code which reads and writes files using the Comma Separated Value (CSV) format.
- csv_io_test
- cube_arbq_rule, a FORTRAN90 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.
- cube_arbq_rule_test
- cube_exactness, a FORTRAN90 code which investigates the polynomial exactness of quadrature rules over the interior of a cube in 3D.
- cube_exactness_test
- cube_felippa_rule, a FORTRAN90 code which returns a Felippa quadrature rules for approximating integrals over the interior of a cube in 3D.
- cube_felippa_rule_test
- cube_grid, a FORTRAN90 code which computes a grid of points over the interior of a cube in 3D.
- cube_grid_test
- cube_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the interior of the unit cube in 3D.
- cube_integrals_test
- cube_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit cube in 3D.
- cube_monte_carlo_test
- cuda_loop, a FORTRAN90 code which shows how, in a CUDA code, the choice of block and thread factors determines the allocation of tasks to processors.
- cuda_loop_test
- cvt, a FORTRAN90 code which computes an N point Centroidal Voronoi Tessellation (CVT) in M dimensions;
- cvt_test
- cvt_box, a FORTRAN90 code which calculates a Centroidal Voronoi Tessellation (CVT) constrained to a box region, with points projected to the boundary;
- cvt_box_test
- cvtp, a FORTRAN90 code which creates a Centroidal Voronoi Tessellation on a Periodic region (CVTP).
- cvtp_test
- cvt_triangulation, a FORTRAN90 code which applies Centroidal Voronoi Tessellation (CVT) techniques to the test_triangulation() set;
- cvt_triangulation_test
- cycle_brent, a FORTRAN90 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.
- cycle_brent_test
- cycle_floyd, a FORTRAN90 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.
- cycle_floyd_test
- cyclic_reduction, a FORTRAN90 code which solves a tridiagonal linear system using cyclic reduction;
- cyclic_reduction_test
- diaphony, a FORTRAN90 code which reads a file of N points in M dimensions and computes its diaphony, a measure of point dispersion.
- diaphony_test
- differ, determines the finite difference coefficients necessary in order to combine function values at known locations to compute an approximation of given accuracy to a derivative of a given order.
- differ_test
- dijkstra, a FORTRAN90 code which implements a simple version of the Dijkstra minimum distance algorithm for graphs.
- dijkstra_test
- dijkstra_openmp, a FORTRAN90 code which uses OpenMP to parallelize a simple case of the Dijkstra minimum distance algorithm for graphs.
- dijkstra_openmp_test
- discrete_pdf_sample_2d, a FORTRAN90 code which demonstrates how to construct a Probability Density Function (PDF) from a table of sample data, and then to use that PDF to create new samples.
- discrete_pdf_sample_2d_test
- disk_grid, a FORTRAN90 code which computes grid points within the interior of a disk of user specified radius and center in 2D, using gnuplot() to create an image of the grid.
- disk_grid_test
- disk_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate integrals of a function over the interior of the general disk in 2D;
- disk_monte_carlo_test
- disk_rule, a FORTRAN90 code which computes quadrature rules for the general disk in 2D.
- disk_rule_test
- disk01_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the interior of the unit disk in 2D.
- disk01_integrals_test
- disk01_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit disk in 2D;
- disk01_monte_carlo_test
- disk01_quarter_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit quarter disk in 2D;
- disk01_quarter_monte_carlo_test
- disk01_rule, a FORTRAN90 code which computes quadrature rules for the unit disk in 2D, that is, the interior of the circle of radius 1 and center (0,0).
- disk01_rule_test
- dislin_test, a FORTRAN90 code which calls dislin(), which is a powerful scientific graphics package.
- distance_to_position, a FORTRAN90 code which estimates positions of cities based on a city-to-city distance table.
- distance_to_position_test
- divdif, a FORTRAN90 code which uses divided differences to compute the polynomial interpolant to a given set of data.
- divdif_test
- doomsday, a FORTRAN90 code which is given the year, month and day of a date, and uses John Conway's doomsday algorithm to determine the corresponding day of the week.
- doomsday_test
- dream, a FORTRAN90 code which implements the DREAM algorithm for accelerating Markov Chain Monte Carlo (MCMC) convergence using differential evolution, using five user functions to define the problem, by Guannan Zhang.
- dream_test
- duel_simulation, a FORTRAN90 code which simulates N repetitions of a duel between two players, each of whom has a known firing accuracy.
- duel_simulation_test
- dutch, a FORTRAN90 code which performs certain tasks in computational geometry;
- dutch_test
- edge, a FORTRAN90 code which defines some test functions in 1D, 2D and 3D for the detection of edges or discontinuities, and using gnuplot() to display the curves or surfaces.
- edge_test
- ellipse_grid, a FORTRAN90 code which computes grid points over the interior of an ellipse in 2D.
- ellipse_grid_test
- ellipse_monte_carlo, a FORTRAN90 code which uses the Monte Carlo method to estimate the value of integrals over the interior of an ellipse in 2D.
- ellipse_monte_carlo_test
- ellipsoid_grid, a FORTRAN90 code which computes a grid of points over the interior of an ellipsoid in 3D.
- ellipsoid_grid_test
- ellipsoid_monte_carlo, a FORTRAN90 code which uses the Monte Carlo method to estimate the value of integrals over the interior of an ellipsoid in M dimensions.
- ellipsoid_monte_carlo_test
- elliptic_integral, a FORTRAN90 code which evaluates complete elliptic integrals of first, second and third kind, using the Carlson elliptic integral functions.
- elliptic_integral_test
- errors, FORTRAN90 codes which illustrate the failure of numerical algorithms;
- errors_test
- etdrk4, a FORTRAN90 code which uses the ETD RK4 method to solve systems of stiff ordinary differential equations (ODE), by Aly-Khan Kassam, Lloyd Trefethen.
- etdrk4_test
- euler, a FORTRAN90 code which solves one or more ordinary differential equations (ODE) using the forward Euler method.
- euler_test
- exactness, a FORTRAN90 code which investigates the exactness of quadrature rules that estimate the integral of a function with a density, such as 1, exp(-x) or exp(-x^2), over an interval such as [-1,+1], [0,+oo) or (-oo,+oo).
- exactness_test
- f90_test, a FORTRAN90 code which uses various FORTRAN90 features;
- f90_calls_c, a FORTRAN90 code which calls a C function.
- f90_calls_c++, a FORTRAN90 code which calls a C++ function.
- f90_calls_matlab, a FORTRAN90 code which interacts with MATLAB;
- f90_files_test, a FORTRAN90 code which uses files.
- f90_intrinsics_test, a FORTRAN90 code which uses FORTRAN90 intrinsic functions and subroutines;
- f90_mistake_test, a FORTRAN90 code which illustrates some simple but devious mistakes in FORTRAN90.
- f90_module_test, a FORTRAN90 code which uses the FORTRAN90 module feature.
- f90_random_test, a FORTRAN90 code which uses the FORTRAN90 random number generator (RNG) routines.
- f90_stop_test, a FORTRAN90 code which illustrates how a FORTRAN90 code can print a text message or return a numeric status value to the calling environment when executing the stop() statement.
- f90split, a FORTRAN90 code which reads a FORTRAN file and creates individual files for every subroutine or function in the file.
- f90split_test
- fair_dice_simulation, a FORTRAN90 code which simulates N tosses of 2 dice, writing graphics files for processing by gnuplot().
- fair_dice_simulation_test
- fastgl, a FORTRAN90 code which carries out the rapid computation of the Kth value and weight of an N point Gauss-Legendre quadrature rule, by Ignace Bogaert.
- fastgl_test
- faure, a FORTRAN90 code which computes elements of the Faure Quasi Mont Carlo (QMC) M-dimensional sequence;
- faure_test
- fd_predator_prey, a FORTRAN90 code which solves a pair of predator prey ordinary differential equations (ODE) using the finite difference method (FDM), and plots the data with gnuplot().
- fd_predator_prey_test
- fd1d_advection_diffusion_steady, a FORTRAN90 code which applies the finite difference method (FDM) to solve the steady advection diffusion equation v*ux-k*uxx=0 in one spatial dimension, with constant velocity v and diffusivity k, writing graphics files for processing by gnuplot().
- fd1d_advection_diffusion_steady_test
- fd1d_advection_ftcs, a FORTRAN90 code which applies the finite difference method (FDM) to solve the time-dependent advection equation ut = - c * ux in one spatial dimension, with a constant velocity, using the forward time centered space (FTCS) method, writing graphics files for processing by gnuplot().
- fd1d_advection_ftcs_test
- fd1d_advection_lax, a FORTRAN90 code which applies the finite difference method (FDM) to solve the time-dependent advection equation ut = - c * ux in one spatial dimension, with a constant velocity, using the Lax method to approximate the time derivative, writing graphics files for processing by gnuplot().
- fd1d_advection_lax_test
- fd1d_advection_lax_wendroff, a FORTRAN90 code which applies the finite difference method (FDM) to solve the time-dependent advection equation ut = - c * ux in one spatial dimension, with a constant velocity, using the Lax-Wendroff method to approximate the time derivative, writing graphics files for processing by gnuplot().
- fd1d_advection_lax_wendroff_test
- fd1d_burgers_lax, a FORTRAN90 code which applies the finite difference method (FDM) and the Lax Wendroff method to solve the non-viscous time-dependent Burgers equation in one spatial dimension.
- fd1d_burgers_lax_test
- fd1d_burgers_leap, a FORTRAN90 code which applies the finite difference method (FDM) and the leapfrog approach to solve the non-viscous time-dependent Burgers equation in one spatial dimension.
- fd1d_burgers_leap_test
- fd1d_bvp, a FORTRAN90 code which applies the finite difference method (FDM) to a two point boundary value problem (BVP) in one spatial dimension.
- fd1d_bvp_test
- fd1d_heat_explicit, a FORTRAN90 code which implements a finite difference method (FDM), explicit in time, of the time dependent 1D heat equation;
- fd1d_heat_explicit_test
- fd1d_heat_implicit, a FORTRAN90 code which implements a finite difference method (FDM), implicit in time, of the time dependent 1D heat equation;
- fd1d_heat_implicit_test
- fd1d_heat_steady, a FORTRAN90 code which implements a finite difference method (FDM) for the steady time-independent 1D heat equation;
- fd1d_heat_steady_test
- fd1d_predator_prey, a FORTRAN90 code which implements the finite difference method (FDM) for a 1D predator-prey system, creating graphics files for processing by gnuplot(), by Marcus Garvie.
- fd1d_predator_prey_test
- fd1d_wave, a FORTRAN90 code which applies the finite difference method (FDM) to solve the time-dependent wave equation utt = c * uxx in one spatial dimension.
- fd1d_wave_test
- fd2d_heat_steady, a FORTRAN90 code which implements a finite difference method (FDM) for the steady time-independent 2D heat equation;
- fd2d_heat_steady_test
- fd2d_predator_prey, a FORTRAN90 code which implements the finite difference method (FDM) for a 2D predator-prey system, by Marcus Garvie.
- fd2d_predator_prey_test
- fem_basis, a FORTRAN90 code which defines and evaluates basis functions associated with the finite element method (FEM) for any degree in an M-dimensional simplex: 1D interval, 2D triangle, 3D tetrahedron, and higher dimensional generalizations.)
- fem_basis_test
- fem_io, a FORTRAN90 code which reads or writes FEM files, which describe the nodes, elements, and function values associated with a finite element method (FEM) model;
- fem_io_test
- fem_to_gmsh, a FORTRAN90 code which reads a pair of FEM files defining node coordinates and elements, of a 1D, 2D or 3D mesh, namely a file of node coordinates and a file of elements defined by node indices, and creates a gmsh() mesh file.
- fem_to_gmsh_test
- fem_to_mesh, a FORTRAN90 code which reads FEM files defining the node coordinates, boundary nodes, and elements of a finite element mesh, and rewrites the data as a MESH file.
- fem_to_mesh_test
- fem_to_triangle, a FORTRAN90 code which reads FEM files defining a 2D mesh of triangles, namely a file of node coordinates and a file of elements defined by node indices, and creates a corresponding pair of node and element files for the triangle() code of Jonathan Shewchuk
- fem_to_triangle_test
- fem_to_xml, reads a pair of FEM files defining node coordinates and elements, of a 1D, 2D or 3D mesh, namely a file of node coordinates and a file of elements defined by node indices, and creates a corresponding XML file for input to dolfin() or fenics().
- fem_to_xml_test
- fem1d, a FORTRAN90 code which applies the finite element method (FEM), using piecewise linear basis functions, to a linear two point boundary value problem (BVP) in 1D;
- fem1d_test
- fem1d_adaptive, a FORTRAN90 code which uses an adaptive mesh when applying the finite element method (FEM), with piecewise linear basis functions, to a linear two point boundary value problem (BVP) in 1D;
- fem1d_adaptive_test
- fem1d_bvp_linear, a FORTRAN90 code which applies the finite element method (FEM), with piecewise linear elements, to a two point boundary value problem (BVP) in one spatial dimension, and compares the computed and exact solutions with the L2 and seminorm errors.
- fem1d_bvp_linear_test
- fem1d_bvp_quadratic, a FORTRAN90 code which applies the finite element method (FEM), with piecewise quadratic elements, to a two point boundary value problem (BVP) in one spatial dimension, and compares the computed and exact solutions with the L2 and seminorm errors.
- fem1d_bvp_quadratic_test
- fem1d_heat_steady, a FORTRAN90 code which implements the finite element method (FEM) for the steady time-independent 1D heat equation;
- fem1d_heat_steady_test
- fem1d_lagrange, a FORTRAN90 code which sets up the matrices and vectors associated with the finite element method (FEM) solution of a boundary value problem (BVP) -u''+u=f(x), using Lagrange basis polynomials.
- fem1d_lagrange_test
- fem1d_nonlinear, a FORTRAN90 code which applies the finite element method (FEM), with piecewise linear basis functions, to a nonlinear two point boundary value problem (BVP) in 1D;
- fem1d_nonlinear_test
- fem1d_pack, a FORTRAN90 code which contains utilities for 1D finite element method (FEM) calculations.
- fem1d_pack_test
- fem1d_pmethod, a FORTRAN90 code which applies the p-method version of the finite element method (FEM) to a linear two point boundary value problem (BVP) in 1D;
- fem1d_pmethod_test
- fem1d_project, a FORTRAN90 code which projects data into a finite element space, including the least squares approximation of data, or the projection of a finite element solution from one mesh to another.
- fem1d_project_test
- fem1d_sample, a FORTRAN90 code which samples a scalar or vector finite element function of one variable, defined by FEM files, returning interpolated values at the sample points.
- fem1d_sample_test
- fem2d_bvp_linear, a FORTRAN90 code which applies the finite element method (FEM), with piecewise linear elements, to a 2D boundary value problem (BVP) in a rectangle, and compares the computed and exact solutions with the L2 and seminorm errors.
- fem2d_bvp_linear_test
- fem2d_bvp_quadratic, a FORTRAN90 code which applies the finite element method (FEM), with piecewise quadratic elements, to a 2D boundary value problem (BVP) in a rectangle, and compares the computed and exact solutions with the L2 and seminorm errors.
- fem2d_bvp_quadratic_test
- fem2d_bvp_serene, a FORTRAN90 code which applies the finite element method (FEM), with serendipity elements, to a 2D boundary value problem (BVP) in a rectangle, and compares the computed and exact solutions with the L2 and seminorm errors.
- fem2d_bvp_serene_test
- fem2d_heat, a FORTRAN90 code which uses the finite element method (FEM) and the backward Euler method to solve the time-dependent heat equation on an arbitrary triangulated region in 2D. The user supplies some information in some problem-dependent subroutines.
- fem2d_heat_test
- fem2d_heat_rectangle, a FORTRAN90 code which implements the finite element method (FEM) for the time dependent heat equation on a triangulated square in 2D;
- fem2d_heat_rectangle_test
- fem2d_pack, a FORTRAN90 code which implements simple 2D finite element method (FEM) calculations;
- fem2d_pack_test
- fem2d_poisson_rectangle, a FORTRAN90 code which solves the 2D Poisson equation on a rectangle, using the finite element method (FEM), and piecewise quadratic triangular elements.
- fem2d_poisson_rectangle_test
- fem2d_poisson_rectangle_linear, a FORTRAN90 code which solves the 2D Poisson equation on a rectangle, using the finite element method (FEM), and piecewise linear triangular elements.
- fem2d_poisson_rectangle_linear_test
- fem2d_sample, a FORTRAN90 code which samples at arbitray points a finite element function, defined by FEM files, three text files describing the nodes, triangles, and coefficients.
- fem2d_sample_test
- fem3d_pack, a FORTRAN90 code which contains utilities for 3D finite element method (FEM) calculations.
- fem3d_pack_test
- fem3d_sample, a FORTRAN90 code which evaluates a finite element function defined on a 3D tetrahedral mesh.
- fem3d_sample_test
- feynman_kac_1d, a FORTRAN90 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.
- feynman_kac_1d_test
- feynman_kac_2d, a FORTRAN90 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.
- feynman_kac_2d_test
- feynman_kac_3d, a FORTRAN90 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.
- feynman_kac_3d_test
- fft_openmp, a FORTRAN90 code which demonstrates the computation of a Fast Fourier Transform in parallel, using OpenMP.
- fft_openmp_test
- fft_serial, a FORTRAN90 code which computes a Fast Fourier Transform (FFT), and is intended as a starting point for implementing a parallel version.
- fft_serial_test
- fftpack5, a FORTRAN90 code which computes Fast Fourier transforms (FFT) by Paul Swarztrauber and Dick Valent;
- fftpack5_test
- fftpack51, a FORTRAN90 code which contains version 5.1 of the FFTPACK Fast Fourier Transform (FFT) package, using double precision arithmetic, by Paul Swarztrauber and Dick Valent;
- fftpack51_test
- file_column_reverse, a FORTRAN90 code which creates a copy of a file in which the columns are reversed, that is, the characters on each line appear in reverse order.
- file_column_reverse_test
- file_name_sequence, a FORTRAN90 code which demonstrates ways to generate a sequence of filenames, which can be useful when generating a sequence of still snapshots to be animated later.
- file_name_sequence_test
- file_transpose, a FORTRAN90 code which makes a transposed copy of a file, in which the I-th word of the J-th line becomes the J-th word of the I-th line.
- file_transpose_test
- files_multiple, a FORTRAN90 code which demonstrates how to open multiple output files at one time, and write data to a specific file.
- files_multiple_test
- filon, a FORTRAN90 code which approximates integrals in which the integrand includes an oscillatory factor of sin(k*x) or cos(k*x).
- filon_test
- filum, a FORTRAN90 code which performs various operations on files;
- filum_test
- fire_simulation, a FORTRAN90 code which simulates a forest fire over a rectangular array of trees, starting at a single random location.
- fire_simulation_test
- floyd, a FORTRAN90 code which implements the Floyd algorithm for finding the shortest distance between pairs of nodes on a directed graph.
- floyd_test
- fn, a FORTRAN90 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.
- fn_test
- football, a FORTRAN90 code which ranks football teams based on scores;
- football_test
- football_scores, a FORTRAN90 code which determines the number of ways of achieving a given football score.
- football_scores_test
- freefem_msh_io, a FORTRAN90 code which reads and writes files used by FreeFem++ to store mesh information for the finite element method (FEM).
- freefem_msh_io_test
- fsolve, a FORTRAN90 code which solves systems of nonlinear equations, inspired by the fsolve() function in MATLAB, and based on the minpack() minimization package.
- fsolve_test
- fsplit, reads a FORTRAN file and creates individual files for every function, program, or subroutine in the file, by Van Snyder.
- fsplit_test
- gdb_test, FORTRAN90 codes which demonstrate the use of the Gnu Debugger GDB.
- gegenbauer_cc, a FORTRAN90 code which computes the Gegenbauer weighted integral of a function f(x) using a Clenshaw-Curtis approach.
- gegenbauer_cc_test
- gegenbauer_exactness, a FORTRAN90 code which tests the polynomial exactness of Gauss-Gegenbauer quadrature rules.
- gegenbauer_exactness_test
- gegenbauer_polynomial, a FORTRAN90 code which evaluates the Gegenbauer polynomial and associated functions.
- gegenbauer_polynomial_test
- gegenbauer_rule, a FORTRAN90 code which computes and writes out a Gauss-Gegenbauer quadrature rule of given order.
- gegenbauer_rule_test
- gen_hermite_exactness, a FORTRAN90 code which tests the polynomial exactness of generalized Gauss-Hermite quadrature rules.
- gen_hermite_exactness_test
- gen_hermite_rule, a FORTRAN90 code which computes and writes out a generalized Gauss-Hermite quadrature rule of given order and parameter value.
- gen_hermite_rule_test
- gen_laguerre_exactness, a FORTRAN90 code which tests the polynomial exactness of generalized Gauss-Laguerre quadrature rules.
- gen_laguerre_exactness_test
- gen_laguerre_rule, a FORTRAN90 code which computes and writes out a generalized Gauss-Laguerre quadrature rule of given order and parameter value.
- gen_laguerre_rule_test
- gene_cluster, a FORTRAN90 code which clusters sets of genetic expression data;
- gene_cluster_test
- geometry, a FORTRAN90 code which performs geometric calculations in 2, 3 and M dimensional space, including the computation of angles, areas, containment, distances, intersections, lengths, and volumes.
- geometry_test
- gfortran_test, FORTRAN90 codes which test various features of the gfortran() compiler.
- gfortran_intrinsics_test, a FORTRAN90 code which uses the intrinsic functions included by the gfortran compiler, above and beyond those specified in the FORTRAN language standards.
- gfortran_quadmath_test, a FORTRAN90 code which uses quadruple precision real arithmetic, as provided on some systems by the gfortran compiler for FORTRAN90.
- glomin, a FORTRAN90 code which finds a global minumum of a scalar function of a scalar variable, without the use of derivative information, by Richard Brent.
- glomin_test
- gmsh_io, a FORTRAN90 code which reads or writes some of the files created by gmsh() for 1D, 2D or 3D meshes used by the finite element method (FEM).
- gmsh_io_test
- gmsh_to_fem, a FORTRAN90 code which reads a mesh data file created by gmsh() and writes a pair of node and element files that correspond to the FEM format.
- gmsh_to_fem_test
- gnuplot_test, FORTRAN90 codes which use gnuplot() to create various kinds of plots.
- gprof_test, FORTRAN90 codes which demonstrate various features of the gprof() performance profiler.
- grafpack, a FORTRAN90 code which performs calculations on graphs;
- grafpack_test
- graph_paper, a FORTRAN90 code which makes PostScript (PS) graph paper;
- graph_paper_test
- graphics_dislin_test, FORTRAN90 codes which illustrate how various kinds of data can be displayed and analyzed graphically, using the dislin() graphics package.
- graphics_gnuplot_test, FORTRAN90 codes which illustrate how various kinds of data can be displayed and analyzed graphically, using the gnuplot() graphics package.
- grf_io, a FORTRAN90 code which reads or writes a GRF file which displays a mathematical graph;
- grf_io_test
- haar, a FORTRAN90 code which computes the Haar transform of data.
- haar_test
- halton, a FORTRAN90 code which computes a Halton Quasi Monte Carlo (QMC) sequence.
- halton_test
- hammersley, a FORTRAN90 code which computes a Hammersley Quasi Monte Carlo (QMC) sequence.
- hammersley_test
- hankel_cholesky, a FORTRAN90 code which computes the upper Cholesky factor R of a symmetric positive definite (SPD) Hankel matrix H, so that H = R' * R.
- hankel_cholesky_test
- hankel_spd, a FORTRAN90 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'.
- hankel_spd_test
- hdf5_test, a FORTRAN90 code which demonstrates the use of the hdf5 compressed file storage format.
- heat_mpi, a FORTRAN90 code which solves the 1D time dependent heat equation using the Message Passing Interface (MPI).
- heat_mpi_test
- heated_plate, a FORTRAN90 code which solves the steady state heat equation in a 2D rectangular region, and is intended as a starting point for implementing an OpenMP parallel version.
- heated_plate_test
- heated_plate_openmp, a FORTRAN90 code which solves the steady time-independent heat equation in a 2D rectangular region, using OpenMP to run in parallel.
- heated_plate_openmp_test
- hello, a FORTRAN90 code which prints out "Hello, world!".
- hello_test
- hello_mpi, a FORTRAN90 code which prints out "Hello, world!" using MPI for parallel execution.
- hello_mpi_test
- hello_openmp, a FORTRAN90 code which prints out "Hello, world!", using OpenMP for parallel execution.
- hello_openmp_test
- hermite_cubic, a FORTRAN90 code which computes the value, derivatives or integral of a Hermite cubic polynomial, or manipulate an interpolating function made up of piecewise Hermite cubic polynomials.
- hermite_cubic_test
- hermite_exactness, a FORTRAN90 code which tests the polynomial exactness of Gauss-Hermite quadrature rules to estimate the integral of f(x) with density exp(-x^2) over the interval (-oo,+oo).
- hermite_exactness_test
- hermite_integrands, a FORTRAN90 code which defines test integrands for Hermite integrals with density exp(-x^2) over the interval (-oo,+oo).
- hermite_integrands_test
- hermite_interpolant, a FORTRAN90 code which computes the Hermite interpolant, a polynomial that matches function values and derivatives.
- hermite_interpolant_test
- hermite_polynomial, a FORTRAN90 code which evaluates the physicist's Hermite polynomial, the probabilist's Hermite polynomial, the Hermite function, and related functions.
- hermite_polynomial_test
- hermite_product_polynomial, a FORTRAN90 code which defines Hermite product polynomials, creating a multivariate polynomial as the product of univariate Hermite polynomials.
- hermite_product_polynomial_test
- hermite_rule, a FORTRAN90 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).
- hermite_rule_test
- high_card_simulation, a FORTRAN90 code which simulates a situation in which you see the cards in a deck one by one, and must select the one you think is the highest and stop; gnuplot() creates a graph of the results.
- high_card_simulation_test
- hilbert_curve, a FORTRAN90 code which computes the sequence of discrete Hilbert curves whose limit is a space-filling curve.
- hilbert_curve_test
- histogram_data_2d_sample, a FORTRAN90 code which constructs a Probability Density Function (PDF) from sample data over a 2D domain, and then to use that PDF to create new samples.
- histogram_data_2d_sample_test
- humps, a FORTRAN90 code which evaluates the humps function, its first and second derivatives, and its antiderivative.
- humps_test
- hyperball_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the interior of the unit hyperball in M dimensions.
- hyperball_integrals_test
- hyperball_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit ball in M dimensions;
- hyperball_monte_carlo_test
- hyperball_volume_monte_carlo, a FORTRAN90 code which applies a Monte Carlo procedure to estimate the volume of the unit ball in M dimensions;
- hyperball_volume_monte_carlo_test
- hyperball_volume_quad, a FORTRAN90 code which estimates the volume of the unit ball in M dimensions.
- hyperball_volume_quad_test
- hypercube_exactness, a FORTRAN90 code which tests the polynomial exactness of a quadrature rule over the interior of the unit hypercube in M dimensions.
- hypercube_exactness_test
- hypercube_grid, a FORTRAN90 code which computes a grid of points over the interior of a hypercube in M dimensions.
- hypercube_grid_test
- hypercube_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the interior of the unit hypercube in M dimensions.
- hypercube_integrals_test
- hypercube_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit hypercube in M dimensions.
- hypercube_monte_carlo_test
- hypersphere_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the surface of the unit hypersphere in M dimensions.
- hypersphere_integrals_test
- hypersphere_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate the integral of a function on the surface of the unit sphere in M dimensions;
- hypersphere_monte_carlo_test
- hypersphere_properties, a FORTRAN90 code which carries out various operations for an M dimensional hypersphere, including converting between Cartesian and spherical coordinates, stereographic projection, sampling the surface of the sphere, and computing the surface area and volume.
- hypersphere_properties_test
- i4lib, a FORTRAN90 code which contains utilities which use single precision integer (I4) arithmetic.
- i4lib_test
- i8lib, a FORTRAN90 code which contains many utility routines, using double precision integer (I8) arithmetic.
- i8lib_test
- ieee_uniform_sample, a FORTRAN90 code which uniformly samples the discrete set of values that represent the legal IEEE real numbers;
- ieee_uniform_sample_test
- image_components, a FORTRAN90 code which seeks the connected nonzero or nonblack components of an image or integer array.
- image_components_test
- image_denoise, a FORTRAN90 code which applies simple filtering operations to a noisy image.
- image_denoise_test
- image_edge, a FORTRAN90 code which detects edges in images.
- image_edge_test
- include_files, a FORTRAN90 code which reads a FORTRAN90 file with include statements, and makes a copy in which the indicated files have been included;
- include_files_test
- index, a FORTRAN90 code which converts a multidimensional vector index to a one-dimensional vector index; it can handle zero and one based indexing schemes, as well as column major and row major conventions.
- index_test
- interp, a FORTRAN90 code which parameterizies and interpolates data;
- interp_test
- intlib, a FORTRAN90 code which carries out approximate integration (quadrature) in one dimension;
- intlib_test
- isbn, a FORTRAN90 code which determines the check digit for an International Standard Book Number or reports whether a given ISBN is valid.
- isbn_test
- ising_2d_simulation, a FORTRAN90 code which simulates evolution of a 2D array of positive and negative charges, each of which is likely to flip to be in agreement with neighbors, using gnuplot() to make images of the initial and final configurations.
- ising_2d_simulation_test
- ising_3d_simulation, a FORTRAN90 code which simulates evolution of a 3D array of positive and negative charges, each of which is likely to flip to be in agreement with neighbors.
- ising_3d_simulation_test
- jacobi, a FORTRAN90 code which implements the Jacobi method for the iterative solution of linear systems.
- jacobi_test
- jacobi_eigenvalue, a FORTRAN90 code which implements the Jacobi iteration for the determination of the eigenvalues and eigenvectors of a real symmetric matrix.
- jacobi_eigenvalue_test
- jacobi_exactness, a FORTRAN90 code which tests the polynomial exactness of quadrature rules for integrals with a Jacobi weight function.
- jacobi_exactness_test
- jacobi_openmp, a FORTRAN90 code which uses OpenMP to parallelize a Jacobi iteration for solving A*x=b.
- jacobi_openmp_test
- jacobi_polynomial, a FORTRAN90 code which evaluates the Jacobi polynomial and associated functions.
- jacobi_polynomial_test
- jacobi_rule, a FORTRAN90 code which computes a Gauss-Jacobi quadrature rule of given order.
- jacobi_rule_test
- ketel_one, a FORTRAN90 code which finds all words formed from the letters in "ketel one vodka";
- ketel_one_test
- kmeans, a FORTRAN90 code which handles the K-Means problem, which organizes N points in M dimensions into K clusters;
- kmeans_test
- knapsack_01, a FORTRAN90 code which uses brute force to solve small versions of the 0/1 knapsack problem;
- knapsack_01_test
- kronrod, a FORTRAN90 code which computes a Gauss and Gauss-Kronrod pair of quadrature rules of arbitrary order, by Robert Piessens, Maria Branders.
- kronrod_test
- lagrange_approx_1d, a FORTRAN90 code which evaluates the Lagrange polynomial p(x) of degree m which approximates n data points (x(i),y(i)).
- lagrange_approx_1d_test
- lagrange_interp_1d, a FORTRAN90 code which evaluates the Lagrange polynomial p(x) which interpolates data depending on a 1D argument, so that p(x(i)) = y(i).
- lagrange_interp_1d_test
- lagrange_interp_2d, a FORTRAN90 code which evaluates the Lagrange polynomial p(x,y) which interpolates data depending on a 2D argument that was evaluated on a product grid, so that p(x(i),y(j)) = z(i,j).
- lagrange_interp_2d_test
- lagrange_interp_nd, a FORTRAN90 code which evaluates the Lagrange polynomial p(x) which interpolates data depending on a multidimensional argument that was evaluated on a product grid, so that p(x(i)) = z(i).
- lagrange_interp_nd_test
- lagrange_nd, a FORTRAN90 code which implements several multivariate Lagrange interpolation schemes developed by Tomas Sauer.
- lagrange_nd_test
- laguerre_exactness, a FORTRAN90 code which tests the polynomial exactness of Gauss-Laguerre quadrature rules for estimating the integral of a function with density exp(-x) over the interval [0,+oo).
- laguerre_exactness_test
- laguerre_integrands, a FORTRAN90 code which implements test problems for Gauss-Laguerre quadrature rules for estimating the integral of a function with density exp(-x) over the interval [0,+oo).
- laguerre_integrands_test
- laguerre_polynomial, a FORTRAN90 code which evaluates the Laguerre polynomial, the generalized Laguerre polynomials, and the Laguerre function.
- laguerre_polynomial_test
- laguerre_rule, a FORTRAN90 code which computes a Gauss-Laguerre quadrature rule for estimating the integral of a function with density exp(-x) over the interval [0,+oo).
- laguerre_rule_test
- lapack_d, a FORTRAN90 code which is the double precision real version of the LAPACK linear algebra code.
- lapack_d_test
- laplacian, a FORTRAN90 code which carries out computations related to the discrete Laplacian operator, including full or sparse evaluation, evaluation for unequally spaced data sampling points, application to data samples, solution of associated linear systems, eigenvalues and eigenvectors, and extension to 2D and 3D geometry.
- laplacian_test
- latin_cover, a FORTRAN90 code which produces N Latin squares which cover an NxN square, or NxN Latin cubes which cover an NxNxN cube.
- latin_cover_test
- latinize, a FORTRAN90 code which adjusts N points in M dimensions to form a Latin hypercube.
- latinize_test
- lattice_rule, a FORTRAN90 code which returns lattice rules for M-dimensional integration;
- lattice_rule_test
- lau_np, a FORTRAN90 code which implements heuristic algorithms for various NP-hard combinatorial problems, including the integer linear programming problem, the K-center problem, the K-median problem, the 0-1 knapsack problem, the multiple knapsack problem, the graph matching problem, the graph partitioning problem, the minimal Steiner tree problem, and the traveling salesman problem;
- lau_np_test
- laupack, a FORTRAN90 code which carries out various operations on graphs.
- laupack_test
- lcvt, a FORTRAN90 code which creates a sort of Latin Square Centroidal Voronoi Tessellation (CVT);
- lcvt_test
- lebesgue, a FORTRAN90 code which plots the Lebesgue function for 1D nodes, and estimates the Lebesgue constant, the maximum magnitude of the potential error of Lagrange polynomial interpolation.
- lebesgue_test
- legendre_exactness, a FORTRAN90 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].
- legendre_exactness_test
- legendre_polynomial, a FORTRAN90 code which evaluates the Legendre polynomial and associated functions.
- legendre_polynomial_test
- legendre_product_polynomial, a FORTRAN90 code which defines Legendre product polynomials, creating a multivariate polynomial as the product of univariate Legendre polynomials.
- legendre_product_polynomial_test
- legendre_rule, a FORTRAN90 code which computes a Gauss-Legendre quadrature rule of given order.
- legendre_rule_test
- legendre_rule_fast, a FORTRAN90 code which uses a fast, order N, algorithm to compute a Gauss-Legendre quadrature rule.
- legendre_rule_fast_test
- legendre_shifted_polynomial, a FORTRAN90 code which evaluates the shifted Legendre polynomial, with the domain [0,1].
- legendre_shifted_polynomial_test
- levenshtein, a FORTRAN90 code which returns the Levenshtein distance between two strings.
- levenshtein_test
- life_serial, a FORTRAN90 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.
- life_serial_test
- line_cvt_lloyd, a FORTRAN90 code which applies the Lloyd iteration repeatedly to N points, to compute a Centroidal Voronoi Tessellation (CVT) over the interior of a line segment in 1D.
- line_cvt_lloyd_test
- line_fekete_rule, a FORTRAN90 code which estimates the location of N Fekete points, for polynomial interpolation or quadrature, over the interior of a line segment in 1D.
- line_fekete_rule_test
- line_felippa_rule, a FORTRAN90 code which returns a Felippa quadrature rules for approximating integrals over the interior of a line segment in 1D.
- line_felippa_rule_test
- line_grid, a FORTRAN90 code which computes a grid of points over the interior of a line segment in 1D.
- line_grid_test
- line_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the length of the unit line in 1D.
- line_integrals_test
- line_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate the integral of a function over the length of the unit line in 1D.
- line_monte_carlo_test
- line_ncc_rule, a FORTRAN90 code which computes a Newton Cotes Closed (NCC) quadrature rule, using equally spaced points, over the interior of a line segment in 1D.
- line_ncc_rule_test
- line_nco_rule, a FORTRAN90 code which computes a Newton Cotes Open (NCO) quadrature rule, using equally spaced points, over the interior of a line segment in 1D.
- line_nco_rule_test
- linpack_bench, a FORTRAN90 code which carries out the LINPACK benchmark;
- linpack_bench_test
- linpack_d, a FORTRAN90 code which factors and solves linear systems using double precision real arithmetic, by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart.
- linpack_d_test
- linpack_z, a FORTRAN90 code which factors and solves linear systems using double precision complex arithmetic, by Jack Dongarra, Jim Bunch, Cleve Moler, Pete Stewart.
- linpack_z_test
- llsq, a FORTRAN90 code which solves the simple linear least squares (LLS) problem of finding the formula of a straight line y=a*x+b which minimizes the root mean square error to N data points.
- llsq_test
- lobatto_polynomial, a FORTRAN90 code which evaluates Lobatto polynomials similar to Legendre polynomials except that they are 0 at both endpoints.
- lobatto_polynomial_test
- local_min, a FORTRAN90 code which finds a local minimum of a scalar function of a scalar variable, without the use of derivative information, by Richard Brent.
- local_min_test
- local_min_rc, a FORTRAN90 code which finds a local minimum of a scalar function of a scalar variable, without the use of derivative information, using reverse communication (RC), by Richard Brent.
- local_min_rc_test
- log_normal, a FORTRAN90 code which returns quantities related to the log normal Probability Distribution Function (PDF).
- log_normal_test
- log_normal_truncated_ab, a FORTRAN90 code which returns quantities related to the log normal Probability Distribution Function (PDF) truncated to the interval [A,B].
- log_normal_truncated_ab_test
- lorenz_ode, a FORTRAN90 code which approximates solutions to the Lorenz system of ordinary differential equations (ODE), creating output files that can be displayed by gnuplot().
- lorenz_ode_test
- luhn, a FORTRAN90 code which computes the Luhn check digit for a string, or verifies a string, as used for error detection in credit card numbers.
- luhn_test
- machar, a FORTRAN90 code which dynamically computes the values of various machine characteristic constants by William Cody;
- machar_test
- machine, a FORTRAN90 code which returns tabulated values of the constants associated with computer arithmetic;
- machine_test
- makefile_test, FORTRAN90 codes which use a makefile for maintaining a software project;
- mandelbrot, a FORTRAN90 code which generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot fractal set;
- mandelbrot_test
- mandelbrot_openmp, a FORTRAN90 code which generates an ASCII Portable Pixel Map (PPM) image of the Mandelbrot fractal set, using OpenMP for parallel execution;
- mandelbrot_openmp_test
- mario, a FORTRAN90 code which creates a sort of "needlepoint" image of Mario, as an array of colored squares.
- mario_test
- matrix_exponential, a FORTRAN90 code which demonstrates some simple approaches to the problem of computing the exponential of a matrix;
- matrix_exponential_test
- md, a FORTRAN90 code which carries out a molecular dynamics simulation, and is intended as a starting point for implementing an OpenMP parallel version;
- md_test
- md_openmp, a FORTRAN90 code which carries out a molecular dynamics simulation in parallel using OpenMP;
- md_openmp_test
- memory, a FORTRAN90 code which declares and uses a sequence of larger and larger arrays, to see what the memory limits are on a given computer.
- memory_test
- mesh_bandwidth, a FORTRAN90 code which returns the geometric bandwidth associated with a mesh of elements of any order and in a space of M dimensions.
- mesh_bandwidth_test
- meshless, a FORTRAN90 code which uses a centroidal Voronoi tessellation (CVT) to determine a meshless grid, by Lili Ju;
- meshless_test
- mgmres, a FORTRAN90 code which applies the restarted Generalized Minimum Residual (GMRES) algorithm to solve a sparse linear system, using Compressed Row Storage (CRS) or sparse triplet (ST) format, by Lili Ju.
- mgmres_test
- midpoint_explicit, a FORTRAN90 code which solves one or more ordinary differential equations (ODE) using the (explicit) midpoint method, also called the modified Euler method.
- midpoint_explicit_test
- midpoint_fixed, a FORTRAN90 code which solves one or more ordinary differential equations (ODE) using the (implicit) midpoint method, using a fixed point iteration for the nonlinear equation.
- midpoint_fixed_test
- minpack, a FORTRAN90 code which solves systems of nonlinear equations, or the least squares minimization of the residual of linear or nonlinear equations, by Jorge More, Danny Sorenson, Burton Garbow, Kenneth Hillstrom.
- minpack_test
- monomial, a FORTRAN90 code which enumerates, lists, ranks, unranks and randomizes multivariate monomials in a space of M dimensions, with total degree less than N, equal to N, or lying within a given range.
- monomial_test
- monomial_value, a FORTRAN90 code which evaluates a monomial in M dimensions.
- monomial_value_test
- mpi_test, FORTRAN90 codes which uses the message passing interface (MPI) for parallel processing on distributed memory systems;
- muller, a FORTRAN90 code which seeks a root of a nonlinear equation using the Muller method, with complex arithmetic.
- muller_test
- multigrid_poisson_1d, a FORTRAN90 code which applies the multigrid method to a discretized version of the 1D Poisson equation.
- multigrid_poisson_1d_test
- mumps_test, calls mumps(), which efficiently solves large systems of linear equations.
- mxm_openmp, a FORTRAN90 code which computes a dense matrix product C=A*B, using OpenMP for parallel execution.
- mxm_openmp_test
- naca, a FORTRAN90 code which takes the parameters of certain NACA airfoils and returns the coordinates of a sequence of points that outline the wing shape. The points can be plotted with gnuplot().
- naca_test
- nas, a FORTRAN90 code which runs the NASA kernel benchmark.
- nas_test
- navier_stokes_2d_exact, a FORTRAN90 code which evaluates an exact solution to the incompressible time-dependent Navier-Stokes equations (NSE) over an arbitrary domain in 2D.
- navier_stokes_2d_exact_test
- navier_stokes_3d_exact, a FORTRAN90 code which evaluates an exact solution to the incompressible time-dependent Navier-Stokes equations (NSE) over an arbitrary domain in 3D.
- navier_stokes_3d_exact_test
- nearest_interp_1d, a FORTRAN90 code which interpolates data using a piecewise constant interpolant defined by the nearest neighbor criterion, creating graphics files for processing by gnuplot().
- nearest_interp_1d_test
- netcdf_test, FORTRAN90 codes which use netcdf() to read and write portable compressed data files.
- newton_interp_1d, a FORTRAN90 code which finds a polynomial interpolant to data using Newton divided differences.
- newton_interp_1d_test
- newton_rc, a FORTRAN90 code which solves a system of nonlinear equations by Newton's method, using reverse communication (RC).
- newton_rc_test
- niederreiter2, a FORTRAN90 code which computes elements of the Niederreiter Quasi Mont Carlo (QMC) M-dimensional sequence, using base 2;
- niederreiter2_test
- nintlib, a FORTRAN90 code which carries out approximate integration (quadrature) in M dimensions;
- nintlib_test
- nms, a FORTRAN90 code which includes a wide variety of numerical software, including solvers for linear systems of equations, interpolation of data, numerical quadrature, linear least squares (LLS) data fitting, the solution of nonlinear equations, ordinary differential equations (ODE), optimization and nonlinear least squares (NLS), simulation and random numbers, trigonometric approximation and Fast Fourier Transforms (FFT).
- nms_test
- normal, a FORTRAN90 code which implements a random number generator (RNG) for normally distributed values;
- normal_test
- ode, a FORTRAN90 code which solves a system of ordinary differential equations (ODE), by Shampine and Gordon;
- ode_test
- openmp_test, FORTRAN90 codes which use OpenMP for parallel execution;
- optimize_test, FORTRAN90 codes which looks at the use of automatic optimization by the compiler to make the executable code run faster.
- ornstein_uhlenbeck, a FORTRAN90 code which approximates solutions of the Ornstein-Uhlenbeck stochastic ordinary differential equation (SODE) using the Euler method, the Euler-Maruyama method, and the Milstein method, and creating graphics files for processing by gnuplot().
- ornstein_uhlenbeck_test
- padua, a FORTRAN90 code which returns the coordinates of the 2D Padua points, as well as interpolation weights or quadrature weights, and images of the points in gnuplot() graphics files.
- padua_test
- partial_digest, a FORTRAN90 code which solves the partial digest problem;
- partial_digest_test
- partition_problem, a FORTRAN90 code which seeks solutions of the partition problem, splitting integers into two subsets with equal sum.
- partition_problem_test
- patterson_rule, a FORTRAN90 code which returns the points and weights of a 1D Gauss-Patterson quadrature rule of order 1, 3, 7, 15, 31, 63, 127, 255 or 511.
- patterson_rule_test
- pbma_io, a FORTRAN90 code which reads or writes ASCII Portable Bit Map (PBM) 2D graphics files;
- pbma_io_test
- pdflib, a FORTRAN90 code which evaluates Probability Density Functions (PDF) and produces random samples from them, including beta, binomial, chi, exponential, gamma, inverse chi, inverse gamma, multinomial, normal, scaled inverse chi, and uniform.
- pdflib_test
- persistence, a FORTRAN90 code which demonstrates how to initialize, get, or set data stored within a function, using static/persistent/saved/local memory.
- persistence_test
- pgma_io, a FORTRAN90 code which reads or writes ASCII Portable Gray Map (PGM) 2D graphics files;
- pgma_io_test
- pink_noise, a FORTRAN90 code which computes a pink noise signal obeying a 1/f power law.
- pink_noise_test
- plot_to_ps, a FORTRAN90 code which reads simple text commands and creates a PostScript (PS) image;
- plot_to_ps_test
- poisson_openmp, a FORTRAN90 code which computes an approximate solution to the Poisson equation in a rectangle, using the Jacobi iteration to solve the linear system, and OpenMP to carry out the Jacobi iteration in parallel.
- poisson_openmp_test
- poisson_simulation, a FORTRAN90 code which simulates a Poisson process in which events randomly occur with an average waiting time of Lambda, creating graphics files for processing by gnuplot().
- poisson_simulation_test
- polpak, a FORTRAN90 code which evaluates a variety of mathematical functions, including Chebyshev, Gegenbauer, Hermite, Jacobi, Laguerre, Legendre polynomials, and the Collatz sequence.
- polpak_test
- polygon_grid, a FORTRAN90 code which generates a grid of points over the interior of a polygon in 2D.
- polygon_grid_test
- polygon_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the interior of a polygon in 2D.
- polygon_integrals_test
- polygon_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate the integral of a function over the interior of a polygon in 2D.
- polygon_monte_carlo_test
- polygon_properties, a FORTRAN90 code which computes properties of an arbitrary polygon in the plane, defined by a sequence of vertices, including interior angles, area, centroid, containment of a point, convexity, diameter, distance to a point, inradius, lattice area, nearest point in set, outradius, uniform sampling.
- polygon_properties_test
- polygon_triangulate, a FORTRAN90 code which triangulates a possibly nonconvex polygon in 2D, and which uses gnuplot() to display the external edges and internal diagonals of the triangulation.
- polygon_triangulate_test
- polynomial, a FORTRAN90 code which adds, multiplies, differentiates, evaluates and prints multivariate polynomials in a space of M dimensions.
- polynomial_test
- polynomials, a FORTRAN90 code which defines multivariate polynomials over rectangular domains, for which certain information is to be determined, such as the maximum and minimum values.
- polynomials_test
- polyominoes, a FORTRAN90 code which manipulates polyominoes and tilings.
- polyominoes_test
- power_method, a FORTRAN90 code which carries out the power method for finding a dominant eigenvalue and its eigenvector.
- power_method_test
- power_rule, a FORTRAN90 code which constructs a power rule, that is, a product quadrature rule from identical 1D factor rules.
- power_rule_test
- ppma_io, a FORTRAN90 code which reads or writes ASCII Portable Pixel Map (PPM) 2D color graphics files;
- ppma_io_test
- pppack, a FORTRAN90 code which computes piecewise polynomial interpolants and approximants, in particular, cubic splines, by Carl de Boor.
- pppack_test
- praxis, a FORTRAN90 code which minimizes a scalar function of several variables, without requiring derivative information, by Richard Brent.
- praxis_test
- predator_prey_ode, a FORTRAN90 code which solves a time-dependent predator-prey system of ordinary differential equations (ODE).
- predator_prey_ode_test
- prime_mpi, a FORTRAN90 code which counts the number of primes between 1 and N, using MPI for parallel execution.
- prime_mpi_test
- prime_openmp, a FORTRAN90 code which counts the number of primes between 1 and N, using OpenMP for parallel execution.
- prime_openmp_test
- prob, a FORTRAN90 code which evaluates, samples, inverts, and characterizes Probability Density Functions (PDF) and Cumulative Density Functions (CDF), including anglit, arcsin, benford, birthday, bernoulli, beta_binomial, beta, binomial, bradford, burr, cardiod, cauchy, chi, chi squared, circular, cosine, deranged, dipole, dirichlet mixture, discrete, empirical, english sentence and word length, error, exponential, extreme values, f, fisk, folded normal, frechet, gamma, generalized logistic, geometric, gompertz, gumbel, half normal, hypergeometric, inverse gaussian, laplace, levy, logistic, log normal, log series, log uniform, lorentz, maxwell, multinomial, nakagami, negative binomial, normal, pareto, planck, poisson, power, quasigeometric, rayleigh, reciprocal, runs, sech, semicircular, student t, triangle, uniform, von mises, weibull, zipf.
- prob_test
- product_rule, a FORTRAN90 code which creates an M-dimensional quadrature rule from a product of distinct 1d quadrature rules;
- product_rule_test
- pwl_approx_1d, a FORTRAN90 code which approximates data using a piecewise linear function.
- pwl_approx_1d_test
- pwl_interp_1d, a FORTRAN90 code which interpolates data using a piecewise linear function.
- pwl_interp_1d_test
- pwl_interp_2d, a FORTRAN90 code which evaluates a piecewise linear interpolant to data defined on a regular 2D grid.
- pwl_interp_2d_test
- pwl_interp_2d_scattered, a FORTRAN90 code which evaluates a piecewise linear interpolant to data which is available at an irregularly arranged set of points.
- pwl_interp_2d_scattered_test
- pwl_product_integral, a FORTRAN90 code which calculates the exact value of the integral of the product of two piecewise linear functions f(x) and g(x).
- pwl_product_integral_test
- pyramid_exactness, a FORTRAN90 code which investigates the polynomial exactness of a quadrature rule over the interior of the unit pyramid in 3D.
- pyramid_exactness_test
- pyramid_felippa_rule, a FORTRAN90 code which returns a Felippa quadrature rules for approximating integrals over the interior of a pyramid in 3D.
- pyramid_felippa_rule_test
- pyramid_grid, a FORTRAN90 code which computes a grid of points over the interior of the unit pyramid in 3D;
- pyramid_grid_test
- pyramid_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the interior of the unit pyramid in 3D.
- pyramid_integrals_test
- pyramid_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit pyramid in 3D;
- pyramid_monte_carlo_test
- pyramid_rule, a FORTRAN90 code which computes a quadrature rule over the interior of the unit pyramid in 3D.
- pyramid_rule_test
- qr_solve, a FORTRAN90 code which computes the linear least squares (LLS) solution of a system A*x=b.
- qr_solve_test
- quad_mesh, a FORTRAN90 code which handles meshes of quadrilaterals over a 2D region;
- quad_mesh_test
- quad_mesh_rcm, a FORTRAN90 code which computes the Reverse Cuthill McKee (RCM) reordering for nodes in a mesh of 4-node quadrilaterals.
- quad_mesh_rcm_test
- quad_mpi, a FORTRAN90 code which applies a quadrature rule to estimate an integral, using MPI;
- quad_mpi_test
- quad_openmp, a FORTRAN90 code which applies a quadrature rule to estimate an integral over a 1D interval, using OpenMP for parallel execution;
- quad_openmp_test
- quadmom, a FORTRAN90 code which computes a Gaussian quadrature rule for a weight function rho(x) based on the Golub-Welsch procedure that only requires knowledge of the moments of rho(x).
- quadmom_test
- quadrature_golub_welsch, a FORTRAN90 code which computes the points and weights of a Gaussian quadrature rule using the Golub-Welsch procedure.
- quadrature_golub_welsch_test
- quadrature_least_squares, a FORTRAN90 code which computes weights for sub-interpolatory quadrature rules, that is, it estimates integrals by integrating a polynomial that approximates the function data in a least squares sense.
- quadrature_least_squares_test
- quadrule, a FORTRAN90 code which implements rules for approximate integration (quadrature) in one dimension;
- quadrule_test
- quality, a FORTRAN90 code which computes quality of distribution measures for pointsets in M dimensions;
- quality_test
- quaternions, a FORTRAN90 code which carries out some simple arithmetic operations for quaternions.
- quaternions_test
- quotes, a FORTRAN90 code which prints a random quote from a file;
- quotes_test
- r83, a FORTRAN90 code which contains linear algebra routines for r83 matrices (real, 64 bit, tridiagonal 3xN format).
- r83_test
- r8col, a FORTRAN90 code which contains utility routines for an R8COL, that is, a double precision real MxN array, considered as N column vectors, each of length M. The data may be thought of as a matrix of multiple columns, and many operations will be carried out columnwise.
- r8col_test
- r8ge, a FORTRAN90 code which contains linear algebra routines for R8GE matrices (real, 64 bit, General format).
- r8ge_test
- r8lib, a FORTRAN90 code which contains many utility routines, using double precision real (R8) arithmetic.
- r8lib_test
- r8lt, a FORTRAN90 code which contains linear algebra routines for R8LT matrices (real, 64 bit, Lower Triangular).
- r8lt_test
- r8poly, a FORTRAN90 code which contains utilities for polynomials with R8 coefficients, that is, using double precision or 64 bit real arithmetic.
- r8poly_test
- r8row, a FORTRAN90 code which contains utilities for an R8ROW, that is, a double precision real MxN array, considered as M row vectors, each of length N. The data may be thought of as a matrix of multiple rows, and many operations will be carried out rowwise.
- r8row_test
- r8st, a FORTRAN90 code which contains linear algebra routines for R8ST matrices (real, 64 bit, Sparse Triplet).
- r8st_test
- r8ut, a FORTRAN90 code which contains linear algebra routines for R8UT matrices (real, 64 bit, Upper Triangular).
- r8ut_test
- randlc, a FORTRAN90 code which implements a random number generator (RNG) used by the NAS Benchmarks.
- randlc_test
- random_data, a FORTRAN90 code which uses a random number generator (RNG) to sample points distributed according to various probability density functions (PDF), spatial dimensions, and geometries, including the M-dimensional cube, ellipsoid, simplex and sphere.
- random_data_test
- random_mpi, a FORTRAN90 code which demonstrates one way to generate the same sequence of values from a random number generatore (RNG) for both sequential execution and parallel execution under MPI.
- random_mpi_test
- random_openmp, a FORTRAN90 code which illustrates how a parallel program using OpenMP can generate multiple distinct streams of random numbers.
- random_openmp_test
- random_sorted, a FORTRAN90 code which uses a random number generator (RNG) to create a vector of random values which are already sorted.
- random_sorted_test
- ranlib, a FORTRAN90 code which a library of random number generators (RNG), 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.
- ranlib_test
- ranmap, a FORTRAN90 code which creates a PostScript (PS) file of images of iterated affine mappings;
- ranmap_test
- rbf_interp_1d, a FORTRAN90 code which defines and evaluates radial basis function (RBF) interpolants to 1D data.
- rbf_interp_1d_test
- rbf_interp_2d, a FORTRAN90 code which defines and evaluates radial basis function (RBF) interpolants to 2D data.
- rbf_interp_2d_test
- rbf_interp_nd, a FORTRAN90 code which defines and evaluates radial basis function (RBF) interpolants to multidimensional data.
- rbf_interp_nd_test
- reactor simulation, a FORTRAN90 code which is a simple Monte Carlo simulation of the shielding effect of a slab of a certain thickness in front of a neutron source. This code was provided with the book "Numerical Methods and Software."
- reactor simulation_test
- real_precision_test, FORTRAN90 codes which investigate the occasionally awkward methods for requesting a real data type with given precision. This is the preferred method for requesting double or quadruple precision arithmetic;
- region, a FORTRAN90 code which reads 3D MRI voxel data, and groups the voxels into connected regions;
- region_test
- ring_mpi, a FORTRAN90 code which uses the MPI parallel environment, and measures the time necessary to copy data around a ring of processes.
- ring_mpi_test
- rk4, a FORTRAN90 code which applies the fourth order Runge-Kutta (RK) algorithm to estimate the solution of an ordinary differential equation (ODE).
- rk4_test
- rkf45, a FORTRAN90 code which applies a Runge-Kutta-Fehlberg (RKF) solver to a system of ordinary differential equations (ODE);
- rkf45_test
- rnglib, a FORTRAN90 code which implements a random number generator (RNG) with splitting facilities, allowing multiple independent streams to be computed, by L'Ecuyer and Cote.
- rnglib_test
- root_rc, a FORTRAN90 code which seeks a solution of a scalar nonlinear equation f(x)=0, using reverse communication (RC), by Gaston Gonnet.
- root_rc_test
- roots_rc, a FORTRAN90 code which seeks solutions of a system of nonlinear equations, using reverse communication (RC), by Gaston Gonnet.
- roots_rc_test
- rot13, a FORTRAN90 code which makes a copy of a file which has been encoded using the ROT13 coding and a ROT5 coding for digits.
- rot13_test
- row_echelon_integer, a FORTRAN90 code which carries out the exact computation of the integer row echelon form (IREF) and integer reduced row echelon form (IRREF) of an integer matrix.
- row_echelon_integer_test
- satisfy, a FORTRAN90 code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem.
- satisfy_test
- satisfy_mpi, a FORTRAN90 code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem, using MPI to perform the calculation in parallel.
- satisfy_mpi_test
- satisfy_openmp, a FORTRAN90 code which demonstrates, for a particular circuit, an exhaustive search for solutions of the circuit satisfiability problem, using OpenMP for parallel execution.
- satisfy_openmp_test
- schedule_openmp, a FORTRAN90 code which demonstrates the default, static, and dynamic methods of scheduling loop iterations in OpenMP to avoid work imbalance.
- schedule_openmp_test
- sde, a FORTRAN90 code which illustrates properties of stochastic ordinary differential equations (SODE), and common algorithms for their analysis, including the Euler method, the Euler-Maruyama method, and the Milstein method, making graphics files for processing and display by gnuplot(), by Desmond Higham;
- sde_test
- search_mpi, a FORTRAN90 code which searches integers between A and B for a solution J such that F(J)=C, carried out in parallel using MPI.
- search_mpi_test
- sftpack, a FORTRAN90 code which implements the slow Fourier transform, intended as a teaching tool and comparison with the Fast Fourier Transform (FFT).
- sftpack_test
- shallow_water_1d, a FORTRAN90 code which simulates the evolution of a 1D fluid governed by the time-dependent shallow water equations.
- shallow_water_1d_test
- shepard_interp_1d, a FORTRAN90 code which defines and evaluates Shepard interpolants to 1D data, based on inverse distance weighting.
- shepard_interp_1d_test
- shepard_interp_2d, a FORTRAN90 code which defines and evaluates Shepard interpolants to 2D data, based on inverse distance weighting.
- shepard_interp_2d_test
- shepard_interp_nd, a FORTRAN90 code which defines and evaluates Shepard interpolants to multidimensional data, based on inverse distance weighting.
- shepard_interp_nd_test
- simplex_coordinates, a FORTRAN90 code which computes the Cartesian coordinates of the vertices of a regular simplex in M dimensions.
- simplex_coordinates_test
- simplex_gm_rule, a FORTRAN90 code which defines Grundmann-Moeller quadrature rules over the interior of a triangle in 2D, a tetrahedron in 3D, or over the interior of the simplex in M dimensions.
- simplex_gm_rule_test
- simplex_grid, a FORTRAN90 code which generates a regular grid of points over the interior of an arbitrary simplex in M dimensions.
- simplex_grid_test
- simplex_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the interior of the unit simplex in M dimensions.
- simplex_integrals_test
- simplex_monte_carlo, a FORTRAN90 code which uses the Monte Carlo method to estimate an integral over the interior of the unit simplex in M dimensions.
- simplex_monte_carlo_test
- sine_transform, a FORTRAN90 code which demonstrates some simple properties of the discrete sine transform (DST).
- sine_transform_test
- snakes_and_ladders, FORTRAN90 codes which simulate and investigate a one-player version of the game of Snakes and Ladders.
- snakes_and_ladders_test
- sncndn, a FORTRAN90 code which evaluates the Jacobi elliptic functions SN, CN, and DN.
- sncndn_test
- sobol, a FORTRAN90 code which evaluates the Sobol Quasi Mont Carlo (QMC) M dimensional sequence, by Bennett Fox.
- sobol_test
- solve, a FORTRAN90 code which demonstrates how Gauss elimination can be used to solve a linear system A*x=b.
- solve_test
- sort_rc, a FORTRAN90 code which sorts a list of any kind of objects, using reverse communication (RC).
- sort_rc_test
- sparse_display, a FORTRAN90 code which reads information defining a matrix of numbers and displays the sparsity pattern or location of the nonzero elements using gnuplot(). This operation is already available in the built-in MATLAB spy() command.
- sparse_display_test
- sparse_grid_hw, a FORTRAN90 code which creates sparse grids based on Gauss-Legendre, Gauss-Hermite, Gauss-Patterson, or a nested variation of Gauss-Hermite rules, by Florian Heiss and Viktor Winschel.
- sparse_grid_hw_test
- sparse_interp_nd, a FORTRAN90 code which defines a sparse interpolant to a function f(x) of a multidimensional argument.
- sparse_interp_nd_test
- specfun, a FORTRAN90 code which evaluates special functions, including Bessel I, J, K and Y functions, Dawson Integral, Error (Erf), Exponential Integral (E1 and EI), Gamma, log Gamma, and Psi/Digamma, by William Cody and Laura Stoltz;
- specfun_test
- special_functions, a FORTRAN90 code which evaluates special functions, including Airy, Associated Legendre Bessel, Beta, Complete Elliptic Integral, Confluent Hypergeometric, Cosine Integral, Elliptic Integral, Error, Exponential Integral, Fresnel Integral, Gamma, Hankel, Hypergeometric, Incomplete Beta, Incomplete Gamma, Jacobian Elliptic, Kelvin, Lambda, Legendre, Mathieu, Modified Spherical Bessel, Parabolic Cylinder, Psi, Riccati-Bessel, Sine Integral, Spheroidal Wave, Struve, Whittaker, as well as Bernoulli Numbers, Euler Numbers, Hermite Polynomials, Laguerre Polynomials, Legendre Polynomials, by Shanjie Zhang, Jianming Jin;
- special_functions_test
- sphere_cubed_grid, a FORTRAN90 code which uses the projection of a cube to create grids of points, lines, and quadrilaterals on the surface of the unit sphere in 3D.
- sphere_cubed_grid_test
- sphere_cvt, a FORTRAN90 code which uses a Centroidal Voronoi Tessellation (CVT) to generate a mesh of well-separated points on the surface of the unit sphere in 3D.
- sphere_cvt_test
- sphere_delaunay, a FORTRAN90 code which reads a file containing the coordinates of points on the surface of the unit sphere in 3D, computes the Delaunay triangulation, and outputs a PostScript (PS) file of the image;
- sphere_delaunay_test
- sphere_design_rule, a FORTRAN90 code which defines spherical designs for quadrature on the surface of the unit sphere in 3D;
- sphere_design_rule_test
- sphere_exactness, a FORTRAN90 code which tests the polynomial exactness of a quadrature rule on the surface of the unit sphere in 3D.
- sphere_exactness_test
- sphere_fibonacci_grid, a FORTRAN90 code which uses a Fibonacci spiral to create a grid of points on the surface of the unit sphere in 3D.
- sphere_fibonacci_grid_test
- sphere_grid, a FORTRAN90 code which generates grids of points, or of points and lines, or of points and lines and faces, on the surface of the unit sphere in 3D.
- sphere_grid_test
- sphere_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the surface of the unit sphere in 3D.
- sphere_integrals_test
- sphere_lebedev_rule, a FORTRAN90 code which computes Lebedev quadrature rules on the surface of the unit sphere in 3D.
- sphere_lebedev_rule_test
- sphere_llq_grid, a FORTRAN90 code which uses longitudes and latitudes to create grids of points, lines, and quadrilaterals on the surface of the unit sphere in 3D.
- sphere_llq_grid_test
- sphere_llt_grid, a FORTRAN90 code which uses longitudes and latitudes to create grids of points, lines, and triangles on the surface of the unit sphere in 3D.
- sphere_llt_grid_test
- sphere_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate the integral of a function on the surface of the unit sphere in 3D;
- sphere_monte_carlo_test
- sphere_quad, a FORTRAN90 code which uses triangulation to approximate an integral on the surface of the unit sphere in 3D;
- sphere_quad_test
- sphere_stereograph, a FORTRAN90 code which computes the stereographic mapping between points on the surface of the unit sphere in 3D and points on the plane Z = 1; a generalized mapping is also available.
- sphere_stereograph_test
- sphere_voronoi, a FORTRAN90 code which reads a file containing the coordinates of points on the surface of the unit sphere in 3D, computes the Voronoi diagram, and outputs a PostScript (PS) file of the image;
- sphere_voronoi_test
- spline, a FORTRAN90 code which interpolates and approximates via splines;
- spline_test
- square_arbq_rule, a FORTRAN90 code which returns quadrature rules, with exactness up to total degree 20, over the interior of the symmetric square in 2D, by Hong Xiao and Zydrunas Gimbutas.
- square_arbq_rule_test
- square_exactness, a FORTRAN90 code which investigates the polynomial exactness of quadrature rules for f(x,y) over the interior of a square in 2D.
- square_exactness_test
- square_felippa_rule, a FORTRAN90 code which returns a Felippa quadrature rules for approximating integrals over the interior of a square in 2D.
- square_felippa_rule_test
- square_grid, a FORTRAN90 code which computes a grid of points over the interior of a square in 2D.
- square_grid_test
- square_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the interior of the unit square or symmetric unit square in 2D.
- square_integrals_test
- square_minimal_rule, a FORTRAN90 code which returns "almost minimal" quadrature rules, with exactness up to total degree 55, over the interior of the symmetric square in 2D, by Mattia Festa and Alvise Sommariva.
- square_minimal_rule_test
- square_monte_carlo, a FORTRAN90 code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit square in 2D.
- square_monte_carlo_test
- square_symq_rule, a FORTRAN90 code which returns symmetric quadrature rules, with exactness up to total degree 20, over the interior of the symmetric square in 2D, by Hong Xiao and Zydrunas Gimbutas.
- square_symq_rule_test
- st_io, a FORTRAN90 code which reads and writes sparse linear systems stored in the Sparse Triplet (ST) format.
- st_io_test
- st_to_ccs, a FORTRAN90 code which converts sparse matrix data from Sparse Triplet (ST) format to Compressed Column Storage (CCS) format;
- st_to_ccs_test
- stiff_ode, a FORTRAN90 code which considers an ordinary differential equation (ODE) which is an example of a stiff ODE.
- stiff_ode_test
- stla_io, a FORTRAN90 code which reads and writes the 3D graphics information in an ASCII stereolithography (STL) file;
- stla_io_test
- stokes_2d_exact, a FORTRAN90 code which evaluates exact solutions to the incompressible steady Stokes equations over the unit square in 2D.
- stokes_2d_exact_test
- string_pde, a FORTRAN90 code which sets up and solves the partial differential equations (PDE) describing a vibrating string, creating files that can be displayed by gnuplot().
- string_pde_test
- stripack, a FORTRAN90 code which computes Delaunay triangulations and Voronoi diagrams on the surface of the unit sphere in 3D, a version of ACM TOMS algorithm 772, by Robert Renka.
- stripack_test
- stripack_delaunay, a FORTRAN90 code which reads a file of points on the surface of the unit sphere in 3D, calls stripack to determine the Delaunay triangulation, and writes out a file describing it.
- stripack_delaunay_test triangulation, and writes out a file describing it.
- stripack_voronoi, a FORTRAN90 code which reads a file of points on the surface of the unit sphere sphere in 3D, calls stripack to determine the Voronoi diagram, and writes out a file describing it.
- stripack_voronoi_test
- stripper, a FORTRAN90 code which performs a variety of file modifications such as capitalization, removal of control characters, and so on;
- stripper_test
- stroud, a FORTRAN90 code which defines quadrature rules for a variety of M-dimensional regions, including the interior of the square, cube and hypercube, the pyramid, cone and ellipse, the hexagon, the M-dimensional octahedron, the circle, sphere and hypersphere, the triangle, tetrahedron and simplex, and the surface of the circle, sphere and hypersphere.
- stroud_test
- subanagram, a FORTRAN90 code which finds words which are anagrams formed from some of the letters of a given master word.
- subanagram_test
- subpak, a FORTRAN90 code which implements a wide variety of operations on real and integer vectors and matrices;
- subpak_test
- subset, a FORTRAN90 code which enumerates, generates, randomizes, ranks and unranks combinatorial objects including combinations, compositions, Gray codes, index sets, partitions, permutations, polynomials, subsets, and Young tables. Backtracking routines are included to solve some combinatorial problems.
- subset_test
- subset_sum, a FORTRAN90 code which seeks solutions of the subset sum problem.
- subset_sum
- svd_basis, a FORTRAN90 code which applies the singular value decomposition (SVD) to a collection of data vectors, extracting dominant modes;
- svd_basis_test
- svd_basis_weight, a FORTRAN90 code which applies the singular value decomposition (SVD) to a collection of weighted data vectors, extracting dominant modes;
- svd_basis_weight_test
- svd_snowfall, a FORTRAN90 code which reads a file containing historical snowfall data and analyzes the data with the Singular Value Decomposition (SVD), displaying the results using gnuplot().
- svd_snowfall_test
- svd_test, a FORTRAN90 code which demonstrates the Singular Value Decomposition (SVD).
- svd_truncated, a FORTRAN90 code which demonstrates the computation of the reduced or truncated Singular Value Decomposition (SVD) that is useful for cases when one dimension of the matrix is much smaller than the other.
- svd_truncated_test
- table_columns, a FORTRAN90 code which extracts specified columns from a file.
- table_columns_test
- table_io, a FORTRAN90 code which reads and writes data as a table file.
- table_io_test
- table_quality, a FORTRAN90 code which reads a table file of N points in M dimensions and computes the uniformity of the placement of the points;
- table_quality_test
- table_top, a FORTRAN90 code which is given a table file of M-dimensional points, makes plots of all coordinate pairs;
- table_top_test
- task_division, a FORTRAN90 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.
- task_division_test
- test_approx, a FORTRAN90 code which implements test problems for approximation, provided as (x,y) data.
- test_approx_test
- test_eigen, a FORTRAN90 code which implements test matrices for eigenvalue analysis.
- test_eigen_test
- test_int, a FORTRAN90 code which implements test problems for approximate integration in one dimension.
- test_int_test
- test_int_2d, a FORTRAN90 code which implements test problems for approximate integration in two dimensions.
- test_int_2d_test
- test_interp, a FORTRAN90 code which defines test problems for interpolation, provided as (x,y(x)) data.
- test_interp_test
- test_interp_1d, a FORTRAN90 code which defines test problems for interpolation of data y(x), which depends on a 1D argument.
- test_interp_1d_test
- test_interp_2d, a FORTRAN90 code which defines test problems for interpolation of data z(x,y), depending on a 2D argument.
- test_interp_2d_test
- test_interp_nd, a FORTRAN90 code which defines test problems for interpolation of data z(x), depending on an M-dimensional argument.
- test_interp_nd_test
- test_lls, a FORTRAN90 code which implements linear least squares (LLS) test problems of the form A*x=b.
- test_lls_test
- test_mat, a FORTRAN90 code which defines test matrices for which the condition number, determinant, eigenvalues, eigenvectors, inverse, null vectors, P*L*U factorization or linear system solution are known. Examples include the Fibonacci, Hilbert, Redheffer, Vandermonde, Wathen and Wilkinson matrices.
- test_mat_test
- test_matrix_exponential, a FORTRAN90 code which defines test cases for computing the matrix exponential.
- test_matrix_exponential_test
- test_mesh, a FORTRAN90 code which implements some sample 2D meshes.
- test_mesh_test
- test_min, a FORTRAN90 code which implements test problems for minimization of a scalar function of a scalar variable.
- test_min_test
- test_nearest, a FORTRAN90 code which tests the time complexity of various procedures for solving the nearest neighbor problem.
- test_nearest_test
- test_nint, a FORTRAN90 code which implements test problems for approximate integration (quadrature) in M dimensions.
- test_nint_test
- test_nls, a FORTRAN90 code which implements nonlinear least squares (NLS) test problems.
- test_nls_test
- test_nonlin, a FORTRAN90 code which implements test problems for the solution of systems of nonlinear equations.
- test_nonlin_test
- test_opt, a FORTRAN90 code which implements test problems for optimization of a scalar function of several variables.
- test_opt_test
- test_opt_con, a FORTRAN90 code which defines test problems for the minimization of a scalar function of several variables, with the search constrained to lie within a specified hyper-rectangle.
- test_opt_con_test
- test_optimization, a FORTRAN90 code which implements test problems for optimization of a scalar function of several variables, as described by Molga and Smutnicki.
- test_optimization_test
- test_partial_digest, a FORTRAN90 code which generates cases of the partial digest problem.
- test_partial_digest_test
- test_tet_mesh, a FORTRAN90 code which implements test problems for tetrahedralization or meshing of arbitrary regions in 3 dimensions.
- test_tet_mesh_test
- test_triangulation, a FORTRAN90 code which implements test problems for triangularization or meshing of arbitrary regions in 2 dimensions.
- test_triangulation_test
- test_values, a FORTRAN90 code which stores a small set of values for a variety of mathematical functions, suitable for a rough test of accuracy for algorithms.
- test_values_test
- test_zero, a FORTRAN90 code which implements test problems for the solution of a single nonlinear equation in one variable.
- test_zero_test
- tester, a BASH script which runs the test codes.
- tet_mesh, a FORTRAN90 code which carries out various tasks associated with tetrahedral meshes in 3D;
- tet_mesh_test
- tet_mesh_l2q, a FORTRAN90 code which reads information about a 4-node (linear) tet mesh and creates data defining a corresponding 10-node (quadratic) tet mesh;
- tet_mesh_l2q_test
- tet_mesh_q2l, a FORTRAN90 code which reads information about a 10-node (quadratic) tet mesh and creates data defining a corresponding 4-node (linear) tet mesh;
- tet_mesh_q2l_test
- tet_mesh_quad, a FORTRAN90 code which estimates the integral of a function over a region defined by a tetrahedral mesh.
- tet_mesh_quad_test
- tet_mesh_quality, a FORTRAN90 code which reads information about a tet mesh of points in 3D and computes various quality measures;
- tet_mesh_quality_test
- tet_mesh_to_gmsh, a FORTRAN90 code which writes a tetrahedral mesh to a gmsh() file.
- tet_mesh_to_gmsh_test
- tet_mesh_to_xml, a FORTRAN90 code which writes a tetrahedral mesh to an XML file.
- tet_mesh_to_xml_test
- tetrahedron_arbq_rule, a FORTRAN90 code which returns quadrature rules, with exactness up to total degree 15, over the interior of a tetrahedron in 3D, by Hong Xiao and Zydrunas Gimbutas.
- tetrahedron_arbq_rule_test
- tetrahedron_exactness, a FORTRAN90 code which tests the polynomial exactness of a quadrature rule over the interior of a tetrahedron in 3D;
- tetrahedron_exactness_test
- tetrahedron_felippa_rule, a FORTRAN90 code which returns a Felippa quadrature rules for approximating integrals over the interior of a tetrahedron in 3D.
- tetrahedron_felippa_rule_test
- tetrahedron_grid, a FORTRAN90 code which computes a grid of points over the interior of a tetrahedron in 3D.
- tetrahedron_grid_test
- tetrahedron_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the interior of the unit tetrahedron in 3D.
- tetrahedron_integrals_test
- tetrahedron_keast_rule, a FORTRAN90 code which defines ten quadrature rules, of degree of exactness 0 through 8, over the interior of the tetrahedron in 3D.
- tetrahedron_keast_rule_test
- tetrahedron_monte_carlo, a FORTRAN90 code which uses the Monte Carlo method to estimate an integral over the interior of a general tetrahedron in 3D.
- tetrahedron_monte_carlo_test
- tetrahedron_ncc_rule, a FORTRAN90 code which defines Newton-Cotes closed (NCC) quadrature rules over the interior of a tetrahedron in 3D.
- tetrahedron_ncc_rule_test
- tetrahedron_nco_rule, a FORTRAN90 code which defines Newton-Cotes open (NCO) quadrature rules over the interior of a tetrahedron in 3D.
- tetrahedron_nco_rule_test
- tetrahedron_properties, a FORTRAN90 code which computes properties, including the centroid, circumsphere, dihedral angles, edge lengths, face angles, face areas, insphere, quality, solid angles, and volume, of a tetrahedron in 3D.
- tetrahedron_properties_test
- tetrahedron01_monte_carlo, a FORTRAN90 code which uses the Monte Carlo method to estimate an integral over the interior of the unit tetrahedron in 3D.
- tetrahedron01_monte_carlo_test
- three_body_ode, a FORTRAN90 code which simulates the behavior of three planets, constrained to lie in a plane, and moving under the influence of gravity, by Walter Gander and Jiri Hrebicek.
- three_body_ode_test
- timer_test, a FORTRAN90 code which tests various timing functions.
- timestamp, a FORTRAN90 code which prints the current YMDHMS date as a timestamp.
- timestamp_test
- toeplitz, a FORTRAN90 code which implements Toeplitz matrix system solvers.
- toeplitz_test
- toeplitz_cholesky, a FORTRAN90 code which computes the Cholesky factorization of a nonnegative definite symmetric Toeplitz matrix.
- toeplitz_cholesky_test
- toms097, a FORTRAN90 code which computes the distance between all pairs of nodes in a directed graph with weighted edges, using the Floyd algorithm.
- toms097_test
- toms112, a FORTRAN90 code which determines whether a point is contained in a polygon, by Moshe Shimrat. This is a version of ACM TOMS algorithm 112.
- toms112_test
- toms178, a FORTRAN90 code which optimizes a scalar functional of multiple variables using the Hooke-Jeeves method, by Arthur Kaupe. This is a version of ACM TOMS algorithm 178.
- toms178_test
- toms179, a FORTRAN90 code which evaluates the modified Beta function, by Oliver Ludwig. This is a version of ACM TOMS algorithm 179.
- toms179_test
- toms243, a FORTRAN90 code which evaluates the logarithm of a complex value, by David Collens. This is a version of ACM TOMS algorithm 243.
- toms243_test
- toms291, a FORTRAN90 code which evaluates the logarithm of the Gamma function. This is a version of ACM TOMS algorithm 291.
- toms291_test
- toms358, a FORTRAN90 code which computes the singular value decomposition (SVD) of a complex matrix; this is a version of ACM TOMS algorithm 358. This is a translation created by Alexsander Schwarzenberg-Czerny.
- toms358_test
- toms443, a FORTRAN90 code which evaluates the Lambert W function. This is a version of ACM TOMS algorithm 443.
- toms443_test
- toms446, a FORTRAN90 code which manipulates Chebyshev series for interpolation and approximation; this is a version of ACM TOMS algorithm 446, by Roger Broucke.
- toms446_test
- toms453, a FORTRAN90 code which determines the abscissas and weights for a Gaussian quadrature formula for the Bromwich integral; this is a version of ACM TOMS algorithm 453.
- toms453_test
- toms462, a FORTRAN90 code which evaluates the upper right tail of the bivariate normal Probability Density Function (PDF); that is, the probability that normal variables X and Y with correlation R will satisfy H <= X and K <= Y; this is a version of ACM TOMS algorithm 462.
- toms462_test
- toms515, a FORTRAN90 code which selects subsets of size K from a set of size N. This is a version of ACM TOMS Algorithm 515, by Bill Buckles, Matthew Lybanon.
- toms515_test
- toms526, a FORTRAN90 code which interpolates scattered bivariate data. This is a version of ACM TOMS algorithm 526, by Hiroshi Akima;
- toms526_test
- toms552, a FORTRAN90 code which computes a solution of a constrained linear system. of a scalar function, this is a version of ACM TOMS algorithm 552;
- toms552_test
- toms577, a FORTRAN90 code which evaluates the Carlson elliptic integral functions RC, RD, RF and RJ. This is a version of ACM TOMS algorithm 577;
- toms577_test
- toms597, a FORTRAN90 code which evaluates Bessel functions I of real, non-integer order, by William Cody. this is a version of ACM TOMS Algorithm 597;
- toms597_test
- toms611, a FORTRAN90 code which seeks the minimizer of a scalar functional of multiple variables. This is a version of ACM TOMS algorithm 611, by David Gay.
- toms611_test
- toms647, a FORTRAN90 code which evaluates Faure, Halton and Sobol Quasi Monte Carlo (QMC) sequences. This is a version of ACM TOMS algorithm 647.
- toms647_test
- toms655, a FORTRAN90 code which computes the weights for interpolatory quadrature rules; this is commonly called IQPACK, by Sylvan Elhay and Jaroslav Kautsky. This is a version of ACM TOMS algorithm 655.
- toms655_test
- toms659, a FORTRAN90 code which computes elements of the Sobol Quasi Monte Carlo (QMC) sequence; this is a version of ACM TOMS algorithm 659.
- toms659_test
- toms660, a FORTRAN90 code which takes scattered 2D data and produces an interpolating function F(X,Y). This is a version of ACM TOMS algorithm 660, called qshep2d, by Robert Renka.
- toms660_test
- toms661, a FORTRAN90 code which takes scattered 3D data and produces an interpolating function F(X,Y,Z). This is a version of ACM TOMS algorithm 661, called qshep3d, by Robert Renka.
- toms661_test
- toms672, a FORTRAN90 code which generates an interpolatory quadrature rule of highest possible order, given preassigned abscissas. This can be used to generate Gauss-Kronrod and Gauss-Patterson quadrature rules. This is commonly called EXTEND. This is a version of ACM TOMS algorithm 672.
- toms672_test
- toms708, a FORTRAN90 code which includes routines to evaluate the incomplete Gamma function, by Armido Didonato, Alfred Morris; this is a version of ACM TOMS algorithm 708.
- toms708_test
- toms715, a FORTRAN90 code which evaluates special functions, including the Bessel I, J, K, and Y functions of order 0, of order 1, and of any real order, the Dawson integral, the error function, exponential integrals, the gamma function, the normal distribution function, the psi function. This is a version of ACM TOMS algorithm 715.
- toms715_test
- toms726, a FORTRAN90 code which computes recursion coefficients for orthogonal polynomials, and the abscissa and weights for related quadrature rules. by Walter Gautschi. This is commonly called ORTHPOL. This is a version of ACM TOMS algorithm 726.
- toms726_test
- toms738, a FORTRAN90 code which evaluates the Niederreiter Quasi Monte Carlo (QMC) sequence; this is a version of ACM TOMS algorithm 738;
- toms738_test
- toms743, a FORTRAN90 code which evaluates the Lambert W function. This is a version of ACM TOMS algorithm 743, by Barry, Barry and Culligan-Hensley.
- toms743_test
- toms757, a FORTRAN90 code which evaluates uncommon special functions, by Allan Mcleod; this is a version of ACM TOMS algorithm 757;
- toms757_test
- toms790, a FORTRAN90 code which computes an interpolating function to scattered data in the plane, by Robert Renka; this is commonly called cshep2d; this is a version of ACM TOMS algorithm 790.
- toms790_test
- toms792, a FORTRAN90 code which tests functions that interpolate scattered data in the plane; by Robert Renka; this is a version of ACM TOMS algorithm 792.
- toms792_test
- toms886, a FORTRAN90 code which defines the Padua points for interpolation in a 2D region, including the rectangle, triangle, and ellipse, by Marco Caliari, Stefano de Marchi, Marco Vianello. This is a version of ACM TOMS algorithm 886.
- toms886_test
- tri_surface_io, a FORTRAN90 code which reads and writes the 3D graphics information in a TRI_SURFACE file;
- tri_surface_io_test
- triangle_analyze, a FORTRAN90 code which reads a triangle defined in a file, and uses triangle_properties() to compute angles, area, centroid, circumcircle, edge lengths, incircle, orientation, orthocenter, and quality.
- triangle_analyze_test
- triangle_dunavant_rule, a FORTRAN90 code which defines Dunavant quadrature rules over the interior of a triangle in 2D.
- triangle_dunavant_rule_test
- triangle_exactness, a FORTRAN90 code which tests the polynomial exactness of a quadrature rule over the interior of a triangle in 2D.
- triangle_exactness_test
- triangle_fekete_rule, a FORTRAN90 code which returns Fekete rules for interpolation or quadrature over the interior of a triangle in 2D.
- triangle_fekete_rule_test
- triangle_felippa_rule, a FORTRAN90 code which returns a Felippa quadrature rules for approximating integrals over the interior of a triangle in 2D.
- triangle_felippa_rule_test
- triangle_grid, a FORTRAN90 code which computes a grid of points over the interior of a triangle in 2D.
- triangle_grid_test
- triangle_histogram, a FORTRAN90 code which computes histograms of data over the interior of the unit triangle in 2D.
- triangle_histogram_test
- triangle_integrals, a FORTRAN90 code which returns the exact value of the integral of any polynomial over the interior of an arbitrary triangle in 2D.
- triangle_integrals_test
- triangle_interpolate, a FORTRAN90 code which shows how vertex data can be interpolated at any point in the interior of a triangle.
- triangle_interpolate_test
- triangle_io, a FORTRAN90 code which reads or writes some of the files created by the triangle() code of Jonathan Shewchuk.
- triangle_io_test
- triangle_lyness_rule, a FORTRAN90 code which returns Lyness-Jespersen quadrature rules over the interior of a triangle in 2D;
- triangle_lyness_rule_test
- triangle_monte_carlo, a FORTRAN90 code which uses the Monte Carlo method to estimate an integral over the interior of a general triangle in 2D.
- triangle_monte_carlo_test
- triangle_ncc_rule, a FORTRAN90 code which defines Newton-Cotes closed (NCC) quadrature rules over the interior of a triangle in 2D.
- triangle_ncc_rule_test
- triangle_nco_rule, a FORTRAN90 code which defines Newton-Cotes open (NCO) quadrature rules over the interior of a triangle in 2D.
- triangle_nco_rule_test
- triangle_properties, a FORTRAN90 code which computes properties, including angles, area, centroid, circumcircle, edge lengths, incircle, orientation, orthocenter, and quality, of a triangle in 2D.
- triangle_properties_test
- triangle_svg, a FORTRAN90 code which uses Scalable Vector Graphics (SVG) to plot a triangle and any number of points, to illustrate quadrature rules and sampling techniques.
- triangle_svg_test
- triangle_symq_rule, a FORTRAN90 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.
- triangle_symq_rule_test
- triangle_to_fem, a FORTRAN90 code which reads the NODE and ELE files created by the triangle() code to describe a triangular mesh, and writes a corresponding pair of node and element files in the 2D FEM format.
- triangle_to_fem_test
- triangle_to_xml, a FORTRAN90 code which reads the NODE and ELE files created by triangle() to describe a triangular mesh in 2D, and writes out a corresponding XML mesh file for use by DOLFIN or FENICS.
- triangle_to_xml_test
- triangle_twb_rule, a FORTRAN90 code which returns quadrature rules over the interior of the unit triangle, as determined by Taylor, Wingate, and Bos.
- triangle_twb_rule_test
- triangle_wandzura_rule, a FORTRAN90 code which returns quadrature rules of exactness 5, 10, 15, 20, 25 and 30 over the interior of the triangle in 2D.
- triangle_wandzura_rule_test
- triangle01_integrals, a FORTRAN90 code which returns the integral of any monomial over the interior of the unit triangle in 2D.
- triangle01_integrals_test
- triangle01_monte_carlo, a FORTRAN90 code which uses the Monte Carlo method to estimate an integral over the interior of the unit triangle in 2D.
- triangle01_monte_carlo_test
- triangulation, a FORTRAN90 code which computes the triangulation of points in the plane, and performs various operations using a triangulation, including searching a Delaunay triangulation to find which triangle contains a given point.
- triangulation_test
- triangulation_l2q, a FORTRAN90 code which reads information about a 3-node (linear) triangulation and creates data defining a corresponding 6-node (quadratic) triangulation;
- triangulation_l2q_test
- triangulation_plot, a FORTRAN90 code which plots the nodes and elements of a triangulation as a PostScript (PS) file;
- triangulation_plot_test
- triangulation_q2l, a FORTRAN90 code which reads information about a 6-node triangulation and creates data defining a corresponding 3-node triangulation;
- triangulation_q2l_test
- triangulation_quad, a FORTRAN90 code which reads information about a triangulation and the value of a function at the nodes and estimates the integral of the function over the triangulated region.
- triangulation_quad_test
- triangulation_quality, a FORTRAN90 code which reads information about a triangulation and computes various quality measures;
- triangulation_quality_test
- triangulation_svg, a FORTRAN90 code which creates an SVG image of a triangulation, which can be displayed by a web browser.
- triangulation_svg_test
- truncated_normal, a FORTRAN90 code which works with the truncated normal distribution over [A,B], or [A,+oo) or (-oo,B], returning the probability density function (PDF), the cumulative density function (CDF), the inverse CDF, the mean, the variance, and sample values.
- truncated_normal_test
- truncated_normal_rule, a FORTRAN90 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].
- truncated_normal_rule_test
- tsp_brute, a FORTRAN90 code which reads a file of city-to-city distances and solves a (small!) traveling salesperson problem (TSP), using brute force.
- tsp_brute_test
- tsp_lau, a FORTRAN90 code which implements a heuristic algorithm for the solution of the traveling salesperson problem (TSP).
- tsp_lau_test
- ubvec, a FORTRAN90 code which demonstrates how nonnegative integers can be stored as unsigned binary vectors, and arithmetic can be performed on them.
- ubvec_test
- unicycle, a FORTRAN90 code which considers permutations containing a single cycle, sometimes called cyclic permutations.
- unicycle_test
- uniform, a FORTRAN90 code which implements random number generators (RNG) for a variety of arithmetic types.
- uniform_test
- upc, a FORTRAN90 code which computes the check digit for a uniform product code (UPC), or report whether a 12-digit UPC is actually valid.
- upc_test
- valgrind_test, FORTRAN codes which demonstrate the use of the valgrind() debugger.
- van_der_corput, a FORTRAN90 code which computes elements of the van der Corput one-dimensional Quasi Mont Carlo (QMC) sequence, using a simple interface.
- van_der_corput_test
- vandermonde, a FORTRAN90 code which implements the Bjork-Pereyra algorithm for accurate solution of linear systems involving the Vandermonde matrix.
- vandermonde_test
- vandermonde_approx_1d, a FORTRAN90 code which finds a polynomial approximant to data y(x) of a 1D argument by setting up and solving an overdetermined linear system for the polynomial coefficients involving the Vandermonde matrix.
- vandermonde_approx_1d_test
- vandermonde_approx_2d, a FORTRAN90 code which finds a polynomial approximant p(x,y) to data z(x,y) of a 2D argument by setting up and solving an overdetermined linear system for the polynomial coefficients involving the Vandermonde matrix.
- vandermonde_approx_2d_test
- vandermonde_interp_1d, a FORTRAN90 code which finds a polynomial interpolant to data y(x) of a 1D argument by setting up and solving a linear system for the polynomial coefficients involving the Vandermonde matrix, creating graphics files for processing by gnuplot().
- vandermonde_interp_1d_test
- vandermonde_interp_2d, a FORTRAN90 code which finds a polynomial interpolant to data z(x,y) of a 2D argument by setting up and solving a linear system for the polynomial coefficients involving the Vandermonde matrix.
- vandermonde_interp_2d_test
- voronoi_plot, a FORTRAN90 code which plots the Voronoi neighborhoods of points in the 2D unit square, using L1, L2 or Loo norms;
- voronoi_plot_test
- walker_sample, a FORTRAN90 code which efficiently samples a discrete probability vector using Walker sampling.
- walker_sample_test
- walsh, a FORTRAN90 code which implements versions of the Walsh and Haar transforms.
- walsh_test
- wathen, a FORTRAN90 code which compares storage schemes (full, banded, sparse triplet ) and solution strategies (Linpack full, Linpack banded, conjugate gradient) for linear systems involving the Wathen matrix, which can arise when solving a problem using the finite element method (FEM).
- wathen_test
- wave_mpi, a FORTRAN90 code which uses finite differences and MPI to estimate a solution to the wave equation.
- wave_mpi_test
- wavelet, a FORTRAN90 code which does some simple wavelet calculations;
- wavelet_test
- wedge_exactness, a FORTRAN90 code which investigates the polynomial exactness of a quadrature rule over the interior of the unit wedge in 3D.
- wedge_exactness_test
- wedge_felippa_rule, a FORTRAN90 code which returns quadrature rules for approximating integrals over the interior of the unit wedge in 3D.
- wedge_felippa_rule_test
- wedge_grid, a FORTRAN90 code which computes a grid of points over the interior of the unit wedge in 3D.
- wedge_grid_test
- wedge_integrals, a FORTRAN90 code which returns the exact value of the integral of any monomial over the interior of the unit wedge in 3D.
- wedge_integrals_test
- wedge_monte_carlo, a FORTRAN90 code which uses the Monte Carlo method to estimate an integral over the interior of the unit wedge in 3D.
- wedge_monte_carlo_test
- weekday, a FORTRAN90 code which determines the day of the week corresponding to a given date, such as 14 October 1066, Julian calendar, ... which was a Saturday.
- weekday_test
- wishart, a FORTRAN90 code which produces sample matrices from the Wishart or Bartlett distributions, useful for sampling random covariance matrices.
- wishart_test
- wtime, a FORTRAN90 code which returns a reading of the wall clock time in seconds.
- wtime_test
- zero, a FORTRAN90 code which seeks a solution of a scalar nonlinear equation f(x)=0, by Richard Brent.
- zero_test
- zero_rc, a FORTRAN90 code which seeks a solution of a scalar nonlinear equation f(x)=0, using reverse communication (RC), by Richard Brent.
- zero_rc_test
- ziggurat, a FORTRAN90 code which samples the uniform, normal or exponential distributions, using the ziggurat method, by Marsaglia and Tsang.
- ziggurat_test
- ziggurat_openmp, a FORTRAN90 code which demonstrates how ziggurat() can be used as a random number generator (RNG) in an OpenMP parallel program.
- ziggurat_openmp_test
- zoomin, a FORTRAN90 code which seeks a root of a scalar function.
- zoomin_test