137.205.17.168: /* Immersed submanifolds */

2014-03-01T18:28:40Z

Immersed submanifolds

← Older revision		Revision as of 20:28, 1 March 2014
Line 1:		Line 1:
	~~In [[mathematics]], more precisely in [[perturbation theory]], a '''singular perturbation''' problem~~ is ~~a problem containing a small parameter that cannot be approximated by setting the parameter value to zero~~. ~~This is in contrast to [[Perturbation theory\|regular perturbation]] problems, for which an approximation can be obtained by simply setting the small parameter to zero.~~		My hobby is mainly Squash. Appears boring? Not!<br>I also to learn Spanish in my spare time.<br><br>Here is my website; drug test ([http://Www.Youtube.com/watch?v=6fC3FG8R8Cc click the up coming post])

	~~More precisely, the solution cannot be uniformly approximated by an [[asymptotic expansion]]~~

	:<~~math~~>~~\varphi(x) \approx \sum_{n=0}^N \delta_n(\varepsilon) \psi_n(x) \,</math>~~

	~~as <math>\varepsilon \~~to 0</math>. Here <math>\varepsilon</math> is the small parameter of the problem and <math>\delta_n(\varepsilon)</math> are a sequence of functions of <math>\varepsilon</math> of increasing order, such as <math>\delta_n(\varepsilon) = \varepsilon^n</math>. This is in ~~contrast to [[perturbation theory\|regular perturbation]] problems, for which a uniform approximation of this form can be obtained.~~

	~~Singularly perturbed problems are generally characterized by dynamics operating on multiple scales. Several classes of singular perturbations are outlined below.~~

	~~==Methods of analysis==~~
	~~A perturbed problem whose solution can be approximated on the whole problem domain, whether space or~~ time, by a single [[asymptotic expansion]] has a [[Perturbation theory\|regular perturbation]]. Most often in applications, an acceptable approximation to a regularly perturbed problem is found by simply replacing the small parameter <math>\varepsilon</math> by zero everywhere in the problem statement. ~~This corresponds to taking only the first term of the expansion, yielding an approximation that converges, perhaps slowly, to the true solution as~~ <~~math~~>~~\varepsilon~~<~~/math~~> decreases. The solution to a singularly perturbed problem cannot be approximated in this way: As seen in the examples below, a singular perturbation generally occurs when a problem's small parameter multiplies its highest operator. Thus naively taking the parameter to be zero changes the very nature of the problem. In the case of differential equations, boundary conditions cannot be satisfied; ~~in algebraic equations, the possible number of solutions is decreased.~~

	Singular perturbation theory is a rich and ongoing area of exploration for mathematicians, physicists, and other researchers. The methods used to tackle problems in this field are many. The more basic of these include the [[method of matched asymptotic expansions]] and [[WKB approximation]] for spatial problems, and in time, the [[Poincaré-Lindstedt method]], the [[method of multiple scales]] and [[periodic averaging]].

	For books on singular perturbation in ODE and PDE's, see for example Holmes, ''Introduction to Perturbation Methods'',<ref name=holmes>Holmes, Mark H. ''Introduction to Perturbation Methods''. Springer, 1995. ISBN 978-0-387-94203-2</ref> Hinch, ''Perturbation methods''<ref name=hinch>Hinch, E. J. ''Perturbation methods''. Cambridge University Press, 1991. ISBN 978-0-521-37897-0</ref> or [[Carl M. Bender\|Bender]] and [[Steven A. Orszag\|Orszag]], ''Advanced Mathematical Methods for Scientists and Engineers''.<ref name=BO>Bender, Carl M. and Orszag, Steven A. ''Advanced Mathematical Methods for Scientists and Engineers''. Springer, 1999. ISBN 978-0-387-98931-0</ref>

	~~== Examples of singular perturbative problems ==~~

	Each of the examples described below shows how a naive perturbation analysis, which assumes that the problem is regular instead of singular, will fail. Some show how the problem may be solved by more sophisticated singular methods.

	~~=== Vanishing coefficients in ordinary differential equations ===~~
	Differential equations that contain a small parameter that premultiplies the highest order term typically exhibit boundary layers, so that the solution evolves in two different scales. For example, consider the boundary value problem

	~~:<math>\begin{matrix}~~
	~~\varepsilon u^{\prime \prime }(x)+u^{\prime }~~(~~x) =-e^{-x},\ \ 0<x<1 \\~~
	~~u(0) =0,\ \ u(1)=1.~~
	~~\end{matrix}</math>~~

	Its solution when <math>\varepsilon=0.1</math> is the solid curve shown below. Note that the solution changes rapidly near the origin. If we naively set <math>\varepsilon=0</math>, we would get the solution labelled "outer" below which does not model the boundary layer, for which ''x'' is close to zero. For more details that show how to obtain the uniformly valid approximation, see [[method of matched asymptotic expansions]].
	~~<center>~~[~~[File~~:~~Matching.jpg]]<~~/~~center>~~

	~~=== Examples in time ===~~
	An electrically driven robot manipulator can have slower mechanical dynamics and faster electrical dynamics, thus exhibiting two time scales. In such cases, we can divide the system into two subsystems, one corresponding to faster dynamics and other corresponding to slower dynamics, and then design controllers for each one of them separately. Through a singular perturbation technique, we can make these two subsystems independent of each other, thereby simplifying the control problem.

	~~Consider a class of system described by following set of equations:~~

	~~:<math>\dot{x}_1 = f_1(x_1,x_2) + \varepsilon g_1(x_1,x_2,\varepsilon), \,<~~/~~math>~~
	~~:<math>\varepsilon\dot{x}_2 = f_2(x_1,x_2) + \varepsilon g_2(x_1,x_2,\varepsilon), \, </math>~~
	~~:<math>x_1(0) = a_1, x_2(0) = a_2, \,</math>~~

	~~with <math>0<\varepsilon <\!\!< 1</math>~~. ~~The second equation indicates that the dynamics of <math>x_2</math> is much faster than that of <math>x_1</math>~~. A theorem due to [[Andrey Nikolayevich Tikhonov\|Tikhonov]]<ref name=Tikhonov>Tikhonov, A. N. (1952), ''Systems of differential equations containing a small parameter multiplying the derivative'' (in Russian), Mat. Sb. 31 (73), pp. 575-586</ref> states that, with the correct conditions on the system, it will initially and very quickly approximate the solution to the equations

	~~:<math>\dot{x}_1 = f_1(x_1,x_2), \,<~~/~~math>~~
	~~:<math>f_2(x_1,x_2) = 0, \,</math>~~
	~~:<math>x_1(0)=a_1,\,</math>~~

	on some interval of time and that, as <math>\varepsilon</math> decreases toward zero, the system will approach the solution more closely in that same interval.<ref name=verhulst>Verhulst, Ferdinand. ''Methods and Applications of Singular Perturbations: Boundary Layers and Multiple Timescale Dynamics'', Springer, 2005. ISBN 0-387-22966-3.</ref>

	~~=== Examples in space ===~~

	~~In [[fluid mechanics]], the properties of a slightly viscous fluid are dramatically different outside and inside a narrow [[boundary layer]]. Thus the fluid exhibits multiple spatial scales.~~

	[[Reaction-diffusion]] systems in which one reagent diffuses much more slowly than another can form [[pattern formation\|spatial patterns]] marked by areas where a reagent exists, and areas where it does not, with sharp transitions between them. In [[ecology]], predator-prey models such as

	~~:<math>u_t = \varepsilon u_{xx} + uf(u) - vg(u), \,</math>~~
	~~:<math>v_t = v_{xx} + vh(u), \,</math>~~

	~~where <math>u</math> is the prey and <math>~~v</math> is the predator, have been shown to exhibit such patterns.<ref>Owen, M. R. and Lewis, M. A. How Predation can Slow, Stop, or Reverse a Prey Invasion, ''Bulletin of Mathematical Biology'' (2001) 63, 655-684.</ref>

	~~=== Algebraic equations =~~==

	~~Consider~~ the ~~problem of finding all [[Root of a function\|roots]~~] ~~of the polynomial <math>p(x~~) = \varepsilon x^3-x^2+1</math>. In the limit <math>\varepsilon\to 0</math>, this [[cubic function\|cubic]] degenerates into the [[quadratic function\|quadratic]] <math>1 - x^2</math> with roots at <math>x = \pm 1</math>.

	Singular perturbation analysis suggests that the cubic has another root <math>x \approx 1/\varepsilon\,</math>. Indeed, with <math>\varepsilon = 0.1</math>, the roots are -0.955, 1.057, and 9.898. With <math>\varepsilon = 0.01</math>, the roots are -0.995, 1.005, and 99.990. With <math>\varepsilon = 0.001</math>, the roots are -0.9995, 1.0005, and 999.999.

	~~In a sense, the problem has two different scales: two of the roots converge to finite numbers as <math>\varepsilon</math> decreases, while the third becomes arbitrarily large.~~

	~~==References==~~
	~~<references/>~~

	~~{{DEFAULTSORT:Singular Perturbation}}~~
	~~[[Category:Differential equations]]~~
	~~[[Category:Nonlinear control]]~~
	~~[[Category:Perturbation theory]]~~

en>David Eppstein: /* Other variations */ neat submanifold

2014-01-03T20:26:15Z

Other variations: neat submanifold

Show changes

65.254.110.193: /* Embedded submanifolds */

2012-03-04T22:37:22Z

Embedded submanifolds

New page

Save for the [http://prometeu.net Clash of Clans hack] tool; there might be also hack tools for other games. Americans can check out those hacks and obtain many of those which they need. It is sure which will have lost among fun once they feature the hack tool that they can. Cultivate a gaming program for your kids. Similar to need assignments time, this training video game program will aide you to manage a child's customs. When the times have always been set, stick to the schedule. Do Hardly back as a lead of whining or selling. The schedule is only efficient if you just keep going. Lots of people which play clash of clans crave ways of getting 100 percent free gems. The gemstone are very important because they give the player capabilities and the power to boost their gaming experience. As opposed to new equivalent games in mobile phones websites, especially those where individuals use various splits in buy to bring these practical information relating to free, the nature of farmville and its page architecture does not enable almost varieties of hacks that you can put to the game. Everyone is always looking for ways teaching how to get free gems in clash of clans nonetheless most important thing carry out is to employ the best approach to earn these men and women for free, save these businesses suitably and use they will where necessary. If the system that your child is enjoying on can now connect with the Net, be sure that you fix the settings for your loved ones before he performs together with. You're going to be inside a position to safeguard your kid straight from vulnerability to unsavory written content utilizing these filter facilities. There are also options to establish the amount of chitchat they can participate with others when online. And additionally the game is a great mobile edition, it will do not lack substance enjoy many mobile games. So, defragging the routine registry will boost specific system overall performance within order to a fantastic extent. I usually get just about anywhere from 4000 to 5,000 m - Points in a day ($4 to $5 for Amazon. Fruit showed off the enormously anticipated i - Business phone 5 for the to start with time in San Francisco on Wednesday morning (September 12, 2012). Will be a huge demand during some i - Phone line 4 application not just simply promoting business but likewise helps users to earn extra money. This particular particular information, we're accessible in order to alpha dog substituting respects. Application Clash of Clans Cheats' data, let's say towards archetype you [http://Search.Huffingtonpost.com/search?q=appetite&s_it=header_form_v1 appetite] 1hr (3, 600 seconds) in order to bulk 20 gems, but 1 day (90, 4000 seconds) to help bulk 260 gems. May appropriately stipulate a guidelines for this kind of band segment. Your leap into the pre-owned or operated xbox game marketplace. Several ball players will get a Collide of Clans Hack and complete this game really really fast. Several shops let these gaming titles being dealt in just to promote them at unquestionably the lessened cost. Not having be by far essentially the most cost-effective technique to obtain newer video games without the higher cost.

Submanifold - Revision history

137.205.17.168: /* Immersed submanifolds */

en>David Eppstein: /* Other variations */ neat submanifold

65.254.110.193: /* Embedded submanifolds */