mhtirogla
Home
Systems
API
Pricing
About
Log in
← Back
Home
›
Systems
›
Simulation and scientific computing
multiphysics
coupled multiphysics simulation
COMSOL, preCICE
System
Techniques · 18
Primitives · 31
multiphysics
Halo exchange
distributed · medium: Each rank stores its block plus a border copy of its neighbours' edge cells, refreshed by small messages every step; communication scales with block surface, not volume.
›
B rep topology
geometry · medium: Boundary representation: solids as shells, faces, loops, edges and vertices with geometry attached
Delaunay triangulation
geometry · medium: Bowyer-Watson and incremental flips; maximizes minimum angles, dual of Voronoi
Solid boolean operations
geometry · medium: Union, intersection and difference of solids: classify, split and merge faces robustly
Graph partitioning
graphs · medium: Split a graph into k balanced parts with few edges between them; multilevel coarsen-partition-refine (METIS, KaHIP) for quality, streaming heuristics (LDG, Fennel) for one-pass scale.
›
Conservative regridding
numerics · medium: Remap fields between grids preserving integrals, using overlap areas (first and second order)
Continuation methods
numerics · medium: Homotopy and source or gmin stepping to make Newton converge from a far start
Sparse matrices (CSR)
numerics · low: Compressed sparse row stores only nonzeros as row pointers, column indices and values; SpMV streams them once, so it is memory-bandwidth bound.
›
Newton root finding
numerics · low: Linearize at the guess and jump to the tangent root; quadratic convergence near a simple root, made robust by brackets (1D) or line search.
›
Unstructured mesh representation
numerics · low: Cell-face-node connectivity in CSR form for FEM and FVM meshes; partition-friendly ordering
Stiff solvers (implicit, BDF)
numerics · low: Implicit steps solve a small nonlinear system so fast decaying modes stay stable at any step size; BDF methods are the stiff-ODE workhorse.
›
k-d tree
geometry · low: A binary tree that splits k-dimensional points by one coordinate per level, giving fast nearest-neighbour and box queries on static low-dimensional data.
›
Collective communication
ml-training · low: The family of group exchanges (broadcast, reduce, all-gather, reduce-scatter, all-to-all) and the latency-plus-bytes cost model that picks ring, tree or direct algorithms by message size and topology.
›
Multigrid
numerics · low: Smooths high-frequency error on the fine grid and solves the smooth remainder on coarser grids; O(n) elliptic solves at any resolution.
›
Eager rendezvous protocol
distributed · low: MPI point-to-point: eager sends for small messages, rendezvous handshake for large ones
Rdma
networking · low: RDMA verbs over InfiniBand/RoCE: queue pairs, memory registration, one-sided ops
Zero-copy I/O
networking · low: Move bytes between files, sockets and NICs by passing page references instead of copying through user space: sendfile, splice, MSG_ZEROCOPY, kTLS.
›
Exact geometric predicates
geometry · low: Robust orient and incircle tests with adaptive-precision floats (Shewchuk) or exact arithmetic
Half edge mesh
graphics · low: Half-edge mesh connectivity for editable polygon meshes
Space filling curves
geometry · low: Z-order/Morton (geohash) and Hilbert curves mapping multi-dimensional points to sortable keys
Bounding volume hierarchy
physics · low: Binary tree of nested bounding boxes; prunes overlap and ray queries to O(log n) for any size distribution, and supports cheap insert/remove for moving objects.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
+ 11 more techniques
+ 15 more primitives
System
Techniques · 18
Primitives · 31
multiphysics
Halo exchange
distributed · medium: Each rank stores its block plus a border copy of its neighbours' edge cells, refreshed by small messages every step; communication scales with block surface, not volume.
›
B rep topology
geometry · medium: Boundary representation: solids as shells, faces, loops, edges and vertices with geometry attached
Delaunay triangulation
geometry · medium: Bowyer-Watson and incremental flips; maximizes minimum angles, dual of Voronoi
Solid boolean operations
geometry · medium: Union, intersection and difference of solids: classify, split and merge faces robustly
Graph partitioning
graphs · medium: Split a graph into k balanced parts with few edges between them; multilevel coarsen-partition-refine (METIS, KaHIP) for quality, streaming heuristics (LDG, Fennel) for one-pass scale.
›
Conservative regridding
numerics · medium: Remap fields between grids preserving integrals, using overlap areas (first and second order)
Continuation methods
numerics · medium: Homotopy and source or gmin stepping to make Newton converge from a far start
Finite elements
numerics · medium: Writes the PDE in weak form, approximates it with piecewise polynomials on a mesh and assembles a sparse system; handles any geometry.
›
Fmi co simulation
numerics · medium: Couple simulation units (FMUs) with a master algorithm: step negotiation, rollback, algebraic loops
Gmres
numerics · medium: GMRES with restarts: Arnoldi, Givens rotations, for nonsymmetric sparse systems
Incomplete factorization preconditi…
numerics · medium: Sparse approximate LU or Cholesky factors (ILU, IC) that precondition Krylov solvers: fewer iterations than Jacobi, less memory than a direct solve.
›
Level set methods
numerics · medium: Implicit surfaces as signed distance fields: advection, reinitialization, fast marching
Sparse direct solver
numerics · medium: Solve sparse Ax = b exactly by reordering, symbolic analysis, numeric LLᵀ/LU and triangular solves; fill-in, not flops per entry, decides the cost.
›
Nurbs
geometry · medium: B-splines and NURBS curves and surfaces: knot vectors, de Boor evaluation, knot insertion
Polygon clipping
geometry · medium: Polygon intersection/union/difference (Weiler-Atherton, Martinez) for spatial predicates
Surface surface intersection
geometry · medium: Intersect parametric surfaces by marching with subdivision and Newton refinement
Fill-reducing ordering
numerics · medium: Permute a sparse symmetric matrix before Cholesky/LU so the factor has few new nonzeros; minimum degree, nested dissection and RCM trade quality, speed and parallelism.
›
Flux limiters upwinding
numerics · medium: Upwind schemes, TVD flux limiters, MUSCL and Riemann solvers for shock-capturing advection
Sparse matrices (CSR)
numerics · low: Compressed sparse row stores only nonzeros as row pointers, column indices and values; SpMV streams them once, so it is memory-bandwidth bound.
›
Newton root finding
numerics · low: Linearize at the guess and jump to the tangent root; quadratic convergence near a simple root, made robust by brackets (1D) or line search.
›
Unstructured mesh representation
numerics · low: Cell-face-node connectivity in CSR form for FEM and FVM meshes; partition-friendly ordering
Stiff solvers (implicit, BDF)
numerics · low: Implicit steps solve a small nonlinear system so fast decaying modes stay stable at any step size; BDF methods are the stiff-ODE workhorse.
›
k-d tree
geometry · low: A binary tree that splits k-dimensional points by one coordinate per level, giving fast nearest-neighbour and box queries on static low-dimensional data.
›
Collective communication
ml-training · low: The family of group exchanges (broadcast, reduce, all-gather, reduce-scatter, all-to-all) and the latency-plus-bytes cost model that picks ring, tree or direct algorithms by message size and topology.
›
Multigrid
numerics · low: Smooths high-frequency error on the fine grid and solves the smooth remainder on coarser grids; O(n) elliptic solves at any resolution.
›
Eager rendezvous protocol
distributed · low: MPI point-to-point: eager sends for small messages, rendezvous handshake for large ones
Rdma
networking · low: RDMA verbs over InfiniBand/RoCE: queue pairs, memory registration, one-sided ops
Zero-copy I/O
networking · low: Move bytes between files, sockets and NICs by passing page references instead of copying through user space: sendfile, splice, MSG_ZEROCOPY, kTLS.
›
Exact geometric predicates
geometry · low: Robust orient and incircle tests with adaptive-precision floats (Shewchuk) or exact arithmetic
Half edge mesh
graphics · low: Half-edge mesh connectivity for editable polygon meshes
Space filling curves
geometry · low: Z-order/Morton (geohash) and Hilbert curves mapping multi-dimensional points to sortable keys
Bounding volume hierarchy
physics · low: Binary tree of nested bounding boxes; prunes overlap and ray queries to O(log n) for any size distribution, and supports cheap insert/remove for moving objects.
›
d-ary heap
data-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.
›
PRNGs (PCG, xoshiro)
numerics · low: Small, fast, statistically strong non-cryptographic generators: PCG32 and xoshiro256**, with seeding, parallel streams and unbiased ranges.
›
R-tree
geometry · low: A balanced tree of nested bounding boxes that indexes rectangles and points, answering window and nearest-neighbour queries by pruning whole subtrees.
›
Spherical grids
numerics · low: Lat-lon, cubed-sphere and icosahedral grids for global models; pole and area issues
Adaptive Runge-Kutta (Dormand-Princ…
numerics · low: An embedded 5(4) Runge-Kutta pair estimates each step's error for free and resizes the step to meet a tolerance; the default non-stiff solver.
›
LU and Cholesky factorization
numerics · low: Factor A = PLU (any square matrix, partial pivoting) or A = LLᵀ (SPD) once in O(n³), then solve each right-hand side in O(n²).
›
Conjugate gradient
numerics · low: Krylov iteration for symmetric positive definite Ax = b using one matrix-vector product and two dot products per step; converges in about √κ iterations.
›
Gaussian quadrature
numerics · low: Approximate an integral by a weighted sum of n function values at roots of orthogonal polynomials; exact for polynomials up to degree 2n-1.
›
Calling conventions abi
compilers · low: System V, Windows x64 and AAPCS64 ABIs: argument registers, stack frames, struct passing, FFI
Spline interpolation
numerics · low: Linear, bilinear/trilinear and cubic spline interpolation on grids and tables
Finite differences
numerics · low: Replace derivatives with weighted differences of grid values; simple stencils plus a stability condition (CFL) turn PDEs like heat, advection and waves into array loops.
›
Runge-Kutta 4
numerics · low: The classic four-stage, fourth-order ODE step; error drops 16× when the step halves, with no derivatives or past steps needed.
›
Bézier curves
graphics · low: Smooth curves defined by 3-4 control points, evaluated and split with repeated linear interpolation (de Casteljau) and flattened to lines with a closed-form segment count.
›
Point in polygon
geometry · low: Ray-casting/winding tests and indexed polygon lookup for reverse geocoding
Interval arithmetic
numerics · low: Rigorous bounds with outward rounding; root isolation and robust geometric tests
Explicit Euler
numerics · low: Step an ODE forward by its current slope, y += h·f(t, y); first-order, one evaluation per step, the baseline every other integrator is measured against.
›
Thomas tridiagonal solver
numerics · low: O(n) tridiagonal linear solve used in implicit finite-difference and spline schemes
Copy for AI
Similar systems
Share the most building blocks with this one.
cfd-fem-solver
50 %
structural-fem
38 %
electromagnetics-sim
38 %
reservoir-sim
38 %
topology-optimization
36 %