A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
SIAM Journal on Matrix Analysis and Applications
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
ACM Transactions on Mathematical Software (TOMS)
Salinas: a scalable software for high-performance structural and solid mechanics simulations
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
International Journal of High Performance Computing Applications
Hi-index | 0.00 |
Most of researches for large-scale parallel structural analysis have focused on iterative solution methods since direct solution methods generally have many difficulties and disadvantages for large-scale problems. However, due to the numerical robustness of direct methods that guarantees the solution to be obtained within estimated time, direct methods are much more desirable for general application of large-scale structural analysis, if the difficulties and disadvantages can be overcome. In this research, we propose the domain-wise multifrontal solver as an efficient direct solver that can overcome most of these difficulties and disadvantages. By using our own structural analysis code IPSAP which uses the proposed solver, we can solve the largest problem ever solved by direct solvers and can sustain 191 Gflop/s with 256 CPUs on our self-made cluster system, Pegasus. By implementing the block Lanczos algorithm using our solver, IPSAP can solve eigen problems with 7 millions of DOFs within one hour.