Gaussian elimination for sparse matrices: an introduction

Abstract

Abstract This chapter provides an introduction to the use of Gaussian elimination for solving sets of linear equations that are sparse. We examine the three principle phases of most computer programs for this task: ANALYSE, FACTORIZE, and SOLVE. We stress the importance of acceptable overheads and of numerical stability, but are not concerned with algorithmic or implementation details which are the subjects of later chapters.