Related papers: PoisFFT - A Free Parallel Fast Poisson Solver

This paper presents a low-communication-overhead parallel method for solving the 3D incompressible Navier-Stokes equations. A fully-explicit projection method with second-order space-time accuracy is adopted. Combined with fast Fourier…

In this paper, we present a fast and effective method for solving the Poisson-modified total variation model proposed in [9]. The existence and uniqueness of the model are again proved using different method. A semi-implicit difference…

Let $\Gamma$ be a smooth curve inside a two-dimensional rectangular region $\Omega$. In this paper, we consider the Poisson interface problem $-\nabla^2 u=f$ in $\Omega\setminus \Gamma$ with Dirichlet boundary condition such that $f$ is…

For simulating incompressible flows by projection methods. it is generally accepted that the pressure-correction stage is the most time-consuming part of the flow solver. The objective of the present work is to develop a fast hybrid…

We propose a parallel (distributed) version of the spectral proper orthogonal decomposition (SPOD) technique. The parallel SPOD algorithm distributes the spatial dimension of the dataset preserving time. This approach is adopted to preserve…

We present a coarse-grid projection (CGP) method for accelerating incompressible flow computations, which is applicable to methods involving Poisson equations as incompressibility constraints. The CGP methodology is a modular approach that…

We present a new framework for the fast solution of inhomogeneous elliptic boundary value problems in domains with smooth boundaries. High-order solvers based on adaptive box codes or the fast Fourier transform can efficiently treat the…

This paper presents Poisson vector graphics, an extension of the popular first-order diffusion curves, for generating smooth-shaded images. Armed with two new types of primitives, namely Poisson curves and Poisson regions, PVG can easily…

Boolean satisfiability (SAT) problem is of fundamental importance in computer science and many application domains. For Grover's algorithm, solving the SAT problem requires $\mathcal{O}(\sqrt{2^n})$ queries--where n denotes the number of…

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…

We propose a new "Poisson flow" generative model (PFGM) that maps a uniform distribution on a high-dimensional hemisphere into any data distribution. We interpret the data points as electrical charges on the $z=0$ hyperplane in a space…

This paper presents a "two-dimensional Fourier Continuation" method (2D-FC) for construction of bi-periodic extensions of smooth non-periodic functions defined over general two-dimensional smooth domains. The approach can be directly…

The Fast Fourier Transform (FFT) is an algorithm of paramount importance in signal processing as it allows to apply the Fourier transform in O(n log n) instead of O(n 2) arithmetic operations. Graph Signal Processing (GSP) is a recent…

A new method of numerical solution for partial differential equations is proposed. The method is based on a fast matrix multiplication algorithm. Two-dimensional Poison equation is used for comparison of the proposed method with…

Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications.…

In this paper we present a massively parallel open source solver for Richards equation, named the RichardsFOAM solver. This solver has been developed in the framework of the open source generalist computational fluid dynamics tool box…

In this paper, we present resolvent4py, a parallel Python package for the analysis, model reduction and control of large-scale linear systems with millions or billions of degrees of freedom. This package provides the user with a friendly…

The Fast Fourier Transform (FFT) is a fundamental numerical technique with widespread application in a range of scientific problems. As scientific simulations attempt to exploit exascale systems, there has been a growing demand for…

The graph Fourier transform (GFT) is an important tool for graph signal processing, with applications ranging from graph-based image processing to spectral clustering. However, unlike the discrete Fourier transform, the GFT typically does…

Fitting complicated models to large datasets is a bottleneck of many analyses. We present GooFit, a library and tool for constructing arbitrarily-complex probability density functions (PDFs) to be evaluated on nVidia GPUs or on multicore…