Programming with Mathematica : an introduction / (Record no. 2517)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 07814cam a22001697a 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781107009462 (hbk.) |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | CUS |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.133 |
| Item number | WEL/P |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Wellin, Paul R. |
| 245 10 - TITLE STATEMENT | |
| Title | Programming with Mathematica : an introduction / |
| Statement of responsibility, etc. | by Paul Wellin. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | Cambridge, UK ; |
| -- | New York : |
| Name of publisher, distributor, etc. | Cambridge University Press, |
| Date of publication, distribution, etc. | 2013. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xviii, 711 p. : |
| Other physical details | ill. (some col.) ; |
| Dimensions | 25 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Includes bibliographical references (p. [687]-694) and index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 1 An introduction to Mathematica<br/>1.1 Overview of basic operations • i<br/>Numerical and ^mbolic computation ■ Graphics and visualization ■ Working with data • Dynamic<br/>interactivity • Programming<br/>1.2 Getting started • 14<br/>Starting up Mathematica ■ The notebook interface ■ Entering input ■ Mathematical expressions • Syntax of<br/>functions ■ Lists ■ Semicolons ■ Alternative input syntax • Comments • Errors • Getting out of trouble ■ Thefront<br/>end and the kernel<br/>1.3 Getting help • 25<br/>Function information • The Documentation Center<br/>2 The Mathematica language<br/>2.1 Expressions • 29<br/>Types ofexpressions • Atoms ■ Structure of expressions ■ Evaluation of expressions ■ Exercises<br/>2.2 Definitions • 40<br/>Defining variables and functions • Immediate vs. delayed assignments • Term rewriting • Functions with<br/>multiple definitions • Exercises<br/>2.3 Predicates and Boolean operations • 48<br/>Predicates • Relational and logical operators ■ Exercises<br/>2.4 Attributes -53 ; .<br/>Exercises . ..<br/>Lists<br/>3.1 Creating and displaying lists • 58<br/>List structure and ^ntax • List construction ■ Displaying lists ■ Arrays • Exercises<br/>3.2 The structure of lists • 67<br/>Testing a list ■ Measuring lists ■ Exercises<br/>3.3 Operations on lists • 70<br/>Extracting elements ■ Rearranging lists ■ List component assignment • Multiple lists • Exercises<br/>Patterns and rules<br/>4.1 Patterns • 85<br/>Blanks ■ Pattern matching by type • Structured patterns • Sequence pattern matching ■ Conditional pattern<br/>matching ■ Alternatives ■ Repeated patterns ■ Functions that use patterns ■ Exercises<br/>4.2 Transformation rules • 102<br/>Creating and using replacement rules ■ Example: counting coins ■ Example: closed paths ■ Example: finding<br/>maxima ■ Exercises<br/>4.3 Examples and applications • 109<br/>Finding subsequences ■ Sorting a list • Exercises<br/>Functional programming<br/>5.1 Introduction • 116<br/>5.2 Functions for manipulating expressions • 118<br/>Map • Apply • Thread and MapThread • The Listable attribute • Inner and Outer • Select and Pick • Exercises<br/>5.3 Iterating functions • 132<br/>Nest • FixedPoint • NestWhile • Fold ■ Exercises<br/>5.4 Programs as functions • 137<br/>Building up programs • Example: shuffling cards • Compound Junctions • Exercises<br/>5.5 Scoping constructs • 146<br/>Localizing names: Module ■ Localizing values: Block ■ Localizing constants: With ■ Example: matrix<br/>manipulation ■ Exercises<br/>5.6 Pure functions -153<br/>Syntax of pure functions • Using pure Junctions ■ Example: searching for attributes and options • Exercises •<br/>57 Options and messages • 164<br/>Options ■ Messages ■ Exercises<br/>5.8 Examples and applications • 170<br/>Hamming distance • The Josephus problem • Regular graphs/polygons ■ Protein interaction networks ■ Palettes<br/>for projectfiles ■ Operating on arrays • Exercises<br/>6 Procedural programming<br/>6.1 Loops and iteration * 190<br/>Newton's method • Do loops and For loops ■ Example: random permutations • While loops • NestWhile and<br/>NestWhileList • Exercises<br/>6.2 Flow control • 208<br/>Conditional functions • Piecewise-defined Junctions ■ Which and Switch • Argument checking ■ Exercises<br/>6.3 Examples and applications • 219<br/>Classifying points • Sieve of Eratosthenes • Sorting algorithms ■ Exercises<br/>7 Recursion<br/>7.1 Fibonacci numbers • 231<br/>Exercises<br/>7.2 Thinking recursively • 234<br/>Length of a list ■ Recursion with multiple arguments ■ Multiplying pairwise elements • Dealing cards,<br/>recursively • Finding maxima • Higher-order functions • Exercises<br/>7.3 Dynamic programming • 239<br/>Exercises<br/>7.4 Classical examples • 244<br/>Merge sort ■ Run-length encoding • Exercises<br/>8 Numerics<br/>8.1 Numbers in Mathematica -251<br/>Types of numbers • Digits and number bases ■ Random numbers • Exercises<br/>8.2 Numerical computation • 265<br/>Precision and accuracy ■ Representation of approximate numbers • Exact vs. approximate numbers • High<br/>precision vs. machine precision ■ Computations with mixed number types ■ Working with precision and<br/>accuracy • Exercises<br/>8.3 Arrays of numbers • 282<br/>Sparse arrays ■ Packed arrays ■ Exercises<br/>8.4 Examples and applications • 291<br/>Newton's method revisited • Radius ofgyration of a random walk • Statistical tests • Exercises<br/>9 Strings<br/>9.1 Structure and syntax • 310<br/>Character codes ■ Sorting lists of characters ■ Ordered words ■ Exercises<br/>9.2 Operations on strings • 316<br/>Basic string operations • Strings vs. lists • Encoding text • Indexed ^mbols • Anagrams • Exercises<br/>9.3 String patterns • 325<br/>Finding subsequences with strings ■ Alternatives ■ Exercises<br/>9.4 Regular expressions • 332<br/>Word stemming ■ Exercises<br/>9.5 Examples and applications • 343<br/>Random strings ■ Partitioning strings ■ Adler checksum • Search for substrings ■ DNA sequence analysis ■<br/>Displaying DNA sequences ■ Blanagrams • Exercises<br/>10 Graphics and visualization<br/>10.1 Structure of graphics • 365<br/>Graphics primitives ■ Graphics directives ■ Graphics options ■ Combining graphics elements ■ Structure of built-<br/>in graphics functions • Example: Bezier curves • Example: hypocycloids • Exercises<br/>10.2 Efficient structures • 386<br/>Multi-objects • GraphicsComplex • Numeric vs. symbolic expressions • Exercises<br/>10.3 Sound • 396<br/>The sound of mathematics ■ Sound primitives and direaives ■ Exercises<br/>10.4 Examples and applications • 402<br/>Spacefilling plots ■ Plotting lines in space ■ Simple closed paths ■ Points in a polygon ■ Visualizing standard<br/>deviations ■ Root plotting ■ Trend plots ■ Brownian music ■ Exercises<br/>11 Dynamic expressions<br/>II.I Manipulating expressions • 449<br/>Control objects ■ Control wrapper ■ Viewers ■ Animating the hypog'cloid ■ Visualizing logical operators ■<br/>Exercises<br/>11.2 The structure of dynamic expressions • 470<br/>Dynamic ■ DynamicModule ■ Dynamic tips ■ Exercises<br/>11.3 Examples and applications • 481<br/>Creating interfaces for visualizing data ■ File openers • Dynamic random walks • Apollonius' circle • Exercises<br/>12 Optimizing Mathematica programs<br/>12.1 Measuring efficiency • 494<br/>Evaluation time • Memory stoi'age<br/>12.2 Efficient programs • 496<br/>Low-level vs. high-level functions ■ Pattern matching • Reducing size of computation • Symbolic vs. numeric<br/>computation ■ Listabili^ • Pure functions • Packed arrays ■ Exercises<br/>12.3 Parallel processing • 515<br/>Basic examples • Distributing definitions across subkemels • Profiling • Exercises<br/>12.4 Compiling • 523<br/>Compile • Compiling to C • Exercises<br/>13 Applications and packages<br/>13.1 Random walk application • 534<br/>Lattice walks ■ Off-lattice walks ■ RandomWalk ■ Error and usage messages ■ Visualization • Animation •<br/>Exercises<br/>13.2 Overview of packages -555<br/>Working with packages • Package location<br/>13.3 Contexts • 558<br/>13.4 Creating packages • 563<br/>Package framework • Creating and installing the package ■ RandomWalks package • Running the package •<br/>Exercises |
| 650 #0 - SUBJECT | |
| Keyword | Mathematica (Computer program language) |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | General Books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Full call number | Accession number | Date last seen | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Central Library, Sikkim University | Central Library, Sikkim University | General Book Section | 08/06/2016 | 005.133 WEL/P | P31363 | 08/06/2016 | General Books |