The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
Marina Spivak, Shravan K. Veerapaneni, Leslie Gree...
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods ge...
Abstract. The full multigrid (FMG) algorithm is often claimed to achieve so-called discretizationlevel accuracy. In this paper, this notion is formalized by defining a worst-case r...
Carmen Rodrigo, Francisco J. Gaspar, Cornelis W. O...
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
Infinitely divisible random vector without Gaussian component admits representations of shot noise series. Due to possible slow convergence of the series, they have not been inves...
We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, ea...
In this article we are interested in the derivation of efficient domain decomposition methods for the viscous primitive equations of the ocean. We consider the rotating 3d incompre...
Abstract. In this paper we improve traditional steepest descent methods for the direct minimization of the Gross-Pitaevskii (GP) energy with rotation at two levels. We first defi...