Linearization

This MedLibrary.org supplementary page on Linearization is provided directly from the open source Wikipedia as a service to our readers. Please see the note below on authorship of this content, as well as the Wikipedia usage guidelines. To search for other content from our encyclopedia supplement, please use the form below:

Related Sponsors

BM Pharmacy Generic pharmaceuticals at unbeatable prices. Insomnia, men's health, hair health, pain control. bmpharmacy.com
Online Pharmacy Carisoprodol, tadalafil, sildenafil, vardenafil and more... xlpharmacy.com
MedBasket.com Discreet. Inexpensive. Fast shipping. Great selection. What more can we say? medbasket.com
Frugalmed 2000 reasons to shop with us first. frugalmed.com
Ads by Tiva

For the linearization in concurrent computing, see Linearizability.

In mathematics and its applications, linearization refers to finding the linear approximation to a function at a given point. In the study of dynamical systems, linearization is a method for assessing the local stability of an equilibrium point of a system of nonlinear differential equations or discrete dynamical systems1. This method is used in fields such as engineering, physics, economics, and ecology.

Contents

Linearization of a function

Linearizations of a function are lines — ones that are usually used for purposes of calculation. Linearization is an effective method for approximating the output of a function y = f(x) at any x = a based on the value and slope of the function at x = b, given that f(x) is continuous on a,b (or b,a)and that a is close to b. In, short, linearization approximates the output of a function near x = a.

For example, you might know that \sqrt{4} = 2. However, without a calculator, what would be a good approximation of \sqrt{4.001} = \sqrt{4 + .001}?

For any given function y = f(x), f(x) can be approximated if it is near a known continuous point. The most basic requisite is that, where La(x) is the linearization of f(x) at x = a, L(a) = f(a). The point-slope form of an equation forms an equation of a line, given a point (H,K) and slope M. The general form of this equation is: y − K = M(x − H).

Using the point (a,f(a)), La(x) becomes y = f(a) + M(x − a). Because continuous functions are locally linear, the best slope to substitute in would be the slope of the line tangent to f(x) at x = a.

While the concept of local linearity applies the most to points arbitrarily close to x = a, those relatively close work relatively well for linear approximations. After all, a linearization is only an approximation. The slope M should be, most accurately, the slope of the tangent line at x = a.

An approximation of f(x) at (x, f(x))

Visually, the accompanying diagram shows the tangent line of f(x) at x. At f(x + h), where h is any small positive or negative value, f(x+h) is very nearly the value of the tangent line at the point (x + h,L(x + h)).

The final equation for the linearization of a function at x = a is:

y = f(a) + f'(a)(x - a)\,

For x = a, f(a) = f(x). The derivative of f(x) is f'(x), and the slope of f(x) at a is f'(a).

Example

To find \sqrt{4.001}, we can use the fact that \sqrt{4} = 2. The linearization of f(x) = \sqrt{x} at x = a is y = \sqrt{a} + \frac{1}{2 \sqrt{a}}(x - a), because the function f'(x) = \frac{1}{2 \sqrt{x}} defines the slope of the function f(x) = \sqrt{x} at x. Plugging in a = 4, the linearization at 4 is y = 2 + \frac{x-4}{4}. In this case x = 4.001, so \sqrt{4.001} is approximately 2 + \frac{4.001-4}{4} = 2.00025. The true value is close to 2.00024998, so the linearization approximation has a relative error of less than 1 millionth of a percent.

Uses of linearization

Linearization makes it possible to use tools for studying linear systems to analyze the behavior of a nonlinear function near a given point. The linearization of a function is the first order term of its Taylor expansion around the point of interest. For a system defined by the equation

\frac{d\bold{x}}{dt} = \bold{F}(\bold{x},t),

the linearized system can be written as

\frac{d\bold{x}}{dt} = D\bold{F}(\bold{x_0},t) \cdot (\bold{x} - \bold{x_0})

where \bold{x_0} is the point of interest and D\bold{F}(\bold{x_0}) is the Jacobian of \bold{F}(\bold{x}) evaluated at \bold{x_0}.

Stability analysis

In stability analysis, one can use the eigenvalues of the Jacobian matrix evaluated at an equilibrium point to determine the nature of that equilibrium. If all the eigenvalues are positive, the equilibrium is unstable; if they are all negative the equilibrium is stable; and if the values are of mixed signs, the equilibrium is a saddle point. Any complex eigenvalues will appear in complex conjugate pairs and indicate spiral.

Microeconomics

In microeconomics, decision rules may be approximated under the state-space approach to linearization.2 Under this approach, the Euler equations of the utility maximization problem are linearized around the stationary steady state.2 A unique solution to the resulting system of dynamic equations then is found.2

See also

References

  1. ^ The linearization problem in complex dimension one dynamical systems at Scholarpedia
  2. ^ a b c Moffatt, Mike. (2008) About.com State-Space Approach Economics Glossary; Terms Beginning with S. Accessed June 19, 2008.

Wikipedia content modification information:

  • This page was last modified on 3 January 2009, at 13:13.

Wikipedia Authorship and Review

Wikipedia content provided here is not reviewed directly by MedLibrary.org. Wikipedia content is authored by an open community of volunteers and is not produced by or in any way affiliated with MedLibrary.org.

Wikipedia Usage Guidelines

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article on "Linearization".

The URL for this specific entry is:

All Wikipedia text is available under the terms of the GNU Free Documentation License. (See Copyrights for details). Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc.