The Null Space Problem I. Complexity

DOI10.1137/0607059zbMath0608.65024MaRDI QIDQ3747622

Thomas F. Coleman, Alex Pothen

Publication date: 1986

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0607059

zbMATH Keywords

bipartite graph; matching; greedy algorithm; matroids; null space basis; conformal decomposition

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

An efficient graph theoretical method for plate bending finite element analysis via force method, An efficient graph‐theoretical force method for three‐dimensional finite element analysis, A new four-node quadrilateral plate bending element for highly sparse and banded flexibility matrices, Canonical bases in linear programming, Sparse null basis computations in structural optimization, On the computation of multi-dimensional solution manifolds of parametrized equations, Construction of null bases for the divergence operator associated with incompressible Navier-Stokes equations, A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems, A constrained least-squares approach to the rapid reanalysis of structures, The derivation of minimal support basis functions for the discrete divergence operator, Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic, Efficient graph-theoretical force method for two-dimensional rectangular finite element analysis, Analysis of frames by substructuring technique based on using algebraic and graph methods, Structural variation theorems extended to integrated force method for the analysis of skeletal structures, Computing a Sparse Basis for the Null Space, The Null Space Problem II. Algorithms

Cites Work

• Large sparse numerical optimization
• An algorithm to compute a sparse basis of the null space
• Decomposition of regular matroids
• Algorithms for Generating Fundamental Cycles in a Graph
• Finding a Minimum Circuit in a Graph
• Modules unimodulaires
• The NP-completeness column: An ongoing guide
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item