Numerical Mathematics and Computing, 7th Ed. - List of Fortran77 Codes

Numerical Mathematics and Computing
Seventh Edition
Ward Cheney & David Kincaid
Sample Fortran77 Codes


In the following table, each line/entry contains the program file name and a brief description.
Click on the program name to display the source code, which can be downloaded. '
Chapter 1: Mathematical Preliminaries and Floating-Point Representation
first.f First programming experiment
pi.f Simple code to illustrate double precision
xsinx.f Example of programming f(x) = x - sinx carefully
Chapter 2: Linear Systems
ngauss.f Naive Gaussian elimination to solve linear systems
gauss.f Gaussian elimination with scaled partial pivoting
tri_penta.f Solves tridiagonal systems
Chapter 3: Locating Roots of Equations
bisect1.f Bisection method (versin 1)
bisect2.f Bisection method (version 2)
newton.f Sample Newton method
` secant.f Secant method
Chapter 4: Interpolation and Numerical Differentiation
coef.f Newton interpolation polynomial at equidistant pts
deriv.f Derivative by center differences/Richardson extrapolation
Chapter 5: Numerical Integration
sums.f Upper/lower sums experiment for an integral
trapezoid.f Trapezoid rule experiment for an integral
romberg.f Romberg arrays for three separate functions
rec_simpson.f Adaptive scheme for Simpson's rule
Chapter 6: Spline Functions
spline1.f Interpolates table using a first-degree spline function
spline3.f Natural cubic spline function at equidistant points
bspline2.f Interpolates table using a quadratic B-spline function
schoenberg.f Interpolates table using Schoenberg's process
Chapter 7: Initial Values Problems
euler.f Euler's method for solving an ODE
taylor.f Taylor series method (order 4) for solving an ODE
rk4.f Runge-Kutta method (order 4) for solving an IVP
rk45.f Runge-Kutta-Fehlberg method for solving an IVP
rk45ad.f Adaptive Runge-Kutta-Fehlberg method
taylorsys.f Taylor series method (order 4) for systems of ODEs
rk4sys.f Runge-Kutta method (order 4) for systems of ODEs
amrk.f Adams-Moulton method for systems of ODEs
amrkad.f Adaptive Adams-Moulton method for systems of ODEs
Chapter 8: More on Systems of Linear Equations
Chapter 9: Least Squares Methods
Chapter 10: Monte Carlo Methods and Simulation
test_random.f Example to compute, store, and print random numbers
coarse_check.f Coarse check on the random-number generator
double_integral.f Volume of a complicated 3D region by Monte Carlo
volume_region.f Numerical value of integral over a 2D disk by Monte Carlo
cone.f Ice cream cone example
loaded_die.f Loaded die problem simulation
birthday.f Birthday problem simulation
needle.f Buffon's needle problem simulation
two_die.f Two dice problem simulation
shielding.f Neutron shielding problem simulation
Chapter 11: Boundary Value Problems
bvp1.f Boundary value problem solved by discretization technique
bvp2.f Boundary value problem solved by shooting method
Chapter 13: Partial Differential Equations
parabolic1.f Parabolic partial differential equation problem
parabolic2.f Parabolic PDE problem solved by Crank-Nicolson method
hyperbolic.f Hyperbolic PDE problem solved by discretization
seidel.f Elliptic PDE solved by discretization/ Gauss-Seidel method
Chapter 13: Minimization of Functions
Chapter 14: Linear Programming Problems

Addditional programs can be found at the textbook's anonymous ftp site:

ftp://ftp.ma.utexas.edu/pub/cheney-kincaid/


[Home] [Features] [TOC] [Purchase] [ Codes] [Web] [Manuals] [Errata] [Links]

  Last updated: 15 July 2012