a default reduced data implementation which stores a data tree object copying the structure of a Greedy.User.IDetailedData.datatree as returned by the greedy algorithm objects. This is also a DataTree ...

Greedy bases are those bases where the Thresholding Greedy Algorithm (introduced by S. V. Konyagin and V. N. Temlyakov) produces the best possible approximation up to a constant. In 2017, P. M. Berná ...