Calculus of Variation

变分法(Calculus of Variations) 变分法(Calculus of Variations)是数学的一个分支,主要研究函数的极值问题,即寻找一个函数,使得某个泛函达到最大值或最小值。泛函是将函数作为变量的函数,与通常的函数不同,泛函的变量是函数本身,而不是单个的数值。变分法在物理学、工程学、经济学等领域有着广泛的应用,特别是在最优化问题和控制理论中。 阅读详情
From Wikipedia, the free encyclopedia
"Variational method" redirects here. For the use as an approximation method in quantum mechanics, see  Variational method (quantum mechanics).

Calculus of variations is a field of mathematical analysis that deals with maximizing or minimizingfunctionals, which are mappings from a set of functions to the real numbers. Functionals are often expressed as definite integrals involving functions and their derivatives. The interest is in extremalfunctions that make the functional attain a maximum or minimum value – or stationary functions – those where the rate of change of the functional is zero.

A simple example of such a problem is to find the curve of shortest length connecting two points. If there are no constraints, the solution is obviously a straight line between the points. However, if the curve is constrained to lie on a surface in space, then the solution is less obvious, and possibly many solutions may exist. Such solutions are known as geodesics. A related problem is posed by Fermat's principle: light follows the path of shortest optical length connecting two points, where the optical length depends upon the material of the medium. One corresponding concept in mechanics is the principle of least action.

Many important problems involve functions of several variables. Solutions of boundary value problems for the Laplace equation satisfy the Dirichlet principle. Plateau's problem requires finding a surface of minimal area that spans a given contour in space: a solution can often be found by dipping a frame in a solution of soap suds. Although such experiments are relatively easy to perform, their mathematical interpretation is far from simple: there may be more than one locally minimizing surface, and they may have non-trivial topology.

History[edit]

The calculus of variations may be said to begin with the brachistochrone curve problem raised by Johann Bernoulli (1696).[1] It immediately occupied the attention of Jakob Bernoulli and the Marquis de l'Hôpital, but Leonhard Euler first elaborated the subject. His contributions began in 1733, and his Elementa Calculi Variationum gave to the science its name. Lagrange contributed extensively to the theory, and Legendre (1786) laid down a method, not entirely satisfactory, for the discrimination of maxima and minima. Isaac Newton and Gottfried Leibniz also gave some early attention to the subject.[2] To this discrimination Vincenzo Brunacci (1810), Carl Friedrich Gauss (1829), Siméon Poisson (1831), Mikhail Ostrogradsky (1834), and Carl Jacobi (1837) have been among the contributors. An important general work is that of Sarrus (1842) which was condensed and improved byCauchy (1844). Other valuable treatises and memoirs have been written by Strauch (1849), Jellett (1850), Otto Hesse (1857), Alfred Clebsch (1858), and Carll (1885), but perhaps the most important work of the century is that of Weierstrass. His celebrated course on the theory is epoch-making, and it may be asserted that he was the first to place it on a firm and unquestionable foundation. The 20th and the 23rd Hilbert problem published in 1900 encouraged further development.[2] In the 20th century David Hilbert, Emmy Noether, Leonida Tonelli, Henri Lebesgue and Jacques Hadamard among others made significant contributions.[2] Marston Morse applied calculus of variations in what is now called Morse theory.[3] Lev Pontryagin, Ralph Rockafellar and F. H. Clarke developed new mathematical tools for the calculus of variations in optimal control theory.[3] The dynamic programmingof Richard Bellman is an alternative to the calculus of variations.[4][5][6]

Extrema[edit]

The calculus of variations is concerned with the maxima or minima of functionals, which are collectively called extrema. A functional depends on afunction, somewhat analogous to the way a function can depend on a numerical variable, and thus a functional has been described as a function of a function. Functionals have extrema with respect to the elements y of a given function space defined over a given domain. A functional J [ y ] is said to have an extremum at the function f  if ΔJ = J [ y ] - J [ f] has the same sign for all y in an arbitrarily small neighborhood of f .[Note 1] The functionf is called an extremal function or extremal. The extremum J [ f ] is called a maximum if ΔJ ≤ 0 everywhere in an arbitrarily small neighborhood off , and a minimum if ΔJ ≥ 0 there. For a function space of continuous functions, extrema of corresponding functionals are called weak extrema orstrong extrema, depending on whether the first derivatives of the continuous functions are respectively all continuous or not.[8]

Both strong and weak extrema of functionals are for a space of continuous functions but weak extrema have the additional requirement that the first derivatives of the functions in the space be continuous. Thus a strong extremum is also a weak extremum, but the converse may not hold. Finding strong extrema is more difficult than finding weak extrema.[9] An example of a necessary condition that is used for finding weak extrema is theEuler–Lagrange equation.[10] [Note 2]

Euler–Lagrange equation[edit]

Main article:  Euler–Lagrange equation

Finding the extrema of functionals is similar to finding the maxima and minima of functions. The maxima and minima of a function may be located by finding the points where its derivative vanishes (i.e., is equal to zero). The extrema of functionals may be obtained by finding functions where thefunctional derivative is equal to zero. This leads to solving the associated Euler–Lagrange equation.[Note 3]

Consider the functional

 J[y] = \int_{x_1}^{x_2}  L(x,y(x),y'(x))\, dx  \, .

where

x1, x2 are  constants,
y (x) is twice continuously differentiable,
y ′(x) = dy / dx  ,
L(x, y (x), y ′(x)) is twice continuously differentiable with respect to its arguments  x,  y,  y ′.

If the functional J[y ] attains a local minimum at f , and η(x) is an arbitrary function that has at least one derivative and vanishes at the endpoints x1 and x2 , then for any number ε close to 0,

J[f] \le J[f + \varepsilon \eta] \, .

The term εη is called the variation of the function f and is denoted by δf .[11]

Substituting  f + εη for y  in the functional J[ y ] , the result is a function of ε,

 \Phi(\varepsilon) = J[f+\varepsilon\eta] \, .

Since the functional J[ y ] has a minimum for y = f , the function Φ(ε) has a minimum at ε = 0 and thus,[Note 4]

 \Phi'(0) \equiv \left.\frac{d\Phi}{d\varepsilon}\right|_{\varepsilon = 0} = \int_{x_1}^{x_2} \left.\frac{dL}{d\varepsilon}\right|_{\varepsilon = 0} dx = 0 \, .

Taking the total derivative of L[x, y, y ′] , where y = f + ε η and y ′ = f ′ + ε η′ are functions of ε but x is not,

\frac{dL}{d\varepsilon}=\frac{\partial L}{\partial y}\frac{dy}{d\varepsilon} + \frac{\partial L}{\partial y'}\frac{dy'}{d\varepsilon}

and since  dy /dε = η  and  dy ′/dε = η' ,

\frac{dL}{d\varepsilon}=\frac{\partial L}{\partial y}\eta + \frac{\partial L}{\partial y'}\eta' .

Therefore,

\begin{align}\int_{x_1}^{x_2} \left.\frac{dL}{d\varepsilon}\right|_{\varepsilon = 0} dx & = \int_{x_1}^{x_2} \left(\frac{\partial L}{\partial f} \eta + \frac{\partial L}{\partial f'} \eta'\right)\, dx \\ & = \int_{x_1}^{x_2} \left(\frac{\partial L}{\partial f} \eta - \eta \frac{d}{dx}\frac{\partial L}{\partial f'} \right)\, dx + \left.\frac{\partial L}{\partial f'} \eta \right|_{x_1}^{x_2}\\  \end{align}

where L[x, y, y ′] → L[x, f, f ′] when ε = 0 and we have used integration by parts. The last term vanishes because η = 0 at x1 and x2 by definition. Also, as previously mentioned the left side of the equation is zero so that

 \int_{x_1}^{x_2} \eta \left(\frac{\partial L}{\partial f} - \frac{d}{dx}\frac{\partial L}{\partial f'} \right) \, dx = 0 \, .

According to the fundamental lemma of calculus of variations, the part of the integrand in parentheses is zero, i.e.

 \frac{\part L}{\part f} -\frac{d}{dx} \frac{\part L}{\part f'}=0

which is called the Euler–Lagrange equation. The left hand side of this equation is called the functional derivative of J[f] and is denotedδJ/δf(x) .

In general this gives a second-order ordinary differential equation which can be solved to obtain the extremal function f(x) . The Euler–Lagrange equation is a necessary, but not sufficient, condition for an extremum J[f]. A sufficient condition for a minimum is given in the section Variations and sufficient condition for a minimum.

Example[edit]

In order to illustrate this process, consider the problem of finding the extremal function y = f (x) , which is the shortest curve that connects two points (x1, y1) and (x2, y2) . The arc length of the curve is given by

 A[y] = \int_{x_1}^{x_2} \sqrt{1 + [ y'(x) ]^2} \, dx \, ,

with

 y\,'(x) = \frac{dy}{dx} \, , \  \  y_1=f(x_1) \, , \ \  y_2=f(x_2) \, .

The Euler–Lagrange equation will now be used to find the extremal function f (x) that minimizes the functional A[y ] .

 \frac{\part L}{\part f} -\frac{d}{dx} \frac{\part L}{\part f'}=0

with

L = \sqrt{1 + [ f'(x) ]^2} \, .

Since f does not appear explicitly in L , the first term in the Euler–Lagrange equation vanishes for all f (x) and thus,

 \frac{d}{dx} \frac{\part L}{\part f'}  = 0  \, .

Substituting for L and taking the partial derivative,

 \frac{d}{dx} \ \frac{ f'(x) } {\sqrt{1 + [ f'(x) ]^2}}  \ = 0 \, .

Taking the derivative d/dx and simplifying gives,

\frac{d^2 f}{dx^2}\ \cdot\ \frac{1}{\left[\sqrt{1+[f'(x)]^2}\ \right]^3} = 0 \, ,

and because 1+[f ′(x)]2 is non-zero,

\frac{d^2 f}{dx^2} = 0 \, ,

which implies that the shortest curve that connects two points (x1, y1) and (x2, y2) is

 f(x) = m x + b \qquad \text{with} \ \  m = \frac{y_2 - y_1}{x_2 - x_1}  \quad \text{and} \quad  b = \frac{x_2 y_1 - x_1 y_2}{x_2 - x_1}

and we have thus found the extremal function f(x) that minimizes the functional A[y] so that A[f] is a minimum. Note that y = f(x) is the equation for a straight line, in other words, the shortest distance between two points is a straight line.[Note 5]

Beltrami identity[edit]

In physics problems it frequently turns out that ∂L / ∂x = 0. In that case, the Euler–Lagrange equation can be simplified to the Beltrami identity:[12]

L-f'\frac{\part L}{\part f'}=C \, ,

where C is a constant. The left hand side is the Legendre transformation of L with respect to f ′.

Du Bois-Reymond's theorem[edit]

The discussion thus far has assumed that extremal functions possess two continuous derivatives, although the existence of the integral J requires only first derivatives of trial functions. The condition that the first variation vanishes at an extremal may be regarded as a weak form of the Euler–Lagrange equation. The theorem of Du Bois-Reymond asserts that this weak form implies the strong form. If L has continuous first and second derivatives with respect to all of its arguments, and if

\frac{\part^2 L}{(\part f')^2} \ne 0,

then f_0 has two continuous derivatives, and it satisfies the Euler–Lagrange equation.

Lavrentiev phenomenon[edit]

Hilbert was the first to give good conditions for the Euler–Lagrange equations to give a stationary solution. Within a convex area and a positive thrice differentiable Lagrangian the solutions are composed of a countable collection of sections that either go along the boundary or satisfy the Euler–Lagrange equations in the interior.

However Lavrentiev in 1926 showed that there are circumstances where there is no optimum solution but one can be approached arbitrarily closely by increasing numbers of sections. For instance the following:

L(t,x,x') = (x^3-t)^2 x'^6,\,
x(0)=0,\, x(1)=1.\,

Here a zig zag path gives a better solution than any smooth path and increasing the number of sections improves the solution.

Functions of several variables[edit]

Variational problems that involve multiple integrals arise in numerous applications. For example, if φ(x,y) denotes the displacement of a membrane above the domain D in the x,y plane, then its potential energy is proportional to its surface area:

 U[\varphi] = \iint_D \sqrt{1 +\nabla \varphi \cdot \nabla \varphi} dx\,dy.\,

Plateau's problem consists of finding a function that minimizes the surface area while assuming prescribed values on the boundary of D; the solutions are called minimal surfaces. The Euler–Lagrange equation for this problem is nonlinear:

 \varphi_{xx}(1 + \varphi_y^2) + \varphi_{yy}(1 + \varphi_x^2) - 2\varphi_x \varphi_y \varphi_{xy} = 0.\,

See Courant (1950) for details.

Dirichlet's principle[edit]

It is often sufficient to consider only small displacements of the membrane, whose energy difference from no displacement is approximated by

 V[\varphi] = \frac{1}{2}\iint_D \nabla \varphi \cdot \nabla \varphi \, dx\, dy.\,

The functional V is to be minimized among all trial functions φ that assume prescribed values on the boundary of D. If u is the minimizing function and v is an arbitrary smooth function that vanishes on the boundary of D, then the first variation of V[u + \varepsilon v] must vanish:

 \frac{d}{d\varepsilon} V[u + \varepsilon v]|_{\varepsilon=0} = \iint_D \nabla u \cdot \nabla v \, dx\,dy = 0.\,

Provided that u has two derivatives, we may apply the divergence theorem to obtain

 \iint_D \nabla \cdot (v \nabla u) \,dx\,dy = \iint_D \nabla u \cdot \nabla v + v \nabla \cdot \nabla u \,dx\,dy = \iint_C v \frac{\part u}{\part n} ds, \,

where C is the boundary of D, s is arclength along C and  \part u / \part n is the normal derivative of u on C. Since v vanishes on C and the first variation vanishes, the result is

\iint_D v\nabla \cdot \nabla u \,dx\,dy =0 \,

for all smooth functions v that vanish on the boundary of D. The proof for the case of one dimensional integrals may be adapted to this case to show that

 \nabla \cdot \nabla u= 0 \,  in  D.

The difficulty with this reasoning is the assumption that the minimizing function u must have two derivatives. Riemann argued that the existence of a smooth minimizing function was assured by the connection with the physical problem: membranes do indeed assume configurations with minimal potential energy. Riemann named this idea the Dirichlet principle in honor of his teacher Peter Gustav Lejeune Dirichlet. However Weierstrass gave an example of a variational problem with no solution: minimize

 W[\varphi] = \int_{-1}^{1} (x\varphi')^2 \, dx\,

among all functions φ that satisfy \varphi(-1)=-1 and \varphi(1)=1. W can be made arbitrarily small by choosing piecewise linear functions that make a transition between −1 and 1 in a small neighborhood of the origin. However, there is no function that makes W=0.[13] Eventually it was shown that Dirichlet's principle is valid, but it requires a sophisticated application of the regularity theory for elliptic partial differential equations; see Jost and Li-Jost (1998).

Generalization to other boundary value problems[edit]

A more general expression for the potential energy of a membrane is

 V[\varphi] = \iint_D \left[ \frac{1}{2} \nabla \varphi \cdot \nabla \varphi + f(x,y) \varphi \right] \, dx\,dy \, + \int_C \left[ \frac{1}{2} \sigma(s) \varphi^2 + g(s) \varphi \right] \, ds.

This corresponds to an external force density f(x,y) in D, an external force g(s) on the boundary C, and elastic forces with modulus \sigma(s)  acting on C. The function that minimizes the potential energy with no restriction on its boundary values will be denoted by u. Provided that f and gare continuous, regularity theory implies that the minimizing function u will have two derivatives. In taking the first variation, no boundary condition need be imposed on the increment v. The first variation of V[u + \varepsilon v] is given by

 \iint_D \left[ \nabla u \cdot \nabla v + f v \right] \, dx\, dy + \int_C \left[ \sigma u v + g v \right] \, ds =0. \,

If we apply the divergence theorem, the result is

 \iint_D \left[ -v \nabla \cdot \nabla u + v f \right] \, dx \, dy + \int_C v \left[ \frac{\part u}{\part n} + \sigma u + g \right] \, ds =0. \,

If we first set v=0 on C, the boundary integral vanishes, and we conclude as before that

 - \nabla \cdot \nabla u + f =0 \,

in D. Then if we allow v to assume arbitrary boundary values, this implies that u must satisfy the boundary condition

 \frac{\part u}{\part n} + \sigma u + g =0, \,

on C. Note that this boundary condition is a consequence of the minimizing property of u: it is not imposed beforehand. Such conditions are callednatural boundary conditions.

The preceding reasoning is not valid if  \sigma vanishes identically on C. In such a case, we could allow a trial function  \varphi \equiv c, where c is a constant. For such a trial function,

 V[c] = c\left[ \iint_D f \, dx\,dy + \int_C g ds \right].

By appropriate choice of c, V can assume any value unless the quantity inside the brackets vanishes. Therefore the variational problem is meaningless unless

 \iint_D f \, dx\,dy + \int_C g \, ds =0.\,

This condition implies that net external forces on the system are in equilibrium. If these forces are in equilibrium, then the variational problem has a solution, but it is not unique, since an arbitrary constant may be added. Further details and examples are in Courant and Hilbert (1953).

Eigenvalue problems[edit]

Both one-dimensional and multi-dimensional eigenvalue problems can be formulated as variational problems.

Sturm–Liouville problems[edit]

The Sturm–Liouville eigenvalue problem involves a general quadratic form

Q[\varphi] =  \int_{x_1}^{x_2} \left[ p(x) \varphi'(x)^2 + q(x) \varphi(x)^2 \right] \, dx, \,

where φ is restricted to functions that satisfy the boundary conditions

\varphi(x_1)=0, \quad \varphi(x_2)=0. \,

Let R be a normalization integral

 R[\varphi] =\int_{x_1}^{x_2} r(x)\varphi(x)^2 \, dx.\,

The functions p(x) and r(x) are required to be everywhere positive and bounded away from zero. The primary variational problem is to minimize the ratio Q/R among all φ satisfying the endpoint conditions. It is shown below that the Euler–Lagrange equation for the minimizing u is

 -(pu')' +q u -\lambda r u =0, \,

where λ is the quotient

 \lambda = \frac{Q[u]}{R[u]}. \,

It can be shown (see Gelfand and Fomin 1963) that the minimizing u has two derivatives and satisfies the Euler–Lagrange equation. The associated λ will be denoted by \lambda_1; it is the lowest eigenvalue for this equation and boundary conditions. The associated minimizing function will be denoted by u_1(x). This variational characterization of eigenvalues leads to the Rayleigh–Ritz method: choose an approximating u as a linear combination of basis functions (for example trigonometric functions) and carry out a finite-dimensional minimization among such linear combinations. This method is often surprisingly accurate.

The next smallest eigenvalue and eigenfunction can be obtained by minimizing Q under the additional constraint

 \int_{x_1}^{x_2} r(x) u_1(x) \varphi(x) \, dx=0. \,

This procedure can be extended to obtain the complete sequence of eigenvalues and eigenfunctions for the problem.

The variational problem also applies to more general boundary conditions. Instead of requiring that φ vanish at the endpoints, we may not impose any condition at the endpoints, and set

Q[\varphi] =  \int_{x_1}^{x_2} \left[ p(x) \varphi'(x)^2 + q(x)\varphi(x)^2 \right] \, dx + a_1 \varphi(x_1)^2 + a_2 \varphi(x_2)^2, \,

where a_1 and a_2 are arbitrary. If we set  \varphi = u + \varepsilon v  the first variation for the ratio  Q/R is

 V_1 = \frac{2}{R[u]} \left( \int_{x_1}^{x_2} \left[ p(x) u'(x)v'(x) + q(x)u(x)v(x) -\lambda u(x) v(x) \right] \, dx + a_1 u(x_1)v(x_1) + a_2 u(x_2)v(x_2) \right) , \,

where λ is given by the ratio  Q[u]/R[u] as previously. After integration by parts,

 \frac{R[u]}{2} V_1 = \int_{x_1}^{x_2} v(x) \left[ -(p u')' + q u -\lambda r u \right] \, dx + v(x_1)[ -p(x_1)u'(x_1) + a_1 u(x_1)] +  v(x_2) [p(x_2) u'(x_2) + a_2 u(x_2)]. \,

If we first require that v vanish at the endpoints, the first variation will vanish for all such v only if

 -(p u')' + q u -\lambda r u =0 \quad \hbox{for} \quad x_1 < x < x_2.\,

If u satisfies this condition, then the first variation will vanish for arbitrary v only if

 -p(x_1)u'(x_1) + a_1 u(x_1)=0,  \quad \hbox{and} \quad p(x_2) u'(x_2) + a_2 u(x_2)=0.\,

These latter conditions are the natural boundary conditions for this problem, since they are not imposed on trial functions for the minimization, but are instead a consequence of the minimization.

Eigenvalue problems in several dimensions[edit]

Eigenvalue problems in higher dimensions are defined in analogy with the one-dimensional case. For example, given a domain D with boundary B in three dimensions we may define

 Q[\varphi] = \iiint_D p(X) \nabla \varphi \cdot \nabla \varphi + q(X) \varphi^2 \, dx \, dy \, dz + \iint_B \sigma(S) \varphi^2 \, dS, \,

and

 R[\varphi] = \iiint_D r(X) \varphi(X)^3 \, dx \, dy \, dz.\,

Let u be the function that minimizes the quotient  Q[\varphi] / R[\varphi],  with no condition prescribed on the boundary B. The Euler–Lagrange equation satisfied by u is

 -\nabla \cdot (p(X) \nabla u) + q(x) u - \lambda r(x) u=0,\,

where

 \lambda = \frac{Q[u]}{R[u]}.\,

The minimizing u must also satisfy the natural boundary condition

 p(S) \frac{\part u}{\part n} + \sigma(S) u =0,

on the boundary B. This result depends upon the regularity theory for elliptic partial differential equations; see Jost and Li-Jost (1998) for details. Many extensions, including completeness results, asymptotic properties of the eigenvalues and results concerning the nodes of the eigenfunctions are in Courant and Hilbert (1953).

Applications[edit]

Some applications of the calculus of variations include:

Fermat's principle[edit]

Fermat's principle states that light takes a path that (locally) minimizes the optical length between its endpoints. If the x-coordinate is chosen as the parameter along the path, and y=f(x) along the path, then the optical length is given by

 A[f] = \int_{x=x_0}^{x_1} n(x,f(x)) \sqrt{1 + f'(x)^2} dx, \,

where the refractive index n(x,y) depends upon the material. If we try  f(x) = f_0 (x) + \varepsilon f_1 (x) then the first variation of A (the derivative ofA with respect to ε) is

 \delta A[f_0,f_1] = \int_{x=x_0}^{x_1} \left[ \frac{ n(x,f_0) f_0'(x) f_1'(x)}{\sqrt{1 + f_0'(x)^2}} + n_y (x,f_0) f_1 \sqrt{1 + f_0'(x)^2} \right] dx.

After integration by parts of the first term within brackets, we obtain the Euler–Lagrange equation

 -\frac{d}{dx} \left[\frac{ n(x,f_0) f_0'}{\sqrt{1 + f_0'^2}} \right] + n_y (x,f_0) \sqrt{1 + f_0'(x)^2} =0. \,

The light rays may be determined by integrating this equation. This formalism is used in the context of Lagrangian optics and Hamiltonian optics.

Snell's law[edit]

There is a discontinuity of the refractive index when light enters or leaves a lens. Let

 n(x,y) = n_- \quad \hbox{if} \quad x<0, \,
 n(x,y) = n_+ \quad \hbox{if} \quad x>0,\,

where n_- and n_+ are constants. Then the Euler–Lagrange equation holds as before in the region where x<0 or x>0, and in fact the path is a straight line there, since the refractive index is constant. At the x=0, f must be continuous, but f' may be discontinuous. After integration by parts in the separate regions and using the Euler–Lagrange equations, the first variation takes the form

 \delta A[f_0,f_1] = f_1(0)\left[ n_-\frac{f_0'(0_-)}{\sqrt{1 + f_0'(0_-)^2}} -n_+\frac{f_0'(0_+)}{\sqrt{1 + f_0'(0_+)^2}} \right].\,

The factor multiplying n_- is the sine of angle of the incident ray with the x axis, and the factor multiplying n_+ is the sine of angle of the refracted ray with the x axis. Snell's law for refraction requires that these terms be equal. As this calculation demonstrates, Snell's law is equivalent to vanishing of the first variation of the optical path length.

Fermat's principle in three dimensions[edit]

It is expedient to use vector notation: let X=(x_1,x_2,x_3), let t be a parameter, let X(t) be the parametric representation of a curve C, and let \dot X(t) be its tangent vector. The optical length of the curve is given by

 A[C] = \int_{t=t_0}^{t_1} n(X) \sqrt{ \dot X \cdot \dot X} dt. \,

Note that this integral is invariant with respect to changes in the parametric representation of C. The Euler–Lagrange equations for a minimizing curve have the symmetric form

 \frac{d}{dt} P = \sqrt{ \dot X \cdot \dot X} \nabla n, \,

where

 P = \frac{n(X) \dot X}{\sqrt{\dot X \cdot \dot X} }.\,

It follows from the definition that P satisfies

 P \cdot P = n(X)^2. \,

Therefore the integral may also be written as

 A[C] = \int_{t=t_0}^{t_1} P \cdot \dot X \, dt.\,

This form suggests that if we can find a function ψ whose gradient is given by P, then the integral A is given by the difference of ψ at the endpoints of the interval of integration. Thus the problem of studying the curves that make the integral stationary can be related to the study of the level surfaces of ψ. In order to find such a function, we turn to the wave equation, which governs the propagation of light. This formalism is used in the context of Lagrangian optics and Hamiltonian optics.

Connection with the wave equation[edit]

The wave equation for an inhomogeneous medium is

 u_{tt} = c^2 \nabla \cdot \nabla u, \,

where c is the velocity, which generally depends upon X. Wave fronts for light are characteristic surfaces for this partial differential equation: they satisfy

 \varphi_t^2 = c(X)^2 \nabla \varphi \cdot \nabla \varphi. \,

We may look for solutions in the form

 \varphi(t,X) = t - \psi(X). \,

In that case, ψ satisfies

 \nabla \psi \cdot \nabla \psi = n^2, \,

where n=1/c. According to the theory of first-order partial differential equations, if P = \nabla \psi,  then P satisfies

 \frac{dP}{ds} = n \nabla n, \,

along a system of curves (the light rays) that are given by

 \frac{dX}{ds} = P. \,

These equations for solution of a first-order partial differential equation are identical to the Euler–Lagrange equations if we make the identification

 \frac{ds}{dt} = \frac{\sqrt{ \dot X \cdot \dot X} }{n}. \,

We conclude that the function ψ is the value of the minimizing integral A as a function of the upper end point. That is, when a family of minimizing curves is constructed, the values of the optical length satisfy the characteristic equation corresponding the wave equation. Hence, solving the associated partial differential equation of first order is equivalent to finding families of solutions of the variational problem. This is the essential content of the Hamilton–Jacobi theory, which applies to more general variational problems.

Action principle[edit]

Main article:  Action (physics)

In classical mechanics, the action, S, is defined as the time integral of the Lagrangian, L. The Lagrangian is the difference of energies,

 L = T - U, \,

where T is the kinetic energy of a mechanical system and U its potential energy. Hamilton's principle (or the action principle) states that the motion of a conservative holonomic (integrable constraints) mechanical system is such that the action integral

 S  = \int_{t=t_0}^{t_1} L(x, \dot x, t) dt \,

is stationary with respect to variations in the path x(t). The Euler–Lagrange equations for this system are known as Lagrange's equations:

 \frac{d}{dt} \frac{\part L}{\part \dot x} = \frac{\part L}{\part x}, \,

and they are equivalent to Newton's equations of motion (for such systems).

The conjugate momenta P are defined by

 p = \frac{\part L}{\part \dot x}. \,

For example, if

 T = \frac{1}{2} m \dot x^2, \,

then

 p = m \dot x. \,

Hamiltonian mechanics results if the conjugate momenta are introduced in place of \dot x, and the Lagrangian L is replaced by the Hamiltonian H defined by

 H(x, p, t) = p \,\dot x - L(x,\dot x, t).\,

The Hamiltonian is the total energy of the system: H = T + U. Analogy with Fermat's principle suggests that solutions of Lagrange's equations (the particle trajectories) may be described in terms of level surfaces of some function of X. This function is a solution of the Hamilton–Jacobi equation:

 \frac{\part  \psi}{\part t} + H\left(x,\frac{\part  \psi}{\part x},t\right) =0.\,

Variations and sufficient condition for a minimum[edit]

Calculus of variations is concerned with variations of functionals, which are small changes in the functional's value due to small changes in the function that is its argument. The first variation[Note 6] is defined as the linear part of the change in the functional, and the second variation[Note 7] is defined as the quadratic part.[14]

For example, if J[y] is a functional with the function y = y(x) as its argument, and there is a small change in its argument from y to y + h, whereh = h(x) is a function in the same function space as y, then the corresponding change in the functional is

 \Delta J[h] = J[y+h] - J[y]  . [Note 8]

The functional J[y] is said to be differentiable if

 \Delta J[h] = \phi [h] + \epsilon \|h\|  ,

where φ[h] is a linear functional,[Note 9] ||h|| is the norm of h,[Note 10] and ε → 0 as ||h|| → 0. The linear functional φ[h] is the first variation ofJ[y] and is denoted by,[18]

\delta J[h] = \phi(h)  .

The functional J[y] is said to be twice differentiable if

 \Delta J[h] = \phi_1 [h] + \phi_2 [h] + \epsilon \|h\|^2  ,

where φ1[h] is a linear functional (the first variation), φ2[h] is a quadratic functional,[Note 11] and ε → 0 as ||h|| → 0. The quadratic functionalφ2[h] is the second variation of J[y] and is denoted by,[20]

\delta^2 J[h] = \phi_2(h)  .

The second variation δ2J[h] is said to be strongly positive if

\delta^2J[h] \ge k \|h\|^2  ,

for all h and for some constant k > 0 .[21]

Sufficient condition for a minimum:

The functional  J[y] has a minimum at  y = ŷ if its first variation  δJ[h] = 0 at  y = ŷ and its second variation  δ2J[h] is strongly positive at  y = ŷ. [22]  [Note 12]
【变分法】【书籍阅读笔记】Calculus of Variation by gelfand 第一章 总结与习题题解 【更新中】 之前看 PRML 时碰到了 变分相关的问题,所以找了一本书特地来学习一下。 阅读详情

相关推荐

【信息科学与工程学】计算机科学与自动化——第三百零五篇 计算机系统中的各类运算操作02

编号类型领域运算操作运算类型算法算法的详细设计及数学分析参数列表及参数的数值设计应用场景301集合运算关系代数关系集合Feature Selection (Chi-Square)集合运算卡方检验目标函数:χ2=∑E(O−E)2​ 衡量分类特征与目标的相关性;资源:O(n·d);条件:离散特征,离散目标;组合约束:值越大相关性越强。 数据结构:列联表。 代码实现(C++): 特征列,目标列文本分类中的特征选择。302集合运算关系代数关系集合Feature Selection (ANOVA F

weixin_49199313的博客 309

变分(Calculus of variations)的概念及运算规则(一)

在介绍变分之前,首先回顾微分的定义当自变量x→x+dxx→x+dx时,相应的因变量y→y+dyy→y+dy。则此时dydy就是函数y(x)y(x)y(x)的微分了。

qq_32515081的博客 6万+

【信息科学与工程学】【制造工程】第一百四十四篇 计算光刻中的问题01

计算光刻的数学骨架是一条前向算子链: 光源J(fx​,fy​)​​TCC​光瞳P(fx​,fy​)​​Hopkins​空间像I(x,y)​​fresist​​硅片图形Z(x,y)​​MRC​可制造掩模Mmanufacturable​​​ 所有子问题(OPC / PSM / ILT / SMO)都是这条链的逆问题,区别只在优化变量集与约束集​ 。列内容领域 / 子领域​计算光刻 / 光学成像建模类型 / 模式 / 问题​前向问题;Abbe 模型 → Hopkins TCC 模型 → SOCS 快速算法系统化

weixin_49199313的博客 253

变分(Calculus of variations)的概念及运算规则(二)

在变分法和经典力学中,欧拉-拉格朗日方程是一个二阶常微分方程组,其解是给定作用泛函的驻点。这些方程是在 1750 年代由瑞士数学家 Leonhard Euler 和意大利数学家 Joseph-Louis Lagrange 发现的。因为可微泛函在其局部极值处是静止的,所以欧拉-拉格朗日方程可用于解决优化问题,在这些问题中,给定一些泛函,人们寻求函数使其最小化或最大化。这类似于微积分中的费马定理,指出在可微函数达到局部极值的任何点,其导数为零。在拉格朗日力学中,根据汉密尔顿的静止作用原理,物理系统的演化是由系统

qq_32515081的博客 4340

Calculus of Variations ( PDFDrive ).pdf

讲泛函极值的变分法的基础入门课

Calculus of Variations.pdf

虽然是英文的变分法,但是直接切入主题少了许多不必要的论述,适合最优控制初学者

什么是变分法(Calculus of Variations)?以及 欧拉-拉格朗日方程(Euler-Lagrange Equation)具体推导:中英双语

The Calculus of Variations is a powerful mathematical tool used to solve extremum problems, particularly when the objective function is in the form of an integral. By solving the Euler-Lagrange equation, we can find the optimal solution

阿正的梦工坊 3699

share-code:ShareCode的官方网站

股份代号 一个开放源代码的网站,使开发人员可以彼此共享代码。

【PRML 学习笔记】附录 - 变分法 (Calculus of Variations)

前言 如果你对这篇文章可感兴趣,可以点击「【访客必读 - 指引页】一文囊括主页内所有高质量博客」,查看完整博客分类与对应链接。 一、泛函 我们最常接触的函数 y(x)y(x)y(x),以数值 xxx 为输入,以数值 y(x)y(x)y(x) 为输出。 在此基础上,我们可将这个概念进行扩展,定义泛函(functional)F[y]F[y]F[y],其输入为函数 y(x)y(x)y(x),输出为数值 F[y]F[y]F[y]。 举个例子,y(x)y(x)y(x) 表示二维平面中经过 (x1,y1),(x2,y2

lucius-liu.cn 834

ShareCode:与朋友共享代码

与朋友共享代码 只是与朋友分享我的代码...

Code::Blocks 17.12 中文版

Code::Blocks 17.12 中文版 汉化方法: 1.关闭Code::Blocks 2.将share文件夹覆盖到Code::Blocks根目录下 3.打开Code::Blocks 4.依次点击Settings --> Environment... -->View 5 .将第二个选项Internationalization(will take place after restart)打勾 6.选中Chinese(Simplifield) 7.点击OK,然后重启Code::Blocks

[转帖]The Lambda Calculus for Absolute Dummies (like myself)

Monday, May 7, 2012 The Lambda Calculus for Absolute Dummies (like myself) If there is one highly underrated concept in philosophy today, it iscomputation. Why is it so important? Because ...

weixin_30252709的博客 225

Calculus of Variations - Gelfand

Calculus of Variations - Gelfand。盖尔方德的经典名著之一。djvu格式。

Calculus of Variations:变分计算

functional)指以函数构成的向量空间为定义域,实数为值域为的“函数”,即某一个依赖于其它一个或者几个函数确定其值的量,往往被称为“函数的函数”。函数代表了数到数的映射,而泛函代表了函数到数的映射,即给定一个函数,泛函能够得到一个数。当然也满足边界条件,也代表两点之间的一条路径,并且在确定的。不等于0,被积函数就是任意的,无法保证积分恒为0。下,其函数表达式只与ϵ有关。给定后是一个固定的函数。,我们首先来计算在任意确定的。当泛函取极值时,函数。为了要满足上面的条件。...

weixin_45363113的博客 707

GAMES104:02引擎架构分层-学习笔记

用户层工具层(Tool Layer):编辑器、工具界面功能层(Function Layer):渲染Rendering、动画Animation、物理Physics、相机Camera和实现游戏性的脚本Script、状态机FSM、AI等功能模块资源层(Resource Layer):各类图片、动画、音频资源加载核心层(Core Layer):核心功能如内存管理、容器分配、数据计算、多线程处理等平台层(Platform Layer):对接不同游戏平台、主机和硬件。

噗噗噗的博客 1267

微信聊天记录数据库解密实战:从WCDB到sqlcipher4的关键步骤解析

本文详细解析了微信桌面版聊天记录数据库的解密实战过程。通过逆向分析,定位了微信从WCDB框架到sqlcipher4加密的关键步骤,并成功提取了数据库密钥。文章重点介绍了如何通过动态调试、字符串定位等方法,追踪并验证sqlcipher4的加密密钥,最终实现对加密数据库文件的解密操作,为安全研究和数据恢复提供了技术参考。

weixin_29322553的博客 1071

底层逻辑之:欧拉-拉格朗日方程(Euler-Lagrange equations)&变分法(Calculus of Variations)的核心思想

欧拉-拉格朗日方程、变分法是怎么来?300年前数学家是如何解决最速降线问题的?全网最细的原创:欧拉-拉格朗日方程的数学原理分析

学术的尽头是分享,技术的尽头是开源 4516

数据库系统概论课后习题答案(第五版 王珊、萨师煊)

第1章 绪论 1 .试述数据、数据库、数据库系统、数据库管理系统的概念。 答: ( l )数据( Data ) :描述事物的符号记录称为数据。数据的种类有数字、文字、图形、图像、声音、正文等。数据与其语义是不可分的。解析在现代计算机系统中数据的概念是广义的。早期的计算机系统主要用于科学计算,处理的数据是整数、实数、浮点数等传统数学中的数据。现代计算机能存储和处理的对象十分广泛,表

早知晓的博客 11万+

PHYS104: Advanced Mechanics

Calculus of variations. Lagrangian and Hamiltonian mechanics. Non-inertial reference frames. Coupled oscillations. Strings. Waves. Topics from: Dynamics of rigid bodies, continuum mechanics, fluid mechanics.

PHANTOM 782

数字孪生教程大全之 我们如何构建数字孪生?数字孪生的五个级别都是什么

文章摘要 什么是数字孪生? 我们如何构建数字孪生? 开发智能数字孪生系统的框架 什么是数字孪生? 数字孪生是一个不言自明的术语,用于识别物理系统的数字化版本。数字孪生的最早参考来自大卫·格伦特(David Gelernter )的小说作品。在他 1995 年的书中,Gelernter 博士为读者提供了未来有趣的可能性——万维网。前网络书籍谈到了计算机系统上的镜像数字世界。有些人可能会争辩说,我们的 Meta-verse 是新的数字世界——现实世界的数字孪生。但是,还有其他可能性,时间可能会讲述一个更好的

iCloudEnd的博客 3633

UDS19 03 和19 04服务--答疑

UDS 1903服务(reportDTCSnapshotIdentification)用于获取ECU中存储的故障码快照标识信息。该服务返回DTC编号及对应的快照记录编号,为后续使用1904服务读取详细快照数据提供依据。请求报文为"1903",响应报文格式为"5903"后接DTC编号和记录编号列表。该服务需在非默认会话模式下执行,且清除诊断信息会删除相关快照记录。1903服务是读取DTC快照数据的基础步骤,可帮助确定ECU中存储的故障快照情况。

汽车软件开发 456

【ShareCode】不错的技术文章 -- 如何使用异或(XOR)运算找到数组中缺失的数?...

如何使用异或(XOR)运算找到数组中缺失的数? 今天给大家分享一篇关于使用XOR(异或)运算找到数组中缺失的数的问题。 在一次Javascript面试中,有这么一个问题: 假设有一个由0到99(包含99)的整数组成的长度为100的数组。从数组中随机移除一个元素,得到了一个长度为99的数组,那么请问如何找到所取出的数字是几?(假设数组未排...

weixin_33757609的博客 1123

第四章:无感FOC的平滑启动艺术:告别“咔哒”声与抖动

无感FOC启动技术面临"先有位置还是先有旋转"的核心矛盾,导致常见故障包括位置失准、负载突变等。基础方案采用开环I/F控制,但存在重载启动困难等局限性。进阶方案结合IPD位置检测技术,通过脉冲电压注入法精准定位转子初始位置。关键技术在于开环到闭环的平滑切换,采用混合观测器设计和相位对齐技术。量产优化包括自适应参数整定和故障恢复机制,确保启动可靠性和一致性。该系统工程方案可有效解决启动抖动、异响等问题,提升用户体验。

汽车软件开发 735

VirtualAlloc函数使用总结

如果我们的程序需要动态内存的话,则迟早会调用Win32函数VirtualAlloc。但是程序也可以不调用VirtualAlloc,而是直接调用Windows堆函数或者CRT堆函数。不过,知道VirtualAlloc如何工作,可以帮助我们更好地理解这些调用函数。     首先,必须知道保留(Reserved)内存和占用(Committed)内存的含义。当内存放保留时,一段连续虚拟地址空间被留出。例

2万+

Python爬虫实战——如何自动爬取百度搜索结果页面

本文介绍了如何使用Python爬虫抓取百度搜索结果页面的内容,包括如何构建搜索URL、获取页面HTML、解析内容、处理翻页以及存储数据等。通过该教程,您可以轻松实现批量抓取百度搜索结果,并为后续的数据分析和处理打下基础。希望本文能为您在爬虫开发、数据分析等领域提供帮助。如果您在实际应用过程中遇到问题,可以参考反爬虫应对策略,并结合实际需求进行调整。

2201_76125261的博客 1711

42、使用mmrotate中k3det进行旋转目标检测,并进行mnn部署和ncnn部署

基本思想:仍然是身份证分割,并进行ncnn和mnn的c++的部署开发

sxj731533730 5710
上一篇: HMM Algorithm Theory
shareCode
博客等级 码龄15年 125粉丝 40原创
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付:10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值