Fast matrix rank algorithms and applications
From MaRDI portal
Publication:5395727
DOI10.1145/2528404zbMath1281.90039arXiv1203.6705OpenAlexW2004895252MaRDI QIDQ5395727
Ho Yee Cheung, Lap Chi Lau, Tsz Chiu Kwok
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.6705
Symbolic computation and algebraic computation (68W30) Combinatorial optimization (90C27) Randomized algorithms (68W20) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items
Observability and reconstructibility of bounded cellular automata, Fast computation of the rank profile matrix and the generalized Bruhat decomposition, Clustering, multicollinearity, and singular vectors, Finite-horizon Gaussianity-preserving event-based sensor scheduling in Kalman filter applications, Rank-width: algorithmic and structural results, Generalization of the subset sum problem and cubic forms, Fast randomized numerical rank estimation for numerically low-rank matrices, Length function and simultaneous triangularization of matrix pairs, Computing well-covered vector spaces of graphs using modular decomposition, On the minimum number of general or dedicated controllers required for system controllability, Elimination-based certificates for triangular equivalence and rank profiles, Algebraic Algorithms for Linear Matroid Parity Problems, Exact and approximation algorithms for weighted matroid intersection, Estimating Leverage Scores via Rank Revealing Methods and Randomization, Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm, An efficient algorithm for 1-dimensional (Persistent) path homology
