Application of Variations of Parameters and Duhamel's Principle: A Simple Example

In the previous post, we explored the theoretical differences and similarities between Variations of Parameters and Duhamel's Principle. Now, let’s bring these ideas to life with a simple example, demonstrating how these methods work in practice. We'll aim for clarity and connection, using an example that connects to everyday phenomena like heat distribution.

A Problem: Modeling Heat Transfer in a Rod

Imagine a metal rod that is heated at one end while the rest is kept cool. Over time, heat spreads along the rod. Mathematically, this situation can be modeled with the heat equation, a partial differential equation (PDE):

∂u/∂t = α ∂²u/∂x²

where:

  • u(x, t) is the temperature at position x and time t,
  • α is a constant representing how well the material conducts heat,
  • ∂u/∂t is the rate of change of temperature with time,
  • ∂²u/∂x² is the second derivative of temperature with position, representing how temperature changes spatially.

Suppose the rod initially has no heat (u(x, 0) = 0) and we apply a heat source at x = 0, modeled as g(t) = sin(t). How does the temperature u(x, t) evolve?

Approach 1: Variations of Parameters

For PDEs like the heat equation, Variations of Parameters can seem complex, but the core idea remains: use the homogeneous solution and adjust it to fit the specific heat source. Here’s a simplified overview:

  1. Solve the Homogeneous Equation:
    The solution to the heat equation without any heat source (g(t) = 0) is:

    u_h(x, t) = ∫₀^∞ A(k) e^(-αk²t) cos(kx) dk

    where A(k) is determined by boundary conditions.

  2. Adjust for the Non-Homogeneous Term:
    Assume that A(k) is not a constant but depends on t: A(k, t). This adjustment ensures the solution reflects the applied heat source g(t).

  3. Find A(k, t):
    Differentiating and substituting back into the heat equation lets us solve for A(k, t) in terms of g(t).

Approach 2: Duhamel’s Principle

Duhamel’s Principle offers a more intuitive method by thinking of the heat source g(t) as being applied incrementally over time.

  1. Impulse Response:
    Solve the heat equation for a very short pulse of heat applied at t = 0, which gives the response:

    u_impulse(x, t) = 1 / √(4παt) * e^(-x² / (4αt))

  2. Superposition of Responses:
    Use the idea of superposition to combine the responses over time, weighted by g(t). The solution is given by:

    u(x, t) = ∫₀^t u_impulse(x, t - τ) g(τ) dτ

  3. Apply g(t) = sin(t):
    Substituting the heat source g(t) = sin(t) into the integral gives the complete solution:

    u(x, t) = ∫₀^t (1 / √(4πα(t - τ))) * e^(-x² / (4α(t - τ))) sin(τ) dτ

Key Takeaways

  • Variations of Parameters adjusts the constants in the homogeneous solution to account for the heat source.
  • Duhamel’s Principle constructs the solution as a sum of the system’s response to each part of the heat source.

In this example, Duhamel’s Principle provides a more direct approach for solving the heat equation with a time-dependent heat source. Its reliance on convolution integrals makes it particularly suited to problems involving dynamic inputs, like our g(t) = sin(t).

A Visualization: Heat Distribution

If we plot u(x, t), we’d see the heat spreading along the rod over time, with the oscillations of g(t) = sin(t) influencing the distribution. This connection between mathematics and physical behavior demonstrates the power of these methods.

Whether you’re solving PDEs in engineering or physics, mastering these techniques equips you to tackle dynamic systems and uncover the beautiful patterns within.


Comments

Post a Comment

Popular posts from this blog

What is Mathematical Fluency?

What does it really mean for students to be mathematically fluent? If you’ve been in any math PD over the past few years, you’ve likely heard the phrase everywhere. We talk about fluency as something students should develop, strengthen, and demonstrate, but it can still feel abstract when we try to describe it in observable, classroom-ready terms. This post breaks down mathematical fluency into the two simplest frames we can use as teachers: what it looks like and what it sounds like . These descriptions can guide instruction, assessment, student goal-setting, and even walkthrough conversations with colleagues or administrators. What Mathematical Fluency Looks Like In a classroom where students are developing mathematical fluency, you see students making choices about strategies rather than following steps robotically. They use representations—number lines, diagrams, tables, graphs, manipulatives, symbolic expressions—and switch between them to make sense of a problem. They move ...
Read more

Unlocking the Group: Cosets, Cayley’s Theorem, and Lagrange’s Theorem

Mathematics is full of elegant ideas that take simple definitions and build deep, powerful structures. In group theory, three such concepts—cosets, Cayley's Theorem, and Lagrange’s Theorem—form a foundational trio that unveils the internal symmetry of algebraic systems. Let’s explore what they mean and why they matter. What’s a Coset, Really? Imagine you have a group and a smaller subgroup inside it. Now, pick any element from the big group and use it to shift every element in the subgroup by multiplying on the left. The resulting set is called a left coset . You can also do this multiplication on the right, forming a right coset . These cosets aren’t usually groups themselves—but they do break the original group into equal-sized, non-overlapping pieces. Intuitively , cosets act like “shifts” of the subgroup across the whole group. Think of tiling a floor: each tile is a copy of the same shape (the subgroup) placed in different locations (cosets). Lagrange’s Theorem: Size Matt...
Read more

Verifying the Binomial Formula with Mathematical Induction

The binomial formula states: ( z 1 + z 2 ) n = ∑ k = 0 n ( n k ) z 1 n − k z 2 k (z_1 + z_2)^n = \sum_{k=0}^n \binom{n}{k} z_1^{n-k} z_2^k where ( n k ) = n ! k ! ( n − k ) ! \binom{n}{k} = \frac{n!}{k!(n-k)!} and n = 1 , 2 , … n = 1, 2, \ldots . This is a powerful formula in algebra, expressing the expansion of ( z 1 + z 2 ) n (z_1 + z_2)^n as a sum of terms involving powers of z 1 z_1 and z 2 z_2 . We’ll verify this formula using mathematical induction . Mathematical induction is a logical method to prove that a statement holds for all positive integers n n . The process involves two steps: Base Case : Verify the formula for the smallest value of n n , typically n = 1 n = 1 . Inductive Step : Assume the formula holds for some n = k n = k , and then prove it holds for n = k + 1 n = k+1 . Step 1: Base Case ( n = 1 n = 1 ) For n = 1 n = 1 , the formula becomes: ( z 1 + z 2 ) 1 = ∑ k = 0 1 ( 1 k ) z 1 1 − k z 2 k (z_1 + z_2)^1 = \sum_{k=0}^1 \binom{1}{k} z_1^{1-k} z_2^k L...
Read more