Advanced search

Found 3 essays matching the above criteria.

1. 1. Black Hole Dynamics in Stellar Clusters

   University essay from Lunds universitet/Institutionen för astronomi och teoretisk fysik - Genomgår omorganisation; Lunds universitet/Astronomi - Genomgår omorganisation

   Author : Markus Strickert; [2022]
   Keywords : Black Holes; Globular Clusters; Dynamics; Intermediate-mass black holes; Simulations; Physics and Astronomy;

   Abstract : Star clusters can harbour many exotic objects, including black holes (BHs), X-ray binaries and blue straggler stars. In dense stellar environments like globular clusters (GCs), two-body relaxation drives their dynamical evolution, where gravitational interactions between stars strive to equalize their kinetic energy in the cluster. READ MORE

3. 2. Making Hypervelocity Stars

   University essay from Lunds universitet/Astronomi - Genomgår omorganisation

   Author : Frans Forsberg; [2020]
   Keywords : Stellar Dynamics; Binary Stars; Galactic Centre; Binary Relaxation; Physics and Astronomy;

   Abstract : In this thesis, I investigate if the binaries that are being tidally disrupted by means of the Hills mechanism, producing hypervelocity stars, could have been transported to the galactic centre by two-body scattering. To survive a scattering event, the binary must be hard, meaning that the binding energy of the binary is higher than the kinetic energy of the collider. READ MORE

4. 3. Recovery of primal solutions from dual subgradient methods for mixed binary linear programming; a branch-and-bound approach

   University essay from Göteborgs universitet/Institutionen för matematiska vetenskaper

   Author : Pauline Aldenvik; Mirjam Schierscher; [2015-10-06]
   Keywords : Branch-and-bound method; subgradient method; Lagrangian dual; recovery of primal solutions; ergodic sequence; mixed binary linear programming; set covering; facility location;

   Abstract : The main objective of this thesis is to implement and evaluate a Lagrangian heuristic and a branch-and-bound algorithm for solving a class of mathematical optimization problems called mixed binary linear programs. The tests are performed on two different types of mixed binary linear programs: the set covering problem and the (uncapacitated as well as capacitated) facility location problem. READ MORE