Minimum distance between ellipses

  • Thread starter Thread starter Coelum
  • Start date Start date
  • Tags Tags
    ellipses Minimum
Coelum
Messages
97
Reaction score
32
Forum,
I'm addressing the problem of computing the minimum possible distance between two non-interacting bodies on elliptical orbits. From a general point of view, it looks like a minimization problem of a function of two variables, e.g. in the domain [0,2*pi)*[0,2*pi). This problem can be numerically addressed in a standard fashion, e.g. by a conjugate gradient method. But I wonder if an analytical approach exists that can simplify the problem - maybe reducing it to unidimensional - and significantly speed-up the computation.
I have posted the some question on the Celestial Mechanics Forum - no reply so far.
 
Mathematics news on Phys.org
If the path is ellptical, wouldn't it just be a straight line representing the minor axis of the ellipse?
 
I guess I've not been clear enough: I'm dealing with two ellipses (e.g., representing the paths of two minor planets around the sun) in 3D. Of course, you may assume that they share one of the foci.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top