Numerical Mathematics and Computing, 6th Ed. - List of C Codes

Numerical Mathematics and Computing
Sixth Edition
Ward Cheney & David Kincaid
Sample C 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: Introduction
first.c First programming experiment
double_first.c First programming experiment (doulbe precision version)
pi.c Simple code to illustrate double precision
Chapter 2: Number Representation and Errors
xsinx.c Example of programming f(x) = x - sinx carefully
Chapter 3: Locating Roots of Equations
bisection.c Bisection method
rec_bisection.c Recursive version of bisection method
newton.c Sample Newton method
secant.c Secant method
Chapter 4: Interpolation and Numerical Differentiation
coef.c Newton interpolation polynomial at equidistant pts
deriv.c Derivative by center differences/Richardson extrapolation
Chapter 5: Numerical Integration
sums.c Upper/lower sums experiment for an integral
trapezoid.c Trapezoid rule experiment for an integral
romberg.c Romberg arrays for three separate functions
Chapter 6: More on Numerical Integration
rec_simpson.c Adaptive scheme for Simpson's rule
Chapter 7: Systems of Linear Equations
ngauss.c Naive Gaussian elimination to solve linear systems
gauss.c Gaussian elimination with scaled partial pivoting
tri.c Solves tridiagonal systems
penta.c Solves pentadiagonal linear systems
Chapter 8: More on Systems of Linear Equations
Chapter 9: Approximation by Spline Functions
spline1.c Interpolates table using a first-degree spline function
spline3.c Natural cubic spline function at equidistant points
spline2.c Interpolates table using a quadratic B-spline function
schoenberg.c Interpolates table using Schoenberg's process
Chapter 10: Ordinary Differential Equations
euler.c Euler's method for solving an ODE
taylor.c Taylor series method (order 4) for solving an ODE
rk4.c Runge-Kutta method (order 4) for solving an IVP
rk45.c Runge-Kutta-Fehlberg method for solving an IVP
mainrk45.c Runge-Kutta-Fehlberg method for solving an IVP (main program)
rk45ad.c Adaptive Runge-Kutta-Fehlberg method
Chapter 11: Systems of Ordinary Differential Equations
taylorsys.c Taylor series method (order 4) for systems of ODEs
rk4sys.c Runge-Kutta method (order 4) for systems of ODEs
amrk.c Adams-Moulton method for systems of ODEs
amrkad.c Adaptive Adams-Moulton method for systems of ODEs
Chapter 12: Smoothing of Data and the Method of Least Squares
Chapter 13: Monte Carlo Methods and Simulation
test_random.c Example to compute, store, and print random numbers
coarse_check.c Coarse check on the random-number generator
double_integral.c Volume of a complicated 3D region by Monte Carlo
volume_region.c Numerical value of integral over a 2D disk by Monte Carlo
cone.c Ice cream cone example
loaded_die.c Loaded die problem simulation
birthday.c Birthday problem simulation
needle.c Buffon's needle problem simulation
two_die.c Two dice problem simulation
shielding.c Neutron shielding problem simulation
Chapter 14: Boundary Value Problems for Ordinary Differential Equations
bvp1.c Boundary value problem solved by discretization technique
bvp2.c Boundary value problem solved by shooting method
Chapter 15: Partial Differential Equations
parabolic1.c Parabolic partial differential equation problem
parabolic2.c Parabolic PDE problem solved by Crank-Nicolson method
hyperbolic.c Hyperbolic PDE problem solved by discretization
seidel.c Elliptic PDE solved by discretization/ Gauss-Seidel method
Chapter 16: Minimization of Functions
Chapter 17: Linear Programming

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

[Home] [Features] [TOC] [Purchase] [ Sample Code] [ Web] [ Manuals] [Errata] [Links]

  Last updated: 08/25/2007