Stability of mixing and rapid mixing for hyperbolic flows
نویسندگان
چکیده
منابع مشابه
Stability of mixing and rapid mixing for hyperbolic flows
We obtain general results on the stability of mixing and rapid mixing (superpolynomial decay of correlations) for hyperbolic flows. Amongst Cr Axiom A flows, r ≥ 2, we show that there is a C2-open, Cr-dense set of flows for which each nontrivial hyperbolic basic set is rapid mixing. This is the first general result on the stability of rapid mixing (or even mixing) for Axiom A flows that holds i...
متن کاملExponential Mixing for Smooth Hyperbolic Suspension Flows
We present some simple examples of exponentially mixing hyperbolic suspension flows. We include some speculations indicating possible applications to suspension flows of algebraic Anosov systems. We conclude with some remarks about generalizations of our methods.
متن کاملsimulation and experimental studies for prediction mineral scale formation in oil field during mixing of injection and formation water
abstract: mineral scaling in oil and gas production equipment is one of the most important problem that occurs while water injection and it has been recognized to be a major operational problem. the incompatibility between injected and formation waters may result in inorganic scale precipitation in the equipment and reservoir and then reduction of oil production rate and water injection rate. ...
Mixing and Un-mixing by Incompressible Flows
We consider the questions of efficient mixing and un-mixing by incompressible flows which satisfy periodic, no-flow, or no-slip boundary conditions on a square. Under the uniform-in-time constraint ‖∇u(·, t)‖p ≤ 1 we show that any function can be mixed to scale ε in time O(| log ε|1+νp), with νp = 0 for p < 3+ √ 5 2 and νp ≤ 13 for p ≥ 3+ √ 5 2 . Known lower bounds show that this rate is optima...
متن کاملRapid Mixing
In the past decade many proofs of tractability have involved showing that some Markov chain ”mixes rapidly”. We will do a fast tour of the highlights of Markov chain mixing, with a view toward answering—or at least addressing—the following questions: What is rapid mixing? How do you prove it, and why would you want to? Does it really have anything to do with computational complexity? And, most ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics
سال: 2007
ISSN: 0003-486X
DOI: 10.4007/annals.2007.166.269