Astronomy and Astrophysics – Astrophysics
Scientific paper
2004-07-29
Prog.Theor.Phys. 112 (2004) 241-248; Erratum-ibid. 115 (2006) 845
Astronomy and Astrophysics
Astrophysics
8 pages (PTPTeX); accepted for publication in Prog. Theor. Phys
Scientific paper
10.1143/PTP.112.241
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 $x$ in Cartesian coordinates) without the other component (say $y$), 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.
Asada Hideki
Kasai Masumi
Kasai Taketoshi
No associations
LandOfFree
Euclidean Algorithm for a Gravitational Lens in a Polynomial Equation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Euclidean Algorithm for a Gravitational Lens in a Polynomial Equation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Euclidean Algorithm for a Gravitational Lens in a Polynomial Equation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-456648