9.6		Numerical analysis

The Delta Method Approximates the Roots of Polynomial Equations, Joseph J.
Ettl, 5:2, 1974, 19-20, 0.7
The Interpolating Polynomial, Roger G. Lindley, 5:2, 1974, 21-31, 0.7
Computer Computation of Integrals, Arne Broman, 5:4, 1974, 4-11
An Integral Approximation Exact for Fifth-Degree Polynomials, Burt M.
Rosenbaum, 7:3, 1976, 10-14, 5.2.2
Finding Super Accurate Integers, Pasquale Scopelliti and Herbert Peebles, 7:3,
1976, 52-54, 0.2
Remarks Concerning the Delta Method for Approximating Roots, Stewart M. Venit,
7:4, 1976, 1-3
Interpolation and Square Roots, James E. McKenna, 7:4, 1976, 49-50, C
Salvaging a Broken Line, Glenn D. Allinger, 8:1, 1977, 47-50
A New Look at Some Old Problems in Light of the Hand Calculator, J.E.Schultz
and B.K.Waits, 10:1, 1979, 20-27, 0.8
Calculator-Demonstrated Math Instruction, George McCarty, 11:1, 1980, 42-48,
5.1.1, 5.2.2, 5.4.2
Bezier Polynomials in Computer-Aided Geometric Design, Cliff Long and Vic
Norton, 11:5, 1980, 320-325
Fixed Point IterationAn Interesting Way to Begin a Calculus Course, Thomas
Butts, 12:1, 1981, 2-7, 1.2, 5.1.1
The Electronic Spreadsheet and Mathematical Algorithms, Deane E. Arganbright,
15:2, 1984, 148-157, 4.1, 5.4.1, 7.3
An Almost Correct Series, R.A.Mureika and R.D.Small, 15:4, 1984, 334-338, C,
5.4.2
The Bisection Algorithm is Not Linearly Convergent, Sui-Sun Cheng and Tzon-Tzer
Lu, 16:1, 1985, 56-57, C, 0.7
Nested Polynomials and Efficient Exponential Algorithms for Calculators, Dan
Kalman and Warren Page, 16:1, 1985, 57-60, C, 0.2
Rediscovering Taylor's Theorem, Dan Kalman, 16:2, 1985, 103-107
Ill-Conditioning: A Constant Surprise in Computational Mathematics, Bruce H.
Edwards and Patricia L. Sharpe, 16:2, 1985, 141-148
Computing Large Factorials, Gerard Kiernan, 16:5, 1985, 403-412, 9.3
How Far Can You Stick Out Your Neck?, Sydney C. K. Chu and Man-Keung Siu, 17:2,
1986, 122-132, 5.4.2
An Interview with George B. Dantzig: The Father of Linear Programming, Donald
J. Albers and Constance Reid, 17:4, 1986, 292-304, 2.3
Controlling Roundoff Errors in Sums, Harley Flanders, 18:2, 1987, 153-156, 8.1
A Clamped Simpson's Rule, James A. Uetrecht, 19:1, 1988, 43-52, 5.2.2
An Efficient Logarithm Algorithm for Calculators, James C. Kirby, 19:3, 1988,
257-260, C, 5.3.2
What's Significant about a Digit?, David A. Smith, 20:2, 1989, 136-139, C, 0.1
A Rich Differential Equation for Computer Demonstrations, Bernard W. Banks,
21:1, 1990, 45-50, 6.4, 6.5
Connecting the Dots Parametrically: An Alternative to Cubic Splines, Wilbur J.
Hildebrand, 21:3, 1990, 208-215, 4.6, 5.6.1
Some Examples Illustrating Richardson's Improvement, Stephen Schonefeld, 21:4,
1990, 314-322
Using Fourier Analysis in Digital Signal Processing, Lyndell M. Kerley and
William P. Dotson, 23:4, 1992, 320-328
Interpolating Polynomials and Their Coordinates Relative to a Basis, David R.
Hill, 23:4, 1992, 329-333, C
Iterative Methods in Introductory Linear Algebra, Donald R. LaTorre, 24:1,
1993, 79-88, 4.1, 4.5
Complex Vectors and Image Identification, Lyndell Kerley and Jeff Knisley,
24:2, 1993, 166-174, 8.3
Fitting a Logistic Curve to Data, Fabio Cavallini, 24:3, 1993, 247-253, 9.10
Angle Trisection by Fixed Point Iteration, L. F. Martins and I. W. Rodrigues, 26:3, 1995, 205-208, 0.3
Numerical Methods for Improper Integrals, Gerald Flynn, 26:4, 1995, 284-291, 5.2.10
Cubic Splines from Simpson's Rule, Nishan Krikorian and Mark Ramras, 27:2, 1996, 124-126, C, 5.2.2
Gaussian Elimination and Dynamical Systems, Kathie Yerion, 28:2, 1997, 89-97, 4.6
Pictures Suggest How to Improve Elementary Numerical Integration, Keith Kendig, 30:1, 1999, 45-50, C
From Square Roots to n-th Roots: Newton's Method in Disguise, W. M. Priestley, 30:5, 1999, 387-388, C, 5.1.2
Second Order Iterations, Joseph J. Roseman and Gideon Zwas, 30:5, 1999, 393-396, C