This article needs additional citations for verification. (January 2018)
In vector calculus, the gradient of a scalar-valued differentiable function f of several variables is the vector field (or vector-valued function) whose value at a point is the vector[a] whose components are the partial derivatives of at . That is, for , its gradient is defined at the point in n-dimensional space as the vector[b]
The gradient vector can be interpreted as the "direction and rate of fastest increase". If the gradient of a function is non-zero at a point p, the direction of the gradient is the direction in which the function increases most quickly from p, and the magnitude of the gradient is the rate of increase in that direction, the greatest absolute directional derivative. Further, the gradient is the zero vector at a point if and only if it is a stationary point (where the derivative vanishes). The gradient thus plays a fundamental role in optimization theory, where it is used to maximize a function by gradient ascent.
The gradient is dual to the total derivative : the value of the gradient at a point is a tangent vector – a vector at each point; while the value of the derivative at a point is a cotangent vector – a linear function on vectors.[c] They are related in that the dot product of the gradient of f at a point p with another tangent vector v equals the directional derivative of f at p of the function along v; that is, . The gradient admits multiple generalizations to more general functions on manifolds; see § Generalizations.
Consider a room where the temperature is given by a scalar field, T, so at each point (x, y, z) the temperature is T(x, y, z), independent of time. At each point in the room, the gradient of T at that point will show the direction in which the temperature rises most quickly, moving away from (x, y, z). The magnitude of the gradient will determine how fast the temperature rises in that direction.
Consider a surface whose height above sea level at point (x, y) is H(x, y). The gradient of H at a point is a plane vector pointing in the direction of the steepest slope or grade at that point. The steepness of the slope at that point is given by the magnitude of the gradient vector.
The gradient can also be used to measure how a scalar field changes in other directions, rather than just the direction of greatest change, by taking a dot product. Suppose that the steepest slope on a hill is 40%. A road going directly uphill has slope 40%, but a road going around the hill at an angle will have a shallower slope. For example, if the road is at a 60° angle from the uphill direction (when both directions are projected onto the horizontal plane), then the slope along the road will be the dot product between the gradient vector and a unit vector along the road, namely 40% times the cosine of 60°, or 20%.
More generally, if the hill height function H is differentiable, then the gradient of H dotted with a unit vector gives the slope of the hill in the direction of the vector, the directional derivative of H along the unit vector.
The gradient of a function at point is usually written as . It may also be denoted by any of the following:
- : to emphasize the vector nature of the result.
- grad f
- and : Einstein notation.
The gradient (or gradient vector field) of a scalar function f(x1, x2, x3, …, xn) is denoted ∇f or ∇→f where ∇ (nabla) denotes the vector differential operator, del. The notation grad f is also commonly used to represent the gradient. The gradient of f is defined as the unique vector field whose dot product with any vector v at each point x is the directional derivative of f along v. That is,
When a function also depends on a parameter such as time, the gradient often refers simply to the vector of its spatial derivatives only (see Spatial gradient).
where i, j, k are the standard unit vectors in the directions of the x, y and z coordinates, respectively. For example, the gradient of the function
In some applications it is customary to represent the gradient as a row vector or column vector of its components in a rectangular coordinate system; this article follows the convention of the gradient being a column vector, while the derivative is a row vector.
Cylindrical and spherical coordinatesEdit
where ρ is the axial distance, φ is the azimuthal or azimuth angle, z is the axial coordinate, and eρ, eφ and ez are unit vectors pointing along the coordinate directions.
where r is the radial distance, φ is the azimuthal angle and θ is the polar angle, and er, eθ and eφ are again local unit vectors pointing in the coordinate directions (that is, the normalized covariant basis).
For the gradient in other orthogonal coordinate systems, see Orthogonal coordinates (Differential operators in three dimensions).
We consider general coordinates, which we write as x1, …, xi, …, xn, where n is the number of dimensions of the domain. Here, the upper index refers to the position in the list of the coordinate or component, so x2 refers to the second component—not the quantity x squared. The index variable i refers to an arbitrary element xi. Using Einstein notation, the gradient can then be written as:
If the coordinates are orthogonal we can easily express the gradient (and the differential) in terms of the normalized bases, which we refer to as and , using the scale factors (also known as Lamé coefficients) :
where we cannot use Einstein notation, since it is impossible to avoid the repetition of more than two indices. Despite the use of upper and lower indices, , , and are neither contravariant nor covariant.
The latter expression evaluates to the expressions given above for cylindrical and spherical coordinates.
Relationship with derivativeEdit
Relationship with total derivativeEdit
The gradient is closely related to the total derivative (total differential) : they are transpose (dual) to each other. Using the convention that vectors in are represented by column vectors, and that covectors (linear maps ) are represented by row vectors,[a] the gradient and the derivative are expressed as a column and row vector, respectively, with the same components, but transpose of each other:
While these both have the same components, they differ in what kind of mathematical object they represent: at each point, the derivative is a cotangent vector, a linear form (covector) which expresses how much the (scalar) output changes for a given infinitesimal change in (vector) input, while at each point, the gradient is a tangent vector, which represents an infinitesimal change in (vector) input. In symbols, the gradient is an element of the tangent space at a point, , while the derivative is a map from the tangent space to the real numbers, . The tangent spaces at each point of can be "naturally" identified[d] with the vector space itself, and similarly the cotangent space at each point can be naturally identified with the dual vector space of covectors; thus the value of the gradient at a point can be thought of a vector in the original , not just as a tangent vector.
Computationally, given a tangent vector, the vector can be multiplied by the derivative (as matrices), which is equal to taking the dot product with the gradient:
Differential or (exterior) derivativeEdit
The best linear approximation to a differentiable function
at a point x in Rn is a linear map from Rn to R which is often denoted by dfx or Df(x) and called the differential or total derivative of f at x. The function df, which maps x to dfx, is called the total differential or exterior derivative of f and is an example of a differential 1-form.
Much as the derivative of a function of a single variable represents the slope of the tangent to the graph of the function, the directional derivative of a function in several variables represents the slope of the tangent hyperplane in the direction of the vector.
The gradient is related to the differential by the formula
for any v ∈ Rn, where is the dot product: taking the dot product of a vector with the gradient is the same as taking the directional derivative along the vector.
If Rn is viewed as the space of (dimension n) column vectors (of real numbers), then one can regard df as the row vector with components
so that dfx(v) is given by matrix multiplication. Assuming the standard Euclidean metric on Rn, the gradient is then the corresponding column vector, that is,
Linear approximation to a functionEdit
The best linear approximation to a function can be expressed in terms of the gradient, rather than the derivative. The gradient of a function f from the Euclidean space Rn to R at any particular point x0 in Rn characterizes the best linear approximation to f at x0. The approximation is as follows:
for x close to x0, where (∇f )x0 is the gradient of f computed at x0, and the dot denotes the dot product on Rn. This equation is equivalent to the first two terms in the multivariable Taylor series expansion of f at x0.
Relationship with Fréchet derivativeEdit
As a consequence, the usual properties of the derivative hold for the gradient, though the gradient is not a derivative itself, but rather dual to the derivative:
- The gradient is linear in the sense that if f and g are two real-valued functions differentiable at the point a ∈ Rn, and α and β are two constants, then αf + βg is differentiable at a, and moreover
- Product rule
- If f and g are real-valued functions differentiable at a point a ∈ Rn, then the product rule asserts that the product fg is differentiable at a, and
- Chain rule
- Suppose that f : A → R is a real-valued function defined on a subset A of Rn, and that f is differentiable at a point a. There are two forms of the chain rule applying to the gradient. First, suppose that the function g is a parametric curve; that is, a function g : I → Rn maps a subset I ⊂ R into Rn. If g is differentiable at a point c ∈ I such that g(c) = a, then
More generally, if instead I ⊂ Rk, then the following holds:
For the second form of the chain rule, suppose that h : I → R is a real valued function on a subset I of R, and that h is differentiable at the point f(a) ∈ I. Then
Further properties and applicationsEdit
A level surface, or isosurface, is the set of all points where some function has a given value.
If f is differentiable, then the dot product (∇f )x ⋅ v of the gradient at a point x with a vector v gives the directional derivative of f at x in the direction v. It follows that in this case the gradient of f is orthogonal to the level sets of f. For example, a level surface in three-dimensional space is defined by an equation of the form F(x, y, z) = c. The gradient of F is then normal to the surface.
More generally, any embedded hypersurface in a Riemannian manifold can be cut out by an equation of the form F(P) = 0 such that dF is nowhere zero. The gradient of F is then normal to the hypersurface.
Similarly, an affine algebraic hypersurface may be defined by an equation F(x1, ..., xn) = 0, where F is a polynomial. The gradient of F is zero at a singular point of the hypersurface (this is the definition of a singular point). At a non-singular point, it is a nonzero normal vector.
Conservative vector fields and the gradient theoremEdit
The gradient of a function is called a gradient field. A (continuous) gradient field is always a conservative vector field: its line integral along any path depends only on the endpoints of the path, and can be evaluated by the gradient theorem (the fundamental theorem of calculus for line integrals). Conversely, a (continuous) conservative vector field is always the gradient of a function.
The Jacobian matrix is the generalization of the gradient for vector-valued functions of several variables and differentiable maps between Euclidean spaces or, more generally, manifolds. A further generalization for a function between Banach spaces is the Fréchet derivative.
Suppose f : Rn → Rm is a function such that each of its first-order partial derivatives exist on ℝn. Then the Jacobian matrix of f is defined to be an m×n matrix, denoted by or simply . The (i,j)th entry is . Explicitly
Gradient of a vector fieldEdit
In rectangular coordinates, the gradient of a vector field f = ( f1, f2, f3) is defined by:
where gjk are the components of the inverse metric tensor and the ei are the coordinate basis vectors.
where ∇c is the connection.
For any smooth function f on a Riemannian manifold (M, g), the gradient of f is the vector field ∇f such that for any vector field X,
where gx( , ) denotes the inner product of tangent vectors at x defined by the metric g and ∂X f is the function that takes any point x ∈ M to the directional derivative of f in the direction X, evaluated at x. In other words, in a coordinate chart φ from an open subset of M to an open subset of Rn, (∂X f )(x) is given by:
where Xj denotes the jth component of X in this coordinate chart.
So, the local form of the gradient takes the form:
Generalizing the case M = Rn, the gradient of a function is related to its exterior derivative, since
More precisely, the gradient ∇f is the vector field associated to the differential 1-form df using the musical isomorphism
(called "sharp") defined by the metric g. The relation between the exterior derivative and the gradient of a function on Rn is a special case of this in which the metric is the flat metric given by the dot product.
|Wikimedia Commons has media related to Gradient fields.|
- This article uses the convention that column vectors represent vectors, and row vectors represent covectors, but the opposite convention is also common.
- Strictly speaking, the gradient is a vector field , and the value of the gradient at a point is a tangent vector in the tangent space at that point, , not a vector in the original space . However, all the tangent spaces can be naturally identified with the original space , so these do not need to be distinguished; see § Definition and relationship with the derivative.
- The value of the gradient at a point can be thought of as a vector in the original space , while the value of the derivative at a point can be thought of as a covector on the original space: a linear map .
- Informally, "naturally" identified means that this can be done without making any arbitrary choices. This can be formalized with a natural transformation.
- Kreyszig (1972, pp. 308–309)
- Stoker (1969, p. 292)
- Schey 1992, pp. 139–142.
- Protter & Morrey, Jr. (1970, pp. 21, 88)
- Beauregard & Fraleigh (1973, pp. 87, 248)
- Kreyszig (1972, pp. 333, 353, 496)
- Dubrovin, Fomenko & Novikov 1991, pp. 348–349.
- Bachman, David (2007), Advanced Calculus Demystified, New York: McGraw-Hill, ISBN 978-0-07-148121-2
- Beauregard, Raymond A.; Fraleigh, John B. (1973), A First Course In Linear Algebra: with Optional Introduction to Groups, Rings, and Fields, Boston: Houghton Mifflin Company, ISBN 0-395-14017-X
- Downing, Douglas, Ph.D. (2010), Barron's E-Z Calculus, New York: Barron's, ISBN 978-0-7641-4461-5
- Dubrovin, B. A.; Fomenko, A. T.; Novikov, S. P. (1991). Modern Geometry—Methods and Applications: Part I: The Geometry of Surfaces, Transformation Groups, and Fields. Graduate Texts in Mathematics (2nd ed.). Springer. ISBN 978-0-387-97663-1.
- Harper, Charlie (1976), Introduction to Mathematical Physics, New Jersey: Prentice-Hall, ISBN 0-13-487538-9
- Kreyszig, Erwin (1972), Advanced Engineering Mathematics (3rd ed.), New York: Wiley, ISBN 0-471-50728-8
- "McGraw Hill Encyclopedia of Science & Technology". McGraw-Hill Encyclopedia of Science & Technology (10th ed.). New York: McGraw-Hill. 2007. ISBN 978-0-07-144143-8.
- Moise, Edwin E. (1967), Calculus: Complete, Reading: Addison-Wesley
- Protter, Murray H.; Morrey, Jr., Charles B. (1970), College Calculus with Analytic Geometry (2nd ed.), Reading: Addison-Wesley, LCCN 76087042
- Schey, H. M. (1992). Div, Grad, Curl, and All That (2nd ed.). W. W. Norton. ISBN 0-393-96251-2. OCLC 25048561.
- Stoker, J. J. (1969), Differential Geometry, New York: Wiley, ISBN 0-471-82825-4
- Swokowski, Earl W.; Olinick, Michael; Pence, Dennis; Cole, Jeffery A. (1994), Calculus (6th ed.), Boston: PWS Publishing Company, ISBN 0-534-93624-5
|Look up gradient in Wiktionary, the free dictionary.|