Euclidean Algorithm for a Gravitational Lens in a Polynomial Equation
From MaRDI portal
Abstract: The Euclidean algorithm in algebra is applied to a class of gravitational lenses for which the lens equation consists of any set of coupled polynomial equations in the image position. In general, this algorithm allows us to reduce an apparently coupled system to a single polynomial in one variable (say in Cartesian coordinates) without the other component (say ), which is expressed as a function of the first component. This reduction enables us to investigate the lensing properties in an algebraic manner: For instance, we can obtain an analytic expression of the caustics by computing the discriminant of the polynomial equation. To illustrate this Euclidean algorithm, we re-examine a binary gravitational lens and show that the lens equation is reduced to a single real fifth-order equation, in agreement with previous works. We apply this algorithm also to the linearlized Kerr lens and find that the lens equation is reduced to a single real fifth-order one.
Recommendations
- Images for a binary gravitational lens from a single real algebraic equation
- Algebraic Properties of the Real Quintic Equation for a Binary Gravitational Lens
- Images for an isothermal ellipsoidal gravitational lens from a single real algebraic equation
- Partial realization and the Euclidean algorithm
- Euclid meets Bézout: intersecting algebraic plane curves with the Euclidean algorithm
Cited in
(3)
This page was built for publication: Euclidean Algorithm for a Gravitational Lens in a Polynomial Equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4832589)
