Related papers: A Divide-and-Conquer Algorithm for Disordered and …
We compute the scaling properties of the localization length $\xi_2$ of two interacting particles in a one-dimensional chain with diagonal disorder, and the connectivity properties of the Fock states. We analyze record large system sizes…
In this work, we derive particle schemes, based on micro-macro decomposition, for linear kinetic equations in the diffusion limit. Due to the particle approximation of the micro part, a splitting between the transport and the collision part…
We present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that can exploit localization features of the eigenvector. When the eigenvector to be computed is localized, meaning only a small number of its…
The low-rank matrix factorization as a L1 norm minimization problem has recently attracted much attention due to its intrinsic robustness to the presence of outliers and missing data. In this paper, we propose a new method, called the…
We propose a multiscale approach for an elliptic multiscale setting with general unstructured diffusion coefficients that is able to achieve high-order convergence rates with respect to the mesh parameter and the polynomial degree. The…
In modeling quantum systems or wave phenomena, one is often interested in identifying eigenstates that approximately carry a specified property; scattering states approximately align with incoming and outgoing traveling waves, for instance,…
Strong disorder in interacting quantum systems can give rise to the phenomenon of Many-Body Localization (MBL), which defies thermalization due to the formation of an extensive number of quasi local integrals of motion. The one particle…
A fast algorithm to study one-dimensional self-gravitating systems, and, more generally, systems that are Lagrangian integrable between collisions, is presented. The algorithm is event-driven, and uses a heap-ordered set of predicted future…
We show, using quasi-exact numerical simulations, that Anderson localization of one-dimensional particles in a disordered potential survives in the presence of attractive interaction between particles. The localization length of the…
Density-functional theory (DFT) has revolutionized computer simulations in chemistry and material science. A faithful implementation of the theory requires self-consistent calculations. However, this effort involves repeatedly diagonalizing…
We propose an autofocusing algorithm to obtain, relatively accurately, the 3D position of each particle, particularly its axial location, and particle number of a dense transparent particle solution via its hologram. First, morphological…
We consider the problem of solving partial differential equations (PDEs) in domains with complex microparticle geometry that is impractical, or intractable, to model explicitly. Drawing inspiration from volume rendering, we propose tackling…
We consider the learning of algorithmic tasks by mere observation of input-output pairs. Rather than studying this as a black-box discrete regression problem with no assumption whatsoever on the input-output mapping, we concentrate on tasks…
We extend our two-scale neural-network method for scalar singularly perturbed problems with one small parameter to dynamical systems with multiple small parameters. To accommodate multiple small parameters, we use a single effective scale…
Partitioning a graph into blocks of "roughly equal" weight while cutting only few edges is a fundamental problem in computer science with a wide range of applications. In particular, the problem is a building block in applications that…
Integration is affected by the curse of dimensionality and quickly becomes intractable as the dimensionality of the problem grows. We propose a randomized algorithm that, with high probability, gives a constant-factor approximation of a…
In this work, we present scalable balancing domain decomposition by constraints methods for linear systems arising from arbitrary order edge finite element discretizations of multi-material and heterogeneous 3D problems. In order to enforce…
The partitioning of a system model will condition the structure of the controller as well as its design. In order to partition a system model, one has to know what states and inputs to group together to define subsystem models. For a given…
We present some recent results concerning the persistence of dynamical localization for disordered systems of n particles under weak interactions.
The idle computers on a local area, campus area, or even wide area network represent a significant computational resource---one that is, however, also unreliable, heterogeneous, and opportunistic. This type of resource has been used…