An algorithm to compute a sparse basis of the null space
DOI10.1007/BF01389453zbMATH Open0548.65024OpenAlexW2055973184MaRDI QIDQ799342FDOQ799342
Authors: M. Lawo, Michael W. Berry, Michael T. Heath, Ikuyo Kaneko, Robert J. Plemmons, Robert C. Ward 
Publication date: 1985
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133047
Recommendations
Gaussian eliminationill-conditioned problemsplane stressstructural analysisorthogonal factorizationforce methodGivens rotationsplate bendingbanded basis matrixmixed finite element problemsnull space methodsTest resultsturnback algorithm
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Finite element methods applied to problems in solid mechanics (74S05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On computational procedures for the force method
- Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
- Solution of sparse linear least squares problems using Givens rotations
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
- Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
- Minimum norm solutions to linear elastic analysis problems
- Numerical Solution of Navier–Stokes Problems by the Dual Variable Method
- Title not available (Why is that?)
Cited In (40)
- Continuous numerical solutions for a base of null space of matrix functions whose ranks are not full
- A direct flexibility method
- Substructuring Methods for Computing the Nullspace of Equilibrium Matrices
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- Nested Dissection for Sparse Nullspace Bases
- Canonical bases in linear programming
- An application of the Dulmage-Mendelsohn decomposition to sparse null space bases of full row rank matrices
- Cardinality minimization, constraints, and regularization: a survey
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- The Null Space Problem I. Complexity
- Computing a Sparse Basis for the Null Space
- A fast randomized algorithm for computing an approximate null space
- Null space algorithm and spanning trees in solving Darcy's equation
- The derivation of minimal support basis functions for the discrete divergence operator
- Sparse self-stress matrices for the finite element force method
- On the Computation of Null Spaces of Sparse Rectangular Matrices
- On the computation of multi-dimensional solution manifolds of parametrized equations
- The Dual Variable Method for the Solution of Compressible Fluid Flow Problems
- The Null Space Problem II. Algorithms
- Block computation and representation of a sparse nullspace basis of a rectangular matrix
- Combinatorial algorithms for computing column space bases that have sparse inverses
- MANPAK: A set of algorithms for computations on implicitly defined manifolds
- Sequential hierarchical least-squares programming for prioritized non-linear optimal control
- Title not available (Why is that?)
- A note on the computation of an orthonormal basis for the null space of a matrix
- Algorithms and experiments for structural mechanics on high-performance architectures
- Properties of a representation of a basis for the null space
- The dual variable method for solving fluid flow difference equations on Delaunay triangulations
- Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999
- A Symbolic Approach to Compute a Null-Space Basis in the Projection Method
- A constrained least-squares approach to the rapid reanalysis of structures
- Iterative solution of Navier-Stokes dual variable difference equations
- Computing minimal nullspace bases
- Order-reducing conjugate gradients versus block AOR for constrained least-squares problems
- An efficient algorithm for sparse null space basis problem using ABS methods
- Construction of null bases for the divergence operator associated with incompressible Navier-Stokes equations
- A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time
- A Parallel Block Iterative Scheme Applied to Computations in Structural Analysis
- Dedication to Robert J. Plemmons
- Sparse null basis computations in structural optimization
Uses Software
This page was built for publication: An algorithm to compute a sparse basis of the null space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799342)
