Related papers: A Unified Poisson Summation Framework for Generali…
Singularly perturbed partial differential equations arise in many applications, including magnetohydrodynamic duct flows, chemical reaction transport systems, and Poisson Boltzmann electrostatics. These problems are characterized by sharp…
Data privacy has increasingly become a daunting challenge because it limits data availability, which is essential in estimating statistical models such as generalized linear mixed models. Access to personal data often involves considerable…
Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block encoded matrices, a central task that lies at the heart of most prominent…
We present an efficient solver for massively-parallel direct numerical simulations of incompressible turbulent flows. The method uses a second-order, finite-volume pressure-correction scheme, where the pressure Poisson equation is solved…
We review existing methods for implementing smooth functions f(A) of a sparse Hermitian matrix A on a quantum computer, and analyse a further combination of these techniques which has some advantages of simplicity and resource consumption…
Beamforming is an essential step in the ultrasound image formation pipeline and has recently attracted growing interest. An important goal of beamforming is to increase the image spatial resolution, or in other words to narrow down the…
In this paper, we investigate the performance of pseudo-spectral methods in computing nearly singular solutions of fluid dynamics equations. We consider two different ways of removing the aliasing errors in a pseudo-spectral method. The…
Many computational algorithms applied to geometry operate on discrete representations of shape. It is sometimes necessary to first simplify, or coarsen, representations found in modern datasets for practicable or expedited processing. The…
We propose a novel estimation framework for quadratic functionals of precision matrices in high-dimensional settings, particularly in regimes where the feature dimension $p$ exceeds the sample size $n$. Traditional moment-based estimators…
With a focus on universal quantum computing for quantum simulation, and through the example of lattice gauge theories, we introduce rather general quantum algorithms that can efficiently simulate certain classes of interactions consisting…
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs…
The present paper describes a parallel unstructured-mesh Plasma simulation code based on Finite Volume method. The code dynamically refines and coarses mesh for accurate resolution of the different features regarding the electron density.…
In this article, we develop comprehensive frequency domain methods for estimating and inferring the second-order structure of spatial point processes. The main element here is on utilizing the discrete Fourier transform (DFT) of the point…
The mixed formulation of the classical Poisson problem introduces the flux as an additional variable, leading to a system of coupled equations. Using fractional calculus identities, in this work we explore a mixed formulation of the…
Shape matching is a fundamental task in computer graphics and vision, with deep functional maps becoming a prominent paradigm. However, existing methods primarily focus on learning informative feature representations by constraining…
We develop an efficient alternating framework for learning a generalized version of Factorization Machine (gFM) on steaming data with provable guarantees. When the instances are sampled from $d$ dimensional random Gaussian vectors and the…
Pseudosupersymmetric quantum mechanics (PsSSQM), based upon the use of pseudofermions, was introduced in the context of a new Kemmer equation describing charged vector mesons interacting with an external constant magnetic field. Here we…
We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially…
Hybrid methods for simulating rarefied gas flows reduce computational cost by coupling a particle-based model, typically the direct simulation Monte Carlo (DSMC) method, to a continuum-based solver, i.e. a computational fluid dynamics (CFD)…
The Fast Multipole Method (FMM) provides a highly efficient computational tool for solving constant coefficient partial differential equations (e.g. the Poisson equation) on infinite domains. The solution to such an equation is given as the…