Optimization Methods in Computational Chemistry

Reviews in Computational Chemistry

Volumn 3, Issue , 2007, Pages 1-71

  Schlick, Tamar ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

Computational chemistry; Gradient methods; Large scale optimization; Mathematical preliminaries; Newton methods

Indexed keywords

EID: 85050535270     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470125809.ch1     Document Type: Chapter

References (142)

1. F. S. Acton, Numerical Methods That Usually Work, Chap. 17, Mathematical Association of America, Washington, D.C., 1990 (updated from the 1970 edition).
2. P. E. Gill, W. Murray, and M. H. Wright, Numerical Linear Algebra on Optimization, Vol. 1, Addison-Wesley, Redwood City, Calif., 1991.
3. D. G. Luenberger, Linear and Nonlinear Programming, 2nd ed., Addison-Wesley, Reading, Mass., 1984.
4. R. Fletcher, Practical Methods of Optimization, 2nd ed., John Wiley & Sons, Tiptree, Essex, United Kingdom, 1987.
5. P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization, Academic Press, New York, 1983.
6. J. E. Dennis, Jr. and R. B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, N.J., 1983.
7. P. G. Ciarlet, Introduction to Numerical Linear Algebra and Optimization, Cambridge University Press, Cambridge, United Kingdom, 1989.
8. P. J. M. van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications, D. Reidel, Dordrecht, 1987.
9. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines, Wiley-Intetscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Tiptree, Essex, 1990.
10. G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd, Eds., Handbook in Operations Research Management Science, Vol. 1, Elsevier ScienceJNorth-Holland, Amsterdam, 1989.
11. C. A. Floudas and P. M. Pardalos, Eds., Recent Advances in Global Optimization, Princeton Series in Computer Science, Princeton University Press, Princeton, N.J., 1991.
12. P. T. Boggs, R. H. Byrd, and R. B. Schnabel, Eds., Numerical Optimization 1984, SIAM, Philadelphia, 1985.
13. G. Dahlquist and A Bjork, Numerical Methods, Prentice-Hall, Englewood Cliffs, N.J., 1974.
14. G. H. Golub and C. F. Van Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, Md., 1984.
15. Grand Challenges: High Performance Computing and Communications, Report by the Committee on Physical, Mathematical, and Engineering Sciences, Office of Science and Technology Policy, Washington, D.C., 1991.
16. Mathematical Foundations of High-Performance Computing and Communications, Board of Mathematical Sciences, National Research Council, National Academy Press, Washington, D.C., 1991.
17. R. B. Schnabel and T.-T. Chow, SIAM J. Opt., 1, 293 (1991). Tensor Methods for Uncon-strained Optimization Using Second Derivatives.
18. U. Burkert and N. L. Allinger, Molecular Mechanics, ACS Monograph 177, American Chemical Society, Washington, D.C., 1987.
19. S. J. Weiner, P. A. Kollman, D. T. Nguyen, and D. A. Case, J. Comput. Chem., 7,230 (1986). An All Atom Force Field for Simulations of Proteins and Nucleic Acids.
20. B. R. Brooks, R. E. Bruccoleri, B. D. Olafson, D. J. States, S. Swaminathan, and M. Karpius, J. Comput. Chem., 4, 187 (1983). CHARMM: A Program for Macromolecular Energy, Minimization, and Dynamics Calculations.
21. S. Lifson and A. Warshel, J. Chem. Phys., 49, 5116 (1968). Consistent Force Field for Calculations of Conformations, Vibrational Spectra, and Enthalpies of Cycloalkane and w-AIkane Molecules.
22. T. Schlick, dissertation, Courant Institute, Department of Mathematics, New York Univer-sity (1987). Modeling and Minimization Techniques for Predicting Three-Dimensional Structures of Large Biological Molecules.
23. T. Schlick, B. E. Hingerty, C. S. Peskin, M. L. Overton, and S. Broyde, in Theoretical Biochemistry and Molecular Biophysics, Vol. I, pp. 39-58, D. L. Beveridge and R. Lavery, Eds., Adenine Press, Guilderland, New York, 1991. Search Strategies, Minimization Algorithms, and Molecular Dynamics Simulations for Exploring Conformational Spaces of Nucleic Acids.
24. L. Greengard and V. Rokhlin, J. Comput. Phys., 73, 325 (1987). A Fast Algorithm for Particle Simulations.
25. J. Carrier, L. Greengard, and V. Rokhlin, SIAM J. Set. Statist. Comput., 9,669 (1987). A Fast Adaptive Multipole Algorithm for Particle Simulations.
26. A. R. Leach, in Reviews in Computational Chemistry, Vol. 2, K. B. Lipkowitz and D. B. Boyd, Eds., VCH Publishers, New York, 1991. A Survey of Methods for Searching the Conformational Space of Small and Medium-Sized Molecules.
27. M. Pincus, R. Klausner, and H. A. Scheraga, Proc. Natl. Acad. Sci. USA, 79, 5107 (1982). Calculation of the Three-Dimensional Structure of the Membrane Bound Portion of Milittin from Its Amino Acids.
28. H. A. Scheraga, Biopolymers, 22, 1 (1983). Recent Progress in Theoretical Treatment of Protein Folding.
29. B. E. Hingerty, S. Figueroa, T. L. Hayden, and S. Broyde, Biopolymers, 28, 1195 (1989). Prediction of DNA Structure from Sequence: A Buildup Technique.
30. J. A. McCammon and S. C. Harvey, Dynamics of Proteins and Nucleic Acids, Cambridge University Press, Cambridge, 1987.
31. T. Schlick, Comput. Chem., 15,251 (1991). New Approaches to Potential Energy Minimiza-tion and Molecular Dynamics Algorithms.
32. C. S. Peskin and T. Schlick, Comm. Pure Appl. Math., 42,1001 (1989). Molecular Dynamics by the Backward-Euler Method.
33. T. Schlick and C. S. Peskin, Comm. Pure Appl. Math, 42, 1141 (1989). Can Classical Equations Simulate Quantum-Mechanical Behavior? A Molecular Dynamics Investigation of a Diatomic Molecule with a Morse Potential.
34. T. Schlick, S. Figueroa, and M. Mezei, J. Chem. Phys., 94, 2118 (1991). A Molecular Dynamics Simulation of a Water Droplet by the Implicit-EulerJLangevin Scheme.
35. A. Nyberg and T. Schlick, J. Chem. Phys., 95, 4986 (1991). A Computational Investigation of Dynamic Properties with the Implicit-Euler Scheme for Molecular Dynamics Simulation.
36. T. Schlick and W. K. Olson, J. Mol. Biol., 223, 1089 (1992). Computer Simulations of Supercoiled DNA Energies and Dynamics.
37. M. E. Tuckerman, B. J. Berne, and A. Rossi, J. Chem. Phys., 94, 1465 (1991). Molecular Dynamics Algorithm for Multiple Time Scales: Systems with Disparate Masses.
38. R. K. Z. Tan and S. C. Harvey, in Theoretical Biochemistry and Molecular Biophysics, Vol. 1, pp. 125-137, D. L. Beveridge and R. Lavery, Eds., Adenine Press, Guilderland, New York, 1991. Succinct Macromolecular Models: Applications to Supercoiled DNA.
39. L. Piela, J. Kostrowicki, and H. A. Scheraga, J. Phys. Chem., 93,3339 (1989). The Multiple-Minima Problem in Conformational Analysis of Molecules. Deformation of the Potential Energy Hypersurface by the Diffusion Equation Method.
40. E. O. Purisima and H. A. Scheraga, Proc. Natl. Acad. Sci. USA, 83, 2782 (1986). An Approach to the Multiple-Minima Problem by Relaxing Dimensionality.
41. A. V. Levy and S. Gomez, in Numerical Optimization 1984, P. T. Boggs, R. H. Byrd, and R. B. Schnabel, Eds., pp. 213-244, SIAM, Philadelphia, 1985. The Tunneling Method Applied to Global Optimization.
42. A. H. G. Rinnooy Kan and G. T. Timmer, in Handbooks in Operations Research and Management Science, Vol. 1, G. L. Nemhauser, A.H.G. Rinnooy Kan, and M. J. Todd, Eds., Elsevier ScienceJNorth-Holland, Amsterdam, 1989. Global Optimization.
43. R. H. Byrd, E. Eskow, R. B. Schnabel, and S. L. Smith, Parallel Global Optimization: Numerical Methods, Dynamic Scheduling Methods, and Application to Molecular Configuration, Computer Science Report CU-CS-553-91, University of Colorado, Boulder, 1991.
44. R. B. Schnabel, in Mathematical Programming, M. Iri and K. Tanabe, Eds., pp. 227-261, Kluwer Academic, Dordrecht, 1989. Sequential and Parallel Methods for Unconstrained Optimization.
45. R. H. Byrd, C. L. Dert, A. H. G. Rinnooy Kan, and R. B. Schnabel, Math, Prog., 46,1(1990). Concurrent Stochastic Methods for Global Optimization.
46. S. Smith, E. Eskow, and R. B. Schnabel, Adaptive Asynchronous Stochastic Global Optimi zation Algorithms for Sequential and Parallel Computation, Computer Science Report CV-CS-449-89. University of Colorado, Boulder, 1989.
47. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, Science, 220, 671 (1983). Optimization by Simulated Annealing.
48. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, J. Chem. Phys., 21, 1087 (1953). Equation of State Calculations by Fast Computing Machines.
49. A. Dekkers and E. Aarts, Math Prog., 50, 367 (1991). Global Optimization and Simulated Annealing.
50. I. O. Bohachevsky, M. E. Johnson, and M. L. Stein, Technometrics, 28, 209 (1986). Gener-alized Simulated Annealing for Function Optimization.
51. M.-H. Hao and W. K. Olson, Macromolecules, 22, 3292 (1989). Searching the Global Equilibrium Configurations of Supercoiled DNA by Simulated Annealing.
52. J. More and D. C. Sorenson, in Studies in Numerical Analysis, G. H. Golub, Ed., pp. 29-82, Mathematical Association of America, Washington, D.C., 1984. Newton's Method.
53. J. More, in Mathematical Programming, The State of the Art, A. Bachem, M. Grotschel, and G. Korte, Eds., pp. 256-287, Springer-Verlag, New York, 1983. Recent Developments in Algorithms and Software for Trust Region Methods.
54. J. E. Dennis, Jr. and R. B. Schnabel, in Handbook in Operations Research and Mathematical Sciences, Vol. 1, G. L. Nemhauser, A.H.G. Rinnooy Kan, and M. J. Todd, et al., pp. 1-72, Eds., Elsevier ScienceJNorth-Holland, Amsterdam, 1989. A View of Unconstrained Optimization.
55. J. More and D. J. Thuente, Mathematics and Computer Science, Division Preprint MCS-P1S3-0S90, Argonne National Laboratory, Argonne, III., 1990. On Line Search Algorithms with Guaranteed Sufficient Decrease.
56. W. C. Davidon, Variable Metric Method for Minimization, Report ANL-5990 (rev.), Ar-gonne National Laboratory, Argonne, 111., 1959.
57. M. J. D. Powell, Comput. J., 7,155 (1964). An Efficient Method for Finding the Minimum of a Function of Several Variables without Calculating Derivatives.
58. P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, SIAM J. Sci. Statist. Comput., 4, 310 (1983). Computing Forward-Difference Intervals for Numerical Optimization.
59. L. B. Rail, Automatic Differentiation-Techniques and Applications, Lecture Notes in Com-puter Science 120, Springer-Verlag, BerlinJNew York, 1981.
60. A. Griewank, in Mathematical Programming 1988, pp. 83-107, Kluwer Academic, Tokyo, 1988. On Automatic Differentiation.
61. L. C. W. Dixon, SIAM J. Opt., 1,475 (1991). On the Impact of Automatic Differentiation on the Relative Performance of Parallel Truncated Newton and Variable Metric Algorithms.
62. B. E. Hingerty and S. Broyde, Biopolymers, 24, 2279 (1985). Carcinogen-Base Stacking and Base-Base Stacking in dCpdG Modified by (+) and (-) Anti BPDE.
63. A. Cauchy, Comp. Rend. Acad. Sci. Paris, 536 (1847). Methode Generaie pour las Resolu-tion des Systemes d'Equations Simultanees.
64. M. R. Hestenes and E. Stiefel, J Res. Natl. Bur. Stand., 49,409 (1952). Methods of Conju-gate Gradients for Solving Linear Systems.
65. M. R. Hestenes, Conjugate Direction Methods in Optimization, Springer-Verlag, New York, 1980.
66. R. Fletcher and C. M. Reeves, Comput. J., 7, 149 (1964). Function Minimization by Conju-gate Gradients.
67. M. J. D. Powell, in Lecture Notes in Mathematics, Vol. 1066, pp. 122-141, Springer, BerlinJNew York, 1984. Nonconvex Minimization Calculations and the Conjugate Gradient Method.
68. M. J. D. Powell, Math, Prog., 12, 241 (1977). Restart Procedures of the Conjugate Gradient Method.
69. M. J. D. Powell, Math. Programming, 11, 42 (1976). Some Convergence Properties of the Conjugate Gradient Method.
70. D. F. Shanno, Math Oper. Res., 3, 244 (1978). Conjugate Gradient Methods with Inexact Searches.
71. E. Polak and G. Ribiere, Rev. Fr. Inform. Rech. Oper., 16, 35 (1969). Note sur la Con-vergence de Methodes de Directions Conjuguees.
72. J. Stoer, Theory Numer. Math., 28, 343 (1977). On the Relation between Quadratic Termi-nation and Convergence Properties of Minimization Algorithms, Part I.
73. H. P. Crowder and P. Wolfe, IBM J. Res. Develop., 16, 431 (1972). Linear Convergence of the Conjugate Gradient Method.
74. A. Cohen, SIAM J. Numer. Anal., 9, 248 (1972). Rate of Convergence of Several Conjugate Gradient Algorithms.
75. P. Baptist and J. Stoer, Numer. Math., 28, 367 (1977). On the Relation between Quadratic Termination and Convergence Properties of Minimization Algorithms.
76. M. Al-Baali, Inst. Math. Appl J Numer. Anal., 5,121 (1985). Descent Property and Global Convergence of the Fletcher-Reeves Method with Inexact Linear Search.
77. J. C. Gilbert and J. Nocedal, SIAM J. Opt., 2, 21 (1992). Global Convergence Properties of Conjugate Gradient Methods for Optimization.
78. Y. F. Hu and C. Storey, Opt. Theor. AppL, 71, 399 (1991). Global Convergence Result for Conjugate Gradient Methods.
79. O. Axelsson and G. Lindskog, Numer. Math., 48, 449 (1989). On the Rate of Convergence of the Preconditioned Conjugate Gradient Method.
80. J. D. Evans, J. Inst. Math. Appl., 4, 295 (1967). The Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices.
81. P. Concus, G. H. Golub, and D. P. O'Leary, in Sparse Matrix Computations, J. R. Bunch and D. J. Rose, Eds., Academic Press, New York, 1976, pp. 309-332. A Generalized Conjugate Gradient Method for the Numerical Solution of Elliptic Partial Differential Equations.
82. T. Schlick and M. Overton, J. Comput. Chem., 8, 1025 (1987). A Powerful Truncated Newton Method for Potential Energy Minimization.
83. D. F. Shanno and K. H. Phua, ACM Trans. Math. Software, 6, 618 (1980). Remark on Algorithm 500: Minimization of Unconstrained Multivariate Functions.
84. R. A. Scott and H. A. Scheraga, J. Chem. Phys., 42, 2209 (1965). Method for Calculating Internal Rotation Barriers.
85. R. A. Scott and H. A. Scheraga, J. Chem. Phys., 44, 3054 (1966). Conformational Analysis of Macromolecules. II. The Rotational Isomeric States of the Normal Hydrocarbons.
86. M. Levitt, J. Mol. Biol., 168, 595 (1983). Molecular Dynamics of Native Protein: l. Compu-ter Simulation of Trajectories.
87. B. Lesyng and W. Saenger, Carbohydrate Res., 133,187 (1984). Influence of the Orientation of Hydroxyl Groups on the Puckering Modes of Furanoid Rings.
88. C.-S. Tung, S. C. Harvey and J. A. McCammon, Biopolymers, 23, 2173 (1984). Large-Amplitude Bending Motions in Phenylalanine Transfer RNA.
89. A. George and J. W. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, N.J., 1981.
90. I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, Clarendon Press, Oxford, 1986.
91. Ph. L. Toint, in Sparse Matrices and Their Uses, I. S. Duff, Ed., Academic Press, New York, 1981. Towards an Efficient Sparsity Exploiting Newton Method for Minimization.
92. A. R. Curtis, M. J. D. Powell, and J. K. Reid, Inst. Math., 13, 117 (1974). On the Estimation of Sparse Jacobian Matrices.
93. M. J. D. Powell and Ph. L. Toint, SIAM J. Numer. Anal., 16,1060 (1979). On the Estimation of Sparse Hessian Matrices.
94. D. P. O'Leary, Math. Prog., 23, 20 (1982). A Discrete Newton Algorithm for Minimizing a Function of Many Variables.
95. J. E. Dennis, Jr. and J. J. More, SIAM Rev., 19,46 (1977). Quasi-Newton Methods, Motiva-tion and Theory.
96. P. E. Gill and W, Murray, J. Inst. Math. Appl., 9, 91 (1972). Quasi-Newton Methods for Unconstrained Optimization.
97. A. Griewank and Ph. L. Toint, in Nonlinear Optimization 1981, M. J. D. Powell, Ed., pp. 301-312, Academic Press, New York, 1982. On the Unconstrained Optimization of Partially Separable Functions.
98. A. Griewank and Ph. L. Toint, Numer. Math., 39, 119 (1982). Partitioned Variable Metric Updates for Large Structured Optimization Problems.
99. D. F. Shanno and P. C. Kettler, Math. Comput., 24, 6S1 (1970). Optimal Conditioning of Quasi-Newton Methods.
100. J. Nocedal, Math. Comput., 35,773 (1980). Updating Quasi-Newton Matrices with Limited Storage.
101. D. C. Liu and J. Nocedal, Math. Prog., 45, 503 (1989). On the Limited Memory BFGS Method for Large Scale Optimization.
102. J. C. Gilbert and C. Lemarechal, Math. Prog., 45,407 (1989). Some Numerical Experiments with Variable-Storage Quasi-Newton Algorithms.
103. A. Buckley and A. LeNir, Math. Prog., 27, 155 (1983). QN-like Variable Storage Conjugate Gradients.
104. M. J. D. Powell, Math. Prog., 34,34 (1986). How Bad are the BFGS and DFP Methods When the Objective Function Is Quadratic?.
105. R. H. Byrd, J. Nocedal, and Y. Yuan, SIAM J. Numer. Anal., 24, 1171 (1987). Global Convergence of a Class of Quasi-Newton Methods on Convex Problems.
106. A. R. Conn, N. I. M. Gould, and Ph. L. Toint, SIAM J. Numer. Anal., 25, 433 (1988). Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds.
107. A. R. Conn, N. I. M. Gould, and Ph. L. Toint, Math. Comput., 50, 399 (1988). Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables.
108. A. R. Conn, N. I. M. Gould, and Ph. L. Toint, Math. Prog., 2, 177 (1991). Convergence of Quasi-Newton Matrices Generated by the Symmetric Rank One Update.
109. S. G. Nash and J. Nocedal, SIAM J. Opt., 1 358-372 (1991). A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large-Scale Optimization.
110. X. Zou, I. M. Navon, F. X. Le Dimet, A. Nouailler, and T. Schlick, SIAM J. Opt., in press. A Comparison of Efficient Large-Scale Minimization Algorithms for Optimal Control Applications in Meteorology.
111. S. C. Eisenstat and H. F. Walker, preprint, 1992. Globally Convergent Inexact Newton Methods.
112. R. S. Dembo, in Nonlinear Optimization, M. J. D. Powell, Ed., pp. 361-373. Academic Press, New York, 1982. Large Scale Nonlinear Optimization.
113. R. S. Dembo, S. C. Eisenstat, and T. Steihaug, SIAM J. Numer. Anal, 19, 400 (1982). Inexact Newton Methods.
114. R. S. Dembo and T. Steihaug, Math. Prog., 26, 190 (1983). Truncated-Newton Algorithms for Large-Scale Unconstrained Optimization.
115. S. G. Nash, in Numerical Optimization 1984, P. T. Boggs, R. H. Byrd, and R. B. Schnabel, Eds., pp. 119-136, SIAM, Philadelphia, 1985. Solving Nonlinear Programming Problems Using Truncated-Newton Techniques.
116. S. G. Nash and A. Sofer, Oper. Res. Lett., 9,219 (1990). Assessing a Search Direction Within a Truncated Newton Method.
117. S. G. Nash, SIAM J. Sci. Statist. Comput., 6, 599 (1985). Preconditioning of Truncated-Newton Methods.
118. S. A. Zenios and M. C. Pinar, SIAM J. Sci. Statist. Comput., 13 (Sept. 1992). Parallel Block-Partitioning of Truncated Newton for Nonlinear Network Optimization.
119. P. Deuflhard, in Proceedings of the Copper Mountain Conference on Iterative Methods, Copper Mountain, Colorado, April 1-5, 1990. Global Inexact Newton Methods for Very Large Scale Nonlinear Problems.
120. J. w! Ponder and F. M. Richards, J. Comput. Chem., 8, 1016 (1987). An Efficient Newton-like Method for Molecular Mechanics Energy Minimization of Large Molecules.
121. T. Schlick and A. Fogelson, ACM Trans. Math. Software, 18, 46 (1992). TNPACK-A Truncated Newton Minimization Package for Large-Scale Problems. 1. Algorithm and Usage.
122. T. Schlick and A. Fogelson, ACM Trans. Math. Software, 18, 71 (1992). TNPACK-A Truncated Newton Minimization Package for Large-Scale Problems. II. Implementation Examples.
123. L. Fauci and A. Fogelson, Comm. Pure Appl. Math., in press. Truncated Newton Methods and the Modeling of Immersed Elastic Structures.
124. H. Matthies and G. Strang, Int. J. Numer. Methods Engin., 14,1613 (1979). The Solution of Nonlinear Finite Element Equations.
125. S. C. Eisenstat, M. H. Shultz, and A. H. Sherman, in Advances in Computer Methods for Partial Differential Equations, R. Vichnevetsky, Ed., pp. 33-39, AICA, New Brunswick, N.J., 1975. Efficient Implementation of Sparse Symmetric Gaussian Elimination.
126. S. C. Eisenstat, M. H. Shultz, and A. H. Sherman, in Advances in Computer Methods for Partial Differential Equations, R. Vichnevetsky, Ed., pp. 40-45, AICA, New Brunswick, N.J., 1975. Application of Sparse Matrix Methods to Partial Differential Equations.
127. S. C. Eisenstat, M. H. Schultz, and A. H. Sherman, SIAMJ. Sci. Statist. Comput., 2, 225 (1981). Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination.
128. S. C. Eisenstat, M. C. Gursky, M. H. Schultz, and A. H. Sherman, Int. J. Numer. Methods Engin., 18, 1145 (1982). Yale Sparse Matrix Package. I. The Symmetric Codes.
129. D. J. Rose, in Graph Theory and Computing, R. C. Read, Ed., Academic Press, New York, 1972. A Graph-Theoretic Study of the Numerical Solution of Sparse Positive-Definite Systems of Linear Equations.
130. T. C. Oppe, W. D. Joubert, and D. R. Kincaid, NSPCG User's Guide. Version 1.0: A Package for Solving Large Sparse Linear Systems by Various Iterative Methods. Technical Report CNA-216, Center for Numerical Analysis, University of Texas at Austin, 1988.
131. Y. Saad, SPARSEKIT: A Basic Toolkit for Sparse Matrix Computations, NASA Ames Re-search Center, Moffett Field, Calif., May 21, 1990.
132. J. W. H. Liu, ACM Trans. Math. Software, 11, 141 (1985). Modification of the Minimum-Degree Algorithm by Multiple Elimination.
133. A. George, M. T. Heath, J. Liu, and E. Ng, SIAMJ. Statist. Comput., 9, 327 (1988). Sparse Cholesky Factorization on a Local-Memory Multiprocessor.
134. J. M. Ortega, SIAM J. Opt., 1, 565 (1991). Orderings for Conjugate Gradient Preconditioners.
135. J. O'Neil and D. B. Szyld, SIAMJ. Sci. Statist. Comput., 11, 811 (1990). A Block Ordering Method for Sparse Matrices.
136. S. G. Nash and A. Sofer, SIAMJ. Opt., 1,530 (1991). A General-Purpose Parallel Algorithm for Unconstrained Optimization.
137. R. B. Schnabel and E. Eskow, SIAM J. Sci. Statist. Comput., 11, 1136 (1990). A New Modified Cholesky Factorization.
138. E. Eskow and R. B. Schnabel, Software for a New Modified Cholesky Factorization. Compu-ter Science Department Technical Report CU-CS-443-89, University of Colorado, Boulder, 1989.
139. T. Schlick, SIAM J. Sci. Statist. Comput., in press. Modified Cholesky Factorizations for Sparse Preconditioners.
140. J. J. More, B. S. Garbow, and K. E. Hillstrom, ACM Trans. Math. Software, 7, 17 (1981). Testing Unconstrained Optimization Software.
141. J. J. More, B. S. Garbow, and K. E. Hillstrom, ACM Trans. Math. Software, 7, 136 (1981). Algorithm 566: FORTRAN Subroutines for Testing Unconstrained Optimization Software.
142. E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen, LAPACK Users' Guide, Society for Industrial and Applied Mathematics, Philadelphia, 1992.