A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On low-complexity approximation of matrices
1994
Linear Algebra and its Applications
The operation of multiplication of a vector by a matrix can be represented by a computational scheme (or model) that acts sequentially on the entries of the vector. The number of intermediate quantities ("states") that are needed in the computations is a measure of the complexity of the model. If that complexity is low, then not only 1.
doi:10.1016/0024-3795(94)90383-2
fatcat:357qwhbo5vhcvm2ayzelgxmqmu