Solving nonlinear differential equations having periodic solutions (Q3150441)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1817303
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving nonlinear differential equations having periodic solutions |
scientific article; zbMATH DE number 1817303 |
Statements
Solving nonlinear differential equations having periodic solutions (English)
0 references
17 October 2002
0 references
nonlinear differential equations
0 references
periodic solution
0 references
initial value problem
0 references
routine ND-Solve
0 references
computer algebra system Mathematica
0 references
truncated Fourier series
0 references
0.7923708558082581
0 references
0.7919487953186035
0 references
0.77296382188797
0 references
0.7679567337036133
0 references
The authors consider the following initial value problem \[ \ddot x + x- \tfrac{1}{6}x^3 = 0,\quad x(0) = 0,\quad \dot x(0) = 1.\tag{1} \] The work is a methodological one. An approximate solution of the problem (1) is obtained with two approaches. The first method generates an approximate solution \(x_{1} (t)\) with the help of the routine ND-Solve of the computer algebra system Mathematica with working precision equals 34. The second approach represents the approximate solution \(f(t)\) as truncated Fourier series \(f(t)=\sum_{n=1}^{12}{b_{2n-1}sin(2n-1)\omega t}\) were the coeffitients \(b_{2n-1}, n=1,\dots,12\) are calculated by the squaring formulas \(b_n = \frac{2}{N} \sum_{I=0}^{N-1}{x_1(ih)\sin(n\omega it)}, N=1000, h=P/N, \omega = 2\pi P,.\) where \(P\) is the period of the numerical solution \(x_1(t)\). Then the authors analyze the accuracy of the obtained approximations \(x_1(t), f(t)\) with the explicit solution \(x(t)=\frac{1}{\lambda}sin(\lambda t, k), \lambda = \sqrt {3+\surd 6}\). The authors state that with an equal precision the second approach is much faster.
0 references