skip to main content
article
Free Access

Intelligence in scientific computing

Published:01 May 1989Publication History
Skip Abstract Section

Abstract

The authors discuss the development of intelligent techniques appropriate for the automatic preparation, execution, and control of numerical experiments.

References

  1. 1 Abelson, H., Halfant, M., Katzenelson, J., and Sussman, G.J. The Lisp experience. Annual Rev. Comp. Sci., vol 3., Annual Reviews, Palo Alto, '1988, 167-195.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Abelson, H., and Sussman, G.J. The Dynamicist's Workbench I: Automatic preparation of numerical experiments. MIT Artificial Intelligence Laboratory Memo 955, May '1987.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Abramowitz, M., and Stagun, I. Handbook of Mathematical Functions. Dover Publications, 1965.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Applegate, J., Douglas, M., Gfirsel, Y.. Hunter, P., Seitz, C., Sussman, G.J. A digital orrery. IEEE Trans. Cornp. C-34, 9 (Sept. 1985), pp. 822-83'1.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Baase, S. Computer Algorithms. Addison-Wesley, 1978.]]Google ScholarGoogle Scholar
  6. 6 Feinberg, M. Chemical oscillations, multiple equilibria, and reaction network structure. In Dynamics and Modelling of Reactive Systems, W. Stewart, W.H. Ray and C. Conley, Eds. Academic Press, New York, 1980, pp. 59-130.]]Google ScholarGoogle ScholarCross RefCross Ref
  7. 7 Franceschini, V. Two models of truncated Navier-Stokes equations on a two-dimensional lorus. Phys. Fluids 26, 2 (Feb. 1983), 433-447.]]Google ScholarGoogle ScholarCross RefCross Ref
  8. 8 Halfant, M., and Sussman, G.J. Abstraction in Numerical Methods. In Proceedings of ACM Conference on Lisp and Functional Programming (Aug. 1988}, pp. 1-7.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 H(~non, M. Numerical study of quadratic area-preserving mappings.]]Google ScholarGoogle Scholar
  10. 10 Gelernler, H. Realization of a geometry theorem proving machine. In Proceedings of the International Conference on Information Processing (Paris 1959), pp. 273-282: also in Computers and Thought. E. Feigenbaum and J. Feldman Eds. McGraw-Hill, New York, 1963, 134-152.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Guckenheimer J., and Holmes, P. Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields. Springer-Verlag, 1983.]]Google ScholarGoogle ScholarCross RefCross Ref
  12. 12 Hsu, C.S. A theory of index for point mapping dynamical systems. J. Applied Mechanics 47 (1980), 185-190.]]Google ScholarGoogle ScholarCross RefCross Ref
  13. 13 Hsu, C.S., Cheng, W.H., and Yee, H.C. Steady-state response of a non-linear system under impulsive parametric excitation. J. Sound and Vibration 50 (1977), 95-116.]]Google ScholarGoogle ScholarCross RefCross Ref
  14. 14 Kinoshita, H., and Nakai, H. Motions of the perihelions of Neptune and Pluto. Celestial Mechanics 34, 203 ('1984}.]]Google ScholarGoogle Scholar
  15. 15 Laidler, K. Chemical Kinetics (3rd edition). Harper & Row, New York, 1987.]]Google ScholarGoogle Scholar
  16. 16 MacKay, R. Renormalization in Area-Preserving Maps, Ph.D. dissertation, Princeton University, 1982.]]Google ScholarGoogle Scholar
  17. 17 McCormick, B., Desanti, T., and Brown, M. Eds. Visualization in scientific computing. Comp. Graph. 21, 6 (1987).]]Google ScholarGoogle Scholar
  18. 18 Nevins, A.J. Plane geometry theorem proving using forward chaining. MIT Artificial Intelligence Laboratory, Memo, no. 303, January 1974.]]Google ScholarGoogle Scholar
  19. 19 Novak, G. Represenlalions of knowledge in a program for solving physics problems. In Proceedings of the 5th IJCAI (Cambridge, Mass. 1977), pp. 286-291.]]Google ScholarGoogle Scholar
  20. 20 Roylance, G.L. Expressing mathematical subroutines constructively. In Proceedings of ACM Conference on Lisp and Functional Programming (Aug. '1988), pp. 8-'13.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21 Sacks, E.P. Hierarchical reasoning about inequalities. AAAI (1987), 649-654.]]Google ScholarGoogle Scholar
  22. 22 Sacks, E.P. Piecewise linear reasoning. AAAI (1987), 655-659.]]Google ScholarGoogle Scholar
  23. 23 Sacks, E.P. Automatic qualitative analysis of ordinary differential equations using piecewise linear approximalions. MIT Laboralory for Computer Science, Tech. Rep. 416, March 1988.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. 24 Sussman, G.J., and St~.llman, R.M. Heuristic techniques in computer-aided circuit ar aly:;is. IEEE Trans. Circuits and Systems, CAS-22 (Nov. 1975), 857-865.]]Google ScholarGoogle ScholarCross RefCross Ref
  25. 25 Sussman, G.J., and W: sdom. J. Numerical evidence that the motion of Pluto is chaotic. Sc, ence 241, 22 (Jul. 1988), 433-437.]]Google ScholarGoogle Scholar
  26. 26 Thompson, J.M.T. Co~nplex dynamics of compliant offshore structure:~. In Proceedings of the Royal Society of London A, 387 (1983), pp. 407-427.]]Google ScholarGoogle ScholarCross RefCross Ref
  27. 27 Thompson, J.M.T., an t Stgwart, H.B. Nonlinear Dynamics and Chaos. Wiley, New York, 19~ 6.]]Google ScholarGoogle Scholar
  28. 28 Waltz, D.A. Generatir g s~..mantic descriptions from drawings of scenes with shadows. In The Psychology of Computer Vision. P.H. Winston, Ed. McGra,a-Hill, New York, 1985.]]Google ScholarGoogle Scholar
  29. 29 Witkin, A.P. Scale-sp~ ce filtering, IJCAI-83.]]Google ScholarGoogle Scholar
  30. 30 Yip, K. Extracting qualitative dynamics from numerical experimenl:s, AAAI 1987.]]Google ScholarGoogle Scholar
  31. 31 Yip, K. Generating glc hal behaviors using deep knowledge of local dynamics, AAAI 1988]]Google ScholarGoogle Scholar
  32. 32 Zahr., C.T. Graph-the~ret ical methods for detecting and describing Gestalt clusters. IEEE Frans. Comp. C-20 (Jan. 1971).]]Google ScholarGoogle Scholar
  33. 33 Zhao, F. An O(N) algorithm for three-dimensional N-body simulations. Tech. Rept. 995 MIT Artificial Intelligence Laboratory, 1987.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Intelligence in scientific computing

            Recommendations

            Reviews

            Allan Blackman

            The scope of this paper is a good deal narrower than its title would suggest. Although the authors touch on some larger AI issues, they focus mainly on programs they have developed that prepare, execute, and interpret numerical simulations in the physical sciences, especially in dynamics. The authors do not claim to have achieved any breakthroughs in AI technology; rather, they have applied current methods to their domain knowledge, resulting in expert systems of interest principally to certain scientists and engineers. This paper begins with a remarkable dialogue between an ocean engineer designing an offshore mooring tower for large ships and a computer assistant. The ability of the computer to understand what the engineer requires and to respond intelligently se<__?__Pub Caret>ems too good to be true. Of course, it is: the dialogue is fictional, offered as an illustration of what might someday exist. How much less intelligent than this ideal assistant are the authors' extant systems__?__ Only after working dynamicists have given them an extended trial will the verdict be in.

            Access critical reviews of Computing literature here

            Become a reviewer for Computing Reviews.

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image Communications of the ACM
              Communications of the ACM  Volume 32, Issue 5
              May 1989
              88 pages
              ISSN:0001-0782
              EISSN:1557-7317
              DOI:10.1145/63485
              Issue’s Table of Contents

              Copyright © 1989 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 May 1989

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader