Global optimisation of the mean first passage time for narrow capture problems in elliptic domains
From MaRDI portal
Publication:6622974
DOI10.1017/S0956792522000341MaRDI QIDQ6622974
Alexei F. Cheviakov, Jason Gilbert
Publication date: 23 October 2024
Published in: European Journal of Applied Mathematics (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Other physical applications of random processes (60K40)
Cites Work
- Optimizing the principal eigenvalue of the Laplacian in a sphere with interior traps
- Minimal-energy clusters of hard spheres
- Asymptotic analysis of first passage time problems inspired by ecology
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- A particle swarm pattern search method for bound constrained global optimization
- Escape through a small opening: receptor trafficking in a synaptic membrane
- A guide to first-passage processes
- An asymptotic analysis of the mean first passage time for narrow escape problems. II: The sphere
- Diffusion of Protein Receptors on a Cylindrical Dendritic Membrane with Partially Absorbing Traps
- Two algorithms for constructing a Delaunay triangulation
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Optimization of the Mean First Passage Time in Near-Disk and Elliptical Domains in 2-D with Small Absorbing Traps
- The Narrow Escape Problem
- First-Passage Phenomena and Their Applications
- Optimizing the fundamental Neumann eigenvalue for the Laplacian in a domain with small traps
This page was built for publication: Global optimisation of the mean first passage time for narrow capture problems in elliptic domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622974)