HLIBpro
3.0
|
ACA with full pivot search (complexity: O(n²)) More...
#include <TLowRankApx.hh>
Additional Inherited Members | |
Public Member Functions inherited from TACA< T_value > | |
virtual std::unique_ptr< TMatrix< value_t > > | build (const TBlockCluster *cl, const TTruncAcc &acc) const |
virtual std::unique_ptr< TMatrix< value_t > > | build (const TBlockIndexSet &block_is, const TTruncAcc &acc) const |
virtual bool | has_statistics () const |
indicate if algorithm provides statistics | |
Full ACA tests <em>all</em> matrix coefficients in the search for the best cross. This results in a guaranteed approximation within the given accuracy. However, the costs are now quadratic in the size of the block.