Jump to content

Newman–Janis algorithm

From Wikipedia, the free encyclopedia
(Redirected from Newman–Janis Algorithm)

In general relativity, the Newman–Janis algorithm (NJA) is a complexification technique for finding exact solutions to the Einstein field equations. In 1964, Newman and Janis showed that the Kerr metric could be obtained from the Schwarzschild metric by means of a coordinate transformation and allowing the radial coordinate to take on complex values. Originally, no clear reason for why the algorithm works was known.[1]

In 1998, Drake and Szekeres gave a detailed explanation of the success of the algorithm and proved the uniqueness of certain solutions. In particular, the only perfect fluid solution generated by NJA is the Kerr metric and the only Petrov type D solution is the Kerr–Newman metric.[2]

The algorithm works well on ƒ(R) and Einstein–Maxwell–Dilaton theories, but doesn't return expected results on Braneworld and Born–Infield theories.[3]

See also

[edit]

References

[edit]
  1. ^ Newman, E. T.; Janis, A. I. (June 1965). "Note on the Kerr Spinning Particle Metric". Journal of Mathematical Physics. 6 (6): 915–917. Bibcode:1965JMP.....6..915N. doi:10.1063/1.1704350.
  2. ^ Drake, S. P.; Szekeres, P. (2000). "Uniqueness of the Newman–Janis Algorithm in Generating the Kerr–Newman Metric". General Relativity and Gravitation. 32 (3): 445–457. arXiv:gr-qc/9807001. Bibcode:2000GReGr..32..445D. doi:10.1023/A:1001920232180. S2CID 123507909.
  3. ^ Canonico, Rosangela; Parisi, Luca; Vilasi, Gaetano (2011). "The Newman Janis Algorithm: A Review of Some Results". Proceedings of the Twelfth International Conference on Geometry, Integrability and Quantization. 12. Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences: 159–169. doi:10.7546/giq-12-2011-159-169. S2CID 124148817.