An algorithm to compute a sparse basis of the null space (Q799342): Difference between revisions

Let A be a real \(m\times n\) matrix with full row rank m. In many algorithms in engineering and science, such as the force method in structural analysis, the dual variable method for the Navier-Stokes equations or more generally null space methods in quadratic programming, it is necessary to compute a basis matrix B for the null space of A. Here B is \(n\times r\), \(r=n-m\), of rank r, with \(AB=0\). In many instances A is large and sparse and often banded. The purpose of this paper is to describe and test a variation of a method originally suggested by Topcu and called the turnback algorithm for computing a banded basis matrix B. Two implementations of the algorithm are given, one using Gaussian elimination and the other using orthogonal factorization by Givens rotations. The FORTRAN software was executed on an IBM 3081 mainframe computer with an FPS-164 attached array processor at the Triangle Universities Computing Center near Raleigh, N. C.. Test results on a variety of structural analysis problems including two- and three- dimensional frames, plane stress, plate bending and mixed finite element problems are discussed. These results indicate that both implementations of the algorithm yielded a well-conditioned, banded, basis matrix B when A is well-conditioned. However, the orthogonal implementation yielded a better conditioned B for large, ill-conditioned problems.