Skip to main content

Result-Verifying Solution of Nonlinear Systems in the Analysis of Chemical Processes

  • Conference paper
Numerical Software with Result Verification

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2991))

Abstract

A framework for the verified solution of nonlinear systems arising in the analysis and design of chemical processes is described. The framework combines a symbolic preprocessing step with an interval–based branch–and–bound solver whose efficiency is increased with several acceleration techniques. One of these methods is based on order–2 Taylor expansion; it is also discussed in this note.

This work was supported by the VolkswagenStiftung within the project “Konstruktive Methoden der Nichtlinearen Dynamik zum Entwurf verfahrenstechnischer Prozesse”, Geschäftszeichen I/79 288.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Uppal, A., Ray, W.H., Poore, A.B.: On the dynamic behavior of continuous stirred tank reactors. Chem. Engng Sci. 29, 967–985 (1974)

    Article  Google Scholar 

  2. Bischof, C.H., Lang, B., Marquardt, W., Mönnigmann, M.: Verified determination of singularities in chemical processes. In: Krämer, W., Wolff von Gudenberg, J. (eds.) Scientific Computing, Validated Numerics, Interval Methods, pp. 305–316. Kluwer Academic/Plenum Publishers (2001)

    Google Scholar 

  3. Golubitsky, M., Schaeffer, D.G.: Singularities and Groups in Bifurcation Theory, vol. I. Springer, New York (1985)

    MATH  Google Scholar 

  4. Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers, Dordrecht (1996)

    MATH  Google Scholar 

  5. Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

  6. Schulte Althoff, K.: Algorithmen zum verifizierten Lösen nichtlinearer Gleichungs-systeme. Diploma thesis, Aachen University, Germany (2002)

    Google Scholar 

  7. Charniak, E., Riesback, C., McDermott, D.: Artificial Intelligence Programming, 2nd edn. Lawrence Erlbaum Associates, Hillsdale (1987)

    Google Scholar 

  8. Ratz, D.: Automatic Slope Computation and its Application in Nonsmooth Global Optimization. Shaker Verlag, Aachen (1998)

    Google Scholar 

  9. Griewank, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. SIAM, Philadelphia (2000)

    MATH  Google Scholar 

  10. Oliveira, J.B.: New slope methods for sharper interval functions and a note on Fischer’s acceleration method. Reliable Computing 2, 299–320 (1996)

    Article  MATH  Google Scholar 

  11. Beelitz, T.: Methoden zum Einschluss von Funktions- und Ableitungswerten. Diploma thesis, Aachen University, Germany (2002)

    Google Scholar 

  12. Berz, M., Hofstätter, G.: Computation and application of Taylor polynomials with interval remainder bounds. Reliable Computing 4, 83–97 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Berz, M.: COSY INFINITY version 8.1 programming manual. Technical Report MSUHEP-20703, East Lansing, MI (2002)

    Google Scholar 

  14. Kienitz, A.: Untersuchungen zum Einsatz von Taylormodellen bei der verifizierten Lösung von Gleichungssystemen. Diploma thesis, Aachen University, Germany (2003)

    Google Scholar 

  15. Klatte, R., Kulisch, U., Wiethoff, A., Lawo, C., Rauch, M.: C-XSC — A C++ Class Library for Extended Scientific Computing. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  16. Sun Microsystems: C++ Interval Arithmetic Programming Reference (2002)

    Google Scholar 

  17. Goldberg, D.: What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys 23, 5–48 (1991)

    Article  Google Scholar 

  18. Morgan, A., Shapiro, V.: Box-bisection for solving second-degree systems and the problem of clustering. ACM Trans. Math. Software 13, 152–167 (1987)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beelitz, T., Bischof, C., Lang, B., Althoff, K.S. (2004). Result-Verifying Solution of Nonlinear Systems in the Analysis of Chemical Processes. In: Alt, R., Frommer, A., Kearfott, R.B., Luther, W. (eds) Numerical Software with Result Verification. Lecture Notes in Computer Science, vol 2991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24738-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24738-8_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21260-7

  • Online ISBN: 978-3-540-24738-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics