Nested Dissection for Sparse Nullspace Bases

DOI10.1137/0614054MaRDI QIDQ3136547zbMATH OpenOpenAlexFDO

Authors Julio Michael Stern, Stephen A. Vavasis

Publication date 18 October 1993

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

sparse matrixalgorithmnested dissectionforce methodsparse nullspace basis

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• Computing a Sparse Basis for the Null Space
• Matrix sparsification and nested dissection over arbitrary fields
• An algorithm to compute a sparse basis of the null space
• An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
• An efficient algorithm for computing the generalized null space decomposition
• A sparse effective Nullstellensatz
• On the Computation of Null Spaces of Sparse Rectangular Matrices
• Computing minimal nullspace bases

Cited in

(8)

• Typed Lambda Calculi and Applications
• A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
• How to overcome indetermination and interpenetration in granular systems via nonsmooth contact dynamics. An exploratory investigation
• Block computation and representation of a sparse nullspace basis of a rectangular matrix
• Separators and structure prediction in sparse orthogonal factorization
• An efficient algorithm for sparse null space basis problem using ABS methods
• Computing minimal nullspace bases
• A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time

This page was built for publication: Nested Dissection for Sparse Nullspace Bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136547)