next up previous contents
Next: Discrete cosine transform Up: Image processing Previous: Algorithm   Contents


Complexity and speeding up

In this section, we present the techniques that we have used for solving the PDE problems previously seen, and that lead to a theoretical complexity in $ \mathcal{O}(n.\log(n))$ [27]. Several numerical experiments have confirmed this complexity [28,27].


Subsections
Back to home page