A computational technique‐for the efficient handling of large matrices

Abstract

It is well known that the finite element method leads to large square symmetric matrices which are highly banded. Even if only the half bandwidth is stored it is easy to saturate the computer storage; this is because the half bandwidth contains a large amount of zeros. This paper discusses an alternative approach where a small rectangular section of the full bandwidth is stored, this method leading to a significant reduction in storage requirements.