.png){kind=icon}
Return
Parallel computing study for the large-scale generalized eigenvalue problems in modal analysis
.png){kind=icon}
PRE
AI
DOI：10.1007/s11433-013-5203-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we study the algorithms and their parallel implementation for solving large-scale generalized eigenvalue problems in modal analysis. Three predominant subspace algorithms, i.e., Krylov-Schur method, implicitly restarted Arnoldi method and Jacobi-Davidson method, are modified with some complementary techniques to make them suitable for modal analysis. Detailed descriptions of the three algorithms are given. Based on these algorithms, a parallel solution procedure is established via the PANDA framework and its associated eigensolvers. Using the solution procedure on a machine equipped with up to 4800 processors, the parallel performance of the three predominant methods is evaluated via numerical experiments with typical engineering structures, where the maximum testing scale attains twenty million degrees of freedom. The speedup curves for different cases are obtained and compared. The results show that the three methods are good for modal analysis in the scale of ten million degrees of freedom with a favorable parallel scalability.
Keywords:
modal analysis
parallel computing
eigenvalue problems
Krylov-Schur method
implicitly restarted Arnoldi method
Jacobi-Davidson method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
S
IF:
7.5
Papers:
3.9K
Citations:
7.4K
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveDistribution of apparent angles on random sections with emphasis on dihedral angle measurements
PREAI
ShareSaveRubber hand illusion, empathy, and schizotypal experiences in terms of self-other representations
PREAI
ShareSave
View more