An application of the Dulmage-Mendelsohn decomposition to sparse null space bases of full row rank matrices

MaRDI QIDQ4897827zbMATH OpenFDO

Authors M. Khorramizadeh

Publication date 28 December 2012

Full work available at URL http://www.m-hikari.com/imf/imf-2012/49-52-2012/index.html

zbMATH Keywords

algorithmfull row rank matrixpivot selection criterionrank reducing algorithmsparse null space basis

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• The Null Space Problem II. Algorithms
• An efficient algorithm for sparse null space basis problem using ABS methods
• An algorithm to compute a sparse basis of the null space
• Computing a Sparse Basis for the Null Space
• On the Computation of Null Spaces of Sparse Rectangular Matrices

Cited in

(6)

• Rank and null space calculations using matrix decomposition without column interchanges
• An efficient algorithm for sparse null space basis problem using ABS methods
• Towards a better integration of modelers and black box constraint solvers within the product design process
• An efficient algorithm for computing the generalized null space decomposition
• Prestructuring sparse matrices with dense rows and columns via null space methods.
• Combinatorial algorithms for computing column space bases that have sparse inverses

Describes a project that uses

Uses Software

• UMFPACK
• CSparse

This page was built for publication: An application of the Dulmage-Mendelsohn decomposition to sparse null space bases of full row rank matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4897827)