Premium
The parallel computation of the smallest eigenpair of an acoustic problem with damping
Author(s) -
Van Gijzen Martin B.
Publication year - 1999
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/(sici)1097-0207(19990630)45:6<765::aid-nme607>3.0.co;2-a
Subject(s) - parallelizable manifold , computation , massively parallel , quadratic equation , parallel computing , computer science , scale (ratio) , mathematics , computational science , mathematical optimization , algorithm , physics , geometry , quantum mechanics
Acoustic problems with damping may give rise to large quadratic eigenproblems, which require efficient and parallelizable solution algorithms. This paper describes such an algorithm: the Jacobi–Davidson solution method for quadratic eigenproblems. In particular, it describes its parallelization according to the Bulk Synchronous Programming model, and its implementation on the massively parallel CRAY T3D. Experimental results for a large‐scale acoustic problem show that the method is efficient and parallelizes well, i.e. scales almost linearly up to the maximum number of available processors. Copyright © 1999 John Wiley & Sons, Ltd.