Related papers: Algorithms for geodesics
Equations of geodesic deviation for the 3-dimensional and 4-dimensional Riemann spaces are discussed. Availability of wide classes of exact solutions of such equations, due to recent results for the matrix Schr\"odinger equation, is…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for…
We give an algorithm for determining the distance between two vertices of the complex of curves. While there already exist such algorithms, for example by Leasure, Shackleton, and Webb, our approach is new, simple, and more effective for…
Convex optimization is a vibrant and successful area due to the existence of a variety of efficient algorithms that leverage the rich structure provided by convexity. Convexity of a smooth set or a function in a Euclidean space is defined…
This paper is a review on recently found connection between geodesically equivalent metrics and integrable geodesic flows. Suppose two different metrics on one manifold have the same geodesics. We show that then the geodesic flows of these…
It is argued that, for motion in a central force field, polar reciprocals of trajectories are an elegant alternative to hodographs. The principal advantage of polar reciprocals is that the transformation from a trajectory to its polar…
We compute the length of geodesics on a Riemannian manifold by regular polynomial interpolation of the global solution of the eikonal equation related to the line element $ds^2=g_{ij}dx^idx^j$ of the manifold. Our algorithm approximates the…
We deliver a call to arms for probabilistic numerical methods: algorithms for numerical tasks, including linear algebra, integration, optimization and solving differential equations, that return uncertainties in their calculations. Such…
We show that the motion on the n-dimensional ellipsoid is complete integrable by exhibiting n integrals in involution. The system is separable at classical and quantum level, the separation of classical variables being realized by the…
The aim of this paper is to extend the definition of geodesics to conical manifolds, defined as submanifolds of $\R^n$ with a finite number of singularities. We look for an approach suitable both for the local geodesic problem and for the…
A geodesic orbit manifold is a complete Riemannian manifold all of whose geodesics are orbits of one-parameter groups of isometries. We give both a geometric and an algebraic characterization of geodesic orbit manifolds that are…
New perspective form of equations for geodesic lines in Riemann Geometry was found. This method is based on the use of differential forms in differential equations as arguments of differentiation. At that, these forms do not have a…
We study computing geometric problems on uncertain points. An uncertain point is a point that does not have a fixed location, but rather is described by a probability distribution. When these probability distributions are restricted to a…
We overview a series of recent works addressing numerical simulations of partial differential equations in the presence of some elements of randomness. The specific equations manipulated are linear elliptic, and arise in the context of…
We propose a simple method of explicit description of families of closed geodesics on a triaxial ellipsoid $Q$ that are cut out by algebraic surfaces in ${\mathbb R}^3$. Such geodesics are either connected components of spatial elliptic…
We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based…
This paper is a survey of computational issues in algebraic geometry, with particular attention to the theory of Grobner bases and the regularity of an algebraic variety. 1. A geometric introduction to Grobner bases. 2. An algebraic…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
The geometry of rotations in dimensions 3, 4, and 5 is discussed using the matrix exponential map. Explicit closed formulas for the exponential of an antisymmetric matrix, as well as the logarithm of a rotation, are given for these…