![]() |
libgenua
Basic Geometry, Numerical Algorithms and Interfaces
|
![]() ![]() | Interface to Fortran-ARPACK |
![]() ![]() | |
![]() ![]() | C++ Declarations for Lapack routines |
![]() ![]() | |
![]() ![]() | Templated interface for linear solver |
![]() ![]() | STL-compatible aligned-memory allocator |
![]() ![]() | Interface to ARPACK |
![]() ![]() | Compute physical properties of the Standard Atmosphere |
![]() ![]() | Base class for objects which support hierarchical attribute sets |
![]() ![]() | Reuseable counting barrier |
![]() ![]() | Basic two-vertex edge object |
![]() ![]() | Basic linear triangle object |
![]() ![]() | Approximate sparse inverse for nonsymmetric problems |
![]() ![]() | Raw data block for binary files |
![]() ![]() | Node in binary file |
![]() ![]() | Binary blob |
![]() ![]() | Bounding box |
![]() ![]() | Axis-oriented Rectangle |
![]() ![]() | Bounding-box search tree |
![]() ![]() | Mesh container for visualization |
![]() ![]() | Boundary condition specification in cgns files |
![]() ![]() | Adds a Descriptor_t node at the current location in CGNS file |
![]() ![]() | CGNS file with a single base |
![]() ![]() | Sections, containing element data in CGNS files |
![]() ![]() | Flow solution node in CGNS file |
![]() ![]() | Zone in a cgns file |
![]() ![]() | Index container for triangle/line/quad strips/fans |
![]() ![]() | Simple color class for visualization |
![]() ![]() | Condition variable |
![]() ![]() | Configuration Parser |
![]() ![]() | Container for connectivity data |
![]() ![]() | Solve in another precision |
![]() ![]() | Craig's method for under-determined systems |
![]() ![]() | Compressed-row sparse matrix |
![]() ![]() | Isomorphic multithreading using thread-specific context |
![]() ![]() | Interface to FFT interface in MKL |
![]() ![]() | Dimension search tree |
![]() ![]() | Matrix template |
![]() ![]() | 2D axis-aligned 2D bounding box expressed as a k-DOP |
![]() ![]() | Axis-aligned 3D bounding box expressed as a k-DOP |
![]() ![]() | Octahedral bounding volume in 3D |
![]() ![]() | 9-plane discrete polytope in 3D |
![]() ![]() | 16-plane discrete polytope in 4D |
![]() ![]() | Axis-aligned 4D bounding box expressed as a k-DOP |
![]() ![]() | Discrete oriented polytopes |
![]() ![]() | Heap-allocated array |
![]() ![]() | Dynamic tree for 2D triangles |
![]() ![]() | Triangle edge |
![]() ![]() | Cubic curve over edge |
![]() ![]() | Interface to sparse Cholesky solver |
![]() ![]() | Interface to sparse LU-decomposition |
![]() ![]() | Base class for mesh elements |
![]() ![]() | Edge of an element |
![]() ![]() | Auxilliary class used for type assembly |
![]() ![]() | Base class for mapping enums to strings |
![]() ![]() | Exception base class |
![]() ![]() | Triangular face |
![]() ![]() | Cap surface |
![]() ![]() | Node in FFA data file |
![]() ![]() | Base class for FFT library interfaces |
![]() ![]() | C++ Interface for FFTW3 |
![]() ![]() | Keep track of how many have been tagged |
![]() ![]() | Encodes 32bit floats to 16bit, with loss of range and precision |
![]() ![]() | Morton code for floating-point values |
![]() ![]() | Generator for random double-precision values |
![]() ![]() | Isomorphic fork-join multithreading (stack and queue) |
![]() ![]() | Isomorphic fork-join multithreading (stack) |
![]() ![]() | Task which forwards to a function object |
![]() ![]() | Simple task queue |
![]() ![]() | Gated Recurrent Unit |
![]() ![]() | Triangle-ray intersection according to Havel & Herout |
![]() ![]() | Dataset in HDF5 file |
![]() ![]() | Interface to HDF5 files |
![]() ![]() | Group in HDF5 file |
![]() ![]() | Location in a HDF5 file |
![]() ![]() | Hexahedral element with up to 20 nodes |
![]() ![]() | Object-oriented Mesh containing different elements |
![]() ![]() | Balanced binary tree using implicit references to content |
![]() ![]() | Generator for random integer values |
![]() ![]() | Buffer for i/o operations |
![]() ![]() | Thread task for iterations |
![]() ![]() | Line in euclidian space |
![]() ![]() | Line element with two vertices |
![]() ![]() | Line element with three vertices |
![]() ![]() | Linear NN layer |
![]() ![]() | Intersection of line and triangle |
![]() ![]() | Mutex-protected queue |
![]() ![]() | Lock-free task container |
![]() ![]() | Interface layer for monitoring long computations |
![]() ![]() | Redirect std::clog |
![]() ![]() | Task for parallel loops |
![]() ![]() | LSMR: Iterative solver for least-squares problems |
![]() ![]() | LSQR: Iterative solver for least-squares problems |
![]() ![]() | LU Decomposition |
![]() ![]() | LZ4 compressed binary stream |
![]() ![]() | Holds visualization data |
![]() ![]() | Create a plane slice through a triangular mesh |
![]() ![]() | N-dimensional Morton code |
![]() ![]() | Mutex |
![]() ![]() | Base class for annotated mesh objects |
![]() ![]() | A real-valued function taking element vertex indices as argument |
![]() ![]() | Element search tree for MxMesh |
![]() ![]() | Abstraction for runtime-typed, sparse storage in MxMeshField |
![]() ![]() | Function to compute maxmimum dihedral angle for tetrahedral elements |
![]() ![]() | Function to compute maxmimum skew angle for ideally parallel-sided elements |
![]() ![]() | Mesh with dissimilar elements |
![]() ![]() | Boundary conditions in mixed-element mesh |
![]() ![]() | Represent time-domain subspace mesh deformation |
![]() ![]() | Data fields on mixed-element meshes |
![]() ![]() | Section of a mixed-element mesh |
![]() ![]() | Container for slice through MxMesh |
![]() ![]() | Function to compute minimum dihedral angle for tetrahedral elements |
![]() ![]() | Mesquite adapter for the entire mesh |
![]() ![]() | Mesquite interface adapter for a single section |
![]() ![]() | Tree-based structure for multiple solutions in single MxMesh file |
![]() ![]() | Interface for streaming result fields to file immediately |
![]() ![]() | Function to test for tangled elements |
![]() ![]() | Element seach tree for deformation mapping |
![]() ![]() | Base class for N-diemsnional arrays |
![]() ![]() | Balanced binary tree for N-dimensional points |
![]() ![]() | Second-order two-stage SDIRK method |
![]() ![]() | Second-order three-stage SDIRK method |
![]() ![]() | Third-order four-stage SDIRK method |
![]() ![]() | Binary data stream |
![]() ![]() | Parallel filter |
![]() ![]() | Internal wrapper object for MKL PARDISO |
![]() ![]() | Interface to PARDISO solver from MKL |
![]() ![]() | Parallel loop construct |
![]() ![]() | A plane in three dimensions |
![]() ![]() | Comparator to sort points by coordinate |
![]() ![]() | Block of 16 points |
![]() ![]() | Point element with a single vertex |
![]() ![]() | Points on a rectangular grid |
![]() ![]() | Contiguously stored array of n-d points |
![]() ![]() | Interface for optionally preconditioned LSQR |
![]() ![]() | Integer hash table by Jeff Preshing |
![]() ![]() | Quadrilateral element with four vertices |
![]() ![]() | Quadrilateral element with eight vertices |
![]() ![]() | Quadrilateral element with nine vertices |
![]() ![]() | Quantizes floating-point values using 16-bit integers |
![]() ![]() | Morton order using quantized floating-point values |
![]() ![]() | Deprecated - use IterationTask or LoopTask instead |
![]() ![]() | Row/column index map |
![]() ![]() | Dimension search tree |
![]() ![]() | Reference Frame |
![]() ![]() | Rotation in space |
![]() ![]() | Wrapper for right preconditioning |
![]() ![]() | Bounding-rectangle search tree |
![]() ![]() | Simple cubic spline in one variable |
![]() ![]() | Scoped lock |
![]() ![]() | Change a scalar within a scope only |
![]() ![]() | Record time for the execution of a scoped block |
![]() ![]() | Base class for SDIRK integrators |
![]() ![]() | Interface for SDIRK integrators |
![]() ![]() | Line segment |
![]() ![]() | Two-level semaphore |
![]() ![]() | Shared pointer to vector |
![]() ![]() | Base class for vector types |
![]() ![]() | Fixed size matrix |
![]() ![]() | Base class for iterative methods developed by Stanford/SOL |
![]() ![]() | Encapsulation of pointer and size |
![]() ![]() | Sparse matrix of small blocks |
![]() ![]() | Helper object for the assembly of sparse matrices |
![]() ![]() | Interface for SPQR from Davis' SuiteSparse package |
![]() ![]() | Sparsity pattern counter based on hash table |
![]() ![]() | |
![]() ![]() | Spline Basis |
![]() ![]() | Utility to differentiate sparse matrix types |
![]() ![]() | Compressed-row matrix |
![]() ![]() | Base class for wrapper around SPOOLES |
![]() ![]() | Interface for SPOOLES sparse solver |
![]() ![]() | Sparse vector |
![]() ![]() | Dense-matrix interface for SDIRK integrators |
![]() ![]() | Binary data packet for streaming |
![]() ![]() | Compute streamlines on a discretized surface |
![]() ![]() | Fixed size vector |
![]() ![]() | Synchronized stream device |
![]() ![]() | System information |
![]() ![]() | Container for thread tasks |
![]() ![]() | Mechanism to wait for completion of a set of tasks |
![]() ![]() | Task-stealing thread pool |
![]() ![]() | Tetrahedral element with up to 10 nodes |
![]() ![]() | Handles a group of threads (boost, C++98) |
![]() ![]() | Group of threads |
![]() ![]() | Task for multithreaded processing |
![]() ![]() | Helper class for managing thread-local containers |
![]() ![]() | Geometric transformations |
![]() ![]() | Triangle element with three vertices |
![]() ![]() | Triangle element with six vertices |
![]() ![]() | Triangular surface |
![]() ![]() | Triangular face of a TriMesh |
![]() ![]() | Specialized triangular surface mesh |
![]() ![]() | Triangles sorted by Morton ordering |
![]() ![]() | Integer type code |
![]() ![]() | Context for calling UMFPACK |
![]() ![]() | Interface to direct sparse solver UMFPACK |
![]() ![]() | Helper class for importing files containing UNV dataset 58 |
![]() ![]() | Utility class for wave drag estimation |
![]() ![]() | Simple wallclock timing |
![]() ![]() | Last-in, first-out task stack |
![]() ![]() | XML Element |
![]() ![]() | Creates a new YAML document |
![]() ![]() | Creates a new YAML map |
![]() ![]() | Creates a new YAML sequence |
![]() ![]() | Minimal frontend to zlib |