Abstract
In this paper we consider the systematic use of block elimination in solving sparse symmetric positive definite systems of equations that arise in the application of finite element methods to two dimensional elliptic and parabolic problems. Given such an N by N system of equations, it has been shown by Rose* that applying block elimination to r < N of the unknowns is equivalent computationally to permuting the system so that the r unknowns appear first, and then performing the first r steps of the Cholesky or LDLT factorization algorithms. Thus, our judicious application of block elimination can be interpreted as an efficient ordering of the equations for the ordinary step by step elimination procedure; indeed, it is convenient in the sequel to discuss orderings rather than successive applications of block elimination. However, in practice, storage management may make actual block elimination desirable.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1972 Plenum Press, New York
About this chapter
Cite this chapter
George, J.A. (1972). Block Elimination on Finite Element Systems of Equations. In: Rose, D.J., Willoughby, R.A. (eds) Sparse Matrices and their Applications. The IBM Research Symposia Series. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-8675-3_9
Download citation
DOI: https://doi.org/10.1007/978-1-4615-8675-3_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4615-8677-7
Online ISBN: 978-1-4615-8675-3
eBook Packages: Springer Book Archive