Decomposing imaginary-time Feynman diagrams using separable basis functions: Anderson impurity model strong-coupling expansion
We present a deterministic algorithm for the efficient evaluation of imaginary-time diagrams
based on the recently introduced discrete Lehmann representation (DLR) of imaginary-time …
based on the recently introduced discrete Lehmann representation (DLR) of imaginary-time …
A dual-space multilevel kernel-splitting framework for discrete and continuous convolution
S Jiang, L Greengard - arXiv preprint arXiv:2308.00292, 2023 - arxiv.org
We introduce a new class of multilevel, adaptive, dual-space methods for computing fast
convolutional transforms. These methods can be applied to a broad class of kernels, from …
convolutional transforms. These methods can be applied to a broad class of kernels, from …
Fast algorithm for quasi-2D Coulomb systems
Quasi-2D Coulomb systems are of fundamental importance and have attracted much
attention in many areas nowadays. Their reduced symmetry gives rise to interesting …
attention in many areas nowadays. Their reduced symmetry gives rise to interesting …
[HTML][HTML] A strategy for fast evaluation of nonviscously damped systems with arbitrary kernels
TL Chang, CL Lee - Mechanical Systems and Signal Processing, 2024 - Elsevier
In this work, a fast algorithm to evaluate the dynamic response of nonviscously damped
systems with arbitrary distributions of damping characterised by arbitrary kernel functions …
systems with arbitrary distributions of damping characterised by arbitrary kernel functions …
[PDF][PDF] Aproksimasi Fungsi Kontinu Terbatas Dengan Konvolusi
E Herlinawati - Jurnal Matematika Sains Dan Teknologi, 2020 - jurnal.ut.ac.id
Konvolusi adalah suatu operasi pada dua fungsi dan menghasilkan suatu fungsi baru yang
dapat dipandang sebagai versi modifikasi dari salah satu fungsi aslinya. Operasi konvolusi …
dapat dipandang sebagai versi modifikasi dari salah satu fungsi aslinya. Operasi konvolusi …