Partial Elimination
Alan Jennings, Ghulam Mohammad Malik · IMA Journal of Applied Mathematics · 1977
The partial elimination method of Tuff & Jennings is considered for the solution of large sparse sets of simultaneous equations in which the coefficient matrix is symmetric and positive definite. Proposals are made Jo modify the diagonal elements involved in the elimination part of the algorithm to ensure stability. Also the iterative part of the algorithm is converted from an accelerated stationary process to a conjugate gradient technique. Some numerical tests indicate that the method is more efficient than the standard conjugate gradient method, although more storage space is required for computer implementation.