Boost C++ Libraries
From MaRDI portal
Software:16271
swMATH4084MaRDI QIDQ16271FDOQ16271
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- High Performance Rearrangement and Multiplication Routines for Sparse Tensor Arithmetic
- Fast and accurate algorithm for the generalized exponential integral \(E_{\nu}(x)\) for positive real order
- A language for generic programming in the large
- Extracting unsatisfiable cores for LTL via temporal resolution
- Translating lambda calculus into C++ templates
- The mimetic methods toolkit: an object-oriented API for mimetic finite differences
- A new open-source software developed for numerical simulations using discrete modeling methods
- The \texttt{deal.II} library, version 9.4
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- A High-Order Method for Weakly Compressible Flows
- Enhancing unsatisfiable cores for LTL with information on temporal relevance
- Sequential Bayesian model selection of regular vine copulas
- ViennaCL-linear algebra library for multi- and many-core architectures
- Sparse group Lasso and high dimensional multinomial classification
- Efficient Expression Templates for Operator Overloading-Based Automatic Differentiation
- To CG or to HDG: A comparative study
- Verified Computations for Hyperbolic 3-Manifolds
- Modular SIMD arithmetic in M <scp>athemagix</scp>
- A generic exact solver for vehicle routing and related problems
- Feel++ : A computational framework for Galerkin Methods and Advanced Numerical Methods
- The stability of barycentric interpolation at the Chebyshev points of the second kind
- Concepts for High-Perfomance Scientific Computing
- \textsc{OpenCL} based parallel algorithm for RBF-PUM interpolation
- Computational Methods for Physicists
- Computing the Lambert \(W\) function in arbitrary-precision complex interval arithmetic
- Laissez-Faire Caching for Parallel #SAT Solving
- On the effectiveness of the genetic paradigm for polygonization
- Hierarchical multigrid approaches for the finite cell method on uniform and multi-level \(h p\)-refined grids
- Certifying feasibility and objective value of linear programs
- Heuristics for the mixed swapping problem
- The supporting hyperplane optimization toolkit for convex MINLP
- Design and evaluation of C++ open multi-methods
- Programming with C++ concepts
- On the impact of the migration topology on the island model
- On the performance of exponential integrators for problems in magnetohydrodynamics
- A New Directional Algebraic Fast Multipole Method Based Iterative Solver for the Lippmann-Schwinger Equation Accelerated with HODLR Preconditioner
- Efficient Random-Walk Methods for Approximating Polytope Volume
- SIMPLE AND EFFECTIVE C++ MATRIX–VECTOR LIBRARY FOR NONPROFESSIONALS IN COMPUTER SCIENCE
- Unsymmetric multi-level hanging nodes and anisotropic polynomial degrees in \(H^1\)-conforming higher-order finite element methods
- Dynamic algorithm selection for runtime concepts
- Scheduling arc maintenance jobs in a network to maximize total flow over time
- A computable criterion for the existence of connecting orbits in autonomous dynamics
- GEMSFIT: a generic fitting tool for geochemical activity models
- \textsc{BAL}: a library for the \textit{brute-force} analysis of dynamical systems
- Direct Function Evaluation versus Lookup Tables: When to Use Which?
- A generic topology library
- Algorithm 947
- Unified form language
- Title not available (Why is that?)
- Adaptive spectral solution method for the Landau and Lenard-Balescu equations
- The design of the Boost interval arithmetic library
- Training effective node classifiers for cascade classification
- A locking-free meshfree method for the simulation of shear-deformable plates based on a mixed variational formulation
- On design and implementation of a generic number type for real algebraic number computations based on expression dags
- France Telecom workforce scheduling problem: a challenge
- Nektar++: an open-source spectral/\(hp\) element framework
- Complex-shaped beam element and graph-based optimization of compliant mechanisms
- Data Clustering in C++
- Efficient Verified Implementation of Introsort and Pdqsort
- A resistive magnetohydrodynamics solver using modern C++ and the Boost library
- Parallel implementation of a Lagrangian-based model on an adaptive mesh in C++: application to sea-ice
- An improved multiobjective shortest path algorithm
- 2CoBel: a scalable belief function representation for 2D discernment frames
- Enumeration of 2-level polytopes
- Fast method of approximate particular solutions using Chebyshev interpolation
- HyPAM: A hybrid continuum-particle model for incompressible free-surface flows
- Optimizations in computing the Duquenne-Guigues basis of implications
- Error-correcting neural networks for two-dimensional curvature computation in the level-set method
- Machine learning algorithms for three-dimensional mean-curvature computation in the level-set method
- Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation
- TC++: first-principles calculation code for solids using the transcorrelated method
- Kaskade 7 -- a flexible finite element toolbox
- Motion planning algorithms for the Dubins Travelling Salesperson Problem
- Non-replicability circumstances in a neural network model with Hodgkin-Huxley-type neurons
- Modelling of a two-phase vortex-ring flow using an analytical solution for the carrier phase
- Parallel fast isogeometric L2 projection solver with Galois system for 3D tumor growth simulations
- An isotropic unstructured mesh generation method based on a fluid relaxation analogy
- A new constraint-based formulation for hydrodynamically resolved computational neuromechanics of swimming animals
- Multi-level adaptive particle refinement method with large refinement scale ratio and new free-surface detection algorithm for complex fluid-structure interaction problems
- Dynamics of locally coupled agents with next nearest neighbor interaction
- Functional programming framework for \textit{GRworkbench}
- A Parallel Implementation of the Mortar Element Method in 2D and 3D
- Discontinuous Galerkin method on three-dimensional tetrahedral grids. The use of template metaprogramming of the C++ language
- IGA-ADS: isogeometric analysis FEM using ADS solver
- Title not available (Why is that?)
- Model-based quantification of left ventricular diastolic function in critically ill patients with atrial fibrillation from routine data: a feasibility study
- A parallel bio-inspired shortest path algorithm
- Verification of the Jones unknot conjecture up to 22 crossings
- \texttt{Tusas}: a fully implicit parallel approach for coupled phase-field equations
- A Distributed Interior-Point KKT Solver for Multistage Stochastic Optimization
- Productivity, performance, and portability for computational fluid dynamics applications
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures
- Using a template engine as a computer algebra tool
- Sequential and Parallel Algorithms and Data Structures
- A census of hyperbolic Platonic manifolds and augmented knotted trivalent graphs
- Parallelization of the multi-level \(hp\)-adaptive finite cell method
- Dynamic Matching Algorithms in Practice
- Multiprecision Algorithms for Computing the Matrix Logarithm
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- Title not available (Why is that?)
This page was built for software: Boost C++ Libraries