Related papers: Kolmogorov variation: KAM with knobs (\`a la Kolmo…
This research introduces a new method for the transition from partial to ordinary differential equations that is based on the Kolmogorov superposition theorem. In this paper, we discuss the numerical implementation of the Kolmogorov theorem…
In this paper, we investigate the Hermite spectral method (HSM) to numerically solve the forward Kolmogorov equation (FKE). A useful guideline of choosing the scaling factor of the generalized Hermite functions is given in this paper. It…
Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. The…
We consider the standard family of area-preserving twist maps of the annulus and the corresponding KAM curves. Addressing a question raised by Kolmogorov, we show that, instead of viewing these invariant curves as separate objects, each of…
We review a formulation of a renormalization-group scheme for Hamiltonian systems with two degrees of freedom. We discuss the renormalization flow on the basis of the continued fraction expansion of the frequency. The goal of this approach…
In this work, we introduce an a posteriori error indicator for the reduced basis modelling of turbulent flows. It is based upon the $k^{-5/3}$ Kolmogorov turbulence theory, thus it may be applied to any numerical discretisation of LES…
We develop an a-posteriori KAM theory for the equilibrium equations for quasi-periodic solutions in a quasi-periodic Frenkel-Kontorova model when the frequency of the solutions resonates with the frequencies of the substratum. The KAM…
In this paper we introduce a numerical scheme which preserves the long time behavior of solutions to the Kolmogorov equation. The method presented is based on a self-similar change of variables technique to transform the Kolmogorov equation…
Combinig the harmonic balance method (HBM) and a continuation method is a well-known technique to follow the periodic solutions of dynamical systems when a control parameter is varied. However, since deriving the algebraic system containing…
We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a quartic speedup while using exponentially smaller space than the fastest classical…
We prove the existence of quasi-periodic, small amplitude, solutions for quasi-linear and fully nonlinear forced perturbations of KdV equations. For Hamiltonian or reversible nonlinearities we also obtain the linear stability of the…
The solution of option-pricing problems may turn out to be computationally demanding due to non-linear and path-dependent payoffs, the high dimensionality arising from multiple underlying assets, and sophisticated models of price dynamics.…
Coalgebraic bisimilarity minimization generalizes classical automaton minimization to a large class of automata whose transition structure is specified by a functor, subsuming strong, weighted, and probabilistic bisimilarity. This offers…
In this paper, we propose a quantum amplitude estimation method that uses a modified Grover operator and quadratically improves the estimation accuracy in the ideal case, as in the conventional one using the standard Grover operator. Under…
The extended modification of the Newton method is considered when the inverse of the derivative (of the operator F(x) in the equation F(x)=0) is replaced by an invertible bounded x-independent operator B. The continuity assumption is…
We present a new algorithm, FRiM (FRactal Iterative Method), aiming at the reconstruction of the optical wavefront from measurements provided by a wavefront sensor. As our application is adaptive optics on extremely large telescopes, our…
In this paper the problem of recovering a regularized solution of the Fredholm integral equations of the first kind with Hermitian and square-integrable kernels, and with data corrupted by additive noise, is considered. Instead of using a…
In this paper, we consider a quantum algorithm for solving the following problem: ``Suppose $f$ is a function given as a black box (that is also called an oracle) and $f$ is invariant under some AND-mask. Examine a property of $f$ by…
We adapt Bar-Natan's scanning algorithm for fast computations in (even) Khovanov homology to odd Khovanov homology. We use a mapping cone construction instead of a tensor product, which allows us to deal efficiently with the more…
Deterministic global optimization of nonlinear models is important in many scientific and engineering applications. This framework typically involves repeatedly solving convex relaxations of the nonconvex problem, meaning that the strength…