previous up next ','..','$myPermit') ?> SYLLABUS  Previous: 1.3.5 Schrödinger  Up: 1 INTRODUCTION  Next: 1.4.1 Convergence, Richardson extrapolation


1.4 Numerical discretization


Slide : [ mesh - roof-top - spline - harmonic - wavelets - particles || VIDEO 99) echo " modem - ISDN - LAN "; else echo "login";?> ]

Numerical solutions are obtained by evolving a discrete set of values $ \{f_j\}$ , $ j=1,N$ with small steps in time $ \Delta t$ to approximate what really should be a continuous function of space and time $ f(x,t)$ , $ x\in[a;b]$ , $ t\ge t_0$ . Unfortunately, there is no universal method. Rather than blindly adopting a local favorite, your choice really should depend on

This course is a lot about advantages and limitations from a variety of methods. By analyzing model problems in a simple 1D slab, you learn the tricks that are important to know before you work with a higher number of dimensions. The broader perspective allows you to choose an optimal solution, where you can exploit the advantages and work around the limitations for your particular problem.



Subsections SYLLABUS  Previous: 1.3.5 Schrödinger  Up: 1 INTRODUCTION  Next: 1.4.1 Convergence, Richardson extrapolation