Bitpit
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
|
| Stable release | 1.9.0 / December 31st 2023
|
|---|---|
| Repository | |
| Written in | C++ |
| Operating system | Linux |
| Type | simulation software |
| License | GNU Lesser General Public License |
| Website | http://bitpit.it |
bitpit[1] is an open source modular library for scientific computing. The goal of bitpit is to ease the burden of writing scientific programs providing the common building blocks needed by every scientific application.
Each module of the bitpit library is developed to address a specific aspect of real-life application development. Modules can be used as building blocks to quickly develop a high-performance scientific application. The library consists of several modules ranging from low level functionalities like algebraic operators to high level functionalities like the evaluation of distance functions on computational meshes.
Features and modules[edit]
Features and the modules of bitpit include:
- Cartesian and unstructured volume and surface meshes
- Parallel linear quadtree/octree with load balancing and 2:1 balancing (PABLO [2][3][4][5][6][7][8][9][10] - PArallel Balanced Linear Octree)
- Basic container object for different types of meshes (surface and volume) which allows the concomitant use of more than one mesh at the same time
- Methods for the evaluation of signed and unsigned distance functions from generic objects immersed in a computational mesh
- Basic algebraic operators (Addition, subtraction, multiplication, division), mathematical functions (dot product, cross product, norm, absolute value), stream operators and display functions for some of the Standard Template Library (STL) containers
- A collection of useful containers for scientific applications.
- binary buffers for parallel data exchange and high level methods for handling MPI parallel communications.
- methods for reading and writing common data files, like DGF (Dune Grid Format), STL (STereo Litography) and VTK (Visualization ToolKit) files, and for handling logfiles.
- tools for handling and solving small dense linear systems.
- Radial Basis Function interpolation and parametrization even with large set of nodes.
- Sorting algorithms (LIFO, kd-tree, and binary tree)
- A computational geometry methods collection
See also[edit]
References[edit]
- ^ H. Telib, bitpit: a numerical sandpit for bridging scientific computing and industrial applications, Abstract, SISSA Trieste, Tuesday, 23 September 2014
- ^ M. Cisternino, A. Iollo, L. Weynans, A. Colin, P. Poulin. Electrostrictive materials: modelling and simulation , in: 7 th European Congress on Computational Methods in Applied Sciences and Engineering, Hersonissos, Greece, ECCOMAS, June 2016. Abstract
- ^ M. Cisternino, E. Lombardi, PABLO - Open source PArallel Balanced Linear Octree, an industrial tool for scientific computing. JDEV 2015, Bordeaux, France. Poster
- ^ H.Telib, M. Cisternino, V. Ruggiero, F. Bernard, RAPHI: Rarefied Flow Simulations on Xeon Phi Architecture, SHAPE White Papers, PRACE Download
- ^ Project Team MEMPHIS - INRIA, Activity Report 2016, Bordeaux,France. Paper
- ^ A. Raeli, A. Azaïez, M. Bergmann, A. Iollo. Numerical Modelling for Phase Change Materials. CANUM, May 2016, Obernai, France. Presentation
- ^ F. Tesser, Discretization of the Laplacian operator using a multitude of overlapping cartesian grids, Sessions, EuroSciPy 2016, Erlangen, Germany
- ^ F. Bernard, A. Iollo, S. Riffaud. Reduced-order model for the BGK equation based on POD and optimal transport, Journal of Computational Physics, Elsevier, 2018, 373, pp.545-570 [1]
- ^ F. Bernard, A. Iollo, G. Puppo. BGK Polyatomic Model for Rarefied Flows, Journal of Scientific Computing, Springer Verlag, 2019, 78(3) [2]
- ^ E. Abbate, A. Iollo, G. Puppo. An asymptotic-preserving all-speed scheme for fluid dynamics and non linear elasticity, SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2019 [3]