What is the gradient formula for a directional derivative?
For a differentiable function, the directional derivative in unit direction is .
Study 04 Gradients and Optimization with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is the gradient formula for a directional derivative?
For a differentiable function, the directional derivative in unit direction u is Duf=∇f⋅u.
How do you convert a direction vector into a unit vector?
Normalize a nonzero direction vector v by dividing it by its magnitude: u=∥v∥v.
How is the gradient of f(x,y,z) defined?
For f(x,y,z), the gradient is ∇f=⟨∂x∂f,∂y∂f,∂z∂f⟩.
What do the direction and magnitude of the gradient represent?
The gradient points in the direction of steepest ascent, and its magnitude ∥∇f∥ is the maximum rate of increase.
When is a directional derivative zero?
A direction perpendicular to ∇f has directional derivative zero, because Duf=∇f⋅u=0.
What is the geometric relation between a gradient and a level curve?
The gradient is normal, or perpendicular, to a level curve f(x,y)=c at a regular point.
What equation gives the tangent plane to F(x,y,z)=c?
For F(x,y,z)=c at P=(x0,y0,z0), the tangent plane is ∇F(P)⋅⟨x−x0,y−y0,z−z0⟩=0.
What is the tangent-plane formula for z=f(x,y)?
For z=f(x,y), the tangent plane at (x0,y0,f(x0,y0)) is z−f(x0,y0)=fx(x0,y0)(x−x0)+fy(x0,y0)(y−y0).
What makes an interior point a critical point?
An interior point is critical if ∇f(a)=0 or if a relevant partial derivative does not exist.
How does the second-derivative test classify a critical point?
For a critical point, let D=fxxfyy−(fxy)2. If D>0 and fxx>0, it is a local minimum; if D>0 and fxx<0, a local maximum; if D<0, a saddle.
What equations define Lagrange multipliers for one constraint?
To optimize f subject to g=c, solve ∇f=λ∇g together with g=c, then compare the objective values at all candidates.
What are the extrema of xy on the unit circle?
For f(x,y)=xy on x2+y2=1, the maximum is 21 when y=x, and the minimum is −21 when y=−x.
A progressive guide to interpreting, calculating, and applying limits, asymptotes, continuity, and the Intermediate Value Theorem.
A progressive guide to converting, graphing, differentiating, and integrating polar curves, with emphasis on symmetry, intersections, area, and arc length.
A 14-question quiz on mathematical induction, strong induction, well-ordering, recursive definitions, and structural induction. Questions progress from introductory recognition to medium-difficulty application and proof reasoning.
A 14-question quiz on sequences, sequence limits, monotonicity, boundedness, convergence criteria, the Squeeze Theorem, limit laws, and recursive sequences. Questions progress from foundational understanding to applied reasoning.
A structured guide to defining sequences, evaluating their limits, and proving convergence or divergence using limit laws, bounds, monotonicity, the Squeeze Theorem, and recursive methods.
A structured guide to vector spaces, subspaces, spans, independence, bases, dimension, and coordinates, with definitions, tests, examples, and a unified problem-solving workflow.
A medium-difficulty quiz on advanced counting methods, including binomial coefficients, stars and bars, the binomial theorem, inclusion-exclusion, recurrences, tilings, derangements, and characteristic equations.
A progressive guide to choosing and applying binomial coefficients, the binomial theorem, inclusion-exclusion, and recurrence relations in advanced counting problems.
A progressive guide to identifying eigenvalues and eigenvectors, computing eigenspaces, comparing algebraic and geometric multiplicities, and determining when a matrix can be diagonalized.
A 14-question assessment on power series, convergence, term-by-term operations, Taylor and Maclaurin series, polynomial approximation, and error bounds. The questions progress from foundational interpretation to applied convergence and approximation problems.
A progressive guide to representing functions with power and Taylor series, determining convergence, manipulating series, and controlling approximation error.
A structured guide to describing sequences, simplifying sums, modeling and solving recurrence relations, using generating functions, and analyzing recursive algorithms.