Numerical path following

Handbook of Numerical Analysis

Volumn 5, Issue , 1997, Pages 3-207

  Allgower, Eugene L ^a   Georg, Kurt ^a  

^a Department of Environmental and Radiological Health Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70350662980     PISSN: 15708659     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1570-8659(97)80002-6     Document Type: Review

References (433)

1. Abraham R., and Robbin J. Transversal Mappings and Flows (1967), W.A. Benjamin
2. Adler I., Resende G.C., Veiga G., and Karmarkar N. An implementation of Karmarkar's algorithm for linear programming. Math. Programming 44 (1989) 297-335
3. Alexander J.C. Average intersection and pivoting densities. SIAM J. Numer. Anal. 24 (1987) 129-146
4. Alexander J.C., and Slud E.V. Global convergence rates of piecewise-linear continuation methods: A probabilistic approach. In: Eaves B.C., Gould F.J., Peitgen H.-O., and Todd M.J. (Eds). Homotopy Methods and Global Convergence (1983), Plenum Press, New York 15-30
5. Allgower E.L. Bifurcations arising in the calculation of critical points via homotopy methods. In: Küpper T., Mittelmann H.D., and Weber H. (Eds). Numerical Methods for Bifurcation Problems. ISNM 70 (1984), Birkhäuser, New York 15-28
6. Allgower E.L., Böhmer K., Georg K., and Miranda R. Exploiting symmetry in boundary element methods. SIAM J. Numer. Anal. 29 (1992) 534-552
7. In: Allgower E.L., Böhmer K., and Golubitsky M. (Eds). Bifurcation and Symmetry. ISNM 104 (1992), Birkhäuser, Basel
8. Allgower E.L., Böhmer K., and Mei Z. A complete bifurcation scenario for the 2-D nonlinear Laplacian with Neumann boundary conditions. In: Seydel R., Schneider F.W., Küpper T., and Troger H. (Eds). Bifurcation and Chaos: Analysis, Algorithms, Applications. ISNM 97 (1991), Birkhäuser, Basel 1-18
9. Allgower E.L., Böhmer K., and Mei Z. On a problem decomposition for semi-linear nearly symmetric elliptic problems. In: Hackbusch W. (Ed). Parallel Algorithms for PDE's. Notes on Numerical Fluid Mechanics 31 (1991), Vieweg Verlag, Basel 1-17
10. Allgower E.L., Böhmer K., and Mei Z. On new bifurcation results for semi-linear elliptic equations with symmetries. In: Whiteman J. (Ed). The Mathematics of Finite Elements and Applications VII (1991), Academic Press, Braunschweig 487-494
11. Allgower E.L., and Chien C.-S. Continuation and local perturbation for multiple bifurcations. SIAM J. Sci. Statist. Comput. 7 (1986) 1265-1281
12. Allgower E.L., Chien C.-S., and Georg K. Large sparse continuation problems. J. Comput. Appl. Math. 26 (1989) 3-21
13. Allgower E.L., Chien C.-S., Georg K., and Wang C.-F. Conjugate gradient methods for continuation problems. J. Comput. Appl. Math. 38 (1991) 1-16
14. Submitted. Allgower E.L., and Fässler A.F. Blockstructure and equivariance of matrices (1993)
15. Allgower E.L., and Georg K. Generation of triangulations by reflections. Utilitas Math. 16 (1979) 123-129
16. Allgower E.L., and Georg K. Homotopy methods for approximating several solutions to nonlinear systems of equations. In: Forster W. (Ed). Numerical Solution of Highly Nonlinear Problems (1980), North-Holland, Brunel 253-270
17. Allgower E.L., and Georg K. Predictor-corrector and simplicial methods for approximating fixed points and zero points of nonlinear mappings. In: Bachem A., Grötschel M., and Korte B. (Eds). Mathematical Programming: The State of the Art (1983), Springer, Amsterdam 15-56
18. Allgower E.L., and Georg K. Relationships between deflation and global methods in the problem of approximating additional zeros of a system of nonlinear equations. In: Eaves B.C., Gould F.J., Peitgen H.-O., and Todd M.J. (Eds). Homotopy Methods and Global Convergence (1983), Plenum Press, Berlin 31-42
19. Allgower E.L., and Georg K. Estimates for piecewise linear approximations of implicitly defined manifolds. Appl. Math. Lett. 1 5 (1989) 1-7
20. Allgower E.L., and Georg K. Numerical Continuation Methods: An Introduction. Series in Computational Mathematics 13 (1990), Springer, New York 388
21. Allgower E.L., and Georg K. Continuation and path following. Acta Numer. 2 (1993) 1-64
22. Allgower E.L., Georg K., and Widmann R. Volume integrals for boundary element methods. J. Comput. Appl. Math. 38 (1991) 17-29
23. Allgower E.L., Georg K., and Miranda R. Exploiting permutation symmetry with fixed points in linear equations. In: Allgower E.L., Georg K., and Miranda R. (Eds). Exploiting Symmetry in Applied and Numerical Analysis. Lectures in Applied Mathematics 29 (1993), American Mathematical Society, Berlin 23-36
24. Allgower E.L., Georg K., and Walker J. Exploiting symmetry in 3D boundary element methods. In: Agarwal R.P. (Ed). Contributions in Numerical Mathematics. World Scientific Series in Applicable Analysis 2 (1993), World Scientific, Providence, RI 15-25
25. Allgower E.L., and Gnutzmann S. An algorithm for piecewise linear approximation of implicitly defined two-dimensional surfaces. SIAM J. Numer. Anal. 24 (1987) 452-469
26. Allgower E.L., and Gnutzmann S. Simplicial pivoting for mesh generation of implicitly defined surfaces. Comput. Aided Geom. Design 8 (1991) 305-325
27. Allgower E.L., and Schmidt P.H. An algorithm for piecewise-linear approximation of an implicitly defined manifold. SIAM J. Numer. Anal. 22 (1985) 322-346
28. Preprint. Allgower E.L., and Schwetlick H. On minimally extended systems for simple bifurcation points (1993)
29. Allison D.C.S., Harimoto S., and Watson L.T. The granularity of parallel homotopy algorithms for polynomial systems of equations. Intern. J. Comput. Math. 29 (1989) 21-37
30. Amann H. Fixed point equations and nonlinear eigenvalue problems in ordered Banach spaces. SIAM Rev. 18 (1976) 620-709
31. Ambrosetti A., and Hess P. Positive solutions of asymptotically linear elliptic eigenvalue problems. J. Math. Anal. Appl. 73 (1980) 411-422
32. Atkinson K.E. User's Guide to a boundary element package for solving integral equations on piecewise smooth surfaces. Report 44 (1993), Univ. of Iowa, Singapore
33. Back A., Guckenheimer J., Myers M., Wiclin F., and Worfolk P. Dstool; computer assisted exploration of dynamical systems. Notices ACM 39 (1992) 303-309
34. Ballisti R., Hafner C., and Leuchtman P. Application of the representation theory of finite groups to field computation problems with symmetrical boundaries. IEEE Trans. Magnetics 18 (1982) 584-587
35. Ballman J., Eppler R., and Hackbusch W. Panel method in fluid mechanics with emphasis on aerodynamics. In: Hackbusch W. (Ed). Notes on Numerical Fluid Dynamics 21 (1988), Vieweg
36. Bank R.E., and Chan T.F. PLTMGC: A multi-grid continuation program for parameterized non-linear elliptic systems. SIAM J. Sci. Statist. Comput. 7 (1986) 540-559
37. Bank B., Guddat J., Klatte D., Kummer B., and Tammer K. Non-Linear Parametric Optimization (1983), Birkhäuser, Braunschweig
38. Bayer D., and Lagarias J.C. The nonlinear geometry of linear programming, I: Affine and projective scaling trajectories, II: Legendre transform coordinates and central trajectories. Trans. Amer. Math. Soc. 314 (1989) 499-581
39. Ben-Israel A., and Greville T.N.E. Generalized Inverses: Theory and Applications (1974), Wiley, Basel
40. Bernstein D.N. The number of roots of a system of equations. Functional Anal. Appl. 9 (1975) 1-4
41. Bernstein S. Sur la généralisation du problème de Dirichlet. Math. Ann. 69 (1910) 82-136
42. Bertsekas D.P. Constrained Optimization and Lagrange Multiplier Methods (1984), Academic Press, New York
43. Preprint. Beyn W.-J. On smoothness and invariance properties of the Gauss-Newton method (1992), Univ. of Bielefeld, New York
44. Bixby R.E., Gregory J.W., Lustig I.J., Marsten R.E., and Shanno D.F. Very large-scale linear programming: A case study in combining interior point and simplex methods. Technical Report RRR 34-91 (1991), Rutgers Univ., Germany
45. Bolstad J.H., and Keller H.B. A multigrid continuation method for elliptic problems with folds. SIAM J. Sci. Statist. Comput. 7 (1986) 1081-1104
46. Bossavit A. Symmetry, groups, and boundary value problems. A progressive introduction to noncommutative harmonic analysis of partial differential equations in domains with geometrical symmetry. Comput. Methods Appl. Mech. Engrg. 56 (1986) 167-215
47. Bossavit A. Boundary value problems with symmetry and their approximation by finite elements. SIAM J. Appl. Math. 53 (1993) 1352-1380
48. Bourji S.K., and Walker H.F. Least-change secant updates of nonsquare matrices. SIAM J. Numer. Math. 27 (1990) 1263-1294
49. Branin F.H. Widely convergent method for finding multiple solutions of simultaneous nonlinear equations. IBM J. Res. Develop. 16 (1972) 504-522
50. Branin F.H., and Hoo S.K. A method for finding multiple extrema of a function of n variables. In: Lootsma F.A. (Ed). Numerical Methods for Non-Linear Optimization (1972), Academic Press, New Brunswick, NJ 231-237
51. Brezzi F., Rappaz J., and Raviart P.A. Finite dimensional approximation of nonlinear problems. Part 1: Branches of nonsingular solutions. Numer. Math. 36 (1980) 1-25
52. Brezzi F., Rappaz J., and Raviart P.A. Finite dimensional approximation of nonlinear problems. Part 2: Limit points. Numer. Math. 37 (1980) 1-28
53. Brezzi F., Rappaz J., and Raviart P.A. Finite dimensional approximation of nonlinear problems. Part 3: Simple bifurcation points. Numer. Math. 38 (1981) 1-30
54. Preprint. Brodzik M.L., and Rheinboldt W.C. On the computation of simplicial approximations of implicitly defined two-dimensional manifolds (1994), University of Pittsburgh, New York
55. Brooks P.S. Infinite retrogression in the Eaves-Saigal algorithm. Math. Programming 19 (1980) 313-327
56. Brouwer L.E.J. Über Abbildung von Mannigfaltigkeiten. Math. Ann. 71 (1912) 97-115
57. Brown K.M., and Gearhart W.B. Deflation techniques for the calculation of further solutions of a nonlinear system. Numer. Math. 16 (1971) 334-342
58. Broyden C.G. A class of methods for solving nonlinear simultaneous equations. Math. Comp. 19 (1965) 577-593
59. Byrne G.D., and Baird L.A. Distillation calculations using a locally parametrized continuation method. Comput. Chem. Engrg. 9 (1985) 593-599
60. Canny J., and Rojas J.M. An optimal condition for determining the exact number of roots of a polynomial system. Proceedings of the ISSAC 91. Bonn, Germany (1991) 96-102
61. Carpenter T.J., and Shanno D.F. An interior point method for quadratic programs based on conjugate projected gradients. Technical Report RRR 55-91 (1991), Rutgers Univ.
62. Chan T.F. Deflation techniques and block-elimination algorithms for solving bordered singular systems. SIAM J. Sci. Stat. Comp. 5 (1984) 121-134
63. Chan T.F. Newton-like pseudo-arclength methods for computing simple turning points. SIAM J. Sci. Statist. Comput. 5 (1984) 135-148
64. Chan T.F. Techniques for large sparse systems arising from continuation methods. In: Küpper T., Mittelmann H.D., and Weber H. (Eds). Numerical Methods for Bifurcation Problems. ISNM 70 (1984), Birkhäuser, New Brunswick, NJ 116-128
65. Chan T.F., and Keller H.B. Arc-length continuation and multi-grid techniques for nonlinear eigenvalue problems. SIAM J. Sci. Statist. Comput. 3 (1982) 173-194
66. Chan T.F., and Saad Y. Iterative methods for solving bordered systems with applications to continuation methods. SIAM J. Sci. Statist. Comput. 6 (1985) 438-451
67. Chao K.S., and Saeks R. Continuation methods in circuit analysis. Proc. IEEE 65 (1977) 1187-1194
68. Chavez R., Seader J.D., and Wayburn T.L. Multiple steady state solutions for interlinked separation systems. Ind. Eng. Chem. Fundam. 25 (1986) 566-576
69. Chien C.-S. Secondary bifurcations in the buckling problem. J. Comput. Appl. Math. 25 (1989) 277-287
70. Chow S.N., and Hale J.K. Methods of Bifurcation Theory (1982), Springer, Basel
71. Chow S.N., Mallet-Paret J., and Yorke J.A. Finding zeros of maps: Homotopy methods that are constructive with probability one. Math. Comp. 32 (1978) 887-899
72. Chow S.N., Mallet-Paret J., and Yorke J.A. A homotopy method for locating all zeros of a system of polynomials. In: Peitgen H.-O., and Walther H.-O. (Eds). Functional Differential Equations and Approximation of Fixed Points. Lecture Notes in Math. 730 (1979), Springer, New York 77-88
73. Chu K.-W.E., Govaerts W., and Spence A. Matrices with rank deficiency two in eigenvalue problems and dynamical systems. SIAM J. Num. Anal. 31 (1994) 524-539
74. Chu M.T. The generalized Toda flow, the QR algorithm and the center manifold theory. SIAM J. Alg. Disc. Meth. 5 (1984) 187-201
75. Chu M.T. A simple application of the homotopy method to symmetric eigenvalue problems. Linear Algebra Appl. 59 (1984) 85-90
76. Chu M.T. A continuous approximation to the generalized Schur's decomposition. Linear Algebra Appl. 78 (1986) 119-132
77. Chu M.T. On the continuous realization of iterative processes. SIAM Rev. 30 (1988) 375-387
78. Chu M.T. Solving additive inverse eigenvalue problems for symmetric matrices by the homotopy method. IMA J. Numer. Anal. 9 (1990) 331-342
79. Chu M.T. A continuous Jacobi-like approach to the simultaneous reduction of real matrices. Linear Algebra Appl. 147 (1991) 75-96
80. Chu M.T., Li T.-Y., and Sauer T. Homotopy methods for general λ-matrix problems. SIAM J. Matrix Anal. Appl. 9 (1988) 528-536
81. Chua L.O., and Ushida A. A switching-parameter algorithm for finding multiple solutions of nonlinear resistive circuits. Circuit Theory and Appl. 4 (1976) 215-239
82. Cicogna G. Symmetry breakdown from bifurcation. Lett. Nuovo Cimento 31 (1981) 600-602
83. Cliffe K.A., and Winters K.H. The use of symmetry in bifurcation calculations and its application to the Bénard problem. J. Comput. Phys. 67 (1986) 310-326
84. Cohen A.I. Rate of convergence of several conjugate gradient algorithms. SIAM J. Numer. Anal. 9 (1972) 248-259
85. Cottle R.W. Solution rays for a class of complementarity problems. Math. Programming Study 1 (1974) 58-70
86. Cottle R.W., and Dantzig G.B. Complementary pivot theory of mathematical programming. Linear Algebra Appl. 1 (1968) 103-125
87. Cottle R.W., Golub G.H., and Sacher R.S. On the solution of large structured linear complementarity problems: The block partitioned case. Appl. Math. Optim. 4 (1978) 347-363
88. Cottle R.W., Pang J.-S., and Stone R.E. The Linear Complementarity Problem (1992), Academic Press, Berlin
89. Coxeter H.S.M. Discrete groups generated by reflections. Ann. of Math. 6 (1934) 13-29
90. Coxeter H.S.M. Regular Polytopes. 3rd ed. (1963), MacMillan, New York
91. Crandall M.G., and Rabinowitz P.H. Bifurcation from simple eigenvalues. J. Funct. Anal. 8 (1971) 321-340
92. Crouzeix M., and Rappaz J. On Numerical Approximation in Bifurcation Theory. RMA (1990), Masson, New York
93. Dai R.-X., and Rheinboldt W.C. On the computation of manifolds of fold points for parameter-dependent problems. SIAM J. Numer. Anal. 27 (1990) 437-446
94. Dai Y., Sekitani K., and Yamamoto Y. A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems. Z. Oper. Res. 36 (1992) 23-53
95. Dai Y., and Yamamoto Y. The path following algorithm for stationary point problems on polyhedral cones. J. Oper. Res. Soc. Japan 32 (1989) 286-309
96. Dantzig G.B. Linear Programming and Extensions (1963), Princeton Univ. Press, Paris
97. in Russian. Davidenko D. On a new method of numerical solution of systems of nonlinear equations. Dokl. Akad. Nauk USSR 88 (1953) 601-602
98. Davis P.J. Circulant Matrices (1979), Wiley, Princeton, NJ
99. Davis P.J., and Rabinowitz P. Methods of Numerical Integration. 2nd ed. (1984), Academic Press, New York
100. Dellnitz M., and Werner B. Computational methods for bifurcation problems with symmetries - with special attention to steady state and Hopf bifurcation points. J. Comput. Appl. Math. 26 (1989) 97-123
101. Den Heijer C., and Rheinboldt W.C. On steplength algorithms for a class of continuation methods. SIAM J. Numer. Anal. 18 (1981) 925-948
102. Dennis J.E., and Schnabel R.B. Numerical Methods for Unconstrained Optimization and Nonlinear Equations (1983), Prentice-Hall, Orlando
103. DeSa C., Irani K.M., Ribbens C.G., Watson L.T., and Walker H.F. Preconditioned iterative methods for homotopy curve tracking. SIAM J. Sci. Stat. Comput. 13 (1992) 30-46
104. Deuflhard P., Fiedler B., and Kunkel P. Efficient numerical pathfollowing beyond critical points. SIAM J. Numer. Anal. 24 (1987) 912-927
105. Deuflhard P., and Heindl G. Affine invariant convergence theorems for Newton's method and extensions to related methods. SIAM Numer. Anal. 16 (1979) 1-10
106. Doedel E., Keller H.B., and Kernévez J.P. Numerical analysis and control of bifurcation problems. Part I: Bifurcation in finite dimensions. Internat. J. Bifurcation Chaos 1 (1991) 493-520
107. Doedel E., Keller H.B., and Kernévez J.P. Numerical analysis and control of bifurcation problems. Part II: Bifurcation in infinite dimensions. Internat. J. Bifurcation Chaos 1 (1991) 745-772
108. Doedel E., and Kernévez J.P. AUTO: Software for continuation and bifurcation problems in ordinary differential equations, California Institute of Technology (1986)
109. Dunford N., and Schwartz J.T. Linear Operators. Part II: Spectral Theory (1963), Interscience, Englewood Cliffs, NJ
110. Eaves B.C. Homotopies for the computation of fixed points. Math. Programming 3 (1972) 1-22
111. Eaves B.C. A short course in solving equations with PL homotopies. In: Cottle R.W., and Lemke C.E. (Eds). Nonlinear Programming, SIAM-AMS Proc. 9. Providence, RI (1976) 73-143
112. Eaves B.C. A Course in Triangulations for Solving Equations with Deformations. Lecture Notes in Economics and Mathematical Systems 234 (1984), Springer, New York
113. Eaves B.C., and Saigal R. Homotopies for computation of fixed points on unbounded regions. Math. Programming 3 (1972) 225-237
114. Eaves B.C., and Scarf H. The solution of systems of piecewise linear equations. Math. Oper. Res. 1 (1976) 1-27
115. Eaves B.C., and Yorke J.A. Equivalence of surface density and average directional density. Math. Oper. Res. 9 (1984) 363-375
116. Ermentrout B. PhasePlane: The Dynamical Systems Tool (1990), Brooks/Cole Publishing, Berlin
117. Fässler A. Application of group theory to the method of finite elements. PhD thesis (1976), ETH
118. to appear. Feudel U., and Jansen W. CANDYS/QA - A software system for the qualitative analysis of nonlinear dynamical systems. Bifurcation & Chaos (1992)
119. Fiacco A.V. Introduction to Sensitivity and Stability Analysis in Nonlinear Programming (1983), Academic Press, Zürich, Switzerland
120. In: Fiacco A.V. (Ed). Sensitivity, Stability and Parametric Analysis. Mathematical Programming Study 21 (1984), North-Holland, New York
121. Fiacco A.V., and McCormick G. Nonlinear Programming: Sequential Unconstrained Minimization Techniques (1968), Wiley, Amsterdam
122. Fink J.P., and Rheinboldt W.C. On the discretization error of parametrized nonlinear equations. SIAM J. Numer. Anal. 20 (1983) 732-746
123. Fink J.P., and Rheinboldt W.C. Solution manifolds and submanifolds of parametrized equations and their discretization errors. Numer. Math. 45 (1984) 323-343
124. Fink J.P., and Rheinboldt W.C. Local error estimates for parametrized nonlinear equations. SIAM J. Numer. Anal. 22 (1985) 729-735
125. Fink J.P., and Rheinboldt W.C. Folds on the solution manifold of a parametrized equation. SIAM J. Numer. Anal. 23 (1986) 693-706
126. Fink J.P., and Rheinboldt W.C. A geometric framework for the numerical study of singular points. SIAM J. Numer. Anal. 24 (1987) 618-633
127. Fletcher R. Practical Methods of Optimization. 2nd ed. (1987), Wiley, New York, NY
128. Freudenthal H. Simplizialzerlegungen von beschränkter Flachheit. Ann. of Math. 43 (1942) 580-582
129. Freund R.M. Variable dimension complexes. Part I: Basic theory. Math. Oper. Res. 9 (1984) 479-497
130. Freund R.M. Variable dimension complexes. Part II: A unified approach to some combinatorial lemmas in topology. Math. Oper. Res. 9 (1984) 498-509
131. Ser. B 52. Freund R.M. A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start". In: Roos C., and Vial J.-P. (Eds). Interior Point Methods for Linear Programming: Theory and Practice. Math. Programming (1991), Mathematical Programming Society, North-Holland, New York 441-446
132. Freund R.W., Golub G.H., and Nachtigal N.M. Iterative solution of linear systems. Acta Numerica 1 (1992) 57-100
133. Fulton W. Intersection Theory (1984), Springer, Amsterdam
134. Garcia C.B., and Gould F.J. A theorem on homotopy paths. Math. Oper. Res. 3 (1978) 282-289
135. Garcia C.B., and Gould F.J. Relations between several path following algorithms and local and global Newton methods. SIAM Rev. 22 (1980) 263-274
136. Garcia C.B., and Zangwill W.I. Finding all solutions to polynomial systems and other systems of equations. Math. Programming 16 (1979) 159-176
137. Garcia C.B., and Zangwill W.I. Pathways to Solutions, Fixed Points, and Equilibria (1981), Prentice-Hall, Berlin
138. Garratt T.J., Moore G., and Spence A. Two methods for the numerical detection of Hopf bifurcations. In: Seydel R., Schneider F.W., Küpper T., and Troger H. (Eds). Bifurcation and Chaos: Analysis, Algorithms, Applications. ISNM 97 (1991), Birkhäuser, Englewood Cliffs, NJ 129-134
139. Gatermann K., and Hohmann A. Symbolic exploitation of symmetry in numerical pathfollowing. Impact of Computing in Science and Engineering 3 (1991) 330-365
140. Georg K. A numerically stable update for simplicial algorithms. In: Allgower E.L., Glashoff K., and Peitgen H.-O. (Eds). Numerical Solution of Nonlinear Equations. Lecture Notes in Math. 878 (1981), Springer, Basel 117-127
141. Georg K. On tracing an implicitly defined curve by quasi-Newton steps and calculating bifurcation by local perturbation. SIAM J. Sci. Stat. Comput. 2 (1981) 35-50
142. Georg K. Zur numerischen Realisierung von Kontinuitätsmethoden mit Prädiktor-Korrektor- oder simplizialen Verfahren (1982), Habilitationsschrift, Univ. Bonn, Berlin
143. Georg K. A note on stepsize control for numerical curve following. In: Eaves B.C., Gould F.J., Peitgen H.-O., and Todd M.J. (Eds). Homotopy Methods and Global Convergence (1983), Plenum Press, Germany 145-154
144. Georg K. An introduction to PL algorithms. In: Allgower E.L., and Georg K. (Eds). Computational Solution of Nonlinear Systems of Equations. Lectures in Applied Mathematics 26 (1990), American Mathematical Society, New York 207-236
145. Georg K. Approximation of integrals for boundary element methods. SIAM J. Sci. Stat. Comput. 12 (1991) 443-453
146. Georg K., and Miranda R. Exploiting symmetry in solving linear equations. In: Allgower E.L., Böhmer K., and Golubitsky M. (Eds). Bifurcation and Symmetry. ISNM 104 (1992), Birkhäuser, Providence, RI 157-168
147. Georg K., and Miranda R. Symmetry aspects in numerical linear algebra with applications to boundary element methods. In: Allgower E.L., Georg K., and Miranda R. (Eds). Exploiting Symmetry in Applied and Numerical Analysis. Lectures in Applied Mathematics 29 (1993), American Mathematical Society, Basel 213-228
148. Georg K., and Tausch J. Some error estimates for the numerical approximation of surface integrals. Math. Comp. 62 (1993) 755-763
149. Preprint. Georg K., and Widmann R. Adaptive quadratures over surfaces (1993), Colorado State University, Providence, RI
150. Gfrerer H., Guddat J., and Wacker H.-J. A globally convergent algorithm based on imbedding and parametric optimization. Computing 30 (1983) 225-252
151. Gfrerer H., Guddat J., Wacker H.-J., and Zulehner W. Path-following for Kuhn-Tucker curves by an active set strategy. In: Baghi A., and Jongen H.T. (Eds). System and Optimization. Lect. Notes Contr. Inf. Sc. 66 (1985), Springer 111-132
152. Gill P.E., Golub G.H., Murray W., and Saunders M.A. Methods for modifying matrix factorizations. Math. Comp. 28 (1974) 505-535
153. Gill P.E., Murray W., Saunders M.A., Tomlin J.A., and Wright M.H. On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method. Math. Programming 36 (1986) 183-209
154. Glowinski R., Keller H.B., and Reinhart L. Continuation-conjugate gradient methods for the least squares solution of nonlinear boundary value problems. SIAM J. Sci. Statist. Comput. 6 (1985) 793-832
155. Gnutzmann S. Stückweise lineare Approximation implizit definierter Mannigfaltigkeiten. PhD thesis (1989), University of Hamburg, Berlin
156. 3 L) operations. Math. Programming 49 (1991) 325-340
157. Golub G.H., and Van Loan C.F. Matrix Computations. 2nd ed. (1989), J. Hopkins University Press, Fed. Rep. Germany
158. Golubitsky M., and Schaeffer D.G. Singularities and Groups in Bifurcation Theory 1 (1985), Springer, Baltimore
159. Golubitsky M., Stewart I., and Schaeffer D.G. Singularities and Groups in Bifurcation Theory 2 (1988), Springer, Berlin
160. 3L) operations. In: Megiddo N. (Ed). Progress in Mathematical Programming, Interior Point and Related Methods (1988), Springer, Berlin 1-28
161. Gonzaga C.C. Path-following methods for linear programming. SIAM Rev. 34 (1992) 167-224
162. Górniewicz L. Homological methods in fixed point theory of multivalued maps. Diss. Math. 129 (1976)
163. Gould F.J., and Tolle J.W. Complementary Pivoting on a Pseudomanifold Structure with Applications on the Decision Sciences. Sigma Series in Applied Mathematics 2 (1983), Heldermann, New York
164. Griewank A. On solving nonlinear equations with simple singularities or nearly singular solutions. SIAM Rev. 27 (1985) 537-563
165. Griewank A. On automatic differentiation. In: Iri M., and Tanabe K. (Eds). Mathematical Programming: Recent Developments and Applications (1989), Kluwer, Berlin 83-108
166. In: Griewank A., and Corliss G. (Eds). Automatic Differentiation of Algorithms: Theory, Implementation, and Application (1991), SIAM, Dordrecht
167. Griewank A., and Reddien G.W. Characterization and computation of generalized turning points. SIAM J. Numer. Anal. 21 (1984) 176-185
168. Guckenheimer J., and Kim S. Computational environments for exploring dynamical systems. Bifurcation & Chaos 1 (1991) 269-276
169. Guddat J., Guerra Vasquez F., and Jongen H.T. Parametric Optimization: Singularities, Path Following, and Jumps (1990), Wiley, Philadelphia
170. In: Guddat J., Jongen H.T., Kummer B., and Nožička F. (Eds). Parametric Optimization and Related Topics (1987), Akademie, Chichester, England
171. Guy J., and Mangeot B. Use of group theory in various integral equations. SIAM J. Appl. Math. 40 (1981) 390-399
172. Hackbusch W. Integralgleichungen. Theorie und Numerik (1989), B.G. Teubner, Berlin
173. Hackbusch W. Iterative Solution of Large Sparse Systems of Equations. Applied Mathematical Sciences 95 (1994), Springer, Stuttgart
174. Haselgrove C.B. The solution of nonlinear equations and of differential equations with two-point boundary conditions. Comput. J. 4 (1961) 255-259
175. Healey T.J. Global bifurcation and continuation in the presence of symmetry with an application to solid mechanics. SIAM J. Math. Anal. 19 (1988) 824-840
176. Healey T.J. A group theoretic approach to computational bifurcation problems with symmetry. Comput. Meth. Appl. Mech. Engrg. 67 (1988) 257-295
177. Healey T.J. Symmetry and equivariance in nonlinear elastostatics, Part I. Arch. Rational Mech. Anal. 105 (1989) 205-228
178. Healey T.J., and Treacy J.A. Exact block diagonalization of large eigenvalue problems for structures with symmetry. Internat. J. Numer. Methods Engrg. 31 (1991) 265-285
179. Henderson M.E. Complex bifurcation. PhD thesis (1985), CALTECH, Berlin
180. Henderson M.E., and Keller H.B. Complex bifurcation from real paths. SIAM J. Appl. Math. 50 (1990) 460-482
181. Hestenes M.R., and Stiefel E. Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Standards 49 (1952) 409-436
182. Preprint 94-02. Hettich R., and Jongen H.T. On continuous deformations of semi-infinite optimization problems (1994), Mathematics, University of Trier, Pasadena
183. Hirsch M.W. A proof of the nonretractibility of a cell onto its boundary. Proc. Amer. Math. Soc. 14 (1963) 364-365
184. Hirsch M.W. Differential Topology (1976), Springer, Trier, Germany
185. Preprint, Konrad-Zuse-Zentrum Berlin, SC-91-20. Hohmann A. An adaptive continuation method for implicitly defined surfaces (1991)
186. Holodniok M., and Kubíček M. DERPER - An algorithm for the continuation of periodic solutions in ordinary differential equations. J. Comput. Phys. 55 (1984) 254-267
187. Hong B. Computational methods for bifurcation problems with symmetries on the manifold. SIAM J. Numer. Anal. 30 (1993) 1134-1154
188. Hubbard J., and West B. A Dynamical Systems Software Package for the Macintosh (1992), Springer, Berlin
189. Preprint. Huber B., and Sturmfels B. A polyhedral method for solving sparse polynomial systems (1993), Cornell Univ., Berlin
190. Huitfeldt J. Nonlinear eigenvalue problems - Prediction of bifurcation points and branch switching. Technical Report 17 (1991), Univ. of Göteborg
191. Huitfeldt J., and Ruhe A. A new algorithm for numerical path following applied to an example from hydrodynamical flow. SIAM J. Sci. Statist. Comput. 11 (1990) 1181-1192
192. Iri M., and Kubota K. Methods of fast automatic differentiation and applications. Research Memorandum RMI 87-02 (1987), Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Sweden
193. Ize J. Topological bifurcation. In: Matzeu M., and Vignoli A. (Eds). Nonlinear Analysis (1993), Birkhäuser
194. Jacobowitz H. Periodic solutions of x″ + f(x, t) = 0 via the Poincaré-Birkhoff theorem. J. Differential Equations 20 (1976) 37-52
195. Janovský V. A note on computing simple bifurcation points. Computing 43 (1989) 27-36
196. Jarausch H., and Mackens W. Numerical treatment of bifurcation branches by adaptive condensation. In: Küpper T., Mittelmann H.D., and Weber H. (Eds). Numerical Methods for Bifurcation Problems. ISNM 70 (1984), Birkhäuser, Boston, MA
197. Jarausch H., and Mackens W. Solving large nonlinear systems of equations by an adaptive condensation process. Numer. Math. 50 (1987) 633-653
198. Jepson A.D., and Decker D.W. Convergence cones near bifurcation. SIAM J. Numer. Anal. 23 (1986) 959-975
199. 2-symmetry. SIAM J. Numer. Anal. 28 (1991) 809-832
200. Jezierski J. One codimensional Wecken type theorems. Forum Math. (1993) 421-439
201. N, I. Morse Theory, Chebyshev Approximation (1983), Peter Lang, Basel
202. N, II. Transversality, Flows, Parametric Aspects (1986), Peter Lang, New York
203. Jongen H.T., and Weber G.-W. On parametric nonlinear programming. Ann. Oper. Res. 27 (1990) 253-284
204. Jongen H.T., and Zwier G. On the local structure of the feasible set in semi-infinite optimization. ISNM 72 (1985), Birkhäuser, New York 185-202
205. available from National Technical Information Service under accession number AD A077 096. Josephy N.H. Newton's method for generalized equations. Technical Report 1965 (1979), University of Wisconsin, Basel
206. Kaas-Petersen C. PATH - User's Guide (1989), University of Leeds, Madison, WI
207. Kamiya K., and Talman A.J.J. Variable dimension simplicial algorithm for balanced games. Technical Report 9025 (1990), Tilburg Univ., England
208. Karmarkar N.K. A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984) 373-395
209. Ser. B. Karmarkar N.K., and Ramakrishnan K.G. Computational results of an interior point algorithm for large scale linear programming. In: Roos C., and Vial J.-P. (Eds). Interior Point Methods for Linear Programming: Theory and Practice. Math. Programming 52 (1991), Mathematical Programming Society, North-Holland, The Netherlands 555-586
210. Katzenelson J. An algorithm for solving nonlinear resistive networks. Bell System Tech. J. 44 (1965) 1605-1620
211. to appear. Kearfott R.B. An interval step control for continuation methods. Math. Comp. (1989)
212. Kearfott R.B. Interval arithmetic techniques in the computational solution of nonlinear systems of equations: Introduction, examples and comparisons. In: Allgower E.L., and Georg K. (Eds). Computational Solution of Nonlinear Systems of Equations. Lectures in Applied Mathematics 26 (1990), American Mathematical Society, Amsterdam 337-357
213. Keener J.P., and Keller H.B. Perturbed bifurcation theory. Arch. Rational Mech. Anal. 50 (1974) 159-175
214. Keller H.B. Nonlinear bifurcation. J. Differential Equations 7 (1970) 417-434
215. Keller H.B. Numerical solution of bifurcation and nonlinear eigenvalue problems. In: Rabinowitz P.H. (Ed). Applications of Bifurcation Theory (1977), Academic Press, Providence, RI 359-384
216. Keller H.B. Global homotopies and Newton methods. In: de Boor C., and Golub G.H. (Eds). Recent Advances in Numerical Analysis (1978), Academic Press, New York 73-94
217. Keller H.B. Practical procedures in path following near limit points. In: Glowinski R., and Lions J.-L. (Eds). Computing Methods in Applied Sciences and Engineering (1982), North-Holland, New York
218. Keller H.B. The bordering algorithm and path following near singular points of higher nullity. SIAM J. Sci. Statist. Comput 4 (1983) 573-582
219. Keller H.B. Lectures on Numerical Methods in Bifurcation Problems (1987), Springer, Amsterdam
220. Kellogg R.B., Li T.-Y., and Yorke J.A. A constructive proof of the Brouwer fixed point theorem and computational results. SIAM J. Numer. Anal. 13 (1976) 473-483
221. Khachiyan L.G. A polynomial algorithm in linear programming. Soviet Math. Dokl. 20 (1979) 191-194
222. Khibnik A. Using TraX, a Tutorial to Accompany TraX, a Program for the Simulation and Analysis of Dynamical Systems (1990), Exeter Software, Berlin
223. Khibnik A.I., Kuznetsov Y.A., Levitin V.V., and Nikolaev E.V. Continuation techniques and interactive software for bifurcation analysis of odes and iterated maps. Phys. D (1993) 360-371
224. Klein F. Neue Beiträge zur Riemannschen Funktionentheorie. Math. Ann. 21 (1882-1883)
225. Kojima M. Computational methods for solving the nonlinear complementarity problem. Keio Engrg. Rep. 27 (1974) 1-41
226. 1 mappings in fixed points and complementarity theory. Math. Oper. Res. 3 (1978) 17-36
227. Kojima M. A complementarity pivoting approach to parametric programming. Math. Oper. Res. 4 (1979) 464-477
228. Kojima M., and Hirabayashi R. Sensitivity, stability and parametric analysis. Mathematical Programming Study 21 (1984), North-Holland, Setauket, NY 150-198
229. Kojima M., Megiddo N., and Mizuno S. A general framework of continuation methods for complementarity problems. Technical report (1990), IBM Almaden Research Center, Amsterdam
230. Reprint. Kojima M., Megiddo N., and Mizuno S. Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (1991), Tokyo Inst. of Techn., San Jose, CA
231. Kojima M., Megiddo N., and Noma T. Homotopy continuation methods for nonlinear complementarity problems. Math. Oper. Res. 16 (1991) 754-774
232. Kojima M., Megiddo N., Noma T., and Yoshise A. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science 538 (1991), Springer
233. Kojima M., Megiddo N., and Ye Y. An interior point potential reduction algorithm for the linear complementarity problem. Math. Programming 54 (1992) 267-279
234. Kojima M., Mizuno S., and Noma T. Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems. Math. Oper. Res. 15 (1990) 662-675
235. Kojima M., Mizuno S., and Yoshise A. A primal-dual interior point algorithm for linear programming. In: Megiddo N. (Ed). Progress in Mathematical Programming, Interior Point and Related Methods (1988), Springer, Berlin 29-47
236. Kojima M., Mizuno S., and Yoshise A. A polynomial-time algorithm for a class of linear complementarity problems. Math. Programming 44 (1989) 1-26
237. Kojima M., Mizuno S., and Yoshise A. An O(√nL) iteration potential reduction algorithm for linear complementarity problems. Math. Programming 50 (1991) 331-342
238. Kojima M., Nishino H., and Sekine T. An extension of Lemke's method to the piecewise linear complementarity problem. SIAM J. Appl. Math. 31 (1976) 600-613
239. Kojima M., and Yamamoto Y. Variable dimension algorithms: Basic theory, interpretation, and extensions of some existing methods. Math. Programming 24 (1982) 177-215
240. Kojima M., and Yamamoto Y. A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm. Math. Programming 28 (1984) 288-328
241. Kovach J.W., and Seider W.D. Heterogeneous azeotropic distillation - Homotopy-continuation methods. Comput. Chem. Engrg. 11 (1987) 593-605
242. Krasnosel'ski M.A. Topological Methods in the Theory of Nonlinear Integral Equations (1964), Pergamon Press, New York
243. Kubíček M. Algorithm 502. Dependence of solutions of nonlinear systems on a parameter. ACM Trans. Math. Software 2 (1976) 98-107
244. Kuhn H.W. Simplicial approximation of fixed points. Proc. Nat. Acad. Sci. USA 61 (1968) 1238-1242
245. Kuhn H.W. Approximate search for fixed points. In: Zadek L.A., Neustat L.W., and Balakrishnan A.V. (Eds). Computing Methods in Optimization Problems 2 (1969), Academic Press, New York 199-211
246. Preprint. Lagarias J.C., Melville R.C., and Geoghegan R. λ-threading homotopies and DC operating points of nonlinear circuits (1993)
247. Lemke C.E. Bimatrix equilibrium points and mathematical programming. Management Sci. 11 (1965) 681-689
248. Lemke C.E. A survey of complementarity theory. In: Cottle R.W., Gianessi F., and Lions J.L. (Eds). Variational Inequalities and Complentarity Problems (1980), Wiley, New York
249. Lemke C.E., and Grotzinger S.J. On generalizing Shapley's index theory to labelled pseudo manifolds. Math. Programming 10 (1976) 245-262
250. Lemke C.E., and Howson J.T. Equilibrium points of bimatrix games. SIAM J. Appl. Math. 12 (1964) 413-423
251. Li K., and Li T.-Y. An algorithm for symmetric tridiagonal eigen-problems - Divide and conquer with homotopy continuation. SIAM J. Sci. Statist. Comput. 14 (1993) 735-751
252. Li T.-Y., and Rhee N.H. Homotopy algorithm for symmetric eigenvalue problems. Numer. Math. 55 (1989) 265-280
253. Li T.-Y., Sauer T., and Yorke J.A. Numerical solution of a class of deficient polynomial systems. SIAM J. Numer. Anal. 24 (1987) 435-451
254. Li T.-Y., Sauer T., and Yorke J.A. The cheater's homotopy: An efficient procedure for solving systems of polynomial equations. SIAM J. Numer. Anal. 26 (1989) 1241-1251
255. Li T.-Y., and Wang X. Nonlinear homotopies for solving deficient polynomial systems with parameters. SIAM J. Numer. Anal. 29 (1993) 1104-1118
256. Li T.-Y., and Wang X. Solving real polynomial systems with real homotopies. Math. Comp. 60 (1993) 669-680
257. to appear. Li T.-Y., and Zeng Z. Homotopy-determinant algorithm for solving nonsymmetric eigenvalue problems. Math. Comp. (1992)
258. Li T.-Y., Zeng Z., and Cong L. Solving eigenvalue problems of real nonsymmetric matrices with real homotopies. SIAM J. Numer. Anal. 29 (1992) 229-248
259. Li T.-Y., Zhang H., and Sun X.-H. Parallel homotopy algorithm for the symmetric tridiagonal eigenvalue problem. SIAM J. Sci. Statist. Comput. 12 (1991) 469-487
260. Preprint. Li Y., and Lin Z. Constructive proof of the Poincaré-Birkhoff theorem (1994), Jilin University, London
261. Liu J.L., and Rheinboldt W.C. A posteriori error estimates for parametrized nonlinear equations. In: Wriggers P., and Wagner W. (Eds). Nonlinear Computational Mechanics (1991), Springer, China 31-46
262. Lundberg B.N., and Poore A.B. Variable order Adams-Bashforth predictors with an error-stepsize control for continuation methods. SIAM J. Sci. Statist. Comput. 12 (1991) 695-723
263. Lundberg B.N., and Poore A.B. Numerical continuation and singularity detection methods for parametric nonlinear programming. SIAM J. Optim. 3 (1993) 134-154
264. Lustig I.J., Marsten R.E., and Shanno D.F. The interaction of algorithms and architectures for interior point methods. Technical Report RRR 36-91 (1991), Rutgers Univ., Heidelberg
265. Lyness J.N. Quadrature over a simplex: Part 2. A representation for the error functional. SIAM J. Numer. Anal. 15 (1978) 870-887
266. to appear. Lyness J.N. Quadrature over curved surfaces by extrapolation. Math. Comp. (1993)
267. Mackens W. Numerical differentiation of implicitly defined space curves. Computing 41 (1989) 237-260
268. Marsten R., Subramanian R., Saltzman M., Lustig I.J., and Shanno D.F. Interior point methods for linear programming: Just call Newton, Lagrange and Fiacco and Mccormick!. Interfaces 20 (1990) 105-116
269. McCormick G.P., and Ritter K. Alternate proofs of the convergence properties of the conjugate-gradient method. J. Optim. Theory Appl. 13 (1974) 497-518
270. to appear. McQuain W.D., Ribbens C.J., Watson L.T., and Melville R.C. Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation. Comput. Math. Appl. (1993)
271. McShane K.A., Monma C.L., and Shanno D.F. An implementation of a primal-dual interior point method for linear programming. ORSA J. Comput. 1 (1989) 70-83
272. Megiddo N. Pathways to the optimal set in linear programming. In: Megiddo N. (Ed). Progress in Mathematical Programming, Interior Point and Related Methods (1988), Springer, New Brunswick, NJ 131-158
273. Megiddo N., and Shub M. Boundary behavior of interior point algorithms in linear programming. Math. Oper. Res. 14 (1989) 97-146
274. Mejia R. CONKUB: A conversational path-follower for systems of nonlinear equations. J. Comput. Phys. 63 (1986) 67-84
275. Mejia R. Interactive program for continuation of solutions of large systems of nonlinear equations. In: Allgower E.L., and Georg K. (Eds). Computational Solution of Nonlinear Systems of Equations. Lectures in Applied Mathematics 26 (1990), American Mathematical Society, New York 429-449
276. Melhem R.G., and Rheinboldt W.C. A comparison of methods for determining turning points of nonlinear equations. Computing 29 (1982) 201-226
277. Melville R., Moinian S., Feldmann P., and Watson L.T. Sframe: An efficient system for detailed DC simulation of bipolar analog integrated circuits using continuation methods. Analog Integr. Circuits Signal Process. 3 (1993) 163-180
278. to appear. Melville R.C., Trajkovic L., Fang S.-C., and Watson L.T. Globally convergent homotopy methods for the DC operating point problem. IEEE Trans. Comput. Aided Design (1993)
279. Menzel R., and Schwetlick H. Zur Lösung parameterabhängiger nichtlinearer Gleichungen mit singulären Jacobi-Matrizen. Numer. Math. 30 (1978) 65-79
280. Menzel R., and Schwetlick H. Parametrization via secant length and application to path following. Numer. Math. 47 (1985) 401-412
281. Merrill O. Applications and extensions of an algorithm that computes fixed points of a certain upper semi-continuous point to set mapping. PhD thesis (1972), Univ. of Michigan, Providence, RI
282. Milnor J.W. Singular Points of Complex Hypersurfaces (1968), Princeton Univ. Press, Ann Arbor, MI
283. Milnor J.W. Topology from the Differentiable Viewpoint (1969), Univ. Press of Virginia, Princeton, NJ
284. In: Mittelmann H.D., and Roose D. (Eds). Continuation Techniques and Bifurcation Problems. ISNM 92 (1990), Birkhäuser, Charlottesville, VA
285. Mizuno S. A new polynomial time method for a linear complementarity problem. Math. Programming 56 (1992) 31-43
286. to appear. Mizuno S., Todd M.J., and Ye Y. On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. (1992)
287. Mizuno S., Yoshise A., and Kikuchi T. Practical polynomial time algorithms for linear complementarity problems. J. Oper. Res. Soc. Japan 32 (1989) 75-92
288. Monteiro R.C., and Adler I. Interior path following primal-dual algorithms, I: Linear programming, II: Convex quadratic programming. Math. Programming 44 (1989) 27-66
289. Moore G., and Spence A. The calculation of turning points of nonlinear equations. SIAM J. Numer. Anal. 17 (1980) 567-576
290. Morgan A.P. A transformation to avoid solutions at infinity for polynomial systems. Appl. Math. Comput. 18 (1986) 77-86
291. Morgan A.P. Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems (1987), Prentice-Hall, Basel
292. Morgan A.P., and Sommese A.J. A homotopy for solving general polynomial systems that respects m-homogeneous structures. Appl. Math. Comput. 24 (1987) 101-113
293. Morgan A.P., and Sommese A.J. Coefficient parameter polynomial continuation. Appl. Math. Comput. 29 (1989) 123-160
294. Morgan A.P., Sommese A.J., and Wampler C.W. Computing singular solutions to nonlinear analytic systems. Numer. Math. 58 (1991) 669-684
295. Morgan A.P., Sommese A.J., and Wampler C.W. Computing singular solutions to polynomial systems. Adv. in Appl. Math. 13 (1992) 305-327
296. Morgan A.P., Sommese A.J., and Wampler C.W. A power series method for computing singular solutions to nonlinear analytic systems. Numer. Math. 63 (1993) 391-409
297. Morgan A.P., Sommese A.J., and Watson L.T. Finding all isolated solutions to polynomial systems using HOMPACK. ACM Trans. Math. Software 15 (1989) 93-122
298. Murtagh B.A., and Saunders M.A. MINOS 5.1 Users Guide (1987), Stanford Univ., Englewood Cliffs, NJ
299. Nazareth J.L. Homotopy techniques in linear programming. Algorithmica 1 (1986) 529-535
300. Nazareth J.L. The homotopy principle and algorithms for linear programming. SIAM J. Optim. 1 (1991) 316-332
301. Preprint. Nazareth J.L. A concise introduction to interior point methods for linear programming (1994)
302. Nazareth J.L. The implementation of linear programming algorithms based on homotopies. Algorithmica 15 (1994) 332-350
303. Nusse H.E., and Yorke J.A. DYNAMICS: Numerical Explorations (1994), Springer, CA
304. Ortega J.M., and Rheinboldt W.C. Iterative Solution of Nonlinear Equations in Several Variables (1970), Academic Press, New York
305. Parker T., and Chua L. Practical Numerical Algorithms for Chaotic Systems (1989), Springer, New York
306. Peitgen H.-O. Topologische Perturbationen beim globalen numerischen Studium nichtlinearer Eigenwert- und Verzweigungsprobleme. Jahresber. Deutsch. Math.-Verein. 84 (1982) 107-162
307. Peitgen H.-O., and Prüfer M. The Leray-Schauder continuation method is a constructive element in the numerical study of nonlinear eigenvalue and bifurcation problems. In: Peitgen H.-O., and Walther H.-O. (Eds). Functional Differential Equations and Approximation of Fixed Points. Lecture Notes in Math. 730 (1979), Springer, Berlin 326-409
308. Peitgen H.-O., and Schmitt K. Global topological perturbations in the study of nonlinear eigenvalue problems. Math. Methods Appl. Sci. 5 (1983) 376-388
309. Peitgen H.-O., and Siegberg H.W. An ε--perturbation of Brouwer's definition of degree. In: Fadell E., and Fournier G. (Eds). Fixed Point Theory. Lecture Notes in Math. 886 (1981), Springer, Berlin 331-366
310. Percell P. Note on a global homotopy. Numer. Funct. Anal. Optim. 2 (1980) 99-106
311. Poincaré H. Sur les Courbes Definé par une Équation Differentielle. I-IV. Oeuvres I (1886), Gauthier-Villars, Berlin
312. Polak E., Higgins J.E., and Mayne D.Q. A barrier function method for minimax problems. Math. Programming 54 (1992) 155-176
313. Polak E., and Ribière G. Note sur la convergence de méthodes de directions conjugées. Rev. Française Informat. Recherche Opérationnelle 3 (1969) 35-43
314. Pönisch G. Computing simple bifurcation points using a minimally extended system of nonlinear equations. Computing 35 (1985) 277-294
315. Pönisch G., and Schwetlick H. Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter. Computing 26 (1981) 107-121
316. Pönisch G., and Schwetlick H. Ein überlinear konvergentes Verfahren zur Bestimmung von Rückkehrpunkten implizit definierter Raumkurven. Numer. Math. 38 (1982) 455-466
317. Poore A.B., and Tiahrt C.A. Bifurcation problems in nonlinear parametric programming. Math. Programming 39 (1987) 189-205
318. Poore A.B., and Tiahrt C.A. A bifurcation analysis of the nonlinear parametric programming problem. Math. Programming 47 (1990) 117-141
319. Powell M.J.D. A Fortran subroutine for solving nonlinear algebraic equations. In: Rabinowitz P. (Ed). Numerical Methods for Nonlinear Algebraic Equations (1970), Gordon and Breach, Paris 115-161
320. Powell M.J.D. A hybrid method for nonlinear equations. In: Rabinowitz P. (Ed). Numerical Methods for Nonlinear Algebraic Equations (1970), Gordon and Breach, New York 87-114
321. Powell M.J.D. Restart procedures for the conjugate gradient method. Math. Programming 12 (1977) 241-254
322. Rabier P.J., and Reddien G.W. Characterization and computation of singular points with maximum rank deficiency. SIAM J. Numer. Anal. 23 (1986) 1040-1051
323. Rabinowitz P.H. Some global results for nonlinear eigenvalue problems. J. Funct. Anal. 7 (1971) 487-513
324. Rakowska J., Haftka R.T., and Watson L.T. An active set algorithm for tracing parametrized optima. Struct. Optim. 3 (1991) 29-44
325. Reinoza A. Solving generalized equations via homotopies. Math. Programming 31 (1985) 307-320
326. Renegar J. On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials. Math. Programming 32 (1985) 301-318
327. Renegar J. On the efficiency of Newton's method in approximating all zeros of systems of complex polynomials. Math. Oper. Res. 12 (1987) 121-148
328. Renegar J. A polynomial-time algorithm, based on Newton's method, for linear programming. Math. Programming 40 (1988) 59-93
329. Renegar J. Rudiments of an average case complexity theory for piecewise-linear path following algorithms. Math. Programming 40 (1988) 113-163
330. Renegar J., and Shub M. Unified complexity analysis for Newton LP methods. Math. Programming 53 (1992) 1-16
331. Rheinboldt W.C. Numerical methods for a class of finite dimensional bifurcation problems. SIAM J. Numer. Anal. 15 (1978) 1-11
332. Rheinboldt W.C. Solution fields of nonlinear equations and continuation methods. SIAM J. Numer. Anal. 17 (1980) 221-237
333. Rheinboldt W.C. Numerical analysis of continuation methods for nonlinear structural problems. Comput. & Structures 13 (1981) 103-113
334. Rheinboldt W.C. Numerical Analysis of Parametrized Nonlinear Equations (1986), Wiley, New York
335. Rheinboldt W.C. On a moving-frame algorithm and the triangulation of equilibrium manifolds. In: Küpper T., Seydel R., and Troger H. (Eds). Bifurcation: Analysis, Algorithms, Applications. ISNM 79 (1987), Birkhäuser, New York 256-267
336. Rheinboldt W.C. On a theorem of S. Smale about Newton's method for analytic mappings. Appl. Math. Lett. 1 (1988) 69-72
337. Rheinboldt W.C. On the computation of multi-dimensional solution manifolds of parametrized equations. Numer. Math. 53 (1988) 165-182
338. Rheinboldt W.C. On the theory and numerics of differential-algebraic equations. In: Light W. (Ed). Advances in Numerical Analysis (1992), Oxford Univ. Press, Basel 237-275
339. Rheinboldt W.C. On the sensitivity of solutions of parametrized equations. SIAM J. Numer. Anal. 30 (1993) 305-320
340. Rheinboldt W.C., and Burkardt J.V. Algorithm 596: A program for a locally-parametrized continuation process. ACM Trans. Math. Software 9 (1983) 236-241
341. Rheinboldt W.C., and Burkardt J.V. A locally-parametrized continuation process. ACM Trans. Math. Software 9 (1983) 215-235
342. Rheinboldt W.C., Roose D., and Seydel R. Aspects of continuation software. In: Roose D., De Dier B., and Spence A. (Eds). Continuation and Bifurcations: Numerical Techniques and Applications. NATO ASI Series C 313 (1990), Kluwer, Oxford, UK 261-268
343. Robinson S.M. Generalized equations. In: Bachem A., Grötschel M., and Korte B. (Eds). Mathematical Programming - The State of the Art (1983), Springer, Dordrecht 346-367
344. Robinson S.M. Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity. Math. Programming Study 30 (1987) 45-66
345. In: Roos C., and Vial J.-P. (Eds). Interior Point Methods for Linear Programming: Theory and Practice. Math. Programming 52 (1991), Mathematical Programming Society, North-Holland, Berlin
346. In: Roose D., de Dier B., and Spence A. (Eds). Continuation and Bifurcations: Numerical Techniques and Applications. NATO ASI Series C 313 (1990), Kluwer, Amsterdam
347. Saad Y., and Schultz M. GMRES: A generalized minimal residual method for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comp. 7 (1986) 856-869
348. Saigal R. Lemke's algorithm and a special linear complementarity problem. Oper. Res. 8 (1971) 201-208
349. Saigal R. Extension of the generalized complementarity problem. Math. Oper. Res. 1 (1976) 260-266
350. Saigal R. On the convergence rate of algorithms for solving equations that are based on methods of complementary pivoting. Math. Oper. Res. 2 (1977) 108-124
351. Saigal R. On piecewise linear approximations to smooth mappings. Math. Oper. Res. 4 (1979) 153-161
352. Saigal R. Computational complexity of a piecewise linear homotopy algorithm. Math. Programming 28 (1984) 164-173
353. Saigal R., and Todd M.J. Efficient acceleration techniques for fixed point algorithms. SIAM J. Numer. Anal. 15 (1978) 997-1007
354. Saupe D. On accelerating PL continuation algorithms by predictor-corrector methods. Math. Programming 23 (1982) 87-110
355. Scarf H.E. The approximation of fixed points of a continuous mapping. SIAM J. Appl. Math. 15 (1967) 1328-1343
356. Schwetlick H. Algorithms for finite-dimensional turning point problems from viewpoint to relationships with constrained optimization methods. In: Küpper T., Mittelmann H., and Weber H. (Eds). Numerical Methods for Bifurcation Problems (1984), Birkhäuser, Dordrecht 459-479
357. Schwetlick H. Effective methods for computing turning points of curves implicitly defined by nonlinear equations. In: Wakulicz A. (Ed). Computational Mathematics. Banach Center Publications 13 (1984), PWN, Basel 623-645
358. Schwetlick H., and Cleve J. Higher order predictors and adaptive stepsize control in path following algorithms. SIAM J. Numer. Anal. 24 (1987) 1382-1393
359. Seider W.D., Brengel D.D., and Widagdo S. Nonlinear analysis in process design. AIChE J. 37 (1991) 1-38
360. Sellami H., and Robinson S.M. A continuation method for normal maps. Technical Report 93-8 (1993), Department of Industrial Engineering, University of Wisconsin-Madison, Warsaw
361. Serre J.-P. Linear Representations of Finite Groups. Graduate Texts in Mathematics 42 (1977), Springer, Madison, WI
362. Seydel R. Numerical computation of branch points of nonlinear equations. Numer. Math. 33 (1979) 339-352
363. Seydel R. From Equilibrium to Chaos. Practical Bifurcation and Stability Analysis (1988), Elsevier, Berlin
364. Version 2.3+. Seydel R. BIFPACK: A program package for continuation, bifurcation and stability analysis (1991), University of Ulm, New York
365. Seydel R. On detecting stationary bifurcations. Internat. J. Bifurcation Chaos 1 (1991) 335-337
366. In: Seydel R., Schneider F.W., Küpper T., and Troger H. (Eds). Bifurcation and Chaos: Analysis, Algorithms, Applications. ISNM 97 (1991), Birkhäuser, Germany
367. Shampine L.F., and Gordon M.K. Computer Solutions of Ordinary Differential Equations. The Initial Value Problem (1975), Freeman and Co., Basel
368. Shapley L.S. A note on the Lemke-Howson algorithm. In: Balinski M.L. (Ed). Pivoting and Extensions: In Honor of A.W. Tucker. Math. Programming Study 1 (1974), North-Holland, San Francisco 175-189
369. Preprint. Shroff G.M., and Keller H.B. Stabilization of unstable procedures: A hybrid algorithm for continuation (1991)
370. Shroff G.M., and Keller H.B. Stabilization of unstable procedures: The recursive projection method. SIAM J. Numer. Anal. 30 (1993) 1099-1120
371. Shub M., and Smale S. Complexity of Bezout's theorem, I: Geometric aspects. IBM Research Report (1991)
372. Siyyam H.I. Numerical integration over implicitly defined curves. PhD thesis (1994), Colorado State University, New York
373. Smale S. A convergent process of price adjustement and global Newton methods. J. Math. Econom 3 (1976) 1-14
374. Smale S. Newton's method estimates from data at one point. The Merging of Disciplines in Pure, Applied and Computational Mathematics (1986), Springer, Fort Collins, CO 185-196
375. Sonnevend G. An analytical center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. Lecture Notes in Control and Information Sciences 84 (1985), Springer, New York 866-876
376. Sonnevend G., Stoer J., and Zhao G. On the complexity of following the central path of linear programs by linear extrapolation. Methods Oper. Res. 63 (1989) 19-31
377. Ser. B. Sonnevend G., Stoer J., and Zhao G. On the complexity of following the central path of linear programs by linear extrapolation II. In: Roos C., and Vial J.-P. (Eds). Interior Point Methods for Linear Programming: Theory and Practice. Math. Programming 52 (1991), Mathematical Programming Society, North-Holland, New York 527-553
378. Stiefel E. Two applications of group characters to the solution of boundary-value problems. J. Res. Nat. Bur. Standards 6 (1952) 424-427
379. Stiefel E., and Fässler A. Gruppentheorethische Methoden und ihre Anwendung (1979), Teubner, Amsterdam
380. Stoer J. Solution of large linear systems of equations by conjugate gradient type methods. In: Bachem A., Grötschel M., and Korte B. (Eds). Mathematical Programming: The State of the Art (1983), Springer, Stuttgart 540-565
381. Stroud A.H. Approximate Calculation of Multiple Integrals (1971), Prentice-Hall, Berlin
382. Talman A.J.J., and Yamamoto Y. A simplicial algorithm for stationary point problems on polytopes. Math. Oper. Res. 14 (1989) 383-399
383. Tanabe K. Continuous Newton-Raphson method for solving an underdetermined system of nonlinear equations. Nonlinear Anal. 3 (1979) 495-503
384. Tausch J. A generalization of the discrete Fourier transformation. In: Allgower E.L., Georg K., and Miranda R. (Eds). Exploiting Symmetry in Applied and Numerical Analysis. Lectures in Applied Mathematics 29 (1993), American Mathematical Society, Englewood Cliffs, NJ 405-412
385. Todd M.J. The Computation of Fixed Points and Applications. Lecture Notes in Economics and Mathematical Systems 124 (1976), Springer, Providence, RI
386. Todd M.J. Extensions of Lemke's algorithm for the linear complementarity problem. J. Optim. Theory Appl. 20 (1976) 397-416
387. Todd M.J. Orientation in complementary pivot algorithms. Math. Oper. Res. 1 (1976) 54-66
388. Todd M.J. Fixed-point algorithms that allow restarting without extra dimension. Technical Report (1978), Cornell University, Berlin
389. Todd M.J. On the Jacobian of a function at a zero computed by a fixed point algorithm. Math. Oper. Res. 3 (1978) 126-132
390. Todd M.J. A quadratically convergent fixed point algorithm for economic equilibria and linearly constrained optimization. Math. Programming 18 (1980) 111-126
391. Todd M.J. PLALGO: A FORTRAN implementation of a piecewise-linear homotopy algorithm for solving systems of nonlinear equations. School of Operations Research and Industrial Engineering (1981), Cornell University, Ithaca, NY
392. Todd M.J. On the computational complexity of piecewise-linear homotopy algorithms. Math. Programming 24 (1982) 216-224
393. Todd M.J. Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems. Math. Programming 35 (1986) 173-192
394. Todd M.J. Recent developments and new directions in linear programming. In: Iri N., and Tanabe K. (Eds). Mathematical Programming, Recent Developments and Applications (1989), Kluwer, Ithaca, NY 109-157
395. Ushida A., and Chua L.O. Tracing solution curves of nonlinear equations with sharp turning points. Internat. J. Circuit Theory Appl. 12 (1984) 1-21
396. 1.5n)L) arithmetic operations. Math. Programming 47 (1990) 175-202
397. Vanderbauwhede A. Local Bifurcation Theory and Symmetry (1982), Pitman, London
398. Van der Laan G., and Talman A.J.J. A restart algorithm for computing fixed points without an extra dimension. Math. Programming 17 (1979) 74-84
399. Van der Laan G., and Talman A.J.J. An improvement of fixed point algorithms by using a good triangulation. Math. Programming 18 (1980) 274-285
400. Van der Waerden B.L. Modern Algebra Vols. I and II (1953), Ungar, London
401. Van Loan C. Computational Frameworks for the Fast Fourier Transform. Frontiers in Applied Mathematics 10 (1992), SIAM, New York
402. Verlinden P., and Cools R. Proof of a conjectured asymptotic expansion for the approximation of surface integrals. Math. Comp. 63 (1994) 717-725
403. Verlinden P., and Haegemans A. Solving very deficient systems of polynomial equations by implicit elimination. Report TW 207 (1994), Katholieke Universiteit Leuven, Department of Computing Science, Philadelphia, PA
404. Verschelde J., and Cools R. Nonlinear reduction for solving deficient polynomial systems by continuation methods. Numer. Math. 63 (1992) 263-282
405. Verschelde J., and Cools R. Symbolic homotopy construction. Appl. Algebra Engrg., Commun. Comput. 4 (1994) 169-183
406. Verschelde J., and Cools R. Symmetric homotopy construction. J. Comput. Appl. Math. 50 (1994) 575-592
407. Preprint, Konrad-Zuse-Zentrum Berlin, SC 94-3. Verschelde J., and Gatermann K. Symmetric Newton polytopes for solving sparse polynomial systems (1994)
408. Verschelde J., and Haegemans A. The GBQ-algorithm for constructing start systems of homotopies for polynomial systems. SIAM J. Numer. Anal. 30 (1993) 583-594
409. Verschelde J., and Haegemans A. Homotopies for solving polynomial systems within a bounded domain. Theoret. Comput. Sci. 133 (1994) 165-185
410. Verschelde J., Verlinden P., and Cools R. Homotopies exploiting Newton polytopes for solving sparse polynomial systems. SIAM J. Numer. Anal. 31 (1994) 915-930
411. Walker H.F. Newton-like methods for underdetermined systems. In: Allgower E.L., and Georg K. (Eds). Computational Solution of Nonlinear Systems of Equations. Lectures in Applied Mathematics 26 (1990), American Mathematical Society, Leuven, Belgium 679-700
412. Wampler C.W., and Morgan A.P. Solving the 6R inverse position problem using a generic-case solution methodology. Mech. Mach. Theory 26 (1991) 91-106
413. Wampler C.W., Morgan A.P., and Sommese A.J. Numerical continuation methods for solving polynomial systems arising in kinematics. ASME J. Design 112 (1990) 59-68
414. Wampler C.W., Morgan A.P., and Sommese A.J. Complete solution of the nine-point path synthesis problem for four-bar linkages. ASME J. Mech. Design 114 (1992) 153-159
415. Watkins D.S. Isospectral flows. SIAM Rev. 26 (1984) 379-391
416. Watson L.T., Billups S.C., and Morgan A.P. HOMPACK: A suite of codes for globally convergent homotopy algorithms. ACM Trans. Math. Software 13 (1987) 281-310
417. Wayburn T.L. A review of continuation methods and their application to separations problems. AIChE Comput. Sys. Tech. 11 (1982) 8-22
418. Wayburn T.L., and Seader J.D. Homotopy continuation methods for computer-aided process design. Comput. Chem. Engrg. 11 (1987) 7-25
419. Weber H. On the numerical approximation of secondary bifurcation problems. In: Allgower E.L., Glashoff K., and Peitgen H.-O. (Eds). Numerical Solution of Nonlinear Equations. Lecture Notes in Math. 878 (1981), Springer, Providence, RI 407-425
420. Werner B. Test functions for bifurcation points and Hopf points in problems with symmetries. In: Allgower E.L., Böhmer K., and Golubitsky M. (Eds). Bifurcation and Symmetry. ISNM 104 (1992), Birkhäuser, New York 317-327
421. Werner B., and Spence A. The computation of symmetry-breaking bifurcation points. SIAM J. Numer. Anal. 21 (1984) 388-399
422. 3 (1990), Colorado State University, Basel
423. Preprint. Widmann R. Efficient triangulation of 3-dimensional domains (1990), Colorado State University
424. Winters K.H. A bifurcation study of laminar flow in a curved rectangular cross-section. J. Fluid Mech. 180 (1987) 343-369
425. Winters K.H. Bifurcation and stability: A computational approach. Comput. Phys. Commun. 65 (1991) 299-309
426. Winters K.H., and K.A. The prediction of critical points for thermal explosions in a finite volume. Combust. Flame 62 (1985) 13-20
427. Winters K.H., Cliffe K.A., and Jackson C.P. The prediction of instabilities using bifurcation theory. In: Lewis R.W., Hinton E.P., Bettess P., and Schrefler B.A. (Eds). Numerical Methods for Transient and Coupled Problems (1987), Wiley 179-198
428. Winters K.H., Myerscough M.R., and Maini P.K. Tracking bifurcating solutions of a model biological pattern generator. Impact Comput. Sci. Eng. 2 (1990) 355-371
429. Wright A.H. The octahedral algorithm, a new simplicial fixed point algorithm. Math. Programming 21 (1981) 47-69
430. Wright A.H. Finding all solutions to a system of polynomial equations. Math. Comp 44 (1985) 125-133
431. Wright M.H. Interior methods for constrained optimization. Acta Numer. 1 (1992) 341-407
432. Yang Z.-H., and Keller H.B. A direct method for computing higher order folds. SIAM J. Sci. Statist. Comput. 7 (1986) 351-361
433. Ye Y., Güler O., Tapia R.A., and Zhang Y. A quadratically convergent O(√nL)-iteration algorithm for linear programming. Math. Programming 59 (1991) 151-162