Computing a Sparse Basis for the Null Space

DOI10.1137/0608037zbMath0635.65037OpenAlexW2099851320MaRDI QIDQ3774827

John R. Gilbert, Michael T. Heath

Publication date: 1987

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

Full work available at URL: https://hdl.handle.net/1813/6570

zbMATH Keywords

numerical resultsbipartite graphmatchingnull spacerectangular matrixforce methodbanded null basesfinite element structures

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Random graphs (graph-theoretic aspects) (05C80) Theory of matrix inversion and generalized inverses (15A09) Finite element methods applied to problems in solid mechanics (74S05)

Related Items (20)

A new four-node quadrilateral plate bending element for highly sparse and banded flexibility matrices ⋮ Matrix sparsification and the sparse null space problem ⋮ Sparsity and Nullity: Paradigms for Analysis Dictionary Learning ⋮ Separators and structure prediction in sparse orthogonal factorization ⋮ A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block ⋮ A constrained least-squares approach to the rapid reanalysis of structures ⋮ Sparse null basis computations in structural optimization ⋮ Efficient finite element analysis of models comprised of higher order triangular elements ⋮ A fresh CP look at mixed-binary QPs: new formulations and relaxations ⋮ An orthogonal self-stress matrix for efficient analysis of cyclically symmetric space truss structures via force method ⋮ An efficient algorithm for sparse null space basis problem using ABS methods ⋮ The Null Space Problem II. Algorithms ⋮ Sparse self-stress matrices for the finite element force method ⋮ Computing the null space of finite element problems ⋮ Efficient finite element analysis using graph-theoretical force method; rectangular plane stress and plane strain Lagrange family elements ⋮ Damage Identification of Truss Structures Based on Force Method ⋮ A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Structural variation theorems extended to integrated force method for the analysis of skeletal structures ⋮ An efficient graph theoretical method for plate bending finite element analysis via force method

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large sparse numerical optimization
• An algorithm to compute a sparse basis of the null space
• On computational procedures for the force method
• Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
• The Null Space Problem I. Complexity
• Some Extensions of an Algorithm for Sparse Linear Least Squares Problems

This page was built for publication: Computing a Sparse Basis for the Null Space