An introduction to programming with Mathematica 3rd Edition by Paul R Wellin, Richard J Gaylord, Samuel N Kamin – Ebook PDF Instant Download/Delivery: 0521846781, 9780521846783
Full download An introduction to programming with Mathematica 3rd Edition after payment
Product details:
ISBN 10: 0521846781
ISBN 13: 9780521846783
Author: Paul R Wellin, Richard J Gaylord, Samuel N Kamin
Starting from first principles, this book covers all of the foundational material needed to develop a clear understanding of the Mathematica language, with a practical emphasis on solving problems. Concrete examples throughout the text demonstrate how Mathematica can be used to solve problems in science, engineering, economics/finance, computational linguistics, geoscience, bioinformatics, and a range of other fields. The book will appeal to students, researchers and programmers wishing to further their understanding of Mathematica. Designed to suit users of any ability, it assumes no formal knowledge of programming so it is ideal for self-study. Over 290 exercises are provided to challenge the reader’s understanding of the material covered and these provide ample opportunity to practice using the language. Mathematica notebooks containing examples, programs and solutions to exercises are available from www.cambridge.org/wellin.
An introduction to programming with Mathematica 3rd Table of contents:
1. An Introduction to Mathematica
* A Brief Overview of Mathematica
* Numerical Computations
* Symbolic Computations
* Graphics
* Working with Data
* Programming
* Symbolic and Interactive Documents
* Using Mathematica
* Getting into and out of Mathematica
* The Syntax of Inputs
* Alternate Input Syntax
* The Front End and the Kernel
* Errors
* Getting Help
* The Help Browser
2. The Mathematica Language
* Expressions
* Introduction
* Internal Forms of Expressions
* Atoms
* The Structure of Expressions
* Exercises
* Definitions
* Defining Variables and Functions
* Immediate vs. Delayed Assignments
* The Global Rule Base
* Piecewise-Defined Functions
* Functions with Multiple Definitions
* Exercises
* Predicates and Boolean Operations
* Predicates
* Relational and Logical Operators
* Exercises
* Attributes
* Exercises
3. Lists
* Introduction
* Creating and Measuring Lists
* List Construction
* Measuring Lists
* Exercises
* Manipulating Lists
* Testing a List
* Extracting Elements
* Rearranging Lists
* List Component Assignment
* Exercises
* Working with Several Lists
* Strings and Characters
* Exercises
4. Functional Programming
* Introduction
* Functions for Manipulating Expressions
* Map
* Thread and MapThread
* The Listable Attribute
* Apply
* Inner and Outer
* Exercises
* Iterating Functions
* Programs as Functions
* User-Defined Functions
* Building Up Programs
* Exercises
* Auxiliary Functions
* Compound Functions
* Localizing Names: Module
* Localizing Values: Block
* Localizing Constants: With
* Exercises
* Pure Functions
* One-Liners
* Hamming Distance
* The Josephus Problem
* Pocket Change
* Exercises
* Exercises
5. Procedural Programming
* Introduction
* Loops and Iteration
* Newton’s Method
* Do Loops
* While Loops
* NestWhile and NestWhileList
* Exercises
* Flow Control
* Conditional Functions
* Exercises
* Debugging
6. Rule-Based Programming
* Introduction
* Patterns
* Introduction
* Blanks
* Blank Sequences
* Double Blanks
* Triple Blanks
* Patterns with Conditions
* Named Patterns
* Optional Arguments and Default Values
* Alternatives
* String Patterns
* Exercises
* Transformation Rules
* Introduction
* Example: Counting Coins
* Example: Finding Maxima
* Exercises
* Examples
* Encoding Text
* Sorting a List
* Exercises
7. Recursion
* Fibonacci Numbers
* Exercises
* List Functions
* Exercises
* Thinking Recursively: Examples
* Finding Maxima
* Subsets
* Run-Length Encoding
* Exercises
* Recursion and Symbolic Computations
* Classical Examples
* Merge Sort
* Gaussian Elimination
* Trees
* Huffman Encoding
* Exercises
* Dynamic Programming
* Higher-Order Functions and Recursion
* Exercises
8. Numerics
* Introduction
* Numbers
* Exact Numbers
* Approximate Numbers
* Precision and Accuracy
* Complex Numbers
* Exercises
* Working with Arrays of Numbers
* Sparse Arrays
* Packed Arrays
* Exercises
* Numerical Computations
* Working with Precision and Accuracy
* Newton’s Method Revisited
* Gaussian Elimination Revisited
* Exercises
9. Graphics Programming
* Structure of Graphics
* Primitives, Directives, and Options
* Exercises
* Graphics Programming
* Root Plotting
* Plotting Data
* Simple Closed Paths
* Drawing Trees
* Exercises
* Sound
* The Sound of Mathematics
* White Noise, White Music
* Brownian Music
* Exercises
10. Front End Programming
* Introduction
* The Structure of Cells and Notebooks
* Notebook Expressions
* The Cell Expression
* Cell Options
* Notebook Options
* Exercises
* Front End Programming
* Creating Interfaces
* Exercises
* Palettes
* Dynamic Content
* Dynamic and DynamicModule
* Exercises
11. Examples and Applications
* The Three-Dimensional Random Walk
* Adding Options and Defaults
* Error-Trapping and Messaging
* Creating Help Browser Documentation
* Exercises
* The Game of Life
* Exercises
* Implementing Languages
* Introduction to PDL
* Syntax
* Parsing
* Lexical Analysis
* Computing Shapes
* Exercises
12. Writing Packages
* Introduction
* Using Packages
* Loading Packages
* Finding Out What Is in a Package
* Avoiding Name Collisions
* Contexts
People also search for An introduction to programming with Mathematica 3rd:
an introduction to programming with mathematica
an introduction to programming with mathematica pdf
introduction to mathematica
an introduction to mathematical finance with applications
an introduction to mathematical cryptography
Tags: Paul R Wellin, Richard J Gaylord, Samuel N Kamin, programming, Mathematica