Gaylord / Kamin / Wellin Introduction to Programming with Mathematica®

Includes diskette
Erscheinungsjahr 2013
ISBN: 978-1-4757-1132-5
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 302 Seiten, Web PDF

An Introduction to Programming with Mathematica is the first book published expressly to teach Mathematica as a programming language to scientists, engineers, mathematicians, and computer scientists. This text may be used in a first or second course on programming at the undergraduate level or in a Mathematica-related course in engineering, mathematics, or the sciences. It is also intended for individual study by students and professionals. The text does not assume familiarity with Mathematica nor does it require any prior programming experience. The book and diskette contain over 200 exercises drawn from many areas of science, engineering, mathematics, and computer science. The 3 1/2'' diskette included with this book can be read by UNIX, IBM-compatible, NeXT, and Macintosh computers. The diskette includes Notebooks and packages containing the code for all of the examples and exercises in the text, as well as additional material extending many of the ideas in the text. The packages will run on any computer running Mathematica and the Notebooks will run on any computer that supports Mathematica Notebooks. Version 2.0 or later of Mathematica is recommended for maximum use of the diskette.

Zielgruppe

Professional/practitioner

Autoren/Hrsg.

Gaylord, Richard J.

Kamin, Samuel N.

Wellin, Paul R.

Inhaltsverzeichnis

1 | Preliminaries.- 1.1 Introduction.- 1.2 What is in This Book.- 1.3 Basics.- 1.4 Predicates and Boolean Operations.- 1.5 Evaluation of Expressions.- 1.6 The Mathematica Interface.- 2 | A Brief Overview of Mathematica.- 2.1 Numerical and Symbolic Computations.- 2.2 Functions.- 2.3 Graphics.- 2.4 Representation of Data.- 2.5 Programming.- 3 | List Manipulation.- 3.1 Introduction.- 3.2 Creating and Measuring Lists.- 3.3 Working With the Elements of a List.- 3.4 Working with Several Lists.- 3.5 Higher-Order Functions.- 3.6 Applying Functions to Lists Repeatedly.- 3.7 Strings and Characters.- 4 | Functions.- 4.1 Introduction.- 4.2 Programs as Functions.- 4.3 User-Defined Functions.- 4.4 Auxiliary Functions.- 4.5 Anonymous Functions.- 4.6 One-Liners.- 5 | Evaluation of Expressions.- 5.1 Introduction.- 5.2 Creating Rewrite Rules.- 5.3 Expressions.- 5.4 Patterns.- 5.5 Term Rewriting.- 5.6 Transformation Rules.- 6 | Conditional Function Definitions.- 6.1 Introduction.- 6.2 Conditional Functions.- 6.3 Summary of Conditionals.- 6.4 Example Classifying Points.- 7 | Recursion.- 7.1 Fibonacci Numbers.- 7.2 List Functions.- 7.3 Thinking Recursively.- 7.4 Recursion and Symbolic Computations.- 7.5 Gaussian Elimination.- 7.6 Binary Trees.- 7.7 Dynamic Programming.- 7.8 Higher-Order Functions and Recursion.- 7.9 Debugging.- 8 | Iteration.- 8.1 Newton’s Method.- 8.2 Vectors and Matrices.- 8.3 Passing Arrays to Functions.- 8.4 Gaussian Elimination Revisited.- 9 | Numerics.- 9.1 Types of Numbers.- 9.2 Random Numbers.- 9.3 Precision and Accuracy.- 9.4 Numerical Computations.- 10 | Graphics Programming.- 10.1 Graphics Primitives.- 10.2 Graphics Directives and Options.- 10.3 Built-In Graphics Functions.- 10.4 Graphics Programming.- 10.5 Sound.- 11 | Contexts and Packages.- 11.1Introduction.- 11.2 Using Packages.- 11.3 Contexts.- 11.4 Packages.- 11.5 The BaseConvert Package.- 11.6 Miscellaneous Topics.