Page - 319 - in Programming for Computations – Python - A Gentle Introduction to Numerical Simulations with Python 3.6, Volume Second Edition

Index Adams-Bashforth, three-step, 281 Adams-Bashforth, two-step, 280 Algorithm,4,12 Allocate,48 Argument, 13, 83 keyword, 83 named, 83 ordinary, 83 positional, 83 Array, 20, 47 copy, 50 element, 47 index, 47 numpy, 47 slice of, 51 sorting, 76 array (function), 20, 47,103 asarray (function), 233 assert statement, 155 assignment, 7 atan,13 Backward Eulermethod, 245 Block (of statements), 60 Boolean, 46 expression, 46 False, 46 True, 46 Boundary conditions, 288 Brute force method, 176 bug,3,4, 150 C,2 C++,2 Calculator, 11 Cell,159, 290 Class, 295 Closure, 295 Code, 6 commenting, 34 fast, 35 readable, 34 reuse, 113, 139, 159 robust, 184 typesetting, 5 Coding style, 5 Colon, 51, 60, 66 Command history, 40 Comment, 6 Commenting code, 34 Compartment model, 226 Composite midpointmethod, 142 Composite trapezoidal rule, 134 Compound statement, 96 interactively, 96 Computational plan, 96 Computational speed (measuring), 123, 148 Computer program, 1 Console, 39 Convergence rate, 152 Crank-Nicolson method,256, 276 Crash, 33 Curve multiple,24 single, 21 Debugger, 33 Debugging, 2,4, 33 Decimal module, 199 def, 79 Default value, 4, 80 demo function, 220 Difference absolute, 154 backward, 245 centered, 247 forward, 215, 245 relative, 154 Differential equation, 203 Diffusion equation, 287 ©The Author(s) 2020 S.Linge, H.P. Langtangen, Programming forComputations -Python, Texts in Computational Science and Engineering 15, https://doi.org/10.1007/978-3-030-16877-3 319