Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Science Theses & Dissertations

2001

Parallel algorithms

Articles 1 - 1 of 1

Full-Text Articles in Physical Sciences and Mathematics

New Sequential And Scalable Parallel Algorithms For Incomplete Factor Preconditioning, David A. Hysom Jan 2001

New Sequential And Scalable Parallel Algorithms For Incomplete Factor Preconditioning, David A. Hysom

Computer Science Theses & Dissertations

The solution of large, sparse, linear systems of equations Ax = b is an important kernel, and the dominant term with regard to execution time, in many applications in scientific computing. The large size of the systems of equations being solved currently (millions of unknowns and equations) requires iterative solvers on parallel computers. Preconditioning, which is the process of translating a linear system into a related system that is easier to solve, is widely used to reduce solution time and is sometimes required to ensure convergence. Level-based preconditioning (ILU(ℓ)) has long been used in serial contexts and is widely recognized …