Seite - 221 - in Programming for Computations – Python - A Gentle Introduction to Numerical Simulations with Python

Index 2nd-orderRunge-Kuttamethod,131 A algorithm,3 allocate, 17 argument, 31 keyword, 34 named, 34 ordinary, 34 positional, 34 array, 11, 17 element, 17 index, 17 sliceof,18 sorting,47 asarray (function), 118 assert (function), 72 assignment, 5 atan, 7 axis (plot), 20 B boolean, 29 expression, 29 False, 29 True, 29 boundary conditions, 162 brute forcemethod,186 bug,2, 3, 68 C C,2 C++,2 calculator, 5 cell, 164 class,168 closure, 168 code, 4 exception, 195 re-use, 63, 80 robust, 193 try-except, 195 colon, 29 comment, 4 commentingcode, 25 compartmentmodel, 111 compositemidpointmethod, 65 composite trapezoidal rule, 57 computational speed (measuring),77 computer program,1 convergence rate, 70 copy, 18 Crank-Nicolsonmethod, 140,156 D debugger, 22 debugging, 2,3, 22 def, 31 default, 15 demofunction,105 difference absolute, 72 backward, 130 centered, 131 forward,99, 130 relative, 72 differential equation first-order,96 second-order, 125 diffusionequation, 161 discontinuous coefficient, 123 divergence, 194 doc string,35 DocOnce, ix domain, 78, 82, 84, 162 complex, 84 double integral midpoint, 78 double sum,79 dynamical system,95 221