Related papers: A Directional Equispaced interpolation-based Fast …
We consider fast kernel summations in high dimensions: given a large set of points in $d$ dimensions (with $d \gg 3$) and a pair-potential function (the {\em kernel} function), we compute a weighted sum of all pairwise kernel interactions…
We present teraflop-scale calculations of biomolecular electrostatics enabled by the combination of algorithmic and hardware acceleration. The algorithmic acceleration is achieved with the fast multipole method (FMM) in conjunction with a…
Faster-than-Nyquist non-orthogonal frequency-division multiplexing (FTN-NOFDM) is robust against the steep frequency roll-off by saving signal bandwidth. Among the FTN-NOFDM techniques, the non-orthogonal matrix precoding (NOM-p) based FTN…
In this paper we propose a new stable and accurate approximation technique which is extremely effective for interpolating large scattered data sets. The Partition of Unity (PU) method is performed considering Radial Basis Functions (RBFs)…
This work presents a multi-layered methodology for efficiently accelerating multimodal foundation models (MFMs). It combines hardware and software co-design of transformer blocks with an optimization pipeline that reduces computational and…
Bit-interleaved coded modulation with iterative decoding (BICM-ID) offers very good error performance over additive white Gaussian noise (AWGN) and fading channels if it uses a wisely designed signal mapping. Further, error performance of…
We developed fast direct solver for 3D Helmholtz and Maxwell equations in layered medium. The algorithm is based on the ideas of cyclic reduction for separable matrices. For the grids with major uniform part (within the survey domain in the…
A scheme for rapidly and accurately computing solutions to boundary integral equations (BIEs) on rotationally symmetric surfaces in three dimensions is presented. The scheme uses the Fourier transform to reduce the original BIE defined on a…
Discrete Cosine Transform (DCT) can be used instead of conventional Discrete Fourier Transform (DFT) for the Orthogonal Frequency Division Multiplexing (OFDM) construction, which offers many advantages. In this paper, the…
Computing accurate periodic responses in strongly nonlinear or even non-smooth vibration systems remains a fundamental challenge in nonlinear dynamics. Existing numerical methods, such as the Harmonic Balance Method (HBM) and the Shooting…
This work introduces a kernel-independent, multilevel, adaptive algorithm for efficiently evaluating a discrete convolution kernel with a given source distribution. The method is based on linear algebraic tools such as low rank…
Multimodal recommendation aims to enhance user preference modeling by leveraging rich item content such as images and text. Yet dominant systems fuse modalities in the spatial domain, obscuring the frequency structure of signals and…
In this paper, a novel class of exponential Fourier collocation methods (EFCMs) is presented for solving systems of first-order ordinary differential equations. These so-called exponential Fourier collocation methods are based on the…
Building on previous research on frequency allocation optimization for superconducting circuit quantum processors, this work incorporates several new techniques to improve overall solution quality. New features include tightening…
The present contribution aims at developing a non-overlapping Domain Decomposition (DD) approach to the solution of acoustic wave propagation boundary value problems based on the Helmholtz equation, on both bounded and unbounded domains.…
In theory, diffusion curves promise complex color gradations for infinite-resolution vector graphics. In practice, existing realizations suffer from poor scaling, discretization artifacts, or insufficient support for rich boundary…
We propose an iterative solution method for the 3D high-frequency Helmholtz equation that exploits a contour integral formulation of spectral projectors. In this framework, the solution in certain invariant subspaces is approximated by…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
This work proposes a mixed learning-based and optimization-based approach to the weighted-sum-rates beamforming problem in a multiple-input multiple-output (MIMO) wireless network. The conventional methods, i.e., the fractional programming…
We present a new method to solve the nuclear density functional theory (DFT) equations using a two-center harmonic oscillator for Skyrme-like functionals, incorporating pairing and Coulomb interactions. The goal is to efficiently determine…