Publications

Speckle or multiplicative noise is a critical issue in coherence-based imaging systems, such as synthetic aperture radar and optical coherence tomography. Existence of speckle noise considerably limits the applicability of such systems by degrading their performance. On the other hand, the sophistications that arise in the study of multiplicative noise have so far impeded theoretical analysis of such imaging systems. As a result, the current acquisition technology relies on heuristic solutions, such as oversampling the signal and converting the problem into a denoising problem with multiplicative noise. This paper attempts to bridge the gap between theory and practice by providing the first theoretical analysis of such systems. To achieve this goal the log-likelihood function corresponding to measurement systems with speckle noise is characterized. Then employing compression codes to model the source structure, for the case of under-sampled measurements, a compression-based maximum likelihood recovery method is proposed. The mean squared error (MSE) performance of the proposed method is characterized and is shown to scale as O(klognm−−−−−√) , where k , m and n denote the intrinsic dimension of the signal class according to the compression code, the number of observations, and the ambient dimension of the signal, respectively. This result, while in contrast to imaging systems with additive noise in which MSE scales as O(klognm) , suggests that if the signal class is structured (i.e., k≪n ), accurate recovery of a signal from under-determined measurements is still feasible, even in the presence of speckle noise. Simulation results are presented that suggest image recovery under multiplicative noise is inherently more challenging than additive noise, and that the derived theoretical results are sharp

We perform a data-driven dimensionality reduction of the scale-dependent four-point vertex function characterizing the functional renormalization group (FRG) flow for the widely studied two-dimensional \(t−t′\) Hubbard model on the square lattice. We demonstrate that a deep learning architecture based on a neural ordinary differential equation solver in a low-dimensional latent space efficiently learns the FRG dynamics that delineates the various magnetic and d-wave superconducting regimes of the Hubbard model. We further present a dynamic mode decomposition analysis that confirms that a small number of modes are indeed sufficient to capture the FRG dynamics. Our Letter demonstrates the possibility of using artificial intelligence to extract compact representations of the four-point vertex functions for correlated electrons, a goal of utmost importance for the success of cutting-edge quantum field theoretical methods for tackling the many-electron problem.

We investigate the effects of non-zero spatial curvature on cosmic inflation in the light of cosmic microwave background (CMB) anisotropy measurements from the Planck 2018 legacy release and from the 2015 observing season of BICEP2 and the Keck Array. Even a small percentage of non-zero curvature today would significantly limit the total number of e-folds of the scale factor during inflation, rendering just-enough inflation scenarios with a kinetically dominated or fast-roll stage prior to slow-roll inflation more likely. Finite inflation leads to oscillations and a cutoff towards large scales in the primordial power spectrum and curvature pushes them into the CMB observable window. Using nested sampling, we carry out Bayesian parameter estimations and model comparisons taking into account constraints from reheating and horizon considerations. We confirm the preference of CMB data for closed universes with Bayesian odds of over 100:1 and with a posterior on the curvature density parameter of ΩK,0=−0.051±0.017 for a curvature extension of LCDM and ΩK,0=−0.031±0.014 for Starobinsky inflation. Model comparisons of various inflation models give similar results as for flat universes with the Starobinsky model outperforming most other models.

Well-conditioned boundary integral methods for the solution of elliptic boundary value problems (BVPs) are powerful tools for static and dynamic physical simulations. When there are many close-to-touching boundaries (e.g., in complex fluids) or when the solution is needed in the bulk, nearly singular integrals must be evaluated at many targets. We show that precomputing a linear map from surface density to an effective source representation renders this task highly efficient, in the common case where each object is “simple”, i.e., its smooth boundary needs only moderately many nodes. We present a kernel-independent method needing only an upsampled smooth surface quadrature, and one dense factorization, for each distinct shape. No (near-)singular quadrature rules are needed. The resulting effective sources are drop-in compatible with fast algorithms, with no local corrections nor bookkeeping. Our extensive numerical tests include 2D FMM-based Helmholtz and Stokes BVPs with up to 1000 objects (281000 unknowns), and a 3D Laplace BVP with 10 ellipsoids separated by 1/30 of a diameter. We include a rigorous analysis for analytic data in 2D and 3D.

Single particle cryo-electron microscopy has become a critical tool in structural biology over the last decade, able to achieve atomic scale resolution in three dimensional models from hundreds of thousands of (noisy) two-dimensional projection views of particles frozen at unknown orientations. This is accomplished by using a suite of software tools to (i) identify particles in large micrographs, (ii) obtain low-resolution reconstructions, (iii) refine those low-resolution structures, and (iv) finally match the obtained electron scattering density to the constituent atoms that make up the macromolecule or macromolecular complex of interest. Here, we focus on the second stage of the reconstruction pipeline: obtaining a low resolution model from picked particle images. Our goal is to create an algorithm that is capable of ab initio reconstruction from small data sets (on the order of a few thousand selected particles). More precisely, we seek an algorithm that is robust, automatic, able to assess particle quality, and fast enough that it can potentially be used to assist in the assessment of the data being generated while the microscopy experiment is still underway.

State redistribution is an algorithm that stabilizes cut cells for embedded boundary grid methods. This work extends the earlier algorithm in several important ways. First, state redistribution is extended to three spatial dimensions. Second, we discuss several algorithmic changes and improvements motivated by the more complicated cut cell geometries that can occur in higher dimensions. In particular, we introduce a weighted version with less dissipation in an easily generalizable framework. Third, we demonstrate that state redistribution can also stabilize a solution update that includes both advective and diffusive contributions. The stabilization algorithm is shown to be effective for incompressible as well as compressible reacting flows. Finally, we discuss the implementation of the algorithm for several exascale-ready simulation codes based on AMReX, demonstrating ease of use in combination with domain decomposition, hybrid parallelism and complex physics.

Simulations with adaptive time-dependent bias enable an efficient exploration of the conformational space of a system. However, the dynamic information is altered by the bias. Infrequent metadynamics recovers the transition rate of crossing a barrier, if the collective variables are ideal and there is no bias deposition near the transition state. Unfortunately, these conditions are not always fulfilled. To overcome these limitations, and inspired by single-molecule force spectroscopy, we use Kramers’ theory for calculating the barrier-crossing rate when a time-dependent bias is added to the system. We assess the efficiency of collective variables parameter by measuring how efficiently the bias accelerates the transitions. We present approximate analytical expressions of the survival probability, reproducing the barrier-crossing time statistics and enabling the extraction of the unbiased transition rate even for challenging cases. We explore the limits of our method and provide convergence criteria to assess its validity.

We introduce a numerical method for the solution of the time-dependent Schrödinger 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 spacetime 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 pseudospectral 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.

Partial differential equations (PDEs) play a dominant role in the mathematical modeling of many complex dynamical processes. Solving these PDEs often requires prohibitively high computational costs, especially when multiple evaluations must be made for different parameters or conditions. After training, neural operators can provide PDEs solutions significantly faster than traditional PDE solvers. In this work, invariance properties and computational complexity of two neural operators are examined for transport PDE of a scalar quantity. Neural operator based on graph kernel network (GKN) operates on graph-structured data to incorporate nonlocal dependencies. Here we propose a modified formulation of GKN to achieve frame invariance. Vector cloud neural network (VCNN) is an alternate neural operator with embedded frame invariance which operates on point cloud data. GKN-based neural operator demonstrates slightly better predictive performance compared to VCNN. However, GKN requires an excessively high computational cost that increases quadratically with the increasing number of discretized objects as compared to a linear increase for VCNN.

The long-term goal of this work is the development of high-fidelity simulation tools for dispersive tsunami propagation. A dispersive model is especially important for short wavelength phenomena such as an asteroid impact into the ocean, and is also important in modeling other events where the simpler shallow water equations are insufficient. Adaptive simulations are crucial to bridge the scales from deep ocean to inundation, but have difficulties with the implicit system of equations that results from dispersive models. We propose a fractional step scheme that advances the solution on separate patches with different spatial resolutions and time steps. We show a simulation with 7 levels of adaptive meshes and onshore inundation resulting from a simulated asteroid impact off the coast of Washington. Finally, we discuss a number of open research questions that need to be resolved for high quality simulations.