Related papers: Minimax polynomial ECEF to geodetic coordinate tra…
In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain $\mathcal{P}$ with a total of $n$ vertices. We discover many interesting observations. We give a necessary condition for a point being a…
Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing…
Many interesting functions arising in applications map into Riemannian manifolds. We present an algorithm, using the manifold exponential and logarithm, for approximating such functions. Our approach extends approximation techniques for…
This paper presents a robust 6-DoF localization framework based on a direct, CPU-based scan-to-map registration pipeline. The system leverages G-EDF, a novel continuous and memory-efficient 3D distance field representation. The approach…
Asymptotic approximations to the zeros of Hermite and Laguerre polynomials are given, together with methods for obtaining the coefficients in the expansions. These approximations can be used as a standalone method of computation of Gaussian…
We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…
This paper is concerned with the numerical minimization of energy functionals in Hilbert spaces involving convex constraints coinciding with a semi-norm for a subspace. The optimization is realized by alternating minimizations of the…
We give a deterministic algorithm for approximately counting satisfying assignments of a degree-$d$ polynomial threshold function (PTF). Given a degree-$d$ input polynomial $p(x_1,\dots,x_n)$ over $R^n$ and a parameter $\epsilon> 0$, our…
This paper presents a novel method for generating a single polynomial approximation that produces correctly rounded results for all inputs of an elementary function for multiple representations. The generated polynomial approximation has…
For a function $f$, continuous on a compact convex set $K$ and analytic in its interior we construct a sequence of almost optimal polynomials that converge with a geometric rate at points of analyticity of $f$.
In this paper we study 1/k geodesics, those closed geodesics that minimize on all subintervals of length $L/k$, where $L$ is the length of the geodesic. We develop new techniques to study the minimizing properties of these curves on doubled…
Many algorithms for finding reaction pathways require an initial estimate of the minimum energy path (MEP). Most estimation methods use a variational approach and thus must be seeded from an even simpler path, such as one generated by…
The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a…
Recent work has shown the surprising power of low-degree sandwiching polynomial approximators in the context of challenging learning settings such as learning with distribution shift, testable learning, and learning with contamination. A…
Edge-Geodetic Sets play a crucial role in network monitoring and optimization, wherein the goal is to strategically place monitoring stations on vertices of a network, represented as a graph, to ensure complete coverage of edges and…
We formulate and analyze a goal-oriented adaptive finite element method (GOAFEM) for a semilinear elliptic PDE and a linear goal functional. The strategy involves the finite element solution of a linearized dual problem, where the…
The FC-Gram trigonometric polynomial approximation of a non-periodic function that interpolates the function on equispaced grids was introduced in 2010 by Bruno and Lyon [J. Comput. Phys, 229(6):2009-2033, 2010]. Since then, the…
The stability and approximation properties of transfer functions of generalized Bessel polynomials (GBP) are investigated. Sufficient conditions are established for the GBP to be Hurwitz. It is shown that the Pad\'e approximants of $e^{-s}$…
Quantum error correction is a critical component for scaling up quantum computing. Given a quantum code, an optimal decoder maps the measured code violations to the most likely error that occurred, but its cost scales exponentially with 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…