B. David Saunders, Bryan Youse
Abstract
For the problem of computing the rank of a matrix we have a complexity result and a practical implementation, both of which apply best to the case of a matrix whose rank is substantially smaller than its order.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For the problem of computing the rank of a matrix we have a complexity result and a practical implementation, both of which apply best to the case of a matrix whose rank is substantially smaller than its order.
Key concepts: Rank (graph theory), Matrix (chemical analysis), Computer science, Low-rank approximation, Matrix algebra, Computational complexity theory, Algorithm, Theoretical computer science