Finding nonoverlapping substructures of a sparse matrix

MaRDI QIDQ871156zbMATH OpenFDO

Authors Ali Pinar, Virginia Vassilevska Williams

Publication date 16 March 2007

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/128025, http://etna.mcs.kent.edu/vol.21.2005/pp107-124.dir/pp107-124.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

sparse matricesapproximation algorithmshigh-performance computingindependent setsmemory performancememory-efficient date structuresNT-completeness

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 897453
• Finding a Sparse Vector in a Subspace: Linear Sparsity Using Alternating Directions
• Subset selection in sparse matrices
• Submatrices with nonuniformly selected random supports and insights into sparse approximation
• Detection of a sparse submatrix of a high-dimensional noisy matrix
• Matrix sparsification and nested dissection over arbitrary fields
• Finding the spectral radius of a large sparse non-negative matrix
• The consecutive ones submatrix problem for sparse matrices

Cited in

(1)

• Approximations for the general block distribution of a matrix

Describes a project that uses

Uses Software

• Sparsity

This page was built for publication: Finding nonoverlapping substructures of a sparse matrix

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