ODEs: Single variable equations that involve an arbitrary amount of derivatives of that function wrt that variable.
ODE System: System of ODEs. Linear or non linear.
Problem w non linear equations: harder. Linear eqs are simpler given boundary conditions.
Classical computers can only use non continuous data. So one can only estimate solutions of hard ODEs in a 1D region [t0, tf] by obtaining their images given a mesh {ti} = i(tf-t_0)/n, where n is a natural number greater than 0 that we can choose. Bigger n implies finer mesh but longer computation time (usualy of order ).
Given an ODE :
Choose N steps and p step size.
Get a mesh based on the previously chosen parameters.
Obtain initial conditions for x.
Fit a linear model for .
Repeat for all defined as .
If we choose bad step sizes, steps, etc, we might mess up and get an unstable model (i.e. a divergent model).
for 2nd order ODE n dimensional systems we have the option to create a 2n dimensional system where there are the n original 2nd order eqs written as the derivatives of the other n 1st order eqs that you can define. That way you can use vector Euler method. This strategy to augment the dimensionality of the system has been used in Hamiltonian mechanics.
The basic procedure is:
Convert ODE to a first order system
Write program that can solve first order systems
Get a numerical aproximation
In general we want .
Given a function we can obtain its Taylor Series expansion around :
up to .
Considering an approximation of order , we have the total number of steps being .
Predictor:
Corrector:
Family of methods based on the ability one has to obtain a Taylor approximation of a given function described as an ODE.
You can't conserve energy by solving the system using previous methods. The symplectic methods kinda conserve the energy by modifying Euler's method the following way: