Meta modelling¶
General classes¶
| 
 | Base class for metamodel algorithms. | 
| 
 | Data structure containing a metamodel. | 
| 
 | Scores a metamodel in order to perform its validation. | 
Parametric¶
Taylor approximation¶
Refer to Taylor expansion.
| 
 | First order polynomial response surface by Taylor expansion. | 
| 
 | Second-order Taylor expansion. | 
Least squares approximation¶
| 
 | First order polynomial response surface by least squares. | 
| 
 | Second order polynomial response surface by least squares. | 
Linear model algorithm¶
Main classes¶
| 
 | Class used to create a linear regression model. | 
| 
 | Result of a LinearModelAlgorithm. | 
| 
 | Stepwise linear model algorithm. | 
Post-processing¶
| 
 | Analyse a linear model. | 
| Validate a linear regression metamodel. | 
Generalized Linear Model algorithm¶
| 
 | Algorithm for the evaluation of general linear models. | 
| 
 | General linear model result. | 
Gaussian Process Regression¶
Main classes¶
| Gaussian process regression algorithm. | |
| Fit gaussian process models | |
| Gaussian process regression (aka kriging) result. | |
| Gaussian process fitter result. | |
| Conditional covariance post processing of a Gaussian Process Regression result. | |
| GaussianProcessRandom vector, a conditioned Gaussian process. | 
Construction of the regression basis¶
| 
 | Basis factory base class. | 
| 
 | Constant basis factory. | 
| 
 | Linear basis factory. | 
| 
 | Quadratic basis factory. | 
Functional chaos expansion¶
Main classes¶
| 
 | Functional chaos algorithm. | 
| 
 | L2 approximation on an orthonormal basis using least-squares and a fixed basis. | 
| 
 | L2 approximation on an orthonormal basis using least-squares and a fixed basis. | 
Construction of the truncated multivariate orthogonal basis¶
| 
 | Base class for the construction of the truncated multivariate orthogonal basis. | 
| 
 | Cleaning truncation strategy. | 
| 
 | Fixed truncation strategy. | 
Projection method¶
| 
 | Base class for the evaluation strategies of the approximation coefficients. | 
| 
 | Integration strategy for the approximation coefficients. | 
| 
 | Least squares strategy for the approximation coefficients. | 
Least squares algorithms to compute the coefficients¶
| 
 | Approximation algorithm. | 
| Approximation algorithm factory base class. | |
| Penalized least squares algorithm factory. | |
| Penalized least squares algorithm. | |
| Least squares metamodel selection factory. | |
| Least squares metamodel selection factory. | 
Model selection algorithm¶
| 
 | Basis sequence factory. | 
| 
 | Least Angle Regression. | 
Model selection criteria¶
| 
 | Fitting algorithm. | 
| 
 | Corrected leave one out. | 
| 
 | K-fold. | 
Least Squares problem resolution¶
Refer to Least squares problems numerical methods.
| 
 | Base class for least square solvers. | 
| 
 | Least squares solver using Cholesky decomposition. | 
| 
 | Least squares solver using SVD decomposition. | 
| 
 | Least squares solver using the QR decomposition. | 
| 
 | Least squares solver using a sparse representation. | 
| 
 | Design matrix cache. | 
Results¶
| 
 | Functional chaos random vector. | 
| 
 | Functional chaos result. | 
| 
 | Sensitivity analysis based on functional chaos expansion. | 
| Validate a functional chaos metamodel. | 
Functional chaos on fields¶
| Functional metamodel algorithm based on chaos decomposition. | |
| 
 | Functional metamodel result. | 
| Sobol indices from a functional decomposition. | |
| Functional metamodel algorithm based on chaos decomposition. | 
 OpenTURNS
      OpenTURNS