Problem reduction, renormalization, and memory

From MaRDI portal



Abstract: Methods for the reduction of the complexity of computational problems are presented, as well as their connections to renormalization, scaling, and irreversible statistical mechanics. Several statistically stationary cases are analyzed; for time dependent problems averaging usually fails, and averaged equations must be augmented by appropriate memory and random forcing terms. Approximations are described and examples are given.


This paper surveys some recent reduction (or renormalization) methods. After a short introduction to define the problem, one considers Hamiltonian systems and their conditional expectation. Then one restricts the study to statistically stationary Hamiltonian systems which are renormalized by using block Monte Carlo method. The Korteweg-de Vries-Burgers equation is selected as an illustrative detailed example, and then one describes the Mori-Zwanzig formalism. Lastly, the relations, which exist between the fluctuation theorem, short-range memory and long-range memory are explained




Cited in
(39)








This page was built for publication: Problem reduction, renormalization, and memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855016)