Let A be a real m× 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 …

Computing the null space of a sparse matrix is an important part of some computations, such
as embeddings and parametrization of meshes. We propose an efficient and reliable …

The null space problem is that of finding a sparsest basis for the null space (null basis) of an
underdetermined matrix. This problem was shown to be NP-hard in Coleman and Pothen …

SRRT is a Fortran program to calculate an approximate orthonomral basis fr a dominant
invariant subspace of a real matrix A by the method of simultaneous iteration. Specifically …

A new algorithm for reducing the bandwidth and profile of a sparse matrix is described.
Extensive testing on finite element matrices indicates that the algorithm typically produces …

We study the computation of sparse null bases of equilibrium matrices in the context of the
force method in structural optimization. Two classes of structural problems are considered …

Assume that the matrix A is large and sparse. We shall not make assumptions on any
particular structure of the elements of A. If such information is available (if e~ g. A is positive …

Publisher Summary This chapter presents the analysis and applications of sparse matrix
algorithms in the finite element method. For the generally sparse matrix, it is customary to …

Page 1 Lecture Notes in Mathematics VA Barker (Ed.) Sparse Matrix Techniques 572
Copenhagen, Denmark 1976 Springer Page 2 Lecture Notes in Mathematics Edited by A. Dold …

ABSTRACT SRRIT is a FORTRAN program to calculate an approximate orthonormal basis
for a dominant invariant subspace of a real matrix A by the method of simultaneous iteration …