相关论文: Algorithms for computer algebra calculations in sp…

We argue that the curvature generated by a gravitational field can be used to calculate the corresponding metric which determines the trajectories of freely falling test particles. To this end, we present a method to compute the metric from…

We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a quartic speedup while using exponentially smaller space than the fastest classical…

An algorithm is given for explicitly computing Penrose diagrams for spacetimes of the form $ds^2 = -f(r)\, dt^2 + f(r)^{-1} \, dr^2 + r^2 \, d\Omega^2$. The resulting diagram coordinates are shown to extend the metric continuously and…

Incorporating second order curvature information in gradient based methods have shown to improve convergence drastically despite its computational intensity. In this paper, we propose a stochastic (online) quasi-Newton method with…

This paper reviews the standard algorithm for converting spacecraft state vectors to Keplerian orbital elements with a focus on its computer implementation. It analyzes the shortcomings of the scheme as described in the literature, and…

We introduce a quantum algorithm for computing the Ollivier Ricci curvature, a discrete analogue of the Ricci curvature defined via optimal transport on graphs and general metric spaces. This curvature has seen applications ranging from…

This paper deals with the concept of curvature of framed space curves, their higher-order derivatives, variations, and co-rotational derivatives. We realize that parametrizing rotation tensor using the Gibbs vector is effective in deriving…

The paper is constructed in two parts.In the first part we introduce the concept of the algebra of Q-meromorphic functions on the quantum plane.The A (q)-algebra of Q-analytic functions considered in[6]is seen as a proper subalgebra. In the…

This paper introduces an efficient second-order method for solving the elastic net problem. Its key innovation is a computationally efficient technique for injecting curvature information in the optimization process which admits a strong…

Inspired by the universality of computation, we advocate for a principle of spacetime complexity, where gravity arises as a consequence of spacetime optimizing the computational cost of its own quantum dynamics. This principle is explicitly…

We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…

Algebraic curvature tensors possess generators which can be formed from symmetric or alternating tensors S, A or tensors \theta with an irreducible (2,1)-symmetry. In differential geometry examples of curvature formulas are known which…

We present the tensor computer algebra package xPert for fast construction and manipulation of the equations of metric perturbation theory, around arbitrary backgrounds. It is based on the combination of explicit combinatorial formulas for…

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…

In this article, a fast algorithm based on time two-mesh (TT-M) finite element (FE) scheme, which aims at solving nonlinear problems quickly, is considered to numerically solve the nonlinear space fractional Allen-Cahn equations with smooth…

We present an efficient quantum algorithm aiming to find the negative curvature direction for escaping the saddle point, which is the critical subroutine for many second-order non-convex optimization algorithms. We prove that our algorithm…

Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach and evaluation of computational complexity. However in…

Geometry and topology have generated impacts far beyond their pure mathematical primitive, providing a solid foundation for many applicable tools. Typically, real-world data are represented as vectors, forming a linear subspace for a given…

Large scale numerical experiments are commonplace today in theoretical physics. The high performance algorithms described herein are the most compact, efficient methods known for representing and analyzing systems modeled well by sets or…

We introduce a quantum dynamic programming framework that allows us to directly extend to the quantum realm a large body of classical dynamic programming algorithms. The corresponding quantum dynamic programming algorithms retain the same…