# Fast computation in adaptive tree approximation

@article{Binev2004FastCI, title={Fast computation in adaptive tree approximation}, author={P. Binev and R. DeVore}, journal={Numerische Mathematik}, year={2004}, volume={97}, pages={193-217} }

Summary.Adaptive methods of approximation arise in many settings including numerical methods for PDEs and image processing. They can usually be described by a tree which records the adaptive decisions. This paper is concerned with the fast computation of near optimal trees based on n adaptive decisions. The best tree based on n adaptive decisions could be found by examining all such possibilities. However, this is exponential in n and could be numerically prohibitive. The main result of this… CONTINUE READING

99 Citations

Adaptive methods for boundary integral equations: Complexity and convergence estimates

- Mathematics, Computer Science
- 2007

- 41
- Highly Influenced
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-2 OF 2 REFERENCES