Abstract
Editor's note: Many scientific computing problems, including circuit simulations, rely on efficient lower-upper (LU) decomposition of sparse matrices. Prior studies took advantage of GPUs to parallelize LU decomposition, but they suffer from nontrivial data dependencies. This article presents a new method, called GLU3.0, to accelerate GPU-based sparse LU factorization. -Umit Ogras, Arizona State University.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have