Following the Elliptical Path: How Particles Move in Mathematical Physics

Have you ever watched a satellite orbit a planet or marveled at the way planets orbit the sun? Their paths often trace out more than just perfect circles — they move in ellipses. But how do we describe such motion mathematically? And how can we measure how far an object has moved if it's not traveling in a straight line? Let’s take a look at a mathematical model for this type of motion, break it down, and even compute how far the particle travels using some Octave code (a free alternative to MATLAB). ---

The Position Vector: A Mathematical Story

In physics, the position of a moving particle in 2D can be described with a position vector. Here's a special one that traces out an ellipse:

r(t) = < a*cos(ωt), b*sin(ωt) >

This vector has:
  • a: the horizontal radius of the ellipse
  • b: the vertical radius
  • ω (omega): the angular speed of the particle
  • t: time
---

What Shape Is This?

Let’s prove it's an ellipse. We define:
  • x(t) = a*cos(ωt)
  • y(t) = b*sin(ωt)
Now, divide both sides by their respective coefficients and square:
  • (x/a)^2 = cos^2(ωt)
  • (y/b)^2 = sin^2(ωt)
Add them:

(x/a)^2 + (y/b)^2 = cos^2(ωt) + sin^2(ωt) = 1

That’s the standard equation of an ellipse. So the particle moves around a squished circle — an ellipse! ---

Velocity and Acceleration

Motion isn’t just about position — it’s about how fast and how the speed changes. We find velocity by taking the derivative of the position vector:

v(t) = < -a*ω*sin(ωt), b*ω*cos(ωt) >

And acceleration by taking the derivative of velocity:

a(t) = < -a*ω²*cos(ωt), -b*ω²*sin(ωt) >

Notice how acceleration is just the original position vector scaled by -ω²:

a(t) = -ω² * r(t)

This means the particle is always being pulled toward the center — like gravity or a spring. ---

How Far Does It Travel?

We can’t just subtract final minus initial position — the particle is moving along a curved path. We need to integrate the speed over time. The speed is the length (magnitude) of the velocity vector:

|v(t)| = ω * sqrt( a²*sin²(ωt) + b²*cos²(ωt) )

So the total distance traveled from time t₀ to t₁ is:

Distance = ∫ₜ₀ᵗ₁ ω * sqrt( a²*sin²(ωt) + b²*cos²(ωt) ) dt

This kind of integral doesn’t have a nice simple formula — but we can calculate it numerically. ---

Let’s Code It in Octave

Below is the Octave code to compute this integral numerically. 
% Parameters
a = 5;                 % Horizontal radius
b = 3;                 % Vertical radius
omega = 2 * pi;        % One full cycle per second
t0 = 0;                % Start time
t1 = 1;                % End time (1 second = one full loop)

% Define the speed function
speed = @(t) omega .* sqrt(a^2 .* sin(omega * t).^2 + b^2 .* cos(omega * t).^2);

% Compute distance using numerical integration
distance = quad(speed, t0, t1);

% Display result
fprintf('Distance traveled from t = %.2f to t = %.2f is approximately %.5f units.\n', t0, t1, distance);
Note: If you're using a newer version of Octave or MATLAB, you can replace quad with integral. ---

What Does This Teach Us?

  1. Curved paths require calculus to measure distance.
  2. Elliptical motion arises naturally from sine and cosine functions.
  3. With the right tools — math, physics, and a little code — we can describe and compute motion precisely.
---

Try This Yourself:

Modify the parameters in the code:
  • Change values of a and b to make the ellipse wider or taller.
  • Try computing the distance for half a loop, or multiple loops.
  • Plot the path like this:
t = linspace(t0, t1, 1000);
x = a * cos(omega * t);
y = b * sin(omega * t);
plot(x, y);
axis equal;
title('Elliptical Path');
xlabel('x');
ylabel('y');
--- Thanks for exploring math and motion with me! If you’re curious how this connects to satellites, springs, or atoms — you’re already thinking like a physicist. Let me know in the comments what you'd like to explore next.

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