Search Results for "minimal linux"

Swift Numerics is a foundational library that extends the Swift standard library with essential numerical protocols, types, and functions needed for scientific and systems programming. It defines generic abstractions over real and complex numbers so algorithms can be written once and work across concrete floating-point types. The package includes RealModule utilities and a full Complex type with the expected arithmetic and transcendental functions, bridging a long-standing gap for numerics...

Napkin (also titled “An Infinitely Large Napkin”) is a lightweight, semi-formal introduction to higher mathematics, aimed at giving readers a bird’s-eye view over various mathematical fields. It is not a polished textbook full of full proofs; rather it offers clean definitions, theorem statements, intuitive motivations, and informal sketches of why things work, with the goal of building conceptual understanding. The coverage spans undergraduate and early graduate topics, designed to show how...

Gato (Graph Animation Toolbox): Animate graph algorithms for example for computing shortest paths, minimal spanning trees, maximum flows or maximal cardinality or weight matchings. Create your own animations using the Animated Data Structures (ADS).

BioFVM is an open source diffusive transport solver for biological problems. It can solve for the diffusion of tens or hundreds of substrates on large 3-D domains. For simplicity, the code has minimal external dependencies. BioFVM was first published in: A. Ghaffarizadeh, S.H. Friedman, and P. Macklin. BioFVM: an efficient, parallelized diffusive transport solver for 3-D biological simulations. Bioinformatics 32(8): 1156-8, 2016. DOI: 10.1093/bioinformatics/btv730 method...

MathFu is a small, header-only C++ math library optimized for games and real-time graphics on mobile and desktop. It provides fixed-size vector, matrix, and quaternion types with APIs that mirror the operations you actually use in inner loops—dot, cross, normalize, transforms, and projections. Implementations are carefully tuned to leverage SIMD instruction sets such as SSE and NEON while preserving a clean fallback path for portability. Because types are fixed at compile time, the compiler...

https://github.com/thibaultduponchelle/nanoturing

Ariel is an implementation of the quadratic sieve in Java. Ariel is simple to use and requires minimal knowledge of the sieve's mechanisms for factorizations.

Simple Java Graph is a minimal matrix- and listbased graph implementation. An AStar search algorithm is also available.