• No results found

Theoretical Concepts and Simulations

N/A
N/A
Protected

Academic year: 2022

Share "Theoretical Concepts and Simulations"

Copied!
7
0
0

Laster.... (Se fulltekst nå)

Fulltekst

(1)

S. Denisov MNTF, Uni Augsburg

1 / 7

(2)

An example: integration of nonlinear oscillator Equation of motion

¨

x=−γx˙−x−x3+asin(ωt) Two variables: coordinate x and velocity υ= ˙x.

Initial conditions: This is the state of the system at the initial instant of timet = 0,x(0) = 0 and υ(0) = 0.

Task: to propagate the system over the time t = 10T, where T = 2π/ω.

Overall error: E(N) =p

(x(sN)−x(N))2+ (υ(sN)−υ(N))2, s = 4.

Algorithms: Euler’s scheme and the 4th-order Runge-Kutta method(will discuss them latter on).

Number of stepsN is the number of integration steps per period T. It sets the time-step h=T/N.

2 / 7

(3)

An example: integration of nonlinear oscillator

Performances of the two algorithms

3 / 7

(4)

Euler method

4 / 7

(5)

RK4 method (N= 500)

5 / 7

(6)

6 / 7

(7)

7 / 7

Referanser

RELATERTE DOKUMENTER

I ordinary differential equations (ODEs): Euler method, predictor-corrector methods, Runge-Kutta method, some specific integrators;.. I basic matrix operations, linear

An example: Errors in calculations spherical Bessel functions The simplest solution is so-called Miller’s device: just use downward recursion, starting from some large value l =

The standard random-number generator produces numbers in this interval, each with an equal probability yet each independent of the previous number (as we shall see, numbers can also

Simpson’s rule requires the elementary integration to be over pairs of intervals, which in turn requires that the total number of intervals be even or that the number of points N

Theoretical Concepts and

Iterative solution of Poisson’s equation in 2d.. (see slide 9 of

equations, the development of numerical methods employed in relativistic simula- tions and their application in the numerical study of black holes and boson stars, the choice of

• Interconnect routing architectures. The flat routing architecture assumes that all nodes in the network run the same routing protocol. Different radios can be connected