Skip to main content

Part of the book series: NATO ASI Series ((ASIC,volume 313))

Abstract

In recent years, many continuation algorithms have been implemented. In order to assess the various aspects of these codes, this paper presents a list of features and options that appear to be necessary or desirable for continuation codes. With this it is hoped to provide a framework for writing further such codes, and for judging their differences.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allgower, E.L., Schmidt, P.H. (1985) An algorithm for piecewise-linear approximation of an implicitly defined manifold. SI AM J. Numer. Anal. 22, 322–346.

    Article  MathSciNet  MATH  Google Scholar 

  2. Bank, R.E. (1988) PLTMG User’s Guide — Edition 5. 0. University of California, La Jolla.

    Google Scholar 

  3. Deufihard, P., Fiedler, B., Kunkel, P. (1987) Efficient numerical path-following beyond critical points. SIAM J.Numer.Anal. 24, 912–927.

    Article  MathSciNet  Google Scholar 

  4. Doedel, E. (1986) AUTO: Software for continuation and bifurcation problems in ordinary differential equations. California Institute of Technology, Pasadena.

    Google Scholar 

  5. Kaas-Peterson, C. (1987) PATH — User’s Guide. University at Leeds, Centre for nonlinear studies.

    Google Scholar 

  6. Morgan, A. (1987) Solving Polynomial Systems Using Continuation. Prentice Hall, Englewood.

    MATH  Google Scholar 

  7. Rheinboldt, W.C. (1986) Numerical Analysis of Parametrized Nonlinear Equations. J.Wiley, New York.

    MATH  Google Scholar 

  8. Rheinboldt, W.C. (1988) On the computation of multi-dimensional solution manifolds of parametrized equaitions. Numer.Math. 53, 165–181.

    Article  MathSciNet  MATH  Google Scholar 

  9. Rheinboldt, W.C., Burkardt, J. (1983) A locally parametrized continuation process. ACM Transactions of Math. Software 9, 215–235.

    Article  MathSciNet  MATH  Google Scholar 

  10. Rosendorf, P., Orsag, J., Schreiber, I., Maxek, M. (1989) Interactive System for Studies in Nonlinear Dynamics. Prague Institute of Chemical Technology, Prague.

    Google Scholar 

  11. Seydel, R. (1988) From Equilibrium to Chaos. Practical Bifurcation and Stability Analysis. Elsevier, New York.

    Google Scholar 

  12. Seydel, R. (1989) BIFPACK, a program package for continuation, bifurcation, and stability analysis. University at Würzburg.

    Google Scholar 

  13. Watson, L.T., Billups, S.C., Morgan, A.P. (1987) HOMPACK: A suite of codes for globally convergent homotopy algorithms. ACM Transactions on Math. Software 13, 281–310.

    Article  MathSciNet  MATH  Google Scholar 

  14. Wood, E.F., Kempf, J.A., Mehra, R.K. (1984) BISTAB: A portable bifurcation and stability analysis package. Appl. Math. Comp. 15 (1984) 343–355.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Kluwer Academic Publishers

About this chapter

Cite this chapter

Rheinboldt, W.C., Roose, D., Seydel, R. (1990). Aspects of Continuation Software. In: Roose, D., Dier, B.D., Spence, A. (eds) Continuation and Bifurcations: Numerical Techniques and Applications. NATO ASI Series, vol 313. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0659-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-0659-4_17

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6781-2

  • Online ISBN: 978-94-009-0659-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics