Related papers: A Computer Program for the Newman-Janis Algorithm
We propose a quantum algorithm based on ridge regression model, which get the optimal fitting parameters w and a regularization hyperparameter {\alpha} by analysing the training dataset. The algorithm consists of two subalgorithms. One is…
It is well-known that the quadratic convex reformulation (QCR) technique can speed up some general-purpose solvers such as CPLEX and Gurobi. Recently, the method of quadratic nonconvex reformulation (QNR) was proposed, which provides an…
We consider variants of a recently-developed Newton-CG algorithm for nonconvex problems \citep{royer2018newton} in which inexact estimates of the gradient and the Hessian information are used for various steps. Under certain conditions on…
The article presents a series of numerical simulations of exact solutions of the Einstein equations performed using the Cactus code, a complete 3-dimensional machinery for numerical relativity. We describe an application (``thorn'') for the…
The reduction algorithm is used to compute reduced ideals of a number field. However, there are reduced ideals that can never be obtained from this algorithm. In this paper, we will show that these ideals have inverses of larger norms among…
The imposition of a constraint between the metric tensor elements in both three- and four-dimensional, rotating AdS space-times is shown to reduce the number of independent equations of motion and to result in new families of solutions to…
We propose a neural-network variational quantum algorithm to simulate the time evolution of quantum many-body systems. Based on a modified restricted Boltzmann machine (RBM) wavefunction ansatz, the proposed algorithm can be efficiently…
A calculational scheme of quantum-gravitational effects on the physical quantities is proposed. The calculations are performed in 4-$\epsilon$ dimension with $1/N$-expansion scheme, where the Einstein gravity is renormalizable and it has an…
Any practical attempt to solve the Regge equations, these being a large system of non-linear algebraic equations, will almost certainly employ a Newton-Raphson like scheme. In such cases it is essential that efficient algorithms be used…
This article derives lower bounds on the convergence rate of continuous-time gradient-based optimization algorithms. The algorithms are subjected to a time-normalization constraint that avoids a reparametrization of time in order to make…
To avoid instabilities in the continuum semi-classical limit of loop quantum cosmology models, refinement of the underlying lattice is necessary. The lattice refinement leads to new dynamical difference equations which, in general, do not…
This paper proposes several novel optimization algorithms for minimizing a nonlinear objective function. The algorithms are enlightened by the optimal state trajectory of an optimal control problem closely related to the minimized objective…
In this paper, we propose a new and efficient nonmonotone adaptive trust region algorithm to solve unconstrained optimization problems. This algorithm incorporates two novelties: it benefits from a radius dependent shrinkage parameter for…
The dimensionful nature of the coupling in the Einstein-Hilbert action in four dimensions implies that the theory is non-renormalizable; explicit calculation shows that beginning at two loop order, divergences arise that cannot be removed…
Newton's method is the most widespread high-order method, demanding the gradient and the Hessian of the objective function. However, one of the main disadvantages of Newtons method is its lack of global convergence and high iteration cost.…
We present a stochastic inexact Gauss-Newton method for the solution of nonlinear least-squares. To reduce the computational cost with respect to the classical method, at each iteration the proposed algorithm approximately minimizes the…
Here we look at an application of the Hartle metric to describe a rotating version of the spherical string cloud/ global monopole solution. While rotating versions of this solution have previously been constructed via the Newman-Janis…
We propose a random coordinate descent algorithm for optimizing a non-convex objective function subject to one linear constraint and simple bounds on the variables. Although it is common use to update only two random coordinates…
We consider the computation of the entanglement-assisted quantum rate-distortion function, which plays a central role in quantum information theory. We propose an efficient alternating minimization algorithm based on the Lagrangian…
This paper continues a study of field theories specified for the nonuniform lattice in the finite-dimensional hypercube with the use of the earlier described deformation parameters. The paper is devoted to spontaneous breakdown and…