Quantitative Analysis
Parallel Processing
Numerical Analysis
C++ Multithreading
Python for Excel
Python Utilities
Services
Author

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.
a. Analytical preconditioner derived from asymptotic decomposition in time.
b. Diagonal preconditioner.
c. Symmetrization and symmetric preconditioning.
d. Reduction to well conditioned form.
e. Analytical preconditioner derived from inversion of Black equation.
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.
Downloads. Index. Contents.

Preconditioner for Black equation in case q=1.


he matrix $Q$ of the summary ( Reduction to system of linear algebraic equations for q=1 ) comes from $L_{2}$ -decomposition of second derivative with respect to an $L_{2}$ -normalized basis. Second derivative is unbounded in $L_{2}$ . Not surprisingly, the matrix $Q$ has a very large matrix norm. In addition, the term $x^{2}$ is small on one side of the interval $\left[ A,B\right] $ and large on another. For this reason the matrix $Q$ also has a very high condition number. The presence of matrix $G$ does not make much difference because it has a relatively small matrix norm. Hence, unless $\Delta t_{n}$ is very small, we cannot efficiently solve the equation MATH of the summary ( Reduction to system of linear algebraic equations for q=1 ).

We now present technique for removing this difficulty.




a. Analytical preconditioner derived from asymptotic decomposition in time.
b. Diagonal preconditioner.
c. Symmetrization and symmetric preconditioning.
d. Reduction to well conditioned form.
e. Analytical preconditioner derived from inversion of Black equation.

Downloads. Index. Contents.


















Copyright 2007