|
HLIBpro 3.1
|
Computes dense matrix block without approximation. More...
#include <TLowRankApx.hh>
Public Member Functions | |
| virtual std::unique_ptr< TMatrix< value_t > > | build (const TBlockIndexSet &bis, const TTruncAcc &acc) const |
Public Member Functions inherited from TLowRankApx< T_value > | |
| virtual std::unique_ptr< TMatrix< value_t > > | build (const TBlockCluster *bct, const TTruncAcc &acc) const |
| virtual bool | has_statistics () const |
| indicate if algorithm provides statistics | |
Instead of performing approximation for a matrix block, the whole block
is computed and returned as a dense matrix.
This is usually used for debugging or accuracy tests.
|
virtual |
build low rank matrix for block index set bis with rank defined by accuracy acc
Implements TLowRankApx< T_value >.