Related papers: Counting points with Riemann-Roch formulas
We present a simple, accurate method for computing singular or nearly singular integrals on a smooth, closed surface, such as layer potentials for harmonic functions evaluated at points on or near the surface. The integral is computed with…
In this paper, we introduce a general framework for analyzing the numerical conditioning of minimal problems in multiple view geometry, using tools from computational algebra and Riemannian geometry. Special motivation comes from the fact…
We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…
We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…
This article is the third and last of a series presenting an alternative method to compute the one-loop scalar integrals. It extends the results of first two articles to the infrared divergent case. This novel method enjoys a couple of…
We study the geodesic motion planning problem for complete Riemannian manifolds and investigate their geodesic complexity, an integer-valued isometry invariant introduced by D. Recio-Mitter. Using methods from Riemannian geometry, we…
A three-point iterative method for solving scalar non-linear equations was selected and then adapted to solve systems of non-linear equations. Subsequently, by applying Taylor's theorem to functions of $\R^{n}$ in $\R^{n}$, it is shown that…
We study the Heilbronn triangle problem, which involves placing n points in the unit square such that the minimum area of any triangle formed by these points is maximized. A straightforward maximin formulation of this problem is highly…
We study spherically symmetric spacetimes for matter distributions with isotropic pressures. We generate new exact solutions to the Einstein field equations which also contains isotropic pressures. We develop an algorithm that produces a…
We study inverse boundary problems for semilinear Schr\"odinger equations on smooth compact Riemannian manifolds of dimensions $\ge 2$ with smooth boundary, at a large fixed frequency. We show that certain classes of cubic nonlinearities…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
We present a new method for visualizing implicit real algebraic curves inside a bounding box in the $2$-D or $3$-D ambient space based on numerical continuation and critical point methods. The underlying techniques work also for tracing…
We present a simple yet rigorous theory of integration that is based on two axioms rather than on a construction involving Riemann sums. With several examples we demonstrate how to set up integrals in applications of calculus without using…
In 2015, G.~Mikhalkin introduced a refined count for real rational curves in toric surfaces. The counted curves have to pass through some real and complex points located on the toric boundary of the surface, and the count is refined…
Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…
Herein, we study an inverse problem for detecting unknown obstacles by the enclosure method using the Dirichlet--to--Neumann map for measurements. We justify the method for an penetrable obstacle case involving a biharmonic equation. We use…
We introduce a numerical variational method based on the Rayleigh-Ritz optimization principle for predicting two-dimensional self-trapped beams in nonlinear media. This technique overcomes the limitation of the traditional variational…
We establish upper and lower bounds for the number of integral points which lie within a neighbourhood of a smooth nondegenerate curve in $\mathbb{R}^n$ for $n\geq 3$. These estimates are new for $n\geq 4$, and we recover an earlier result…
Interior-point methods for linear programming problems require the repeated solution of a linear system of equations. Solving these linear systems is non-trivial due to the severe ill-conditioning of the matrices towards convergence. This…
A Riemannian gradient descent algorithm and a truncated variant are presented to solve systems of phaseless equations $|Ax|^2=y$. The algorithms are developed by exploiting the inherent low rank structure of the problem based on the…