Problem reduction, renormalization, and memory

From MaRDI portal
Publication:855016

DOI10.2140/CAMCOS.2006.1.1zbMATH Open1108.82023arXivmath/0503612OpenAlexW2596697493MaRDI QIDQ855016FDOQ855016

Panagiotis Stinis, Alexandre J. Chorin

Publication date: 20 December 2006

Published in: Communications in Applied Mathematics and Computational Science (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/0503612






Cited In (33)






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)