In this paper, a detailed description of CG for evaluating eigenvalue problems by minimizing the Rayleigh quotient is presented from both theoretical and computational viewpoints. Three variants of CG together with their asymptotic behaviours and restarted schemes are discussed. In addition, it is s
The parallel computation of the smallest eigenpair of an acoustic problem with damping
β Scribed by Martin B. Van Gijzen
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 95 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
β¦ Synopsis
Acoustic problems with damping may give rise to large quadratic eigenproblems, which require e cient 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 e cient and parallelizes well, i.e. scales almost linearly up to the maximum number of available processors.
π SIMILAR VOLUMES
The application of multigrid techniques to the computation of the static solutions of electromagnetic field problems governed by Laplace's equation is described. This technique is compared with the conventional successive over-relaxation (SOR) method for solving finite difference problems. In contra
Dedicated to Prof. Erwin Stein on the occasion of his 65th birthday
The use of ILU(0) factorization as a preconditioner is quite frequent when solving linear systems of CFD computations. This is because of its efficiency and moderate memory requirements. For a small number of processors, this preconditioner, parallelized through coloring methods, shows little saving