Related papers: Computing the Invariant Circle and its Stable Mani…

This paper develops a computational method for studying stable/unstable manifolds attached to periodic orbits of differential equations. The method uses high order Chebyshev-Taylor series approximations in conjunction with the…

In this paper we study high order expansions of chart maps for local finite dimensional unstable manifolds of hyperbolic equilibrium solutions of scalar parabolic partial differential equations. Our approach is based on studying an…

We derive necessary and sufficient conditions for all global symmetries of the most general two Higgs doublet model (2HDM) scalar potential entirely in terms of reparametrization independent, i.e. basis invariant, objects. This culminates…

This paper focuses on investigating an inexact stochastic model-based optimization algorithm that integrates preconditioning techniques for solving stochastic composite optimization problems. The proposed framework unifies and extends the…

Interventional C-arm systems allow flexible 2-D imaging of a 3-D scene while being capable of cone beam computed tomography. Due to the flexible structure of the C-arm, the rotation speed is limited, increasing the acquisition time compared…

In Hamiltonian systems subjected to periodic perturbations the stable and unstable manifolds of the unstable periodic orbits provide the dynamical "skeleton" that drives the mixing process and bounds the chaotic regions of the phase space.…

If a differential equation in a Banach manifold is invariant or quasi-invariant under the action of one or more Lie groups, then its stationary points cannot be isolated, so that classical linearized stability theorem does not apply to it.…

Several works have shown unconditional hardness (via integrality gaps) of computing equilibria using strong hierarchies of convex relaxations. Such results however only apply to the problem of computing equilibria that optimize a certain…

For two-parameter families of dissipative twist maps, we investigate the dynamics of invariant graphs as well as the thresholds for their existence and breakdown. Our main results are as follows: (1) For arbitrarily small $C^r$…

We consider nonlinear inverse problems described by operator equations in Banach spaces. Assuming conditional stability of the inverse problem, that is, assuming that stability holds on a closed, convex subset of the domain of the operator,…

We study how to construct explicit deformations of generic smooth maps from closed $n$--dimensional manifolds $M$ with $n \geq 2$ to the $2$--sphere $S^2$ and show that every smooth map $M \to S^2$ is homotopic to a $C^\infty$ stable map…

In many applications data are measured or defined on a spherical manifold; spherical harmonic transforms are then required to access the frequency content of the data. We derive algorithms to perform forward and inverse spin spherical…

In this article we provide a proof of the so called absolute continuity theorem for random dynamical systems on $R^d$ which have an invariant probability measure. First we present the construction of local stable manifolds in this case.…

Many large-scale and distributed optimization problems can be brought into a composite form in which the objective function is given by the sum of a smooth term and a nonsmooth regularizer. Such problems can be solved via a proximal…

We introduce an integral representation of the Monge-Amp\`ere equation, which leads to a new finite difference method based upon numerical quadrature. The resulting scheme is monotone and fits immediately into existing convergence proofs…

We study the problem of finding the global Riemannian center of mass of a set of data points on a Riemannian manifold. Specifically, we investigate the convergence of constant step-size gradient descent algorithms for solving this problem.…

We propose a simple and effective method to estimate the uncertainty of closed-source deep neural network image classification models. Given a base image, our method creates multiple transformed versions and uses them to query the top-1…

In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…

This paper describes a 2-D graphics algorithm that uses shifts and adds to precisely plot a series of points on an ellipse of any shape and orientation. The algorithm can also plot an elliptic arc that starts and ends at arbitrary angles.…

The vertex cover problem is a fundamental and widely studied combinatorial optimization problem. It is known that its standard linear programming relaxation is integral for bipartite graphs and half-integral for general graphs. As a…