Computing a sparse basis for the null space

Computing the block triangular form of a sparse matrix

ACM Transactions on Mathematical Software (TOMS)

A Preconditioned Conjugate Gradient Approach to Linear Equality Constrained Minimization

Computational Optimization and Applications

Efficient finite element analysis by graph-theoretical force method

Finite Elements in Analysis and Design

Efficient finite element analysis by graph-theoretical force method; triangular and rectangular plate bending elements

Finite Elements in Analysis and Design

Efficient force method for the analysis of finite element models comprising of triangular elements using ant colony optimization

Finite Elements in Analysis and Design

Matrix sparsification and the sparse null space problem

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

Efficient finite element analysis using graph-theoretical force method with brick elements

Finite Elements in Analysis and Design

An algebraic model for parameterized shape editing

ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings

An efficient algorithm for sparse null space basis problem using ABS methods

Numerical Algorithms

Algorithm 933: Reliable calculation of numerical rank, null space bases, pseudoinverse solutions, and basic solutions using suitesparseQR

ACM Transactions on Mathematical Software (TOMS)

Efficient finite element analysis using graph-theoretical force method; hexahedron elements

Computers and Structures