MetaCalculus Optimization Broadcast (MOB) Searching

The advent of multi-core chips opens up the potential for MetaCalculus parallel processing via optimization broadcasting. These examples simulate MOB using sequential FIND statements for the same models, with an unconstrained solver Hera, and two constrained solvers Jupiter and Thor.

These simple test problems provide the merest glimpse of the potential for the future MOB version of MetaCalculus (MC9), in which a single FIND statement will unleash a swarm of many solvers simultaneously from many different starting points. Upon locating extema, such solvers will spawn secondary MetaCalculus utilities which will back away from the extrema and march equality constraints around them to map the surface contours.