Order of convergence of evolution operator method
Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Stability and convergence of numerical methods for ordinary differential equations (65L20)
The authors consider the initial value problem \((*)\) \(\dot x(t)= f(x(t)),\quad x(0)= \xi\), where \(x\in\mathbb{R}^n\), \(f: \mathbb{R}^n\to \mathbb{R}^n\). With \(L:= -i\sum^n_{k=1} f_k(x){\partial\over\partial x_k}\) the solution of problem \((*)\) can formally be expressed in the form \((**)\) \(x_k(t)= \{\exp(itL)x_k\}_{x= \xi}\), \(k= 1,\dots,n\), where \(G(L):= \exp(itL)\) is called evolution operator. The authors use \((**)\) to get an approximate solution to problem \((*)\) by using some very special approximation techniques for operators. The application of these techniques to the operator \(G\) formally yields a one-step method. It is shown that the order of convergence of this method is \(2N+1\) for an arbitrary value of \(N\) where \(N\) comes from the \([N+1,N]\) Padé approximation of the resolvent operator of \(G\).
This page was built for publication: Order of convergence of evolution operator method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4236110)