.png){kind=icon}
Return
Parallelization of the Exponential Time Differencing Method for Solving Diffuse-Interface Models
.png){kind=icon}
OA
AI
DOI：10.1007/s10915-025-02960-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This study tackles the computational bottleneck of matrix exponential calculations in Exponential Time Differencing (ETD) methods through a novel parallel algorithm that synergizes MPI and OpenMP technologies. By partitioning the matrix among MPI processes and leveraging OpenMP for localized matrix multiplication, our approach significantly enhances the ability to address diffuse-interface problems at previously unattainable mesh sizes for serial computation for general boundary conditions. Through comprehensive performance evaluations, we demonstrate the algorithm’s substantial improvements in efficiency and speed, showcasing a major leap forward in the computational capabilities of ETD methods for complex applications.
Keywords:
Diffuse interface model
Exponential time differencing methods
Parallel computation
Journal
IF:
3.3
Papers:
709
Citations:
9.6K
Organization
Cited Papers
ShareSave
ShareSaveNineteen dubious ways to compute the exponential of a matrix, twenty-five years later.png)
SIAM REVIEW
SIAM REVIEWIF6.1
PREAI
ShareSaveShareSave
View more