A Postverification Method for Solving Forced Duffing Oscillator Problems without Prescribed Periods
This paper proposes a postverification method (PVM) for solving forced Duffing oscillator problems without prescribed periods. Comprising a postverification procedure and small random perturbation, the proposed PVM improves the sensitivity of the convergence of Newton’s iteration. Numerical simulati...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/317460 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper proposes a postverification method (PVM) for solving forced Duffing oscillator problems without prescribed periods. Comprising a postverification procedure and small random perturbation, the proposed PVM improves the sensitivity of the convergence of Newton’s iteration. Numerical simulations revealed that the PVM is more accurate and robust than Kubíček’s approach. We applied the PVM to previous research on bifurcation problems. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |