libtrilinos-moertel-13.2

mortar methods package - runtime files

This package supplies capabilities for nonconforming mesh tying and contact formulations in 2 and 3 dimensions using Mortar methods. Mortar methods are a type of Lagrange Multiplier constraint that can be used in contact formulations and in non-conforming or conforming mesh tying as well as in domain decomposition techniques. Originally introduced as a domain decomposition method for spectral elements, Mortar methods are used in a large class of nonconforming situations such as the surface coupling of different physical models, discretization schemes or non-matching triangulations along interior interfaces of a domain.

llvm-17

Modular compiler and toolchain technologies

LLVM is a collection of libraries and tools that make it easy to build compilers, optimizers, just-in-time code generators, and many other compiler-related programs.

libtrilinos-muelu-13.2

next generation multilevel preconditioner capabilities - runtime files

MueLu is designed to solve large sparse linear systems of equations arising from PDE discretizations. MueLu provides easy-to-use multigrid solvers and preconditioners based on smoothed aggregation algorithms. As a multigrid framework, MueLu supports the design of highly application specific multigrid preconditioners.

libtrilinos-optipack-13.2

Trilinos optimization algorithms - runtime files

The OptiPack package contains interfaces and concrete implementations of some basic optimization algorithms based on Thyra. The globalization methods used are implemented in GlobiPack.

llvm-17-examples

Modular compiler and toolchain technologies, examples

LLVM is a collection of libraries and tools that make it easy to build compilers, optimizers, just-in-time code generators, and many other compiler-related programs.

python3-mrgingham

Chessboard finder for visual calibration routines

Given an observed image containing a chessboard or a grid of circles, mrgingham locates the board in the image, and precisely computes the location of the chessboard corners (or circle centers). This is similar to the routines in OpenCV, but is faster and more robust.