About: Method of averaging

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Method of averaging Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatDynamicalSystems, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FMethod_of_averaging

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.

Attributes	Values
rdf:type	yago:Abstraction100002137 yago:Attribute100024264 yago:DynamicalSystem106246361 yago:PhaseSpace100029114 yago:Space100028651 yago:WikicatDynamicalSystems
rdfs:label	Method of averaging (en)
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)
foaf:depiction
dcterms:subject	Dynamical systems
Wikipage page ID	3942941 (xsd:integer)
Wikipage revision ID	1080249108 (xsd:integer)
Link from a Wikipage to another Wikipage	Pendulum Variation of parameters Dynamical system Invariant manifold Mathematics Slow manifold Frequency Fundamental solution Equilibrium point Lipschitz continuity Krylov–Bogoliubov averaging method Perturbation theory Phase space Spiral Stability theory Hartman–Grobman theorem Celestial mechanics Hyperbolic set Dynamical systems Differentiability class Dithering Van der Pol oscillator Damped harmonic oscillator Logistic differential equation
sameAs	Method of averaging Method of averaging Method of averaging Method of averaging
dbp:wikiPageUsesTemplate	dbt:More_citations_needed dbt:Reflist
thumbnail	wiki-commons:Special:FilePath/Logistic_growth_equation.png?width=300
has 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)
prov:wasDerivedFrom	wikipedia-en:Method_of_averaging?oldid=1080249108&ns=0
page length (characters) of wiki page	23767 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Method_of_averaging
is Link from a Wikipage to another Wikipage of	Time-scale calculus Capacity factor IOV Multiple-scale analysis Phase reduction Method of Averaging
is Wikipage redirect of	Method of Averaging
is foaf:primaryTopic of	wikipedia-en:Method_of_averaging

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software