Abstract
It is well known that the adaptive algorithm is simple and easy to program but the results are not fully competitive with other nonlinear methods such as free knot spline approximation. We modify the algorithm to take full advantages of nonlinear approximation. The new algorithms have the same approximation order as other nonlinear methods, which is proved by characterizing their approximation spaces. One of our algorithms is implemented on the computer, with numerical results illustrated by figures and tables.
| Original language | English |
|---|---|
| Pages (from-to) | 1013-1033 |
| Number of pages | 21 |
| Journal | SIAM Journal on Numerical Analysis |
| Volume | 38 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2001 |
Scopus Subject Areas
- Numerical Analysis
- Computational Mathematics
- Applied Mathematics
Keywords
- Adaptive algorithms
- Approximation spaces
- Besov spaces
- Data reduction
- Degree of approximation
- Modulus of smoothness
- Nonlinear approximation
- Piecewise polynomials
- Splines