Fast Computation in Adaptive Tree Approximation

Abstract

Adaptive methods of approximation in many settings include 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 paper is to show that it is possible to find near optimal trees using computations linear in n.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2002
Accession Number
ADA640671

Entities

People

  • Peter Binev
  • Ronald DeVore

Organizations

  • University of South Carolina

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Availability
  • Classification
  • Computations
  • Contracts
  • Image Processing
  • Information Operations
  • Information Processing
  • Instructions
  • Mathematical Analysis
  • Mathematics
  • Monitoring
  • Security
  • South Carolina
  • Standards

Fields of Study

  • Computer science

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Forest Ecology
  • Operations Research