相关论文: Untangling the Newman-Janis algorithm
We examine the Newman-Janis algorithm's application to an exact regular static solution sustained by a minimally coupled scalar field with a non-standard kinetic term. Although coordinate complexification leads to a regular Kerr-like black…
A REDUCE code for the Newman-Janis algorithm is described. This algorithm is intended to include rotation into nonrotating solutions of the Einstein field equations with spherically symmetry or perturbed spherically symmetry and has been…
It is shown that the Kerr metric represents the nonlinear superposition of self-dual and anti-self-dual Taub-NUT instantons. This promotes the Newman-Janis algorithm to a rigorous derivation of the Kerr metric with a definite physical…
The Janis-Newman algorithm is an old but very powerful tool to generate rotating solutions from static ones through a set of complex coordinate transformations. Several solutions have been derived in this way, including solutions with gauge…
The Newman-Janis algorithm is well known to provide rotating black holes solutions to Einstein's equations from static seeds, through a complexification of a radial and a time coordinates. However, an ambiguity remains for the replacement…
The purpose of the present article is to show that the Newman-Janis and Newman et al algorithm used to derive the Kerr and Kerr-Newman metrics respectively, automatically leads to the extension of the initial non negative polar radial…
The Newman-Janis algorithm is supplemented with a null rotation and applied to the tensors of the Reissner-Nordstr\"om spacetime to generate the metric, Maxwell, Ricci and Weyl tensors for the Kerr-Newman spacetime. This procedure also…
The Newman-Janis trick is a procedure, (not even really an ansatz), for obtaining the Kerr spacetime from the Schwarzschild spacetime. This 50 year old trick continues to generate heated discussion and debate even to this day. Most of the…
A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…
A new notion of Cartan pairs as a substitute of notion of vector fields in noncommutative geometry is proposed. The correspondence between Cartan pairs and differential calculi is established.
In this paper we review the recently proposed path-integral counterpart of the Koopman-von Neumann operatorial approach to classical Hamiltonian mechanics. We identify in particular the geometrical variables entering this formulation and…
In this paper we present a class of metrics to be considered as new possible sources for the Kerr metric. These new solutions are generated by applying the Newman-Janis algorithm (NJA) to any static spherically symmetric (SSS) ``seed''…
The Newman-Janis algorithm is the standard approach to rotation in general relativity which, in vacuum, builds the Kerr metric from the Schwarzschild spacetime. Recently, we have shown that the same algorithm applied to the Papapetrou…
We study the Gauss-Manin connection on the chiral de Rham complex.
We present a novel algorithm for performing the Cartan-Khaneja-Glaser decomposition of unitary matrices in $SU(2^n)$, a critical task for efficient quantum circuit design. Building upon the approach introduced by S\'a Earp and Pachos…
This article develops the numerical and theoretical study of a reconstruction algorithm of a potential in a wave equation from boundary measurements, using a cost functional built on weighted energy terms coming from a Carleman estimate.…
In this paper, we first provide an updated survey of the geometry of complex Cartan spaces. New characterizations for some particular classes of complex Cartan spaces are pointed out, e.g. Landsberg-Cartan, strongly Berwald-Cartan and…
We present a simple approach for obtaining Kerr interior solutions with the help of the Newman-Janis algorithm (NJA) starting with static space-times describing physically sensible interior Schwarzschild solutions. In this context, the…
We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear and Multilinear Algebra 1(2), 1973, pp. 163-171]. Our algorithms are based on…
This article gives a rapid introduction to the complex Neumann problem and Kohn's algorithm for generating subelliptic estimate.