Method of averaging (original) (raw)
In mathematics, more specifically in dynamical systems, the method of averaging (also called averaging theory) exploits systems containing time-scales separation: a fast oscillation versus a slow drift. It suggests that we perform an averaging over a given amount of time in order to iron out the fast oscillations and observe the qualitative behavior from the resulting dynamics. The approximated solution holds under finite time inversely proportional to the parameter denoting the slow time scale. It turns out to be a customary problem where there exists the trade off between how good is the approximated solution balanced by how much time it holds to be close to the original solution.
| Property | Value |
|---|---|
| dbo:abstract | In mathematics, more specifically in dynamical systems, the method of averaging (also called averaging theory) exploits systems containing time-scales separation: a fast oscillation versus a slow drift. It suggests that we perform an averaging over a given amount of time in order to iron out the fast oscillations and observe the qualitative behavior from the resulting dynamics. The approximated solution holds under finite time inversely proportional to the parameter denoting the slow time scale. It turns out to be a customary problem where there exists the trade off between how good is the approximated solution balanced by how much time it holds to be close to the original solution. More precisely, the system has the following form of a phase space variable The fast oscillation is given by versus a slow drift of . The averaging method yields an autonomous dynamical systemwhich approximates the solution curves of inside a connected and compact region of the phase space and over time of . Under the validity of this averaging technique, the asymptotic behavior of the original system is captured by the dynamical equation for . In this way, qualitative methods for autonomous dynamical systems may be employed to analyze the equilibria and more complex structures, such as slow manifold and invariant manifolds, as well as their stability in the phase space of the averaged system. In addition, in a physical application it might be reasonable or natural to replace a mathematical model, which is given in the form of the differential equation for , with the corresponding averaged system , in order to use the averaged system to make a prediction and then test the prediction against the results of a physical experiment. The averaging method has a long history, which is deeply rooted in perturbation problems that arose in celestial mechanics (see, for example in ). (en) |
| dbo:thumbnail | wiki-commons:Special:FilePath/Logistic_growth_equation.png?width=300 |
| dbo:wikiPageID | 3942941 (xsd:integer) |
| dbo:wikiPageLength | 23767 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1080249108 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Pendulum dbr:Variation_of_parameters dbr:Dynamical_system dbr:Invariant_manifold dbr:Mathematics dbr:Slow_manifold dbr:Frequency dbr:Fundamental_solution dbr:Equilibrium_point dbr:Lipschitz_continuity dbr:Krylov–Bogoliubov_averaging_method dbr:Perturbation_theory dbr:Phase_space dbr:Spiral dbr:Stability_theory dbr:Hartman–Grobman_theorem dbr:Celestial_mechanics dbr:Hyperbolic_set dbc:Dynamical_systems dbr:Differentiability_class dbr:Dithering dbr:Van_der_Pol_oscillator dbr:Damped_harmonic_oscillator dbr:Logistic_differential_equation dbr:File:Averaging_example_Crude_averaging_z_axis.png dbr:File:Logistic_growth_equation.png dbr:File:Restricting_time_scale.png dbr:File:Van_der_pol_qualitative.png |
| dbp:wikiPageUsesTemplate | dbt:More_citations_needed dbt:Reflist |
| dct:subject | dbc:Dynamical_systems |
| rdf:type | yago:Abstraction100002137 yago:Attribute100024264 yago:DynamicalSystem106246361 yago:PhaseSpace100029114 yago:Space100028651 yago:WikicatDynamicalSystems |
| rdfs:comment | In mathematics, more specifically in dynamical systems, the method of averaging (also called averaging theory) exploits systems containing time-scales separation: a fast oscillation versus a slow drift. It suggests that we perform an averaging over a given amount of time in order to iron out the fast oscillations and observe the qualitative behavior from the resulting dynamics. The approximated solution holds under finite time inversely proportional to the parameter denoting the slow time scale. It turns out to be a customary problem where there exists the trade off between how good is the approximated solution balanced by how much time it holds to be close to the original solution. (en) |
| rdfs:label | Method of averaging (en) |
| owl:sameAs | freebase:Method of averaging yago-res:Method of averaging wikidata:Method of averaging https://global.dbpedia.org/id/4rgQB |
| prov:wasDerivedFrom | wikipedia-en:Method_of_averaging?oldid=1080249108&ns=0 |
| foaf:depiction | wiki-commons:Special:FilePath/Averaging_example_Crude_averaging_z_axis.png wiki-commons:Special:FilePath/Logistic_growth_equation.png wiki-commons:Special:FilePath/Restricting_time_scale.png wiki-commons:Special:FilePath/Van_der_pol_qualitative.png |
| foaf:isPrimaryTopicOf | wikipedia-en:Method_of_averaging |
| is dbo:wikiPageRedirects of | dbr:Method_of_Averaging |
| is dbo:wikiPageWikiLink of | dbr:Time-scale_calculus dbr:Capacity_factor dbr:IOV dbr:Multiple-scale_analysis dbr:Phase_reduction dbr:Method_of_Averaging |
| is foaf:primaryTopic of | wikipedia-en:Method_of_averaging |
