Related papers: Direct transformation from Cartesian into geodetic…
Advanced embedded algorithms are growing in complexity and they are an essential contributor to the growth of autonomy in many areas. However, the promise held by these algorithms cannot be kept without proper attention to the considerably…
Relativistic radiative transfer problems require the calculation of photon trajectories in curved spacetime. We present a novel technique for rapid and accurate calculation of null geodesics in the Kerr metric. The equations of motion from…
We present and analyze a discontinuous Galerkin method for the numerical solution of a class of second-order linear mixed-type partial differential equations, i.e. equations that change their nature from elliptic to hyperbolic through the…
I apply the algebraic framework developed in arXiv:1101.4542 to study geometry of elliptic spaces in 1, 2, and 3 dimensions. The background material on projectivised Clifford algebras and their application to Cayley-Klein geometries is…
We present a fast Gauss transform in one dimension using nearly optimal sum-of-exponentials approximations of the Gaussian kernel. For up to about ten-digit accuracy, the approximations are obtained via best rational approximations of the…
We propose a conservative algorithm to test the geometrical validity of simplicial (triangles, tetrahedra), tensor product (quadrilaterals, hexahedra), and mixed (prisms) elements of arbitrary polynomial order as they deform over a…
This paper presents a method for improved analysis of objects with an axial symmetry using X-ray Computed Tomography (CT). Cylindrical coordinates about an axis fixed to the object form the most natural base to check certain characteristics…
In this thesis, I present three projects I carried out during m PhD. In the first project, I introduce Conformal Transformations and the Galaxy Number County. I explicitly show that the Galaxy Number Counts is invariant under Conformal…
A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…
We consider geodesically convex optimization problems involving distances to a finite set of points $A$ in a CAT(0) cubical complex. Examples include the minimum enclosing ball problem, the weighted mean and median problems, and the…
Gaussian quadrature rules are a classical tool for the numerical approximation of integrals with smooth integrands and positive weight functions. We derive and expicitly list asymptotic expressions for the points and weights of Gaussian…
The Gromov-Wasserstein distance is a notable extension of optimal transport. In contrast to the classic Wasserstein distance, it solves a quadratic assignment problem that minimizes the pair-wise distance distortion under the transportation…
We design an algorithm to compute the Newton polytope of the resultant, known as resultant polytope, or its orthogonal projection along a given direction. The resultant is fundamental in algebraic elimination, optimization, and geometric…
An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…
I present a software tool for solving the astrometry of astronomical images. The code puts emphasis on robustness against failures for correctly matching the sources in the image to a reference catalog, and on the stability of the solutions…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
We present a probabilistic Las Vegas algorithm for computing the local zeta function of a genus-$g$ hyperelliptic curve defined over $\mathbb F_q$ with explicit real multiplication (RM) by an order $\Z[\eta]$ in a degree-$g$ totally real…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
We present a new technique for the numerical simulation of axisymmetric systems. This technique avoids the coordinate singularities which often arise when cylindrical or polar-spherical coordinate finite difference grids are used,…
The normalized eight-point algorithm has been widely viewed as the cornerstone in two-view geometry computation, where the seminal Hartley's normalization has greatly improved the performance of the direct linear transformation algorithm. A…