一键重装系统工具 | U盘启动盘制作工具 | 误删文件恢复软件 | 硬盘数据抢救专家 | 电脑蓝屏修复助手 | C盘空间清理神器 | 电脑驱动离线安装工具 | 微信聊天记录恢复工具 | 照片误格式化恢复 | 电脑密码破解清除工具 | 系统崩溃紧急救援盘 | 电脑加速优化大师 | 电脑开不了机怎么重装系统 | 回收站清空了怎么恢复 | 硬盘分区丢失数据恢复 | 电脑卡顿重装系统有用吗 | U盘插入提示格式化数据恢复 | 电脑中毒文件被隐藏恢复 | 忘记电脑开机密码怎么办 | 新硬盘分区对齐工具 | 旧电脑装Win10流畅工具 | SD卡照片删除恢复免费版 | 移动硬盘打不开提示损坏修复 | 电脑无故重启系统修复工具 | 电脑小白一键重装神器 | 程序员电脑环境配置助手 | 设计师电脑字体/素材恢复工具 | 网吧网管系统维护工具箱 | 财务人员电脑发票备份恢复 | 学生党免费电脑系统安装包 | 电脑维修师傅必备工具盘 | 游戏玩家电脑性能优化助手 | 办公白领误删文档恢复软件 | 自媒体视频素材恢复工具 | 网课录制视频损坏修复工具 | 最好的U盘PE系统排名 | 数据恢复软件哪个最强 | 免费电脑助手与收费版区别 | 国产装机工具哪款无广告 | 离线版驱动助手推荐 | 轻量级电脑优化工具对比 | 支持NVMe驱动的PE工具 | 带网络功能的应急启动盘 | 2026最新版万能装机工具 | 支持Win11 24H2的PE工具 | 最新免激活系统重装工具 | 2026数据恢复软件破解版合集 | 纯净无捆绑装机助手V3.0 | 支持苹果M芯片的电脑助手 | 秋季更新版系统维护工具箱 | 电脑系统崩了怎么用U盘把重要资料拷贝出来 | 重装系统前哪些文件夹必须备份 | 固态硬盘误格式化还能恢复数据吗 | 如何制作一个既带PE又能存数据的双分区U盘 | 电脑总是弹窗广告用什么助手彻底拦截 后台管理
📢 欢迎访问系统之家!所有资源均经过安全检测。

Gradient

发布时间:2026-09-14 | 浏览:1
📥 下载地址(文章开头)
繁体系统安装。
Fundamental theorem Rolle's theorem Mean value theorem Inverse function theorem Derivative ( generalizations ) Differential infinitesimal of a function total Differentiation notation Second derivative Implicit differentiation Logarithmic differentiation Taylor's theorem L'Hôpital's rule General Leibniz Faà di Bruno's formula Lists of integrals Integral transform Leibniz integral rule Integral ( improper ) Riemann integral Lebesgue integration Contour integration Integral of inverse functions Nonelementary integral Cylindrical shells Substitution ( trigonometric , tangent half-angle , Euler ) Euler's formula Partial fractions ( Heaviside's method ) Reduction formulae Differentiating under the integral sign Risch algorithm Geometric ( arithmetico-geometric ) Summand limit (term test) Direct comparison Limit comparison Alternating series Cauchy condensation Directional derivative Generalized Stokes Helmholtz decomposition Partial derivative Multiple integral Surface integral Volume integral Calculus on Euclidean space Generalized functions Limit of distributions Integration Bee Mathematical analysis Nonstandard analysis In vector calculus , the gradient of a scalar-valued differentiable function f {\displaystyle f} of several variables is the vector field (or vector-valued function ) ∇ f {\displaystyle \nabla f} whose value at a point p {\displaystyle p} gives the direction and the rate of fastest increase. The gradient transforms like a vector under change of basis of the space of variables of f {\displaystyle f} . If the gradient of a function is non-zero at a point p {\displaystyle p} , the direction of the gradient is the direction in which the function increases most quickly from p {\displaystyle p} , and the magnitude of the gradient is the rate of increase in that direction, the greatest absolute directional derivative . [ 1 ] Further, a point where the gradient is the zero vector is known as a stationary point . The gradient thus plays a fundamental role in optimization theory , machine learning , and artificial intelligence , where it is used to minimize a function by gradient descent . In coordinate-free terms, the gradient of a function f ( r ) {\displaystyle f(\mathbf {r} )} may be defined by: d f = ∇ f ⋅ d r {\displaystyle df=\nabla f\cdot d\mathbf {r} } where d f {\displaystyle df} is the total infinitesimal change in f {\displaystyle f} for an infinitesimal displacement d r {\displaystyle d\mathbf {r} } , and is seen to be maximal when d r {\displaystyle d\mathbf {r} } is in the direction of the gradient ∇ f {\displaystyle \nabla f} . The nabla symbol ∇ {\displaystyle \nabla } , written as an upside-down triangle and pronounced "del", denotes the vector differential operator . When a coordinate system is used in which the basis vectors are not functions of position, the gradient is given by the vector [ a ] whose components are the partial derivatives of f {\displaystyle f} at p {\displaystyle p} . [ 2 ] That is, for f : R n → R {\displaystyle f\colon \mathbb {R} ^{n}\to \mathbb {R} } , its gradient ∇ f : R n → R n {\displaystyle \nabla f\colon \mathbb {R} ^{n}\to \mathbb {R} ^{n}} is defined at the point p = ( x 1 , … , x n ) {\displaystyle p=(x_{1},\ldots ,x_{n})} in n -dimensional space as the vector [ b ] ∇ f ( p ) = [ ∂ f ∂ x 1 ( p ) ⋮ ∂ f ∂ x n ( p ) ] {\displaystyle \nabla f(p)={\begin{bmatrix}{\frac {\partial f}{\partial x_{1}}}(p)\\\vdots \\{\frac {\partial f}{\partial x_{n}}}(p)\end{bmatrix}}} . Note that the above definition for gradient is defined for the function f {\displaystyle f} only if f {\displaystyle f} is differentiable at p {\displaystyle p} . There can be functions for which partial derivatives exist in every direction but fail to be differentiable. Furthermore, this definition as the vector of partial derivatives is only valid when the basis of the coordinate system is orthonormal . For any other basis, the metric tensor at that point needs to be taken into account. For example, the function f ( x , y ) = x 2 y x 2 + y 2 {\displaystyle f(x,y)={\frac {x^{2}y}{x^{2}+y^{2}}}} unless at origin where f ( 0 , 0 ) = 0 {\displaystyle f(0,0)=0} , is not differentiable at the origin as it does not have a well defined tangent plane despite having well defined partial derivatives in every direction at the origin. [ 3 ] In this particular example, under rotation of x-y coordinate system, the above formula for gradient fails to transform like a vector (gradient becomes dependent on choice of basis for coordinate system) and also fails to point towards the 'steepest ascent' in some orientations. For differentiable functions where the formula for gradient holds, it can be shown to always transform as a vector under transformation of the basis so as to always point towards the fastest increase. The gradient is dual to the total derivative d f {\displaystyle df} : 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 co tangent vector – a linear functional on vectors. [ c ] They are related in that the dot product of the gradient of f {\displaystyle f} at a point p {\displaystyle p} with another tangent vector v {\displaystyle \mathbf {v} } equals the directional derivative of f {\displaystyle f} at p {\displaystyle p} of the function along v {\displaystyle \mathbf {v} } ; that is, ∇ f ( p ) ⋅ v = ∂ f ∂ v ( p ) = d f p ( v ) {\textstyle \nabla f(p)\cdot \mathbf {v} ={\frac {\partial f}{\partial \mathbf {v} }}(p)=df_{p}(\mathbf {v} )} . 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, as the dot product measures how much the unit vector along the road aligns with the steepest slope, [ d ] which is 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 f {\displaystyle f} at point a {\displaystyle a} is usually written as ∇ f ( a ) {\displaystyle \nabla f(a)} . It may also be denoted by any of the following: ∇ → f ( a ) {\displaystyle {\vec {\nabla }}f(a)} : to emphasize the vector nature of the result. grad ⁡ f {\displaystyle \operatorname {grad} f} ∂ i f {\displaystyle \partial _{i}f} and f , i {\displaystyle f_{,i}} : Written with Einstein notation , where repeated indices ( i ) are summed over. The gradient (or gradient vector field) of a scalar function f ( x 1 , x 2 , x 3 , …, x n ) 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 unit vector v ^ {\displaystyle \mathbf {\hat {v}} } at each point x is the directional derivative of f along v . That is, ( ∇ f ( x ) ) ⋅ v ^ = D v f ( x ) {\displaystyle {\big (}\nabla f(x){\big )}\cdot {\hat {\mathbf {v} }}=D_{\mathbf {v} }f(x)} where the right-hand side is the directional derivative and there are many ways to represent it. Formally, the derivative is dual to the gradient; see relationship with derivative . 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 ). The magnitude and direction of the gradient vector are independent of the particular coordinate representation . [ 4 ] [ 5 ] Cartesian coordinates In the three-dimensional Cartesian coordinate system with a Euclidean metric , the gradient, if it exists, is given by ∇ f = ∂ f ∂ x i + ∂ f ∂ y j + ∂ f ∂ z k , {\displaystyle \nabla f={\frac {\partial f}{\partial x}}\mathbf {i} +{\frac {\partial f}{\partial y}}\mathbf {j} +{\frac {\partial f}{\partial z}}\mathbf {k} ,} 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 f ( x , y , z ) = 2 x + 3 y 2 − sin ⁡ ( z ) {\displaystyle f(x,y,z)=2x+3y^{2}-\sin(z)} is ∇ f ( x , y , z ) = 2 i + 6 y j − cos ⁡ ( z ) k . {\displaystyle \nabla f(x,y,z)=2\mathbf {i} +6y\mathbf {j} -\cos(z)\mathbf {k} .} or ∇ f ( x , y , z ) = [ 2 6 y − cos ⁡ z ] . {\displaystyle \nabla f(x,y,z)={\begin{bmatrix}2\\6y\\-\cos z\end{bmatrix}}.} 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 coordinates In cylindrical coordinates , the gradient is given by: [ 6 ] ∇ f ( ρ , φ , z ) = ∂ f ∂ ρ e ρ + 1 ρ ∂ f ∂ φ e φ + ∂ f ∂ z e z , {\displaystyle \nabla f(\rho ,\varphi ,z)={\frac {\partial f}{\partial \rho }}\mathbf {e} _{\rho }+{\frac {1}{\rho }}{\frac {\partial f}{\partial \varphi }}\mathbf {e} _{\varphi }+{\frac {\partial f}{\partial z}}\mathbf {e} _{z},} where ρ is the axial distance, φ is the azimuthal or azimuth angle, z is the axial coordinate, and e ρ , e φ and e z are unit vectors pointing along the coordinate directions. In spherical coordinates with a Euclidean metric, the gradient is given by: [ 6 ] ∇ f ( r , θ , φ ) = ∂ f ∂ r e r + 1 r ∂ f ∂ θ e θ + 1 r sin ⁡ θ ∂ f ∂ φ e φ , {\displaystyle \nabla f(r,\theta ,\varphi )={\frac {\partial f}{\partial r}}\mathbf {e} _{r}+{\frac {1}{r}}{\frac {\partial f}{\partial \theta }}\mathbf {e} _{\theta }+{\frac {1}{r\sin \theta }}{\frac {\partial f}{\partial \varphi }}\mathbf {e} _{\varphi },} where r is the radial distance, φ is the azimuthal angle and θ is the polar angle, and e r , 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) . General coordinates We consider general coordinates , which we write as x 1 , …, x i , …, x n , 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 x 2 refers to the second component—not the quantity x squared. The index variable i refers to an arbitrary element x i . Using Einstein notation , the gradient can then be written as: ∇ f = ∂ f ∂ x i g i j e j {\displaystyle \nabla f={\frac {\partial f}{\partial x^{i}}}g^{ij}\mathbf {e} _{j}} (Note that its dual is d f = ∂ f ∂ x i e i {\textstyle \mathrm {d} f={\frac {\partial f}{\partial x^{i}}}\mathbf {e} ^{i}} ), where e i = d x i {\displaystyle \mathbf {e} ^{i}=\mathrm {d} x^{i}} and e i = ∂ x / ∂ x i {\displaystyle \mathbf {e} _{i}=\partial \mathbf {x} /\partial x^{i}} refer to the unnormalized local covariant and contravariant bases respectively, g i j {\displaystyle g^{ij}} is the inverse metric tensor , and the Einstein summation convention implies summation over i and j . 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 e ^ i {\displaystyle {\hat {\mathbf {e} }}_{i}} and e ^ i {\displaystyle {\hat {\mathbf {e} }}^{i}} , using the scale factors (also known as Lamé coefficients ) h i = ‖ e i ‖ = g i i = 1 / ‖ e i ‖ {\displaystyle h_{i}=\lVert \mathbf {e} _{i}\rVert ={\sqrt {g_{ii}}}=1\,/\lVert \mathbf {e} ^{i}\rVert } : ∇ f = ∂ f ∂ x i g i j e ^ j g j j = ∑ i = 1 n ∂ f ∂ x i 1 h i e ^ i {\displaystyle \nabla f={\frac {\partial f}{\partial x^{i}}}g^{ij}{\hat {\mathbf {e} }}_{j}{\sqrt {g_{jj}}}=\sum _{i=1}^{n}\,{\frac {\partial f}{\partial x^{i}}}{\frac {1}{h_{i}}}\mathbf {\hat {e}} _{i}} (and d f = ∑ i = 1 n ∂ f ∂ x i 1 h i e ^ i {\textstyle \mathrm {d} f=\sum _{i=1}^{n}\,{\frac {\partial f}{\partial x^{i}}}{\frac {1}{h_{i}}}\mathbf {\hat {e}} ^{i}} ), 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, e ^ i {\displaystyle \mathbf {\hat {e}} _{i}} , e ^ i {\displaystyle \mathbf {\hat {e}} ^{i}} , and h i {\displaystyle h_{i}} are neither contravariant nor covariant. The latter expression evaluates to the expressions given above for cylindrical and spherical coordinates. Relationship with derivative Fundamental theorem Rolle's theorem Mean value theorem Inverse function theorem Derivative ( generalizations ) Differential infinitesimal of a function total Differentiation notation Second derivative Implicit differentiation Logarithmic differentiation Taylor's theorem L'Hôpital's rule General Leibniz Faà di Bruno's formula Lists of integrals Integral transform Leibniz integral rule Integral ( improper ) Riemann integral Lebesgue integration Contour integration Integral of inverse functions Nonelementary integral Cylindrical shells Substitution ( trigonometric , tangent half-angle , Euler ) Euler's formula Partial fractions ( Heaviside's method ) Reduction formulae Differentiating under the integral sign Risch algorithm Geometric ( arithmetico-geometric ) Summand limit (term test) Direct comparison Limit comparison Alternating series Cauchy condensation Directional derivative Generalized Stokes Helmholtz decomposition Partial derivative Multiple integral Surface integral Volume integral Calculus on Euclidean space Generalized functions Limit of distributions Integration Bee Mathematical analysis Nonstandard analysis Relationship with total derivative The gradient is closely related to the total derivative ( total differential ) d f {\displaystyle df} : they are transpose ( dual ) to each other. Using the convention that vectors in R n {\displaystyle \mathbb {R} ^{n}} are represented by column vectors , and that covectors (linear maps R n → R {\displaystyle \mathbb {R} ^{n}\to \mathbb {R} } ) are represented by row vectors , [ a ] the gradient ∇ f {\displaystyle \nabla f} and the derivative d f {\displaystyle df} are expressed as a column and row vector, respectively, with the same components, but transpose of each other: ∇ f ( p ) = [ ∂ f ∂ x 1 ( p ) ⋮ ∂ f ∂ x n ( p ) ] ; {\displaystyle \nabla f(p)={\begin{bmatrix}{\frac {\partial f}{\partial x_{1}}}(p)\\\vdots \\{\frac {\partial f}{\partial x_{n}}}(p)\end{bmatrix}};} d f p = [ ∂ f ∂ x 1 ( p ) ⋯ ∂ f ∂ x n ( p ) ] . {\displaystyle df_{p}={\begin{bmatrix}{\frac {\partial f}{\partial x_{1}}}(p)&\cdots &{\frac {\partial f}{\partial x_{n}}}(p)\end{bmatrix}}.} 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 (or 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, ∇ f ( p ) ∈ T p R n {\displaystyle \nabla f(p)\in T_{p}\mathbb {R} ^{n}} , while the derivative is a map from the tangent space to the real numbers, d f p : T p R n → R {\displaystyle df_{p}\colon T_{p}\mathbb {R} ^{n}\to \mathbb {R} } . The tangent spaces at each point of R n {\displaystyle \mathbb {R} ^{n}} can be "naturally" identified [ e ] with the vector space R n {\displaystyle \mathbb {R} ^{n}} itself, and similarly the cotangent space at each point can be naturally identified with the dual vector space ( R n ) ∗ {\displaystyle (\mathbb {R} ^{n})^{*}} of covectors; thus the value of the gradient at a point can be thought of a vector in the original R n {\displaystyle \mathbb {R} ^{n}} , 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: ( d f p ) ( v ) = [ ∂ f ∂ x 1 ( p ) ⋯ ∂ f ∂ x n ( p ) ] [ v 1 ⋮ v n ] = ∑ i = 1 n ∂ f ∂ x i ( p ) v i = [ ∂ f ∂ x 1 ( p ) ⋮ ∂ f ∂ x n ( p ) ] ⋅ [ v 1 ⋮ v n ] = ∇ f ( p ) ⋅ v {\displaystyle (df_{p})(v)={\begin{bmatrix}{\frac {\partial f}{\partial x_{1}}}(p)&\cdots &{\frac {\partial f}{\partial x_{n}}}(p)\end{bmatrix}}{\begin{bmatrix}v_{1}\\\vdots \\v_{n}\end{bmatrix}}=\sum _{i=1}^{n}{\frac {\partial f}{\partial x_{i}}}(p)v_{i}={\begin{bmatrix}{\frac {\partial f}{\partial x_{1}}}(p)\\\vdots \\{\frac {\partial f}{\partial x_{n}}}(p)\end{bmatrix}}\cdot {\begin{bmatrix}v_{1}\\\vdots \\v_{n}\end{bmatrix}}=\nabla f(p)\cdot v} Differential or (exterior) derivative The best linear approximation to a differentiable function f : R n → R {\displaystyle f:\mathbb {R} ^{n}\to \mathbb {R} } at a point x {\displaystyle x} in R n {\displaystyle \mathbb {R} ^{n}} is a linear map from R n {\displaystyle \mathbb {R} ^{n}} to R {\displaystyle \mathbb {R} } which is often denoted by d f x {\displaystyle df_{x}} or D f ( x ) {\displaystyle Df(x)} and called the differential or total derivative of f {\displaystyle f} at x {\displaystyle x} . The function d f {\displaystyle df} , which maps x {\displaystyle x} to d f x {\displaystyle df_{x}} , is called the total differential or exterior derivative of f {\displaystyle 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, [ 7 ] 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 ( ∇ f ) x ⋅ v = d f x ( v ) {\displaystyle (\nabla f)_{x}\cdot v=df_{x}(v)} for any v ∈ R n {\displaystyle v\in \mathbb {R} ^{n}} , where ⋅ {\displaystyle \cdot } 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 R n {\displaystyle \mathbb {R} ^{n}} is viewed as the space of (dimension n {\displaystyle n} ) column vectors (of real numbers), then one can regard d f {\displaystyle df} as the row vector with components ( ∂ f ∂ x 1 , … , ∂ f ∂ x n ) , {\displaystyle \left({\frac {\partial f}{\partial x_{1}}},\dots ,{\frac {\partial f}{\partial x_{n}}}\right),} so that d f x ( v ) {\displaystyle df_{x}(v)} is given by matrix multiplication . Assuming the standard Euclidean metric on R n {\displaystyle \mathbb {R} ^{n}} , the gradient is then the corresponding column vector, that is, ( ∇ f ) i = d f i T . {\displaystyle (\nabla f)_{i}=df_{i}^{\mathsf {T}}.} Linear approximation to a function 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 {\displaystyle f} from the Euclidean space R n {\displaystyle \mathbb {R} ^{n}} to R {\displaystyle \mathbb {R} } at any particular point x 0 {\displaystyle x_{0}} in R n {\displaystyle \mathbb {R} ^{n}} characterizes the best linear approximation to f {\displaystyle f} at x 0 {\displaystyle x_{0}} . The approximation is as follows: f ( x ) ≈ f ( x 0 ) + ( ∇ f ) x 0 ⋅ ( x − x 0 ) {\displaystyle f(x)\approx f(x_{0})+(\nabla f)_{x_{0}}\cdot (x-x_{0})} for x {\displaystyle x} close to x 0 {\displaystyle x_{0}} , where ( ∇ f ) x 0 {\displaystyle (\nabla f)_{x_{0}}} is the gradient of f {\displaystyle f} computed at x 0 {\displaystyle x_{0}} , and the dot denotes the dot product on R n {\displaystyle \mathbb {R} ^{n}} . This equation is equivalent to the first two terms in the multivariable Taylor series expansion of f {\displaystyle f} at x 0 {\displaystyle x_{0}} . Relationship with Fréchet derivative Let U be an open set in R n . If the function f : U → R is differentiable, then the differential of f is the Fréchet derivative of f . Thus ∇ f is a function from U to the space R n such that lim h → 0 | f ( x + h ) − f ( x ) − ∇ f ( x ) ⋅ h | ‖ h ‖ = 0 , {\displaystyle \lim _{h\to 0}{\frac {|f(x+h)-f(x)-\nabla f(x)\cdot h|}{\|h\|}}=0,} where · is the dot product. 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: More generally, if instead I ⊂ R k , then the following holds: ∇ ( f ∘ g ) ( c ) = ( D g ( c ) ) T ( ∇ f ( a ) ) , {\displaystyle \nabla (f\circ g)(c)={\big (}Dg(c){\big )}^{\mathsf {T}}{\big (}\nabla f(a){\big )},} where ( Dg ) T denotes the transpose Jacobian matrix . 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 ∇ ( h ∘ f ) ( a ) = h ′ ( f ( a ) ) ∇ f ( a ) . {\displaystyle \nabla (h\circ f)(a)=h'{\big (}f(a){\big )}\nabla f(a).} Further properties and applications 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 ( x 1 , ..., x n ) = 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 theorem 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. Gradient is direction of steepest ascent The gradient of a function f : R n → R {\displaystyle f\colon \mathbb {R} ^{n}\to \mathbb {R} } at point x is also the direction of its steepest ascent, i.e. it maximizes its directional derivative : Let v ∈ R n {\displaystyle v\in \mathbb {R} ^{n}} be an arbitrary unit vector. With the directional derivative defined as ∇ v f ( x ) = lim h → 0 f ( x + v h ) − f ( x ) h , {\displaystyle \nabla _{v}f(x)=\lim _{h\rightarrow 0}{\frac {f(x+vh)-f(x)}{h}},} we get, by substituting the function f ( x + v h ) {\displaystyle f(x+vh)} with its Taylor series , ∇ v f ( x ) = lim h → 0 ( f ( x ) + ∇ f ⋅ v h + R ) − f ( x ) h , {\displaystyle \nabla _{v}f(x)=\lim _{h\rightarrow 0}{\frac {(f(x)+\nabla f\cdot vh+R)-f(x)}{h}},} where R {\displaystyle R} denotes higher order terms in v h {\displaystyle vh} . Dividing by h {\displaystyle h} , and taking the limit yields a term which is bounded from above by the Cauchy–Schwarz inequality [ 8 ] | ∇ v f ( x ) | = | ∇ f ⋅ v | ≤ | | ∇ f | | | | v | | = | | ∇ f | | . {\displaystyle |\nabla _{v}f(x)|=|\nabla f\cdot v|\leq ||\nabla f||||v||=||\nabla f||.} Choosing v ∗ = ∇ f / | | ∇ f | | {\displaystyle v^{*}=\nabla f/||\nabla f||} maximizes the directional derivative, and equals the upper bound | ∇ v ∗ f ( x ) | = | | ∇ f | | 2 / | | ∇ f | | = | | ∇ f | | . {\displaystyle |\nabla _{v^{*}}f(x)|=||\nabla f||^{2}/||\nabla f||=||\nabla f||.} Generalizations 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 . [ 9 ] [ 10 ] A further generalization for a function between Banach spaces is the Fréchet derivative . Suppose f : R n → R m 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 J f ( x ) {\displaystyle \mathbf {J} _{\mathbb {f} }(\mathbb {x} )} or simply J {\displaystyle \mathbf {J} } . The ( i , j ) th entry is J i j = ∂ f i / ∂ x j {\textstyle \mathbf {J} _{ij}={\partial f_{i}}/{\partial x_{j}}} . Explicitly J = [ ∂ f ∂ x 1 ⋯ ∂ f ∂ x n ] = [ ∇ T f 1 ⋮ ∇ T f m ] = [ ∂ f 1 ∂ x 1 ⋯ ∂ f 1 ∂ x n ⋮ ⋱ ⋮ ∂ f m ∂ x 1 ⋯ ∂ f m ∂ x n ] . {\displaystyle \mathbf {J} ={\begin{bmatrix}{\dfrac {\partial \mathbf {f} }{\partial x_{1}}}&\cdots &{\dfrac {\partial \mathbf {f} }{\partial x_{n}}}\end{bmatrix}}={\begin{bmatrix}\nabla ^{\mathsf {T}}f_{1}\\\vdots \\\nabla ^{\mathsf {T}}f_{m}\end{bmatrix}}={\begin{bmatrix}{\dfrac {\partial f_{1}}{\partial x_{1}}}&\cdots &{\dfrac {\partial f_{1}}{\partial x_{n}}}\\\vdots &\ddots &\vdots \\{\dfrac {\partial f_{m}}{\partial x_{1}}}&\cdots &{\dfrac {\partial f_{m}}{\partial x_{n}}}\end{bmatrix}}.} Gradient of a vector field Since the total derivative of a vector field is a linear mapping from vectors to vectors, it is a tensor quantity. In rectangular coordinates, the gradient of a vector field f = ( f 1 , f 2 , f 3 ) is defined by: ∇ f = g j k ∂ f i ∂ x j e i ⊗ e k , {\displaystyle \nabla \mathbf {f} =g^{jk}{\frac {\partial f^{i}}{\partial x^{j}}}\mathbf {e} _{i}\otimes \mathbf {e} _{k},}
📥 下载地址(文章中间)
繁体系统安装。
(where the Einstein summation notation is used and the tensor product of the vectors e i and e k is a dyadic tensor of type (2,0)). Overall, this expression equals the transpose of the Jacobian matrix: ∂ f i ∂ x j = ∂ ( f 1 , f 2 , f 3 ) ∂ ( x 1 , x 2 , x 3 ) . {\displaystyle {\frac {\partial f^{i}}{\partial x^{j}}}={\frac {\partial (f^{1},f^{2},f^{3})}{\partial (x^{1},x^{2},x^{3})}}.} In curvilinear coordinates, or more generally on a curved manifold , the gradient involves Christoffel symbols : ∇ f = g j k ( ∂ f i ∂ x j + Γ i j l f l ) e i ⊗ e k , {\displaystyle \nabla \mathbf {f} =g^{jk}\left({\frac {\partial f^{i}}{\partial x^{j}}}+{\Gamma ^{i}}_{jl}f^{l}\right)\mathbf {e} _{i}\otimes \mathbf {e} _{k},} where g jk are the components of the inverse metric tensor and the e i are the coordinate basis vectors. Expressed more invariantly, the gradient of a vector field f can be defined by the Levi-Civita connection and metric tensor: [ 11 ] ∇ a f b = g a c ∇ c f b , {\displaystyle \nabla ^{a}f^{b}=g^{ac}\nabla _{c}f^{b},} where ∇ c is the connection. Riemannian manifolds 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 , g ( ∇ f , X ) = ∂ X f , {\displaystyle g(\nabla f,X)=\partial _{X}f,} that is, g x ( ( ∇ f ) x , X x ) = ( ∂ X f ) ( x ) , {\displaystyle g_{x}{\big (}(\nabla f)_{x},X_{x}{\big )}=(\partial _{X}f)(x),} where g x ( , ) 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 R n , (∂ X f )( x ) is given by: ∑ j = 1 n X j ( φ ( x ) ) ∂ ∂ x j ( f ∘ φ − 1 ) | φ ( x ) , {\displaystyle \sum _{j=1}^{n}X^{j}{\big (}\varphi (x){\big )}{\frac {\partial }{\partial x_{j}}}(f\circ \varphi ^{-1}){\Bigg |}_{\varphi (x)},} where X j denotes the j th component of X in this coordinate chart. So, the local form of the gradient takes the form: ∇ f = g i k ∂ f ∂ x k e i . {\displaystyle \nabla f=g^{ik}{\frac {\partial f}{\partial x^{k}}}{\textbf {e}}_{i}.} Generalizing the case M = R n , the gradient of a function is related to its exterior derivative, since ( ∂ X f ) ( x ) = ( d f ) x ( X x ) . {\displaystyle (\partial _{X}f)(x)=(df)_{x}(X_{x}).} More precisely, the gradient ∇ f is the vector field associated to the differential 1-form df using the musical isomorphism ♯ = ♯ g : T ∗ M → T M {\displaystyle \sharp =\sharp ^{g}\colon T^{*}M\to TM} (called "sharp") defined by the metric g . The relation between the exterior derivative and the gradient of a function on R n is a special case of this in which the metric is the flat metric given by the dot product. Curl – Circulation density in a vector field Divergence – Vector operator in vector calculus Four-gradient – Four-vector analogue of the gradient operation Hessian matrix – Matrix of second derivatives Skew gradient – Mathematical concept Spatial gradient – Gradient whose components are spatial derivatives 1 2 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 f : R n → T R n {\displaystyle f\colon \mathbb {R} ^{n}\to T\mathbb {R} ^{n}} , and the value of the gradient at a point is a tangent vector in the tangent space at that point, T p R n {\displaystyle T_{p}\mathbb {R} ^{n}} , not a vector in the original space R n {\displaystyle \mathbb {R} ^{n}} . However, all the tangent spaces can be naturally identified with the original space R n {\displaystyle \mathbb {R} ^{n}} , 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 R n {\displaystyle \mathbb {R} ^{n}} , while the value of the derivative at a point can be thought of as a covector on the original space: a linear map R n → R {\displaystyle \mathbb {R} ^{n}\to \mathbb {R} } . ↑ the dot product (the slope of the road around the hill) would be 40% if the degree between the road and the steepest slope is 0°, i.e. when they are completely aligned, and flat when the degree is 90°, i.e. when the road is perpendicular to the steepest slope. ↑ Informally, "naturally" identified means that this can be done without making any arbitrary choices. This can be formalized with a natural transformation . ↑ Bachman (2007 , p. 77) Downing (2010 , pp. 316–317) Kreyszig (1972 , p. 309) McGraw-Hill (2007 , p. 196) Moise (1967 , p. 684) Protter & Morrey (1970 , p. 715) Swokowski et al. (1994 , pp. 1036, 1038–1039) Bachman (2007 , p. 77) Downing (2010 , pp. 316–317) Kreyszig (1972 , p. 309) McGraw-Hill (2007 , p. 196) Moise (1967 , p. 684) Protter & Morrey (1970 , p. 715) Swokowski et al. (1994 , pp. 1036, 1038–1039) ↑ Bachman (2007 , p. 76) Beauregard & Fraleigh (1973 , p. 84) Downing (2010 , p. 316) Harper (1976 , p. 15) Kreyszig (1972 , p. 307) McGraw-Hill (2007 , p. 196) Moise (1967 , p. 683) Protter & Morrey (1970 , p. 714) Swokowski et al. (1994 , p. 1038) Bachman (2007 , p. 76) Beauregard & Fraleigh (1973 , p. 84) Downing (2010 , p. 316) Harper (1976 , p. 15) Kreyszig (1972 , p. 307) McGraw-Hill (2007 , p. 196) Moise (1967 , p. 683) Protter & Morrey (1970 , p. 714) Swokowski et al. (1994 , p. 1038) ↑ "Non-differentiable functions must have discontinuous partial derivatives - Math Insight" . mathinsight.org . Retrieved 2023-10-21 . ↑ Kreyszig (1972 , pp. 308–309) ↑ Stoker (1969 , p. 292) 1 2 Schey 1992 , pp. 139–142 . ↑ Protter & Morrey (1970 , pp. 21, 88) ↑ T. Arens (2022). Mathematik (5th ed.). Springer Spektrum Berlin. doi : 10.1007/978-3-662-64389-1 . ISBN 978-3-662-64388-4 . ↑ 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 {{ citation }} : CS1 maint: multiple names: authors list ( link ) 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, Charles B. Jr. (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 Arens, T.; Hettlich, F.; Karpfinger, C.; Kockelkorn, U.; Lichtenegger, K.; Stachel, H. (2022), Mathematik (5th ed.), Springer Spektrum Berlin, doi : 10.1007/978-3-662-64389-1 , ISBN 978-3-662-64388-4 Further reading Korn, Theresa M. ; Korn, Granino Arthur (2000). Mathematical Handbook for Scientists and Engineers: Definitions, Theorems, and Formulas for Reference and Review . Dover Publications. pp. 157– 160. ISBN 0-486-41147-8 . OCLC 43864234 . "Gradient" . Khan Academy . Kuptsov, L.P. (2001) [1994], "Gradient" , Encyclopedia of Mathematics , EMS Press . Weisstein, Eric W. "Gradient" . MathWorld . Binomial theorem Concave function Continuous function Finite difference Free variables and bound variables Graph of a function Linear function Rolle's theorem Indeterminate form Limit of a function One-sided limit One-sided limit Limit of a sequence Order of approximation (ε, δ)-definition of limit Second derivative Partial derivative Differential operator Mean value theorem Notation Leibniz's notation Newton's notation Leibniz's notation Newton's notation Rules of differentiation linearity Power Sum Chain L'Hôpital's Product General Leibniz's rule Quotient Product General Leibniz's rule General Leibniz's rule Other techniques Implicit differentiation Inverse function rule Logarithmic derivative Related rates Implicit differentiation Inverse function rule Logarithmic derivative Stationary points First derivative test Second derivative test Extreme value theorem Maximum and minimum First derivative test Second derivative test Extreme value theorem Maximum and minimum Further applications Newton's method Taylor's theorem Newton's method Taylor's theorem Differential equation Ordinary differential equation Partial differential equation Stochastic differential equation Ordinary differential equation Partial differential equation Stochastic differential equation Riemann integral Basic properties Constant of integration Fundamental theorem of calculus Differentiating under the integral sign Differentiating under the integral sign Integration by parts Integration by substitution trigonometric Euler Tangent half-angle substitution Tangent half-angle substitution Partial fractions in integration Quadratic integral Quadratic integral Trapezoidal rule Volumes Washer method Shell method Integral equation Integro-differential equation Derivatives Curl Directional derivative Divergence Gradient Laplacian Directional derivative Basic theorems Line integrals Green's Stokes' Gauss' Divergence theorem Jacobian matrix and determinant Lagrange multiplier Multiple integral Partial derivative Surface integral Volume integral Advanced topics Differential forms Exterior derivative Generalized Stokes' theorem Tensor calculus Differential forms Exterior derivative Generalized Stokes' theorem Tensor calculus Arithmetico-geometric sequence Types of series Alternating Binomial Fourier Geometric Harmonic Infinite Power Maclaurin Taylor Telescoping Power Maclaurin Taylor Tests of convergence Abel's Alternating series Cauchy condensation Direct comparison Dirichlet's Integral Limit comparison Ratio Root Term Alternating series Cauchy condensation Direct comparison Limit comparison Bernoulli numbers e (mathematical constant) Exponential function Natural logarithm Stirling's approximation Colin Maclaurin Generality of algebra Gottfried Wilhelm Leibniz Infinitesimal calculus Law of Continuity Method of Fluxions The Method of Mechanical Theorems rational functions irrational algebraic functions exponential functions logarithmic functions hyperbolic functions inverse trigonometric functions inverse Secant Secant cubed List of derivatives Complex calculus Contour integral Contour integral Differential geometry Manifold Curvature of curves of surfaces Tensor Euler–Maclaurin formula Integration Bee Proof that 22/7 exceeds π Regiomontanus' angle maximization problem Steinmetz solid Differential operators Differential calculus Generalizations of the derivative Linear operators in calculus Vector calculus Articles with short description Short description is different from Wikidata Articles needing additional references from January 2018 All articles needing additional references Pages using sidebar with the child parameter Commons category link is on Wikidata CS1 maint: multiple names: authors list
📥 下载地址(文章结尾)
繁体系统安装。