.. _method-polynomial_chaos-expansion_order-collocation_points-orthogonal_matching_pursuit:

"""""""""""""""""""""""""""
orthogonal_matching_pursuit
"""""""""""""""""""""""""""


Compute the coefficients of a polynomial expansion using orthogonal matching pursuit (OMP)


.. toctree::
   :hidden:
   :maxdepth: 1

   method-polynomial_chaos-expansion_order-collocation_points-orthogonal_matching_pursuit-noise_tolerance


**Specification**

- *Alias:* omp 

- *Arguments:* None


**Child Keywords:**

+-------------------------+--------------------+---------------------+-----------------------------------------------+
| Required/Optional       | Description of     | Dakota Keyword      | Dakota Keyword Description                    |
|                         | Group              |                     |                                               |
+=========================+====================+=====================+===============================================+
| Optional                                     | `noise_tolerance`__ | The noise tolerance used when performing      |
|                                              |                     | cross validation in the presence of noise or  |
|                                              |                     | truncation errors.                            |
+----------------------------------------------+---------------------+-----------------------------------------------+

.. __: method-polynomial_chaos-expansion_order-collocation_points-orthogonal_matching_pursuit-noise_tolerance.html



**Description**


Compute the coefficients of a polynomial expansion using orthogonal matching pursuit (OMP). Orthogonal matching pursuit (OMP) is a greedy algorithm that is usefult when solving underdetermined linear systems.


