An algorithm to compute a sparse basis of the null space

DOI10.1007/BF01389453zbMath0548.65024OpenAlexW2055973184MaRDI QIDQ799342

M. Lawo, Robert J. Plemmons, Ikuyo Kaneko, Michael W. Berry, Robert C. Ward, Michael T. Heath

Publication date: 1985

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133047

zbMATH Keywords

plane stressplate bendingGaussian eliminationstructural analysisill-conditioned problemsorthogonal factorizationGivens rotationsforce methodbanded basis matrixmixed finite element problemsnull space methodsTest resultsturnback algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Finite element methods applied to problems in solid mechanics (74S05)

Related Items

Algorithms and experiments for structural mechanics on high-performance architectures, The Dual Variable Method for the Solution of Compressible Fluid Flow Problems, Matrix sparsification and the sparse null space problem, The derivation of minimal support basis functions for the discrete divergence operator, 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, The Null Space Problem I. Complexity, On the computation of multi-dimensional solution manifolds of parametrized equations, A Parallel Block Iterative Scheme Applied to Computations in Structural Analysis, A direct flexibility method, Computing a Sparse Basis for the Null Space, An efficient algorithm for sparse null space basis problem using ABS methods, Canonical bases in linear programming, The Null Space Problem II. Algorithms, Sparse self-stress matrices for the finite element force method, Construction of null bases for the divergence operator associated with incompressible Navier-Stokes equations, MANPAK: A set of algorithms for computations on implicitly defined manifolds, 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, Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999, Dedication to Robert J. Plemmons, Iterative solution of Navier-Stokes dual variable difference equations, The dual variable method for solving fluid flow difference equations on Delaunay triangulations, Order-reducing conjugate gradients versus block AOR for constrained least-squares problems

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of sparse linear least squares problems using Givens rotations
• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
• Minimum norm solutions to linear elastic analysis problems
• On computational procedures for the force method
• Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
• Numerical Solution of Navier–Stokes Problems by the Dual Variable Method
• Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage