dahlem/sa_sphere
Use simulated annealing to put a configurable number of points evenly spaced on a sphere.
Project that implements a number of solvers using GSL and BLAS, including Cholesky decomposition with Cholesky-Crout reduction, conjugate gradient, Gaussian elimination, Jacobi iteration, LU decomposition with Crout reduction, Jacobi-preconditioned conjugate gradient, QR decomposition, Seidel iteration, steepest descent, and forward/backward substitution. This project was done as part of some course work of the High-Performance Computing M.Sc. at Trinity College Dublin.
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
Use simulated annealing to put a configurable number of points evenly spaced on a sphere.
A HPC framework for genetic algorithms implemented in C using MPI.
Implementation of a high-performance queuing simulator for adaptive task assignment problems using reinforcement learning control strategies (based on my PhD work).
This project implements Lempel-Ziv parsing and encoding of input sequences. This can be used to compress a sequence using a dictionary that is created online.