On the Computation of Null Spaces of Sparse Rectangular Matrices
From MaRDI portal
Recommendations
- Computing a Sparse Basis for the Null Space
- Block computation and representation of a sparse nullspace basis of a rectangular matrix
- Combinatorial algorithms for computing column space bases that have sparse inverses
- The Null Space Problem II. Algorithms
- An algorithm to compute a sparse basis of the null space
Cited in
(17)- Substructuring Methods for Computing the Nullspace of Equilibrium Matrices
- An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks
- A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
- Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
- 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
- Sparsification of rectangular matrices
- Computing a Sparse Basis for the Null Space
- On the determinant of a sparse 0-1 matrix
- Numerical solution of singular Sylvester equations
- On snapshot-based model reduction under compatibility conditions for a nonlinear flow problem on networks
- Block computation and representation of a sparse nullspace basis of a rectangular matrix
- Combinatorial algorithms for computing column space bases that have sparse inverses
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction
- Inverse iteration for Sylvester operators
- Computing the null space of finite element problems
This page was built for publication: On the Computation of Null Spaces of Sparse Rectangular Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624847)
