2026-04-27T12:30:11Zhttps://uvadoc.uva.es/oai/request

oai:uvadoc.uva.es:10324/583482023-03-29T19:02:23Zcom_10324_1191com_10324_931com_10324_894col_10324_1379

Sánchez Curto, Julio Chamorro Posada, Pedro 2023 Producción Científica A new approach for the parallel computation of the Laplacian in the Fourier domain is presented. This numerical problem inherits the intrinsic sequencing involved in the calculation of any multidimensional Fast Fourier Transform (FFT) where blocking communications assure that its computation is strictly carried out dimension by dimension. Such data dependency vanishes when one considers the Laplacian as the sum of n independent one-dimensional kernels, so that computation and communication can be naturally overlapped with nonblocking communications. Overlapping is demonstrated to be responsible for the speedup figures we obtain when our approach is compared to state-of-the-art parallel multidimensional FFTs. application/pdf https://uvadoc.uva.es/handle/10324/58348 eng Elsevier 12 Matemáticas 33 Ciencias Tecnológicas The inherent overlapping in the parallel calculation of the Laplacian info:eu-repo/semantics/article TEXT UVaDOC. Repositorio Documental de la Universidad de Valladolid Hispana