loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Papers
Solving Large Sparse Linear Systems in End-to-end Accelerator Structure Simulations
Santa Fe, New Mexico
April 26-April 30
ISBN: 0-7695-2132-0
Lie-Quan Lee, Stanford Linear Accelerator Center
Lixin Ge, Stanford Linear Accelerator Center
Marc Kowalski, Stanford Linear Accelerator Center
Zenghai Li, Stanford Linear Accelerator Center
Cho-Kuen Ng, Stanford Linear Accelerator Center
Greg Schussman, Stanford Linear Accelerator Center
Michael Wolf, Stanford Linear Accelerator Center
Kwok Ko, Stanford Linear Accelerator Center
This paper presents a case study of solving very large sparse linear systems in end-to-end accelerator structure simulations. Both direct solvers and iterative solvers are investigated. A parallel multilevel preconditioner based on hierarchical finite element basis functions is considered and has been implemented to accelerate the convergence of iterative solvers. A linear system with matrix size 93,147,736 and with 3,964,961,944 non-zeros from 3D electromagnetic finite element discretization has been solved in less than 8 minutes with 1024 CPUs on the NERSC IBM SP. The resource utilization as well as the application performance for these solvers is discussed.
Citation:
Lie-Quan Lee, Lixin Ge, Marc Kowalski, Zenghai Li, Cho-Kuen Ng, Greg Schussman, Michael Wolf, Kwok Ko, "Solving Large Sparse Linear Systems in End-to-end Accelerator Structure Simulations," ipdps, vol. 1, pp.8a, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Papers, 2004
Usage of this product signifies your acceptance of the Terms of Use.