Get ebook downloads in full at ebookmeta.

com

The Mathematica GuideBook for Programming 2004th

Edition Trott Michael

https://ebookmeta.com/product/the-mathematica-guidebook-for-
programming-2004th-edition-trott-michael/

OR CLICK BUTTON

DOWNLOAD NOW

Explore and download more ebook at https://ebookmeta.com

 Recommended digital products (PDF, EPUB, MOBI) that
you can download immediately if you are interested.

The Clapham Common Draughts Book A Guide for Beginners G E

Trott

https://ebookmeta.com/product/the-clapham-common-draughts-book-a-
guide-for-beginners-g-e-trott/

ebookmeta.com

Hands On Start to Wolfram Mathematica And Programming with

the Wolfram Language 3rd Edition Cliff Hastings

https://ebookmeta.com/product/hands-on-start-to-wolfram-mathematica-
and-programming-with-the-wolfram-language-3rd-edition-cliff-hastings/

ebookmeta.com

Physics by Computer Programming Physical Problems Using

Mathematica and C Kinzel Wolfgang Reents Georg

https://ebookmeta.com/product/physics-by-computer-programming-
physical-problems-using-mathematica-and-c-kinzel-wolfgang-reents-
georg/
ebookmeta.com

High Performance Computing in Science and Engineering: 4th

International Conference, HPCSE 2019, Karolinka, Czech
Republic, May 20–23, 2019, Revised ... (Lecture Notes in
Computer Science, 12456) Tomáš Kozubek (Editor)
https://ebookmeta.com/product/high-performance-computing-in-science-
and-engineering-4th-international-conference-hpcse-2019-karolinka-
czech-republic-may-20-23-2019-revised-lecture-notes-in-computer-
science-124/
ebookmeta.com
Strategic Sourcing in the Public Sector 1st Edition
Barbara A. Grilli & Theresa G. Webb

https://ebookmeta.com/product/strategic-sourcing-in-the-public-
sector-1st-edition-barbara-a-grilli-theresa-g-webb/

ebookmeta.com

Deep Learning with Python 1st Edition Nikhil Ketkar

https://ebookmeta.com/product/deep-learning-with-python-1st-edition-
nikhil-ketkar/

ebookmeta.com

Cybercrime and Digital Forensics An Introduction 3rd

Edition Thomas J Holt Adam M Bossler Kathryn C Seigfried
Spellar
https://ebookmeta.com/product/cybercrime-and-digital-forensics-an-
introduction-3rd-edition-thomas-j-holt-adam-m-bossler-kathryn-c-
seigfried-spellar/
ebookmeta.com

Berserk Volume 1 5 Collection 5 Books Set Series 1 1st

Edition Kentaro Miura

https://ebookmeta.com/product/berserk-volume-1-5-collection-5-books-
set-series-1-1st-edition-kentaro-miura/

ebookmeta.com

Water Resource Economics The Analysis of Scarcity Policies

and Projects 2nd edition Griffin Ronald C

https://ebookmeta.com/product/water-resource-economics-the-analysis-
of-scarcity-policies-and-projects-2nd-edition-griffin-ronald-c/

ebookmeta.com
Hunter Alpha man I want 1st Edition Fern Fraser

https://ebookmeta.com/product/hunter-alpha-man-i-want-1st-edition-
fern-fraser-2/

ebookmeta.com
Michael Trott

The Mathematica GuideBook

for Programming

~ pSpringer
'i:i
Contents
PREFACE

to The Mathematica GuideBooks

CHAPTER 0

Introduction and Orientation

0.1 Overview
0.1.1 Content Summaries
0.1.2 Relation of the Four Volumes
0.1.3 Chapter Structure
0.1.4 Code Presentation Style
0.2 Requirements
0.2.1 Hardware and Software
0.2.2 Reader Prerequisites
0.3 What the GuideBooks Are and What They Are Not
0.3.1 Doing Computer Mathematics
0.3.2 Programming Paradigms
0.4 Exercises and Solutions
0.4.1 Exercises
0.4.2 Solutions
0.5 The Books Versus the Electronic Components
0.5.1 Working with the Notebook
0.5.2 Reproducibility of the Results
0.5.3 Earlier Versions of the Notebooks
0.6 Style and Design Elements
0.6.1 Text and Code Formatting
0.6.2 References
0.6.3 Variable Scoping, Input Numbering, and Warning Messages
0.6.4 Graphics
0.6.5 Notations and Symbols
0.6.6 Units
0.6.7 Cover Graphics
0.7 Production History
0.8 Four General Suggestions

© 2004, 2005 Springer Science+Business Media, Inc.

2 Printed from THE MATHEMATICA GUIDEBOOKS

@ @ References

P R O G R A M M I N G

CHAPTER 1

Introduction to Mathematica
1.0 Remarks
1.1 Basics of Mathematica as a Programming Language
1.1.1 General Background
In and Out Numbering † General Naming, Spelling, and
Capitalization Conventions for Symbols † Options and Option
Settings † Messages † Add-On Packages
1.1.2 Elementary Syntax
Common Shortcuts † Parentheses, Braces, and Brackets †
Comments Inside Code † Font Usage † Referring to Outputs †
Functional Programming Style † “Ideal” Formatting
1.2 Introductory Examples
1.2.0 Remarks
1.2.1 Numerical Computations
Periodic Continued Fractions † Pisot Numbers † Fast Integer
Arithmetic † Digit Sums † Numerical Integration † Numerical ODE
Solving † Burridge–Knopoff Earthquake Model † Trajectories in a
Random Two-Dimensional Potential † Numerical PDE Solving †
Benney PDE † Sierpinski Triangle-Generating PDE † Monitoring
Numerical Algorithms † Hilbert Matrices † Distances between Matrix
Eigenvalues † Special Functions of Mathematical Physics † Sums
and Products † Computing a High-Precision Value for Euler’s
Constant g † Numerical Root-Finding † Roots of Polynomials †
Jensen Disks † De Rham’s Function † Logistic Map † Built-in Pseudo-
Compiler † Forest Fire Model † Iterated Digit Sums † Modeling a
Sinai Billiard
1.2.2 Graphics
Gibbs Phenomena † Fourier Series of Products of Discontinuous
Functions † Dirichlet Function † Counting Digits † Apollonius Circles †
Generalized Weierstrass Function † 3D Plots † Plotting Parametrized
Surfaces † Plotting Implicitly Defined Surfaces †
Graphics-Objects as Mathematica Expressions † Kepler Tiling †
Fractal Post Sign † Polyhedral Flowers † Gauss Map Animation †
Random Polyehdra

© 2004, 2005 Springer Science+Business Media, Inc.

THE MATHEMATICA GUIDEBOOKS to PROGRAMMING—GRAPHICS—NUMERICS—SYMBOLICS 3

1.2.3 Symbolic Calculations

Differentiation † Integration † Symbolic Solutions of ODEs †
Vandermonde Matrix † LU Decomposition of a Vandermonde
Matrix † Redheffer Matrix † Symbolic Representations of Polynomial
Roots † Solving Systems of Polynomials † Eliminating Variables from
Polynomial Systems † Series Expansions † L’Hôspital’s Rule †
Radical Expressions of Trigonometric Function Values † Prime
Factorizations † Symbolic Summation † Proving Legendre’s Elliptic
Integral Identity † Geometric Theorem Proofs Using Gröbner
Bases † Medial Parallelograms † Inequality Solving † Symbolic
Description of a Thickened Lissajous Curve † Simplifications under
Assumptions † Numbers with Identical Digits in the Decimal and
Continued Fraction Expansions † Conformal Map of a Square to the
Unit Disk † Vortex Motion in a Rectangle † Magnetic Field of a
Magnet with Air Gap † Localized Propagating Solution of the
Maxwell Equation † Customized Notations † Schmidt Decomposition
of a Two-Particle State
1.2.4 Programming
Large Calculations † Partitioning Integers † Binary Splitting-Based
Fast Factorial † Bolyai Expansion in Nested Radicals † Defining
Pfaffians † Bead Sort Algorithm † Structure of Larger Programs †
Making Platonic Solids from Tori † Equipotential Surfaces of a
Charged Icosahedral Wireframe † Tube along a 3D Hilbert Curve
1.3 What Computer Algebra and Mathematica 5.1 Can and Cannot Do
What Mathematica Does Well †
What Mathematica Does Reasonably Well †
What Mathematica Cannot Do † Package Proposals †
What Mathematica Is and What Mathematica Not Is † Impacts of
Computer Algebra † Relevant Quotes † Computer Algebra and
Human Creativity † New Opportunities Opened by Computer
Algebra † Computer Mathematics—The Joy Now and the Joy to
Come
@ @ Exercises
Computing Wishes and Proposals † Computer Algebra Systems
@ @ Solutions
100 Proposals for Problems to Tackle † Sources of Interesting and
Challenging Problems † ISSAC Challenge Problems † 100$–100-
Digit Challenge

© 2004, 2005 Springer Science+Business Media, Inc.

4 Printed from THE MATHEMATICA GUIDEBOOKS

@ @ References

CHAPTER 2

Structure of Mathematica Expressions

2.0 Remarks
2.1 Expressions
Everything Is an Expression † Hierarchical Structure of Symbolic
Expressions † Formatting Possibilities † Traditional Mathematics
Notation versus Computer Mathematics Notation † Typeset Forms †
Heads and Arguments † Symbols † Nested Heads † Input Form and
the Formatting of Programs
2.2 Simple Expressions
2.2.1 Numbers and Strings
Formatting Fractions † Integers † Autosimplifications † Rational
Numbers † Approximate Numbers † Real Numbers † Complex
Numbers † Autonumericalization of Expressions † Strings † High-
Precision Numbers † Inputting Approximate Numbers † Inputting
High-Precision Numbers † Approximate Zeros
2.2.2 Simplest Arithmetic Expressions and Functions
Basic Arithmetic Operations † Reordering Summands and Factors †
Precedences of Simple Operators † Algebraic Numbers † Domains
of Numeric Functions † Autoevaluations of Sums, Differences,
Products, Quotients, and Powers
2.2.3 Elementary Transcendental Functions
Exponential and Logarithmic Functions † Trigonometric and
Hyperbolic Functions † Exponential Singularities † Picard’s
Theorem † Secants Iterations † Exact and Approximate Arguments †
Postfix Notation † Infix Notation
2.2.4 Mathematical Constants
Imaginary Unit † p † Autoevaluations of Trigonometric Functions †
Base of the Natural Logarithm † Golden Ratio † Euler’s Constant g †
Directed and Undirected Infinities † Indeterminate Expressions
2.2.5 Inverse Trigonometric and Hyperbolic Functions
Multivalued Functions † Inverse Trigonometric Functions † Inverse
Hyperbolic Functions † Complex Number Characteristics † Real and
Imaginary Parts of Symbolic Expressions † Branch Points and
Branch Cuts † Branch Cuts Not Found in Textbooks
2.2.6 Do Not Be Disappointed
Real versus Complex Arguments † Seemingly Missing
Simplifications † Principal Sheets of Multivalued Functions
2.2.7 Exact and Approximate Numbers
Symbols and Constants † Numericalization to Any Number of
Digits † Precision of Real Numbers † Precision of Complex Numbers
2.3 Nested Expressions
2.3.1 An Example
Constructing Nested Expressions † Canonical Order † Displaying
Outlines of Expressions † Displaying Nested Expressions

© 2004, 2005 Springer Science+Business Media, Inc.

THE MATHEMATICA GUIDEBOOKS to PROGRAMMING—GRAPHICS—NUMERICS—SYMBOLICS 5

2.3.2 Analysis of a Nested Expression

A Large Expression † Parts of Expressions † Recursive Part
Extraction † Depths of Expressions † Extracting Multiple Parts †
Extracting Parts Hierarchically † Locating Subexpressions in
Expressions † Level Specifications † Length of Expressions † Leaves
of Expressions
2.4 Manipulating Numbers
2.4.1 Parts of Fractions and Complex Numbers
Rational Numbers as Raw Objects † Numerators and
Denominators † Complex Numbers as Raw Objects † Real and
Imaginary Parts
2.4.2 Digits of Numbers
Digits of Integers † Digits of Real Numbers † Writing Numbers in Any
Base † Counting Digits of Numbers † Fibonacci Chain Map Animation
@ @ Overview
@ @ Exercises
Analyzing the Levels of an Expression † Branch Cuts of Nested
Algebraic Functions † Analyzing the Branch Cut Structure of Inverse
Hyperbolic Functions † “Strange” Analytic Functions
@ @ Solutions
Principal Roots † Analyzing a Large Expression † Levels Counted
from Top and Bottom † Branch Cuts of Iz4 M
1ê4
†

z+ 1êz z- 1êz †
Riemann Surface of arctanHtanHz ê 2L ê 2L
Branch Cuts of
† Repeated Mappings of
Singularities
@ @ References

CHAPTER 3

Definitions and Properties of Functions

3.0 Remarks
3.1 Defining and Clearing Simple Functions
3.1.1 Defining Functions
Immediate and Delayed Function Definitions † Expansion and
Factorization of Polynomials † Expansion and Factorization of
Trigonometric Expressions † Patterns † Nested Patterns † Patterns
in Function Definitions † Recursive Definitions † Indefinite
Integration † Matching Patterns † Definitions for Special Values †
Functions with Several Arguments † Ordering of Definitions
3.1.2 Clearing Functions and Values
Clearing Symbol Values † Clearing Function Definitions † Clearing
Specific Definitions † Removing Symbols † Matching Names by
Name Fragments † Metacharacters in Strings

© 2004, 2005 Springer Science+Business Media, Inc.

6 Printed from THE MATHEMATICA GUIDEBOOKS

3.1.3 Applying Functions

Univariate and Multivariate Functions † Prefix Notation † Postfix
Notation † Infix Notation
3.2 Options and Defaults
Meaning and Usage of Options † Lists as Universal Containers †
Options of Functions † Plotting Simple Functions † Extracting Option
Values † Setting Option Values
3.3 Attributes of Functions
Meaning and Usage of Attributes † Assigning Attributes to
Functions † Commutative Functions † Associative Functions †
Functions Operating Naturally on Lists † Numerical Functions †
Differentiation of Functions † Protected Functions † Preventing the
Evaluation of Expressions † Forcing the Evaluation of Expressions
3.4 Downvalues and Upvalues
Function Definitions Associated with Heads † Function Definitions
Associated with Specific Arguments † Downvalues and Upvalues †
Timing for Adding and Removing Definitions † Caching † Values of
Symbols † Numerical Values of Symbols
3.5 Functions that Remember Their Values
Caching Function Values † Multiple Assignments † Simplification of
Expressions † Timings of Computations † Takeuchi Function
3.6 Functions in the l-Calculus
l-Calculus † Functions as Mappings † Functions without Named
Arguments † Self-Reproducing Functions † Splicing of Arguments †
Sequences of Arguments † Pure Functions with Attributes † Nested
Pure Functions
3.7 Repeated Application of Functions
Applying Functions Repeatedly † Iterative Maps † Solving an ODE
by Iterated Integration † Iterated Logarithm in the Complex Plane †
Fixed Points of Maps † Fixed Point Iterations † Newton’s Method for
Square Root Extraction † Basins of Attractions † Cantor Series
3.8 Functions of Functions
Compositions of Functions † Applying Lists of Heads † Inverse
Functions † Differentiation of Inverse Functions
@ @ Overview
@ @ Exercises
Predicting Results of Inputs † Nice Polynomial Expansions †
Laguerre Polynomials † Puzzles † Unexpected Outputs † Power
Tower † Cayley Multiplication
@ @ Solutions
Matching Unevaluated Arguments † Equality of Pure Functions †
Invalid Patterns † Counting Function Applications

© 2004, 2005 Springer Science+Business Media, Inc.

THE MATHEMATICA GUIDEBOOKS to PROGRAMMING—GRAPHICS—NUMERICS—SYMBOLICS 7

@ @ References

CHAPTER 4

Meta-Mathematica
4.0 Remarks
4.1 Information on Commands
4.1.1 Information on a Single Command
Built-in Function Definitions as Outputs † Information about
Functions † Listing of All Built-in Commands † Messages † Printing
Text and Cells † Warnings and Error Messages † Wrong and
“Unexpected” Inputs † Suppressing Messages † Carrying out
Multiple Calculations in One Input
4.1.2 A Program that Reports on Functions
Converting Strings to Expressions † Converting Expressions to
Strings † String Form of Typeset Expressions
4.2 Control over Running Calculations and Resources
4.2.1 Intermezzo on Iterators
Do Loops † Multiple Iterators † Possible Iterator Constructions †
Iterator Step Sizes
4.2.2 Control over Running Calculations and Resources
Aborting Calculations † Protecting Calculations from Aborts †
Interrupting and Continuing Calculations † Collecting Data on the
Fly † Time-Constrained Calculations † Memory-Constrained
Calculations † Time and Memory Usage in a Session † Expressions
Sharing Memory † Memory Usage of Expressions
4.3 The $-Commands
4.3.1 System-Related Commands
Mathematica Versions † The Date Function † Smallest and Largest
Machine Real Numbers
4.3.2 Session-Related Commands
In and Out Numbering † Input History † Collecting Messages †
Display of Graphics † Controlling Recursions and Iterations † Deep
Recursions † Ackermann Function
4.4 Communication and Interaction with the Outside
4.4.1 Writing to Files
Extracting Function Definitions † Writing Data and Definitions to
Files † Reading Data and Definitions from Files † File Manipulations
4.4.2 Simple String Manipulations
Concatenating Strings † Replacing Substrings † General String
Manipulations † Case Sensitivity and Metacharacters † A Program
that Prints Itself
4.4.3 Importing and Exporting Data and Graphics
Importing and Exporting Files † Importing Web Pages † Importing
From and To Strings † Making Low-Resolution JPEGs

© 2004, 2005 Springer Science+Business Media, Inc.

8 Printed from THE MATHEMATICA GUIDEBOOKS

4.5 Debugging
Displaying Steps of Calculations † Evaluation Histories as
Expressions † Recursion versus Iteration † Interactive Inputs
4.6 Localization of Variable Names
4.6.1 Localization of Variables in Iterator Constructions
Sums and Products † Scoping of Iterator Variables
4.6.2 Localization of Variables in Subprograms
Scoping Constructs † Lexical Scoping † Dynamic Scoping † Local
Constants † Temporary Variables † Variable Scoping in Pure
Functions † Creating Unique Variables † Nonlocal Program Flow
4.6.3 Comparison of Scoping Constructs
Delayed Assignments in Scoping Constructs † Temporarily
Changing Built-in Functions † Variable Localization in Iterators †
Scoping in Nested Pure Functions † Nesting Various Scoping
Constructs † Timing Comparisons of Scoping Constructs
4.6.4 Localization of Variables in Contexts
Contexts † Variables in Contexts † Searching through Contexts †
Manipulating Contexts † Beginning and Ending Contexts
4.6.5 Contexts and Packages
Loading Packages † General Structure of Packages † Private
Contexts † Analyzing Context Changes
4.6.6 Special Contexts and Packages
Developer Functions † Special Simplifiers † Bit Operations †
Experimental Functions † Standard Packages
4.7 The Process of Evaluation
Details of Evaluating an Expression † Analyzing Evaluation
Examples † Standard Evaluation Order † Nonstandard Evaluations †
Held Arguments
@ @ Overview
@ @ Exercises
Frequently Seen Messages † Unevaluated Arguments † Predicting
Results of Inputs † Analyzing Context Changes † Evaluated versus
Unevaluated Expressions
@ @ Solutions
Shortcuts for Functions † Functions with Zero Arguments † Small
Expressions that Are Large † Localization of Iterator Variables †
Dynamical Context Changes † Local Values

© 2004, 2005 Springer Science+Business Media, Inc.

THE MATHEMATICA GUIDEBOOKS to PROGRAMMING—GRAPHICS—NUMERICS—SYMBOLICS 9

@ @ References

CHAPTER 5

Restricted Patterns and Replacement Rules

5.0 Remarks
5.1 Boolean and Related Functions
5.1.1 Boolean Functions for Numbers
Truth Values † Predicates † Functions Ending with Q † Numbers and
Numeric Quantities † Integer and Real Numbers † Compound
Numeric Quantities † Exact and Inexact Numbers † Primality †
Gaussian Primes † Stating Symbolic and Verifying Numeric
Inequalities † Comparisons of Numbers † Ordering Relations †
Positivity
5.1.2 Boolean Functions for General Expressions
Testing Expressions for Being a Polynomial † Vectors and Matrices †
Mathematical Equality † Equality and Equations † Structural
Equality † Identity of Expressions † Equality versus Identity †
Canonical Order † Membership Tests
5.1.3 Logical Operations
Boolean Operations † And, Or, Not, and Xor † Rewriting Logical
Expressions † Precedences of Logical Operators
5.1.4 Control Structures
Branching Constructs † The If Statement † Undecidable Conditions †
While and For Loops † Prime Numbers in Arithmetic Progression
5.1.5 Piecewise Functions
Piecewise Defined Functions † Canonicalization of Piecewise
Functions † Composition of Piecewise Functions † Interpreting
Functions as Piecewise Functions † Specifying Geometric Regions †
Endpoint Distance Distribution of Random Flights
5.2 Patterns
5.2.1 Patterns for Arbitrary Variable Sequences
Simple Patterns † Patterns for Multiple Arguments † Testing
Patterns † Named Patterns † Trace of Products of Gamma
Matrices † Shortcuts for Patterns † Avoiding Evaluation in Patterns †
Literal Patterns
5.2.2 Patterns with Special Properties
Optional Arguments † Default Values for Optional Arguments †
Repeated Arguments † Excluding Certain Patterns † Alternative
Arguments † Restricted Patterns † Pattern Tests † Conditional
Patterns † Recursive Definitions † Pattern-Based Evaluation of
Elliptic Integrals † Generating Tables † Selecting Elements from
Lists † All Syntactically Correct Shortcuts

© 2004, 2005 Springer Science+Business Media, Inc.

10 Printed from THE MATHEMATICA GUIDEBOOKS

5.2.3 Attributes of Functions and Pattern Matching

Pattern Matching in Commutative and Associative Functions †
Arguments in Any Order † Nested Functions † Automatic Use of
Defaults † Analyzing Matchings and Recursions in Pattern and
Attribute Combinations
5.3 Replacement Rules
5.3.1 Replacement Rules for Patterns
Immediate and Delayed Rules † One-Time and Repeated
Replacements † Unevaluated Replacements † Common Pattern
Matching Pitfalls † Finding All Possible Replacements † Scoping in
Rules † Replacements and Attributes † Modeling Function
Definitions † Options and Rules † Replacing Position-Specified Parts
of Expressions
5.3.2 Large Numbers of Replacement Rules
Optimized Rule Application † Complexity of Optimized Rule
Application
5.3.3 Programming with Rules
Examples of Rule-Based Programs † Splitting Lists † Cycles of
Permutations † Sorting of Complex Numbers † Cumulative Maxima †
Dividing Lists † House of the Nikolaus † Polypaths † Rule-Based
versus Other Programming Styles
5.4 String Patterns
Strings with Pattern Elements † Patterns for Character Sequences †
String-Membership Tests † Shortest and Longest Possible
Matches † Overlapping Matches † Counting Characters † Replacing
Characters † All Possible Replacements † Analyzing the Online
Documentation † Cumulative Letter Frequencies
@ @ Overview
@ @ Exercises
Rule-Based Expansion of Polynomials † All Possible Patterns from a
Given Set of Shortcuts † Extending Built-in Functions † General
Finite Difference Weights † Zeta Function Derivatives † Operator
Products † q-Binomial Theorem † q-Derivative † Ordered
Derivatives † Differentiating Parametrized Matrices † Ferrer
Conjugates † Hermite Polynomial Recursions † Peakons † Puzzles †
Catching Arguments and Their Head in Calculations † Nested
Scoping
@ @ Solutions
Modeling Noncommutative Operations † Campbell–Baker–Hausdorff
Formula † Counting Function Calls Using Side Effects †
q-Deformed Pascal Triangle † Ordered Derivative † Avoiding Infinite
Recursions in Pattern Matchings † Dynamically Generated
Definitions

© 2004, 2005 Springer Science+Business Media, Inc.

THE MATHEMATICA GUIDEBOOKS to PROGRAMMING—GRAPHICS—NUMERICS—SYMBOLICS 11

@ @ References

CHAPTER 6

Operations on Lists, and Linear Algebra

6.0 Remarks
Prevalence of List Manipulations † Building Polyhedra by Reflecting
Polygons Iteratively † Animating the Folding Process Based on
Iterated Reflections
6.1 Creating Lists
6.1.1 Creating General Lists
Lists and Nested Lists as Arrays, Tables, Vectors, and Matrices †
Timings of Creating Nested Lists † Changing Heads of
Expressions † Summing Elements of Lists
6.1.2 Creating Special Lists
Kronecker Symbol and Identity Matrix † Levi-Civita Symbol and
Antisymmetric Tensors † Creating Multiple Iterators † Stirling
Numbers † Subsets and Tuples
6.2 Representation of Lists
2D Formatting of Tables and Matrices † Aligning Rows and
Columns † Formatting Higher-Dimensional Tensors † Tensors and
Arrays
6.3 Manipulations on Single Lists
6.3.1 Shortening Lists
Extracting Elements from Lists † Deleting Elements by Specifying
Position, Pattern, or Property † Prime Sieving
6.3.2 Extending Lists
Prepending, Appending, and Inserting List Elements † Working with
Named Lists
6.3.3 Sorting and Manipulating Elements
Rotating Lists Cyclically † Sorting Lists † Sorting Criteria † Analyzing
the Built-in Sorting Algorithm † Splitting Lists † Mapping Functions
over Lists † Listable Functions † Mapping Functions to Expressions
and Parts of Expressions † Extracting Common Subexpressions †
Optimized Expressions
6.3.4 Arithmetical Properties of Lists
Average Value of a List † Sum of a List † Variance of a List †
Quantiles of a List
6.4 Operations with Several Lists or with Nested Lists
6.4.1 Simple Operations
Hadamard Arithmetic on Lists † Transposing Tensors †
Permutations † Using Side Effects for Monitoring List Algorithms †
Joining Lists † Intersections and Complements of Lists † Finding
Approximately Identical Elements

© 2004, 2005 Springer Science+Business Media, Inc.

Other documents randomly have
different content
INCLUDING BUT NOT LIMITED TO WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.

1.F.5. Some states do not allow disclaimers of certain implied

warranties or the exclusion or limitation of certain types of damages.
If any disclaimer or limitation set forth in this agreement violates the
law of the state applicable to this agreement, the agreement shall be
interpreted to make the maximum disclaimer or limitation permitted
by the applicable state law. The invalidity or unenforceability of any
provision of this agreement shall not void the remaining provisions.

1.F.6. INDEMNITY - You agree to indemnify and hold the Foundation,

the trademark owner, any agent or employee of the Foundation,
anyone providing copies of Project Gutenberg™ electronic works in
accordance with this agreement, and any volunteers associated with
the production, promotion and distribution of Project Gutenberg™
electronic works, harmless from all liability, costs and expenses,
including legal fees, that arise directly or indirectly from any of the
following which you do or cause to occur: (a) distribution of this or
any Project Gutenberg™ work, (b) alteration, modification, or
additions or deletions to any Project Gutenberg™ work, and (c) any
Defect you cause.

Section 2. Information about the Mission

of Project Gutenberg™
Project Gutenberg™ is synonymous with the free distribution of
electronic works in formats readable by the widest variety of
computers including obsolete, old, middle-aged and new computers.
It exists because of the efforts of hundreds of volunteers and
donations from people in all walks of life.

Volunteers and financial support to provide volunteers with the

assistance they need are critical to reaching Project Gutenberg™’s
goals and ensuring that the Project Gutenberg™ collection will
remain freely available for generations to come. In 2001, the Project
Gutenberg Literary Archive Foundation was created to provide a
secure and permanent future for Project Gutenberg™ and future
generations. To learn more about the Project Gutenberg Literary
Archive Foundation and how your efforts and donations can help,
see Sections 3 and 4 and the Foundation information page at
www.gutenberg.org.

Section 3. Information about the Project

Gutenberg Literary Archive Foundation
The Project Gutenberg Literary Archive Foundation is a non-profit
501(c)(3) educational corporation organized under the laws of the
state of Mississippi and granted tax exempt status by the Internal
Revenue Service. The Foundation’s EIN or federal tax identification
number is 64-6221541. Contributions to the Project Gutenberg
Literary Archive Foundation are tax deductible to the full extent
permitted by U.S. federal laws and your state’s laws.

The Foundation’s business office is located at 809 North 1500 West,

Salt Lake City, UT 84116, (801) 596-1887. Email contact links and up
to date contact information can be found at the Foundation’s website
and official page at www.gutenberg.org/contact

Section 4. Information about Donations to

the Project Gutenberg Literary Archive
Foundation
Project Gutenberg™ depends upon and cannot survive without
widespread public support and donations to carry out its mission of
increasing the number of public domain and licensed works that can
be freely distributed in machine-readable form accessible by the
widest array of equipment including outdated equipment. Many
small donations ($1 to $5,000) are particularly important to
maintaining tax exempt status with the IRS.

The Foundation is committed to complying with the laws regulating

charities and charitable donations in all 50 states of the United
States. Compliance requirements are not uniform and it takes a
considerable effort, much paperwork and many fees to meet and
keep up with these requirements. We do not solicit donations in
locations where we have not received written confirmation of
compliance. To SEND DONATIONS or determine the status of
compliance for any particular state visit www.gutenberg.org/donate.

While we cannot and do not solicit contributions from states where

we have not met the solicitation requirements, we know of no
prohibition against accepting unsolicited donations from donors in
such states who approach us with offers to donate.

International donations are gratefully accepted, but we cannot make

any statements concerning tax treatment of donations received from
outside the United States. U.S. laws alone swamp our small staff.

Please check the Project Gutenberg web pages for current donation
methods and addresses. Donations are accepted in a number of
other ways including checks, online payments and credit card
donations. To donate, please visit: www.gutenberg.org/donate.

Section 5. General Information About

Project Gutenberg™ electronic works
Professor Michael S. Hart was the originator of the Project
Gutenberg™ concept of a library of electronic works that could be
freely shared with anyone. For forty years, he produced and
distributed Project Gutenberg™ eBooks with only a loose network of
volunteer support.
Project Gutenberg™ eBooks are often created from several printed
editions, all of which are confirmed as not protected by copyright in
the U.S. unless a copyright notice is included. Thus, we do not
necessarily keep eBooks in compliance with any particular paper
edition.

Most people start at our website which has the main PG search
facility: www.gutenberg.org.

This website includes information about Project Gutenberg™,

including how to make donations to the Project Gutenberg Literary
Archive Foundation, how to help produce our new eBooks, and how
to subscribe to our email newsletter to hear about new eBooks.