Related papers: An abstract KAM theorem
In this paper, we derive a practical, general framework for creating adaptive iterative (linearization or splitting) algorithms to solve multi-physics problems. This means that, given an iterative method, we derive \textit{a posteriori}…
We scatter a meson off of a scalar kink in quantum field theory, at leading order in perturbation theory. We calculate the full quantum state, at leading order, at all times and also check that the reflection and transmission coefficients…
We consider the problem of solving TAP mean field equations by iteration for Ising model with coupling matrices that are drawn at random from general invariant ensembles. We develop an analysis of iterative algorithms using a dynamical…
A model of laminated wave turbulence is presented. This model consists of two co-existing layers - one with continuous waves' spectra, covered by KAM theory and Kolmogorov-like power spectra, and one with discrete waves' spectra, covered by…
In this paper we consider nonlinear Schrodinger systems with periodic boundary condition in high dimension. We establish an abstract infinite dimensional KAM theorem and apply it to the nonlinear Schrodinger equation systems with real…
We report on progress in algorithms for iterative phase retrieval. The theory of convex optimization is used to develop and to gain insight into counterparts for the nonconvex problem of phase retrieval. We propose a relaxation of averaged…
We use a unified framework to summarize sixteen randomized iterative methods including Kaczmarz method, coordinate descent method, etc. Some new iterative schemes are given as well. Some relationships with \textsc{mg} and \textsc{ddm} are…
We provide a framework for abstract reconstruction problems using the $K$-theory of categories with covering families, which we then apply to reformulate the edge reconstruction conjecture in graph theory. Along the way, we state some…
We document some versions, in real K-theory, of well-known properties of the coarse assembly map in complex K-theory. These results are well-known, but difficult to find in the literature.
The SOM algorithm is very astonishing. On the one hand, it is very simple to write down and to simulate, its practical properties are clear and easy to observe. But, on the other hand, its theoretical properties still remain without proof…
Small random perturbations may have a dramatic impact on the long time evolution of dynamical systems, and large deviation theory is often the right theoretical framework to understand these effects. At the core of the theory lies the…
Relaxation in the time correlation between operators is studied. Quantized chaotic systems are shown to have distinct relaxation fluctuations that are universal and can be usefully modelled by Random Matrix Theory. Various quantized maps…
I investigate a new idea of perturbation theory in covariant canonical quantization. I present preliminary results for a toy model of a harmonic oscillator with a quartic perturbation, and show that this method reproduces the quantized…
We discuss the basic principles of constructing a meaningful perturbative scheme for effective theory. The main goal of this talk is to explain the approach and to present recent results obtained with the help of the method of Cauchy forms…
We suggest that KAM theory could be extended for certain infinite-dimensional systems with purely discrete linear spectrum. We provide empirical arguments for the existence of square summable infinite-dimensional invariant tori in the…
Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…
In this paper we present and illustrate a general methodology to apply KAM theory in particular problems, based on an {\em a posteriori} approach. We focus on the existence of real-analytic quasi-periodic Lagrangian invariant tori for…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
What kinds of motion can occur in classical mechanics? We address this question by looking at the structures traced out by trajectories in phase space; the most orderely, completely integrable systems, are charactrized by phase trajectories…