Related papers: The Orbit-Sum Method for Higher Order Equations
In this paper we develop a randomized block-coordinate descent method for minimizing the sum of a smooth and a simple nonsmooth block-separable convex function and prove that it obtains an $\epsilon$-accurate solution with probability at…
In this work we use intersection of different pseudo-orbits obtained by interval extensions to reduce the bounds of the exact solution provided by the toolbox Intlab. The method is applied on the logistic map.
Orbital-free density functional theory as an extension of traditional Thomas-Fermi theory has attracted a lot of interest in the past decade because of developments in both more accurate kinetic energy functionals and highly efficient…
Given the present distribution of mass tracing objects in an expanding universe, we develop and test a fast method for recovering their past orbits using the least action principle. In this method, termed FAM for Fast Action Minimization,…
We propose a numerical method to solve the Monge-Ampere equation which admits a classical convex solution. The Monge-Ampere equation is reformulated into an equivalent first-order system. We adopt a novel reconstructed discontinuous…
We establish a reflection principle for three lattice walkers and use this principle to reduce the enumeration of the configurations of three vicious walkers to that of configurations of two vicious walkers. In the combinatorial treatment…
The distribution for the minimum of Brownian motion or the Cauchy process is well-known using the reflection principle. Here we consider the problem of finding the sample-by-sample minimum, which we call the online minimum search. We…
We present an approach to sums of random Hermitian matrices via the theory of spherical functions for the Gelfand pair $(\mathrm{U}(n) \ltimes \mathrm{Herm}(n), \mathrm{U}(n))$. It is inspired by a similar approach of Kieburg and K\"osters…
We present a simplified solution to orbit determination of a binary system from astrometric observations. An exact solution was found by Asada, Akasaka and Kasai by assuming no observational errors. We extend the solution considering…
The weighted sum method is a simple and widely used technique that scalarizes multiple conflicting objectives into a single objective function. It suffers from the problem of determining the appropriate weights corresponding to the…
We present numerical results and computer assisted proofs of the existence of periodic orbits for the Kuramoto-Sivashinky equation. These two results are based on writing down the existence of periodic orbits as zeros of functionals. This…
In this work, we present the hitherto most efficient and accurate method for the numerical integration of post-Newtonian equations of motion. We first transform the Poisson system as given by the post-Newtonian approximation to canonically…
We describe a method to simulate Hamiltonian evolution on a quantum computer by repeatedly using a superposition of steps of a quantum walk, then applying a correction to the weightings for the numbers of steps of the quantum walk. This…
Harmonic sums and their generalizations are extremely useful in the evaluation of higher-order perturbative corrections in quantum field theory. Of particular interest have been the so-called nested sums,where the harmonic sums and their…
We present a new adaptive method for electronic structure calculations based on novel fast algorithms for reduction of multivariate mixtures. In our calculations, spatial orbitals are maintained as Gaussian mixtures whose terms are selected…
In two recent works \cite{BMM,BK}, it has been shown that the counting generating functions (CGF) for the 23 walks with small steps confined in a quadrant and associated with a finite group of birational transformations are holonomic, and…
We continue the enumeration of plane lattice paths avoiding the negative quadrant initiated by the first author in [Bousquet-M{\'e}lou, 2016]. We solve in detail a new case, the king walks, where all 8 nearest neighbour steps are allowed.…
Multiple-shooting is a parameter estimation approach for ordinary differential equations. In this approach, the trajectory is broken into small intervals, each of which can be integrated independently. Equality constraints are then applied…
In this work, we establish near-linear and strong convergence for a natural first-order iterative algorithm that simulates Von Neumann's Alternating Projections method in zero-sum games. First, we provide a precise analysis of Optimistic…
We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study of the positive…