相关论文: An algorithmic approach to the multiple impact of …

Iterative algorithms aimed at solving some problems are discussed. For certain problems, such as finding a common point in the intersection of a finite number of convex sets, there often exist iterative algorithms that impose very little…

We describe a newly developed hydrodynamic code for studying accretion disk processes. The numerical method uses a finite volume, nonlinear, Total Variation Diminishing (TVD) scheme to capture shocks and control spurious oscillations. It is…

Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…

It is well known that conventional simulation algorithms are inefficient for the statistical description of macroscopic systems exactly at the critical point due to the divergence of the corresponding relaxation time (critical slowing…

We study the classical problem of prediction with expert advice in the adversarial setting with a geometric stopping time. In 1965, Cover gave the optimal algorithm for the case of 2 experts. In this paper, we design the optimal algorithm,…

Many signal processing problems can be solved by maximizing the fitness of a segmented model over all possible partitions of the data interval. This letter describes a simple but powerful algorithm that searches the exponentially large…

The central object of this PhD thesis is known under different names in the fields of computer science and statistical mechanics. In computer science, it is called the Maximum Cut problem, one of the famous twenty-one Karp's original…

This paper presents a hierarchical planning algorithm for racing with multiple opponents. The two-stage approach consists of a high-level behavioral planning step and a low-level optimization step. By combining discrete and continuous…

Generating intelligent robot behavior in contact-rich settings is a research problem where zeroth-order methods currently prevail. A major contributor to the success of such methods is their robustness in the face of non-smooth and…

Generalizable manipulation requires that robots be able to interact with novel objects and environment. This requirement makes manipulation extremely challenging as a robot has to reason about complex frictional interaction with uncertainty…

Finite-precision floating point arithmetic unavoidably introduces rounding errors which are traditionally bounded using a worst-case analysis. However, worst-case analysis might be overly conservative because worst-case errors can be…

We turn the long time puzzle of the free volume, known for its highly irregular form, into exact analytical formulae and develop statistical mechanics of the hard disk model. The free volume is exactly expressed in terms of the intersection…

We consider optimization algorithms that are open systems, that is, with external inputs and outputs. Such algorithms arise for instance, when analyzing the effect of noise or disturbance on an algorithm, or when an algorithm is part of…

We present certain mathematical aspects of an information method which was formulated in an attempt to investigate diffusion phenomena. We imagine a regular dynamical hamiltonian systems under the random perturbation of thermal (molecular)…

We study theoretically the effects of dissipation on the performances of a variational quantum algorithm used to approximately solve a combinatorial optimization problem, the Maximum Independent Set, on a platform of neutral atoms. We take…

A modification of the standard Boris algorithm, called filtered Boris algorithm, is proposed for the numerical integration of the equations of motion of charged particles in a strong non-uniform magnetic field in the asymptotic scaling…

This paper proposes an improved quasi-Newton penalty decomposition algorithm for the minimization of continuously differentiable functions, possibly nonconvex, over sparse symmetric sets. The method solves a sequence of penalty subproblems…

In this article we describe a stable partitioned algorithm that overcomes the added mass instability arising in fluid-structure interactions of light rigid bodies and inviscid compressible flow. The new algorithm is stable even for bodies…

We propose a planning and control approach to physics-based manipulation. The key feature of the algorithm is that it can adapt to the accuracy requirements of a task, by slowing down and generating `careful' motion when the task requires…

We develop methods to solve general optimal stopping problems with opportunities to stop that arrive randomly. Such problems occur naturally in applications with market frictions. Pivotal to our approach is that our methods operate on…