English
Related papers

Related papers: Fast and spectrally accurate summation of 2-period…

200 papers

When evaluating the electrostatic potential, periodic boundary conditions in one, two or three of the spatial dimensions are often needed for different applications. The triply periodic Ewald summation formula is classical, and Ewald…

Mathematical Physics · Physics 2014-04-15 Anna-Karin Tornberg

We derive and implement an alternative formulation of the Stochastic Lanczos algorithm to be employed in connection with the Many-Body Dispersion model (MBD). Indeed, this formulation, which is only possible due to the Stochastic Lanczos'…

Chemical Physics · Physics 2023-10-23 Pier P. Poier , Louis Lagardère , Jean-Philip Piquemal

Particle Mesh Ewald (PME) methods accelerated through Fast Fourier Transforms (FFTs) for their reciprocal part are widely used to solve N -body problems over periodic structures with Laplace-like kernels. The FFT dependence of classical PME…

Numerical Analysis · Mathematics 2026-01-28 Igor Chollet

The smooth particle mesh Ewald (SPME) method is an FFT based method for the fast evaluation of electrostatic interactions under periodic boundary conditions. A highly optimized implementation of this method is available in GROMACS, a widely…

Numerical Analysis · Mathematics 2017-12-14 Davood Saffar Shamshirgar , Berk Hess , Anna-Karin Tornberg

An accelerated boundary integral method for Stokes flow of a suspension of deformable particles is presented for an arbitrary domain and implemented for the important case of a planar slit geometry. The computational complexity of the…

Soft Condensed Matter · Physics 2012-08-07 Amit Kumar , Michael D. Graham

The analysis of fields in periodic dielectric structures arise in numerous applications of recent interest, ranging from photonic bandgap (PBG) structures and plasmonically active nanostructures to metamaterials. To achieve an accurate…

Computational Physics · Physics 2012-11-22 Andrew D. Baczewski , Nicholas C. Miller , Balasubramaniam Shanker

In this paper, we propose a computationally efficient iterative algorithm for proper orthogonal decomposition (POD) using random sampling based techniques. In this algorithm, additional rows and columns are sampled and a merging technique…

Numerical Analysis · Mathematics 2020-11-23 Charumathi V , M. Ramakrishna , Vinita Vasudevan

In this paper, we propose a computationally efficient iterative algorithm for proper orthogonal decomposition (POD) using random sampling based techniques. In this algorithm, additional rows and columns are sampled and a merging technique…

Numerical Analysis · Computer Science 2021-07-07 V. Charumathi , M. Ramakrishna , Vinita Vasudevan

Quasi-2D Coulomb systems are of fundamental importance and have attracted much attention in many areas nowadays. Their reduced symmetry gives rise to interesting collective behaviors, but also brings great challenges for particle-based…

Numerical Analysis · Mathematics 2025-02-05 Zecheng Gan , Xuanzhao Gao , Jiuyang Liang , Zhenli Xu

In a number of problems in computational physics, a finite sum of kernel functions centered at $N$ particle locations located in a box in three dimensions must be extended by imposing periodic boundary conditions on box boundaries. Even…

Computational Physics · Physics 2015-06-17 Nail A. Gumerov , Ramani Duraiswami

In this article, we introduce a fast and memory efficient solver for sparse matrices arising from the finite element discretization of elliptic partial differential equations (PDEs). We use a fast direct (but approximate) multifrontal…

Numerical Analysis · Computer Science 2015-04-23 AmirHossein Aminfar , Eric Darve

Finding sparse solutions of underdetermined systems of linear equations is a fundamental problem in signal processing and statistics which has become a subject of interest in recent years. In general, these systems have infinitely many…

Machine Learning · Statistics 2010-09-21 Arash Ali Amini , Massoud Babaie-Zadeh , Christian Jutten

This paper introduces tensorial calculus techniques in the framework of Proper Orthogonal Decomposition (POD) to reduce the computational complexity of the reduced nonlinear terms. The resulting method, named tensorial POD, can be applied…

Numerical Analysis · Computer Science 2015-06-18 Răzvan Ştefănescu , Adrian Sandu , Ionel M. Navon

We present a solver for the 2D high-frequency Helmholtz equation in heterogeneous, constant density, acoustic media, with online parallel complexity that scales empirically as $\mathcal{O}(\frac{N}{P})$, where $N$ is the number of volume…

Numerical Analysis · Mathematics 2017-01-03 Leonardo Zepeda-Núñez , Laurent Demanet

The Stokeslet and stresslet kernels are commonly used in boundary element simulations and singularity methods for slow viscous flow. Evaluating the velocity induced by a collection of Stokeslets and stresslets by direct summation requires…

Numerical Analysis · Mathematics 2019-08-30 Lei Wang , Svetlana Tlupova , Robert Krasny

A rapid algorithm is derived for the Helmholtz--Hodge decomposition on the surface of the sphere in spherical coordinates. The algorithm uncouples modes of spherical harmonics with different absolute order, writes the conversion as…

Numerical Analysis · Mathematics 2018-09-13 Julien Molina , Richard Mikael Slevinsky

The evaluation of long-range potentials in periodic, many-body systems arises as a necessary step in the numerical modeling of a multitude of interesting physical problems. Direct evaluation of these potentials requires O(N^2) operations…

Computational Physics · Physics 2011-07-18 Andrew D. Baczewski , Balasubramaniam Shanker

The quasi-2D electrostatic systems, characterized by periodicity in two dimensions with a free third dimension, have garnered significant interest in many fields. We apply the sum-of-Gaussians (SOG) approximation to the Laplace kernel,…

Numerical Analysis · Mathematics 2024-12-09 Xuanzhao Gao , Shidong Jiang , Jiuyang Liang , Zhenli Xu , Qi Zhou

We introduce a fast direct solver for variable-coefficient elliptic partial differential equations on surfaces based on the hierarchical Poincar\'e-Steklov method. The method takes as input an unstructured, high-order quadrilateral mesh of…

Numerical Analysis · Mathematics 2022-10-04 Daniel Fortunato

We give an algorithm that, given an $n$-vertex graph $G$ and an integer $k$, in time $2^{O(k)} n$ either outputs a tree decomposition of $G$ of width at most $2k + 1$ or determines that the treewidth of $G$ is larger than $k$. This is the…

Data Structures and Algorithms · Computer Science 2023-08-24 Tuukka Korhonen