Related papers: Polynomially filtered exact diagonalization approa…
Exact solutions are derived for the problem of a two-dimensional, infinitely anisotropic, linear-elastic medium containing a periodic lattice of voids. The matrix material possesses either one infinitely soft, or one infinitely hard loading…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
Ferroelectric materials with switchable spontaneous polarization underpin non-volatile memories, transistors, sensors, and emerging neuromorphic chips. Their performance and stability are governed by polarization dynamics and domain…
Within the framework of imaginary-time evolution for matrix product states, we introduce a cluster version of the infinite time-evolving block decimation algorithm for simulating quantum many-body systems, addressing the computational…
We consider the problem of finding the optimal diagonal preconditioner for a positive definite matrix. Although this problem has been shown to be solvable and various methods have been proposed, none of the existing approaches are scalable…
We propose a penalized likelihood framework for estimating multiple precision matrices from different classes. Most existing methods either incorporate no information on relationships between the precision matrices, or require this…
We consider a set of M images, whose pixel intensities at a common point can be treated as the components of a M-dimensional vector. We are interested in the estimation of the modulus of such a vector associated to a compact source. For…
In this paper, a methodology for fine scale modeling of large scale structures is proposed, which combines the variational multiscale method, domain decomposition and model order reduction. The influence of the fine scale on the coarse…
We present a novel framework for PDE-constrained $r$-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality…
Interior eigenvalue problems for large-scale sparse Hermitian matrices are fundamental in computational science. We propose an adaptive polynomial filtering strategy based on Chebyshev expansion of a step function, integrated into a…
We present a fast sparse matrix permutation algorithm tailored to linear systems arising from triangle meshes. Our approach produces nested-dissection-style permutations while significantly reducing permutation runtime overhead. Rather than…
By employing Random Matrix Theory (RMT) and first-principle calculations, we investigated the behavior of Anderson localization in 1D, 2D and 3D systems characterized by a varying disorder. In particular, we considered random binary layer…
We present DeepFDM, a differentiable finite-difference framework for learning spatially varying coefficients in time-dependent partial differential equations (PDEs). By embedding a classical forward-Euler discretization into a convolutional…
We propose a simplified version of the Multi-Scale Analysis of tight-binding Anderson models with strongly mixing random potentials which leads directly to uniform exponential bounds on decay of eigenfunctions in arbitrarily large finite…
In single-molecule super-resolution microscopy, engineered point-spread functions (PSFs) are designed to efficiently encode new molecular properties, such as 3D orientation, into complex spatial features captured by a camera. To fully…
Position holds a very special role in understanding the classical behaviour of macroscopic bodies on the basis of quantum principles. This lead us to examine the localised states of a large condensed object in the context of a realistic…
In [Van Beeumen, et. al, HPC Asia 2020, https://www.doi.org/10.1145/3368474.3368497] a scalable and matrix-free eigensolver was proposed for studying the many-body localization (MBL) transition of two-level quantum spin chain models with…
Polarization in ferroelectric domains arises from atomic-scale structural variations that govern macroscopic functionalities. The interfaces between these domains known as domain walls host distinct physical responses, making their…
Twisted particle filters are a class of sequential Monte Carlo methods recently introduced by Whiteley and Lee to improve the efficiency of marginal likelihood estimation in state-space models. The purpose of this article is to extend the…
Designing infinite impulse response filters to match an arbitrary magnitude response requires specialized techniques. Methods like modified Yule-Walker are relatively efficient, but may not be sufficiently accurate in matching high order…