Problem reduction, renormalization, and memory
Alexandre J. Chorin, Panagiotis Stinis
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.
Create a lesson
Related papers
Model order reduction of HDG discretizations for harmonic wave propagation
Hélène Barucq, Florian Faucher, Ha Pham et al.
eMOOD: Entropy-Based Multidimensional Optimal Order Detection for High-Order Shock-Capturing Finite-Volume Schemes
Michał Umiński, Panagiotis Tsoutsanis, Ahmed A Sheikh Al-Shabab et al.
Emulating the Darcy Solution Operator by Heat-Semigroup Functional Calculus and Pointwise Products
Dawid Hanrahan
Spherical Perfectly Matched Layer Method for Electromagnetic Scattering Problems with Large Wave Number
Jian Shi, Yonglin Li, Haijun Wu
Second-Order Flows for Approaching Stationary Points via the SAV-E Approach
Haifan Chen, Wei Liu, Ziqing Xie et al.
Stability of the P2 semi-Lagrangian scheme
Roberto Ferretti, Michel Mehrenberger