Related papers: A Fast Algorithm for Quadrature by Expansion in Th…
This paper proposes QPALM, a proximal augmented Lagrangian method based on quadratic approximations, for solving nonlinear programming problems with weakly convex objective and constraint functions. The algorithm is constructed by…
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…
The development of accurate and fast numerical schemes for the five fold Boltzmann collision integral represents a challenging problem in scientific computing. For a particular class of interactions, including the so-called hard spheres…
Classification is at the core of data-driven prediction and decision-making, representing a fundamental task in supervised machine learning. Recently, several quantum machine learning algorithms that use quantum kernels as a measure of…
In this paper we present a parallelization strategy on distributed memory systems for the Fast Kinetic Scheme --- a semi-Lagrangian scheme developed in [J. Comput. Phys., Vol. 255, 2013, pp 680-698] for solving kinetic equations. The…
Non-convex quadratically constrained quadratic programming (QCQP) problems have numerous applications in signal processing, machine learning, and wireless communications, albeit the general QCQP is NP-hard, and several interesting special…
Boundary integral methods are highly suited for problems with complicated geometries, but require special quadrature methods to accurately compute the singular and nearly singular layer potentials that appear in them. This paper presents a…
The Kernel Polynomial Method (KPM) is one of the fast diagonalization methods used for simulations of quantum systems in research fields of condensed matter physics and chemistry. The algorithm has a difficulty to be parallelized on a…
The quadrature error associated with a regular quadrature rule for evaluation of a layer potential increases rapidly when the evaluation point approaches the surface and the integral becomes nearly singular. Error estimates are needed to…
We describe a new, adaptive solver for the two-dimensional Poisson equation in complicated geometries. Using classical potential theory, we represent the solution as the sum of a volume potential and a double layer potential. Rather than…
We present formulas for accurate numerical conversion between functions represented by multiwavelets and their multipole/local expansions with respect to the kernel of the form, $e^{\lambda r}/r$. The conversion is essential for the…
Multiresolution Matrix Factorization (MMF) was recently introduced as a method for finding multiscale structure and defining wavelets on graphs/matrices. In this paper we derive pMMF, a parallel algorithm for computing the MMF…
Many quantum algorithms for numerical linear algebra assume black-box access to a block-encoding of the matrix of interest, which is a strong assumption when the matrix is not sparse. Kernel matrices, which arise from discretizing a kernel…
Boundary integral equations are an efficient and accurate tool for the numerical solution of elliptic boundary value problems. The solution is expressed as a layer potential; however, the error in its evaluation grows large near the…
This paper presents an efficient parallel direct algorithm with near-optimal complexity for the compact fourth and sixth-order approximation of the three-dimensional Helmholtz equations [1] with the problem coefficient depending on only one…
Fracton topological phases have a large number of materialized symmetries that enforce a rigid structure on their excitations. Remarkably, we find that the symmetries of a quantum error-correcting code based on a fracton phase enable us to…
Optimally convergent (with respect to the regularity) quadratic finite element method for two dimensional obstacle problem on simplicial meshes is studied in (Brezzi, Hager, Raviart, Numer. Math, 28:431--443, 1977). There was no analogue of…
We introduce the use of the Fast Multipole Method (FMM) to speed up gravitational lensing ray tracing calculations. The method allows very fast calculation of ray deflections when a large number of deflectors, $N_*$, is involved, while…
We propose a scheme for translating metrological precision bounds into lower bounds on query complexity of quantum search algorithms. Within the scheme the link between quadratic performance enhancement in idealized quantum metrological and…
We propose an efficient algorithm for the evaluation of the potential and its gradient of gravitational/electrostatic $N$-body systems, which we call particle mesh multipole method (PMMM or PM$^3$). PMMM can be understood both as an…