Skip to content
View aidancoleman's full-sized avatar
  • Trinity College Dublin
  • 20:32 (UTC -12:00)

Block or report aidancoleman

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Popular repositories Loading

  1. Gibbs-Sampler Gibbs-Sampler Public

    Gibbs Sampling code in R for data generated by two linear regression regimes with a changepoint at time tau

  2. Bayesian-Frequentist-Retrospective-Changepoint-Detection Bayesian-Frequentist-Retrospective-Changepoint-Detection Public

    Simulated data in R, with a structural break in mean and variance. Gibbs sampling is implemented to detect this changepoint and estimate model parameters.

  3. Parallel-Communication-Avoiding-QR-Factorization-for--Tall--Skinny--Matrices Parallel-Communication-Avoiding-QR-Factorization-for--Tall--Skinny--Matrices Public

    Avoiding thread communication in determining QR factorizations for matrices with #rows >> #columns

    Jupyter Notebook

  4. Krylov-Subspace-Methods--Arnoldi---GMRES--w--and-without-parallelism- Krylov-Subspace-Methods--Arnoldi---GMRES--w--and-without-parallelism- Public

    Approximating (least squares) solutions to systems of the form Ax = b for arbitrarily large and sparse A with Krylov subspace methods.

    Jupyter Notebook

  5. European-Option-Pricing-Monte-Carlo-Model- European-Option-Pricing-Monte-Carlo-Model- Public

    Algorithm to price European Call and Put Options given volatility input, Monte Carlo sample size, time to expiry, and strike price.

    C

  6. Conjugate-Residual-Algorithm-for-solving-Sparse-Dense-Linear-Systems Conjugate-Residual-Algorithm-for-solving-Sparse-Dense-Linear-Systems Public

    Using the Conjugate Residual method to tackle sparse and dense linear solver problems. I look at a serial variant of the conjugate gradient algorithm to tackle the unit square (2D) poisson problem …

    Jupyter Notebook