اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدVariational approach to coarse-graining of generalized gradient flows
116
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we present a variational technique that handles coarse-graining and passing to a limit in a unified manner. The technique is based on a duality structure, which is present in many gradient flows and other variational evolutions, and which often arises from a large-deviations principle. It has three main features: (A) a natural interaction between the duality structure and the coarse-graining, (B) application to systems with non-dissipative effects, and (C) application to coarse-graining of approximate solutions which solve the equation only to some error. As examples, we use this technique to solve three limit problems, the overdamped limit of the Vlasov-Fokker-Planck equation and the small-noise limit of randomly perturbed Hamiltonian systems with one and with many degrees of freedom.
قيم البحث
اقرأ أيضاً
We have created a functional framework for a class of non-metric gradient systems. The state space is a space of nonnegative measures, and the class of systems includes the Forward Kolmogorov equations for the laws of Markov jump processes on Polish
spaces. This framework comprises a definition of a notion of solutions, a method to prove existence, and an archetype uniqueness result. We do this by using only the structure that is provided directly by the dissipation functional, which need not be homogeneous, and we do not appeal to any metric structure.
This paper presents a variational approach to doubly-nonlinear (gradient) flows (P) of nonconvex energies along with nonpotential perturbations (i.e., perturbation terms without any potential structures). An elliptic-in-time regularization of the ori
ginal equation ${rm (P)}_varepsilon$ is introduced, and then, a variational approach and a fixed-point argument are employed to prove existence of strong solutions to regularized equations. More precisely, we introduce a functional (defined for each entire trajectory and including a small approximation parameter $varepsilon$) whose Euler-Lagrange equation corresponds to the elliptic-in-time regularization of an unperturbed (i.e. without nonpotential perturbations) doubly-nonlinear flow. Secondly, due to the presence of nonpotential perturbation, a fixed-point argument is performed to construct strong solutions $u_varepsilon$ to the elliptic-in-time regularized equations ${rm (P)}_varepsilon$. Here, the minimization problem mentioned above defines an operator $S$ whose fixed point corresponds to a solution $u_varepsilon$ of ${rm (P)}_varepsilon$. Finally, a strong solution to the original equation (P) is obtained by passing to the limit of $u_varepsilon$ as $varepsilon to 0$. Applications of the abstract theory developed in the present paper to concrete PDEs are also exhibited.
We propose and illustrate an approach to coarse-graining the dynamics of evolving networks (networks whose connectivity changes dynamically). The approach is based on the equation-free framework: short bursts of detailed network evolution simulations
are coupled with lifting and restriction operators that translate between actual network realizations and their (appropriately chosen) coarse observables. This framework is used here to accelerate temporal simulations (through coarse projective integration), and to implement coarsegrained fixed point algorithms (through matrix-free Newton-Krylov GMRES). The approach is illustrated through a simple network evolution example, for which analytical approximations to the coarse-grained dynamics can be independently obtained, so as to validate the computational results. The scope and applicability of the approach, as well as the issue of selection of good coarse observables are discussed.
We propose a variational form of the BDF2 method as an alternative to the commonly used minimizing movement scheme for the time-discrete approximation of gradient flows in abstract metric spaces. Assuming uniform semi-convexity --- but no smoothness
--- of the augmented energy functional, we prove well-posedness of the method and convergence of the discrete approximations to a curve of steepest descent. In a smooth Hilbertian setting, classical theory would predict a convergence order of two in time, we prove convergence order of one-half in the general metric setting and under our weak hypotheses. Further, we illustrate these results with numerical experiments for gradient flows on a compact Riemannian manifold, in a Hilbert space, and in the $L^2$-Wasserstein metric.
This work is concerned with model reduction of stochastic differential equations and builds on the idea of replacing drift and noise coefficients of preselected relevant, e.g. slow variables by their conditional expectations. We extend recent results
by Legoll & Leli`evre [Nonlinearity 23, 2131, 2010] and Duong et al. [Nonlinearity 31, 4517, 2018] on effective reversible dynamics by conditional expectations to the setting of general non-reversible processes with non-constant diffusion coefficient. We prove relative entropy and Wasserstein error estimates for the difference between the time marginals of the effective and original dynamics as well as an entropy error bound for the corresponding path space measures. A comparison with the averaging principle for systems with time-scale separation reveals that, unlike in the reversible setting, the effective dynamics for a non-reversible system need not agree with the averaged equations. We present a thorough comparison for the Ornstein-Uhlenbeck process and make a conjecture about necessary and sufficient conditions for when averaged and effective dynamics agree for nonlinear non-reversible processes. The theoretical results are illustrated with suitable numerical examples.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
