arXiv subjects

Alex Barnett

Publications and source records attributed to Alex Barnett.

At least 19 recordsLinked to original sources

arXiv2025

Accelerating Molecular Dynamics Simulations using Fast Ewald Summation with Prolates

The evaluation of long-range Coulomb interactions is a significant cost in molecular dynamics (MD), even when using Particle Mesh Ewald (PME) or Particle-Particle-Particle-Mesh (PPPM) methods, which rely on Ewald splitting and the fast Fourier transform to achieve near-linear scaling. We introduce ESP -- Ewald summation with prolate spheroidal wave functions (PSWFs) -- which leads to a more efficient Fourier representation and a reduction in the required grid size, global communication, and particle-grid operations, without loss of accuracy. We have integrated the ESP method into two widely-used open-source MD packages, LAMMPS and GROMACS, enabling rapid comparison and adoption. Relative to PME/PPPM baselines at error tolerances $10^{-3}$ to $10^{-4}$, ESP gives roughly a $3$-fold acceleration of electrostatic interactions, and a $2.5$-fold speed-up in the MD simulation when using about $10^3$ compute cores. At high accuracy ($10^{-5}$), these increase to $10$-fold for the far-field electrostatics and $5$-fold for MD simulation. Furthermore, we show that the accelerated codes have improved strong scaling with core count, and validate them in realistic long-time biological and material simulations. ESP thus offers a practical, drop-in path to reduce the time-to-solution and energy footprint of MD workflows.

math.NA↗

arXiv2025

Self-reorganization and Information Transfer in Massive Schools of Fish

The remarkable cohesion and coordination observed in moving animal groups and their collective responsiveness to threats are thought to be mediated by scale-free correlations, where changes in the behavior of one animal influence others in the group, regardless of the distance between them. But are these features independent of group size? Here, we investigate group cohesiveness and collective responsiveness in computational models of massive schools of fish of up to 50,000 individuals. We show that as the number of swimmers increases, flow interactions destabilize the school, creating clusters that constantly fragment, disperse, and regroup, similar to their biological counterparts. We calculate the spatial correlation and speed of information propagation in these dynamic clusters. Spatial correlations in cohesive and polarized clusters are indeed scale free, much like in natural animal groups, but fragmentation events are preceded by a decrease in correlation length, thus diminishing the group's collective responsiveness, leaving it more vulnerable to predation events. Importantly, in groups undergoing collective turns, the information about the change in direction propagates linearly in time among group members, thanks to the non-reciprocal nature of the visual interactions between individuals. Merging speeds up the transfer of information within each cluster by several fold, while fragmentation slows it down. Our findings suggest that flow interactions may have played an important role in group size regulation, behavioral adaptations, and dispersion in living animal groups.

physics.bio-ph↗

arXiv2024

nifty-ls: Fast and Accurate Lomb-Scargle Periodograms Using a Non-Uniform FFT

We present nifty-ls, a software package for fast and accurate evaluation of the Lomb-Scargle periodogram. nifty-ls leverages the fact that Lomb-Scargle can be computed using a non-uniform FFT (NUFFT), which we evaluate with the Flatiron Institute NUFFT package (finufft). This approach achieves a many-fold speedup over the Press & Rybicki (1989) method as implemented in Astropy and is simultaneously many orders of magnitude more accurate. nifty-ls also supports fast evaluation on GPUs via CUDA and integrates with the Astropy Lomb-Scargle interface. nifty-ls is publicly available as open-source software.

astro-ph.IM↗

arXiv2024

High-order and adaptive optical conductivity calculations using Wannier interpolation

We present an automatic, high-order accurate, and adaptive Brillouin zone integration algorithm for the calculation of the optical conductivity with a non-zero but small broadening factor $\eta$, focusing on the case in which a Hamiltonian in a downfolded model can be evaluated efficiently using Wannier interpolation. The algorithm uses iterated adaptive integration to exploit the localization of the transport distribution near energy and energy-difference iso-surfaces, yielding polylogarithmic computational complexity with respect to $\eta$. To demonstrate the method, we compute the AC optical conductivity of a three-band tight-binding model, and are able to resolve the Drude and interband peaks with broadening in the sub-meV regime to several digits of accuracy. Our algorithm automates convergence testing to a user-specified error tolerance, providing an important tool in black-box first-principles calculations of electrical transport phenomena and other response functions.

cond-mat.mtrl-sci↗

arXiv2023

Efficient Convergent Boundary Integral Methods for Slender Bodies

The interaction of fibers in a viscous (Stokes) fluid plays a crucial role in industrial and biological processes, such as sedimentation, rheology, transport, cell division, and locomotion. Numerical simulations generally rely on slender body theory (SBT), an asymptotic, nonconvergent approximation whose error blows up as fibers approach each other. Yet convergent boundary integral equation (BIE) methods which completely resolve the fiber surface have so far been impractical due to the prohibitive cost of layer-potential quadratures in such high aspect-ratio 3D geometries. We present a high-order Nystr\"om quadrature scheme with aspect-ratio independent cost, making such BIEs practical. It combines centerline panels (each with a small number of poloidal Fourier modes), toroidal Green's functions, generalized Chebyshev quadratures, HPC parallel implementation, and FMM acceleration. We also present new BIE formulations for slender bodies that lead to well conditioned linear systems upon discretization. We test Laplace and Stokes Dirichlet problems, and Stokes mobility problems, for slender rigid closed fibers with (possibly varying) circular cross-section, at separations down to $1/20$ of the slender radius, reporting convergence typically to at least 10 digits. We use this to quantify the breakdown of numerical SBT for close-to-touching rigid fibers. We also apply the methods to time-step the sedimentation of 512 loops with up to $1.65$ million unknowns at around 7 digits of accuracy.

math.NA↗

arXiv2023

Uniform approximation of common Gaussian process kernels using equispaced Fourier grids

The high efficiency of a recently proposed method for computing with Gaussian processes relies on expanding a (translationally invariant) covariance kernel into complex exponentials, with frequencies lying on a Cartesian equispaced grid. Here we provide rigorous error bounds for this approximation for two popular kernels -- Mat\'ern and squared exponential -- in terms of the grid spacing and size. The kernel error bounds are uniform over a hypercube centered at the origin. Our tools include a split into aliasing and truncation errors, and bounds on sums of Gaussians or modified Bessel functions over various lattices. For the Mat\'ern case, motivated by numerical study, we conjecture a stronger Frobenius-norm bound on the covariance matrix error for randomly-distributed data points. Lastly, we prove bounds on, and study numerically, the ill-conditioning of the linear systems arising in such regression problems.

math.NA↗

arXiv2022

Automatic, high-order, and adaptive algorithms for Brillouin zone integration

We present efficient methods for Brillouin zone integration with a non-zero but possibly very small broadening factor $\eta$, focusing on cases in which downfolded Hamiltonians can be evaluated efficiently using Wannier interpolation. We describe robust, high-order accurate algorithms automating convergence to a user-specified error tolerance $\varepsilon$, emphasizing an efficient computational scaling with respect to $\eta$. After analyzing the standard equispaced integration method, applicable in the case of large broadening, we describe a simple iterated adaptive integration algorithm effective in the small $\eta$ regime. Its computational cost scales as $\mathcal{O}(\log^3(\eta^{-1}))$ as $\eta \to 0^+$ in three dimensions, as opposed to $\mathcal{O}(\eta^{-3})$ for equispaced integration. We argue that, by contrast, tree-based adaptive integration methods scale only as $\mathcal{O}(\log(\eta^{-1})/\eta^{2})$ for typical Brillouin zone integrals. In addition to its favorable scaling, the iterated adaptive algorithm is straightforward to implement, particularly for integration on the irreducible Brillouin zone, for which it avoids the tetrahedral meshes required for tree-based schemes. We illustrate the algorithms by calculating the spectral function of SrVO$_3$ with broadening on the meV scale.

cond-mat.str-el↗

arXiv2022

Equispaced Fourier representations for efficient Gaussian process regression from a billion data points

We introduce a Fourier-based fast algorithm for Gaussian process regression in low dimensions. It approximates a translationally-invariant covariance kernel by complex exponentials on an equispaced Cartesian frequency grid of $M$ nodes. This results in a weight-space $M\times M$ system matrix with Toeplitz structure, which can thus be applied to a vector in ${\mathcal O}(M \log{M})$ operations via the fast Fourier transform (FFT), independent of the number of data points $N$. The linear system can be set up in ${\mathcal O}(N + M \log{M})$ operations using nonuniform FFTs. This enables efficient massive-scale regression via an iterative solver, even for kernels with fat-tailed spectral densities (large $M$). We provide bounds on both kernel approximation and posterior mean errors. Numerical experiments for squared-exponential and Mat\'ern kernels in one, two and three dimensions often show 1-2 orders of magnitude acceleration over state-of-the-art rank-structured solvers at comparable accuracy. Our method allows 2D Mat\'ern-$\mbox{$\frac{3}{2}$}$ regression from $N=10^9$ data points to be performed in 2 minutes on a standard desktop, with posterior mean accuracy $10^{-3}$. This opens up spatial statistics applications 100 times larger than previously possible.

stat.CO↗

arXiv2022

Eliminating artificial boundary conditions in time-dependent density functional theory using Fourier contour deformation

We present an efficient method for propagating the time-dependent Kohn-Sham equations in free space, based on the recently introduced Fourier contour deformation (FCD) approach. For potentials which are constant outside a bounded domain, FCD yields a high-order accurate numerical solution of the time-dependent Schrodinger equation directly in free space, without the need for artificial boundary conditions. Of the many existing artificial boundary condition schemes, FCD is most similar to an exact nonlocal transparent boundary condition, but it works directly on Cartesian grids in any dimension, and runs on top of the fast Fourier transform rather than fast algorithms for the application of nonlocal history integral operators. We adapt FCD to time-dependent density functional theory (TDDFT), and describe a simple algorithm to smoothly and automatically truncate long-range Coulomb-like potentials to a time-dependent constant outside of a bounded domain of interest, so that FCD can be used. This approach eliminates errors originating from the use of artificial boundary conditions, leaving only the error of the potential truncation, which is controlled and can be systematically reduced. The method enables accurate simulations of ultrastrong nonlinear electronic processes in molecular complexes in which the inteference between bound and continuum states is of paramount importance. We demonstrate results for many-electron TDDFT calculations of absorption and strong field photoelectron spectra for one and two-dimensional models, and observe a significant reduction in the size of the computational domain required to achieve high quality results, as compared with the popular method of complex absorbing potentials.

physics.chem-ph↗

arXiv2021

Delayed rejection Hamiltonian Monte Carlo for sampling multiscale distributions

The efficiency of Hamiltonian Monte Carlo (HMC) can suffer when sampling a distribution with a wide range of length scales, because the small step sizes needed for stability in high-curvature regions are inefficient elsewhere. To address this we present a delayed rejection variant: if an initial HMC trajectory is rejected, we make one or more subsequent proposals each using a step size geometrically smaller than the last. We extend the standard delayed rejection framework by allowing the probability of a retry to depend on the probability of accepting the previous proposal. We test the scheme in several sampling tasks, including multiscale model distributions such as Neal's funnel, and statistical applications. Delayed rejection enables up to five-fold performance gains over optimally-tuned HMC, as measured by effective sample size per gradient evaluation. Even for simpler distributions, delayed rejection provides increased robustness to step size misspecification. Along the way, we provide an accessible but rigorous review of detailed balance for HMC.

stat.ML↗

arXiv2020

A high-order integral equation-based solver for the time-dependent Schrodinger equation

We introduce a numerical method for the solution of the time-dependent Schrodinger equation with a smooth potential, based on its reformulation as a Volterra integral equation. We present versions of the method both for periodic boundary conditions, and for free space problems with compactly supported initial data and potential. A spatially uniform electric field may be included, making the solver applicable to simulations of light-matter interaction. The primary computational challenge in using the Volterra formulation is the application of a space-time history dependent integral operator. This may be accomplished by projecting the solution onto a set of Fourier modes, and updating their coefficients from one time step to the next by a simple recurrence. In the periodic case, the modes are those of the usual Fourier series, and the fast Fourier transform (FFT) is used to alternate between physical and frequency domain grids. In the free space case, the oscillatory behavior of the spectral Green's function leads us to use a set of complex-frequency Fourier modes obtained by discretizing a contour deformation of the inverse Fourier transform, and we develop a corresponding fast transform based on the FFT. Our approach is related to pseudo-spectral methods, but applied to an integral rather than the usual differential formulation. This has several advantages: it avoids the need for artificial boundary conditions, admits simple, inexpensive high-order implicit time marching schemes, and naturally includes time-dependent potentials. We present examples in one and two dimensions showing spectral accuracy in space and eighth-order accuracy in time for both periodic and free space problems.

math.NA↗

arXiv2019

An integral equation method for the simulation of doubly-periodic suspensions of rigid bodies in a shearing viscous flow

With rheology applications in mind, we present a fast solver for the time-dependent effective viscosity of an infinite lattice containing one or more neutrally buoyant smooth rigid particles per unit cell, in a two-dimensional Stokes fluid with given shear rate. At each time, the mobility problem is reformulated as a 2nd-kind boundary integral equation, then discretized to spectral accuracy by the Nystrom method and solved iteratively, giving typically 10 digits of accuracy. Its solution controls the evolution of particle locations and angles in a first-order system of ordinary differential equations. The formulation is placed on a rigorous footing by defining a generalized periodic Green's function for the skew lattice. Numerically, the periodized integral operator is split into a near image sum|applied in linear time via the fast multipole method|plus a correction field solved cheaply via proxy Stokeslets. We use barycentric quadratures to evaluate particle interactions and velocity fields accurately, even at distances much closer than the node spacing. Using first-order time-stepping we simulate, eg, 25 ellipses per unit cell to 3-digit accuracy on a desktop in 1 hour per shear time. Our examples show equilibration at long times, force chains, and two types of blow-ups (jamming) whose power laws match lubrication theory asymptotics.

math.NA↗

arXiv2019

Solution of Stokes flow in complex nonsmooth 2D geometries via a linear-scaling high-order adaptive integral equation scheme

We present a fast, high-order accurate and adaptive boundary integral scheme for solving the Stokes equations in complex---possibly nonsmooth---geometries in two dimensions. The key ingredient is a set of panel quadrature rules capable of evaluating weakly-singular, nearly-singular and hyper-singular integrals to high accuracy. Near-singular integral evaluation, in particular, is done using an extension of the scheme developed in J.~Helsing and R.~Ojala, {\it J. Comput. Phys.} {\bf 227} (2008) 2899--2921. The boundary of the given geometry is ``panelized'' automatically to achieve user-prescribed precision. We show that this adaptive panel refinement procedure works well in practice even in the case of complex geometries with large number of corners. In one example, for instance, a model 2D vascular network with 378 corners required less than 200K discretization points to obtain a 9-digit solution accuracy.

math.NA↗

arXiv2019

Factorization of the translation kernel for fast rigid image alignment

An important component of many image alignment methods is the calculation of inner products (correlations) between an image of $n\times n$ pixels and another image translated by some shift and rotated by some angle. For robust alignment of an image pair, the number of considered shifts and angles is typically high, thus the inner product calculation becomes a bottleneck. Existing methods, based on fast Fourier transforms (FFTs), compute all such inner products with computational complexity $\mathcal{O}(n^3 \log n)$ per image pair, which is reduced to $\mathcal{O}(N n^2)$ if only $N$ distinct shifts are needed. We propose to use a factorization of the translation kernel (FTK), an optimal interpolation method which represents images in a Fourier--Bessel basis and uses a rank-$H$ approximation of the translation kernel via an operator singular value decomposition (SVD). Its complexity is $\mathcal{O}(Hn(n + N))$ per image pair. We prove that $H = \mathcal{O}((W + \log(1/\epsilon))^2)$, where $2W$ is the magnitude of the maximum desired shift in pixels and $\epsilon$ is the desired accuracy. For fixed $W$ this leads to an acceleration when $N$ is large, such as when sub-pixel shift grids are considered. Finally, we present numerical results in an electron cryomicroscopy application showing speedup factors of $3$-$10$ with respect to the state of the art.

math.NA↗

arXiv2016

Ubiquitous evaluation of layer potentials using Quadrature by Kernel-Independent Expansion

We introduce a quadrature scheme--QBKIX--for the high-order accurate evaluation of layer potentials associated with general elliptic PDEs near to and on the domain boundary. Relying solely on point evaluations of the underlying kernel, our scheme is essentially PDE-independent; in particular, no analytic expansion nor addition theorem is required. Moreover, it applies to boundary integrals with singular, weakly singular, and hypersingular kernels. Our work builds upon Quadrature by Expansion (QBX), which approximates the potential by an analytic expansion in the neighborhood of each expansion center. In contrast, we use a sum of fundamental solutions lying on a ring enclosing the neighborhood, and solve a small dense linear system for their coefficients to match the potential on a smaller concentric ring. We test the new method with Laplace, Helmholtz, Yukawa, Stokes, and Navier (elastostatic) kernels in two dimensions (2D) using adaptive, panel-based boundary quadratures on smooth and corner domains. Advantages of the algorithm include its relative simplicity of implementation, immediate extension to new kernels, dimension-independence (allowing simple generalization to 3D), and compatibility with fast algorithms such as the kernel-independent FMM.

math.NA↗

arXiv2016

Rapid solution of the cryo-EM reconstruction problem by frequency marching

Determining the three-dimensional structure of proteins and protein complexes at atomic resolution is a fundamental task in structural biology. Over the last decade, remarkable progress has been made using "single particle" cryo-electron microscopy (cryo-EM) for this purpose. In cryo-EM, hundreds of thousands of two-dimensional images are obtained of individual copies of the same particle, each held in a thin sheet of ice at some unknown orientation. Each image corresponds to the noisy projection of the particle's electron-scattering density. The reconstruction of a high-resolution image from this data is typically formulated as a nonlinear, non-convex optimization problem for unknowns which encode the angular pose and lateral offset of each particle. Since there are hundreds of thousands of such parameters, this leads to a very CPU-intensive task---limiting both the number of particle images which can be processed and the number of independent reconstructions which can be carried out for the purpose of statistical validation. Here, we propose a deterministic method for high-resolution reconstruction that operates in an ab initio manner---that is, without the need for an initial guess. It requires a predictable and relatively modest amount of computational effort, by marching out radially in the Fourier domain from low to high frequency, increasing the resolution by a fixed increment at each step.

math.NA↗

arXiv2015

Comparable upper and lower bounds for boundary values of Neumann eigenfunctions and tight inclusion of eigenvalues

For smooth bounded domains in $\mathbb{R}$, we prove upper and lower $L^2$ bounds on the boundary data of Neumann eigenfunctions, and prove quasi-orthogonality of this boundary data in a spectral window. The bounds are tight in the sense that both are independent of eigenvalue; this is achieved by working with an appropriate norm for boundary functions, which includes a `spectral weight', that is, a function of the boundary Laplacian. This spectral weight is chosen to cancel concentration at the boundary that can happen for `whispering gallery' type eigenfunctions. These bounds are closely related to wave equation estimates due to Tataru. Using this, we bound the distance from an arbitrary Helmholtz parameter $E>0$ to the nearest Neumann eigenvalue, in terms of boundary normal-derivative data of a trial function $u$ solving the Helmholtz equation $(\Delta-E)u=0$. This `inclusion bound' improves over previously known bounds by a factor of $E^{5/6}$. It is analogous to a recently improved inclusion bound in the Dirichlet case, due to the first two authors. Finally, we apply our theory to present an improved numerical implementation of the method of particular solutions for computation of Neumann eigenpairs on smooth planar domains. We show that the new inclusion bound improves the relative accuracy in a computed Neumann eigenvalue (around the $42000$th) from 9 digits to 14 digits, with little extra effort.

math.AP↗

arXiv2015

A fast algorithm for simulating multiphase flows through periodic geometries of arbitrary shape

This paper presents a new boundary integral equation (BIE) method for simulating particulate and multiphase flows through periodic channels of arbitrary smooth shape in two dimensions. The authors consider a particular system---multiple vesicles suspended in a periodic channel of arbitrary shape---to describe the numerical method and test its performance. Rather than relying on the periodic Green's function as classical BIE methods do, the method combines the free-space Green's function with a small auxiliary basis, and imposes periodicity as an extra linear condition. As a result, we can exploit existing free-space solver libraries, quadratures, and fast algorithms, and handle a large number of vesicles in a geometrically complex channel. Spectral accuracy in space is achieved using the periodic trapezoid rule and product quadratures, while a first-order semi-implicit scheme evolves particles by treating the vesicle-channel interactions explicitly. New constraint-correction formulas are introduced that preserve reduced areas of vesicles, independent of the number of time steps taken. By using two types of fast algorithms, (i) the fast multipole method (FMM) for the computation of the vesicle-vesicle and the vesicle-channel hydrodynamic interaction, and (ii) a fast direct solver for the BIE on the fixed channel geometry, the computational cost is reduced to $O(N)$ per time step where $N$ is the spatial discretization size. Moreover, the direct solver inverts the wall BIE operator at $t = 0$, stores its compressed representation and applies it at every time step to evolve the vesicle positions, leading to dramatic cost savings compared to classical approaches. Numerical experiments illustrate that a simulation with $N=128, 000$ can be evolved in less than a minute per time step on a laptop.

math.NA↗