A New Algorithm for Computing the Rank of a Matrix

DOI10.2307/2322395MaRDI QIDQ3817515zbMATH OpenOpenAlexFDO

Authors Larry J. Gerstein

Publication date 1988

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2322395

zbMATH Keywords

integer matricesrank algorithm

Mathematics Subject Classification ID

Matrices of integers (15B36) Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• A new method of calculating the rank of the matrix.
• A new algorithm for computing eigenpairs of matrices
• Fast matrix rank algorithms and applications
• Fast matrix rank algorithms and applications
• The approximate rank of a matrix and its algorithmic applications
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• The numerical rank of a matrix and its applications
• Publication:4203703
• New lower bounds for the rank of matrix multiplication

Cited in

(11)

• Rational elimination algorithm and applications
• scientific article; zbMATH DE number 97727 (Why is no real title available?)
• Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
• Rank and null space calculations using matrix decomposition without column interchanges
• On a rank of a matrix of dimension k
• A new method of calculating the rank of the matrix.
• The approximate rank of a matrix and its algorithmic applications
• Effective lower bounds on the matrix rank and their applications
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• Generating a \(d\)-dimensional linear subspace efficiently
• scientific article; zbMATH DE number 66967 (Why is no real title available?)

This page was built for publication: A New Algorithm for Computing the Rank of a Matrix

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