Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-14T18:22:49.188Z Has data issue: false hasContentIssue false
  • English
  • Français

Numerically Optimized Markovian Coupling and Mixing in One-Dimensional Maps

Part of: Markov processes

Published online by Cambridge University Press:  21 December 2009

Kalvis M. Jansons  and
Paul D. Metcalfe
Kalvis M. Jansons
Affiliation:
Department of Mathematics, University College London, Gower Street, LondonWC1E 6BT. E-mail: coupling@kalvis.com
Paul D. Metcalfe
Affiliation:
Cyprotex Discovery Ltd., 15 Beech Lane, Macclesfield SK10 2DR.
Get access

Abstract

Algorithms are introduced that produce optimal Markovian couplings for large finite-state-space discrete-time Markov chains with sparse transition matrices; these algorithms are applied to some toy models motivated by fluid-dynamical mixing problems at high Peclét number. An alternative definition of the time-scale of a mixing process is suggested. Finally, these algorithms are applied to the problem of coupling diffusion processes in an acute-angled triangle, and some of the simplifications that occur in continuum coupling problems are discussed.

MSC classification

Secondary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces) 60J22: Computational methods in Markov chains
Type
Research Article
Information
Mathematika , Volume 54 , Issue 1-2 , December 2007 , pp. 161 - 181
Copyright
Copyright © University College London 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1Burdzy, K. and Chen, Z.-Q., Coalescence of synchronous couplings. Probab. Theory Related Fields 123 (2002), 553–578.CrossRefGoogle Scholar
2Burdzy, K. and Kendall, W. S., Efficient Markovian couplings: examples and counterexamples. Ann. Appl. Probab. 10 (2000), 362–409.CrossRefGoogle Scholar
3Chvatal, V., Linear Programming. Freeman (New York, 1983).Google Scholar
4Diaconis, P., The cutoff phenomenon in finite Markov chains. Proc. Nat. Acad. Sci. U.S.A. 93 (1996), 1659–1664.CrossRefGoogle ScholarPubMed
5Durrett, R., Probability: Theory and Examples (2nd edition). Duxbury Press (Belmont, CA, 1996).Google Scholar
6Falkovich, G., Gawędzki, K. and Vergassola, M., Particles and fields in fluid turbulence. Rev. Modern Phys. 73 (2001), 913–975.CrossRefGoogle Scholar
7Jansons, K. M. and Metcalfe, P. D., Optimally coupling the Kolmogorov diffusion, and related optimal control problems. LMS J. Comput. Math. 10 (2007), 1–20.CrossRefGoogle Scholar
8Jbilou, K. and Sadok, H., Analysis of some vector extrapolation methods for solving systems of linear equations. Numer. Math. 70 (1995), 73–89.CrossRefGoogle Scholar
9Lehoucq, R. B., Sorensen, D. C. and Yang, C., Solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods. ARPACK Users' Guide: Software, Environments and Tools, SIAM (Philadelphia, PA, 1998).CrossRefGoogle Scholar
10Mešina, M., Convergence acceleration for the iterative solution of the equations X = AX + f. Comput. Methods Appl. Mech. Engrg. 10 (1977), 165–173.CrossRefGoogle Scholar
11Saad, Y. and Schultz, M. H., GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7 (1986), 856–869.CrossRefGoogle Scholar
12Trefethen, L. N., Pseudospectra of linear operators. SIAM Rev. 39 (1997), 383–406.CrossRefGoogle Scholar