The Null Space Problem II. Algorithms (Q3783422)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4046961
Language Label Description Also known as
default for all languages
No label defined
    English
    The Null Space Problem II. Algorithms
    scientific article; zbMATH DE number 4046961

      Statements

      The Null Space Problem II. Algorithms (English)
      0 references
      0 references
      0 references
      1987
      0 references
      sparse matrices
      0 references
      linear programming
      0 references
      null-space
      0 references
      combinatorial phase
      0 references
      bipartite graph
      0 references
      Numerical results
      0 references
      0 references
      0 references
      [For part I see ibid. 7, 527-537 (1986; Zbl 0608.65024).] Two algorithms are suggested for calculating a sparse basis of the null- space of matrix with full row rank. Each consists of the two phases: first (the combinatorial phase) identifies a minimal dependent set of columns by finding a matching in the bipartite graph of the matrix; second (the numerical, and more time-consuming, phase) calculates nonzero coefficients of the null-vectors from this dependent set. Linear independency is ensured by restricting a basis to be triangular or fundamental (with an identity matrix). Numerical results and experience are presented.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references