arXiv · math/0503612
Problem reduction, renormalization, and memory
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Alexandre J. Chorin, Panagiotis Stinis. 2005-03-26. Problem reduction, renormalization, and memory. https://arxiv.org/abs/math/0503612
Cite the original work for its findings. Save a collection to share your selection of sources.