Abramowitz, Milton, and Irene A. Stegun (editors) (1964), Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, National Bureau of Standards, Washington, D.C.

Afifi, A.A., and S.P. Azen (1979), Statistical Analysis: A Computer Oriented Approach, 2d ed., Academic Press, New York.

Ahrens, J.H., and U. Dieter (1974), Computer methods for sampling from gamma, beta, Poisson, and binomial distributions, Computing, 12, 223–246.

Akaike, H. (1978), A Bayesian analysis of the minimum AIC procedure, Ann. Institute Statist. Mathematics., 30A, 9–14.

Akaike, H. (1973), Information theory and an extension of maximum likelihood principle, Proc. 2nd International Symposium on Information Theory, Eds. B.N. Petrov and F. Csaki, 267–281.

Akima, H. (1978), A method of bivariate interpolation and smooth surface fitting for irregularly distributed data points, ACM Transactions on Mathematical Software, 4, 148–159.

Akima, H. (1970), A new method of interpolation and smooth curve fitting based on local procedures, Journal of the ACM, 17, 589–602.

Anderson, R.L., and T.A. Bancroft (1952), Statistical Theory in Research, McGraw-Hill Book Company, New York.

Anderson, T.W. (1971), The Statistical Analysis of Time Series, John Wiley & Sons, New York.

Ashcraft, C. (1987), A vector implementation of the multifrontal method for large sparse symmetric positive definite systems, Technical Report ETA-TR-51, Engineering Technology Applications Division, Boeing Computer Services, Seattle, Washington.

Ashcraft, C., R. Grimes, J. Lewis, B. Peyton, and H. Simon (1987), Progress in sparse matrix methods for large linear systems on vector supercomputers. Intern. J. Supercomputer Applic., 1(4), 10-29.

Atkinson, A.C. (1979), A family of switching algorithms for the computer generation of beta random variates, Biometrika, 66, 141–145.

Atkinson, A.C. (1985), Plots, Transformations, and Regression, Claredon Press, Oxford.

Atkinson, Ken (1978), An Introduction to Numerical Analysis, John Wiley & Sons, New York.

Barnett, A.R. (1981), An algorithm for regular and irregular Coulomb and Bessel functions of real order to machine accuracy, Computer Physics Communication, 21, 297–314.

Barrett, J.C., and M.J.R. Healy (1978), A remark on Algorithm AS 6: Triangular decomposition of a symmetric matrix, Applied Statistics, 27, 379–380.

Bays, Carter, and S.D. Durham (1976), Improving a poor random number generator, ACM Transactions on Mathematical Software, 2, 59–64.

Beckers, Stan (1980), The Constant Elasticity of Variance Model and Its Implications For Option Pricing , The Journal of Finance, Vol. 35, No. 3, pp. 661-673.

Bishop, Yvonne M.M., Stephen E. Fienberg, and Paul W. Holland (1975), Discrete Multivariate Analysis: Theory and Practice, MIT Press, Cambridge, Mass.

Blom, Gunnar (1958), Statistical Estimates and Transformed Beta-Variables, John Wiley & Sons, New York.

Blom, JG, and Zegeling, PA (1994), A Moving-grid Interface for Systems of One-dimensional Time-dependent Partial Differential Equations, ACM Transactions on Mathematical Software, Vol 20, No.2, 194-214.

Boisvert, Ronald (1984), A fourth order accurate fast direct method of the Helmholtz equation, Elliptic Problem solvers II, (edited by G. Birkhoff and A. Schoenstadt), Academic Press, Orlando, Florida, 35-44.

de Boor, Carl (1978), A Practical Guide to Splines, Springer-Verlag, New York.

Bosten, Nancy E., and E.L. Battiste (1974), Incomplete beta ratio, Communications of the ACM, 17, 156–157.

Box, George E.P., and Gwilyn M. Jenkins (1976), Time Series Analysis: Forecasting and Control, revised ed., Holden-Day, Oakland.

Box, G.E.P., and P.W. Tidwell (1962), Transformation of the independent variables, Technometrics, 4, 531–550.

Brenan, K.E., S.L. Campbell, L.R. Petzold (1989), Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations, Elseview Science Publ. Co.

Brent, Richard P. (1973), Algorithms for Minimization without Derivatives, Prentice-Hall, Inc., Englewood Cliffs, New Jersey.

Brent, R.P. (1971), An Algorithm With Guaranteed Convergence for Finding a Zero of a Function, The Computer Journal, 14, 422?425.

Brigham, E. Oran (1974), The Fast Fourier Transform, Prentice-Hall, Englewood Cliffs, New Jersey.

Brown, Morton B., and Jacqualine K. Benedetti (1977), Sampling behavior and tests for correlation in two-way contingency tables, Journal of the American Statistical Association, 42, 309–315.

Brown, Morton E. (1983), MCDP4F, two-way and multiway frequency tables—measures of association and the log-linear model (complete and incomplete tables), in BMDP Statistical Software, 1983 Printing with Additions, (edited by W.J. Dixon), University of California Press, Berkeley.

Burgoyne, F.D. (1963), Approximations to Kelvin functions, Mathematics of Computation, 83, 295-298.

Carlson, B.C. (1979), Computing elliptic integrals by duplication, Numerische Mathematik, 33, 1-16.

Carlson, B.C., and E.M. Notis (1981), Algorithms for incomplete elliptic integrals, ACM Transactions on Mathematical Software, 7, 398-403.

Carlson, R.E., and T.A. Foley (1991),The parameter R2 in multiquadric interpolation, Computer Mathematical Applications, 21, 29–42.

Cheng, R.C.H. (1978), Generating beta variates with nonintegral shape parameters, Communications of the ACM, 21, 317–322.

Cohen, E. Richard, and Barry N. Taylor (1986), The 1986 Adjustment of the Fundamental Physical Constants, Codata Bulletin, Pergamon Press, New York.

Conover, W.J. (1980), Practical Nonparametric Statistics, 2d ed., John Wiley & Sons, New York.

Conover, W.J., and Ronald L. Iman (1983), Introduction to Modern Business Statistics, John Wiley & Sons, New York.

Cook, R. Dennis, and Sanford Weisberg (1982), Residuals and Influence in Regression, Chapman and Hall, New York.

Cooley, J.W., and J.W. Tukey (1965), An algorithm for the machine computation of complex Fourier series, Mathematics of Computation, 19, 297–301.

Cooper, B.E. (1968), Algorithm AS4, An auxiliary function for distribution integrals, Applied Statistics, 17, 190–192.

Courant, R., and D. Hilbert (1962), Methods of Mathematical Physics, Volume II, John Wiley & Sons, New York, NY.

Craven, Peter, and Grace Wahba (1979), Smoothing noisy data with spline functions, Numerische Mathematik, 31, 377–403.

Crowe, Keith, Yuan-An Fan, Jing Li, Dale Neaderhouser, and Phil Smith (1990), A direct sparse linear equation solver using linked list storage, IMSL Technical Report 9006, IMSL, Houston.

D’Agostino, Ralph B., and Michael A. Stevens (1986), Goodness-of-Fit Techniques, Marcel Dekker, New York.

Davis, Philip F., and Philip Rabinowitz (1984), Methods of Numerical Integration, Academic Press, Orlando, Florida.

Dallal, Gerald E. and Leland Wilkinson (1986), An analytic approximation to the distribution of Lilliefor’s test statistic for normality, The American Statistician, 40, 294–296.

Dennis, J.E., Jr., and Robert B. Schnabel (1983), Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, New Jersey.

Devore, Jay L (1982), Probability and Statistics for Engineering and Sciences, Brooks/Cole Publishing Company, Monterey, Calif.

Dongarra, J.J., J.R. Bunch, C.B. Moler, and G.W. Stewart (1979), LINPACK User’s Guide, SIAM, Philadelphia.

Doornik, J. A., An Improved Ziggurat Method to Generate Normal Random Samples, http://www.doornik.com/research/ziggurat.pdf.

Draper, N.R., and H. Smith (1981), Applied Regression Analysis, 2d ed., John Wiley & Sons, New York.

Du Croz, Jeremy, P. Mayes, and G. Radicati (1990), Factorization of band matrices using Level-3 BLAS, Proceedings of CONPAR 90-VAPP IV, Lecture Notes in Computer Science, Springer, Berlin, 222.

Duff, I. S., and J. K. Reid (1983), The multifrontal solution of indefinite sparse symmetric linear equations. ACM Transactions on Mathematical Software, 9, 302-325.

Duff, I. S., and J. K. Reid (1984), The multifrontal solution of unsymmetric sets of linear equations. SIAM Journal on Scientific and Statistical Computing, 5, 633-641.

Duff, I. S., A. M. Erisman, and J. K. Reid (1986), Direct Methods for Sparse Matrices, Clarendon Press, Oxford.

Duff, Ian S., R. G. Grimes, anad J. G. Lewis (1992) first ed, Users’ Guide for the Harwell-Boeing Sparse Matrix Collection, CERFACS, Toulouse Cedex, France.

Efroymson, M.A. (1960), Multiple regression analysis, Mathematical Methods for Digital Computers, Volume 1, (edited by A. Ralston and H. Wilf), John Wiley & Sons, New York, 191–203.

Emmett, W.G. (1949), Factor analysis by Lawless method of maximum likelihood, British Journal of Psychology, Statistical Section, 2, 90–97.

Enright, W.H., and J.D. Pryce (1987), Two FORTRAN packages for assessing initial value methods, ACM Transactions on Mathematical Software, 13, 1–22.

Farebrother, R.W., and G. Berry (1974), A remark on Algorithm AS 6: Triangular decomposition of a symmetric matrix, Applied Statistics, 23, 477.

Fisher, R.A. (1936), The use of multiple measurements in taxonomic problems, The Annals of Eugenics, 7, 179–188.

Fishman, George S., and Louis R. Moore (1982), A statistical evaluation of multiplicative congruential random number generators with modulus 231 – 1, Journal of the American Statistical Association, 77, 129–136.

Forsythe, G.E. (1957), Generation and use of orthogonal polynomials for fitting data with a digital computer, SIAM Journal on Applied Mathematics, 5, 74–88.

Franke, R. (1982), Scattered data interpolation: Tests of some methods, Mathematics of Computation, 38, 181–200.

Furnival, G.M. and R.W. Wilson, Jr. (1974), Regressions by leaps and bounds, Technometrics, 16, 499–511.

Garbow, B.S., J.M. Boyle, K.J. Dongarra, and C.B. Moler (1977), Matrix Eigensystem Routines - EISPACK Guide Extension, Springer-Verlag, New York.

Garbow, B.S., G. Giunta, J.N. Lyness, and A. Murli (1988), Software for an implementation of Weeks' method for the inverse Laplace transform problem, ACM Transactions on Mathematical Software, 14, 163-170.

Gautschi, Walter (1968), Construction of Gauss-Christoffel quadrature formulas, Mathematics of Computation, 22, 251–270.

Gear, C.W. (1971), Numerical Initial Value Problems in Ordinary Differential Equations, Prentice-Hall, Englewood Cliffs, New Jersey.

Gentleman, W. Morven (1974), Basic procedures for large, sparse or weighted linear least squares problems, Applied Statistics, 23, 448–454.

George, A., and J. W. H. Liu (1981), Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, New Jersey.

Gill, Philip E., and Walter Murray (1976), Minimization subject to bounds on the variables, NPL Report NAC 92, National Physical Laboratory, England.

Gill, P.E., W. Murray, M.A. Saunders, and M.H. Wright (1985), Model building and practical aspects of nonlinear programming, Computational Mathematical Programming, (edited by K. Schittkowski), NATO ASI Series, 15, Springer-Verlag, Berlin, Germany.

Girschick, M.A. (1939), On the sampling theory of roots of determinantal equations, Annals of Mathematical Statistics, 10, 203–224.

Goldfarb, D., and A. Idnani (1983), A numerically stable dual method for solving strictly convex quadratic programs, Mathematical Programming, 27, 1–33.

Golub, G.H. (1973), Some modified matrix eigenvalue problems, SIAM Review, 15, 318–334.

Golub, Gene H., and Charles F. Van Loan (1983), Matrix Computations, Johns Hopkins University Press, Baltimore, Md.

Golub, G.H., and C.F. Van Loan (1989), Matrix Computations, 2d ed., The Johns Hopkins University Press, Baltimore, Maryland.

Golub, G.H., and J.H. Welsch (1969), Calculation of Gaussian quadrature rules, Mathematics of Computation, 23, 221–230.

Goodnight, James H. (1979), A tutorial on the SWEEP operator, The American Statistician, 33, 149–158.

Gregory, Robert, and David Karney (1969), A Collection of Matrices for Testing Computational Algorithms, Wiley-Interscience, John Wiley & Sons, New York.

Griffin, R., and K.A. Redish (1970), Remark on Algorithm 347: An efficient algorithm for sorting with minimal storage, Communications of the ACM, 13, 54.

Grosse, Eric (1980), Tensor spline approximation, Linear Algebra and its Applications, 34, 29–41.

Guerra, V., and R. A. Tapia (1974), A local procedure for error detection and data smoothing, MRC Technical Summary Report 1452, Mathematics Research Center, University of Wisconsin, Madison.

Hageman, Louis A., and David M. Young (1981), Applied Iterative Methods, Academic Press, New York.

Hanson, Richard J. (1986), Least squares with bounds and linear constraints, SIAM Journal Sci. Stat. Computing, 7, #3.

Hanson, R. J. (2008), Integrating Feynman-Kac Equations Using Hermite Quintic Finite Elements, White Paper.

Hanson, R. J., and Krogh, F. T., (2008), Solving Constrained Differential-Algebraic Systems Using Projections, White Paper.

Haldane, J.B.S. (1939), The mean and variance of χ2 when used as a test of homogeneity, when expectations are small, Biometrika, 31, 346.

Hardy, R.L. (1971), Multiquadric equations of topography and other irregular surfaces, Journal of Geophysical Research, 76, 1905–1915.

Harman, Harry H. (1976), Modern Factor Analysis, 3d ed. revised, University of Chicago Press, Chicago.

Hart, John F., E.W. Cheney, Charles L. Lawson, Hans J. Maehly, Charles K. Mesztenyi, John R. Rice, Henry G. Thacher, Jr., and Christoph Witzgall (1968), Computer Approximations, John Wiley & Sons, New York.

Hartigan, John A. (1975), Clustering Algorithms, John Wiley & Sons, New York.

Hartigan, J.A., and M.A. Wong (1979), Algorithm AS 136: A K-means clustering algorithm, Applied Statistics, 28, 100–108.

Hayter, Anthony J. (1984), A proof of the conjecture that the Tukey-Kramer multiple comparisons procedure is conservative, Annals of Statistics, 12, 61–75.

Healy, M.J.R. (1968), Algorithm AS 6: Triangular decomposition of a symmetric matrix, Applied Statistics, 17, 195–197.

Hemmerle, William J. (1967), Statistical Computations on a Digital Computer, Blaisdell Publishing Company, Waltham, Mass.

Herraman, C. (1968), Sums of squares and products matrix, Applied Statistics, 17, 289-292.

Higham, Nicholas J. (1988), FORTRAN Codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation, ACM Transactions on Mathematical Software, 14, 381-396.

Hildebrand, F.B. (1956), Introduction to Numerical Analysis, McGraw Hill.

Hill, G.W. (1970), Student’s t-distribution, Communications of the ACM, 13, 617–619.

Hindmarsh, A.C. (1974), GEAR: Ordinary Differential Equation System Solver, Lawrence Livermore National Laboratory Report UCID-30001, Revision 3, Lawrence Livermore National Laboratory, Livermore, California.

Hinkley, David (1977), On quick choice of power transformation, Applied Statistics, 26, 67–69.

Hoaglin, David C., and Roy E. Welsch (1978), The hat matrix in regression and ANOVA, The American Statistician, 32, 17–22.

Hocking, R.R. (1972), Criteria for selection of a subset regression: Which one should be used?, Technometrics, 14, 967–970.

Huber, Peter J. (1981), Robust Statistics, John Wiley & Sons, New York.

Hull, T.E., W.H. Enright, and K.R. Jackson (1976), User’s Guide for DVERK–A Subroutine for Solving Nonstiff ODEs, Department of Computer Science Technical Report 100, University of Toronto.

Irvine, Larry D., Samuel P. Marin, and Philip W. Smith (1986), Constrained interpolation and smoothing, Constructive Approximation, 2, 129–151.

Jackson, K.R., W.H. Enright, and T.E. Hull (1978), A theoretical criterion for comparing Runge-Kutta formulas, SIAM Journal of Numerical Analysis, 15, 618 – 641.

Jenkins, M.A. (1975), Algorithm 493: Zeros of a real polynomial, ACM Transactions on Mathematical Software, 1, 178–189.

Jenkins, M.A., and J.F. Traub (1970), A three-stage algorithm for real polynomials using quadratic iteration, SIAM Journal on Numerical Analysis, 7, 545–566.

Jenkins, M.A., and J.F. Traub (1970), A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration, Numerishe Mathematik, 14, 252-263.

Jenkins, M.A., and J.F. Traub (1972), Zeros of a complex polynomial, Communications of the ACM, 15, 97- 99.

John, Peter W.M. (1971), Statistical Design and Analysis of Experiments, Macmillan Company, New York.

Jöhnk, M.D. (1964), Erzeugung von Betaverteilten und Gammaverteilten Zufalls-zahlen, Metrika, 8, 5–15.

Jöreskog, K.G. (1977), Factor analysis by least squares and maximum-likelihood methods, Statistical Methods for Digital Computers, (edited by Kurt Enslein, Anthony Ralston, and Herbert S. Wilf), John Wiley & Sons, New York, 125–153.

Kaiser, H.F. (1963), Image analysis, Problems in Measuring Change, (edited by C. Harris), University of Wisconsin Press, Madison, Wis.

Kaiser, H.F., and J. Caffrey (1965), Alpha factor analysis, Psychometrika, 30, 1–14.

Kendall, Maurice G., and Alan Stuart (1973), The Advanced Theory of Statistics, Volume 2: Inference and Relationship, 3rd ed., Charles Griffin & Company, London.

Kendall, Maurice G., and Alan Stuart (1979), The Advanced Theory of Statistics, Volume 2: Inference and Relationship, 4th ed., Oxford University Press, New York.

Kendall, Maurice G., Alan Stuart, and J. Keith Ord (1983), The Advanced Theory of Statistics, Volume 3: Design and Analysis, and Time Series, 4th. ed., Oxford University Press, New York.

Kennedy, William J., Jr. and James E. Gentle (1980), Statistical Computing, Marcel Dekker, New York.

Kernighan, Brian W., and Richtie, Dennis M. 1988, "The C Programming Language" Second Edition, 241.

Kinnucan, P., and H. Kuki (1968), A Single Precision Inverse Error Function Subroutine, Computation Center, University of Chicago.

Kirk, Roger E. (1982), Experimental Design: Procedures for the Behavioral Sciences, 2d ed., Brooks/Cole Publishing Company, Monterey, Calif.

Knuth, Donald E. (1981), The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 2d ed., Addison-Wesley, Reading, Mass.

Kochanek, Doris H. U., and Bartels, Richard H (1984), Interpolating Splines with Local Tension, Continuity, and Bias Control, ACM SIGGRAPH , vol. 18, no. 3, pp. 33-41.

Krogh, Fred, T. (2005), An Algorithm for Linear Programming,
http://mathalacarte.com/fkrogh/pub/lp.pdf, Tujunga, CA.

Lawley, D.N., and A.E. Maxwell (1971), Factor Analysis as a Statistical Method, 2d ed., Butterworth, London.

Learmonth, G.P., and P.A.W. Lewis (1973), Naval Postgraduate School Random Number Generator Package LLRANDOM, NPS55LW73061A, Naval Postgraduate School, Monterey, Calif.

Leavenworth, B. (1960), Algorithm 25: Real zeros of an arbitrary function, Communications of the ACM, 3, 602.

Lehmann, E.L. (1975), Nonparametrics: Statistical Methods Based on Ranks, Holden-Day, San Francisco.

Levenberg, K. (1944), A method for the solution of certain problems in least squares, Quarterly of Applied Mathematics, 2, 164–168.

Leavenworth, B. (1960), Algorithm 25: Real zeros of an arbitrary function, Communications of the ACM, 3, 602.

Pereyra, Victor (1978), PASVA3: An adaptive finite-difference FORTRAN program for first order nonlinear boundary value problems, in Lecture Notes in Computer Science, 76, Springer-Verlag, Berlin, 67–88.

Lewis, P.A.W., A.S. Goodman, and J.M. Miller (1969), A pseudorandom number generator for the System/360, IBM Systems Journal, 8, 136–146.

Liepman, David S. (1964), Mathematical constants, Handbook of Mathematical Functions, Dover Publications, New York.

Lilliefors, H.W. (1967), On the Kolmogorov-Smirnov test for normality with mean and variance unknown, Journal of the American Statistical Association, 62, 534–544.

Liu, J. W. H. (1986), On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Transactions on Mathematical Software, 12, 249-264.

Liu, J. W. H. (1987), A collection of routines for an implementation of the multifrontal method, Technical Report CS-87-10, Department of Computer Science, York University, North York, Ontario, Canada.

Liu, J. W. H. (1989), The multifrontal method and paging in sparse Cholesky factorization. ACM Transactions on Mathematical Software, 15, 310-325.

Liu, J. W. H. (1990), The multifrontal method for sparse matrix solution: theory and practice, Technical Report CS-90-04, Department of Computer Science, York University, North York, Ontario, Canada.

Longley, James W. (1967), An appraisal of least-squares programs for the electronic computer from the point of view of the user, Journal of the American Statistical Association, 62, 819–841.

Lyness, J.N. and G. Giunta (1986), A modification of the Weeks Method for numerical inversion of the Laplace transform, Mathematics of Computation, 47, 313-322.

Madsen, N.K., and R.F. Sincovec (1979), Algorithm 540: PDECOL, General collocation software for partial differential equations, ACM Transactions on Mathematical Software, 5, #3, 326-351.

Maindonald, J.H. (1984), Statistical Computation, John Wiley & Sons, New York.

Mardia, K.V., J.T. Kent, J.M. Bibby (1979), Multivariate Analysis, Academic Press, New York.

Marquardt, D. (1963), An algorithm for least-squares estimation of nonlinear parameters, SIAM Journal on Applied Mathematics, 11, 431–441.

Marsaglia, G. and Tsang, W. W (2000), The Ziggurat Method for Generating Random Variables, Journal of Statistical Software, Volume 5-8, pages 1-7.

Martin, R.S., and J.H. Wilkinson (1971), Reduction of the Symmetric Eigenproblem Ax = λBx and Related Problems to Standard Form, Volume II, Linear Algebra Handbook, Springer, New York.

Martin, R.S., and J.H. Wilkinson (1971), The Modified LR algorithm for complex Hessenberg matrices, Volume II: Linear Algebra Handbook, Springer, New York.

Mayle, Jan, (1993), Fixed Income Securities Formulas for Price, Yield, and Accrued Interest, SIA Standard Securities Calculation Methods, Volume I, Third Edition, pages 17-35.

Micchelli, C.A. (1986), Interpolation of scattered data: Distance matrices and conditionally positive definite functions, Constructive Approximation, 2, 11–22.

Micchelli, C.A., T.J. Rivlin, and S. Winograd (1976), The optimal recovery of smooth functions, Numerische Mathematik, 26, 279–285.

Micchelli, C.A., Philip W. Smith, John Swetits, and Joseph D. Ward (1985), Constrained Lp approximation, Constructive Approximation, 1, 93–102.

Müller, D.E. (1956), A method for solving algebraic equations using an automatic computer, Mathematical Tables and Aids to Computation, 10, 208–215.

Milliken, George A., and Dallas E. Johnson (1984), Analysis of Messy Data, Volume 1: Designed Experiments, Van Nostrand Reinhold, New York.

Miller, Rupert G., Jr. (1980), Simultaneous Statistical Inference, 2d ed., Springer-Verlag, New York.

Moler, C., and G.W. Stewart (1973), An algorithm for generalized matrix eigenvalue problems, SIAM Journal on Numerical Analysis, 10, 241-256.

Moré, Jorge, Burton Garbow, and Kenneth Hillstrom (1980), User Guide for MINPACK-1, Argonne National Laboratory Report ANL 80–74, Argonne, Illinois.

Müller, D.E. (1956), A method for solving algebraic equations using an automatic computer, Mathematical Tables and Aids to Computation, 10, 208-215.

Murtagh, Bruce A. (1981), Advanced Linear Programming: Computation and Practice, McGraw-Hill, New York.

Murty, Katta G. (1983), Linear Programming, John Wiley and Sons, New York.

Nelson, Peter (1989), Multiple Comparisons of Means Using Simultaneous Confidence Intervals, Journal of Quality Technology, 21, 232–241.

Neter, John, and William Wasserman (1974), Applied Linear Statistical Models, Richard D. Irwin, Homewood, Ill.

Neter, John, William Wasserman, and Michael H. Kutner (1983), Applied Linear Regression Models, Richard D. Irwin, Homewood, Illinois.

Østerby, Ole, and Zahari Zlatev (1982), Direct Methods for Sparse Matrices, Lecture Notes in Computer Science, 157, Springer-Verlag, New York.

Owen, D.B. (1962), Handbook of Statistical Tables, Addison-Wesley Publishing Company, Reading, Massachusetts.

Owen, D.B. (1965), A special case of the bivariate non-central t distribution, Biometrika, 52, 437–446.

Parlett, B.N. (1980) The Symmetric Eigenvalue Problem, Prentice-Hall, Inc., Englewood Cliffs, New Jersey.

Petro, R. (1970), Remark on Algorithm 347: An efficient algorithm for sorting with minimal storage, Communications of the ACM, 13, 624.

Petzold, L.R. (1982), A description of DASSL: A differential/ algebraic system solver, Proceedings of the IMACS World Congress, Montreal, Canada.

Piessens, R., E. deDoncker-Kapenga, C.W. Überhuber, and D.K. Kahaner (1983), QUADPACK, Springer-Verlag, New York.

Powell, M.J.D. (1978), A fast algorithm for nonlinearly constrained optimization calculations, in Numerical Analysis Proceedings, Dundee 1977, Lecture Notes in Mathematics, (edited by G. A. Watson), 630, Springer-Verlag, Berlin, Germany, 144–157.

Powell, M.J.D. (1985), On the quadratic programming algorithm of Goldfarb and Idnani, Mathematical Programming Study, 25, 46–61.

Powell, M.J.D. (1983), ZQPCVX a FORTRAN subroutine for convex quadratic programming, DAMTP Report 1983/NA17, University of Cambridge, Cambridge, England.

Powell, M.J.D. (1988), A tolerant algorithm for linearly constrained optimizations calculations, DAMTP Report NA17, University of Cambridge, England.

Powell, M.J.D. (1989), TOLMIN: A fortran package for linearly constrained optimizations calculations, DAMTP Report NA2, University of Cambridge, England.

Reinsch, Christian H. (1967), Smoothing by spline functions, Numerische Mathematik, 10, 177–183.

Rice, J.R. (1983), Numerical Methods, Software, and Analysis, Mcguire-Hill, New York.

Rietman, Edward (1989), Exploring the Geometry of Nature, Windcrest Books, Blue Ridge Summit, Pennsylvania.

Robinson, Enders A. (1967), Multichannel Time Series Analysis with Digital Computer Programs, Holden-Day, San Francisco.

Royston, J.P. (1982a), An extension of Shapiro and Wilk’s W test for normality to large samples, Applied Statistics, 31, 115–124.

Royston, J.P. (1982b), The W test for normality, Applied Statistics, 31, 176–180.

Royston, J.P. (1982c), Expected normal order statistics (exact and approximate), Applied Statistics, 31, 161–165.

Saad, Y., and M. H. Schultz (1986), GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems, SIAM Journal of Scientific and Statistical Computing, 7, 856-869.

Sallas, William M., and Abby M. Lionti (1988), Some useful computing formulas for the nonfull rank linear model with linear equality restrictions, IMSL Technical Report 8805, IMSL, Houston.

Savage, I. Richard (1956), Contributions to the theory of rank order statistics–the two-sample case, Annals of Mathematical Statistics, 27, 590–615.

Schittkowski, K. (1980), Nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, 183, Springer-Verlag, Berlin, Germany.

Schittkowski, K. (1983), On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function, Mathematik Operations for Schung and Statistik, Serie Optimization, 14, 197–216.

Schittkowski, K. (1986), NLPQL: A FORTRAN subroutine solving constrained nonlinear programming problems, (edited by Clyde L. Monma), Annals of Operations Research, 5, 485–500.

Schmeiser, Bruce (1983), Recent advances in generating observations from discrete random variates, Computer Science and Statistics: Proceedings of the Fifteenth Symposium on the Interface, (edited by James E. Gentle), North-Holland Publishing Company, Amsterdam, 154–160.

Schmeiser, Bruce W., and A.J.G. Babu (1980), Beta variate generation via exponential majorizing functions, Operations Research, 28, 917–926.

Schmeiser, Bruce, and Voratas Kachitvichyanukul (1981), Poisson Random Variate Generation, Research Memorandum 81-4, School of Industrial Engineering, Purdue University, West Lafayette, Ind.

Schmeiser, Bruce W., and Ram Lal (1980), Squeeze methods for generating gamma variates, Journal of the American Statistical Association, 75, 679–682.

Schwartz, G. (1978), Estimating the dimension of a model, Ann. Statist., 6, 461-464.

Searle, S.R. (1971), Linear Models, John Wiley & Sons, New York.

Seidler, Lee J. and Carmichael, D.R., (editors) (1980), Accountants' Handbook, Volume I, Sixth Edition, The Ronald Press Company, New York.

Shampine, L.F. (1975), Discrete least-squares polynomial fits, Communications of the ACM, 18, 179–180.

Shampine, L.F., and C.W. Gear (1979), A user’s view of solving stiff ordinary differential equations, SIAM Review, 21, 1–17.

Sincovec, R.F., and N.K. Madsen (1975), Software for nonlinear partial differential equations, ACM Transactions on Mathematical Software, 1, #3, 232-260.

Singleton, T.C. (1969), Algorithm 347: An efficient algorithm for sorting with minimal storage, Communications of the ACM, 12, 185–187.

Smith, B.T., J.M. Boyle, J.J. Dongarra, B.S. Garbow, Y. Ikebe, V.C. Klema, and C.B. Moler (1976), Matrix Eigensystem Routines—EISPACK Guide, Springer-Verlag, New York.

Smith, P.W. (1990), On knots and nodes for spline interpolation, Algorithms for Approximation II, J.C. Mason and M.G. Cox, Eds., Chapman and Hall, New York.

Snedecor, George W., and William G. Cochran (1967), Statistical Methods, 6th ed., Iowa State University Press, Ames, Iowa.

Spellucci, P. (1998), An SQP method for general nonlinear programs using only equality constrained subproblems, Math. Prog., 82, 413-448, Physica Verlag, Heidelberg, Germany

Spellucci, P. (1998), A new technique for inconsistent problems in the SQP method. Math. Meth. of Oper. Res., 47, 355-500, Physica Verlag, Heidelberg, Germany.

Spurrier, John D., and Steven P. Isham (1985), Exact simultaneous confidence intervals for pairwise comparisons of three normal means, Journal of the American Statistical Association, 80, 438–442.

Stewart, G.W. (1973), Introduction to Matrix Computations, Academic Press, New York.

Stoer, J. (1985), Principles of sequential quadratic programming methods for solving nonlinear programs, Computational Mathematical Programming, (edited by K. Schittkowski), NATO ASI Series, 15, Springer-Verlag, Berlin, Germany.

Stoline, Michael R. (1981), The status of multiple comparisons: simultaneous estimation of all pairwise comparisons in one-way ANOVA designs, The American Statistician, 35, 134–141.

Strecok, Anthony J. (1968), On the calculation of the inverse of the error function, Mathematics of Computation, 22, 144–158.

Stroud, A.H., and D.H. Secrest (1963), Gaussian Quadrature Formulae, Prentice-Hall, Englewood Cliffs, New Jersey.

Temme, N.M. (1975), On the numerical evaluation of the modified Bessel function of the third kind, Journal of Computational Physics, 19, 324–337.

Tezuka, S. (1995), Uniform Random Numbers: Theory and Practice. Academic Publishers, Boston.

Thompson, I.J., and A.R. Barnett (1987), Modified Bessel functions Iv(z) and Kv(z) of real order and complex argument, to selected accuracy, Computer Physics Communication, 47, 245–257.

Tukey, John W. (1962), The future of data analysis, Annals of Mathematical Statistics, 33, 1–67.

Velleman, Paul F., and David C. Hoaglin (1981), Applications, Basics, and Computing of Exploratory Data Analysis, Duxbury Press, Boston.

Verwer, J. G., Blom, J. G., Furzeland, R. M., and Zegeling, P. A. (1989), A moving-grid method for one-dimensional PDEs Based on the Method of Lines, Adaptive Methods for Partial Differential Equations, Eds., J. E. Flaherty, P. J. Paslow, M. S. Shephard, and J. D. Vasiilakis, SIAM Publications, Philadelphia, PA (USA) pp. 160-175.

Walker, H. F. (1988), Implementation of the GMRES method using Householder transformations, SIAM Journal of Scientific and Statistical Computing, 9, 152-163.

Watkins, David S., L. Elsner (1991), Convergence of algorithm of decomposition type for the eigenvalue problem, Linear Algebra Applications, 143, 19–47.

Weeks, W.T. (1966), Numerical inversion of Laplace transforms using Laguerre functions, J. ACM, 13, 419-429.

Weisberg, S. (1985), Applied Linear Regression, 2nd edition, John Wiley & Sons, New York.

Wilmott, P., Howison, and S., Dewynne, J., (1996), The Mathematics of Financial Derivatives (A Student Introduction), Cambridge Univ. Press, New York, NY. 317 pages.