Description: In large-scale optimization problems, different vectors and matrices are typically sparse, i.e. only very few elements are non-zero. Typically vectors with thousands of elements may contain only about 4-6 non-zeroes, on average. Such vectors can be stored as normal unpacked vectors (such as DVector class). Often sparse vectors can be stored more efficiently as packed vectors, where only the index and value of the non-zero elements are stored in an array.
To Search:
File list (Check if you may need any files):
wang yibing EOS project
.......................\DVector.h
.......................\EOS1 Implement three versions of the inner product between vectors.doc
.......................\IProd.cpp
.......................\IProd.h
Download