Related papers: Janis-Newman algorithm: simplifications and gauge …
The Wigner rotation matrix ($d$-function), which appears as a part of the angular-momentum-projection operator, plays a crucial role in modern nuclear-structure models. However, it is a long-standing problem that its numerical evaluation…
The most general stationary black-hole solution of Einstein-Maxwell theory in vacuum is the Kerr-Newman metric, specified by three parameters: mass M, spin J and charge Q. Within classical general relativity, the most important and…
The Gauss-Newton algorithm is a popular and efficient centralized method for solving non-linear least squares problems. In this paper, we propose a multi-agent distributed version of this algorithm, named Gossip-based Gauss-Newton (GGN)…
A Gaussian elimination form of inverse iteration within the complex coordinate approach is shown to produce a simple uniform method of finding both real bound state energies and complex resonant state energies for several problems which…
The iterative algorithm recently proposed by Waxman for solving eigenvalue problems, which relies on the method of moments, has been modified to improve its convergence considerably without sacrificing its benefits or elegance. The…
We develop a novel, fundamental and surprisingly simple randomized iterative method for solving consistent linear systems. Our method has six different but equivalent interpretations: sketch-and-project, constrain-and-approximate, random…
In the paper nonlinear transformations of the Jordan-Wigner (JW) type are introduced in the form different from the ones known previously, for the purpose of expressing multi-index Pauli operators in terms of multi-index Fermi creation and…
A new mechanism for mass generation of gauge fields is proposed in this paper. By introducing two sets of gauge fields and making the variatons of these two sets of gauge fields compensate each other under local gauge transformations, the…
Algorithms for computing the classical Gaussian quadrature rules (Gauss--Jacobi, Gauss--Laguerre, and Gauss--Hermite) are presented, based on globally convergent fourth-order iterative methods combined with asymptotic approximations, which…
Newman and Rovelli have used singular Hamilton-Jacobi transformations to reduce the phase space of general relativity in terms of the Ashtekar variables. Their solution of the gauge constraint cannot be inverted and indeed has no Minkowski…
The Kaczmarz method is an algorithm for finding the solution to an overdetermined consistent system of linear equations Ax=b by iteratively projecting onto the solution spaces. The randomized version put forth by Strohmer and Vershynin…
We employ the gravitational decoupling approach for static and spherically symmetric systems to develop a simple and powerful method in order to a) continuously isotropize any anisotropic solution of the Einstein field equations, and b)…
The Neumann--Neumann method is a commonly employed domain decomposition method for linear elliptic equations. However, the method exhibits slow convergence when applied to semilinear equations and does not seem to converge at all for…
Second-order optimization approaches like the generalized Gauss-Newton method are considered more powerful as they utilize the curvature information of the objective function with preconditioning matrices. Albeit offering tempting…
The solution of the Ornstein-Zernike equation with various closure approximations is studied. This problem is rewritten as an integral equation that can be solved iteratively on a grid. The convergence of the fixed point iterations is…
The equations of motion of massive particles in GR are completely determined by the field equation. We utilize the particular form of Einstein's field equation and propose for the $N$-body problem of the equations that are Lorentz invariant…
Graph Neural Networks (GNNs) are a powerful representational tool for solving problems on graph-structured inputs. In almost all cases so far, however, they have been applied to directly recovering a final solution from raw inputs, without…
The strategy of obtaining the familiar Kerr-Newman solution in general relativity is based on either using the metric ansatz in the Kerr-Schild form, or applying the method of complex coordinate transformation to a non-rotating charged…
We propose a Randomised Subspace Gauss-Newton (R-SGN) algorithm for solving nonlinear least-squares optimization problems, that uses a sketched Jacobian of the residual in the variable domain and solves a reduced linear least-squares on…
The problem of Dirac's equation in a rotating electromagnetic field can be reduced to the stationary by using a transformation for point rotating reference frames. The general form of the non-Galilean transformation is deduced in the paper.…