Related papers: Geodesic equations and their numerical solution in…
We propose a new iterative scheme to compute the numerical solution to an over-determined boundary value problem for a general quasilinear elliptic PDE. The main idea is to repeatedly solve its linearization by using the quasi-reversibility…
Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry processing, scientific computing, computer graphics, and…
Initial orbit determination (IOD) from line-of-sight (i.e., bearing) measurements is a classical problem in astrodynamics. Indeed, there are many well-established methods for performing the IOD task when given three line-of-sight…
An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves the square root of an elliptic operator of second order. Finite element approximation in space is employed.…
Effective estimates for the lattice point discrepancy of certain planar and three-dimensional domains. This paper provides estimates, with explicit constants, for the lattice point discrepancy of o-symmetric ellipse discs and ellipsoids in…
Shape optimization is commonly applied in engineering to optimize shapes with respect to an objective functional relying on PDE solutions. In this paper, we view shape optimization as optimization on Riemannian shape manifolds. We consider…
We describe a generalised method for ellipsoid fitting against a minimum set of data points. The proposed method is numerically stable and applies to a wide range of ellipsoidal shapes, including highly elongated and arbitrarily oriented…
In this article we investigate the existence of a solution to a semilinear, elliptic, partial differential equation with distributional coefficients and data. The problem we consider is a generalization of the Lichnerowicz equation that one…
In an article, E. Grafarend and B. Schaffrin studied the geometry of non-linear adjustment of the planar trisection problem using the Gauss Markov model and the method of the least squares. This paper develops the same method working on an…
We propose a collocation method based on multivariate polynomial splines over triangulation or tetrahedralization for the numerical solution of partial differential equations. We start with a detailed explanation of the method for the…
A new strategy based on numerical homogenization and Bayesian techniques for solving multiscale inverse problems is introduced. We consider a class of elliptic problems which vary at a microscopic scale, and we aim at recovering the highly…
The exact analytic solution is introduced for the rotational motion of a rigid body having three equal principal moments of inertia and subjected to an external torque vector which is constant for an observer fixed with the body, and to…
This is a study of a problem in geodesy with methods from complex algebraic geometry: for a fixed number of measure points and target points at unknown position in the Euclidean plane, we study the problem of determining their relative…
Approximate symmetries of geodesic equations on 2-spheres are studied. These are the symmetries of the perturbed geodesic equations which represent approximate path of a particle rather than exact path. After giving the exact symmetries of…
Solutions of equations of geodesic deviation in three- and four- dimensional spaces obtained by the inverse scattering transform are considered. It is shown that in the case of three-dimensional space solutions of geodesic deviation…
One parameter family of exact solutions in General Relativity with a scalar field has been found using the Liouville metric. The scalar field potential has exponential form. This model is interesting, because, in particular, the solution…
Multi-dimensional distributions of discrete data that resemble ellipsoids arise in numerous areas of science, statistics, and computational geometry. We describe a complete algebraic algorithm to determine the quadratic form specifying the…
Many problems in Euclidean geometry, arising in computational design and fabrication, amount to a system of constraints, which is challenging to solve. We suggest a new general approach to the solution, which is to start with analogous…
A common approach to compute distances on continuous surfaces is by considering a discretized polygonal mesh approximating the surface and estimating distances on the polygon. We show that exact geodesic distances restricted to the polygon…
This paper describes a novel framework for computing geodesic paths in shape spaces of spherical surfaces under an elastic Riemannian metric. The novelty lies in defining this Riemannian metric directly on the quotient (shape) space, rather…