[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
Skip header Section
Mathematica: a system for doing mathematics by computerJune 1988
Publisher:
  • Addison-Wesley Longman Publishing Co., Inc.
  • 75 Arlington Street, Suite 300 Boston, MA
  • United States
ISBN:978-0-201-19330-5
Published:01 June 1988
Pages:
749
Skip Bibliometrics Section
Reflects downloads up to 20 Dec 2024Bibliometrics
Abstract

No abstract available.

Cited By

  1. Roberts G and Rosenthal J (2019). Hitting Time and Convergence Rate Bounds for Symmetric Langevin Diffusions, Methodology and Computing in Applied Probability, 21:3, (921-929), Online publication date: 1-Sep-2019.
  2. Roberts G and Rosenthal J (2011). Quantitative Non-Geometric Convergence Bounds for Independence Samplers, Methodology and Computing in Applied Probability, 13:2, (391-403), Online publication date: 1-Jun-2011.
  3. Macedo H and Oliveira J Matrices as arrows! Proceedings of the 10th international conference on Mathematics of program construction, (271-287)
  4. ACM
    Zeleznik R, Miller T and Li C Designing UI techniques for handwritten mathematics Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling, (91-98)
  5. Norkin B (2005). The method of successive approximations for calculating the probability of bankruptcy of a risk process in a Markovian environment, Cybernetics and Systems Analysis, 40:6, (917-927), Online publication date: 1-Jan-2005.
  6. Grabmeier J, Kaltofen E and Weispfenning V Cited References Computer algebra handbook, (493-622)
  7. Bar-Noy A and Ladner R Windows scheduling problems for broadcast systems Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (433-442)
  8. ACM
    Memon A, Soffa M and Pollack M Coverage criteria for GUI testing Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering, (256-267)
  9. ACM
    Memon A, Soffa M and Pollack M (2019). Coverage criteria for GUI testing, ACM SIGSOFT Software Engineering Notes, 26:5, (256-267), Online publication date: 1-Sep-2001.
  10. Holmes M and Alves-Foss J (2019). The Watson Theorem Prover, Journal of Automated Reasoning, 26:4, (357-408), Online publication date: 1-May-2001.
  11. Théry L (2019). A Machine-Checked Implementation of Buchberger's Algorithm, Journal of Automated Reasoning, 26:2, (107-137), Online publication date: 1-Feb-2001.
  12. Frayssé V, Gratton S and Toumazou V (2000). Structured Backward Error and Condition Number for Linear Systems of the Type A* Ax = b , BIT, 40:1, (74-83), Online publication date: 1-Mar-2000.
  13. Das S and Sundaram R (2019). A Discrete-Time Approach to Arbitrage-Free Pricing of Credit Derivatives, Management Science, 46:1, (46-62), Online publication date: 1-Jan-2000.
  14. Aitken W, Constable R and Underwood J (1999). Metalogical Frameworks II, Journal of Automated Reasoning, 22:2, (171-221), Online publication date: 1-Feb-1999.
  15. Clarke E, German S and Zhao X (2019). Verifying the SRT Division Algorithm Using Theorem Proving Techniques, Formal Methods in System Design, 14:1, (7-44), Online publication date: 1-Jan-1999.
  16. Bauer A, Clarke E and Zhao X (1998). Analytica – An Experiment in Combining Theorem Proving and Symbolic Computation, Journal of Automated Reasoning, 21:3, (295-325), Online publication date: 1-Dec-1998.
  17. Ganley J and Salowe J (2018). The power-pSteiner tree problem, Nordic Journal of Computing, 5:2, (115-127), Online publication date: 1-Jun-1998.
  18. Rosenberger R and Huss S A systems theoretic approach to behavioural modeling and simulation of analog functional blocks Proceedings of the conference on Design, automation and test in Europe, (721-728)
  19. Hartley R (2019). Chirality, International Journal of Computer Vision, 26:1, (41-61), Online publication date: 1-Jan-1998.
  20. Landwehr B and Marwedel P A new optimization technique for improving resource exploitation and critical path minization Proceedings of the 10th international symposium on System synthesis, (65-72)
  21. Schwarz E and Flynn M (1996). Hardware Starting Approximation Method and Its Application to the Square Root Operation, IEEE Transactions on Computers, 45:12, (1356-1369), Online publication date: 1-Dec-1996.
  22. Gratton S (1996). On the condition number of linear least squares problems in a weighted Frobenius norm, BIT, 36:3, (523-530), Online publication date: 1-Sep-1996.
  23. Alur R, Henzinger T and Ho P (1996). Automatic Symbolic Verification of Embedded Systems, IEEE Transactions on Software Engineering, 22:3, (181-201), Online publication date: 1-Mar-1996.
  24. ACM
    van Engelen R, Wolters L and Cats G CTADEL Proceedings of the 10th international conference on Supercomputing, (86-93)
  25. Tal A and Dobkin D (1995). Visualization of Geometric Algorithms, IEEE Transactions on Visualization and Computer Graphics, 1:2, (194-204), Online publication date: 1-Jun-1995.
  26. ACM
    Soiffer N Mathematical typesetting in Mathematica Proceedings of the 1995 international symposium on Symbolic and algebraic computation, (140-149)
  27. ACM
    Fitzgerald S and Place J (1995). Teaching elementary queueing theory with a computer algebra system, ACM SIGCSE Bulletin, 27:1, (350-354), Online publication date: 15-Mar-1995.
  28. ACM
    Fitzgerald S and Place J Teaching elementary queueing theory with a computer algebra system Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, (350-354)
  29. Olsen D, Monk A and Curry M (2018). Algorithms for automatic dialogue analysis using propositional production systems, Human-Computer Interaction, 10:1, (39-78), Online publication date: 1-Mar-1995.
  30. Tal A and Dobkin D GASP Proceedings of the conference on Visualization '94, (149-155)
  31. ACM
    Kajler N and Soiffer N (1994). Some human interaction issues in computer algebra, ACM SIGCHI Bulletin, 26:4, (64-69), Online publication date: 1-Oct-1994.
  32. Staringer W (2018). Constructing Applications from Reusable Components, IEEE Software, 11:5, (61-68), Online publication date: 1-Sep-1994.
  33. ACM
    Kajler N and Soiffer N (1994). Some human interaction issues in computer algebra, ACM SIGSAM Bulletin, 28:1, (18-28), Online publication date: 1-Mar-1994.
  34. Danzig P (2019). Flow Control for Limited Buffer Multicast, IEEE Transactions on Software Engineering, 20:1, (1-12), Online publication date: 1-Jan-1994.
  35. ACM
    Kajler N User interfaces for symbolic computation Proceedings of the 6th annual ACM symposium on User interface software and technology, (1-10)
  36. ACM
    Shute M (1993). Abotec, ACM SIGPLAN Notices, 28:8, (90-98), Online publication date: 1-Aug-1993.
  37. ACM
    Bern M, Greene D and Raghunathan A On-line algorithms for cache sharing Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (422-430)
  38. ACM
    Gray W, Spohrer J and Green T (1993). End-user programming language, ACM SIGCHI Bulletin, 25:2, (46-50), Online publication date: 1-Apr-1993.
  39. ACM
    Berque D, Goldberg M and Edmonds J Implementing progress indicators for recursive algorithms Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (533-538)
  40. ACM
    Deo N, Medidi M and Prasad S Processor allocation in parallel battlefield simulation Proceedings of the 24th conference on Winter simulation, (718-725)
  41. ACM
    Théry L, Bertot Y and Kahn G (2019). Real theorem provers deserve real user-interfaces, ACM SIGSOFT Software Engineering Notes, 17:5, (120-129), Online publication date: 1-Nov-1992.
  42. ACM
    Théry L, Bertot Y and Kahn G Real theorem provers deserve real user-interfaces Proceedings of the fifth ACM SIGSOFT symposium on Software development environments, (120-129)
  43. ACM
    Kajler N CAS/PI Papers from the international symposium on Symbolic and algebraic computation, (376-386)
  44. ACM
    Kass M (1992). CONDOR: constraint-based dataflow, ACM SIGGRAPH Computer Graphics, 26:2, (321-330), Online publication date: 1-Jul-1992.
  45. ACM
    Kass M CONDOR: constraint-based dataflow Proceedings of the 19th annual conference on Computer graphics and interactive techniques, (321-330)
  46. ACM
    Chamberlain R and Fiduccia C Universality of iterated networks Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, (80-89)
  47. ACM
    Stevenson D Frontiers for computer science in computational science Proceedings of the 30th annual ACM Southeast Regional Conference, (203-210)
  48. ACM
    Carroll J (1992). The role of computer software in numerical analysis teaching, ACM SIGNUM Newsletter, 27:2, (2-31), Online publication date: 1-Apr-1992.
  49. ACM
    Smedley T Using pictorial and object oriented programming for computer algebra Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's, (1243-1247)
  50. Slamani M and Kaminska B (1992). Analog Circuit Fault Diagnosis Based on Sensitivity Computation and Functional Testing, IEEE Design & Test, 9:1, (30-39), Online publication date: 1-Jan-1992.
  51. ACM
    Takahashi S, Matsuoka S, Yonezawa A and Kamada T A general framework for Bi-directional translation between abstract and pictorial data Proceedings of the 4th annual ACM symposium on User interface software and technology, (165-174)
  52. ACM
    Wilk M (2019). Equate, ACM SIGPLAN Notices, 26:11, (286-298), Online publication date: 1-Nov-1991.
  53. ACM
    Wilk M Equate Conference proceedings on Object-oriented programming systems, languages, and applications, (286-298)
  54. ACM
    Phillips R (1991). MediaView, Communications of the ACM, 34:7, (74-83), Online publication date: 1-Jul-1991.
  55. Phillips R (2018). An Interpersonal Multimedia Visualization System, IEEE Computer Graphics and Applications, 11:3, (20-27), Online publication date: 1-May-1991.
  56. ACM
    Barnett M (1991). Some simple ways to construct and to use formulas mechanically, ACM SIGSAM Bulletin, 25:2, (28-36), Online publication date: 1-Apr-1991.
  57. Fati V (1990). Multiparameter direct variational solutions for linear dissipative oscillators, Mathematical and Computer Modelling: An International Journal, 14, (87-92), Online publication date: 31-Dec-1991.
  58. Phillips R An interpersonal multimedia visualization system Proceedings of the 1st conference on Visualization '90, (338-341)
  59. ACM
    Fateman R (1990). A lisp-language Mathematica-to-lisp translator, ACM SIGSAM Bulletin, 24:2, (19-21), Online publication date: 1-Apr-1990.
  60. ACM
    Fishwick P Neural network models in simulation: a comparison with traditional modeling approaches Proceedings of the 21st conference on Winter simulation, (702-709)
  61. ACM
    McDonald J (2019). Object-oriented programming for linear algebra, ACM SIGPLAN Notices, 24:10, (175-184), Online publication date: 1-Oct-1989.
  62. ACM
    McDonald J Object-oriented programming for linear algebra Conference proceedings on Object-oriented programming systems, languages and applications, (175-184)
  63. ACM
    Char B Automatic reasoning about numerical stability of rational expressions Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, (234-241)
  64. ACM
    Fateman R Lookup tables, recurrences and complexity Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, (68-73)
  65. Lindberg B (1989). Variable stepsize in Cowell's method, BIT, 29:2, (369-371), Online publication date: 1-Jun-1989.
  66. ACM
    Fateman R and Ponder C (1989). Speed and data structures in computer algebra systems, ACM SIGSAM Bulletin, 23:2, (8-11), Online publication date: 1-May-1989.
Contributors
  • Wolfram Research, Inc.

Reviews

Mathematica is a general-purpose program to perform mathematical computations that was created by Wolfram Research Inc. The system is designed for use in both educational and professional settings. The basic system can do symbolic, graphical, and numerical computations and includes a comprehensive programming language that extends its capabilities. Some versions of the system can create “mathematical notebooks” that document mathematical calculations. These notebooks can include text and graphics along with Mathematica input and output. Mathematica has aroused much interest in the mathematical and scientific communities, and reviews of the system have appeared in both the popular and the scientific presses [1–4]. It has even been described as “the first system to tackle all of mathematics.” A more sober appraisal would describe it as a new computer algebra system, similar to MACSYMA, MAPLE, SMP, muMath, DERIVE, or REDUCE, that has a moderate amount of symbolic power, extensive graphical capabilities, and some numerical capabilities. The system has a nice user interface and a well-designed computer language with a powerful pattern-matching capability. All of this is combined in a package that is relatively easy to use. Hyperbole aside, Mathematica is a well-designed piece of software, but it does not tackle all of mathematics, and its mathematical capabilities are not significantly different from those of other computer algebra systems. Some initial impressions of Mathematica's capabilities are given by Barwise [1], Simon [2], and Wayner [4]. This review will concentrate on the book Mathematica: a system for doing mathematics by computer rather than on the Mathematica system. A press release from the publisher describes the book as “accessible to anyone who wants to use Mathematica—from high school students and those with no prior experience with computers, to advanced engineers, mathematicians and scientists—the book describes the basic Mathematica system and details its use on all computers which run the program. . . . ” In other words, the book is primarily a manual on how to use the Mathematica system. However, since it contains some involved examples of programs written in the Mathematica language and some discussion about various styles of mathematical programming, it can also be described as a programming language book on how to represent mathematical algorithms and mathematical knowledge in the Mathematica language. Although the publishers feel the audience ranges from high school students to professionals, a more realistic lower bound for much of the material is college sophomores or juniors with strong backgrounds in applied mathematics and computer science. Some sections will be accessible only to advanced students or professionals. Indeed, the first sample session with the system (page 3) includes a command to find a root of the Bessel function J 0( x) and another one to evaluate the Riemann zeta function at a complex point. Wolfram describes the Mathematica system as consisting of two parts, a “kernel” that contains the mathematical knowledge in the system and does the calculations, and a “front end” that manages the interaction with the user. The book's primary concern is the kernel. Wolfram considers the “mathematical notebook” part of the front end and describes it only briefly. I found this disappointing since this fascinating feature attracted me to the system and separates Mathematica from other mathematics computation systems. The book contains five chapters (numbered 0 to 4) and two large appendices. Chapter 0, “A Tour of Mathematica,” is a brief overview of Mathematica's capabilities. Chapter 1, “A Practical Introduction to Mathematica,” contains a detailed tutorial on the basic numerical, symbolic, and graphical commands of the system. The tutorial includes numerous examples that illustrate the various commands. The chapter concludes with some material on interfacing Mathematica with C and FORTRAN programs, the computer's operating system, and the T 2EX formatting system. Chapter 2, “The Structure of Mathematica,” provides a detailed overview of the Mathematica programming language and other miscellaneous aspects of the system. Chapter 3, “Advanced Mathematics in Mathematica,” describes the semantics of the system commands in greater detail. Chapter 4, “Mathematica as a Computing Language,” describes various approaches to mathematical programming, including procedural programming, functional programming, object-oriented programming, logic programming, and rule-based programming. The author believes that rule-based programming, using mathematical transformation rules and the pattern-matching capability of the system, often provides the most efficient way to write mathematics programs and represent mathematical knowledge on a computer. This chapter compares the Mathematica language to BASIC, FORTRAN, C, Pascal, APL, LISP, and PostScript but, unfortunately, not to other computer algebra languages that have capabilities similar to those of Mathematica. Appendix A provides some examples of symbolic and graphical programs; Appendix B is a reference guide to the system. This book is perhaps the best documentation currently available for a mathematics system. It is generally well written and well laid out. The author describes most (but not all) of the examples clearly, and it is generally easy to locate material in the book. Commands are conveniently summarized in tables (highlighted with gray backgrounds) which appear throughout the book. Keep in mind that the book is more of a manual than a textbook. The author has included no exercises, and the presentation places more emphasis on describing the details of the system than on describing the algorithms that make the system work. Although the author occasionally alludes to fundamental concepts in computer algebra, such as the Risch integration algorithm and Gro¨bner bases, and gives a Mathematica program for Gosper's summation algorithm, he provides no references for those who wish to explore the material in greater detail. The book gives the impression that software systems like Mathematica have great potential to alter the practice of mathematics. In fact, the cover of the book describes Mathematica as “powerful enough to tackle frontier problems in science and mathematics.” Unfortunately, the author gives the reader little guidance about which problems are most appropriate for the software. He states that future books will describe the use of Mathematica in specific application areas. The book can be used for a course in symbolic mathematical programming or as a supplemental reference manual for other courses that might use the Mathematica software.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Please enable JavaScript to view thecomments powered by Disqus.

Recommendations