| Abstract: | Finding the general solution of a singular system of linear equations requires computing a particular solution and a basis of the null space of the corresponding singular matrix. In this paper, we consider the case where the singular matrix is large and sparse, and the application calls for a direct solution method. We highlight the dependence of straightforward factorization algorithms on an arbitrary constant that can influence the correctness of the computed solution, and describe a family of improved direct solution methods that alleviate this problem. For structural mechanics applications, we propose a hybrid geometric–algebraic method that is more robust than the purely algebraic direct methods that are currently used for solving singular sparse systems of equations. We illustrate the potential of our proposed solution algorithms with examples from structural mechanics and domain-decomposition-based iterative solvers. © 1998 John Wiley & Sons, Ltd. |
