Related papers: A Simple Formulation of the Fast Multipole Method:…
In this paper the salient features of the Plane Wave Expansion (PWE) method and the mixed variational technique are combined for the fast eigenvalue computations of arbitrarily complex phononic unit cells. This is done by expanding the…
The growing scale of Large Language Models (LLMs) has exacerbated inference latency and computational costs. Speculative decoding methods, which aim to mitigate these issues, often face inefficiencies in the construction of token trees and…
We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a $d$-regular tree…
We have implemented recently developed multiple-projector pseudopotentials into the planewave based auxiliary-field quantum Monte Carlo (pw-AFQMC) method. Multiple-projector pseudopotentials can yield smaller planewave cut-offs while…
We present several finite-temperature recursive Fermi-operator expansion schemes based on the second-order spectral projection (SP2) method. Our approach builds on a previous observation that the electronic structure problem, as formulated…
This paper presents a fast wavefield evaluation method for two-dimensional wave scattering problems. The proposed method is based on a modified version of proxy-surface-accelerated interpolative decomposition, making it effective even if…
LCODE is a freely-distributed quasistatic 2D3V code for simulating plasma wakefield acceleration, mainly specialized at resource-efficient studies of long-term propagation of ultrarelativistic particle beams in plasmas. The beam is modeled…
Metasurfaces, consisting of large arrays of interacting subwavelength scatterers, pose significant challenges for general-purpose computational methods due to their large electric dimensions and multiscale nature. This paper introduces an…
Many real-world optimization models contain exploitable sparsity and block structure, but this structure is often obscured in algebraic form, limiting the effectiveness of modern parallel algorithms. We propose an automatic pipeline that…
We develop a general distributed implementation of an adaptive fast multipole method in three space dimensions. We rely on a balanced type of adaptive space discretisation which supports a highly transparent and fully distributed…
To prepare images for better segmentation, we need preprocessing applications, such as smoothing, to reduce noise. In this paper, we present an enhanced computation method for smoothing 2D object in binary case. Unlike existing approaches,…
This paper studies the iteration-complexity of a new primal-dual algorithm based on Rockafellar's proximal method of multipliers (PMM) for solving smooth convex programming problems with inequality constraints. In each step, either a step…
Numerical resolution of high-dimensional nonlinear PDEs remains a huge challenge due to the curse of dimensionality. Starting from the weak formulation of the Lawson-Euler scheme, this paper proposes a stochastic particle method (SPM) by…
This paper presents a new fast multipole boundary element method (FM-BEM) for solving the acoustic transmission problems in 2D periodic media. We divide the periodic media into many fundamental blocks, and then construct the boundary…
In this paper we propose an explicit two-level conservative scheme based on a TE/TM like splitting of the field components in time. Its dispersion properties are adjusted to accelerator problems. It is simpler and faster than the implicit…
This paper presents "Predictive Pipelined Decoding (PPD)," an approach that speeds up greedy decoding in Large Language Models (LLMs) while maintaining the exact same output as the original decoding. Unlike conventional strategies, PPD…
In this work we propose an efficient and accurate multi-scale optical simulation algorithm by applying a numerical version of slowly varying envelope approximation in FEM. Specifically, we employ the fast iterative method to quickly compute…
A software library is presented for the polynomial expansion method (PEM) of the density of states (DOS) developed by two of the authors (N.F. and Y. M.). The library provides all necessary functions for the use of the PEM and its truncated…
The meshless/meshfree radial basis function (RBF) method is a powerful technique for interpolating scattered data. But, solving large RBF interpolation problems without fast summation methods is computationally expensive. For RBF…
The direct method is one of the most important algorithms for solving linear systems of equations, with LU decomposition comprising a significant portion of its computation time. This study explores strategies to accelerate complex LU…