COPYRIGHT 2008, PRINCETON UNIVERSITY PRESS

IndexAbstract data structures,70Abstraction, 70, 89, 93,107Accuracy, 18, 555ACE/gr, 51–56Adams-Bashforth-Moulton, 204Address, seeMemory 555Advection, 508–510Airy functions, 421Algorithm, 9, 11, 555Alias, 241Amdahl’s law, 365Analog, 555filters, 250Animations, 5, 64, 312,314, 428, 432, 494,495, 515, 555, 568,586–592, 627Antiferromagnet, 392Applets, 222, 228, 565,627Architecture, 158, 169,352–363, 368, 374,376, 378, 555, see alsoMemoryArithmetic unit, 357–360,555Arrays, 165, 555,dimension, 557,see also MatricesAsymptotes, 293Attractors, 292–294, 313predictable, 309strange, 309Autocorrelation function,246–250awt, 565Backtracking, 156, 163Ballistic deposition,332–333, 338–339correlated, 338–339Base, 20, 556BASIC beginner’s code,7nBasic machine language,7, 556Batch, 556, 598Beating, 210Beowulf, 363, 593Bessel functions, 36–39,202, 546Bias, 20Bifurcation, 292–300,313–315diagram, 294dimension of, 343Binary numbers, 17, 556Binary point, 19Binning, 295Bisection algorithm,152–154Bits, 17, 556reversal, 258Block walls, 392Blocking, 619Blue Gene, see IBM Blue,373Boltzmann distribution,393Boolean, 19, 556Bootable cluster, 620Bound states, 152–154,211–221, 225, 408,411–420, 435, 540–545Boundary conditions,198, 429, 437Box counting, 335–337,342Box–Muller method,141–145Break command, 451Broadcast, 373, 609Buffers, 354, 603, 604Burgers’ equation,510–514Bus, 362, 556Butterfly operation, 258Byte, 17, 556code, 8, 376, 556C language, 8, 58,624–627Cache, 385, 556data, 385misses, 385–387programming for,385–388Canonical ensemble, 393,425Capacitors, 67, 448–452Catenary, 488–491CD contents, 626Cellular automata,343–345Central difference, 148Central processing unit,see CPU, 353Central storage, 354Chaos, 289–299, 302,307–315Fourier analysis of, 317of pendulum, 302in phase space, 307–312Chi squared measure,186Child, 106, 556−101COPYRIGHT 2008, PRINCET O N UNIVE R S I T Y P R E S SEVALUATION COPY ONLY. NOT FOR USE IN COURSES.ALLpup_06.04 — 2008/2/15 — Page 651