Related papers: Fast distributed phononic band-structure calculati…
We accelerated an {\it ab-initio} QMC electronic structure calculation by using GPGPU. The bottleneck of the calculation for extended solid systems is replaced by CUDA-GPGPU subroutine kernels which build up spline basis set expansions of…
This paper introduces a groundbreaking digital neuromorphic architecture that innovatively integrates Brain Code Unit (BCU) and Fundamental Code Unit (FCU) using mixedsignal design methodologies. Leveraging open-source datasets and the…
We develop a reduced-order operator-learning framework for forward and inverse band-structure design of two-dimensional photonic crystals with binary, pixel-based $p4m$-symmetric unit cells. We construct a POD--DeepONet surrogate for the…
Numerical calculation of modes in dispersive and absorptive systems is performed using the finite element method. The dispersion is tackled in the frame of an extension of Maxwell's equations where auxiliary fields are added to the…
Matrix decompositions are ubiquitous in machine learning, including applications in dimensionality reduction, data compression and deep learning algorithms. Typical solutions for matrix decompositions have polynomial complexity which…
We introduce FastGraph, a novel GPU-optimized k-nearest neighbor algorithm specifically designed to accelerate graph construction in low-dimensional spaces (2-10 dimensions), critical for high-performance graph neural networks. Our method…
We present graphic results with high-levels of abstraction to desribe the basic principles and rules of thumb for acoustic or phononic band-gap engineering. We use these rules for developing an improved machien mount for damping acoustic…
We accelerated an ab-initio molecular QMC calculation by using GPGPU. Only the bottle-neck part of the calculation is replaced by CUDA subroutine and performed on GPU. The performance on a (single core CPU + GPU) is compared with that on a…
Dispersion relation reflects the dependence of wave frequency on its wave vector when the wave passes through certain material. It demonstrates the properties of this material and thus it is critical. However, dispersion relation…
This work provides a proof of concept for the computation of pure gluonic amplitudes in quantum chromodynamics (QCD) on graphics processing units (GPUs). The implementation relies on the Berends-Giele recursion algorithm and, for the first…
High level programming languages and GPU accelerators are powerful enablers for a wide range of applications. Achieving scalable vertical (within a compute node), horizontal (across compute nodes), and temporal (over different generations…
This paper details the purpose, difficulties, theory, implementation, and results of developing a Fast Fourier Transform (FFT) using the prime factor algorithm on an embedded system. Many applications analyze the frequency content of…
We propose a fast fourth-order cut cell method for solving constant-coefficient elliptic equations in two-dimensional irregular domains. In our methodology, the key to dealing with irregular domains is the poised lattice generation (PLG)…
Model-Based Iterative Reconstruction (MBIR) is important because direct methods, such as Filtered Back-Projection (FBP) can introduce significant noise and artifacts in sparse-angle tomography, especially for time-evolving samples. Although…
Accurate and efficient brain tumor segmentation remains a critical challenge in neuroimaging due to the heterogeneous nature of tumor subregions and the high computational cost of volumetric inference. In this paper, we propose…
Multiple-precision floating-point branch-free algorithms can significantly accelerate multi-component arithmetic implemented by combining hardware-based binary64 and binary32, particularly for triple- and quadruple-precision computations.…
Neural network accelerators with low latency and low energy consumption are desirable for edge computing. To create such accelerators, we propose a design flow for accelerating the extremely low bit-width neural network (ELB-NN) in embedded…
Searching for sources of electromagnetic emission in spectral-line radio astronomy interferometric data is a computationally intensive process. Parallel programming techniques and High Performance Computing hardware may be used to improve…
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…
The problem of fast computation of multivariate kernel density estimation (KDE) is still an open research problem. In our view, the existing solutions do not resolve this matter in a satisfactory way. One of the most elegant and efficient…