I. Wavelet calculations.
 II. Calculation of approximation spaces in one dimension.
 III. Calculation of approximation spaces in one dimension II.
 IV. One dimensional problems.
 1 Decomposition of payoff function in one dimension. Adaptive multiscaled approximation.
 2 Constructing wavelet basis with Dirichlet boundary conditions.
 3 Accelerated calculation of Gram matrix.
 4 Adapting wavelet basis to arbitrary interval.
 5 Solving one dimensional elliptic PDEs.
 6 Discontinuous Galerkin technique II.
 7 Solving one dimensional Black PDE.
 A. Example Black equation parameters.
 B. Reduction to system of linear algebraic equations for Black PDE.
 C. Adaptive time step for Black PDE.
 D. Localization.
 E. Reduction to system of linear algebraic equations for q=1.
 F. Preconditioner for Black equation in case q=1.
 G. Summary for Black equation in case q=1.
 H. Implementation of Black equation solution.
 8 Solving one dimensional mean reverting equation.
 V. Stochastic optimization in one dimension.
 VI. Scalar product in N-dimensions.
 VII. Wavelet transform of payoff function in N-dimensions.
 VIII. Solving N-dimensional PDEs.

## Localization.

he interval was inserted into the problem ( Example Black problem ) to avoid considering a PDE problem on the entire real line. We constructed a basis of functions with finite support, unsuitable for finite element calculation on unbounded set. We would like to place the numbers to positions according to the rule for some number . The process is given by the SDE We calculate The distribution density of is a symmetric function Thus, we take as a controlling parameter: for a fixed positive number .

The only remaining step is to make sure that the interval is adapted to binary structure of wavelet basis. We choose a scale parameter then

Summary

(Choice of interval) The choice of interval is controlled by two parameters and . The controls width of the interval expressed in numbers of sigma. The controls scale.

We calculate where is the time- position of the process .

The parameter should be taken so that would be comparable to precision of initial approximation of the payoff function, discussed in the section (Decomposition of payoff function in one dimension ). The parameter should be taken to be the minimal number needed to provide the condition ( Sufficiently fine scale 2 ).