libefgy is a set of C++ headers containing lots of templates loosely related to maths. The headers include templates for fractional arithmetic, big integers (and thus "big fractions"), calculating π, e, and some calculations with those (for trigonometrics), matrix manipulations, tuples, polar and Euclidian spaces in arbitrary dimensions, (perspective) projections, colour space manipulations in RGB and HSL, and assorted other things.
LibBi is used for state-space modelling and Bayesian inference on high-performance computer hardware, including multi-core CPUs, many-core GPUs (graphics processing units), and distributed-memory clusters. The staple methods of LibBi are based on sequential Monte Carlo (SMC), also known as particle filtering. These methods include particle Markov chain Monte Carlo (PMCMC) and SMC2. Other methods include the extended Kalman filter and some parameter optimization routines. LibBi consists of a C++ template library and a parser and compiler, written in Perl, for its own modelling language.
GTKMathplot is an interactive plotting program based on GTK+ and the Cairo graphics library. It can display bidimensional curves, tridimensional curves, and surfaces from Cartesian or parametric equations describing the mathematical objects you would like to visualize. It is designed to be intuitive for high school students with good mathematical knowledge. University students of engineering, physics, mathematics, or natural sciences should need no explanation at all to start using it proficiently.
QMentat helps you practice mental arithmetic. It uses arbitrary-length fixed point arithmetic, and can handle any size numbers, only limited by the size of your screen (and in the case of division with an integer result, the speed at which the number can be factored). It is also quite configurable, allowing you to tailor the questions to your needs.
SCaVis is an environment for scientific computation, data analysis, and data visualization designed for scientists, engineers, and students. The program can be used for function and data plotting in 2D and 3D, histograms, statistical analysis, and symbolic calculations using the Matlab/Octave high-level interpreted language.
librsb is a library for sparse matrix computations featuring the Recursive Sparse Blocks (RSB) matrix format. This format allows cache-efficient and multithreaded (that is, shared memory parallel) operations on large sparse matrices. The most common operations necessary to iterative solvers are available (matrix-vector multiplication, triangular solution, rows/columns scaling, diagonal extraction/setting, blocks extraction, norm computation, formats conversion). The RSB format is especially well-suited for symmetric and transposed multiplication variants. On these variants, librsb has been found to be faster than Intel MKL's implementation for CSR. Most numerical kernels code is auto-generated, and the supported numerical types can be chosen by the user at buildtime. librsb implements the Sparse BLAS standard, as specified in the BLAS Forum documents.
LifeV is a finite element (FE) library providing implementations of state of the art mathematical and numerical methods. It serves both as a research and production library. It has already been used in medical and industrial contexts to simulate fluid structure interaction and mass transport. LifeV is the joint collaboration between four institutions: École Polytechnique Fédérale de Lausanne (CMCS) in Switzerland, Politecnico di Milano (MOX) in Italy, INRIA (REO, ESTIME) in France, and Emory University (Sc. Comp) in the U.S.A.
safe numerics provides safe integer operations for C++ integers. Arithmetic operations in C++ are not guaranteed to yield the correct mathematical result. The feature is inherited from the early days of C, when the behavior of int, unsigned int, and others were designed to map closely to the underlying hardware. These types can silently overflow or change sign. This library contains drop-in replacements for the standard C types which throw exceptions whenever invalid operations occur.