calculus of variations

calculus of variations

Imagine a bead of mass

m

on a wire whose

endpoints

are at

a

=

(

0

,

0

)

and

b

=

(

x

f

,

y

f

)

, with

y

f

lower than the starting position. If gravity acts on the bead with force

F

=

m

⁢

g

, what path (arrangement of the wire) minimizes the bead’s travel time from

a

to

b

, assuming no friction?

This is the famed

brachistochrone problem

, and its solution was one of the first accomplishments of the

calculus of variations

. Many

minimum

problems can be solved using the techniques introduced here.

In its general form, the calculus of variations concerns quantities

S

⁢

[

q

,

q

˙

,

t

]

=

∫

a

b

L

⁢

(

q

⁢

(

t

)

,

q

˙

⁢

(

t

)

,

t

)

⁢

𝑑

t

(1)

for which we wish to find a minimum or a

maximum

.

To make this concrete, let’s consider a much simpler problem than the brachistochrone: what’s the shortest distance between two points

p

=

(

x

⁢

1

,

y

⁢

1

)

and

q

=

(

x

⁢

2

,

y

⁢

2

)

? Let the variable

s

represent distance along the path, so that

∫

p

q

𝑑

s

=

S

. We wish to find the path such that

S

is a minimum. Zooming in on a small portion of the path, we can see that

d

⁢

s

2

=

d

⁢

x

2

+

d

⁢

y

2

(2)

d

⁢

s

=

d

⁢

x

2

+

d

⁢

y

2

(3)

If we parameterize the path by

t

, then we have

d

⁢

s

=

(

d

⁢

x

d

⁢

t

)

2

+

(

d

⁢

y

d

⁢

t

)

2

⁢

d

⁢

t

(4)

Let’s assume

y

=

f

⁢

(

x

)

, so that we may simplify (4) to

d

⁢

s

=

1

+

(

d

⁢

y

d

⁢

x

)

2

⁢

d

⁢

x

=

1

+

f

′

⁢

(

x

)

2

⁢

d

⁢

x

.

(5)

Now we have

S

=

∫

p

q

L

⁢

𝑑

x

=

∫

x

⁢

1

x

⁢

2

1

+

f

′

⁢

(

x

)

2

⁢

𝑑

x

(6)

In this case,

L

is particularly simple. Converting to

q

’s and

t

’s to make the comparison easier, we have

L

=

L

⁢

[

f

′

⁢

(

x

)

]

=

L

⁢

[

q

˙

⁢

(

t

)

]

, not the more general

L

⁢

[

q

⁢

(

t

)

,

q

˙

⁢

(

t

)

,

t

]

covered by the calculus of variations. We’ll see later how to use our

L

’s simplicity to our advantage. For now, let’s talk more generally.

We wish to find the path described by

L

, passing through a point

q

⁢

(

a

)

at

t

=

a

and through

q

⁢

(

b

)

at

t

=

b

, for which the quantity

S

is a minimum, for which in the path produce no first-order change in

S

, which we’ll call a “

stationary point

.” This is directly analogous to the idea that for a

function

f

⁢

(

t

)

, the minimum can be found where

δ

⁢

t

produce no first-order change in

f

⁢

(

t

)

. This is where

f

⁢

(

t

+

δ

⁢

t

)

≈

f

⁢

(

t

)

; taking a

Taylor series

expansion of

f

⁢

(

t

)

at

t

, we find

f

⁢

(

t

+

δ

⁢

t

)

=

f

⁢

(

t

)

+

δ

⁢

t

⁢

f

′

⁢

(

t

)

+

O

⁢

(

δ

⁢

t

2

)

=

f

⁢

(

t

)

,

(7)

with

f

′

⁢

(

t

)

:=

d

d

⁢

t

⁢

f

⁢

(

t

)

. Of course, since the whole point is to consider

δ

⁢

t

≠

0

, once we neglect terms

O

⁢

(

δ

⁢

t

2

)

this is just the point where

f

′

⁢

(

t

)

=

0

. This point, call it

t

=

t

0

, could be a minimum or a maximum, so in the usual

calculus

of a single variable we’d proceed by taking the

second derivative

,

f

′′

⁢

(

t

0

)

, and seeing if it’s

positive

or negative to see whether the function has a minimum or a maximum at

t

0

, respectively.

In the calculus of variations, we’re not considering in

t

—we’re considering in the

integral

of the relatively complicated

function

L

⁢

(

q

,

q

˙

,

t

)

, where

q

˙

=

d

d

⁢

t

⁢

q

⁢

(

t

)

. Also,

S

is a

functional

, and we can think of the

minimization

problem as the discovery of a minimum in

S

-space as we jiggle the parameters

q

and

q

˙

.

For the shortest-distance problem, it’s clear the maximum time doesn’t exist, since for any finite path length

S

0

we (intuitively) can always find a curve for which the path’s length is

greater

than

S

0

. This is often true, and we’ll assume for this discussion that finding a stationary point means we’ve found a minimum.

Formally, we write the condition that produce no change in

S

as

δ

⁢

S

=

0

. To make this precise, we simply write

δ

⁢

S

:=

S

⁢

[

q

+

δ

⁢

q

,

q

˙

+

δ

⁢

q

˙

,

t

]

-

S

⁢

[

q

,

q

˙

,

t

]

=

∫

a

b

L

⁢

(

q

+

δ

⁢

q

,

q

˙

+

δ

⁢

q

˙

)

⁢

𝑑

t

-

S

⁢

[

q

,

q

˙

,

t

]

How are we to simplify this mess? We are considering to the path, which suggests a Taylor series expansion of

L

⁢

(

q

+

δ

⁢

q

,

q

˙

+

δ

⁢

q

˙

)

about

(

q

,

q

˙

)

:

L

⁢

(

q

+

δ

⁢

q

,

q

˙

+

δ

⁢

q

˙

)

=

L

⁢

(

q

,

q

˙

)

+

δ

⁢

q

⁢

∂

∂

⁡

q

⁢

L

⁢

(

q

,

q

˙

)

+

δ

⁢

q

˙

⁢

∂

∂

⁡

q

˙

⁢

L

⁢

(

q

,

q

˙

)

+

O

⁢

(

δ

⁢

q

2

)

+

O

⁢

(

δ

⁢

q

˙

2

)

and since we make little error by discarding higher-order terms in

δ

⁢

q

and

δ

⁢

q

˙

, we have

∫

a

b

L

⁢

(

q

+

δ

⁢

q

,

q

˙

+

δ

⁢

q

˙

)

⁢

𝑑

t

=

S

⁢

[

q

,

q

˙

,

t

]

+

∫

a

b

δ

⁢

q

⁢

∂

∂

⁡

q

⁢

L

⁢

(

q

,

q

˙

)

+

δ

⁢

q

˙

⁢

∂

∂

⁡

q

˙

⁢

L

⁢

(

q

,

q

˙

)

⁢

d

⁢

t

Keeping in mind that

δ

⁢

q

˙

=

d

d

⁢

t

⁢

δ

⁢

q

and noting that

d

d

⁢

t

⁢

(

δ

⁢

q

⁢

∂

∂

⁡

q

˙

⁢

L

⁢

(

q

,

q

˙

)

)

=

δ

⁢

q

⁢

d

d

⁢

t

⁢

∂

∂

⁡

q

˙

⁢

L

⁢

(

q

,

q

˙

)

+

δ

⁢

q

˙

⁢

∂

∂

⁡

q

˙

⁢

L

⁢

(

q

,

q

˙

)

,

a simple application of the

product rule

d

d

⁢

t

⁢

(

f

⁢

g

)

=

f

˙

⁢

g

+

f

⁢

g

˙

which allows us to substitute

δ

⁢

q

˙

⁢

∂

∂

⁡

q

˙

⁢

L

⁢

(

q

,

q

˙

)

=

d

d

⁢

t

⁢

(

δ

⁢

q

⁢

∂

∂

⁡

q

˙

⁢

L

⁢

(

q

,

q

˙

)

)

-

δ

⁢

q

⁢

d

d

⁢

t

⁢

∂

∂

⁡

q

˙

⁢

L

⁢

(

q

,

q

˙

)

,

we can rewrite the integral, shortening

L

⁢

(

q

,

q

˙

)

to

L

for convenience, as:

∫

a

b

δ

⁢

q

⁢

∂

∂

⁡

q

⁢

L

+

δ

⁢

q

˙

⁢

∂

∂

⁡

q

˙

⁢

L

⁢

d

⁢

t

=

∫

a

b

δ

⁢

q

⁢

∂

∂

⁡

q

⁢

L

-

δ

⁢

q

⁢

d

d

⁢

t

⁢

∂

∂

⁡

q

˙

⁢

L

+

d

d

⁢

t

⁢

(

δ

⁢

q

⁢

∂

∂

⁡

q

˙

⁢

L

)

⁢

d

⁢

t

=

∫

a

b

δ

⁢

q

⁢

[

∂

∂

⁡

q

⁢

L

-

d

d

⁢

t

⁢

∂

∂

⁡

q

˙

⁢

L

]

⁢

𝑑

t

+

δ

⁢

q

⁢

∂

∂

⁡

q

˙

⁢

L

|

a

b

Substituting all of this progressively back into our original expression for

δ

⁢

S

, we obtain

δ

⁢

S

=

∫

a

b

L

⁢

(

q

+

δ

⁢

q

,

q

˙

+

δ

⁢

q

˙

)

⁢

𝑑

t

-

S

⁢

[

q

,

q

˙

,

t

]

=

S

+

∫

a

b

[

δ

⁢

q

⁢

∂

∂

⁡

q

⁢

L

+

δ

⁢

q

˙

⁢

∂

∂

⁡

q

˙

⁢

L

]

⁢

𝑑

t

-

S

=

∫

a

b

δ

⁢

q

⁢

[

∂

∂

⁡

q

⁢

L

-

d

d

⁢

t

⁢

∂

∂

⁡

q

˙

⁢

L

]

⁢

𝑑

t

+

δ

⁢

q

⁢

∂

∂

⁡

q

˙

⁢

L

|

a

b

=

0

.

Two conditions come to our aid. First, we’re only interested in the neighboring paths that still begin at

a

and end at

b

, which corresponds to the condition

δ

⁢

q

=

0

at

a

and

b

, which lets us cancel the final term. Second, between those two points, we’re interested in the paths which

do

vary, for which

δ

⁢

q

≠

0

.
This leads us to the condition

∫

a

b

δ

⁢

q

⁢

[

∂

∂

⁡

q

⁢

L

-

d

d

⁢

t

⁢

∂

∂

⁡

q

˙

⁢

L

]

⁢

𝑑

t

=

0

.

(8)

The fundamental theorem of the calculus of variations is that for

continuous functions

f

⁢

(

t

)

,

g

⁢

(

t

)

with

g

⁢

(

t

)

≠

0

⁢

∀

t

∈

(

a

,

b

)

,

∫

a

b

f

⁢

(

t

)

⁢

g

⁢

(

t

)

⁢

𝑑

t

=

0

⟹

f

⁢

(

t

)

=

0

⁢

∀

t

∈

(

a

,

b

)

.

(9)

Using this

theorem

, we obtain

∂

∂

⁡

q

⁢

L

-

d

d

⁢

t

⁢

(

∂

∂

⁡

q

˙

⁢

L

)

=

0

.

(10)

This condition, one of the fundamental equations of the calculus of variations, is called the

Euler–Lagrange condition

. When presented with a problem in the calculus of variations, the first thing one usually does is to ask why one simply doesn’t plug the problem’s

L

into this equation and solve.

Recall our shortest-path problem, where we had arrived at

S

=

∫

a

b

L

⁢

𝑑

x

=

∫

x

⁢

1

x

⁢

2

1

+

f

′

⁢

(

x

)

2

⁢

𝑑

x

.

(11)

Here,

x

takes the place of

t

,

f

takes the place of

q

, and (8) becomes

∂

∂

⁡

f

⁢

L

-

d

d

⁢

x

⁢

∂

∂

⁡

f

′

⁢

L

=

0

(12)

Even with

∂

∂

⁡

f

⁢

L

=

0

, this is still ugly. However, because

∂

∂

⁡

f

⁢

L

=

0

, we can use the

Beltrami identity

,

L

-

q

′

⁢

∂

∂

⁡

q

′

⁢

L

=

C

.

(13)

(For the

derivation

of this useful little trick, see the corresponding entry.) Now we must simply solve

1

+

f

′

⁢

(

x

)

2

-

f

′

⁢

(

x

)

⁢

∂

∂

⁡

f

′

⁢

L

=

C

(14)

which looks just as daunting, but quickly reduces to

1

+

f

′

⁢

(

x

)

2

-

f

′

⁢

(

x

)

⁢

1

2

⁢

2

⁢

f

′

⁢

(

x

)

1

+

f

′

⁢

(

x

)

2

=

C

(15)

1

+

f

′

⁢

(

x

)

2

-

f

′

⁢

(

x

)

2

1

+

f

′

⁢

(

x

)

2

=

C

(16)

1

1

+

f

′

⁢

(

x

)

2

=

C

(17)

f

′

⁢

(

x

)

=

1

C

2

-

1

=

m

.

(18)

That is, the slope of the curve representing the shortest path between two points is a

constant

, which means the searched curve, i.e. the

extremal

of this variational problem, must be a straight line. Through this lengthy process, we’ve proved that a straight line is the shortest distance between two points.

To find the actual function

f

⁢

(

x

)

given endpoints

(

x

1

,

y

1

)

and

(

x

2

,

y

2

)

, simply integrate with respect to

x

:

f

⁢

(

x

)

=

∫

f

′

⁢

(

x

)

⁢

𝑑

x

=

∫

b

⁢

𝑑

x

=

m

⁢

x

+

d

(19)

and then apply the

boundary conditions

f

⁢

(

x

1

)

=

y

1

=

m

⁢

x

1

+

d

(20)

f

⁢

(

x

2

)

=

y

2

=

m

⁢

x

2

+

d

(21)

Subtracting the first condition from the second, we get

m

=

y

2

-

y

1

x

2

-

x

1

, the standard equation for the slope of a line. Solving for

d

=

y

1

-

m

⁢

x

1

, we get

f

⁢

(

x

)

=

y

2

-

y

1

x

2

-

x

1

⁢

(

x

-

x

1

)

+

y

1

(22)

which is the basic equation for a line passing through

(

x

1

,

y

1

)

and

(

x

2

,

y

2

)

.

The solution to the brachistochrone problem, while slightly more complicated, follows along exactly the same lines.

Title

calculus of variations

Canonical name

CalculusOfVariations

Date of creation

2013-03-22 12:20:48

Last modified on

2013-03-22 12:20:48

Owner

rspuzio (6075)

Last modified by

rspuzio (6075)

Numerical id

16

Author

rspuzio (6075)

Entry type

Topic

Classification

msc 49K05

Classification

msc 47A60

Related topic

TaylorSeries

Related topic

LinearFunctional

Related topic

BeltramiIdentity

Related topic

EulerLagrangeDifferentialEquation

Related topic

TheoremForLocallyIntegrableFunctions

Related topic

Extremal

Related topic

EquationOfCatenaryViaCalculusOfVariations

Related topic

LeastSurfaceOfRevolution

Related topic

BrachistochroneCurve

Related topic

SpeediestInclinedPlane

Defines

brachistochrone problem

Generated on Fri Feb 9 21:48:36 2018 by

LaTeXML