Manas Rachh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Manas Rachh has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Stefan Steinerberger
University of Washington
6 shared publications - Florian Pausinger
School of Mathematics and Physics , Queen’s University Belfast , Belfast , United Kingdom
2 shared publications - Aleksandar Donev
Courant Institute New York University New York NY US
1 shared publication - Andreas Klöckner
Siebel School of Computing and Data Science University of Illinois at Urbana-Champaign 201 N. Goodwin Ave 61801 Urbana USA
1 shared publication - Eric E. Keaveny
Imperial College London
1 shared publication - George C. Linderman
Yale University
1 shared publication
Latest Publications
- 17 April 2018
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 71 (6) , 1109-1122
On the Location of Maxima of Solutions of Schrödinger's Equation
We prove an inequality with applications to solutions of the Schrödinger equation. There is a universal constant c > 0 such that if is simply connected, vanishes on the boundary ∂Ω, and |u| assumes a maximum in , then urn:x-wiley:00103640:media:cpa21753:cpa21753-math-0004 It was conjectured by Pólya and Szegő (and proven, independently, by Makai and Hayman) that a membrane vibrating at frequency λ contains a disk of size . Our inequality implies a refined result: the point on the membrane that achieves the maximal amplitude is at distance from the boundary. We also give an extension to higher dimensions (generalizing results of Lieb and of Georgiev and Mukherjee): if u solves on with Dirichlet boundary conditions, then the ball B with radius centered at the point in which |u| assumes a maximum is almost fully contained in Ω in the sense that
- 17 April 2018
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 71 (6) , 1109-1122
On the Location of Maxima of Solutions of Schrödinger's Equation
We prove an inequality with applications to solutions of the Schrödinger equation. There is a universal constant c > 0 such that if is simply connected, vanishes on the boundary ∂Ω, and |u| assumes a maximum in , then urn:x-wiley:00103640:media:cpa21753:cpa21753-math-0004 It was conjectured by Pólya and Szegő (and proven, independently, by Makai and Hayman) that a membrane vibrating at frequency λ contains a disk of size . Our inequality implies a refined result: the point on the membrane that achieves the maximal amplitude is at distance from the boundary. We also give an extension to higher dimensions (generalizing results of Lieb and of Georgiev and Mukherjee): if u solves on with Dirichlet boundary conditions, then the ball B with radius centered at the point in which |u| assumes a maximum is almost fully contained in Ω in the sense that
- Open Access
A fluctuating boundary integral method for Brownian suspensions
We present a fluctuating boundary integral method (FBIM) for overdamped Brownian Dynamics (BD) of two-dimensional periodic suspensions of rigid particles of complex shape immersed in a Stokes fluid. We develop a novel approach for generating Brownian displacements that arise in response to the thermal fluctuations in the fluid. Our approach relies on a first-kind boundary integral formulation of a mobility problem in which a random surface velocity is prescribed on the particle surface, with zero mean and covariance proportional to the Green's function for Stokes flow (Stokeslet). This approach yields an algorithm that scales linearly in the number of particles for both deterministic and stochastic dynamics, handles particles of complex shape, achieves high order of accuracy, and can be generalized to three dimensions and other boundary conditions. We show that Brownian displacements generated by our method obey the discrete fluctuation-dissipation balance relation (DFDB). Based on a recently-developed Positively Split Ewald method [A. M. Fiore, F. Balboa Usabiaga, A. Donev and J. W. Swan, J. Chem. Phys., 146, 124116, 2017], near-field contributions to the Brownian displacements are efficiently approximated by iterative methods in real space, while far-field contributions are rapidly generated by fast Fourier-space methods based on fluctuating hydrodynamics. FBIM provides the key ingredient for time integration of the overdamped Langevin equations for Brownian suspensions of rigid particles. We demonstrate that FBIM obeys DFDB by performing equilibrium BD simulations of suspensions of starfish-shaped bodies using a random finite difference temporal integrator.
Open AccessA fluctuating boundary integral method for Brownian suspensions
We present a fluctuating boundary integral method (FBIM) for overdamped Brownian Dynamics (BD) of two-dimensional periodic suspensions of rigid particles of complex shape immersed in a Stokes fluid. We develop a novel approach for generating Brownian displacements that arise in response to the thermal fluctuations in the fluid. Our approach relies on a first-kind boundary integral formulation of a mobility problem in which a random surface velocity is prescribed on the particle surface, with zero mean and covariance proportional to the Green's function for Stokes flow (Stokeslet). This approach yields an algorithm that scales linearly in the number of particles for both deterministic and stochastic dynamics, handles particles of complex shape, achieves high order of accuracy, and can be generalized to three dimensions and other boundary conditions. We show that Brownian displacements generated by our method obey the discrete fluctuation-dissipation balance relation (DFDB). Based on a recently-developed Positively Split Ewald method [A. M. Fiore, F. Balboa Usabiaga, A. Donev and J. W. Swan, J. Chem. Phys., 146, 124116, 2017], near-field contributions to the Brownian displacements are efficiently approximated by iterative methods in real space, while far-field contributions are rapidly generated by fast Fourier-space methods based on fluctuating hydrodynamics. FBIM provides the key ingredient for time integration of the overdamped Langevin equations for Brownian suspensions of rigid particles. We demonstrate that FBIM obeys DFDB by performing equilibrium BD simulations of suspensions of starfish-shaped bodies using a random finite difference temporal integrator.
- 1 January 2018
- Published by Elsevier in Statistics & Probability Letters
- Vol. 132, 55-61
Optimal Jittered Sampling for two points in the unit square
- 1 January 2018
- Published by Elsevier in Statistics & Probability Letters
- Vol. 132, 55-61
Optimal Jittered Sampling for two points in the unit square
- Open Access
Efficient Algorithms for t-distributed Stochastic Neighborhood Embedding
t-distributed Stochastic Neighborhood Embedding (t-SNE) is a method for dimensionality reduction and visualization that has become widely popular in recent years. Efficient implementations of t-SNE are available, but they scale poorly to datasets with hundreds of thousands to millions of high dimensional data-points. We present Fast Fourier Transform-accelerated Interpolation-based t-SNE (FIt-SNE), which dramatically accelerates the computation of t-SNE. The most time-consuming step of t-SNE is a convolution that we accelerate by interpolating onto an equispaced grid and subsequently using the fast Fourier transform to perform the convolution. We also optimize the computation of input similarities in high dimensions using multi-threaded approximate nearest neighbors. We further present a modification to t-SNE called "late exaggeration," which allows for easier identification of clusters in t-SNE embeddings. Finally, for datasets that cannot be loaded into the memory, we present out-of-core randomized principal component analysis (oocPCA), so that the top principal components of a dataset can be computed without ever fully loading the matrix, hence allowing for t-SNE of large datasets to be computed on resource-limited machines.
Open AccessEfficient Algorithms for t-distributed Stochastic Neighborhood Embedding
t-distributed Stochastic Neighborhood Embedding (t-SNE) is a method for dimensionality reduction and visualization that has become widely popular in recent years. Efficient implementations of t-SNE are available, but they scale poorly to datasets with hundreds of thousands to millions of high dimensional data-points. We present Fast Fourier Transform-accelerated Interpolation-based t-SNE (FIt-SNE), which dramatically accelerates the computation of t-SNE. The most time-consuming step of t-SNE is a convolution that we accelerate by interpolating onto an equispaced grid and subsequently using the fast Fourier transform to perform the convolution. We also optimize the computation of input similarities in high dimensions using multi-threaded approximate nearest neighbors. We further present a modification to t-SNE called "late exaggeration," which allows for easier identification of clusters in t-SNE embeddings. Finally, for datasets that cannot be loaded into the memory, we present out-of-core randomized principal component analysis (oocPCA), so that the top principal components of a dataset can be computed without ever fully loading the matrix, hence allowing for t-SNE of large datasets to be computed on resource-limited machines.
- Open Access
On the solution of Stokes equation on regions with corners
In Stokes flow, the stream function associated with the velocity of the fluid satisfies the biharmonic equation. The detailed behavior of solutions to the biharmonic equation on regions with corners has been historically difficult to characterize. The problem was first examined by Lord Rayleigh in 1920; in 1973, the existence of infinite oscillations in the domain Green's function was proven in the case of the right angle by S.~Osher. In this paper, we observe that, when the biharmonic equation is formulated as a boundary integral equation, the solutions are representable by rapidly convergent series of the form $\sum_{j} ( c_{j} t^{\mu_{j}} \sin{(\beta_{j} \log{(t)})} + d_{j} t^{\mu_{j}} \cos{(\beta_{j} \log{(t)})} )$, where $t$ is the distance from the corner and the parameters $\mu_{j},\beta_{j}$ are real, and are determined via an explicit formula depending on the angle at the corner. In addition to being analytically perspicuous, these representations lend themselves to the construction of highly accurate and efficient numerical discretizations, significantly reducing the number of degrees of freedom required for the solution of the corresponding integral equations. The results are illustrated by several numerical examples.Open AccessOn the solution of Stokes equation on regions with corners
In Stokes flow, the stream function associated with the velocity of the fluid satisfies the biharmonic equation. The detailed behavior of solutions to the biharmonic equation on regions with corners has been historically difficult to characterize. The problem was first examined by Lord Rayleigh in 1920; in 1973, the existence of infinite oscillations in the domain Green's function was proven in the case of the right angle by S.~Osher. In this paper, we observe that, when the biharmonic equation is formulated as a boundary integral equation, the solutions are representable by rapidly convergent series of the form $\sum_{j} ( c_{j} t^{\mu_{j}} \sin{(\beta_{j} \log{(t)})} + d_{j} t^{\mu_{j}} \cos{(\beta_{j} \log{(t)})} )$, where $t$ is the distance from the corner and the parameters $\mu_{j},\beta_{j}$ are real, and are determined via an explicit formula depending on the angle at the corner. In addition to being analytically perspicuous, these representations lend themselves to the construction of highly accurate and efficient numerical discretizations, significantly reducing the number of degrees of freedom required for the solution of the corresponding integral equations. The results are illustrated by several numerical examples. - 16 September 2017
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 75 (2) , 762-781
Integral Equation Formulation of the Biharmonic Dirichlet Problem
- 16 September 2017
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 75 (2) , 762-781
Integral Equation Formulation of the Biharmonic Dirichlet Problem
- Open Access
Optimal Jittered Sampling for two Points in the Unit Square
Jittered Sampling is a refinement of the classical Monte Carlo sampling method. Instead of picking $n$ points randomly from $[0,1]^2$, one partitions the unit square into $n$ regions of equal measure and then chooses a point randomly from each partition. Currently, no good rules for how to partition the space are available. In this paper, we present a solution for the special case of subdividing the unit square by a decreasing function into two regions so as to minimize the expected squared $\mathcal{L}_2-$discrepancy. The optimal partitions are given by a \textit{highly} nonlinear integral equation for which we determine an approximate solution. In particular, there is a break of symmetry and the optimal partition is not into two sets of equal measure. We hope this stimulates further interest in the construction of good partitions.Open AccessOptimal Jittered Sampling for two Points in the Unit Square
Jittered Sampling is a refinement of the classical Monte Carlo sampling method. Instead of picking $n$ points randomly from $[0,1]^2$, one partitions the unit square into $n$ regions of equal measure and then chooses a point randomly from each partition. Currently, no good rules for how to partition the space are available. In this paper, we present a solution for the special case of subdividing the unit square by a decreasing function into two regions so as to minimize the expected squared $\mathcal{L}_2-$discrepancy. The optimal partitions are given by a \textit{highly} nonlinear integral equation for which we determine an approximate solution. In particular, there is a break of symmetry and the optimal partition is not into two sets of equal measure. We hope this stimulates further interest in the construction of good partitions. - Open Access
Fast algorithms for Quadrature by Expansion I: Globally valid expansions
The use of integral equation methods for the efficient numerical solution of PDE boundary value problems requires two main tools: quadrature rules for the evaluation of layer potential integral operators with singular kernels, and fast algorithms for solving the resulting dense linear systems. Classically, these tools were developed separately. In this work, we present a unified numerical scheme based on coupling Quadrature by Expansion, a recent quadrature method, to a customized Fast Multipole Method (FMM) for the Helmholtz equation in two dimensions. The method allows the evaluation of layer potentials in linear-time complexity, anywhere in space, with a uniform, user-chosen level of accuracy as a black-box computational method. Providing this capability requires geometric and algorithmic considerations beyond the needs of standard FMMs as well as careful consideration of the accuracy of multipole translations. We illustrate the speed and accuracy of our method with various numerical examples. Keywords: Layer Potentials; Singular Integrals; Quadrature; High-order accuracy; Integral equations; Helmholtz equation; Fast multipole method.
Open AccessFast algorithms for Quadrature by Expansion I: Globally valid expansions
The use of integral equation methods for the efficient numerical solution of PDE boundary value problems requires two main tools: quadrature rules for the evaluation of layer potential integral operators with singular kernels, and fast algorithms for solving the resulting dense linear systems. Classically, these tools were developed separately. In this work, we present a unified numerical scheme based on coupling Quadrature by Expansion, a recent quadrature method, to a customized Fast Multipole Method (FMM) for the Helmholtz equation in two dimensions. The method allows the evaluation of layer potentials in linear-time complexity, anywhere in space, with a uniform, user-chosen level of accuracy as a black-box computational method. Providing this capability requires geometric and algorithmic considerations beyond the needs of standard FMMs as well as careful consideration of the accuracy of multipole translations. We illustrate the speed and accuracy of our method with various numerical examples. Keywords: Layer Potentials; Singular Integrals; Quadrature; High-order accuracy; Integral equations; Helmholtz equation; Fast multipole method.
- Open Access
On the location of maximal of solutions of Schrödinger's equation
We prove an inequality with applications to solutions of the Schr\"odinger equation. There is a universal constant $c>0$, such that if $\Omega \subset \mathbb{R}^2$ is simply connected, $u:\Omega \rightarrow \mathbb{R}$ vanishes on the boundary $\partial \Omega$, and $|u|$ assumes a maximum in $x_0 \in \Omega$, then $$ \inf_{y \in \partial \Omega}{ \| x_0 - y\|} \geq c \left\| \frac{\Delta u}{u} \right\|^{-1/2}_{L^{\infty}(\Omega)}.$$ It was conjectured by P\'olya \& Szeg\H{o} (and proven, independently, by Makai and Hayman) that a membrane vibrating at frequency $\lambda$ contains a disk of size $\sim \lambda^{-1/2}$. Our inequality implies a refined result: the point on the membrane that achieves the maximal amplitude is at distance $\sim \lambda^{-1/2}$ from the boundary. We also give an extension to higher dimensions (generalizing results of Lieb and Georgiev \& Mukherjee): if $u$ solves $-\Delta u = Vu$ on $\Omega \subset \mathbb{R}^n$ with Dirichlet boundary conditions, then the ball $B$ with radius $\sim \|V\|_{L^{\infty}(\Omega)}^{-1/2}$ centered at the point in which $|u|$ assumes a maximum is almost fully contained in $\Omega$ in the sense that $|B \cap \Omega| \geq 0.99 |B|.$Open AccessOn the location of maximal of solutions of Schrödinger's equation
We prove an inequality with applications to solutions of the Schr\"odinger equation. There is a universal constant $c>0$, such that if $\Omega \subset \mathbb{R}^2$ is simply connected, $u:\Omega \rightarrow \mathbb{R}$ vanishes on the boundary $\partial \Omega$, and $|u|$ assumes a maximum in $x_0 \in \Omega$, then $$ \inf_{y \in \partial \Omega}{ \| x_0 - y\|} \geq c \left\| \frac{\Delta u}{u} \right\|^{-1/2}_{L^{\infty}(\Omega)}.$$ It was conjectured by P\'olya \& Szeg\H{o} (and proven, independently, by Makai and Hayman) that a membrane vibrating at frequency $\lambda$ contains a disk of size $\sim \lambda^{-1/2}$. Our inequality implies a refined result: the point on the membrane that achieves the maximal amplitude is at distance $\sim \lambda^{-1/2}$ from the boundary. We also give an extension to higher dimensions (generalizing results of Lieb and Georgiev \& Mukherjee): if $u$ solves $-\Delta u = Vu$ on $\Omega \subset \mathbb{R}^n$ with Dirichlet boundary conditions, then the ball $B$ with radius $\sim \|V\|_{L^{\infty}(\Omega)}^{-1/2}$ centered at the point in which $|u|$ assumes a maximum is almost fully contained in $\Omega$ in the sense that $|B \cap \Omega| \geq 0.99 |B|.$ - Open Access
On the Diffusion Geometry of Graph Laplacians and Applications
We study directed, weighted graphs $G=(V,E)$ and consider the (not necessarily symmetric) averaging operator $$ (\mathcal{L}u)(i) = -\sum_{j \sim_{} i}{p_{ij} (u(j) - u(i))},$$ where $p_{ij}$ are normalized edge weights. Given a vertex $i \in V$, we define the diffusion distance to a set $B \subset V$ as the smallest number of steps $d_{B}(i) \in \mathbb{N}$ required for half of all random walks started in $i$ and moving randomly with respect to the weights $p_{ij}$ to visit $B$ within $d_{B}(i)$ steps. Our main result is that the eigenfunctions interact nicely with this notion of distance. In particular, if $u$ satisfies $\mathcal{L}u = \lambda u$ on $V$ and $$ B = \left\{ i \in V: - \varepsilon \leq u(i) \leq \varepsilon \right\} \neq \emptyset,$$ then, for all $i \in V$, $$ d_{B}(i) \log{\left( \frac{1}{|1-\lambda|} \right) } \geq \log{\left( \frac{ |u(i)| }{\|u\|_{L^{\infty}}} \right)} - \log{\left(\frac{1}{2} + \varepsilon\right)}.$$ $d_B(i)$ is a remarkably good approximation of $|u|$ in the sense of having very high correlation. The result implies that the classical one-dimensional spectral embedding preserves particular aspects of geometry in the presence of clustered data. We also give a continuous variant of the result which has a connection to the hot spots conjecture.Open AccessOn the Diffusion Geometry of Graph Laplacians and Applications
We study directed, weighted graphs $G=(V,E)$ and consider the (not necessarily symmetric) averaging operator $$ (\mathcal{L}u)(i) = -\sum_{j \sim_{} i}{p_{ij} (u(j) - u(i))},$$ where $p_{ij}$ are normalized edge weights. Given a vertex $i \in V$, we define the diffusion distance to a set $B \subset V$ as the smallest number of steps $d_{B}(i) \in \mathbb{N}$ required for half of all random walks started in $i$ and moving randomly with respect to the weights $p_{ij}$ to visit $B$ within $d_{B}(i)$ steps. Our main result is that the eigenfunctions interact nicely with this notion of distance. In particular, if $u$ satisfies $\mathcal{L}u = \lambda u$ on $V$ and $$ B = \left\{ i \in V: - \varepsilon \leq u(i) \leq \varepsilon \right\} \neq \emptyset,$$ then, for all $i \in V$, $$ d_{B}(i) \log{\left( \frac{1}{|1-\lambda|} \right) } \geq \log{\left( \frac{ |u(i)| }{\|u\|_{L^{\infty}}} \right)} - \log{\left(\frac{1}{2} + \varepsilon\right)}.$$ $d_B(i)$ is a remarkably good approximation of $|u|$ in the sense of having very high correlation. The result implies that the classical one-dimensional spectral embedding preserves particular aspects of geometry in the presence of clustered data. We also give a continuous variant of the result which has a connection to the hot spots conjecture.