Base objects¶
Combinatorial structures¶
|
Bipartite red/black graph. |
Domains¶
|
Base class for domain objects. |
|
Level set. |
|
Adaptor to convert a Mesh to a Domain. |
|
Creation of mesh of box type. |
|
Regular Grid. |
|
Numerical interval. |
|
Creation of mesh of box type. |
|
Complement of a Domain. |
|
A Domain representing the intersection of two Domain. |
|
A Domain representing the union of two Domain. |
|
A Domain representing the disjunctive union of two Domain. |
|
A Domain representing the difference of two Domain. |
|
Mesh. |
Matrices¶
|
Real rectangular matrix. |
|
Complex Matrix. |
|
Correlation Matrix. |
|
Covariance (real symmetric positive definite) matrix. |
|
Hermitian Matrix. |
|
Identity matrix. |
|
Real square matrix. |
|
Complex square matrix. |
|
Real symmetric matrix. |
|
Hermitian Matrix. |
|
Hermitian Matrix. |
|
Parameters for HMatrix class. |
|
Empty HMatrix builder. |
|
Hierarchical matrices. |
Tensors¶
|
Tensor. |
|
Complex tensor. |
|
Symmetric tensor. |
Vectors¶
|
Proxy of C++ OT::BoolCollection class. |
|
Collection of strings. |
|
Collection of unsigned integers. |
|
Fixed size collection of Indices. |
|
Real vector. |
|
Collection of real values with a description for each component. |
|
Collection. |
|
Collection. |
Comparison operators¶
|
Base class for comparison operators. |
|
Equal comparison operator. |
|
Greater comparison operator. |
|
Greater or equal comparison operator. |
|
Less comparison operator. |
|
Less or equal comparison operator. |
Serialization¶
|
Study. |
|
Define the way OpenTURNS' objects are saved and reloaded. |
|
Storage manager that drives a XML file. |
|
Storage manager that drives a XML file for metadata and HDF5 binary file for sample data. |
History strategy¶
|
History storage strategy. |
|
Compact history storage strategy. |
|
Full history storage strategy. |
|
Last history storage strategy. |
|
Null history storage strategy. |
Spatial lookup¶
|
Nearest neighbour lookup. |
|
Partition tree data structure. |
|
Brute force algorithm for nearest-neighbour lookup. |
|
Partition tree data structure for 1D points. |
|
Partition tree data structure. |
|
Point location algorithm. |
|
Naive implementation of point location. |
|
Specialized point location algorithm on RegularGrid. |
|
Specialized point location algorithm for monotonic 1D meshes. |
|
Bounding Volume Hierarchy to speed-up point location. |
Iterative statistics¶
|
Iterative algoritm |
|
Iterative minimum and maximum. |
|
Iterative moments. |
|
Iterative threshold exceedance. |