Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-12-05T02:44:18.300Z Has data issue: false hasContentIssue false

Contributions to computational analysis

Published online by Cambridge University Press:  17 April 2009

H-J. Dobner
Affiliation:
Mathematisches Institut IIUniversität Karlsruhe (TH)KaiserstrasseD–7500 Karlsruhe 1Federal Republic of Germany
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper some new results concerning computational analysis are established. The fundamental concepts of interval analysis and fixed point theorems suitable for computational purposes are developed and applied to concrete examples illustrating this new method of proving mathematical statements.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1990

References

[1]Alefeld, G. and Herzberger, J., Introduction to interval computing (Academic Press, New York, London, 1983).Google Scholar
[2]Kaucher, E. and Miranker, W.L., Self validating numerics for function space problems (Academic Press, New York, London, 1984).Google Scholar
[3]Kulisch, U. (ed.), PASCAL-SC. A PASCAL-SC Extension for scientific computation; Information manual and floppy disks, version IBM PC (Teubner and Wiley, Stuttgart, Chichester, 1987).Google Scholar
[4]Landford, O.E. III, ‘A computer-assisted proof of the Feigenbaum conjectures’, Bull. Amer. Math. Soc. (N.S.) 6 (1982), 427434.CrossRefGoogle Scholar
[5]Rump, S.M., ‘Solving algebraic problems with high accuracy’, in Proceedings of the IBM symposium: A new approach to scientific computation, Editors Kulisch, U. and Miranker, W.L. (Academic Press, New York, London, 1983).Google Scholar