Multivariable Calculus Jeremy Irvin and Daniel Spokoyny - - PowerPoint PPT Presentation

multivariable calculus
SMART_READER_LITE
LIVE PREVIEW

Multivariable Calculus Jeremy Irvin and Daniel Spokoyny - - PowerPoint PPT Presentation

Multivariable Calculus Jeremy Irvin and Daniel Spokoyny Derivative Let be open. A function is differentiable at if exists. We call this value f(x) . Intuitively, a function is differentiable if it is locally


slide-1
SLIDE 1

Multivariable Calculus

Jeremy Irvin and Daniel Spokoyny

slide-2
SLIDE 2

Derivative

  • Let be open. A function

is differentiable at if

  • exists. We call this value f’(x).
  • Intuitively, a function is differentiable if it

is locally approximated by a line.

slide-3
SLIDE 3

Derivative

  • If f is differentiable, we can rewrite this as
  • Or equivalently,
slide-4
SLIDE 4

Derivative

  • Now let be open, and .

Then f is differentiable at if such that

  • Intuitively, f is differentiable if it is locally

approximated by a linear function.

slide-5
SLIDE 5

Partial Derivative

  • Let . The jth partial derivative of f

at is provided this limit exists.

slide-6
SLIDE 6

Total and Partial Derivative

  • Now let and . We can

write

  • And if and , writing the

component of x out explicitly,

slide-7
SLIDE 7

Total and Partial Derivative

  • So we can define
  • Because f’(x) is linear, it can be represented

as a matrix, call it . In fact,

slide-8
SLIDE 8

Total and Partial Derivative

  • If f is real-valued ( ), then the

matrix representation of f’(x) is called the gradient of f at x, denoted

  • Think of the gradient as a direction in

which the parameters move so that the function f increases the fastest.

slide-9
SLIDE 9

Convexity

  • Let . A function is convex if

for all ,

  • This means that the line between any two

points on the graph of f lies above the graph

  • f f (see blackboard).
  • Convex functions have a single global
  • ptimum.
slide-10
SLIDE 10

Lagrange Multipliers

Jeremy Irvin and Daniel Spokoyny

slide-11
SLIDE 11

Lagrange Multipliers

  • Suppose is continuously

differentiable, and let M be the set of points such that and . If the differentiable function attains its maximum or minimum on M at the point , then is called the “Lagrange multiplier”.

slide-12
SLIDE 12

Lagrange Multiplier Example

  • Find the rectangular box of volume 1000

which has the least total surface area A.

  • Let and

.

  • We want to minimize f on the set of points

which satisfy .

  • Sounds like Lagrange Multipliers!
slide-13
SLIDE 13

Lagrange Multiplier Example

  • We want to solve
  • It is easily seen that the unique solution to

this set of equations is x=y=z=10.

slide-14
SLIDE 14

Generalized Lagrange Multipliers

  • Informally, given some constraints

, and denoting M the set

  • f points which satisfy them, if (under some

conditions on these constraints) the differentiable function attains a local maximum or minimum on M at , then

  • So to find points which optimize f given

some constraints, simply solve the set of equations above.

slide-15
SLIDE 15

Matrix Calculus

slide-16
SLIDE 16

Matrix Gradient

  • Let (input matrix, output real

value). The gradient of f with respect to some input is the matrix of partial derivatives:

  • More compactly,
slide-17
SLIDE 17

Matrix Derivative Properties

slide-18
SLIDE 18

Hessian

  • Suppose . The Hessian matrix

with respect to x is the n x n matrix of partial derivatives:

  • More compactly,
slide-19
SLIDE 19

Gradients/ Hessians of Quadratic/ Linear Functions

slide-20
SLIDE 20

What Just Happened?

  • Multivariable Derivative
  • Convexity
  • Lagrange Multipliers
  • Matrix Calculus
slide-21
SLIDE 21

Done with math!! (kinda)