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 IterationÑAn 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 Well-Rounded Figures, Yves Nievergelt, 32:1, 2001, 30-32, 7.3 Speeding Up a Numerical Algorithm, Shay Gueron, 32:1, 2001, 33-38 SimpsonÕs Rule with Constant Weights, R. S. Pinkham, 32:2, 2001, 91-93, 5.2.2 Estimating Large Integrals: The Bigger They Are, The Harder They Fall, Ira Rosenholtz, 32:5, 2001, 322-329, 5.2.2 CORDIC: Elementary Function Computation Using Recursive Sequences, Neil Eklund, 32:5, 2001, 330-333, 8.1 How (Not) to Solve Quadratic Equations, Yves Nievergelt, 34:2, 2003, 90-104, 0.2 Calculus, Pi, and the Machine Age, Susan Jane Colley, 34:4, 2003, 264-269, 5.2.4, 5.4.2 An Improved Remainder Estimate for Use With the Integral Test, Roger B. Nelsen, 34:5, 2003, 397-399, C, 5.4.2 Extending TheonÕs Ladder to Any Square Root, Shaun Giberson and Thomas J. Osler, 35:3, 2004, 222-226, C Error Estimates for Numerical Integration Rules, Peter R. Mercer, 36:1, 2005, 27-43, 5.2.2 Phoebe Floats!, Ezra Brown, 36:2, 2005, 114-122, 2.2, 6.3 Possibly pathological polynomials, James Colin Hill, Eric J. Malm, John Nord, and Gail Nord, 36:3, 2005, 222-223, F, 5.2.6 (see also Seymour Haber, J. Colin Hill, Daniel Lichtbau, and Daniel E. Loeb, 37:3, 2006, 216-217, F) Integrals of Fitted Polynomials and an Application to SimpsonÕs Rule, Allen D. Rogers, 38:2, 2007, 124-130, 5.2.2 FibonacciÕs Forgotten Number, Ezra Brown and Jason C. Brunson, 39:2, 2008, 112-120, 0.7, 2.1 Squaring a Circular Segment, Russell A. Gordon, 39:3, 2008, 212-220, 0.4, 5.4.2