Fast matrix rank algorithms and applications
From MaRDI portal
Recommendations
Cited in
(18)- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- Accelerating with rank-one updates
- Dynamic matrix rank with partial lookahead
- A relaxed algorithm for online matrix inversion
- Fast matrix computations for pairwise and columnwise commute times and Katz scores
- Dynamic matrix rank with partial lookahead
- Dynamic Normal Forms and Dynamic Characteristic Polynomial
- Dynamic Matrix Rank
- A New Algorithm for Computing the Rank of a Matrix
- Fast deterministic algorithms for matrix completion problems
- Fast deterministic algorithms for matrix completion problems
- Fast matrix rank algorithms and applications
- Generating a \(d\)-dimensional linear subspace efficiently
- The approximate rank of a matrix and its algorithmic applications
- Parallel output-sensitive algorithms for combinatorial and linear algebra problems
- Dynamic normal forms and dynamic characteristic polynomial
- Dynamic matrix rank
This page was built for publication: Fast matrix rank algorithms and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5415500)