Computing a Sparse Basis for the Null Space
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- An algorithm to compute a sparse basis of the null space
- Large sparse numerical optimization
- On computational procedures for the force method
- Some Extensions of an Algorithm for Sparse Linear Least Squares Problems
- Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
- The Null Space Problem I. Complexity
Cited in
(32)- 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
- An application of the Dulmage-Mendelsohn decomposition to sparse null space bases of full row rank matrices
- A Dimensional Reduction Algorithm and Software for Acyclically Dependent Constraints
- A new four-node quadrilateral plate bending element for highly sparse and banded flexibility matrices
- Damage identification of truss structures based on force method
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Cardinality minimization, constraints, and regularization: a survey
- The Sparse Basis Problem and Multilinear Algebra
- Sparsity and nullity: paradigms for analysis dictionary learning
- Sparse self-stress matrices for the finite element force method
- On the Computation of Null Spaces of Sparse Rectangular Matrices
- An orthogonal self-stress matrix for efficient analysis of cyclically symmetric space truss structures via force method
- 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
- An algorithm to compute a sparse basis of the null space
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- scientific article; zbMATH DE number 3949599 (Why is no real title available?)
- Sequential hierarchical least-squares programming for prioritized non-linear optimal control
- Efficient finite element analysis of models comprised of higher order triangular elements
- An efficient graph theoretical method for plate bending finite element analysis via force method
- Structural variation theorems extended to integrated force method for the analysis of skeletal structures
- Separators and structure prediction in sparse orthogonal factorization
- Computing the null space of finite element problems
- A Symbolic Approach to Compute a Null-Space Basis in the Projection Method
- A constrained least-squares approach to the rapid reanalysis of structures
- An efficient algorithm for sparse null space basis problem using ABS methods
- Computing minimal nullspace bases
- Efficient finite element analysis using graph-theoretical force method; rectangular plane stress and plane strain Lagrange family elements
- A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time
- Sparse null basis computations in structural optimization
This page was built for publication: Computing a Sparse Basis for the Null Space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3774827)
