Related papers: Algorithms for geodesics
The method of geodesic deviations provides analytic approximations to geodesics in arbitrary background space-times. As such the method is a useful tool in many practical situations. In this note we point out some subtleties in the…
Focus of this study is to explore some aspects of mathematical foundations for using complex manifolds as a model for space-time. More specifically, certain equations of motions have been derived as a Projective geodesic on a real manifold…
A modified Gauss's algorithm for solving a system of linear equations in an integral ring is proposed, as well as an appropriate algorithm for calculating the elements of the adjoint matrix.
Visual insights into a wide variety of statistical methods, for both didactic and data analytic purposes, can often be achieved through geometric diagrams and geometrically based statistical graphs. This paper extols and illustrates the…
It is a collection of problems and exercises of geodesy and the theory of errors.
A short review will be made of elliptic integrals, widely applied in GPS (Global Positioning System) communications (accounting for General Relativity Theory-effects), cosmology, Black hole physics and celestial mechanics. Then a novel…
Geometric integration theory can be employed when numerically solving ODEs or PDEs with constraints. In this paper, we present several one-step algorithms of various orders for ODEs on a collection of spheres. To demonstrate the versatility…
We solve the geodesic deviation equations for the orbital motions in the Schwarzschild metric which are close to a circular orbit. It turns out that in this particular case the equations reduce to a linear system, which after…
Results of number of geometric operations (often used in technical practise, as e.g. the operation of blending) are in many cases surfaces described implicitly. Then it is a challenging task to recognize the type of the obtained surface,…
In this paper we develop a geometric approach to convex subdifferential calculus in finite dimensions with employing some ideas of modern variational analysis. This approach allows us to obtain natural and rather easy proofs of basic…
We determine explicit formulas for geodesics (in the Euclidean metric) in the configuration space of ordered pairs (x,x') of points in R^n which satisfy d(x,x')>=epsilon. We interpret this as two or three (depending on the parity of n)…
We introduce a novel representation and optimization framework for discrete geodesics on triangle meshes that reduces artifacts of linear methods on uneven and coarse discretizations. Our method computes squared geodesic distances from…
Some iterative techniques are defined to solve reversible inverse problems and a common formulation is explained. Numerical improvements are suggested and tests validate the methods.
The geometric concept of geodesic completeness depends on the choice of the metric field or "metric frame". We develop a frame-invariant concept of "generalised geodesic completeness" or "time completeness". It is based on the notion of…
Let $f \colon \mathcal{M} \to \mathbb{R}$ be a Lipschitz and geodesically convex function defined on a $d$-dimensional Riemannian manifold $\mathcal{M}$. Does there exist a first-order deterministic algorithm which (a) uses at most…
In this work we study the general system of geodesic equations for the case of a massive particle moving on an arbitrary curved manifold. The investigation is carried out from the symmetry perspective. By exploiting the parametrization…
Circular and radial geodesics are studied in the spacetime described by the $\gamma$ metric. Their behaviour is compared with the spherically symmetric situation, bringing out the sensitivity of the trajectories to deviations from spherical…
We demonstrate a new approach to the computation of ratios of elliptic integrals. It turns out that almost closed polygons interscribed between two conics retain some of the properties of such closed polygons. We apply these retained…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…